pair<T, S> operator-(const pair<T, S> &x, const pair<T, S> &y) { return pair<T, S>(x.fi - y.fi, x.se - y.se); }\ntemplate <class T, class S> pair<T, S> operator+(const pair<T, S> &x, const pair<T, S> &y) { return pair<T, S>(x.fi + y.fi, x.se + y.se); }\ntemplate <class T> pair<T, T> operator&(const pair<T, T> &l, const pair<T, T> &r) { return pair<T, T>(max(l.fi, r.fi), min(l.se, r.se)); }\ntemplate <class T, class S> pair<T, S> operator+=(pair<T, S> &l, const pair<T, S> &r) { return l = l + r; }\ntemplate <class T, class S> pair<T, S> operator-=(pair<T, S> &l, const pair<T, S> &r) { return l = l - r; }\ntemplate <class T> bool intersect(const pair<T, T> &l, const pair<T, T> &r) { return (l.se < r.se ? r.fi < l.se : l.fi < r.se); }\n\ntemplate <class T> ll operator*(const pair<T, T> &x, const pair<T, T> &y) { return (ll)x.fi * y.fi + (ll)x.se * y.se; }\n\ntemplate <typename T> struct edge {\n int from, to;\n T cost;\n int id;\n edge(int to, T cost) : from(-1), to(to), cost(cost) {}\n edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}\n edge(int from, int to, T cost, int id) : from(from), to(to), cost(cost), id(id) {}\n constexpr bool operator<(const edge<T> &rhs) const noexcept { return cost < rhs.cost; }\n edge &operator=(const int &x) {\n to = x;\n return *this;\n }\n operator int() const { return to; }\n};\ntemplate <typename T> using Edges = vector<edge<T>>;\n\nusing Tree = vector<vector<int>>;\nusing Graph = vector<vector<int>>;\ntemplate <class T> using Wgraph = vector<vector<edge<T>>>;\nGraph getG(int n, int m = -1, bool directed = false, int margin = 1) {\n Tree res(n);\n if(m == -1) m = n - 1;\n while(m--) {\n int a, b;\n cin >> a >> b;\n a -= margin, b -= margin;\n res[a].emplace_back(b);\n if(!directed) res[b].emplace_back(a);\n }\n return res;\n}\nGraph getTreeFromPar(int n, int margin = 1) {\n Graph res(n);\n for(int i = 1; i < n; i++) {\n int a;\n cin >> a;\n res[a - margin].emplace_back(i);\n }\n return res;\n}\ntemplate <class T> Wgraph<T> getWg(int n, int m = -1, bool directed = false, int margin = 1) {\n Wgraph<T> res(n);\n if(m == -1) m = n - 1;\n while(m--) {\n int a, b;\n T c;\n cin >> a >> b >> c;\n a -= margin, b -= margin;\n res[a].emplace_back(b, c);\n if(!directed) res[b].emplace_back(a, c);\n }\n return res;\n}\nvoid add(Graph &G, int x, int y) { G[x].eb(y), G[y].eb(x); }\ntemplate <class S, class T> void add(Wgraph<S> &G, int x, int y, T c) { G[x].eb(y, c), G[y].eb(x, c); }\n\n#define i128 __int128_t\n#define ull unsigned long long int\n#define TEST \\\n INT(testcases); \\\n while(testcases--)\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\n for(auto it = begin(v); it != end(v); ++it) {\n if(it == begin(v))\n os << *it;\n else\n os << \" \" << *it;\n }\n return os;\n}\ntemplate <class T, class S> ostream &operator<<(ostream &os, const pair<T, S> &p) {\n os << p.first << \" \" << p.second;\n return os;\n}\ntemplate <class S, class T> string to_string(pair<S, T> p) { return \"(\" + to_string(p.first) + \",\" + to_string(p.second) + \")\"; }\nstring to_string(string s) { return \"\\\"\" + s + \"\\\"\"; }\nstring to_string(char c) { return string(1, c); }\ntemplate <class T> string to_string(vector<T> s) {\n string res = \"{\";\n for(auto it = s.begin(); it != s.end(); it++) res += to_string(*it) + (next(it) == s.end() ? \"\" : \", \");\n return res + \"}\";\n}\ntemplate <class T> string to_string(set<T> s) {\n string res = \"{\";\n for(auto it = s.begin(); it != s.end(); it++) res += to_string(*it), res += (next(it) == end(s) ? \"\" : \", \");\n return res + \"}\";\n}\n\n#define endl '\\n'\n\n#ifdef _LOCAL\nvoid dump() { cerr << endl; }\ntemplate <class Head, class... Tail> void dump(Head head, Tail... tail) {\n cerr << to_string(head) << \" \";\n dump(tail...);\n}\n#undef endl\n#define debug(x) \\\n cout << #x << \": \"; \\\n dump(x)\n#else\nvoid dump() {}\ntemplate <class Head, class... Tail> void dump(Head head, Tail... tail) {}\n#define debug(x)\n#endif\ntemplate <class T> void print(const T &a) { cout << a; }\nvoid OUT() { cout << endl; }\ntemplate <class Head, class... Tail> void OUT(const Head &head, const Tail &...tail) {\n print(head);\n if(sizeof...(tail)) cout << ' ';\n OUT(tail...);\n}\n\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\n#define drop(s) cout << #s << endl, exit(0)\n\ntemplate <int N> struct ndFORarray {\n std::array<int, N> v;\n ndFORarray(std::array<int, N> v_) : v(v_) {}\n struct ndFORitr {\n const std::array<int, N> &v;\n std::array<int, N> tmp;\n bool is_end;\n ndFORitr(const std::array<int, N> &v_) : v(v_), tmp(), is_end(false) {}\n bool operator!=(const ndFORitr &) const { return !is_end; }\n void operator++() {\n int pos = N - 1;\n while(pos != -1) {\n tmp[pos] += 1;\n if(tmp[pos] == v[pos]) {\n tmp[pos] = 0;\n pos -= 1;\n } else {\n break;\n }\n }\n if(pos == -1) { is_end = true; }\n }\n const std::array<int, N> &operator*() const { return tmp; }\n };\n ndFORitr begin() const { return ndFORitr(v); }\n ndFORitr end() const { return ndFORitr(v); }\n};\n\nstruct ndFORvector {\n std::vector<int> v;\n ndFORvector(std::vector<int> v_) : v(v_) {}\n struct ndFORitr {\n const std::vector<int> &v;\n std::vector<int> tmp;\n bool is_end;\n ndFORitr(const std::vector<int> &v_) : v(v_), tmp(v.size(), 0), is_end(false) {}\n bool operator!=(const ndFORitr &) const { return !is_end; }\n void operator++() {\n int pos = v.size() - 1;\n while(pos != -1) {\n tmp[pos] += 1;\n if(tmp[pos] == v[pos]) {\n tmp[pos] = 0;\n pos -= 1;\n } else {\n break;\n }\n }\n if(pos == -1) { is_end = true; }\n }\n const std::vector<int> &operator*() const { return tmp; }\n };\n ndFORitr begin() const { return ndFORitr(v); }\n ndFORitr end() const { return ndFORitr(v); }\n};\n\nauto ndFOR(std::vector<int> v) { return ndFORvector(v); }\ntemplate <class... Ts> auto ndFOR(Ts... v) { return ndFORarray<std::tuple_size<std::tuple<Ts...>>::value>({v...}); }\ntemplate <class F> struct REC {\n F f;\n REC(F &&f_) : f(std::forward<F>(f_)) {}\n template <class... Args> auto operator()(Args &&...args) const { return f(*this, std::forward<Args>(args)...); }\n};\n\ntemplate <class S> vector<pair<S, int>> runLength(const vector<S> &v) {\n vector<pair<S, int>> res;\n for(auto &e : v) {\n if(res.empty() or res.back().fi != e)\n res.eb(e, 1);\n else\n res.back().se++;\n }\n return res;\n}\nvector<pair<char, int>> runLength(const string &v) {\n vector<pair<char, int>> res;\n for(auto &e : v) {\n if(res.empty() or res.back().fi != e)\n res.eb(e, 1);\n else\n res.back().se++;\n }\n return res;\n}\n\ntemplate <class T = int> struct Imos {\n int n;\n vector<T> a;\n Imos(int _n) : n(_n), a(_n + 1) {}\n void add(int l, int r, T val = 1) {\n if(l >= r) return;\n l = clamp(l, 0, n);\n r = clamp(r, 0, n + 1);\n a[l] += val;\n if(r <= n) a[r] -= val;\n }\n void build() {\n for(int i = 0; i < n; i++) a[i + 1] += a[i];\n }\n const T &operator[](int k) { return a[k]; }\n};\n\ntemplate <class T> struct RUI {\n vector<T> a;\n RUI(const vector<T> &v) : a(v.size() + 1) {\n for(int i = 0; i < v.size(); i++) a[i + 1] = a[i] + v[i];\n }\n T get(int l, int r) { return a[r] - a[l]; }\n};\n\ntemplate <class T, class F> T bin_search(T ok, T ng, const F &f) {\n while(abs(ok - ng) > 1) {\n T mid = ok + ng >> 1;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\ntemplate <class T, class F> T bin_search_double(T ok, T ng, const F &f, int iter = 80) {\n while(iter--) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n\nstruct Setup_io {\n Setup_io() {\n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\n cout << fixed << setprecision(15);\n }\n} setup_io;\n#pragma endregion\n\nint main() {\n while(1) {\n INT(n, m, r);\n if(!n) exit(0);\n VEC(int, a, n);\n VEC(int, b, m);\n rep(i, n) a[i]--;\n rep(i, m) b[i]--;\n\n struct S {\n vi v;\n vvc<int> match;\n S(vi a) : v(a) { match = vvc<int>(si(a) + 1, vi(si(a) + 1)); }\n S() = default;\n };\n\n vector<S> A, B;\n rep(i, n) {\n A.eb(a);\n rotate(begin(a), begin(a) + 1, end(a));\n }\n rep(i, m) {\n B.eb(b);\n rotate(begin(b), begin(b) + 1, end(b));\n }\n\n vector<pair<int, vi>> R;\n rep(i, r) {\n INT(k);\n VEC(int, x, k);\n rep(i, k) x[i]--;\n INT(y);\n y--;\n R.eb(y, x);\n }\n\n vv(int, DP, 30, 30);\n auto calc = [&](S &s) {\n auto &dp = s.match;\n int n = si(s.v);\n rep2(d, 1, n) {\n rep(i, n) {\n int j = i + d;\n if(j > n) break;\n if(d == 1) {\n dp[i][j] = 1 << s.v[i];\n continue;\n }\n for(auto &[y, x] : R) {\n if(dp[i][j] >> y & 1) continue;\n int k = si(x);\n rep(i, d + 1) rep(j, k + 1) DP[i][j] = 0;\n DP[0][0] = 1;\n rep(ii, d) rep(jj, k) {\n if(!DP[ii][jj]) continue;\n rep2(to, ii + 1, d) {\n int l = i + ii;\n int r = i + to;\n if(dp[l][r] >> x[jj] & 1) DP[to][jj + 1] = true;\n }\n }\n if(DP[d][k]) dp[i][j] |= 1 << y;\n }\n }\n }\n };\n each(e, A) calc(e);\n each(e, B) calc(e);\n\n int ma = -1;\n each(a, A) each(b, B) {\n rep(i, n + 1) rep(j, m + 1) DP[i][j] = -inf<int>;\n DP[0][0] = 0;\n auto &x = a.match, &y = b.match;\n rep(i, n) rep(j, m) {\n if(DP[i][j] < 0) continue;\n rep2(ii, i + 1, n) rep2(jj, j + 1, m) {\n if(x[i][ii] & y[j][jj]) chmax(DP[ii][jj], DP[i][j] + 1);\n }\n }\n chmax(ma, DP[n][m]);\n }\n OUT(ma);\n }\n}","accuracy":1,"time_ms":390,"memory_kb":3596,"score_of_the_acc":-0.0352,"final_rank":1},{"submission_id":"aoj_1191_6029771","code_snippet":"#pragma region Macros\n#pragma comment(linker, \"/stack:200000000\")\n// #pragma GCC optimize(\"unroll-loops\")\n// #pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native\")\n// #pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2\")\n// #pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\n#define ll long long\nusing ld = long double;\n#define rep2(i, a, b) for(ll i = (a); i <= (b); i++)\n#define rep3(i, a, b) for(ll i = (a); i >= (b); --i)\n#define rep(i, n) for(ll i = 0; i < n; ++i)\n#define each(i, a) for(auto &&i : a)\n#define pii pair<int, int>\n#define pll pair<ll, ll>\n#define pb push_back\n#define eb emplace_back\n#define vi vector<int>\n#define vll vector<ll>\n#define vpi vector<pii>\n#define vpll vector<pll>\n#define overload2(_1, _2, name, ...) name\n#define vec(type, name, ...) vector<type> name(__VA_ARGS__)\n#define VEC(type, name, size) \\\n vector<type> name(size); \\\n IN(name)\n#define VEC2(type, name1, name2, size) \\\n vector<type> name1(size), name2(size); \\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i])\n#define VEC3(type, name1, name2, name3, size) \\\n vector<type> name1(size), name2(size), name3(size); \\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i])\n#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define VV(type, name, h, w) \\\n vector<vector<type>> name(h, vector<type>(w)); \\\n IN(name)\n#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n#define mt make_tuple\n#define fi first\n#define se second\n#define all(c) begin(c), end(c)\n#define rall(c) rbegin(c), rend(c)\n#define SORT(v) sort(all(v))\n#define REV(v) reverse(all(v))\ntemplate <class T = ll, class S> T SUM(const S &v) { return accumulate(all(v), T(0)); }\n#define MIN(v) *min_element(all(v))\n#define MAX(v) *max_element(all(v))\n#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))\n#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))\nusing namespace std;\nconstexpr pii dx4[4] = {pii{1, 0}, pii{0, 1}, pii{-1, 0}, pii{0, -1}};\nconstexpr pii dx8[8] = {{1, 0}, {1, 1}, {0, 1}, {-1, 1}, {-1, 0}, {-1, -1}, {0, -1}, {1, -1}};\nconst string YESNO[2] = {\"NO\", \"YES\"};\nconst string YesNo[2] = {\"No\", \"Yes\"};\nconst string yesno[2] = {\"no\", \"yes\"};\nvoid YES(bool t = 1) { cout << YESNO[t] << endl; }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { cout << YesNo[t] << endl; }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { cout << yesno[t] << endl; }\nvoid no(bool t = 1) { yes(!t); }\ntemplate <class T> using vc = vector<T>;\ntemplate <class T> using vvc = vector<vc<T>>;\ntemplate <class T> using vvvc = vector<vvc<T>>;\ntemplate <class T> using vvvvc = vector<vvvc<T>>;\ntemplate <class T> using pq = priority_queue<T>;\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\n#define si(c) (int)(c).size()\n#define INT(...) \\\n int __VA_ARGS__; \\\n IN(__VA_ARGS__)\n#define LL(...) \\\n ll __VA_ARGS__; \\\n IN(__VA_ARGS__)\n#define STR(...) \\\n string __VA_ARGS__; \\\n IN(__VA_ARGS__)\n#define CHR(...) \\\n char __VA_ARGS__; \\\n IN(__VA_ARGS__)\n#define DBL(...) \\\n double __VA_ARGS__; \\\n IN(__VA_ARGS__)\nint scan() { return getchar(); }\nvoid scan(int &a) { cin >> a; }\nvoid scan(long long &a) { cin >> a; }\nvoid scan(char &a) { cin >> a; }\nvoid scan(double &a) { cin >> a; }\nvoid scan(string &a) { cin >> a; }\ntemplate <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); }\ntemplate <class T> void scan(vector<T> &);\ntemplate <class T> void scan(vector<T> &a) {\n for(auto &i : a) scan(i);\n}\ntemplate <class T> void scan(T &a) { cin >> a; }\nvoid IN() {}\ntemplate <class Head, class... Tail> void IN(Head &head, Tail &...tail) {\n scan(head);\n IN(tail...);\n}\n\ntemplate <class T, class S> inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); }\ntemplate <class T, class S> inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); }\nvi iota(int n) {\n vi a(n);\n iota(all(a), 0);\n return a;\n}\ntemplate <typename T> vi iota(vector<T> &a, bool greater = false) {\n vi res(a.size());\n iota(all(res), 0);\n sort(all(res), [&](int i, int j) {\n if(greater) return a[i] > a[j];\n return a[i] < a[j];\n });\n return res;\n}\n#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())\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}\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}\ntemplate <class T> T POW(T x, int n) {\n T res = 1;\n for(; n; n >>= 1, x *= x)\n if(n & 1) res *= x;\n return res;\n}\ntemplate <class T, class S> T POW(T x, S n, const ll &mod) {\n T res = 1;\n for(; n; n >>= 1, x = x * x % mod)\n if(n & 1) res = res * x % mod;\n return res;\n}\nvector<pll> factor(ll x) {\n vector<pll> ans;\n for(ll i = 2; i * i <= x; i++)\n if(x % i == 0) {\n ans.push_back({i, 1});\n while((x /= i) % i == 0) ans.back().second++;\n }\n if(x != 1) ans.push_back({x, 1});\n return ans;\n}\ntemplate <class T> vector<T> divisor(T x) {\n vector<T> ans;\n for(T i = 1; i * i <= x; i++)\n if(x % i == 0) {\n ans.pb(i);\n if(i * i != x) ans.pb(x / i);\n }\n return ans;\n}\ntemplate <typename T> void zip(vector<T> &x) {\n vector<T> y = x;\n UNIQUE(y);\n for(int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); }\n}\ntemplate <class S> void fold_in(vector<S> &v) {}\ntemplate <typename Head, typename... Tail, class S> void fold_in(vector<S> &v, Head &&a, Tail &&...tail) {\n for(auto e : a) v.emplace_back(e);\n fold_in(v, tail...);\n}\ntemplate <class S> void renumber(vector<S> &v) {}\ntemplate <typename Head, typename... Tail, class S> void renumber(vector<S> &v, Head &&a, Tail &&...tail) {\n for(auto &&e : a) e = lb(v, e);\n renumber(v, tail...);\n}\ntemplate <class S, class... Args> vector<S> zip(vector<S> &head, Args &&...args) {\n vector<S> v;\n fold_in(v, head, args...);\n sort(all(v)), v.erase(unique(all(v)), v.end());\n renumber(v, head, args...);\n return v;\n}\n\n// x in [l, r)\ntemplate <class T, class S> bool inc(const T &x, const S &l, const S &r) { return l <= x and x < r; }\n// (a, b) in [lx, rx) * [ly, ry)\ntemplate <class T, class S> bool inc(const pair<T, T> &x, const S &lx, const S &ly, const S &rx, const S &ry) { return inc(x.fi, lx, rx) && inc(x.se, ly, ry); }\n\nconstexpr ll ten(int n) { return n == 0 ? 1 : ten(n - 1) * 10; }\n// bit 演算系\nll pow2(int i) { return 1LL << i; }\nint topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }\nint topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }\nint lowbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }\nint lowbit(ll a) { return a == 0 ? 64 : __builtin_ctzll(a); }\n// int allbit(int n) { return (1 << n) - 1; }\nconstexpr ll allbit(int n) { return (1LL << n) - 1; }\n// int popcount(signed t) { return __builtin_popcount(t); }\n// int popcount(ll t) { return __builtin_popcountll(t); }\nint popcount(uint64_t t) { return __builtin_popcountll(t); }\nbool ispow2(int i) { return i && (i & -i) == i; }\n\nll rnd(ll l, ll r) { //[l, r)\n#ifdef _LOCAL\n static mt19937_64 gen;\n#else\n static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());\n#endif\n return uniform_int_distribution<ll>(l, r - 1)(gen);\n}\nll rnd(ll n) { return rnd(0, n); }\n\ntemplate <class t> void random_shuffle(vc<t> &a) { rep(i, si(a)) swap(a[i], a[rnd(0, i + 1)]); }\n\nint in() {\n int x;\n cin >> x;\n return x;\n}\nll lin() {\n unsigned long long x;\n cin >> x;\n return x;\n}\n\ntemplate <class T, class S> pair<T, S> operator-(const pair<T, S> &x, const pair<T, S> &y) { return pair<T, S>(x.fi - y.fi, x.se - y.se); }\ntemplate <class T, class S> pair<T, S> operator+(const pair<T, S> &x, const pair<T, S> &y) { return pair<T, S>(x.fi + y.fi, x.se + y.se); }\ntemplate <class T> pair<T, T> operator&(const pair<T, T> &l, const pair<T, T> &r) { return pair<T, T>(max(l.fi, r.fi), min(l.se, r.se)); }\ntemplate <class T, class S> pair<T, S> operator+=(pair<T, S> &l, const pair<T, S> &r) { return l = l + r; }\ntemplate <class T, class S> pair<T, S> operator-=(pair<T, S> &l, const pair<T, S> &r) { return l = l - r; }\ntemplate <class T> bool intersect(const pair<T, T> &l, const pair<T, T> &r) { return (l.se < r.se ? r.fi < l.se : l.fi < r.se); }\n\ntemplate <class T> ll operator*(const pair<T, T> &x, const pair<T, T> &y) { return (ll)x.fi * y.fi + (ll)x.se * y.se; }\n\ntemplate <typename T> struct edge {\n int from, to;\n T cost;\n int id;\n edge(int to, T cost) : from(-1), to(to), cost(cost) {}\n edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}\n edge(int from, int to, T cost, int id) : from(from), to(to), cost(cost), id(id) {}\n constexpr bool operator<(const edge<T> &rhs) const noexcept { return cost < rhs.cost; }\n edge &operator=(const int &x) {\n to = x;\n return *this;\n }\n operator int() const { return to; }\n};\ntemplate <typename T> using Edges = vector<edge<T>>;\n\nusing Tree = vector<vector<int>>;\nusing Graph = vector<vector<int>>;\ntemplate <class T> using Wgraph = vector<vector<edge<T>>>;\nGraph getG(int n, int m = -1, bool directed = false, int margin = 1) {\n Tree res(n);\n if(m == -1) m = n - 1;\n while(m--) {\n int a, b;\n cin >> a >> b;\n a -= margin, b -= margin;\n res[a].emplace_back(b);\n if(!directed) res[b].emplace_back(a);\n }\n return res;\n}\nGraph getTreeFromPar(int n, int margin = 1) {\n Graph res(n);\n for(int i = 1; i < n; i++) {\n int a;\n cin >> a;\n res[a - margin].emplace_back(i);\n }\n return res;\n}\ntemplate <class T> Wgraph<T> getWg(int n, int m = -1, bool directed = false, int margin = 1) {\n Wgraph<T> res(n);\n if(m == -1) m = n - 1;\n while(m--) {\n int a, b;\n T c;\n cin >> a >> b >> c;\n a -= margin, b -= margin;\n res[a].emplace_back(b, c);\n if(!directed) res[b].emplace_back(a, c);\n }\n return res;\n}\nvoid add(Graph &G, int x, int y) { G[x].eb(y), G[y].eb(x); }\ntemplate <class S, class T> void add(Wgraph<S> &G, int x, int y, T c) { G[x].eb(y, c), G[y].eb(x, c); }\n\n#define i128 __int128_t\n#define ull unsigned long long int\n#define TEST \\\n INT(testcases); \\\n while(testcases--)\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\n for(auto it = begin(v); it != end(v); ++it) {\n if(it == begin(v))\n os << *it;\n else\n os << \" \" << *it;\n }\n return os;\n}\ntemplate <class T, class S> ostream &operator<<(ostream &os, const pair<T, S> &p) {\n os << p.first << \" \" << p.second;\n return os;\n}\ntemplate <class S, class T> string to_string(pair<S, T> p) { return \"(\" + to_string(p.first) + \",\" + to_string(p.second) + \")\"; }\nstring to_string(string s) { return \"\\\"\" + s + \"\\\"\"; }\nstring to_string(char c) { return string(1, c); }\ntemplate <class T> string to_string(vector<T> s) {\n string res = \"{\";\n for(auto it = s.begin(); it != s.end(); it++) res += to_string(*it) + (next(it) == s.end() ? \"\" : \", \");\n return res + \"}\";\n}\ntemplate <class T> string to_string(set<T> s) {\n string res = \"{\";\n for(auto it = s.begin(); it != s.end(); it++) res += to_string(*it), res += (next(it) == end(s) ? \"\" : \", \");\n return res + \"}\";\n}\n\n#define endl '\\n'\n\n#ifdef _LOCAL\nvoid dump() { cerr << endl; }\ntemplate <class Head, class... Tail> void dump(Head head, Tail... tail) {\n cerr << to_string(head) << \" \";\n dump(tail...);\n}\n#undef endl\n#define debug(x) \\\n cout << #x << \": \"; \\\n dump(x)\n#else\nvoid dump() {}\ntemplate <class Head, class... Tail> void dump(Head head, Tail... tail) {}\n#define debug(x)\n#endif\ntemplate <class T> void print(const T &a) { cout << a; }\nvoid OUT() { cout << endl; }\ntemplate <class Head, class... Tail> void OUT(const Head &head, const Tail &...tail) {\n print(head);\n if(sizeof...(tail)) cout << ' ';\n OUT(tail...);\n}\n\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\n#define drop(s) cout << #s << endl, exit(0)\n\ntemplate <int N> struct ndFORarray {\n std::array<int, N> v;\n ndFORarray(std::array<int, N> v_) : v(v_) {}\n struct ndFORitr {\n const std::array<int, N> &v;\n std::array<int, N> tmp;\n bool is_end;\n ndFORitr(const std::array<int, N> &v_) : v(v_), tmp(), is_end(false) {}\n bool operator!=(const ndFORitr &) const { return !is_end; }\n void operator++() {\n int pos = N - 1;\n while(pos != -1) {\n tmp[pos] += 1;\n if(tmp[pos] == v[pos]) {\n tmp[pos] = 0;\n pos -= 1;\n } else {\n break;\n }\n }\n if(pos == -1) { is_end = true; }\n }\n const std::array<int, N> &operator*() const { return tmp; }\n };\n ndFORitr begin() const { return ndFORitr(v); }\n ndFORitr end() const { return ndFORitr(v); }\n};\n\nstruct ndFORvector {\n std::vector<int> v;\n ndFORvector(std::vector<int> v_) : v(v_) {}\n struct ndFORitr {\n const std::vector<int> &v;\n std::vector<int> tmp;\n bool is_end;\n ndFORitr(const std::vector<int> &v_) : v(v_), tmp(v.size(), 0), is_end(false) {}\n bool operator!=(const ndFORitr &) const { return !is_end; }\n void operator++() {\n int pos = v.size() - 1;\n while(pos != -1) {\n tmp[pos] += 1;\n if(tmp[pos] == v[pos]) {\n tmp[pos] = 0;\n pos -= 1;\n } else {\n break;\n }\n }\n if(pos == -1) { is_end = true; }\n }\n const std::vector<int> &operator*() const { return tmp; }\n };\n ndFORitr begin() const { return ndFORitr(v); }\n ndFORitr end() const { return ndFORitr(v); }\n};\n\nauto ndFOR(std::vector<int> v) { return ndFORvector(v); }\ntemplate <class... Ts> auto ndFOR(Ts... v) { return ndFORarray<std::tuple_size<std::tuple<Ts...>>::value>({v...}); }\ntemplate <class F> struct REC {\n F f;\n REC(F &&f_) : f(std::forward<F>(f_)) {}\n template <class... Args> auto operator()(Args &&...args) const { return f(*this, std::forward<Args>(args)...); }\n};\n\ntemplate <class S> vector<pair<S, int>> runLength(const vector<S> &v) {\n vector<pair<S, int>> res;\n for(auto &e : v) {\n if(res.empty() or res.back().fi != e)\n res.eb(e, 1);\n else\n res.back().se++;\n }\n return res;\n}\nvector<pair<char, int>> runLength(const string &v) {\n vector<pair<char, int>> res;\n for(auto &e : v) {\n if(res.empty() or res.back().fi != e)\n res.eb(e, 1);\n else\n res.back().se++;\n }\n return res;\n}\n\ntemplate <class T = int> struct Imos {\n int n;\n vector<T> a;\n Imos(int _n) : n(_n), a(_n + 1) {}\n void add(int l, int r, T val = 1) {\n if(l >= r) return;\n l = clamp(l, 0, n);\n r = clamp(r, 0, n + 1);\n a[l] += val;\n if(r <= n) a[r] -= val;\n }\n void build() {\n for(int i = 0; i < n; i++) a[i + 1] += a[i];\n }\n const T &operator[](int k) { return a[k]; }\n};\n\ntemplate <class T> struct RUI {\n vector<T> a;\n RUI(const vector<T> &v) : a(v.size() + 1) {\n for(int i = 0; i < v.size(); i++) a[i + 1] = a[i] + v[i];\n }\n T get(int l, int r) { return a[r] - a[l]; }\n};\n\ntemplate <class T, class F> T bin_search(T ok, T ng, const F &f) {\n while(abs(ok - ng) > 1) {\n T mid = ok + ng >> 1;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\ntemplate <class T, class F> T bin_search_double(T ok, T ng, const F &f, int iter = 80) {\n while(iter--) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n\nstruct Setup_io {\n Setup_io() {\n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\n cout << fixed << setprecision(15);\n }\n} setup_io;\n#pragma endregion\n\nint main() {\n while(1) {\n INT(n, m, r);\n if(!n) exit(0);\n VEC(int, a, n);\n VEC(int, b, m);\n rep(i, n) a[i]--;\n rep(i, m) b[i]--;\n\n struct S {\n vi v;\n vvc<int> match;\n S(vi a) : v(a) { match = vvc<int>(si(a) + 1, vi(si(a) + 1)); }\n S() = default;\n };\n\n vector<S> A, B;\n rep(i, n) {\n A.eb(a);\n rotate(begin(a), begin(a) + 1, end(a));\n }\n rep(i, n) {\n B.eb(b);\n rotate(begin(b), begin(b) + 1, end(b));\n }\n\n vector<pair<int, vi>> R;\n rep(i, r) {\n INT(k);\n VEC(int, x, k);\n rep(i, k) x[i]--;\n INT(y);\n y--;\n R.eb(y, x);\n }\n\n vv(int, DP, 30, 30);\n auto calc = [&](S &s) {\n auto &dp = s.match;\n int n = si(s.v);\n rep2(d, 1, n) {\n rep(i, n) {\n int j = i + d;\n if(j > n) break;\n if(d == 1) {\n dp[i][j] = 1 << s.v[i];\n continue;\n }\n for(auto &[y, x] : R) {\n if(dp[i][j] >> y & 1) continue;\n int k = si(x);\n rep(i, d + 1) rep(j, k + 1) DP[i][j] = 0;\n DP[0][0] = 1;\n rep(ii, d) rep(jj, k) {\n if(!DP[ii][jj]) continue;\n rep2(to, ii + 1, d) {\n int l = i + ii;\n int r = i + to;\n if(dp[l][r] >> x[jj] & 1) DP[to][jj + 1] = true;\n }\n }\n if(DP[d][k]) dp[i][j] |= 1 << y;\n }\n }\n }\n };\n each(e, A) calc(e);\n each(e, B) calc(e);\n\n int ma = -1;\n each(a, A) each(b, B) {\n rep(i, n + 1) rep(j, m + 1) DP[i][j] = -inf<int>;\n DP[0][0] = 0;\n auto &x = a.match, &y = b.match;\n rep(i, n) rep(j, m) {\n if(DP[i][j] < 0) continue;\n rep2(ii, i + 1, n) rep2(jj, j + 1, m) {\n if(x[i][ii] & y[j][jj]) chmax(DP[ii][jj], DP[i][j] + 1);\n }\n }\n chmax(ma, DP[n][m]);\n }\n OUT(ma);\n }\n}","accuracy":0.5,"time_ms":390,"memory_kb":3720,"score_of_the_acc":-0.0401,"final_rank":20},{"submission_id":"aoj_1191_6029063","code_snippet":"//#pragma GCC optimize(\"O3\")\n//#pragma GCC optimize(\"unroll-loops\")\n#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<bitset>\n#include<stack>\n#include<unordered_map>\n#include<unordered_set>\n#include<utility>\n#include<cassert>\n#include<complex>\n#include<numeric>\n#include<array>\nusing namespace std;\n\n//#define int long long\ntypedef long long ll;\n\ntypedef unsigned long long ul;\ntypedef unsigned int ui;\nconst ll mod = 1000000007;\nconst ll INF = mod * mod;\ntypedef pair<int, int>P;\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 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++)\n#define all(v) (v).begin(),(v).end()\ntypedef pair<ll, ll> LP;\ntypedef long double ld;\ntypedef pair<ld, ld> LDP;\nconst ld eps = 1e-8;\nconst ld pi = acosl(-1.0);\n\nll mod_pow(ll x, ll n, ll m = mod) {\n\tif (n < 0) {\n\t\tll res = mod_pow(x, -n, m);\n\t\treturn mod_pow(res, m - 2, m);\n\t}\n\tif (abs(x) >= m)x %= m;\n\tif (x < 0)x += m;\n\tll res = 1;\n\twhile (n) {\n\t\tif (n & 1)res = res * x % m;\n\t\tx = x * x % m; n >>= 1;\n\t}\n\treturn res;\n}\nstruct modint {\n\tll n;\n\tmodint() :n(0) { ; }\n\tmodint(ll m) :n(m) {\n\t\tif (n >= mod)n %= mod;\n\t\telse if (n < 0)n = (n % mod + mod) % mod;\n\t}\n\toperator int() { return n; }\n};\nbool operator==(modint a, modint b) { return a.n == b.n; }\nmodint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }\nmodint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }\nmodint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }\nmodint operator+(modint a, modint b) { return a += b; }\nmodint operator-(modint a, modint b) { return a -= b; }\nmodint operator*(modint a, modint b) { return a *= b; }\nmodint operator^(modint a, ll n) {\n\tif (n == 0)return modint(1);\n\tmodint res = (a * a) ^ (n / 2);\n\tif (n % 2)res = res * a;\n\treturn res;\n}\n\nll inv(ll a, ll p) {\n\treturn (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);\n}\nmodint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\nmodint operator/=(modint& a, modint b) { a = a / b; return a; }\nconst int max_n = 1 << 20;\nmodint fact[max_n], factinv[max_n];\nvoid init_f() {\n\tfact[0] = modint(1);\n\tfor (int i = 0; i < max_n - 1; i++) {\n\t\tfact[i + 1] = fact[i] * modint(i + 1);\n\t}\n\tfactinv[max_n - 1] = modint(1) / fact[max_n - 1];\n\tfor (int i = max_n - 2; i >= 0; i--) {\n\t\tfactinv[i] = factinv[i + 1] * modint(i + 1);\n\t}\n}\nmodint comb(int a, int b) {\n\tif (a < 0 || b < 0 || a < b)return 0;\n\treturn fact[a] * factinv[b] * factinv[a - b];\n}\nmodint combP(int a, int b) {\n\tif (a < 0 || b < 0 || a < b)return 0;\n\treturn fact[a] * factinv[a - b];\n}\nint gcd(int a, int b) {\n\tif (a < b)swap(a, b);\n\twhile (b) {\n\t\tint r = a % b; a = b; b = r;\n\t}\n\treturn a;\n}\n\nconst int c = 31;\nbool ok[55][55][c];\nbool sub[55][11];\nvector<vector<int>> mk[c];\nvoid yaru(vector<int> a) {\n\tint n = a.size();\n\trep(i, n)Rep(j, i+1, n+1)rep(k, c)ok[i][j][k] = false;\n\trep(i, n)ok[i][i+1][a[i]] = true;\n\tfor (int len = 2; len <= n; len++) {\n\t\trep(l, n - len + 1) {\n\t\t\tint r = l + len;\n\t\t\t//[l,r)\n\t\t\trep(col, c) {\n\t\t\t\tfor (auto v : mk[col]) {\n\t\t\t\t\tRep1(i, l, r)rep(j, v.size()+1) {\n\t\t\t\t\t\tsub[i][j] = false;\n\t\t\t\t\t}\n\t\t\t\t\tsub[l][0] = true;\n\t\t\t\t\tRep(i, l, r) {\n\t\t\t\t\t\trep(j, v.size())if (sub[i][j]) {\n\t\t\t\t\t\t\tfor (int ni = i + 1; ni <= r; ni++) {\n\t\t\t\t\t\t\t\tif (ok[i][ni][v[j]]) {\n\t\t\t\t\t\t\t\t\tsub[ni][j + 1] = true;\n\t\t\t\t\t\t\t\t}\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\tif (sub[r][v.size()]) {\n\t\t\t\t\t\tok[l][r][col] = true; break;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nbool oka[55][55][c];\nbool okb[55][55][c];\nint n, m, r;\n\nbool sok[55][55][55][55];\nvoid solve() {\n\trep(i, c)mk[i].clear();\n\tvector<int> a(n);\n\trep(i, n)cin >> a[i]; rep(i, n)a.push_back(a[i]);\n\tvector<int> b(m);\n\trep(i, m)cin >> b[i]; rep(i, m)b.push_back(b[i]);\n\trep(i, r) {\n\t\tint num; cin >> num;\n\t\tvector<int> v(num);\n\t\trep(j, num)cin >> v[j];\n\t\tint alf; cin >> alf;\n\t\tmk[alf].push_back(v);\n\t}\n\tyaru(a);\n\trep(i, a.size())Rep1(j, i + 1, a.size())rep(k, c) {\n\t\toka[i][j][k] = ok[i][j][k];\n\t}\n\tyaru(b);\n\trep(i, b.size())Rep1(j, i + 1, b.size())rep(k, c) {\n\t\tokb[i][j][k] = ok[i][j][k];\n\t}\n\trep(i, a.size())Rep(j, i + 1, a.size() + 1) {\n\t\trep(k, b.size())Rep(l, k + 1, b.size() + 1) {\n\t\t\tsok[i][j][k][l] = false;\n\t\t\trep(col, c) {\n\t\t\t\tif (oka[i][j][col] && okb[k][l][col]) {\n\t\t\t\t\tsok[i][j][k][l] = true; break;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tint ans = -1;\n\trep(s, n)rep(t, m) {\n\t\t//[s,s+n)\n\t\t//[t,t+m)\n\t\tvector<vector<int>> dp(n + 1, vector<int>(m + 1,-1));\n\t\tdp[0][0] = 0;\n\t\trep(i, n + 1)rep(j, m + 1) {\n\t\t\tif (dp[i][j] < 0)continue;\n\t\t\tfor (int ni = i + 1; ni <= n; ni++) {\n\t\t\t\tfor (int nj = j + 1; nj <= m; nj++) {\n\t\t\t\t\tif (sok[s + i][s + ni][t + j][t + nj]) {\n\t\t\t\t\t\tdp[ni][nj] = max(dp[ni][nj], dp[i][j] + 1);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tans = max(ans, dp[n][m]);\n\t}\n\tcout << ans << \"\\n\";\n}\nsigned main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\t//cout << fixed << setprecision(10);\n\t//init_f();\n\t//init();\n\t//int t; cin >> t; rep(i, t)\n\twhile (cin>>n>>m>>r,n)\n\t\tsolve();\n\treturn 0;\n}","accuracy":1,"time_ms":510,"memory_kb":28656,"score_of_the_acc":-1.0403,"final_rank":16},{"submission_id":"aoj_1191_5821073","code_snippet":"/*\tauthor: Kite_kuma\n\tcreated: 2021.08.25 09:49:47 */\n\n// #ifdef LOCAL\n#define _GLIBCXX_DEBUG\n// #endif\n#include <bits/stdc++.h>\nusing namespace std;\n\n#pragma region macros\n\n#define foa(s, v) for(auto &s : v)\n#define all(v) (v).begin(), (v).end()\n#define rall(v) (v).rbegin(), (v).rend()\n#define popcnt(n) __builtin_popcountll((long long)n)\n\n#define REPname(a, b, c, d, e, ...) e\n#define rep(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\n#define REP0(x) for(int Counter_in_rep_macro = 0; Counter_in_rep_macro < (x); ++Counter_in_rep_macro)\n#define REP1(i, x) for(int i = 0; i < (x); ++i)\n#define REP2(i, l, r) for(int i = (l); i < (r); ++i)\n#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))\n\n#define DREPname(a, b, c, d, e, ...) e\n#define drep(...) DREPname(__VA_ARGS__, DREP3, DREP2, DREP1)(__VA_ARGS__)\n#define DREP1(i, x) for(int i = (x)-1; i >= 0; --i)\n#define DREP2(i, l, r) for(int i = (r)-1; i >= (l); --i)\n#define DREP3(i, l, r, c) for(int i = (r)-1; i >= (l); i -= (c))\n\n#pragma endregion\n\n#pragma region aliases\n\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing vi = std::vector<int>;\nusing vvi = std::vector<std::vector<int>>;\nusing vvvi = std::vector<std::vector<std::vector<int>>>;\nusing vll = std::vector<ll>;\nusing vvll = std::vector<vll>;\nusing vvvll = std::vector<vvll>;\nusing pii = std::pair<int, int>;\nusing pll = std::pair<long long, long long>;\ntemplate <class T = ll>\nusing V = std::vector<T>;\ntemplate <class T = ll>\nusing VV = V<V<T>>;\ntemplate <class T = ll>\nusing VVV = V<V<V<T>>>;\ntemplate <class T = ll>\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\ntemplate <class T = ll>\nusing pqdn = std::priority_queue<T>;\n\n#pragma endregion\n\n#pragma region constants\n\nconst int inf = 1e9;\nconst long long INF = 1e18;\nconst long double pi = acos(-1);\nconst char dl = '\\n';\nconst char sp = ' ';\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\n\nconst int mod_1000000007 = 1000000007;\nconst int mod_998244353 = 998244353;\n\n#pragma endregion\n\n#pragma region basic_operation\n\ntemplate <class T0, class T1, class T2>\ninline bool in_range(T0 x, T1 lef, T2 rig) {\n\treturn ((lef <= x) && (x < rig));\n}\n\ntemplate <class T>\ninline bool chmin(T &a, T b) {\n\tif(a > b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\ntemplate <class T>\ninline bool chmax(T &a, T b) {\n\tif(a < b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nvoid Yes(bool f = 1) { std::cout << (f ? \"Yes\" : \"No\") << '\\n'; }\nvoid No() { std::cout << \"No\\n\"; }\nvoid YES(bool f = 1) { std::cout << (f ? \"YES\" : \"NO\") << '\\n'; }\nvoid NO() { std::cout << \"NO\\n\"; }\n\ntemplate <class T>\nvoid drop(T answer) {\n\tstd::cout << answer << '\\n';\n\texit(0);\n}\n\nvoid err(bool flag = true) {\n\tif(!flag) return;\n\tstd::cout << -1 << '\\n';\n\texit(0);\n}\n\ntemplate <class T>\nvoid vout(std::vector<T> const &v, bool vertically = 0) {\n\tif(vertically) {\n\t\tfor(auto const &a : v) {\n\t\t\tstd::cout << a << '\\n';\n\t\t}\n\t\treturn;\n\t}\n\tfor(auto it = v.begin(); it != v.end(); it++) {\n\t\tstd::cout << (*it);\n\t\tif(it != v.end() - 1) {\n\t\t\tstd::cout << ' ';\n\t\t}\n\t}\n\tstd::cout << '\\n';\n\treturn;\n}\n\ninline void print() { std::cout << '\\n'; }\ntemplate <class T>\ninline void print(T x) {\n\tstd::cout << x << '\\n';\n\treturn;\n}\ntemplate <typename Head, typename... Tail>\nvoid print(Head H, Tail... T) {\n\tstd::cout << H << \" \";\n\tprint(T...);\n}\n\ntemplate <class T>\nvoid add(std::vector<T> &v, T val) {\n\tfor(auto &a : v) a += val;\n\treturn;\n}\n\ntemplate <class T>\nT dup(T a, T b) {\n\tassert(b != 0);\n\treturn (a + b - 1) / b;\n}\n\ntemplate <class T>\nT greatest_lower_multiple(T x, T d) {\n\tif(d == 0) return 0;\n\tif(d < 0) d *= -1;\n\tT y = x % d;\n\tif(y < 0) y += d;\n\treturn x - y;\n}\n\ntemplate <class T>\nT least_upper_multiple(T x, T d) {\n\treturn -greatest_lower_multiple(-x, d);\n}\n\nlong long POW(long long a, long long n) {\n\tlong long res = 1;\n\twhile(n > 0) {\n\t\tif(n & 1) res = res * a;\n\t\ta = a * a;\n\t\tn >>= 1;\n\t}\n\treturn res;\n}\n\nlong long modpow(long long a, long long n, long long mod) {\t // a^n mod\n\tassert(n >= 0 && mod);\n\tif(mod == 1) return 0LL;\n\tlong long res = 1;\n\ta %= mod;\n\twhile(n > 0) {\n\t\tif(n & 1) res = res * a % mod;\n\t\ta = a * a % mod;\n\t\tn >>= 1;\n\t}\n\treturn res < 0 ? res + mod : res;\n}\n\n// return x which satisfies a * x % mod == gcd(a, mod)\n// not (mod | a)\nlong long modinv(long long a, long long mod) {\n\tlong long b = mod, u = 1, v = 0;\n\twhile(b) {\n\t\tlong long t = a / b;\n\t\ta -= t * b;\n\t\tstd::swap(a, b);\n\t\tu -= t * v;\n\t\tstd::swap(u, v);\n\t}\n\tu %= mod;\n\tif(u < 0) u += mod;\n\treturn u;\n}\n\ntemplate <class T>\nint lb(const std::vector<T> &a, const T x) {\n\treturn std::distance(a.begin(), std::lower_bound(a.begin(), a.end(), x));\n}\ntemplate <class T>\nint ub(const std::vector<T> &a, const T x) {\n\treturn std::distance(a.begin(), std::upper_bound(a.begin(), a.end(), x));\n}\ntemplate <class T>\nvoid unq_sort(std::vector<T> &a) {\n\tstd::sort(a.begin(), a.end());\n\ta.erase(std::unique(a.begin(), a.end()), a.end());\n}\ntemplate <class T>\nstd::vector<int> press(std::vector<T> &a) {\n\tauto vec = a;\n\tunq_sort(vec);\n\tstd::vector<int> ret;\n\tfor(auto &v : a) ret.push_back(lb(vec, v));\n\treturn ret;\n}\n\n#pragma endregion\n\n#pragma region input\n#define VEC(type, name, size) \\\n\tvector<type> name(size); \\\n\tscanner::INPUT(name)\n#define VVEC(type, name, h, w) \\\n\tvector<vector<type>> name(h, vector<type>(w)); \\\n\tscanner::INPUT(name)\n#define INT(...) \\\n\tint __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LL(...) \\\n\tlong long __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define STR(...) \\\n\tstring __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define CHR(...) \\\n\tchar __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define DBL(...) \\\n\tdouble __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LD(...) \\\n\tlong double __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define TPL3(type0, type1, type2, name) \\\n\tstd::tuple<type0, type1, type2> name; \\\n\tscanner::INPUT(name);\n#define TPL4(type0, type1, type2, type3, name) \\\n\tstd::tuple<type0, type1, type2, type3> name; \\\n\tscanner::INPUT(name);\n\nnamespace scanner {\ntemplate <class T>\nvoid scan(T &a) {\n\tstd::cin >> a;\n}\n\ntemplate <class T, class L>\nvoid scan(std::pair<T, L> &p) {\n\tscan(p.first);\n\tscan(p.second);\n}\n\ntemplate <class T0, class T1, class T2>\nvoid scan(std::tuple<T0, T1, T2> &p) {\n\tT0 t0;\n\tT1 t1;\n\tT2 t2;\n\tscan(t0);\n\tscan(t1);\n\tscan(t2);\n\tp = std::make_tuple(t0, t1, t2);\n}\n\ntemplate <class T0, class T1, class T2, class T3>\nvoid scan(std::tuple<T0, T1, T2, T3> &p) {\n\tT0 t0;\n\tT1 t1;\n\tT2 t2;\n\tT3 t3;\n\tscan(t0);\n\tscan(t1);\n\tscan(t2);\n\tscan(t3);\n\tp = std::make_tuple(t0, t1, t2, t3);\n}\n\ntemplate <class T>\nvoid scan(std::vector<T> &a) {\n\tfor(auto &i : a) scan(i);\n}\n\nvoid INPUT() {}\ntemplate <class Head, class... Tail>\nvoid INPUT(Head &head, Tail &... tail) {\n\tscan(head);\n\tINPUT(tail...);\n}\n} // namespace scanner\n\ntemplate <typename T1, typename T2>\nstd::istream &operator>>(std::istream &is, std::pair<T1, T2> &p) {\n\tis >> p.first >> p.second;\n\treturn is;\n}\n#pragma endregion\n\n#pragma region debug\n\n#pragma region output\ntemplate <typename T1, typename T2>\nstd::ostream &std::operator<<(std::ostream &os, const std::pair<T1, T2> &p) {\n\tos << p.first << \" \" << p.second;\n\treturn os;\n}\ntemplate <class T>\nstd::ostream &std::operator<<(std::ostream &os, const std::vector<T> &v) {\n\tfor(int i = 0; i < (int)v.size(); i++) {\n\t\tif(i) os << \" \";\n\t\tos << v[i];\n\t}\n\treturn os;\n}\n#pragma endregion\n\n#pragma region view\n\nnamespace viewer {\nvoid view(const long long e) {\n\tif(e == INF)\n\t\tstd::cerr << \"INF\";\n\telse if(e == -INF)\n\t\tstd::cerr << \"-INF\";\n\telse\n\t\tstd::cerr << e;\n}\n\nvoid view(const int e) {\n\tif(e == inf)\n\t\tstd::cerr << \"inf\";\n\telse if(e == -inf)\n\t\tstd::cerr << \"-inf\";\n\telse\n\t\tstd::cerr << e;\n}\n\ntemplate <typename T>\nvoid view(const T e) {\n\tstd::cerr << e;\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::pair<T, U> &p) {\n\tstd::cerr << \"(\";\n\tview(p.first);\n\tstd::cerr << \", \";\n\tview(p.second);\n\tstd::cerr << \")\";\n}\n\ntemplate <class T0, class T1, class T2>\nvoid view(const std::tuple<T0, T1, T2> &p) {\n\tstd::cerr << \"(\";\n\tview(std::get<0>(p));\n\tstd::cerr << \", \";\n\tview(std::get<1>(p));\n\tstd::cerr << \", \";\n\tview(std::get<2>(p));\n\tstd::cerr << \")\";\n}\n\ntemplate <class T0, class T1, class T2, class T3>\nvoid view(const std::tuple<T0, T1, T2, T3> &p) {\n\tstd::cerr << \"(\";\n\tview(std::get<0>(p));\n\tstd::cerr << \", \";\n\tview(std::get<1>(p));\n\tstd::cerr << \", \";\n\tview(std::get<2>(p));\n\tstd::cerr << \", \";\n\tview(std::get<3>(p));\n\tstd::cerr << \")\";\n}\n\ntemplate <typename T>\nvoid view(const std::set<T> &s) {\n\tif(s.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << \"{ \";\n\tfor(auto &t : s) {\n\t\tview(t);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <typename T>\nvoid view(const std::unordered_set<T> &s) {\n\tif(s.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << \"{ \";\n\tfor(auto &t : s) {\n\t\tview(t);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <typename T>\nvoid view(const std::vector<T> &v) {\n\tif(v.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << \"{ \";\n\tfor(const auto &e : v) {\n\t\tview(e);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <typename T>\nvoid view(const std::vector<std::vector<T>> &vv) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &v : vv) {\n\t\tstd::cerr << \"\\t\";\n\t\tview(v);\n\t\tstd::cerr << '\\n';\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::vector<std::pair<T, U>> &v) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &c : v) {\n\t\tstd::cerr << \"\\t(\";\n\t\tview(c.first);\n\t\tstd::cerr << \", \";\n\t\tview(c.second);\n\t\tstd::cerr << \")\\n\";\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <class T0, class T1, class T2>\nvoid view(const std::vector<std::tuple<T0, T1, T2>> &v) {\n\tif(v.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << '{';\n\tfor(const auto &t : v) {\n\t\tstd::cerr << \"\\n\\t\";\n\t\tview(t);\n\t\tstd::cerr << \",\";\n\t}\n\tstd::cerr << \"\\n}\";\n}\n\ntemplate <class T0, class T1, class T2, class T3>\nvoid view(const std::vector<std::tuple<T0, T1, T2, T3>> &v) {\n\tif(v.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << '{';\n\tfor(const auto &t : v) {\n\t\tstd::cerr << \"\\n\\t\";\n\t\tview(t);\n\t\tstd::cerr << \",\";\n\t}\n\tstd::cerr << \"\\n}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::map<T, U> &m) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &t : m) {\n\t\tstd::cerr << \"\\t[\";\n\t\tview(t.first);\n\t\tstd::cerr << \"] : \";\n\t\tview(t.second);\n\t\tstd::cerr << '\\n';\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::unordered_map<T, U> &m) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &t : m) {\n\t\tstd::cerr << \"\\t[\";\n\t\tview(t.first);\n\t\tstd::cerr << \"] : \";\n\t\tview(t.second);\n\t\tstd::cerr << '\\n';\n\t}\n\tstd::cerr << \"}\";\n}\n} // namespace viewer\n\n#pragma endregion\n\n// when debugging : g++ foo.cpp -DLOCAL\n#ifdef LOCAL\nvoid debug_out() {}\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head H, Tail... T) {\n\tviewer::view(H);\n\tstd::cerr << \", \";\n\tdebug_out(T...);\n}\n#define debug(...) \\\n\tdo { \\\n\t\tstd::cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"] : [\"; \\\n\t\tdebug_out(__VA_ARGS__); \\\n\t\tstd::cerr << \"\\b\\b]\\n\"; \\\n\t} while(0)\n#define dump(x) \\\n\tdo { \\\n\t\tstd::cerr << __LINE__ << \" \" << #x << \" : \"; \\\n\t\tviewer::view(x); \\\n\t\tstd::cerr << '\\n'; \\\n\t} while(0)\n\n#else\n#define debug(...) (void(0))\n#define dump(x) (void(0))\n#endif\n\n#pragma endregion\n\nvvvi make_dp_table(vector<int> a, vector<vi> x, vector<int> y) {\n\tint n = a.size();\n\tint n2 = n + n;\n\tint r = x.size();\n\trep(i, n) a.push_back(a[i]);\n\tVV<VV<int>> dp_rule(n, vvvi(n2, vvi(r, vi(11))));\n\n\tvvvi ret(n, vvi(n2, vi(31)));\n\n\trep(len, 0, n + 1) {\n\t\trep(left, n) {\n\t\t\tint right = left + len;\n\t\t\trep(rule_number, r) {\n\t\t\t\trep(xr, 0, x[rule_number].size() + 1) {\n\t\t\t\t\t// dp_rule[left][right][rulenumber][xr]\n\t\t\t\t\tauto &change = dp_rule[left][right][rule_number][xr];\n\n\t\t\t\t\tif(len == 0) {\n\t\t\t\t\t\tchange = (xr == 0);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tif(!xr) continue;\n\t\t\t\t\t\tif(len == 1) {\n\t\t\t\t\t\t\tif(a[left] == x[rule_number][0] && xr == 1) {\n\t\t\t\t\t\t\t\tchange = 1;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\trep(mid, left + 1, right) {\n\t\t\t\t\t\t\t\tint m = mid;\n\t\t\t\t\t\t\t\tint R = right;\n\t\t\t\t\t\t\t\tif(m >= n) {\n\t\t\t\t\t\t\t\t\tm -= n;\n\t\t\t\t\t\t\t\t\tR -= n;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tchange |= (dp_rule[left][mid][rule_number][xr - 1] && ret[m][R][x[rule_number][xr - 1]]);\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}\n\t\t\t}\n\n\t\t\tauto &change = ret[left][right];\n\t\t\tif(len == 1) {\n\t\t\t\tchange[a[left]] = 1;\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\trep(rule_number, r) {\n\t\t\t\tif(dp_rule[left][right][rule_number][x[rule_number].size()]) {\n\t\t\t\t\tchange[y[rule_number]] = 1;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\trep(rule_number, r){\n\t\t\t\trep(number, 31){\n\t\t\t\t\tif(x[rule_number][0] == number && change[number]){\n\t\t\t\t\t\tdp_rule[left][right][rule_number][1] = 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn ret;\n}\n\nint solve(int n) {\n\tint m, r;\n\tcin >> m >> r;\n\n\tvector<int> a, b;\n\trep(n) {\n\t\tINT(x);\n\t\ta.push_back(x);\n\t}\n\trep(m) {\n\t\tINT(x);\n\t\tb.push_back(x);\n\t}\n\n\t// vector<pair<vector<int>, int>> rules;\n\tvvi x(r);\n\tvi y(r);\n\trep(i, r) {\n\t\tint len;\n\t\tcin >> len;\n\t\tx[i].resize(len);\n\t\trep(j, len) cin >> x[i][j];\n\t\tcin >> y[i];\n\t}\n\n\tdebug(x, y);\n\n\tauto dp_a = make_dp_table(a, x, y);\n\tauto dp_b = make_dp_table(b, x, y);\n\n\n\trep(i, n) a.push_back(a[i]);\n\trep(i, m) b.push_back(b[i]);\n\n\tint n2 = n + n;\n\tint m2 = m + m;\n\n\tvvi longest_path(n2, vi(m2));\n\n\tVV<VV<int>> match(n, vvvi(n2, vvi(m, vi(m2))));\n\n\trep(i, n) rep(j, i + 1, n2) rep(k, m) rep(l, k + 1, m2) {\n\t\trep(num, 31) {\n\t\t\tif(dp_a[i][j][num] && dp_b[k][l][num]) {\n\t\t\t\tmatch[i][j][k][l] = 1;\n\t\t\t}\n\t\t}\n\t}\n\n\tint ans = -1;\n\n\trep(start_a, n) rep(start_b, m) {\n\t\tint goal_a = start_a + n;\n\t\tint goal_b = start_b + m;\n\n\t\tvvi dp(n + 1, vi(m + 1, -inf));\n\t\tdp[0][0] = 0;\n\n\t\trep(i, start_a + 1, goal_a + 1) rep(j, start_b + 1, goal_b + 1) {\n\t\t\trep(pre_i, start_a, i) rep(pre_j, start_b, j) {\n\t\t\t\tint c, d, e, f;\n\t\t\t\tif(pre_i >= n) {\n\t\t\t\t\tc = pre_i - n;\n\t\t\t\t\td = i - n;\n\t\t\t\t} else {\n\t\t\t\t\tc = pre_i;\n\t\t\t\t\td = i;\n\t\t\t\t}\n\t\t\t\tif(pre_j >= m) {\n\t\t\t\t\te = pre_j - m;\n\t\t\t\t\tf = j - m;\n\t\t\t\t} else {\n\t\t\t\t\te = pre_j;\n\t\t\t\t\tf = j;\n\t\t\t\t}\n\t\t\t\tif(match[c][d][e][f]) {\n\t\t\t\t\tchmax(dp[i - start_a][j - start_b], dp[pre_i - start_a][pre_j - start_b] + 1);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tchmax(ans, dp[n][m]);\n\t}\n\n\treturn ans;\n}\n\nint main() {\n\tstd::ios::sync_with_stdio(false);\n\tstd::cin.tie(nullptr);\n\tstd::cout << std::fixed << std::setprecision(15);\n\tsrand((unsigned)time(NULL));\n\n\tint n;\n\twhile(cin >> n) {\n\t\tif(!n) exit(0);\n\t\tcout << solve(n) << dl;\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":2860,"memory_kb":12612,"score_of_the_acc":-0.7465,"final_rank":15},{"submission_id":"aoj_1191_3709978","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate<typename T>\nstd::vector<T> table(int n, T v) { return std::vector<T>(n, v); }\n\ntemplate <class... Args>\nauto table(int n, Args... args) {\n auto val = table(args...);\n return std::vector<decltype(val)>(n, std::move(val));\n}\n\nconstexpr int max_a = 30;\nconstexpr int max_k = 10;\n\nauto calc_can_make(vector<int> const& a, vector<vector<int>> const& xs, vector<int> const& ys) {\n const int n = a.size() / 2, r_sz = xs.size();\n auto can_make = table(a.size(), a.size(), max_a + 1, false);\n // r_dp[i][j][k][l] := can match a[i..j) with xs[k][0..l) ?\n auto r_dp = table(a.size(), a.size(), r_sz, max_k + 1, false);\n for(int i = 0; i + 1 < n * 2; ++i) {\n can_make[i][i + 1][a[i]] = true;\n }\n for(int i = 0; i < n; ++i) {\n for(int j = 0; j < r_sz; ++j) {\n r_dp[i][i][j][0] = true;\n }\n }\n for(int len = 1; len <= n; ++len) {\n for(int l = 0; l + len < 2 * n; ++l) {\n const int r = l + len;\n for(int i = 0; i < r_sz; ++i) {\n for(int j = 1; j <= (int)xs[i].size(); ++j) {\n for(int k = l; k < r; ++k) {\n r_dp[l][r][i][j] = r_dp[l][r][i][j] | (r_dp[l][k][i][j - 1] && can_make[k][r][xs[i][j - 1]]);\n }\n }\n }\n for(int i = 0; i < r_sz; ++i) {\n if(r_dp[l][r][i][xs[i].size()]) {\n can_make[l][r][ys[i]] = true;\n }\n }\n for(int i = 0; i < r_sz; ++i) {\n if(can_make[l][r][xs[i][0]]) {\n r_dp[l][r][i][1] = true;\n }\n }\n }\n }\n return can_make;\n}\n\nint main() {\n int n, m, r;\n while(cin >> n >> m >> r, n) {\n vector<int> a(n * 2), b(m * 2);\n vector<vector<int>> xs(r);\n vector<int> ys(r);\n for(int i = 0; i < n; ++i) {\n cin >> a[i];\n a[i + n] = a[i];\n }\n for(int i = 0; i < m; ++i) {\n cin >> b[i];\n b[i + m] = b[i];\n }\n for(int i = 0; i < r; ++i) {\n int k; cin >> k;\n xs[i].resize(k);\n for(auto& x : xs[i]) cin >> x;\n cin >> ys[i];\n }\n\n auto can_make_a = calc_can_make(a, xs, ys);\n auto can_make_b = calc_can_make(b, xs, ys);\n int ans = -1;\n for(int s1 = 0; s1 < n; ++s1) {\n for(int s2 = 0; s2 < m; ++s2) {\n vector<vector<int>> dp(n + 1, vector<int>(m + 1, -1));\n dp[0][0] = 0;\n for(int i = 0; i < n; ++i) {\n for(int j = 0; j < m; ++j) {\n if(dp[i][j] == -1) continue;\n for(int k = 1; k <= 30; ++k) {\n for(int l1 = 1; l1 <= n - i; ++l1) {\n if(!can_make_a[s1 + i][s1 + i + l1][k]) continue;\n for(int l2 = 1; l2 <= m - j; ++l2) {\n if(can_make_a[s1 + i][s1 + i + l1][k] && can_make_b[s2 + j][s2 + j + l2][k]) {\n dp[i + l1][j + l2] = max(dp[i + l1][j + l2], dp[i][j] + 1);\n }\n }\n }\n }\n }\n }\n ans = max(ans, dp[n][m]);\n }\n }\n\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":1920,"memory_kb":14220,"score_of_the_acc":-0.6745,"final_rank":14},{"submission_id":"aoj_1191_3672228","code_snippet":"#include <bits/stdc++.h>\n\nclass Solve {\nprivate:\n\tusing vi = std::vector<int>;\n\tusing vvi = std::vector<vi>;\n\tusing vvvi = std::vector<vvi>;\n\tusing vvvvi = std::vector<vvvi>;\n\n\tusing vb = std::vector<bool>;\n\tusing vvb = std::vector<vb>;\n\tusing vvvb = std::vector<vvb>;\n\n\tint n, m, r;\n\tvvvi R;\n\n\tvi inputVector(int size)\n\t{\n\t\tstd::vector<int> ret(size);\n\t\tfor (auto& e: ret)\n\t\t{\n\t\t\tscanf(\"%d\", &e);\n\t\t\te--;\n\t\t}\n\t\treturn std::move(ret);\n\t}\n\tvoid inputR()\n\t{\n\t\tR.resize(30);\n\t\tfor (int i{}; i < r; i++)\n\t\t{\n\t\t\tint k;\n\t\t\tscanf(\"%d\", &k);\n\t\t\tstd::vector<int> tmp(k);\n\t\t\tfor (auto& e: tmp)\n\t\t\t{\n\t\t\t\tscanf(\"%d\", &e);\n\t\t\t\te--;\n\t\t\t}\n\t\t\tint y;\n\t\t\tscanf(\"%d\", &y);\n\t\t\ty--;\n\t\t\tR[y].push_back(tmp);\n\t\t}\n\t}\n\n\tvoid execute(vi& arr, vvvi& charTable, vvvb& canMake)\n\t{\n\t\tint size{(int)arr.size()};\n\t\tfor (int i{}; i < size; i++)\n\t\t{\n\t\t\tcharTable[i][arr[i]].push_back((i + 1) % size);\n\t\t\tcanMake[i][(i + 1) % size][arr[i]] = true;\n\t\t}\n\t\tfor (int width{2}; width <= size; width++)\n\t\t\tfor (int left{}; left < size; left++)\n\t\t\t\tfor (int char_i{}; char_i < 30; char_i++)\n\t\t\t\t\tfor (auto& e: R[char_i])\n\t\t\t\t\t\tif (e.size() <= width && stringFound(e, 0, left, width, charTable, canMake))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tcharTable[left][char_i].push_back((left + width) % size);\n\t\t\t\t\t\t\tcanMake[left][(left + width) % size][char_i] = true;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t}\n\n\tbool stringFound(vi& arr, int arr_i, int left, int width, vvvi& charTable, vvvb& canMake)\n\t{\n\t\tint char_i{arr[arr_i]}, size{(int)charTable.size()};\n\t\tif (arr_i + 1 == (int)arr.size())\n\t\t\treturn canMake[left][(left + width) % size][char_i];\n\t\tfor (auto& e: charTable[left][char_i])\n\t\t{\n\t\t\tint next_width{e};\n\t\t\tif (e <= left) next_width += size;\n\t\t\tnext_width -= left;\n\t\t\tif ((int)arr.size() - (arr_i + 1) > width - next_width) break;\n\t\t\tif (stringFound(arr, arr_i + 1, e, width - next_width, charTable, canMake))\n\t\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n\npublic:\n\tbool is_last_query{};\n\tSolve()\n\t{\n\t\tscanf(\"%d%d%d\", &n, &m, &r);\n\t\tif (n == 0)\n\t\t{\n\t\t\tis_last_query = true;\n\t\t\treturn;\n\t\t}\n\t\tvi A(inputVector(n)), B(inputVector(m));\n\t\tinputR();\n\t\tvvvb canMakeA(n, vvb(n, vb(30))), canMakeB(m, vvb(m, vb(30)));\n\t\tvvvi charTableA(n, vvi(30)), charTableB(m, vvi(30));\n\t\texecute(A, charTableA, canMakeA);\n\t\texecute(B, charTableB, canMakeB);\n\t\tvvvvi dp(n, vvvi(n, vvi(m, vi(m))));\n\t\tfor (int la{}; la < n; la++)\n\t\t\tfor (int lb{}; lb < m; lb++)\n\t\t\t\tfor (int ra{}; ra < n; ra++)\n\t\t\t\t\tfor (int rb{}; rb < m; rb++)\n\t\t\t\t\t\tfor (int char_i{}; char_i < 30; char_i++)\n\t\t\t\t\t\t\tif (canMakeA[la][ra][char_i] && canMakeB[lb][rb][char_i])\n\t\t\t\t\t\t\t\tdp[la][ra][lb][rb] = 1;\n\t\tfor (int wa{2}; wa <= n; wa++)\n\t\t\tfor (int wb{2}; wb <= m; wb++)\n\t\t\t\tfor (int la{}; la < n; la++)\n\t\t\t\t{\n\t\t\t\t\tint ra{(la + wa) % n};\n\t\t\t\t\tfor (int lb{}; lb < m; lb++)\n\t\t\t\t\t{\n\t\t\t\t\t\tint rb{(lb + wb) % m};\n\t\t\t\t\t\tfor (int ma{(la + 1) % n}; ma != ra; ma = (ma + 1) % n)\n\t\t\t\t\t\t\tfor (int mb{(lb + 1) % m}; mb != rb; mb = (mb + 1) % m)\n\t\t\t\t\t\t\t\tif (dp[la][ma][lb][mb] > 0 && dp[ma][ra][mb][rb] > 0)\n\t\t\t\t\t\t\t\t\tdp[la][ra][lb][rb] = std::max(dp[la][ra][lb][rb], dp[la][ma][lb][mb] + dp[ma][ra][mb][rb]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\tint max{};\n\n\t\tfor (int la{}; la < n; la++)\n\t\t\tfor (int lb{}; lb < m; lb++)\n\t\t\t\tmax = std::max(max, dp[la][la][lb][lb]);\n\t\tif (max == 0) puts(\"-1\");\n\t\telse printf(\"%d\\n\", max);\n\t}\n};\n\nint main()\n{\n\twhile (!Solve().is_last_query);\n\n\treturn 0;\n}","accuracy":1,"time_ms":2660,"memory_kb":5452,"score_of_the_acc":-0.4354,"final_rank":11},{"submission_id":"aoj_1191_3215735","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define NUM 60\n\nenum Type{\n\tA,\n\tB,\n};\n\nint len[2],num_rule;\nint table[2][NUM];\nint num_left[NUM],from_table[NUM][10],to_table[NUM];\nint max_match[NUM][NUM];\nbool dp[2][NUM][NUM][30];\nbool dp2[2][NUM][NUM][NUM][11];\n\nvoid make_dp(Type type){\n\n\tint calc_len = 2*len[type]-1;\n\n\tfor(int left = 0; left < calc_len; left++){\n\t\tfor(int right = left; right < calc_len; right++){\n\n\t\t\tfor(int num = 0; num < 30; num++){\n\t\t\t\tdp[type][left][right][num] = false;\n\t\t\t}\n\n\t\t\tfor(int i = 0; i < num_rule; i++){\n\t\t\t\tfor(int k = 0; k <= num_left[i]; k++){\n\t\t\t\t\tdp2[type][left][right][i][k] = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int i = 0; i < calc_len; i++){\n\t\tdp[type][i][i][table[type][i]] = true;\n\t}\n\n\tint right;\n\n\tfor(int length = 1; length <= len[type]; length++){\n\t\tfor(int left = 0; left+length <= calc_len; left++){\n\n\t\t\tright = left+length-1;\n\n\t\t\tfor(int i = 0; i < num_rule; i++){\n\t\t\t\tfor(int k = 0; k < num_left[i]; k++){\n\t\t\t\t\tfor(int mid = left; mid < right; mid++){\n\n\t\t\t\t\t\tif(dp2[type][left][mid][i][k] == true && dp[type][mid+1][right][from_table[i][k]] == true){\n\t\t\t\t\t\t\tdp2[type][left][right][i][k+1] = true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfor(int i = 0; i < num_rule; i++){\n\t\t\t\tif(dp2[type][left][right][i][num_left[i]]){\n\t\t\t\t\tdp[type][left][right][to_table[i]] = true;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfor(int i = 0; i < num_rule; i++){\n\t\t\t\tif(dp[type][left][right][from_table[i][0]]){\n\t\t\t\t\tdp2[type][left][right][i][1] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid func(){\n\n\tfor(int i = 0; i < len[A]; i++){\n\n\t\tscanf(\"%d\",&table[A][i]);\n\t\ttable[A][i]--;\n\t\ttable[A][i+len[A]] = table[A][i];\n\t}\n\n\tfor(int i = 0; i < len[B]; i++){\n\n\t\tscanf(\"%d\",&table[B][i]);\n\t\ttable[B][i]--;\n\t\ttable[B][i+len[B]] = table[B][i];\n\t}\n\n\tfor(int i = 0; i < num_rule; i++){\n\n\t\tscanf(\"%d\",&num_left[i]);\n\n\t\tfor(int k = 0; k < num_left[i]; k++){\n\t\t\tscanf(\"%d\",&from_table[i][k]);\n\t\t\tfrom_table[i][k]--;\n\t\t}\n\t\tscanf(\"%d\",&to_table[i]);\n\t\tto_table[i]--;\n\t}\n\n\tmake_dp(A);\n\tmake_dp(B);\n\n\tint ans = -1;\n\tint A_right,B_right;\n\n\tfor(int A_left = 0; A_left < len[A]; A_left++){\n\t\tfor(int B_left = 0; B_left < len[B]; B_left++){\n\n\t\t\tfor(int i = 0; i <= len[A]; i++){\n\t\t\t\tfor(int k = 0; k <= len[B]; k++){\n\t\t\t\t\tmax_match[i][k] = -1;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tmax_match[0][0] = 0;\n\n\t\t\tfor(int len_A = 1; len_A <= len[A]; len_A++){\n\t\t\t\tA_right = A_left+len_A-1;\n\t\t\t\tfor(int len_B = 1; len_B <= len[B]; len_B++){\n\t\t\t\t\tB_right = B_left+len_B-1;\n\t\t\t\t\tfor(int A_mid = A_left; A_mid <= A_right; A_mid++){\n\t\t\t\t\t\tfor(int B_mid = B_left; B_mid <= B_right; B_mid++){\n\t\t\t\t\t\t\tif(max_match[A_mid-A_left][B_mid-B_left] == -1)continue;\n\n\t\t\t\t\t\t\tfor(int i = 0; i < 30; i++){\n\t\t\t\t\t\t\t\tif(dp[A][A_mid][A_right][i] == true && dp[B][B_mid][B_right][i] == true){\n\t\t\t\t\t\t\t\t\tmax_match[len_A][len_B] = max(max_match[len_A][len_B],max_match[A_mid-A_left][B_mid-B_left]+1);\n\t\t\t\t\t\t\t\t}\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}\n\t\t\t\tans = max(ans,max_match[len[A]][len[B]]);\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"%d\\n\",ans);\n}\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%d %d %d\",&len[A],&len[B],&num_rule);\n\t\tif(len[A] == 0 && len[B] == 0 && num_rule == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":7170,"memory_kb":5380,"score_of_the_acc":-1.0825,"final_rank":17},{"submission_id":"aoj_1191_3170823","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n#define dbg(x) cout<<#x\" = \"<<((x))<<endl\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\"(\"<<p.fi<<\",\"<<p.se<<\")\";return o;}\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\"[\";for(T t:v){o<<t<<\",\";}o<<\"]\";return o;}\n\nint main(){\n int n,m,RULE;\n while(scanf(\" %d %d %d\", &n, &m, &RULE),n){\n vector<int> A(n),B(m);\n rep(i,n){\n scanf(\" %d\", &A[i]);\n --A[i];\n }\n rep(i,m){\n scanf(\" %d\", &B[i]);\n --B[i];\n }\n\n vector< pair<vector<int>,int> > rule(RULE);\n rep(i,RULE){\n int k;\n scanf(\" %d\", &k);\n\n vector<int> x(k);\n int y;\n rep(j,k){\n scanf(\" %d\", &x[j]);\n --x[j];\n }\n scanf(\" %d\", &y);\n --y;\n\n rule[i] = {x,y};\n }\n\n auto make_f = [&](vector<int> &v){\n int V = v.size();\n int N = 2*V;\n vector<vector<int>> f(N,vector<int>(N));\n\n rep(i,N){\n int vv = v[i%V];\n f[i][i] |= (1<<vv);\n }\n\n for(int b=2; b<=V; ++b){\n for(int l=0; l+b-1<N; ++l){\n int r = l+b-1;\n\n // calc f[l][r]\n rep(rr,RULE){\n vector<int> x = rule[rr].fi;\n int y = rule[rr].se;\n\n int X = x.size();\n vector<vector<bool>> valid(b+1, vector<bool>(X+1));\n valid[0][0] = true;\n rep(i,b)rep(j,X)if(valid[i][j]){\n int val = x[j];\n for(int k=i; k<b; ++k){\n if(f[l+i][l+k]>>val&1) valid[k+1][j+1] = true;\n }\n }\n\n if(valid[b][X]) f[l][r] |= (1<<y);\n }\n }\n }\n\n // rep(i,N)rep(j,N) printf(\"f[%d][%d] = %d\\n\",i,j,f[i][j]);\n return f;\n };\n\n vector<vector<int>> fa = make_f(A), fb = make_f(B);\n int ans = -1;\n rep(i,n)rep(j,m){\n // printf(\"CALC %d %d\\n\",i,j);\n vector<vector<int>> dp(n+1,vector<int>(m+1,-1));\n dp[0][0]=0;\n rep(ii,n)rep(jj,m)if(dp[ii][jj]>=0){\n for(int ni=ii+1; ni<=n; ++ni)for(int nj=jj+1; nj<=m; ++nj){\n if(fa[i+ii][i+ni-1]&fb[j+jj][j+nj-1]) dp[ni][nj] = max(dp[ni][nj], dp[ii][jj]+1);\n }\n }\n ans = max(ans, dp[n][m]);\n }\n\n printf(\"%d\\n\", ans);\n }\n return 0;\n}","accuracy":1,"time_ms":1030,"memory_kb":3288,"score_of_the_acc":-0.1153,"final_rank":4}],"string":"[\n {\n \"submission_id\": \"aoj_1191_10335939\",\n \"code_snippet\": \"// AOJ #1191 Rotate and Rewrite\\n// 2025.3.30\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define NMAX 50\\nconst int BAS = 1000;\\nint A[NMAX+5], B[NMAX+5];\\nbool dpA[NMAX+5][NMAX+5][600];\\nbool dpB[NMAX+5][NMAX+5][600];\\nint sudpA[NMAX+5][NMAX+5];\\nint sudpB[NMAX+5][NMAX+5];\\n\\nint main(){\\n while (true) {\\n int n, m, r, N, M;\\n cin >> n >> m >> r;\\n if(n == 0) break;\\n N = n << 1, M = m << 1;\\n\\n for (int i = 0; i < n; i++) cin >> A[i];\\n for (int i = n; i < N; i++) A[i] = A[i - n];\\n\\n for (int i = 0; i < m; i++) cin >> B[i];\\n for (int i = m; i < M; i++) B[i] = B[i - m];\\n\\n vector<tuple<int,int,int>> rules;\\n int mkaz = 30;\\n for (int h = 0; h < r; h++){\\n int K;\\n cin >> K;\\n int pre;\\n cin >> pre;\\n for (int i = 1; i < K; i++){\\n int cur;\\n cin >> cur;\\n if(i + 1 < K){\\n mkaz++;\\n rules.push_back(make_tuple(pre, cur, mkaz));\\n pre = mkaz;\\n } else {\\n int out;\\n cin >> out;\\n rules.push_back(make_tuple(pre, cur, out));\\n }\\n }\\n }\\n\\n memset(dpA, 0, sizeof(dpA));\\n memset(dpB, 0, sizeof(dpB));\\n for (int i = 0; i < N; i++) dpA[i][i+1][ A[i] ] = true;\\n for (int i = 0; i < M; i++) dpB[i][i+1][ B[i] ] = true;\\n\\n memset(sudpA, 0, sizeof(sudpA));\\n memset(sudpB, 0, sizeof(sudpB));\\n for (int i = 1; i <= n; i++){\\n for (int L = 0; L + i <= N; L++){\\n int R = L + i;\\n for (size_t j = 0; j < rules.size(); j++){\\n int x, y, z;\\n tie(x, y, z) = rules[j];\\n for (int s = L + 1; s < R; s++)\\n dpA[L][R][z] |= (dpA[L][s][x] && dpA[s][R][y]);\\n }\\n for (int k = 1; k <= 30; k++)\\n if (dpA[L][R][k]) sudpA[L][R] += (1 << k);\\n }\\n }\\n for (int i = 1; i <= m; i++){\\n for (int L = 0; L + i <= M; L++){\\n int R = L + i;\\n for (size_t j = 0; j < rules.size(); j++){\\n int x, y, z;\\n tie(x, y, z) = rules[j];\\n for (int s = L + 1; s < R; s++)\\n dpB[L][R][z] |= (dpB[L][s][x] && dpB[s][R][y]);\\n }\\n for (int k = 1; k <= 30; k++)\\n if (dpB[L][R][k]) sudpB[L][R] += (1 << k);\\n }\\n }\\n\\n int ans = -1;\\n for (int As = 0; As < n; As++){\\n for (int Bs = 0; Bs < m; Bs++){\\n int ep[51][51] = {0};\\n ep[As][Bs] = BAS;\\n for (int Ax = As; Ax < As + n; Ax++){\\n for (int Bx = Bs; Bx < Bs + m; Bx++){\\n if (ep[Ax][Bx] == 0) continue;\\n for (int Ay = Ax + 1; Ay <= As + n; Ay++){\\n for (int By = Bx + 1; By <= Bs + m; By++){\\n if (sudpA[Ax][Ay] & sudpB[Bx][By])\\n ep[Ay][By] = max(ep[Ay][By], ep[Ax][Bx] + 1);\\n }\\n }\\n }\\n }\\n ans = max(ans, ep[As+n][Bs+m] - BAS);\\n }\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 230,\n \"memory_kb\": 6792,\n \"score_of_the_acc\": -0.1381,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1191_10335936\",\n \"code_snippet\": \"// AOJ #1191 Rotate and Rewrite\\n// 2025.3.30\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define NMAX 50\\nconst int BAS = 10000;\\nbool dpA[NMAX+5][NMAX+5][600];\\nbool dpB[NMAX+5][NMAX+5][600];\\nint sudpA[NMAX+5][NMAX+5];\\nint sudpB[NMAX+5][NMAX+5];\\n\\nint main(){\\n while (true) {\\n int n, m, r, N, M;\\n cin >> n >> m >> r;\\n if(n == 0) break;\\n N = n << 1, M = m << 1;\\n\\n int A[NMAX] = {0}, B[NMAX] = {0};\\n for (int i = 0; i < n; i++) cin >> A[i];\\n for (int i = n; i < N; i++) A[i] = A[i - n];\\n\\n for (int i = 0; i < m; i++) cin >> B[i];\\n for (int i = m; i < M; i++) B[i] = B[i - m];\\n\\n vector<tuple<int,int,int>> rules;\\n int mkaz = 30;\\n for (int h = 0; h < r; h++){\\n int K;\\n cin >> K;\\n int pre;\\n cin >> pre;\\n for (int i = 1; i < K; i++){\\n int cur;\\n cin >> cur;\\n if(i + 1 < K){\\n mkaz++;\\n rules.push_back(make_tuple(pre, cur, mkaz));\\n pre = mkaz;\\n } else {\\n int out;\\n cin >> out;\\n rules.push_back(make_tuple(pre, cur, out));\\n }\\n }\\n }\\n\\n memset(dpA, 0, sizeof(dpA));\\n memset(dpB, 0, sizeof(dpB));\\n for (int i = 0; i < N; i++) dpA[i][i+1][ A[i] ] = true;\\n for (int i = 0; i < M; i++) dpB[i][i+1][ B[i] ] = true;\\n\\n memset(sudpA, 0, sizeof(sudpA));\\n memset(sudpB, 0, sizeof(sudpB));\\n for (int i = 1; i <= n; i++){\\n for (int L = 0; L + i <= N; L++){\\n int R = L + i;\\n for (size_t j = 0; j < rules.size(); j++){\\n int x, y, z;\\n tie(x, y, z) = rules[j];\\n for (int s = L + 1; s < R; s++)\\n dpA[L][R][z] |= (dpA[L][s][x] && dpA[s][R][y]);\\n }\\n for (int k = 1; k <= 30; k++)\\n if (dpA[L][R][k]) sudpA[L][R] += (1 << k);\\n }\\n }\\n for (int i = 1; i <= m; i++){\\n for (int L = 0; L + i <= M; L++){\\n int R = L + i;\\n for (size_t j = 0; j < rules.size(); j++){\\n int x, y, z;\\n tie(x, y, z) = rules[j];\\n for (int s = L + 1; s < R; s++)\\n dpB[L][R][z] |= (dpB[L][s][x] && dpB[s][R][y]);\\n }\\n for (int k = 1; k <= 30; k++)\\n if (dpB[L][R][k]) sudpB[L][R] += (1 << k);\\n }\\n }\\n\\n int ans = -1;\\n for (int As = 0; As < n; As++){\\n for (int Bs = 0; Bs < m; Bs++){\\n int ep[51][51] = {0};\\n ep[As][Bs] = BAS;\\n for (int Ax = As; Ax < As + n; Ax++){\\n for (int Bx = Bs; Bx < Bs + m; Bx++){\\n if (ep[Ax][Bx] == 0) continue;\\n for (int Ay = Ax + 1; Ay <= As + n; Ay++){\\n for (int By = Bx + 1; By <= Bs + m; By++){\\n if (sudpA[Ax][Ay] & sudpB[Bx][By])\\n ep[Ay][By] = max(ep[Ay][By], ep[Ax][Bx] + 1);\\n }\\n }\\n }\\n }\\n ans = max(ans, ep[As+n][Bs+m] - BAS);\\n }\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 230,\n \"memory_kb\": 6904,\n \"score_of_the_acc\": -0.1425,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1191_10335930\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define NMAX 65\\n\\nint N, M, R;\\nint a[NMAX], b[NMAX];\\nint nRule[NMAX];\\nint fRule[NMAX][15];\\nint tRule[NMAX];\\n\\nbool canA[NMAX][NMAX][30], canB[NMAX][NMAX][30];\\nbool tmpDP[NMAX][NMAX][NMAX][10];\\n\\nvoid calccan(int *arr, int orig, bool can[NMAX][NMAX][30]) {\\n for (int i = 0; i < NMAX; i++){\\n for (int j = 0; j < NMAX; j++){\\n for (int k = 0; k < 30; k++) can[i][j][k] = false;\\n }\\n }\\n for (int i = 0; i < NMAX; i++){\\n for (int j = 0; j < NMAX; j++){\\n for (int r = 0; r < NMAX; r++){\\n for (int l = 0; l < 10; l++) tmpDP[i][j][r][l] = (i == j && l == 0);\\n }\\n }\\n }\\n for (int i = 0; i < 2 * orig - 1; i++) can[i][i+1][ arr[i] ] = true;\\n\\n for (int len = 1; len <= orig; len++){\\n for (int l = 0; l + len <= 2 * orig - 1; l++){\\n int r = l + len;\\n for (int rule = 0; rule < R; rule++){\\n for (int j = 1; j <= nRule[rule]; j++){\\n for (int x = l; x < r; x++){\\n if (tmpDP[l][x][rule][j-1] && can[x][r][ fRule[rule][j-1] ])\\n tmpDP[l][r][rule][j] = true;\\n }\\n }\\n }\\n for (int rule = 0; rule < R; rule++)\\n if (tmpDP[l][r][rule][ nRule[rule] ]) can[l][r][ tRule[rule] ] = true;\\n for (int rule = 0; rule < R; rule++)\\n if (can[l][r][ fRule[rule][0] ]) tmpDP[l][r][rule][1] = true;\\n }\\n }\\n}\\n\\nint main(){\\n ios::sync_with_stdio(0);\\n cin.tie(0);\\n\\n while (true) {\\n cin >> N >> M >> R;\\n if (N == 0) break;\\n\\n for (int i = 0; i < N; i++) cin >> a[i], a[i]--;\\n for (int i = 0; i < N; i++) a[i + N] = a[i];\\n for (int i = 0; i < M; i++) cin >> b[i], b[i]--;\\n for (int i = 0; i < M; i++) b[i + M] = b[i];\\n\\n for (int i = 0; i < R; i++){\\n int len;\\n cin >> len;\\n nRule[i] = len;\\n for (int j = 0; j < len; j++){\\n cin >> fRule[i][j];\\n fRule[i][j]--;\\n }\\n cin >> tRule[i];\\n tRule[i]--;\\n }\\n\\n calccan(a, N, canA);\\n calccan(b, M, canB);\\n\\n int ans = -1;\\n for (int x = 0; x < N; x++){\\n for (int y = 0; y < M; y++){\\n int dp[26][26];\\n for (int i = 0; i < 26; i++){\\n for (int j = 0; j < 26; j++) dp[i][j] = -1;\\n }\\n dp[0][0] = 0;\\n for (int i = 0; i <= N; i++){\\n for (int j = 0; j <= M; j++){\\n if (dp[i][j] < 0) continue;\\n for (int k = 0; k < 30; k++){\\n for (int c = 1; c <= N - i; c++){\\n for (int d = 1; d <= M - j; d++){\\n if (canA[x + i][x + i + c][k] && canB[y + j][y + j + d][k])\\n dp[i + c][j + d] = max(dp[i + c][j + d], dp[i][j] + 1);\\n }\\n }\\n }\\n }\\n }\\n ans = max(ans, dp[N][M]);\\n }\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 7140,\n \"memory_kb\": 6324,\n \"score_of_the_acc\": -1.1154,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1191_9278811\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate<class T>\\nbool chmax(T &a, const T &b) {if (a < b) {a = b; return 1;} return 0;}\\n\\nusing ll = long long;\\n\\nbool is_end = false;\\n\\nvoid solve()\\n{\\n ll N, M, R; cin >> N >> M >> R;\\n if (N == 0 && M == 0 && R == 0)\\n {\\n is_end = true;\\n return;\\n }\\n vector<ll> A(N), B(M);\\n for (auto &a : A) cin >> a, a--;\\n for (auto &b : B) cin >> b, b--;\\n vector< pair<ll, vector<ll>> > repl(R);\\n for (int i = 0; i < R; ++i)\\n {\\n int k; cin >> k;\\n vector<ll> vec;\\n for (int i = 0; i < k; ++i)\\n {\\n ll x; cin >> x;\\n x--;\\n vec.emplace_back(x);\\n }\\n int y; cin >> y;\\n y--;\\n \\n repl[i] = {y, vec};\\n }\\n \\n vector<ll> AA(2 * N), BB(2 * M);\\n for (int i = 0; i < N; ++i) AA[i] = AA[N + i] = A[i];\\n for (int i = 0; i < M; ++i) BB[i] = BB[M + i] = B[i];\\n \\n // path[from][char][to] := false / true\\n using bs = bitset<60>;\\n vector<vector<bs>> pathA(2 * N, vector<bs>(30, 0));\\n vector<vector<bs>> pathB(2 * M, vector<bs>(30, 0));\\n {\\n for (int i = 0; i < 2 * N; ++i)\\n {\\n int a = AA[i];\\n pathA[i][a][i + 1] = true;\\n }\\n for (int i = 0; i < 2 * M; ++i)\\n {\\n int b = BB[i];\\n pathB[i][b][i+1] = true;\\n }\\n }\\n \\n // A\\n for (int diff = 2; diff <= N; ++diff)\\n {\\n for (int from = 0; from < 2 * N; ++from)\\n {\\n int to = from + diff;\\n if (to > 2 * N) break;\\n \\n for (int r = 0; r < R; ++r)\\n {\\n auto [c, rule] = repl[r];\\n \\n bs vec(0), nvec(0);\\n vec[from] = true;\\n for (auto x : rule)\\n {\\n for (int pos = from; pos < to; ++pos)\\n {\\n if (vec[pos]) nvec |= pathA[pos][x];\\n }\\n \\n swap(vec, nvec);\\n nvec = 0;\\n }\\n if (vec[to]) pathA[from][c][to] = true;\\n \\n }\\n }\\n }\\n \\n // B\\n for (int diff = 2; diff <= M; ++diff)\\n {\\n for (int from = 0; from < 2 * M; ++from)\\n {\\n int to = from + diff;\\n if (to > 2 * M) break;\\n \\n for (int r = 0; r < R; ++r)\\n {\\n auto [c, rule] = repl[r];\\n \\n bs vec(0), nvec(0);\\n vec[from] = true;\\n for (auto x : rule)\\n {\\n for (int pos = from; pos < to; ++pos)\\n {\\n if (vec[pos]) nvec |= pathB[pos][x];\\n }\\n \\n swap(vec, nvec);\\n nvec = 0;\\n }\\n if (vec[to]) pathB[from][c][to] = true;\\n \\n }\\n }\\n }\\n \\n // for (int from = 0; from < 2 * N; ++from)\\n // {\\n // for (int to = 0; to < 2 * N; ++to)\\n // {\\n // for (int c = 0; c < 30; ++c)\\n // {\\n // if (pathA[from][c][to]) cout << from << \\\" \\\" << to << \\\" \\\" << c << endl;\\n // }\\n // }\\n // }\\n \\n // cout << \\\"B\\\" << endl;\\n // for (int from = 0; from < 2 * M; ++from)\\n // {\\n // for (int to = 0; to < 2 * M; ++to)\\n // {\\n // for (int c = 0; c < 30; ++c)\\n // {\\n // if (pathB[from][c][to]) cout << from << \\\" \\\" << to << \\\" \\\" << c << endl;\\n // }\\n // }\\n // }\\n \\n vector graph(2*N, vector(2*M, vector<pair<int, int>>()));\\n for (int sa = 0; sa < 2*N; ++sa)\\n {\\n for (int sb = 0; sb < 2*M; ++sb)\\n {\\n for (int ta = sa+1; ta < 2*N; ++ta)\\n {\\n for (int tb = sb+1; tb < 2*M; ++tb)\\n {\\n bool flg = false;\\n for (int c = 0; c < 30; ++c)\\n {\\n if (pathA[sa][c][ta] && pathB[sb][c][tb]) flg = true;\\n }\\n if (flg) graph[sa][sb].push_back({ta, tb});\\n // if (flg) cout << sa << \\\" \\\" << sb << \\\" \\\" << ta << \\\" \\\" << tb << endl;\\n }\\n }\\n }\\n }\\n \\n int res = -1;\\n for (int sa = 0; sa < N; ++sa)\\n {\\n for (int sb = 0; sb < M; ++sb)\\n {\\n int ta = sa + N, tb = sb + M;\\n \\n vector dist(2*N, vector<int>(2*M, -1));\\n dist[sa][sb] = 0;\\n for (int a = sa; a < 2*N; ++a)\\n {\\n for (int b = sb; b < 2*M; ++b)\\n {\\n if(dist[a][b] == -1) continue;\\n for (auto [na, nb] : graph[a][b])\\n {\\n chmax(dist[na][nb], dist[a][b] + 1);\\n }\\n }\\n }\\n \\n chmax(res, dist[ta][tb]);\\n }\\n }\\n \\n cout << res << endl;\\n \\n return;\\n}\\n\\nint main()\\n{\\n while (!is_end)\\n {\\n solve();\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 950,\n \"memory_kb\": 13588,\n \"score_of_the_acc\": -0.5098,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1191_8324049\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nconst int INF = 1012345678;\\n\\nstruct rewrite {\\n\\tint len, target;\\n\\tvector<int> seq;\\n};\\n\\nvector<vector<uint32_t> > get_createable(int N, int K, int L, const vector<int>& A, const vector<rewrite>& R) {\\n\\tvector<vector<uint32_t> > dp(N + 1);\\n\\tvector<vector<vector<vector<bool> > > > subdp(K);\\n\\tfor (int i = 0; i < K; i++) {\\n\\t\\tsubdp[i].resize(N + 1);\\n\\t\\tfor (int r = 0; r <= N; r++) {\\n\\t\\t\\tsubdp[i][r].resize(r, vector<bool>(R[i].len + 1));\\n\\t\\t}\\n\\t}\\n\\tfor (int r = 1; r <= N; r++) {\\n\\t\\tdp[r].resize(r);\\n\\t\\tdp[r][r - 1] |= uint32_t(1) << A[r - 1];\\n\\t\\tfor (int l = r - 1; l >= 0; l--) {\\n\\t\\t\\tfor (int m = l + 1; m < r; m++) {\\n\\t\\t\\t\\tfor (int i = 0; i < K; i++) {\\n\\t\\t\\t\\t\\tfor (int j = 1; j < R[i].len; j++) {\\n\\t\\t\\t\\t\\t\\tif (subdp[i][m][l][j] && ((dp[r][m] >> R[i].seq[j]) & 1) == 1) {\\n\\t\\t\\t\\t\\t\\t\\tsubdp[i][r][l][j + 1] = true;\\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\\tfor (int i = 0; i < K; i++) {\\n\\t\\t\\t\\tif (subdp[i][r][l][R[i].len]) {\\n\\t\\t\\t\\t\\tdp[r][l] |= uint32_t(1) << R[i].target;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tfor (int i = 0; i < K; i++) {\\n\\t\\t\\t\\tif (((dp[r][l] >> R[i].seq[0]) & 1) == 1) {\\n\\t\\t\\t\\t\\tsubdp[i][r][l][1] = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn dp;\\n}\\n\\nint main() {\\n\\twhile (true) {\\n\\t\\t// step #1. input\\n\\t\\tint N, M, K;\\n\\t\\tcin >> N >> M >> K;\\n\\t\\tif (N == 0 && M == 0 && K == 0) {\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tvector<int> A(N), B(M);\\n\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\tcin >> A[i];\\n\\t\\t}\\n\\t\\tfor (int i = 0; i < M; i++) {\\n\\t\\t\\tcin >> B[i];\\n\\t\\t}\\n\\t\\tvector<rewrite> R(K);\\n\\t\\tfor (int i = 0; i < K; i++) {\\n\\t\\t\\tcin >> R[i].len;\\n\\t\\t\\tR[i].seq.resize(R[i].len);\\n\\t\\t\\tfor (int j = 0; j < R[i].len; j++) {\\n\\t\\t\\t\\tcin >> R[i].seq[j];\\n\\t\\t\\t}\\n\\t\\t\\tcin >> R[i].target;\\n\\t\\t}\\n\\n\\t\\t// step #2. compression\\n\\t\\tvector<int> comp;\\n\\t\\tcomp.insert(comp.end(), A.begin(), A.end());\\n\\t\\tcomp.insert(comp.end(), B.begin(), B.end());\\n\\t\\tfor (int i = 0; i < K; i++) {\\n\\t\\t\\tcomp.insert(comp.end(), R[i].seq.begin(), R[i].seq.end());\\n\\t\\t\\tcomp.push_back(R[i].target);\\n\\t\\t}\\n\\t\\tsort(comp.begin(), comp.end());\\n\\t\\tcomp.erase(unique(comp.begin(), comp.end()), comp.end());\\n\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\tA[i] = lower_bound(comp.begin(), comp.end(), A[i]) - comp.begin();\\n\\t\\t}\\n\\t\\tfor (int i = 0; i < M; i++) {\\n\\t\\t\\tB[i] = lower_bound(comp.begin(), comp.end(), B[i]) - comp.begin();\\n\\t\\t}\\n\\t\\tfor (int i = 0; i < K; i++) {\\n\\t\\t\\tfor (int j = 0; j < R[i].len; j++) {\\n\\t\\t\\t\\tR[i].seq[j] = lower_bound(comp.begin(), comp.end(), R[i].seq[j]) - comp.begin();\\n\\t\\t\\t}\\n\\t\\t\\tR[i].target = lower_bound(comp.begin(), comp.end(), R[i].target) - comp.begin();\\n\\t\\t}\\n\\t\\tint L = comp.size();\\n\\n\\t\\t// step #3. compute \\\"creatable\\\" subsequence\\n\\t\\tvector<int> DA(N * 2);\\n\\t\\tfor (int i = 0; i < N * 2; i++) {\\n\\t\\t\\tDA[i] = A[i % N];\\n\\t\\t}\\n\\t\\tvector<int> DB(M * 2);\\n\\t\\tfor (int i = 0; i < M * 2; i++) {\\n\\t\\t\\tDB[i] = B[i % M];\\n\\t\\t}\\n\\t\\tvector<vector<uint32_t> > f1 = get_createable(N * 2, K, L, DA, R);\\n\\t\\tvector<vector<uint32_t> > f2 = get_createable(M * 2, K, L, DB, R);\\n\\t\\tint ans = -INF;\\n\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\tfor (int j = 0; j < M; j++) {\\n\\t\\t\\t\\tvector<vector<int> > dp(N + 1, vector<int>(M + 1, -INF));\\n\\t\\t\\t\\tdp[0][0] = 0;\\n\\t\\t\\t\\tfor (int k = 0; k <= N; k++) {\\n\\t\\t\\t\\t\\tfor (int l = 0; l <= M; l++) {\\n\\t\\t\\t\\t\\t\\tfor (int x = 0; x < k; x++) {\\n\\t\\t\\t\\t\\t\\t\\tfor (int y = 0; y < l; y++) {\\n\\t\\t\\t\\t\\t\\t\\t\\tif (dp[x][y] != -INF && (f1[k + i][x + i] & f2[l + j][y + j]) != 0) {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tdp[k][l] = max(dp[k][l], dp[x][y] + 1);\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\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}\\n\\t\\t\\t\\tif (dp[N][M] != -INF) {\\n\\t\\t\\t\\t\\tans = max(ans, dp[N][M]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << (ans != -INF ? ans : -1) << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 760,\n \"memory_kb\": 8928,\n \"score_of_the_acc\": -0.2987,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1191_8323589\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\nusing namespace std;\\n\\nint N, A[69];\\nint M, B[69];\\nint R, Y[69]; vector<int> X[69];\\nbool Temp1[69][69][69];\\nbool Temp2[69][69];\\nint dpA[69][69];\\nint dpB[69][69];\\nint FinalDP[69][69];\\n\\nvoid Initialize() {\\n\\tfor (int i = 0; i < 69; i++) A[i] = 0;\\n\\tfor (int i = 0; i < 69; i++) B[i] = 0;\\n\\tfor (int i = 0; i < 69; i++) Y[i] = 0;\\n\\tfor (int i = 0; i < 69; i++) X[i].clear();\\n\\tfor (int i = 0; i < 69; i++) {\\n\\t\\tfor (int j = 0; j < 69; j++) {\\n\\t\\t\\tTemp2[i][j] = false; dpA[i][j] = 0; dpB[i][j] = 0; FinalDP[i][j] = 0;\\n\\t\\t\\tfor (int k = 0; k < 69; k++) Temp1[i][j][k] = false;\\n\\t\\t}\\n\\t}\\n}\\n\\nint Second(int pos1, int pos2) {\\n\\tfor (int i = pos1; i <= pos1 + N; i++) {\\n\\t\\tfor (int j = pos2; j <= pos2 + M; j++) FinalDP[i][j] = -(1 << 30);\\n\\t}\\n\\tFinalDP[pos1][pos2] = 0;\\n\\n\\t// DP Main\\n\\tfor (int i = pos1; i < pos1 + N; i++) {\\n\\t\\tfor (int j = pos2; j < pos2 + M; j++) {\\n\\t\\t\\tif (FinalDP[i][j] == -(1 << 30)) continue;\\n\\t\\t\\tfor (int k = i + 1; k <= pos1 + N; k++) {\\n\\t\\t\\t\\tfor (int l = j + 1; l <= pos2 + M; l++) {\\n\\t\\t\\t\\t\\tint v1 = dpA[i % N][k % N];\\n\\t\\t\\t\\t\\tint v2 = dpB[j % M][l % M];\\n\\t\\t\\t\\t\\tif ((v1 & v2) == 0) continue;\\n\\t\\t\\t\\t\\tFinalDP[k][l] = max(FinalDP[k][l], FinalDP[i][j] + 1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t// Return\\n\\treturn FinalDP[pos1 + N][pos2 + M];\\n}\\n\\nbool solve_sub(int cl, int cr, int idx, int sz) {\\n\\tfor (int i = 0; i <= X[idx].size(); i++) {\\n\\t\\tfor (int j = cl; j <= cr; j++) Temp2[i][j] = false;\\n\\t}\\n\\tTemp2[0][cl] = true;\\n\\n\\t// DP Sub\\n\\tfor (int i = 0; i < X[idx].size(); i++) {\\n\\t\\tfor (int j = cl; j < cr; j++) {\\n\\t\\t\\tif (Temp2[i][j] == false) continue;\\n\\t\\t\\tfor (int k = j + 1; k <= cr; k++) {\\n\\t\\t\\t\\tint v1 = j % sz;\\n\\t\\t\\t\\tint v2 = k % sz;\\n\\t\\t\\t\\tif (Temp1[v1][v2][X[idx][i]] == true) Temp2[i + 1][k] = true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn Temp2[X[idx].size()][cr];\\n}\\n\\nvoid solve(vector<int> List) {\\n\\t// Init Part\\n\\tfor (int i = 0; i < List.size(); i++) {\\n\\t\\tfor (int j = 0; j < List.size(); j++) {\\n\\t\\t\\tfor (int k = 1; k <= 30; k++) Temp1[i][j][k] = false;\\n\\t\\t}\\n\\t}\\n\\tfor (int i = 0; i < List.size(); i++) Temp1[i][(i + 1) % List.size()][List[i]] = true;\\n\\n\\t// Main Part\\n\\tfor (int haba = 2; haba <= List.size(); haba++) {\\n\\t\\tfor (int l = 0; l < List.size(); l++) {\\n\\t\\t\\tint r = l + haba;\\n\\t\\t\\tfor (int i = 0; i < R; i++) {\\n\\t\\t\\t\\tbool ret = solve_sub(l, r, i, List.size());\\n\\t\\t\\t\\tif (ret == true) Temp1[l][r % List.size()][Y[i]] = true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nint main() {\\n\\twhile (true) {\\n\\t\\tInitialize();\\n\\n\\t\\t// Step 1. Input\\n\\t\\tcin >> N >> M >> R; if (N + M + R == 0) break;\\n\\t\\tfor (int i = 0; i < N; i++) cin >> A[i];\\n\\t\\tfor (int i = 0; i < M; i++) cin >> B[i];\\n\\t\\tfor (int i = 0; i < R; i++) {\\n\\t\\t\\tint k; cin >> k;\\n\\t\\t\\tX[i] = vector<int>(k, 0);\\n\\t\\t\\tfor (int j = 0; j < k; j++) cin >> X[i][j];\\n\\t\\t\\tcin >> Y[i];\\n\\t\\t}\\n\\n\\t\\t// Step 2. DP Part 1\\n\\t\\tvector<int> ListA; for (int i = 0; i < N; i++) ListA.push_back(A[i]);\\n\\t\\tvector<int> ListB; for (int i = 0; i < M; i++) ListB.push_back(B[i]);\\n\\t\\tsolve(ListA);\\n\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\tfor (int j = 0; j < N; j++) {\\n\\t\\t\\t\\tfor (int k = 1; k <= 30; k++) {\\n\\t\\t\\t\\t\\tif (Temp1[i][j][k] == true) dpA[i][j] += (1 << k);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tsolve(ListB);\\n\\t\\tfor (int i = 0; i < M; i++) {\\n\\t\\t\\tfor (int j = 0; j < M; j++) {\\n\\t\\t\\t\\tfor (int k = 1; k <= 30; k++) {\\n\\t\\t\\t\\t\\tif (Temp1[i][j][k] == true) dpB[i][j] += (1 << k);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t// Step 3. DP Part 2\\n\\t\\tint Answer = -(1 << 30);\\n\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\tfor (int j = 0; j < M; j++) {\\n\\t\\t\\t\\tint ret = Second(i, j);\\n\\t\\t\\t\\tAnswer = max(Answer, ret);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t// Step 4. Output\\n\\t\\tif (Answer == -(1 << 30)) cout << \\\"-1\\\" << endl;\\n\\t\\telse cout << Answer << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 900,\n \"memory_kb\": 3696,\n \"score_of_the_acc\": -0.1126,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1191_7999148\",\n \"code_snippet\": \"#include <algorithm>\\n#include <bitset>\\n#include <cassert>\\n#include <cmath>\\n#include <complex>\\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 <stack>\\n#include <string>\\n#include <tuple>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <utility>\\n#include <vector>\\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) v.begin(), v.end()\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\n\\ntemplate <class T> bool chmin(T &a, T b) {\\n if (a <= b) return false;\\n a = b;\\n return true;\\n}\\n\\ntemplate <class T> bool chmax(T &a, T b) {\\n if (a >= b) return false;\\n a = b;\\n return true;\\n}\\n\\n#define debug(...) \\\\\\n std::cerr << \\\"LINE: \\\" << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"]:\\\", \\\\\\n debug_out(__VA_ARGS__)\\n\\nvoid debug_out() {\\n std::cerr << std::endl;\\n}\\n\\ntemplate <typename Head, typename... Tail> void debug_out(Head h, Tail... t) {\\n std::cerr << \\\" \\\" << h;\\n if (sizeof...(t) > 0) std::cerr << \\\",\\\";\\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\\nint n, m, rs;\\nstd::vector<std::vector<int>> a;\\nstd::vector<std::vector<int>> xs;\\nstd::vector<int> ys;\\n\\nbool dp[2][60][60][40];\\nbool edp[2][60][60][60][20];\\n\\nvoid init() {\\n a.clear();\\n xs.clear();\\n ys.clear();\\n a.resize(2);\\n a[0].resize(n);\\n a[1].resize(m);\\n xs.resize(rs);\\n ys.resize(rs);\\n rep(i, 0, 2) rep(j, 0, 60) rep(k, 0, 60) {\\n rep(l, 0, 40) {\\n dp[i][j][k][l] = false;\\n }\\n rep(l, 0, 60) {\\n rep(x, 0, 20) {\\n edp[i][j][k][l][x] = false;\\n }\\n }\\n }\\n}\\n\\nvoid calc() {\\n int idx = 0;\\n rep(i, 0, n) rep(j, 0, rs) edp[idx][i][i][j][0] = true;\\n rep(i, 0, 2 * n) {\\n dp[idx][i][i + 1][a[idx][i]] = true;\\n }\\n rep(len, 1, n + 1) {\\n for (int l = 0; l + len < 2 * n; l++) {\\n int r = l + len;\\n rep(i, 0, rs) {\\n rep(j, 1, int(xs[i].size()) + 1) {\\n rep(k, l + 1, r) edp[idx][l][r][i][j] |=\\n edp[idx][l][k][i][j - 1] & dp[idx][k][r][xs[i][j - 1]];\\n }\\n }\\n rep(i, 0, rs) {\\n if (edp[idx][l][r][i][xs[i].size()])\\n dp[idx][l][r][ys[i]] = true;\\n }\\n rep(i, 0, rs) {\\n if (dp[idx][l][r][xs[i][0]]) edp[idx][l][r][i][1] = true;\\n }\\n }\\n }\\n idx = 1;\\n rep(i, 0, m) rep(j, 0, rs) edp[idx][i][i][j][0] = true;\\n rep(i, 0, 2 * m) {\\n dp[idx][i][i + 1][a[idx][i]] = true;\\n }\\n rep(len, 1, m + 1) {\\n for (int l = 0; l + len < 2 * m; l++) {\\n int r = l + len;\\n rep(i, 0, rs) {\\n rep(j, 1, int(xs[i].size()) + 1) {\\n rep(k, l + 1, r) edp[idx][l][r][i][j] |=\\n edp[idx][l][k][i][j - 1] & dp[idx][k][r][xs[i][j - 1]];\\n }\\n }\\n rep(i, 0, rs) {\\n if (edp[idx][l][r][i][xs[i].size()])\\n dp[idx][l][r][ys[i]] = true;\\n }\\n rep(i, 0, rs) {\\n if (dp[idx][l][r][xs[i][0]]) edp[idx][l][r][i][1] = true;\\n }\\n }\\n }\\n}\\n\\nbool solve() {\\n std::cin >> n >> m >> rs;\\n if (n == 0 && m == 0 && rs == 0) return false;\\n init();\\n rep(i, 0, n) {\\n std::cin >> a[0][i];\\n }\\n rep(i, 0, n) a[0].emplace_back(a[0][i]);\\n rep(i, 0, m) {\\n std::cin >> a[1][i];\\n }\\n rep(i, 0, m) a[1].emplace_back(a[1][i]);\\n rep(i, 0, rs) {\\n int k;\\n std::cin >> k;\\n xs[i].resize(k);\\n rep(j, 0, k) {\\n std::cin >> xs[i][j];\\n }\\n std::cin >> ys[i];\\n }\\n calc();\\n int ans = -1;\\n rep(la, 0, n) {\\n rep(lb, 0, m) {\\n std::vector gdp(n + 1, std::vector<int>(m + 1, -1));\\n gdp[0][0] = 0;\\n rep(ra, 0, n) {\\n rep(rb, 0, m) {\\n if (gdp[ra][rb] == -1) continue;\\n rep(raa, ra + 1, n + 1) {\\n rep(rbb, rb + 1, m + 1) {\\n rep(c, 0, 40) {\\n if(dp[0][la + ra][la + raa][c] && dp[1][lb + rb][lb + rbb][c]) {\\n chmax(gdp[raa][rbb], gdp[ra][rb] + 1);\\n }\\n }\\n }\\n }\\n }\\n }\\n chmax(ans, gdp[n][m]);\\n }\\n }\\n std::cout << ans << '\\\\n';\\n return true;\\n}\\n\\nint main() {\\n while (solve())\\n ;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 7110,\n \"memory_kb\": 11920,\n \"score_of_the_acc\": -1.3316,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1191_7965033\",\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>\\nbool chmax(T& a, const T& b) {\\n return a < b ? (a = b, 1) : 0;\\n}\\ntemplate <typename T>\\nbool chmin(T& a, const T& b) {\\n return a > b ? (a = b, 1) : 0;\\n}\\n\\nint main() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n\\n const int X = 31;\\n\\n while (true) {\\n int n, m, r;\\n cin >> n >> m >> r;\\n if (n == 0) break;\\n vector<int> A(2 * n), B(2 * m);\\n rep(i, 0, n) {\\n int x;\\n cin >> x;\\n A[i] = A[n + i] = x;\\n }\\n rep(i, 0, m) {\\n int x;\\n cin >> x;\\n B[i] = B[m + i] = x;\\n }\\n vector<vector<vector<int>>> rules(X);\\n rep(_, 0, r) {\\n int k;\\n cin >> k;\\n vector<int> xs(k);\\n for (auto& x : xs) cin >> x;\\n int y;\\n cin >> y;\\n rules[y].push_back(xs);\\n }\\n\\n auto calc = [&](vector<int> A) {\\n int n = A.size();\\n vector dp(n, vector<int>(n + 1));\\n rep(i, 0, n) { dp[i][i + 1] = 1 << A[i]; }\\n rep(l, 2, n + 1) rep(i, 0, n - l + 1) {\\n int j = i + l;\\n\\n rep(c, 0, X) for (auto& xs : rules[c]) {\\n int k = xs.size();\\n vector f(l + 1, vector<bool>(k + 1));\\n\\n f[0][0] = true;\\n\\n rep(s, 0, l) rep(t, s + 1, l + 1) {\\n rep(u, 0, k) {\\n if (f[s][u] && (dp[i + s][i + t] >> xs[u] & 1)) {\\n f[t][u + 1] = true;\\n }\\n }\\n }\\n\\n if (f[l][k]) {\\n dp[i][j] |= 1 << c;\\n }\\n }\\n }\\n return dp;\\n };\\n\\n auto dpA = calc(A);\\n auto dpB = calc(B);\\n\\n int ans = -1;\\n\\n rep(shiftA, 0, n) rep(shiftB, 0, m) {\\n vector g(n + 1, vector<int>(m + 1, -1e9));\\n g[0][0] = 0;\\n rep(i, 1, n + 1) rep(j, 1, m + 1) {\\n rep(a, 0, i) rep(b, 0, j) {\\n if (dpA[shiftA + a][shiftA + i] &\\n dpB[shiftB + b][shiftB + j]) {\\n chmax(g[i][j], g[a][b] + 1);\\n }\\n }\\n }\\n chmax(ans, g[n][m]);\\n }\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2420,\n \"memory_kb\": 3524,\n \"score_of_the_acc\": -0.3249,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1191_7234123\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\nusing namespace std::chrono;\\ntypedef long long int llint;\\ntypedef long double lldo;\\n#define mp make_pair\\n#define mt make_tuple\\n#define pub push_back\\n#define puf push_front\\n#define pob pop_back\\n#define pof pop_front\\n#define fir first\\n#define sec second\\n#define res resize\\n#define ins insert\\n#define era erase\\n#define REP(i, n) for(int i = 0;i < (n);i++)\\n/*cout<<fixed<<setprecision(20);cin.tie(0);ios::sync_with_stdio(false);*/\\nconst int mod=1000000007;\\nconst llint inf=2.19e15+1;\\nconst long double pai=3.141592653589793238462643383279502884197;\\nconst long double eps=1e-10;\\ntemplate <class T,class U>bool chmin(T& a,U b){if(a>b){a=b;return true;}return false;}\\ntemplate <class T,class U>bool chmax(T& a,U b){if(a<b){a=b;return true;}return false;}\\nllint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}\\nllint lcm(llint a,llint b){if(a==0){return b;}return a/gcd(a,b)*b;}\\ntemplate<class T> void SO(T& ve){sort(ve.begin(),ve.end());}\\ntemplate<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}\\ntemplate<class T>int LBI(const vector<T>&ar,T in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}\\ntemplate<class T>int UBI(const vector<T>&ar,T in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}\\n\\nint main(void){\\n\\twhile(-1){\\n\\t\\tint n,m,r,h,i,j,k;\\n\\t\\tcin>>n>>m>>r;\\n\\t\\tif(n==0){return 0;}\\n\\t\\tint A[50]={};\\n\\t\\tint B[50]={};\\n\\t\\tfor(i=0;i<n;i++){cin>>A[i];}\\n\\t\\tfor(i=n;i<n+n;i++){A[i]=A[i-n];}\\n\\t\\tfor(i=0;i<m;i++){cin>>B[i];}\\n\\t\\tfor(i=m;i<m+m;i++){B[i]=B[i-m];}\\n\\t\\t\\n\\t\\t\\n\\t\\tvector<tuple<int,int,int>>rules;\\n\\t\\tint mkaz=30;\\n\\t\\tfor(h=0;h<r;h++){\\n\\t\\t\\tint Ka;cin>>Ka;\\n\\t\\t\\tint mae;cin>>mae;\\n\\t\\t\\tfor(i=1;i<Ka;i++){\\n\\t\\t\\t\\tint now;cin>>now;\\n\\t\\t\\t\\tif(i+1<Ka){\\n\\t\\t\\t\\t\\tmkaz++;\\n\\t\\t\\t\\t\\trules.pub(mt(mae,now,mkaz));\\n\\t\\t\\t\\t\\tmae=mkaz;\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\tint ruy;cin>>ruy;\\n\\t\\t\\t\\t\\trules.pub(mt(mae,now,ruy));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tstatic bool dpA[51][51][600]={};\\n\\t\\tstatic bool dpB[51][51][600]={};\\n\\t\\tfor(i=0;i<=50;i++){\\n\\t\\t\\tfor(j=0;j<=50;j++){\\n\\t\\t\\t\\tfor(k=0;k<600;k++){\\n\\t\\t\\t\\t\\tdpA[i][j][k]=false;\\n\\t\\t\\t\\t\\tdpB[i][j][k]=false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//R,文字種類 の Lbit目をみる\\n\\t\\tfor(i=0;i<n+n;i++){\\n\\t\\t\\tdpA[i][i+1][A[i]]=1;\\n\\t\\t}\\n\\t\\tfor(i=0;i<m+m;i++){\\n\\t\\t\\tdpB[i][i+1][B[i]]=1;\\n\\t\\t}\\n\\t\\tint sudpA[51][51]={};\\n\\t\\tint sudpB[51][51]={};\\n\\t\\tfor(i=1;i<=n;i++){\\n\\t\\t\\tfor(int L=0;L+i<=n+n;L++){\\n\\t\\t\\t\\tint R=L+i;\\n\\t\\t\\t\\tfor(j=0;j<rules.size();j++){\\n\\t\\t\\t\\t\\tint x,y,z;\\n\\t\\t\\t\\t\\ttie(x,y,z)=rules[j];\\n\\t\\t\\t\\t\\tfor(int s=L+1;s<R;s++){\\n\\t\\t\\t\\t\\t\\tdpA[L][R][z]|=dpA[L][s][x]&&dpA[s][R][y];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tfor(k=1;k<=30;k++){\\n\\t\\t\\t\\t\\tif(dpA[L][R][k]){sudpA[L][R]+=(1<<k);}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t//cerr<<\\\"sudpA[\\\"<<L<<\\\"][\\\"<<R<<\\\"]=\\\"<<sudpA[L][R]<<endl;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor(i=1;i<=m;i++){\\n\\t\\t\\tfor(int L=0;L+i<=m+m;L++){\\n\\t\\t\\t\\tint R=L+i;\\n\\t\\t\\t\\tfor(j=0;j<rules.size();j++){\\n\\t\\t\\t\\t\\tint x,y,z;\\n\\t\\t\\t\\t\\ttie(x,y,z)=rules[j];\\n\\t\\t\\t\\t\\tfor(int s=L+1;s<R;s++){\\n\\t\\t\\t\\t\\t\\tdpB[L][R][z]|=dpB[L][s][x]&&dpB[s][R][y];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tfor(k=1;k<=30;k++){\\n\\t\\t\\t\\t\\tif(dpB[L][R][k]){sudpB[L][R]+=(1<<k);}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t//cerr<<\\\"sudpB[\\\"<<L<<\\\"][\\\"<<R<<\\\"]=\\\"<<sudpB[L][R]<<endl;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\t\\n\\t\\t//次 対応を走査\\n\\t\\tint ans=-1;\\n\\t\\tfor(int As=0;As<n;As++){\\n\\t\\t\\tfor(int Bs=0;Bs<m;Bs++){\\n\\t\\t\\t\\tint ep[51][51]={};\\n\\t\\t\\t\\tep[As][Bs]=mod;\\n\\t\\t\\t\\tfor(int Ax=As;Ax<As+n;Ax++){\\n\\t\\t\\t\\t\\tfor(int Bx=Bs;Bx<Bs+m;Bx++){\\n\\t\\t\\t\\t\\t\\tif(ep[Ax][Bx]==0){continue;}\\n\\t\\t\\t\\t\\t\\t//ここから遷移する\\n\\t\\t\\t\\t\\t\\tfor(int Ay=Ax+1;Ay<=As+n;Ay++){\\n\\t\\t\\t\\t\\t\\t\\tfor(int By=Bx+1;By<=Bs+m;By++){\\n\\t\\t\\t\\t\\t\\t\\t\\tif(sudpA[Ax][Ay]&sudpB[Bx][By]){\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tchmax(ep[Ay][By],ep[Ax][Bx]+1);\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\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}\\n\\t\\t\\t\\tchmax(ans,ep[As+n][Bs+m]-mod);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout<<ans<<endl;\\n\\t}\\n\\treturn 0;\\n}\\n\\n/*\\n3 3 3\\n1 2 3\\n4 5 6\\n2 1 2 5\\n2 6 4 3\\n2 5 3 1\\n\\n3 3 2\\n1 1 1\\n2 2 1\\n2 1 1 2\\n2 2 2 1\\n\\n7 1 2\\n1 1 2 1 4 1 2\\n4\\n3 1 4 1 4\\n3 2 4 2 4\\n\\n16 14 5\\n2 1 2 2 1 3 2 1 3 2 2 1 1 3 1 2\\n2 1 3 1 1 2 3 1 2 2 2 2 1 3\\n2 3 1 3\\n3 2 2 2 1\\n3 2 2 1 2\\n3 1 2 2 2\\n4 2 1 2 2 2\\n\\n0 0 0\\n*/\",\n \"accuracy\": 1,\n \"time_ms\": 370,\n \"memory_kb\": 6428,\n \"score_of_the_acc\": -0.144,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1191_6046349\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }\\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }\\n#define all(x) (x).begin(),(x).end()\\n#define fi first\\n#define se second\\n#define mp make_pair\\n#define si(x) int(x.size())\\nconst int mod=1000000007,MAX=35,INF=1<<29;\\n\\nbool sub1[MAX][MAX][MAX];\\nbool sub2[MAX][MAX][MAX];\\nbool can[MAX][MAX];\\nbool match[MAX][MAX][MAX][MAX];\\nint dp[MAX*2][MAX*2];\\n\\nint main(){\\n \\n std::ifstream in(\\\"text.txt\\\");\\n std::cin.rdbuf(in.rdbuf());\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n \\n while(1){\\n int N,M,K;cin>>N>>M>>K;\\n if(N==0) break;\\n vector<int> A(N),B(M);\\n for(int i=0;i<N;i++){\\n cin>>A[i];A[i]--;\\n }\\n for(int i=0;i<N;i++) A.push_back(A[i]);\\n for(int i=0;i<M;i++){\\n cin>>B[i];B[i]--;\\n }\\n for(int i=0;i<M;i++) B.push_back(B[i]);\\n vector<vector<int>> S(K);vector<int> T(K);\\n for(int i=0;i<K;i++){\\n int x;cin>>x;\\n S[i].resize(x);\\n for(int j=0;j<x;j++){\\n cin>>S[i][j];S[i][j]--;\\n }\\n cin>>T[i];T[i]--;\\n }\\n memset(sub1,0,sizeof(sub1));\\n memset(sub2,0,sizeof(sub2));\\n \\n for(int len=1;len<=N;len++){\\n for(int l=0;l<N;l++){\\n int r=(l+len-1)%N;\\n if(len==1) sub1[l][r][A[l]]=true;\\n else{\\n for(int k=0;k<K;k++){\\n memset(can,0,sizeof(can));\\n can[l][0]=true;\\n for(int i=l;i<l+len;i++){\\n for(int j=si(S[k])-1;j>=0;j--){\\n if(!can[i%N][j]) continue;\\n for(int to=i+1;to<=l+len;to++){\\n if(sub1[i%N][(to-1)%N][S[k][j]]) can[to%N][j+1]=true;\\n }\\n }\\n }\\n if(can[(l+len)%N][si(S[k])]) sub1[l][r][T[k]]=true;\\n }\\n }\\n }\\n }\\n \\n for(int len=1;len<=M;len++){\\n for(int l=0;l<M;l++){\\n int r=(l+len-1)%M;\\n if(len==1) sub2[l][r][B[l]]=true;\\n else{\\n for(int k=0;k<K;k++){\\n memset(can,0,sizeof(can));\\n can[l][0]=true;\\n for(int i=l;i<l+len;i++){\\n for(int j=si(S[k])-1;j>=0;j--){\\n if(!can[i%M][j]) continue;\\n for(int to=i+1;to<=l+len;to++){\\n if(sub2[i%M][(to-1)%M][S[k][j]]) can[to%M][j+1]=true;\\n }\\n }\\n }\\n if(can[(l+len)%M][si(S[k])]) sub2[l][r][T[k]]=true;\\n }\\n }\\n }\\n }\\n \\n memset(match,0,sizeof(match));\\n for(int l1=0;l1<N;l1++){\\n for(int r1=0;r1<N;r1++){\\n for(int l2=0;l2<M;l2++){\\n for(int r2=0;r2<M;r2++){\\n for(int k=0;k<30;k++){\\n if(sub1[l1][r1][k]&&sub2[l2][r2][k]) match[l1][r1][l2][r2]=true;\\n }\\n }\\n }\\n }\\n }\\n \\n int ans=-1;\\n \\n for(int l1=0;l1<N;l1++){\\n for(int l2=0;l2<M;l2++){\\n for(int i=0;i<=2*N;i++) for(int j=0;j<=2*M;j++) dp[i][j]=-INF;\\n dp[l1][l2]=0;\\n for(int i=l1;i<l1+N;i++){\\n for(int j=l2;j<l2+M;j++){\\n if(dp[i][j]==-INF) continue;\\n for(int a=i+1;a<=l1+N;a++){\\n for(int b=j+1;b<=l2+M;b++){\\n if(match[i%N][(a-1)%N][j%M][(b-1)%M]) chmax(dp[a][b],dp[i][j]+1);\\n }\\n }\\n }\\n }\\n chmax(ans,dp[l1+N][l2+M]);\\n }\\n }\\n \\n cout<<ans<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 960,\n \"memory_kb\": 4972,\n \"score_of_the_acc\": -0.1716,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1191_6039948\",\n \"code_snippet\": \"#pragma region Macros\\n#pragma comment(linker, \\\"/stack:200000000\\\")\\n// #pragma GCC optimize(\\\"unroll-loops\\\")\\n// #pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native\\\")\\n// #pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2\\\")\\n// #pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"Ofast\\\")\\n#include <bits/stdc++.h>\\n#define ll long long\\nusing ld = long double;\\n#define rep2(i, a, b) for(ll i = (a); i <= (b); i++)\\n#define rep3(i, a, b) for(ll i = (a); i >= (b); --i)\\n#define rep(i, n) for(ll i = 0; i < n; ++i)\\n#define each(i, a) for(auto &&i : a)\\n#define pii pair<int, int>\\n#define pll pair<ll, ll>\\n#define pb push_back\\n#define eb emplace_back\\n#define vi vector<int>\\n#define vll vector<ll>\\n#define vpi vector<pii>\\n#define vpll vector<pll>\\n#define overload2(_1, _2, name, ...) name\\n#define vec(type, name, ...) vector<type> name(__VA_ARGS__)\\n#define VEC(type, name, size) \\\\\\n vector<type> name(size); \\\\\\n IN(name)\\n#define VEC2(type, name1, name2, size) \\\\\\n vector<type> name1(size), name2(size); \\\\\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i])\\n#define VEC3(type, name1, name2, name3, size) \\\\\\n vector<type> name1(size), name2(size), name3(size); \\\\\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i])\\n#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\\n#define VV(type, name, h, w) \\\\\\n vector<vector<type>> name(h, vector<type>(w)); \\\\\\n IN(name)\\n#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\\n#define vvvv(type, name, a, b, c, ...) \\\\\\n vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\\n#define mt make_tuple\\n#define fi first\\n#define se second\\n#define all(c) begin(c), end(c)\\n#define rall(c) rbegin(c), rend(c)\\n#define SORT(v) sort(all(v))\\n#define REV(v) reverse(all(v))\\ntemplate <class T = ll, class S> T SUM(const S &v) { return accumulate(all(v), T(0)); }\\n#define MIN(v) *min_element(all(v))\\n#define MAX(v) *max_element(all(v))\\n#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))\\n#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))\\nusing namespace std;\\nconstexpr pii dx4[4] = {pii{1, 0}, pii{0, 1}, pii{-1, 0}, pii{0, -1}};\\nconstexpr pii dx8[8] = {{1, 0}, {1, 1}, {0, 1}, {-1, 1}, {-1, 0}, {-1, -1}, {0, -1}, {1, -1}};\\nconst string YESNO[2] = {\\\"NO\\\", \\\"YES\\\"};\\nconst string YesNo[2] = {\\\"No\\\", \\\"Yes\\\"};\\nconst string yesno[2] = {\\\"no\\\", \\\"yes\\\"};\\nvoid YES(bool t = 1) { cout << YESNO[t] << endl; }\\nvoid NO(bool t = 1) { YES(!t); }\\nvoid Yes(bool t = 1) { cout << YesNo[t] << endl; }\\nvoid No(bool t = 1) { Yes(!t); }\\nvoid yes(bool t = 1) { cout << yesno[t] << endl; }\\nvoid no(bool t = 1) { yes(!t); }\\ntemplate <class T> using vc = vector<T>;\\ntemplate <class T> using vvc = vector<vc<T>>;\\ntemplate <class T> using vvvc = vector<vvc<T>>;\\ntemplate <class T> using vvvvc = vector<vvvc<T>>;\\ntemplate <class T> using pq = priority_queue<T>;\\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\\n#define si(c) (int)(c).size()\\n#define INT(...) \\\\\\n int __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define LL(...) \\\\\\n ll __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define STR(...) \\\\\\n string __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define CHR(...) \\\\\\n char __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define DBL(...) \\\\\\n double __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\nint scan() { return getchar(); }\\nvoid scan(int &a) { cin >> a; }\\nvoid scan(long long &a) { cin >> a; }\\nvoid scan(char &a) { cin >> a; }\\nvoid scan(double &a) { cin >> a; }\\nvoid scan(string &a) { cin >> a; }\\ntemplate <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); }\\ntemplate <class T> void scan(vector<T> &);\\ntemplate <class T> void scan(vector<T> &a) {\\n for(auto &i : a) scan(i);\\n}\\ntemplate <class T> void scan(T &a) { cin >> a; }\\nvoid IN() {}\\ntemplate <class Head, class... Tail> void IN(Head &head, Tail &...tail) {\\n scan(head);\\n IN(tail...);\\n}\\n\\ntemplate <class T, class S> inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); }\\ntemplate <class T, class S> inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); }\\nvi iota(int n) {\\n vi a(n);\\n iota(all(a), 0);\\n return a;\\n}\\ntemplate <typename T> vi iota(vector<T> &a, bool greater = false) {\\n vi res(a.size());\\n iota(all(res), 0);\\n sort(all(res), [&](int i, int j) {\\n if(greater) return a[i] > a[j];\\n return a[i] < a[j];\\n });\\n return res;\\n}\\n#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())\\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}\\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}\\ntemplate <class T> T POW(T x, int n) {\\n T res = 1;\\n for(; n; n >>= 1, x *= x)\\n if(n & 1) res *= x;\\n return res;\\n}\\ntemplate <class T, class S> T POW(T x, S n, const ll &mod) {\\n T res = 1;\\n for(; n; n >>= 1, x = x * x % mod)\\n if(n & 1) res = res * x % mod;\\n return res;\\n}\\nvector<pll> factor(ll x) {\\n vector<pll> ans;\\n for(ll i = 2; i * i <= x; i++)\\n if(x % i == 0) {\\n ans.push_back({i, 1});\\n while((x /= i) % i == 0) ans.back().second++;\\n }\\n if(x != 1) ans.push_back({x, 1});\\n return ans;\\n}\\ntemplate <class T> vector<T> divisor(T x) {\\n vector<T> ans;\\n for(T i = 1; i * i <= x; i++)\\n if(x % i == 0) {\\n ans.pb(i);\\n if(i * i != x) ans.pb(x / i);\\n }\\n return ans;\\n}\\ntemplate <typename T> void zip(vector<T> &x) {\\n vector<T> y = x;\\n UNIQUE(y);\\n for(int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); }\\n}\\ntemplate <class S> void fold_in(vector<S> &v) {}\\ntemplate <typename Head, typename... Tail, class S> void fold_in(vector<S> &v, Head &&a, Tail &&...tail) {\\n for(auto e : a) v.emplace_back(e);\\n fold_in(v, tail...);\\n}\\ntemplate <class S> void renumber(vector<S> &v) {}\\ntemplate <typename Head, typename... Tail, class S> void renumber(vector<S> &v, Head &&a, Tail &&...tail) {\\n for(auto &&e : a) e = lb(v, e);\\n renumber(v, tail...);\\n}\\ntemplate <class S, class... Args> vector<S> zip(vector<S> &head, Args &&...args) {\\n vector<S> v;\\n fold_in(v, head, args...);\\n sort(all(v)), v.erase(unique(all(v)), v.end());\\n renumber(v, head, args...);\\n return v;\\n}\\n\\n// x in [l, r)\\ntemplate <class T, class S> bool inc(const T &x, const S &l, const S &r) { return l <= x and x < r; }\\n// (a, b) in [lx, rx) * [ly, ry)\\ntemplate <class T, class S> bool inc(const pair<T, T> &x, const S &lx, const S &ly, const S &rx, const S &ry) { return inc(x.fi, lx, rx) && inc(x.se, ly, ry); }\\n\\nconstexpr ll ten(int n) { return n == 0 ? 1 : ten(n - 1) * 10; }\\n// bit 演算系\\nll pow2(int i) { return 1LL << i; }\\nint topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }\\nint topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }\\nint lowbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }\\nint lowbit(ll a) { return a == 0 ? 64 : __builtin_ctzll(a); }\\n// int allbit(int n) { return (1 << n) - 1; }\\nconstexpr ll allbit(int n) { return (1LL << n) - 1; }\\n// int popcount(signed t) { return __builtin_popcount(t); }\\n// int popcount(ll t) { return __builtin_popcountll(t); }\\nint popcount(uint64_t t) { return __builtin_popcountll(t); }\\nbool ispow2(int i) { return i && (i & -i) == i; }\\n\\nll rnd(ll l, ll r) { //[l, r)\\n#ifdef _LOCAL\\n static mt19937_64 gen;\\n#else\\n static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());\\n#endif\\n return uniform_int_distribution<ll>(l, r - 1)(gen);\\n}\\nll rnd(ll n) { return rnd(0, n); }\\n\\ntemplate <class t> void random_shuffle(vc<t> &a) { rep(i, si(a)) swap(a[i], a[rnd(0, i + 1)]); }\\n\\nint in() {\\n int x;\\n cin >> x;\\n return x;\\n}\\nll lin() {\\n unsigned long long x;\\n cin >> x;\\n return x;\\n}\\n\\ntemplate <class T, class S> pair<T, S> operator-(const pair<T, S> &x, const pair<T, S> &y) { return pair<T, S>(x.fi - y.fi, x.se - y.se); }\\ntemplate <class T, class S> pair<T, S> operator+(const pair<T, S> &x, const pair<T, S> &y) { return pair<T, S>(x.fi + y.fi, x.se + y.se); }\\ntemplate <class T> pair<T, T> operator&(const pair<T, T> &l, const pair<T, T> &r) { return pair<T, T>(max(l.fi, r.fi), min(l.se, r.se)); }\\ntemplate <class T, class S> pair<T, S> operator+=(pair<T, S> &l, const pair<T, S> &r) { return l = l + r; }\\ntemplate <class T, class S> pair<T, S> operator-=(pair<T, S> &l, const pair<T, S> &r) { return l = l - r; }\\ntemplate <class T> bool intersect(const pair<T, T> &l, const pair<T, T> &r) { return (l.se < r.se ? r.fi < l.se : l.fi < r.se); }\\n\\ntemplate <class T> ll operator*(const pair<T, T> &x, const pair<T, T> &y) { return (ll)x.fi * y.fi + (ll)x.se * y.se; }\\n\\ntemplate <typename T> struct edge {\\n int from, to;\\n T cost;\\n int id;\\n edge(int to, T cost) : from(-1), to(to), cost(cost) {}\\n edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}\\n edge(int from, int to, T cost, int id) : from(from), to(to), cost(cost), id(id) {}\\n constexpr bool operator<(const edge<T> &rhs) const noexcept { return cost < rhs.cost; }\\n edge &operator=(const int &x) {\\n to = x;\\n return *this;\\n }\\n operator int() const { return to; }\\n};\\ntemplate <typename T> using Edges = vector<edge<T>>;\\n\\nusing Tree = vector<vector<int>>;\\nusing Graph = vector<vector<int>>;\\ntemplate <class T> using Wgraph = vector<vector<edge<T>>>;\\nGraph getG(int n, int m = -1, bool directed = false, int margin = 1) {\\n Tree res(n);\\n if(m == -1) m = n - 1;\\n while(m--) {\\n int a, b;\\n cin >> a >> b;\\n a -= margin, b -= margin;\\n res[a].emplace_back(b);\\n if(!directed) res[b].emplace_back(a);\\n }\\n return res;\\n}\\nGraph getTreeFromPar(int n, int margin = 1) {\\n Graph res(n);\\n for(int i = 1; i < n; i++) {\\n int a;\\n cin >> a;\\n res[a - margin].emplace_back(i);\\n }\\n return res;\\n}\\ntemplate <class T> Wgraph<T> getWg(int n, int m = -1, bool directed = false, int margin = 1) {\\n Wgraph<T> res(n);\\n if(m == -1) m = n - 1;\\n while(m--) {\\n int a, b;\\n T c;\\n cin >> a >> b >> c;\\n a -= margin, b -= margin;\\n res[a].emplace_back(b, c);\\n if(!directed) res[b].emplace_back(a, c);\\n }\\n return res;\\n}\\nvoid add(Graph &G, int x, int y) { G[x].eb(y), G[y].eb(x); }\\ntemplate <class S, class T> void add(Wgraph<S> &G, int x, int y, T c) { G[x].eb(y, c), G[y].eb(x, c); }\\n\\n#define i128 __int128_t\\n#define ull unsigned long long int\\n#define TEST \\\\\\n INT(testcases); \\\\\\n while(testcases--)\\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\\n for(auto it = begin(v); it != end(v); ++it) {\\n if(it == begin(v))\\n os << *it;\\n else\\n os << \\\" \\\" << *it;\\n }\\n return os;\\n}\\ntemplate <class T, class S> ostream &operator<<(ostream &os, const pair<T, S> &p) {\\n os << p.first << \\\" \\\" << p.second;\\n return os;\\n}\\ntemplate <class S, class T> string to_string(pair<S, T> p) { return \\\"(\\\" + to_string(p.first) + \\\",\\\" + to_string(p.second) + \\\")\\\"; }\\nstring to_string(string s) { return \\\"\\\\\\\"\\\" + s + \\\"\\\\\\\"\\\"; }\\nstring to_string(char c) { return string(1, c); }\\ntemplate <class T> string to_string(vector<T> s) {\\n string res = \\\"{\\\";\\n for(auto it = s.begin(); it != s.end(); it++) res += to_string(*it) + (next(it) == s.end() ? \\\"\\\" : \\\", \\\");\\n return res + \\\"}\\\";\\n}\\ntemplate <class T> string to_string(set<T> s) {\\n string res = \\\"{\\\";\\n for(auto it = s.begin(); it != s.end(); it++) res += to_string(*it), res += (next(it) == end(s) ? \\\"\\\" : \\\", \\\");\\n return res + \\\"}\\\";\\n}\\n\\n#define endl '\\\\n'\\n\\n#ifdef _LOCAL\\nvoid dump() { cerr << endl; }\\ntemplate <class Head, class... Tail> void dump(Head head, Tail... tail) {\\n cerr << to_string(head) << \\\" \\\";\\n dump(tail...);\\n}\\n#undef endl\\n#define debug(x) \\\\\\n cout << #x << \\\": \\\"; \\\\\\n dump(x)\\n#else\\nvoid dump() {}\\ntemplate <class Head, class... Tail> void dump(Head head, Tail... tail) {}\\n#define debug(x)\\n#endif\\ntemplate <class T> void print(const T &a) { cout << a; }\\nvoid OUT() { cout << endl; }\\ntemplate <class Head, class... Tail> void OUT(const Head &head, const Tail &...tail) {\\n print(head);\\n if(sizeof...(tail)) cout << ' ';\\n OUT(tail...);\\n}\\n\\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\\n#define drop(s) cout << #s << endl, exit(0)\\n\\ntemplate <int N> struct ndFORarray {\\n std::array<int, N> v;\\n ndFORarray(std::array<int, N> v_) : v(v_) {}\\n struct ndFORitr {\\n const std::array<int, N> &v;\\n std::array<int, N> tmp;\\n bool is_end;\\n ndFORitr(const std::array<int, N> &v_) : v(v_), tmp(), is_end(false) {}\\n bool operator!=(const ndFORitr &) const { return !is_end; }\\n void operator++() {\\n int pos = N - 1;\\n while(pos != -1) {\\n tmp[pos] += 1;\\n if(tmp[pos] == v[pos]) {\\n tmp[pos] = 0;\\n pos -= 1;\\n } else {\\n break;\\n }\\n }\\n if(pos == -1) { is_end = true; }\\n }\\n const std::array<int, N> &operator*() const { return tmp; }\\n };\\n ndFORitr begin() const { return ndFORitr(v); }\\n ndFORitr end() const { return ndFORitr(v); }\\n};\\n\\nstruct ndFORvector {\\n std::vector<int> v;\\n ndFORvector(std::vector<int> v_) : v(v_) {}\\n struct ndFORitr {\\n const std::vector<int> &v;\\n std::vector<int> tmp;\\n bool is_end;\\n ndFORitr(const std::vector<int> &v_) : v(v_), tmp(v.size(), 0), is_end(false) {}\\n bool operator!=(const ndFORitr &) const { return !is_end; }\\n void operator++() {\\n int pos = v.size() - 1;\\n while(pos != -1) {\\n tmp[pos] += 1;\\n if(tmp[pos] == v[pos]) {\\n tmp[pos] = 0;\\n pos -= 1;\\n } else {\\n break;\\n }\\n }\\n if(pos == -1) { is_end = true; }\\n }\\n const std::vector<int> &operator*() const { return tmp; }\\n };\\n ndFORitr begin() const { return ndFORitr(v); }\\n ndFORitr end() const { return ndFORitr(v); }\\n};\\n\\nauto ndFOR(std::vector<int> v) { return ndFORvector(v); }\\ntemplate <class... Ts> auto ndFOR(Ts... v) { return ndFORarray<std::tuple_size<std::tuple<Ts...>>::value>({v...}); }\\ntemplate <class F> struct REC {\\n F f;\\n REC(F &&f_) : f(std::forward<F>(f_)) {}\\n template <class... Args> auto operator()(Args &&...args) const { return f(*this, std::forward<Args>(args)...); }\\n};\\n\\ntemplate <class S> vector<pair<S, int>> runLength(const vector<S> &v) {\\n vector<pair<S, int>> res;\\n for(auto &e : v) {\\n if(res.empty() or res.back().fi != e)\\n res.eb(e, 1);\\n else\\n res.back().se++;\\n }\\n return res;\\n}\\nvector<pair<char, int>> runLength(const string &v) {\\n vector<pair<char, int>> res;\\n for(auto &e : v) {\\n if(res.empty() or res.back().fi != e)\\n res.eb(e, 1);\\n else\\n res.back().se++;\\n }\\n return res;\\n}\\n\\ntemplate <class T = int> struct Imos {\\n int n;\\n vector<T> a;\\n Imos(int _n) : n(_n), a(_n + 1) {}\\n void add(int l, int r, T val = 1) {\\n if(l >= r) return;\\n l = clamp(l, 0, n);\\n r = clamp(r, 0, n + 1);\\n a[l] += val;\\n if(r <= n) a[r] -= val;\\n }\\n void build() {\\n for(int i = 0; i < n; i++) a[i + 1] += a[i];\\n }\\n const T &operator[](int k) { return a[k]; }\\n};\\n\\ntemplate <class T> struct RUI {\\n vector<T> a;\\n RUI(const vector<T> &v) : a(v.size() + 1) {\\n for(int i = 0; i < v.size(); i++) a[i + 1] = a[i] + v[i];\\n }\\n T get(int l, int r) { return a[r] - a[l]; }\\n};\\n\\ntemplate <class T, class F> T bin_search(T ok, T ng, const F &f) {\\n while(abs(ok - ng) > 1) {\\n T mid = ok + ng >> 1;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\ntemplate <class T, class F> T bin_search_double(T ok, T ng, const F &f, int iter = 80) {\\n while(iter--) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n\\nstruct Setup_io {\\n Setup_io() {\\n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\\n cout << fixed << setprecision(15);\\n }\\n} setup_io;\\n#pragma endregion\\n\\nint main() {\\n while(1) {\\n INT(n, m, r);\\n if(!n) exit(0);\\n VEC(int, a, n);\\n VEC(int, b, m);\\n rep(i, n) a[i]--;\\n rep(i, m) b[i]--;\\n\\n struct S {\\n vi v;\\n vvc<int> match;\\n S(vi a) : v(a) { match = vvc<int>(si(a) + 1, vi(si(a) + 1)); }\\n S() = default;\\n };\\n\\n vector<S> A, B;\\n rep(i, n) {\\n A.eb(a);\\n rotate(begin(a), begin(a) + 1, end(a));\\n }\\n rep(i, m) {\\n B.eb(b);\\n rotate(begin(b), begin(b) + 1, end(b));\\n }\\n\\n vector<pair<int, vi>> R;\\n rep(i, r) {\\n INT(k);\\n VEC(int, x, k);\\n rep(i, k) x[i]--;\\n INT(y);\\n y--;\\n R.eb(y, x);\\n }\\n\\n vv(int, DP, 30, 30);\\n auto calc = [&](S &s) {\\n auto &dp = s.match;\\n int n = si(s.v);\\n rep2(d, 1, n) {\\n rep(i, n) {\\n int j = i + d;\\n if(j > n) break;\\n if(d == 1) {\\n dp[i][j] = 1 << s.v[i];\\n continue;\\n }\\n for(auto &[y, x] : R) {\\n if(dp[i][j] >> y & 1) continue;\\n int k = si(x);\\n rep(i, d + 1) rep(j, k + 1) DP[i][j] = 0;\\n DP[0][0] = 1;\\n rep(ii, d) rep(jj, k) {\\n if(!DP[ii][jj]) continue;\\n rep2(to, ii + 1, d) {\\n int l = i + ii;\\n int r = i + to;\\n if(dp[l][r] >> x[jj] & 1) DP[to][jj + 1] = true;\\n }\\n }\\n if(DP[d][k]) dp[i][j] |= 1 << y;\\n }\\n }\\n }\\n };\\n each(e, A) calc(e);\\n each(e, B) calc(e);\\n\\n int ma = -1;\\n each(a, A) each(b, B) {\\n rep(i, n + 1) rep(j, m + 1) DP[i][j] = -inf<int>;\\n DP[0][0] = 0;\\n auto &x = a.match, &y = b.match;\\n rep(i, n) rep(j, m) {\\n if(DP[i][j] < 0) continue;\\n rep2(ii, i + 1, n) rep2(jj, j + 1, m) {\\n if(x[i][ii] & y[j][jj]) chmax(DP[ii][jj], DP[i][j] + 1);\\n }\\n }\\n chmax(ma, DP[n][m]);\\n }\\n OUT(ma);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 390,\n \"memory_kb\": 3648,\n \"score_of_the_acc\": -0.0372,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1191_6029869\",\n \"code_snippet\": \"#line 1 \\\"other-workspace\\\\\\\\icpc\\\\\\\\f.cc\\\"\\n#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nvoid chgr(int &x, int y) {\\n if (x < y) x = y;\\n}\\n\\nint main() {\\n constexpr auto sigma = 30;\\n\\n int n, m, r;\\n\\n while (1) {\\n cin >> n >> m >> r;\\n if (!n and !m and !r) break;\\n\\n vector<int> a(n), b(m);\\n for (auto &&x : a) {\\n cin >> x;\\n --x;\\n }\\n for (auto &&x : b) {\\n cin >> x;\\n --x;\\n }\\n\\n vector<vector<vector<int>>> trf(sigma);\\n\\n while (r--) {\\n int k;\\n cin >> k;\\n vector<int> src;\\n int dst;\\n while (k--) {\\n cin >> src.emplace_back();\\n --src.back();\\n }\\n cin >> dst;\\n --dst;\\n trf[dst].emplace_back(src);\\n }\\n\\n auto pre = [&](vector<int> v) {\\n vector dp(v.size() + 1, vector<int>(v.size() + 1));\\n\\n for (auto j = 1; j <= v.size(); ++j) {\\n dp[j - 1][j] = 1 << v[j - 1];\\n\\n for (auto i = j - 1; i--;) {\\n for (auto c = 0; c < sigma; ++c) {\\n // make [i, j) into c!\\n auto succ = 0;\\n\\n for (auto &&src : trf[c]) {\\n vector able(j + 1, vector<int>(src.size() + 1));\\n able[i][0] = 1;\\n\\n for (auto l = i; l < j; l++) {\\n for (auto k = 0; k < src.size(); k++) {\\n if (!able[l][k]) continue;\\n\\n for (auto r = l + 1; r <= j; ++r) {\\n if (dp[l][r] >> src[k] & 1) {\\n able[r][k + 1] = 1;\\n }\\n }\\n }\\n }\\n\\n if (able.back().back()) {\\n succ = 1;\\n }\\n }\\n\\n dp[i][j] |= succ << c;\\n }\\n }\\n }\\n\\n return dp;\\n };\\n\\n vector<vector<vector<int>>> dpa, dpb;\\n\\n for (auto t = 0; t < n; t++) {\\n dpa.emplace_back(pre(a));\\n rotate(begin(a), begin(a) + 1, end(a));\\n }\\n\\n for (auto t = 0; t < m; t++) {\\n dpb.emplace_back(pre(b));\\n rotate(begin(b), begin(b) + 1, end(b));\\n }\\n\\n auto answer = -1;\\n\\n for (auto &&ap : dpa) {\\n for (auto &&bp : dpb) {\\n vector dp(n + 1, vector(m + 1, -1));\\n dp[0][0] = 0;\\n\\n for (auto il = 0; il < n; il++) {\\n for (auto jl = 0; jl < m; jl++) {\\n if (~dp[il][jl]) {\\n for (auto ir = il + 1; ir <= n; ir++) {\\n for (auto jr = jl + 1; jr <= m; jr++) {\\n // A: [il, ir)\\n // B: [jl, jr)\\n if (ap[il][ir] & bp[jl][jr]) {\\n chgr(dp[ir][jr], dp[il][jl] + 1);\\n }\\n }\\n }\\n }\\n }\\n }\\n\\n chgr(answer, dp[n][m]);\\n }\\n }\\n\\n cout << answer << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3750,\n \"memory_kb\": 3608,\n \"score_of_the_acc\": -0.5198,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1191_6029792\",\n \"code_snippet\": \"#pragma region Macros\\n#pragma comment(linker, \\\"/stack:200000000\\\")\\n// #pragma GCC optimize(\\\"unroll-loops\\\")\\n// #pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native\\\")\\n// #pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2\\\")\\n// #pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"Ofast\\\")\\n#include <bits/stdc++.h>\\n#define ll long long\\nusing ld = long double;\\n#define rep2(i, a, b) for(ll i = (a); i <= (b); i++)\\n#define rep3(i, a, b) for(ll i = (a); i >= (b); --i)\\n#define rep(i, n) for(ll i = 0; i < n; ++i)\\n#define each(i, a) for(auto &&i : a)\\n#define pii pair<int, int>\\n#define pll pair<ll, ll>\\n#define pb push_back\\n#define eb emplace_back\\n#define vi vector<int>\\n#define vll vector<ll>\\n#define vpi vector<pii>\\n#define vpll vector<pll>\\n#define overload2(_1, _2, name, ...) name\\n#define vec(type, name, ...) vector<type> name(__VA_ARGS__)\\n#define VEC(type, name, size) \\\\\\n vector<type> name(size); \\\\\\n IN(name)\\n#define VEC2(type, name1, name2, size) \\\\\\n vector<type> name1(size), name2(size); \\\\\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i])\\n#define VEC3(type, name1, name2, name3, size) \\\\\\n vector<type> name1(size), name2(size), name3(size); \\\\\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i])\\n#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\\n#define VV(type, name, h, w) \\\\\\n vector<vector<type>> name(h, vector<type>(w)); \\\\\\n IN(name)\\n#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\\n#define vvvv(type, name, a, b, c, ...) \\\\\\n vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\\n#define mt make_tuple\\n#define fi first\\n#define se second\\n#define all(c) begin(c), end(c)\\n#define rall(c) rbegin(c), rend(c)\\n#define SORT(v) sort(all(v))\\n#define REV(v) reverse(all(v))\\ntemplate <class T = ll, class S> T SUM(const S &v) { return accumulate(all(v), T(0)); }\\n#define MIN(v) *min_element(all(v))\\n#define MAX(v) *max_element(all(v))\\n#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))\\n#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))\\nusing namespace std;\\nconstexpr pii dx4[4] = {pii{1, 0}, pii{0, 1}, pii{-1, 0}, pii{0, -1}};\\nconstexpr pii dx8[8] = {{1, 0}, {1, 1}, {0, 1}, {-1, 1}, {-1, 0}, {-1, -1}, {0, -1}, {1, -1}};\\nconst string YESNO[2] = {\\\"NO\\\", \\\"YES\\\"};\\nconst string YesNo[2] = {\\\"No\\\", \\\"Yes\\\"};\\nconst string yesno[2] = {\\\"no\\\", \\\"yes\\\"};\\nvoid YES(bool t = 1) { cout << YESNO[t] << endl; }\\nvoid NO(bool t = 1) { YES(!t); }\\nvoid Yes(bool t = 1) { cout << YesNo[t] << endl; }\\nvoid No(bool t = 1) { Yes(!t); }\\nvoid yes(bool t = 1) { cout << yesno[t] << endl; }\\nvoid no(bool t = 1) { yes(!t); }\\ntemplate <class T> using vc = vector<T>;\\ntemplate <class T> using vvc = vector<vc<T>>;\\ntemplate <class T> using vvvc = vector<vvc<T>>;\\ntemplate <class T> using vvvvc = vector<vvvc<T>>;\\ntemplate <class T> using pq = priority_queue<T>;\\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\\n#define si(c) (int)(c).size()\\n#define INT(...) \\\\\\n int __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define LL(...) \\\\\\n ll __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define STR(...) \\\\\\n string __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define CHR(...) \\\\\\n char __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define DBL(...) \\\\\\n double __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\nint scan() { return getchar(); }\\nvoid scan(int &a) { cin >> a; }\\nvoid scan(long long &a) { cin >> a; }\\nvoid scan(char &a) { cin >> a; }\\nvoid scan(double &a) { cin >> a; }\\nvoid scan(string &a) { cin >> a; }\\ntemplate <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); }\\ntemplate <class T> void scan(vector<T> &);\\ntemplate <class T> void scan(vector<T> &a) {\\n for(auto &i : a) scan(i);\\n}\\ntemplate <class T> void scan(T &a) { cin >> a; }\\nvoid IN() {}\\ntemplate <class Head, class... Tail> void IN(Head &head, Tail &...tail) {\\n scan(head);\\n IN(tail...);\\n}\\n\\ntemplate <class T, class S> inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); }\\ntemplate <class T, class S> inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); }\\nvi iota(int n) {\\n vi a(n);\\n iota(all(a), 0);\\n return a;\\n}\\ntemplate <typename T> vi iota(vector<T> &a, bool greater = false) {\\n vi res(a.size());\\n iota(all(res), 0);\\n sort(all(res), [&](int i, int j) {\\n if(greater) return a[i] > a[j];\\n return a[i] < a[j];\\n });\\n return res;\\n}\\n#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())\\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}\\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}\\ntemplate <class T> T POW(T x, int n) {\\n T res = 1;\\n for(; n; n >>= 1, x *= x)\\n if(n & 1) res *= x;\\n return res;\\n}\\ntemplate <class T, class S> T POW(T x, S n, const ll &mod) {\\n T res = 1;\\n for(; n; n >>= 1, x = x * x % mod)\\n if(n & 1) res = res * x % mod;\\n return res;\\n}\\nvector<pll> factor(ll x) {\\n vector<pll> ans;\\n for(ll i = 2; i * i <= x; i++)\\n if(x % i == 0) {\\n ans.push_back({i, 1});\\n while((x /= i) % i == 0) ans.back().second++;\\n }\\n if(x != 1) ans.push_back({x, 1});\\n return ans;\\n}\\ntemplate <class T> vector<T> divisor(T x) {\\n vector<T> ans;\\n for(T i = 1; i * i <= x; i++)\\n if(x % i == 0) {\\n ans.pb(i);\\n if(i * i != x) ans.pb(x / i);\\n }\\n return ans;\\n}\\ntemplate <typename T> void zip(vector<T> &x) {\\n vector<T> y = x;\\n UNIQUE(y);\\n for(int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); }\\n}\\ntemplate <class S> void fold_in(vector<S> &v) {}\\ntemplate <typename Head, typename... Tail, class S> void fold_in(vector<S> &v, Head &&a, Tail &&...tail) {\\n for(auto e : a) v.emplace_back(e);\\n fold_in(v, tail...);\\n}\\ntemplate <class S> void renumber(vector<S> &v) {}\\ntemplate <typename Head, typename... Tail, class S> void renumber(vector<S> &v, Head &&a, Tail &&...tail) {\\n for(auto &&e : a) e = lb(v, e);\\n renumber(v, tail...);\\n}\\ntemplate <class S, class... Args> vector<S> zip(vector<S> &head, Args &&...args) {\\n vector<S> v;\\n fold_in(v, head, args...);\\n sort(all(v)), v.erase(unique(all(v)), v.end());\\n renumber(v, head, args...);\\n return v;\\n}\\n\\n// x in [l, r)\\ntemplate <class T, class S> bool inc(const T &x, const S &l, const S &r) { return l <= x and x < r; }\\n// (a, b) in [lx, rx) * [ly, ry)\\ntemplate <class T, class S> bool inc(const pair<T, T> &x, const S &lx, const S &ly, const S &rx, const S &ry) { return inc(x.fi, lx, rx) && inc(x.se, ly, ry); }\\n\\nconstexpr ll ten(int n) { return n == 0 ? 1 : ten(n - 1) * 10; }\\n// bit 演算系\\nll pow2(int i) { return 1LL << i; }\\nint topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }\\nint topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }\\nint lowbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }\\nint lowbit(ll a) { return a == 0 ? 64 : __builtin_ctzll(a); }\\n// int allbit(int n) { return (1 << n) - 1; }\\nconstexpr ll allbit(int n) { return (1LL << n) - 1; }\\n// int popcount(signed t) { return __builtin_popcount(t); }\\n// int popcount(ll t) { return __builtin_popcountll(t); }\\nint popcount(uint64_t t) { return __builtin_popcountll(t); }\\nbool ispow2(int i) { return i && (i & -i) == i; }\\n\\nll rnd(ll l, ll r) { //[l, r)\\n#ifdef _LOCAL\\n static mt19937_64 gen;\\n#else\\n static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());\\n#endif\\n return uniform_int_distribution<ll>(l, r - 1)(gen);\\n}\\nll rnd(ll n) { return rnd(0, n); }\\n\\ntemplate <class t> void random_shuffle(vc<t> &a) { rep(i, si(a)) swap(a[i], a[rnd(0, i + 1)]); }\\n\\nint in() {\\n int x;\\n cin >> x;\\n return x;\\n}\\nll lin() {\\n unsigned long long x;\\n cin >> x;\\n return x;\\n}\\n\\ntemplate <class T, class S> pair<T, S> operator-(const pair<T, S> &x, const pair<T, S> &y) { return pair<T, S>(x.fi - y.fi, x.se - y.se); }\\ntemplate <class T, class S> pair<T, S> operator+(const pair<T, S> &x, const pair<T, S> &y) { return pair<T, S>(x.fi + y.fi, x.se + y.se); }\\ntemplate <class T> pair<T, T> operator&(const pair<T, T> &l, const pair<T, T> &r) { return pair<T, T>(max(l.fi, r.fi), min(l.se, r.se)); }\\ntemplate <class T, class S> pair<T, S> operator+=(pair<T, S> &l, const pair<T, S> &r) { return l = l + r; }\\ntemplate <class T, class S> pair<T, S> operator-=(pair<T, S> &l, const pair<T, S> &r) { return l = l - r; }\\ntemplate <class T> bool intersect(const pair<T, T> &l, const pair<T, T> &r) { return (l.se < r.se ? r.fi < l.se : l.fi < r.se); }\\n\\ntemplate <class T> ll operator*(const pair<T, T> &x, const pair<T, T> &y) { return (ll)x.fi * y.fi + (ll)x.se * y.se; }\\n\\ntemplate <typename T> struct edge {\\n int from, to;\\n T cost;\\n int id;\\n edge(int to, T cost) : from(-1), to(to), cost(cost) {}\\n edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}\\n edge(int from, int to, T cost, int id) : from(from), to(to), cost(cost), id(id) {}\\n constexpr bool operator<(const edge<T> &rhs) const noexcept { return cost < rhs.cost; }\\n edge &operator=(const int &x) {\\n to = x;\\n return *this;\\n }\\n operator int() const { return to; }\\n};\\ntemplate <typename T> using Edges = vector<edge<T>>;\\n\\nusing Tree = vector<vector<int>>;\\nusing Graph = vector<vector<int>>;\\ntemplate <class T> using Wgraph = vector<vector<edge<T>>>;\\nGraph getG(int n, int m = -1, bool directed = false, int margin = 1) {\\n Tree res(n);\\n if(m == -1) m = n - 1;\\n while(m--) {\\n int a, b;\\n cin >> a >> b;\\n a -= margin, b -= margin;\\n res[a].emplace_back(b);\\n if(!directed) res[b].emplace_back(a);\\n }\\n return res;\\n}\\nGraph getTreeFromPar(int n, int margin = 1) {\\n Graph res(n);\\n for(int i = 1; i < n; i++) {\\n int a;\\n cin >> a;\\n res[a - margin].emplace_back(i);\\n }\\n return res;\\n}\\ntemplate <class T> Wgraph<T> getWg(int n, int m = -1, bool directed = false, int margin = 1) {\\n Wgraph<T> res(n);\\n if(m == -1) m = n - 1;\\n while(m--) {\\n int a, b;\\n T c;\\n cin >> a >> b >> c;\\n a -= margin, b -= margin;\\n res[a].emplace_back(b, c);\\n if(!directed) res[b].emplace_back(a, c);\\n }\\n return res;\\n}\\nvoid add(Graph &G, int x, int y) { G[x].eb(y), G[y].eb(x); }\\ntemplate <class S, class T> void add(Wgraph<S> &G, int x, int y, T c) { G[x].eb(y, c), G[y].eb(x, c); }\\n\\n#define i128 __int128_t\\n#define ull unsigned long long int\\n#define TEST \\\\\\n INT(testcases); \\\\\\n while(testcases--)\\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\\n for(auto it = begin(v); it != end(v); ++it) {\\n if(it == begin(v))\\n os << *it;\\n else\\n os << \\\" \\\" << *it;\\n }\\n return os;\\n}\\ntemplate <class T, class S> ostream &operator<<(ostream &os, const pair<T, S> &p) {\\n os << p.first << \\\" \\\" << p.second;\\n return os;\\n}\\ntemplate <class S, class T> string to_string(pair<S, T> p) { return \\\"(\\\" + to_string(p.first) + \\\",\\\" + to_string(p.second) + \\\")\\\"; }\\nstring to_string(string s) { return \\\"\\\\\\\"\\\" + s + \\\"\\\\\\\"\\\"; }\\nstring to_string(char c) { return string(1, c); }\\ntemplate <class T> string to_string(vector<T> s) {\\n string res = \\\"{\\\";\\n for(auto it = s.begin(); it != s.end(); it++) res += to_string(*it) + (next(it) == s.end() ? \\\"\\\" : \\\", \\\");\\n return res + \\\"}\\\";\\n}\\ntemplate <class T> string to_string(set<T> s) {\\n string res = \\\"{\\\";\\n for(auto it = s.begin(); it != s.end(); it++) res += to_string(*it), res += (next(it) == end(s) ? \\\"\\\" : \\\", \\\");\\n return res + \\\"}\\\";\\n}\\n\\n#define endl '\\\\n'\\n\\n#ifdef _LOCAL\\nvoid dump() { cerr << endl; }\\ntemplate <class Head, class... Tail> void dump(Head head, Tail... tail) {\\n cerr << to_string(head) << \\\" \\\";\\n dump(tail...);\\n}\\n#undef endl\\n#define debug(x) \\\\\\n cout << #x << \\\": \\\"; \\\\\\n dump(x)\\n#else\\nvoid dump() {}\\ntemplate <class Head, class... Tail> void dump(Head head, Tail... tail) {}\\n#define debug(x)\\n#endif\\ntemplate <class T> void print(const T &a) { cout << a; }\\nvoid OUT() { cout << endl; }\\ntemplate <class Head, class... Tail> void OUT(const Head &head, const Tail &...tail) {\\n print(head);\\n if(sizeof...(tail)) cout << ' ';\\n OUT(tail...);\\n}\\n\\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\\n#define drop(s) cout << #s << endl, exit(0)\\n\\ntemplate <int N> struct ndFORarray {\\n std::array<int, N> v;\\n ndFORarray(std::array<int, N> v_) : v(v_) {}\\n struct ndFORitr {\\n const std::array<int, N> &v;\\n std::array<int, N> tmp;\\n bool is_end;\\n ndFORitr(const std::array<int, N> &v_) : v(v_), tmp(), is_end(false) {}\\n bool operator!=(const ndFORitr &) const { return !is_end; }\\n void operator++() {\\n int pos = N - 1;\\n while(pos != -1) {\\n tmp[pos] += 1;\\n if(tmp[pos] == v[pos]) {\\n tmp[pos] = 0;\\n pos -= 1;\\n } else {\\n break;\\n }\\n }\\n if(pos == -1) { is_end = true; }\\n }\\n const std::array<int, N> &operator*() const { return tmp; }\\n };\\n ndFORitr begin() const { return ndFORitr(v); }\\n ndFORitr end() const { return ndFORitr(v); }\\n};\\n\\nstruct ndFORvector {\\n std::vector<int> v;\\n ndFORvector(std::vector<int> v_) : v(v_) {}\\n struct ndFORitr {\\n const std::vector<int> &v;\\n std::vector<int> tmp;\\n bool is_end;\\n ndFORitr(const std::vector<int> &v_) : v(v_), tmp(v.size(), 0), is_end(false) {}\\n bool operator!=(const ndFORitr &) const { return !is_end; }\\n void operator++() {\\n int pos = v.size() - 1;\\n while(pos != -1) {\\n tmp[pos] += 1;\\n if(tmp[pos] == v[pos]) {\\n tmp[pos] = 0;\\n pos -= 1;\\n } else {\\n break;\\n }\\n }\\n if(pos == -1) { is_end = true; }\\n }\\n const std::vector<int> &operator*() const { return tmp; }\\n };\\n ndFORitr begin() const { return ndFORitr(v); }\\n ndFORitr end() const { return ndFORitr(v); }\\n};\\n\\nauto ndFOR(std::vector<int> v) { return ndFORvector(v); }\\ntemplate <class... Ts> auto ndFOR(Ts... v) { return ndFORarray<std::tuple_size<std::tuple<Ts...>>::value>({v...}); }\\ntemplate <class F> struct REC {\\n F f;\\n REC(F &&f_) : f(std::forward<F>(f_)) {}\\n template <class... Args> auto operator()(Args &&...args) const { return f(*this, std::forward<Args>(args)...); }\\n};\\n\\ntemplate <class S> vector<pair<S, int>> runLength(const vector<S> &v) {\\n vector<pair<S, int>> res;\\n for(auto &e : v) {\\n if(res.empty() or res.back().fi != e)\\n res.eb(e, 1);\\n else\\n res.back().se++;\\n }\\n return res;\\n}\\nvector<pair<char, int>> runLength(const string &v) {\\n vector<pair<char, int>> res;\\n for(auto &e : v) {\\n if(res.empty() or res.back().fi != e)\\n res.eb(e, 1);\\n else\\n res.back().se++;\\n }\\n return res;\\n}\\n\\ntemplate <class T = int> struct Imos {\\n int n;\\n vector<T> a;\\n Imos(int _n) : n(_n), a(_n + 1) {}\\n void add(int l, int r, T val = 1) {\\n if(l >= r) return;\\n l = clamp(l, 0, n);\\n r = clamp(r, 0, n + 1);\\n a[l] += val;\\n if(r <= n) a[r] -= val;\\n }\\n void build() {\\n for(int i = 0; i < n; i++) a[i + 1] += a[i];\\n }\\n const T &operator[](int k) { return a[k]; }\\n};\\n\\ntemplate <class T> struct RUI {\\n vector<T> a;\\n RUI(const vector<T> &v) : a(v.size() + 1) {\\n for(int i = 0; i < v.size(); i++) a[i + 1] = a[i] + v[i];\\n }\\n T get(int l, int r) { return a[r] - a[l]; }\\n};\\n\\ntemplate <class T, class F> T bin_search(T ok, T ng, const F &f) {\\n while(abs(ok - ng) > 1) {\\n T mid = ok + ng >> 1;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\ntemplate <class T, class F> T bin_search_double(T ok, T ng, const F &f, int iter = 80) {\\n while(iter--) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n\\nstruct Setup_io {\\n Setup_io() {\\n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\\n cout << fixed << setprecision(15);\\n }\\n} setup_io;\\n#pragma endregion\\n\\nint main() {\\n while(1) {\\n INT(n, m, r);\\n if(!n) exit(0);\\n VEC(int, a, n);\\n VEC(int, b, m);\\n rep(i, n) a[i]--;\\n rep(i, m) b[i]--;\\n\\n struct S {\\n vi v;\\n vvc<int> match;\\n S(vi a) : v(a) { match = vvc<int>(si(a) + 1, vi(si(a) + 1)); }\\n S() = default;\\n };\\n\\n vector<S> A, B;\\n rep(i, n) {\\n A.eb(a);\\n rotate(begin(a), begin(a) + 1, end(a));\\n }\\n rep(i, m) {\\n B.eb(b);\\n rotate(begin(b), begin(b) + 1, end(b));\\n }\\n\\n vector<pair<int, vi>> R;\\n rep(i, r) {\\n INT(k);\\n VEC(int, x, k);\\n rep(i, k) x[i]--;\\n INT(y);\\n y--;\\n R.eb(y, x);\\n }\\n\\n vv(int, DP, 30, 30);\\n auto calc = [&](S &s) {\\n auto &dp = s.match;\\n int n = si(s.v);\\n rep2(d, 1, n) {\\n rep(i, n) {\\n int j = i + d;\\n if(j > n) break;\\n if(d == 1) {\\n dp[i][j] = 1 << s.v[i];\\n continue;\\n }\\n for(auto &[y, x] : R) {\\n if(dp[i][j] >> y & 1) continue;\\n int k = si(x);\\n rep(i, d + 1) rep(j, k + 1) DP[i][j] = 0;\\n DP[0][0] = 1;\\n rep(ii, d) rep(jj, k) {\\n if(!DP[ii][jj]) continue;\\n rep2(to, ii + 1, d) {\\n int l = i + ii;\\n int r = i + to;\\n if(dp[l][r] >> x[jj] & 1) DP[to][jj + 1] = true;\\n }\\n }\\n if(DP[d][k]) dp[i][j] |= 1 << y;\\n }\\n }\\n }\\n };\\n each(e, A) calc(e);\\n each(e, B) calc(e);\\n\\n int ma = -1;\\n each(a, A) each(b, B) {\\n rep(i, n + 1) rep(j, m + 1) DP[i][j] = -inf<int>;\\n DP[0][0] = 0;\\n auto &x = a.match, &y = b.match;\\n rep(i, n) rep(j, m) {\\n if(DP[i][j] < 0) continue;\\n rep2(ii, i + 1, n) rep2(jj, j + 1, m) {\\n if(x[i][ii] & y[j][jj]) chmax(DP[ii][jj], DP[i][j] + 1);\\n }\\n }\\n chmax(ma, DP[n][m]);\\n }\\n OUT(ma);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 390,\n \"memory_kb\": 3596,\n \"score_of_the_acc\": -0.0352,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1191_6029771\",\n \"code_snippet\": \"#pragma region Macros\\n#pragma comment(linker, \\\"/stack:200000000\\\")\\n// #pragma GCC optimize(\\\"unroll-loops\\\")\\n// #pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native\\\")\\n// #pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2\\\")\\n// #pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"Ofast\\\")\\n#include <bits/stdc++.h>\\n#define ll long long\\nusing ld = long double;\\n#define rep2(i, a, b) for(ll i = (a); i <= (b); i++)\\n#define rep3(i, a, b) for(ll i = (a); i >= (b); --i)\\n#define rep(i, n) for(ll i = 0; i < n; ++i)\\n#define each(i, a) for(auto &&i : a)\\n#define pii pair<int, int>\\n#define pll pair<ll, ll>\\n#define pb push_back\\n#define eb emplace_back\\n#define vi vector<int>\\n#define vll vector<ll>\\n#define vpi vector<pii>\\n#define vpll vector<pll>\\n#define overload2(_1, _2, name, ...) name\\n#define vec(type, name, ...) vector<type> name(__VA_ARGS__)\\n#define VEC(type, name, size) \\\\\\n vector<type> name(size); \\\\\\n IN(name)\\n#define VEC2(type, name1, name2, size) \\\\\\n vector<type> name1(size), name2(size); \\\\\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i])\\n#define VEC3(type, name1, name2, name3, size) \\\\\\n vector<type> name1(size), name2(size), name3(size); \\\\\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i])\\n#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\\n#define VV(type, name, h, w) \\\\\\n vector<vector<type>> name(h, vector<type>(w)); \\\\\\n IN(name)\\n#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\\n#define vvvv(type, name, a, b, c, ...) \\\\\\n vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\\n#define mt make_tuple\\n#define fi first\\n#define se second\\n#define all(c) begin(c), end(c)\\n#define rall(c) rbegin(c), rend(c)\\n#define SORT(v) sort(all(v))\\n#define REV(v) reverse(all(v))\\ntemplate <class T = ll, class S> T SUM(const S &v) { return accumulate(all(v), T(0)); }\\n#define MIN(v) *min_element(all(v))\\n#define MAX(v) *max_element(all(v))\\n#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))\\n#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))\\nusing namespace std;\\nconstexpr pii dx4[4] = {pii{1, 0}, pii{0, 1}, pii{-1, 0}, pii{0, -1}};\\nconstexpr pii dx8[8] = {{1, 0}, {1, 1}, {0, 1}, {-1, 1}, {-1, 0}, {-1, -1}, {0, -1}, {1, -1}};\\nconst string YESNO[2] = {\\\"NO\\\", \\\"YES\\\"};\\nconst string YesNo[2] = {\\\"No\\\", \\\"Yes\\\"};\\nconst string yesno[2] = {\\\"no\\\", \\\"yes\\\"};\\nvoid YES(bool t = 1) { cout << YESNO[t] << endl; }\\nvoid NO(bool t = 1) { YES(!t); }\\nvoid Yes(bool t = 1) { cout << YesNo[t] << endl; }\\nvoid No(bool t = 1) { Yes(!t); }\\nvoid yes(bool t = 1) { cout << yesno[t] << endl; }\\nvoid no(bool t = 1) { yes(!t); }\\ntemplate <class T> using vc = vector<T>;\\ntemplate <class T> using vvc = vector<vc<T>>;\\ntemplate <class T> using vvvc = vector<vvc<T>>;\\ntemplate <class T> using vvvvc = vector<vvvc<T>>;\\ntemplate <class T> using pq = priority_queue<T>;\\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\\n#define si(c) (int)(c).size()\\n#define INT(...) \\\\\\n int __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define LL(...) \\\\\\n ll __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define STR(...) \\\\\\n string __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define CHR(...) \\\\\\n char __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define DBL(...) \\\\\\n double __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\nint scan() { return getchar(); }\\nvoid scan(int &a) { cin >> a; }\\nvoid scan(long long &a) { cin >> a; }\\nvoid scan(char &a) { cin >> a; }\\nvoid scan(double &a) { cin >> a; }\\nvoid scan(string &a) { cin >> a; }\\ntemplate <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); }\\ntemplate <class T> void scan(vector<T> &);\\ntemplate <class T> void scan(vector<T> &a) {\\n for(auto &i : a) scan(i);\\n}\\ntemplate <class T> void scan(T &a) { cin >> a; }\\nvoid IN() {}\\ntemplate <class Head, class... Tail> void IN(Head &head, Tail &...tail) {\\n scan(head);\\n IN(tail...);\\n}\\n\\ntemplate <class T, class S> inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); }\\ntemplate <class T, class S> inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); }\\nvi iota(int n) {\\n vi a(n);\\n iota(all(a), 0);\\n return a;\\n}\\ntemplate <typename T> vi iota(vector<T> &a, bool greater = false) {\\n vi res(a.size());\\n iota(all(res), 0);\\n sort(all(res), [&](int i, int j) {\\n if(greater) return a[i] > a[j];\\n return a[i] < a[j];\\n });\\n return res;\\n}\\n#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())\\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}\\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}\\ntemplate <class T> T POW(T x, int n) {\\n T res = 1;\\n for(; n; n >>= 1, x *= x)\\n if(n & 1) res *= x;\\n return res;\\n}\\ntemplate <class T, class S> T POW(T x, S n, const ll &mod) {\\n T res = 1;\\n for(; n; n >>= 1, x = x * x % mod)\\n if(n & 1) res = res * x % mod;\\n return res;\\n}\\nvector<pll> factor(ll x) {\\n vector<pll> ans;\\n for(ll i = 2; i * i <= x; i++)\\n if(x % i == 0) {\\n ans.push_back({i, 1});\\n while((x /= i) % i == 0) ans.back().second++;\\n }\\n if(x != 1) ans.push_back({x, 1});\\n return ans;\\n}\\ntemplate <class T> vector<T> divisor(T x) {\\n vector<T> ans;\\n for(T i = 1; i * i <= x; i++)\\n if(x % i == 0) {\\n ans.pb(i);\\n if(i * i != x) ans.pb(x / i);\\n }\\n return ans;\\n}\\ntemplate <typename T> void zip(vector<T> &x) {\\n vector<T> y = x;\\n UNIQUE(y);\\n for(int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); }\\n}\\ntemplate <class S> void fold_in(vector<S> &v) {}\\ntemplate <typename Head, typename... Tail, class S> void fold_in(vector<S> &v, Head &&a, Tail &&...tail) {\\n for(auto e : a) v.emplace_back(e);\\n fold_in(v, tail...);\\n}\\ntemplate <class S> void renumber(vector<S> &v) {}\\ntemplate <typename Head, typename... Tail, class S> void renumber(vector<S> &v, Head &&a, Tail &&...tail) {\\n for(auto &&e : a) e = lb(v, e);\\n renumber(v, tail...);\\n}\\ntemplate <class S, class... Args> vector<S> zip(vector<S> &head, Args &&...args) {\\n vector<S> v;\\n fold_in(v, head, args...);\\n sort(all(v)), v.erase(unique(all(v)), v.end());\\n renumber(v, head, args...);\\n return v;\\n}\\n\\n// x in [l, r)\\ntemplate <class T, class S> bool inc(const T &x, const S &l, const S &r) { return l <= x and x < r; }\\n// (a, b) in [lx, rx) * [ly, ry)\\ntemplate <class T, class S> bool inc(const pair<T, T> &x, const S &lx, const S &ly, const S &rx, const S &ry) { return inc(x.fi, lx, rx) && inc(x.se, ly, ry); }\\n\\nconstexpr ll ten(int n) { return n == 0 ? 1 : ten(n - 1) * 10; }\\n// bit 演算系\\nll pow2(int i) { return 1LL << i; }\\nint topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }\\nint topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }\\nint lowbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }\\nint lowbit(ll a) { return a == 0 ? 64 : __builtin_ctzll(a); }\\n// int allbit(int n) { return (1 << n) - 1; }\\nconstexpr ll allbit(int n) { return (1LL << n) - 1; }\\n// int popcount(signed t) { return __builtin_popcount(t); }\\n// int popcount(ll t) { return __builtin_popcountll(t); }\\nint popcount(uint64_t t) { return __builtin_popcountll(t); }\\nbool ispow2(int i) { return i && (i & -i) == i; }\\n\\nll rnd(ll l, ll r) { //[l, r)\\n#ifdef _LOCAL\\n static mt19937_64 gen;\\n#else\\n static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());\\n#endif\\n return uniform_int_distribution<ll>(l, r - 1)(gen);\\n}\\nll rnd(ll n) { return rnd(0, n); }\\n\\ntemplate <class t> void random_shuffle(vc<t> &a) { rep(i, si(a)) swap(a[i], a[rnd(0, i + 1)]); }\\n\\nint in() {\\n int x;\\n cin >> x;\\n return x;\\n}\\nll lin() {\\n unsigned long long x;\\n cin >> x;\\n return x;\\n}\\n\\ntemplate <class T, class S> pair<T, S> operator-(const pair<T, S> &x, const pair<T, S> &y) { return pair<T, S>(x.fi - y.fi, x.se - y.se); }\\ntemplate <class T, class S> pair<T, S> operator+(const pair<T, S> &x, const pair<T, S> &y) { return pair<T, S>(x.fi + y.fi, x.se + y.se); }\\ntemplate <class T> pair<T, T> operator&(const pair<T, T> &l, const pair<T, T> &r) { return pair<T, T>(max(l.fi, r.fi), min(l.se, r.se)); }\\ntemplate <class T, class S> pair<T, S> operator+=(pair<T, S> &l, const pair<T, S> &r) { return l = l + r; }\\ntemplate <class T, class S> pair<T, S> operator-=(pair<T, S> &l, const pair<T, S> &r) { return l = l - r; }\\ntemplate <class T> bool intersect(const pair<T, T> &l, const pair<T, T> &r) { return (l.se < r.se ? r.fi < l.se : l.fi < r.se); }\\n\\ntemplate <class T> ll operator*(const pair<T, T> &x, const pair<T, T> &y) { return (ll)x.fi * y.fi + (ll)x.se * y.se; }\\n\\ntemplate <typename T> struct edge {\\n int from, to;\\n T cost;\\n int id;\\n edge(int to, T cost) : from(-1), to(to), cost(cost) {}\\n edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}\\n edge(int from, int to, T cost, int id) : from(from), to(to), cost(cost), id(id) {}\\n constexpr bool operator<(const edge<T> &rhs) const noexcept { return cost < rhs.cost; }\\n edge &operator=(const int &x) {\\n to = x;\\n return *this;\\n }\\n operator int() const { return to; }\\n};\\ntemplate <typename T> using Edges = vector<edge<T>>;\\n\\nusing Tree = vector<vector<int>>;\\nusing Graph = vector<vector<int>>;\\ntemplate <class T> using Wgraph = vector<vector<edge<T>>>;\\nGraph getG(int n, int m = -1, bool directed = false, int margin = 1) {\\n Tree res(n);\\n if(m == -1) m = n - 1;\\n while(m--) {\\n int a, b;\\n cin >> a >> b;\\n a -= margin, b -= margin;\\n res[a].emplace_back(b);\\n if(!directed) res[b].emplace_back(a);\\n }\\n return res;\\n}\\nGraph getTreeFromPar(int n, int margin = 1) {\\n Graph res(n);\\n for(int i = 1; i < n; i++) {\\n int a;\\n cin >> a;\\n res[a - margin].emplace_back(i);\\n }\\n return res;\\n}\\ntemplate <class T> Wgraph<T> getWg(int n, int m = -1, bool directed = false, int margin = 1) {\\n Wgraph<T> res(n);\\n if(m == -1) m = n - 1;\\n while(m--) {\\n int a, b;\\n T c;\\n cin >> a >> b >> c;\\n a -= margin, b -= margin;\\n res[a].emplace_back(b, c);\\n if(!directed) res[b].emplace_back(a, c);\\n }\\n return res;\\n}\\nvoid add(Graph &G, int x, int y) { G[x].eb(y), G[y].eb(x); }\\ntemplate <class S, class T> void add(Wgraph<S> &G, int x, int y, T c) { G[x].eb(y, c), G[y].eb(x, c); }\\n\\n#define i128 __int128_t\\n#define ull unsigned long long int\\n#define TEST \\\\\\n INT(testcases); \\\\\\n while(testcases--)\\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\\n for(auto it = begin(v); it != end(v); ++it) {\\n if(it == begin(v))\\n os << *it;\\n else\\n os << \\\" \\\" << *it;\\n }\\n return os;\\n}\\ntemplate <class T, class S> ostream &operator<<(ostream &os, const pair<T, S> &p) {\\n os << p.first << \\\" \\\" << p.second;\\n return os;\\n}\\ntemplate <class S, class T> string to_string(pair<S, T> p) { return \\\"(\\\" + to_string(p.first) + \\\",\\\" + to_string(p.second) + \\\")\\\"; }\\nstring to_string(string s) { return \\\"\\\\\\\"\\\" + s + \\\"\\\\\\\"\\\"; }\\nstring to_string(char c) { return string(1, c); }\\ntemplate <class T> string to_string(vector<T> s) {\\n string res = \\\"{\\\";\\n for(auto it = s.begin(); it != s.end(); it++) res += to_string(*it) + (next(it) == s.end() ? \\\"\\\" : \\\", \\\");\\n return res + \\\"}\\\";\\n}\\ntemplate <class T> string to_string(set<T> s) {\\n string res = \\\"{\\\";\\n for(auto it = s.begin(); it != s.end(); it++) res += to_string(*it), res += (next(it) == end(s) ? \\\"\\\" : \\\", \\\");\\n return res + \\\"}\\\";\\n}\\n\\n#define endl '\\\\n'\\n\\n#ifdef _LOCAL\\nvoid dump() { cerr << endl; }\\ntemplate <class Head, class... Tail> void dump(Head head, Tail... tail) {\\n cerr << to_string(head) << \\\" \\\";\\n dump(tail...);\\n}\\n#undef endl\\n#define debug(x) \\\\\\n cout << #x << \\\": \\\"; \\\\\\n dump(x)\\n#else\\nvoid dump() {}\\ntemplate <class Head, class... Tail> void dump(Head head, Tail... tail) {}\\n#define debug(x)\\n#endif\\ntemplate <class T> void print(const T &a) { cout << a; }\\nvoid OUT() { cout << endl; }\\ntemplate <class Head, class... Tail> void OUT(const Head &head, const Tail &...tail) {\\n print(head);\\n if(sizeof...(tail)) cout << ' ';\\n OUT(tail...);\\n}\\n\\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\\n#define drop(s) cout << #s << endl, exit(0)\\n\\ntemplate <int N> struct ndFORarray {\\n std::array<int, N> v;\\n ndFORarray(std::array<int, N> v_) : v(v_) {}\\n struct ndFORitr {\\n const std::array<int, N> &v;\\n std::array<int, N> tmp;\\n bool is_end;\\n ndFORitr(const std::array<int, N> &v_) : v(v_), tmp(), is_end(false) {}\\n bool operator!=(const ndFORitr &) const { return !is_end; }\\n void operator++() {\\n int pos = N - 1;\\n while(pos != -1) {\\n tmp[pos] += 1;\\n if(tmp[pos] == v[pos]) {\\n tmp[pos] = 0;\\n pos -= 1;\\n } else {\\n break;\\n }\\n }\\n if(pos == -1) { is_end = true; }\\n }\\n const std::array<int, N> &operator*() const { return tmp; }\\n };\\n ndFORitr begin() const { return ndFORitr(v); }\\n ndFORitr end() const { return ndFORitr(v); }\\n};\\n\\nstruct ndFORvector {\\n std::vector<int> v;\\n ndFORvector(std::vector<int> v_) : v(v_) {}\\n struct ndFORitr {\\n const std::vector<int> &v;\\n std::vector<int> tmp;\\n bool is_end;\\n ndFORitr(const std::vector<int> &v_) : v(v_), tmp(v.size(), 0), is_end(false) {}\\n bool operator!=(const ndFORitr &) const { return !is_end; }\\n void operator++() {\\n int pos = v.size() - 1;\\n while(pos != -1) {\\n tmp[pos] += 1;\\n if(tmp[pos] == v[pos]) {\\n tmp[pos] = 0;\\n pos -= 1;\\n } else {\\n break;\\n }\\n }\\n if(pos == -1) { is_end = true; }\\n }\\n const std::vector<int> &operator*() const { return tmp; }\\n };\\n ndFORitr begin() const { return ndFORitr(v); }\\n ndFORitr end() const { return ndFORitr(v); }\\n};\\n\\nauto ndFOR(std::vector<int> v) { return ndFORvector(v); }\\ntemplate <class... Ts> auto ndFOR(Ts... v) { return ndFORarray<std::tuple_size<std::tuple<Ts...>>::value>({v...}); }\\ntemplate <class F> struct REC {\\n F f;\\n REC(F &&f_) : f(std::forward<F>(f_)) {}\\n template <class... Args> auto operator()(Args &&...args) const { return f(*this, std::forward<Args>(args)...); }\\n};\\n\\ntemplate <class S> vector<pair<S, int>> runLength(const vector<S> &v) {\\n vector<pair<S, int>> res;\\n for(auto &e : v) {\\n if(res.empty() or res.back().fi != e)\\n res.eb(e, 1);\\n else\\n res.back().se++;\\n }\\n return res;\\n}\\nvector<pair<char, int>> runLength(const string &v) {\\n vector<pair<char, int>> res;\\n for(auto &e : v) {\\n if(res.empty() or res.back().fi != e)\\n res.eb(e, 1);\\n else\\n res.back().se++;\\n }\\n return res;\\n}\\n\\ntemplate <class T = int> struct Imos {\\n int n;\\n vector<T> a;\\n Imos(int _n) : n(_n), a(_n + 1) {}\\n void add(int l, int r, T val = 1) {\\n if(l >= r) return;\\n l = clamp(l, 0, n);\\n r = clamp(r, 0, n + 1);\\n a[l] += val;\\n if(r <= n) a[r] -= val;\\n }\\n void build() {\\n for(int i = 0; i < n; i++) a[i + 1] += a[i];\\n }\\n const T &operator[](int k) { return a[k]; }\\n};\\n\\ntemplate <class T> struct RUI {\\n vector<T> a;\\n RUI(const vector<T> &v) : a(v.size() + 1) {\\n for(int i = 0; i < v.size(); i++) a[i + 1] = a[i] + v[i];\\n }\\n T get(int l, int r) { return a[r] - a[l]; }\\n};\\n\\ntemplate <class T, class F> T bin_search(T ok, T ng, const F &f) {\\n while(abs(ok - ng) > 1) {\\n T mid = ok + ng >> 1;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\ntemplate <class T, class F> T bin_search_double(T ok, T ng, const F &f, int iter = 80) {\\n while(iter--) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n\\nstruct Setup_io {\\n Setup_io() {\\n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\\n cout << fixed << setprecision(15);\\n }\\n} setup_io;\\n#pragma endregion\\n\\nint main() {\\n while(1) {\\n INT(n, m, r);\\n if(!n) exit(0);\\n VEC(int, a, n);\\n VEC(int, b, m);\\n rep(i, n) a[i]--;\\n rep(i, m) b[i]--;\\n\\n struct S {\\n vi v;\\n vvc<int> match;\\n S(vi a) : v(a) { match = vvc<int>(si(a) + 1, vi(si(a) + 1)); }\\n S() = default;\\n };\\n\\n vector<S> A, B;\\n rep(i, n) {\\n A.eb(a);\\n rotate(begin(a), begin(a) + 1, end(a));\\n }\\n rep(i, n) {\\n B.eb(b);\\n rotate(begin(b), begin(b) + 1, end(b));\\n }\\n\\n vector<pair<int, vi>> R;\\n rep(i, r) {\\n INT(k);\\n VEC(int, x, k);\\n rep(i, k) x[i]--;\\n INT(y);\\n y--;\\n R.eb(y, x);\\n }\\n\\n vv(int, DP, 30, 30);\\n auto calc = [&](S &s) {\\n auto &dp = s.match;\\n int n = si(s.v);\\n rep2(d, 1, n) {\\n rep(i, n) {\\n int j = i + d;\\n if(j > n) break;\\n if(d == 1) {\\n dp[i][j] = 1 << s.v[i];\\n continue;\\n }\\n for(auto &[y, x] : R) {\\n if(dp[i][j] >> y & 1) continue;\\n int k = si(x);\\n rep(i, d + 1) rep(j, k + 1) DP[i][j] = 0;\\n DP[0][0] = 1;\\n rep(ii, d) rep(jj, k) {\\n if(!DP[ii][jj]) continue;\\n rep2(to, ii + 1, d) {\\n int l = i + ii;\\n int r = i + to;\\n if(dp[l][r] >> x[jj] & 1) DP[to][jj + 1] = true;\\n }\\n }\\n if(DP[d][k]) dp[i][j] |= 1 << y;\\n }\\n }\\n }\\n };\\n each(e, A) calc(e);\\n each(e, B) calc(e);\\n\\n int ma = -1;\\n each(a, A) each(b, B) {\\n rep(i, n + 1) rep(j, m + 1) DP[i][j] = -inf<int>;\\n DP[0][0] = 0;\\n auto &x = a.match, &y = b.match;\\n rep(i, n) rep(j, m) {\\n if(DP[i][j] < 0) continue;\\n rep2(ii, i + 1, n) rep2(jj, j + 1, m) {\\n if(x[i][ii] & y[j][jj]) chmax(DP[ii][jj], DP[i][j] + 1);\\n }\\n }\\n chmax(ma, DP[n][m]);\\n }\\n OUT(ma);\\n }\\n}\",\n \"accuracy\": 0.5,\n \"time_ms\": 390,\n \"memory_kb\": 3720,\n \"score_of_the_acc\": -0.0401,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1191_6029063\",\n \"code_snippet\": \"//#pragma GCC optimize(\\\"O3\\\")\\n//#pragma GCC optimize(\\\"unroll-loops\\\")\\n#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<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<unordered_set>\\n#include<utility>\\n#include<cassert>\\n#include<complex>\\n#include<numeric>\\n#include<array>\\nusing namespace std;\\n\\n//#define int long long\\ntypedef long long ll;\\n\\ntypedef unsigned long long ul;\\ntypedef unsigned int ui;\\nconst ll mod = 1000000007;\\nconst ll INF = mod * mod;\\ntypedef pair<int, int>P;\\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 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++)\\n#define all(v) (v).begin(),(v).end()\\ntypedef pair<ll, ll> LP;\\ntypedef long double ld;\\ntypedef pair<ld, ld> LDP;\\nconst ld eps = 1e-8;\\nconst ld pi = acosl(-1.0);\\n\\nll mod_pow(ll x, ll n, ll m = mod) {\\n\\tif (n < 0) {\\n\\t\\tll res = mod_pow(x, -n, m);\\n\\t\\treturn mod_pow(res, m - 2, m);\\n\\t}\\n\\tif (abs(x) >= m)x %= m;\\n\\tif (x < 0)x += m;\\n\\tll res = 1;\\n\\twhile (n) {\\n\\t\\tif (n & 1)res = res * x % m;\\n\\t\\tx = x * x % m; n >>= 1;\\n\\t}\\n\\treturn res;\\n}\\nstruct modint {\\n\\tll n;\\n\\tmodint() :n(0) { ; }\\n\\tmodint(ll m) :n(m) {\\n\\t\\tif (n >= mod)n %= mod;\\n\\t\\telse if (n < 0)n = (n % mod + mod) % mod;\\n\\t}\\n\\toperator int() { return n; }\\n};\\nbool operator==(modint a, modint b) { return a.n == b.n; }\\nmodint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }\\nmodint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }\\nmodint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }\\nmodint operator+(modint a, modint b) { return a += b; }\\nmodint operator-(modint a, modint b) { return a -= b; }\\nmodint operator*(modint a, modint b) { return a *= b; }\\nmodint operator^(modint a, ll n) {\\n\\tif (n == 0)return modint(1);\\n\\tmodint res = (a * a) ^ (n / 2);\\n\\tif (n % 2)res = res * a;\\n\\treturn res;\\n}\\n\\nll inv(ll a, ll p) {\\n\\treturn (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);\\n}\\nmodint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\\nmodint operator/=(modint& a, modint b) { a = a / b; return a; }\\nconst int max_n = 1 << 20;\\nmodint fact[max_n], factinv[max_n];\\nvoid init_f() {\\n\\tfact[0] = modint(1);\\n\\tfor (int i = 0; i < max_n - 1; i++) {\\n\\t\\tfact[i + 1] = fact[i] * modint(i + 1);\\n\\t}\\n\\tfactinv[max_n - 1] = modint(1) / fact[max_n - 1];\\n\\tfor (int i = max_n - 2; i >= 0; i--) {\\n\\t\\tfactinv[i] = factinv[i + 1] * modint(i + 1);\\n\\t}\\n}\\nmodint comb(int a, int b) {\\n\\tif (a < 0 || b < 0 || a < b)return 0;\\n\\treturn fact[a] * factinv[b] * factinv[a - b];\\n}\\nmodint combP(int a, int b) {\\n\\tif (a < 0 || b < 0 || a < b)return 0;\\n\\treturn fact[a] * factinv[a - b];\\n}\\nint gcd(int a, int b) {\\n\\tif (a < b)swap(a, b);\\n\\twhile (b) {\\n\\t\\tint r = a % b; a = b; b = r;\\n\\t}\\n\\treturn a;\\n}\\n\\nconst int c = 31;\\nbool ok[55][55][c];\\nbool sub[55][11];\\nvector<vector<int>> mk[c];\\nvoid yaru(vector<int> a) {\\n\\tint n = a.size();\\n\\trep(i, n)Rep(j, i+1, n+1)rep(k, c)ok[i][j][k] = false;\\n\\trep(i, n)ok[i][i+1][a[i]] = true;\\n\\tfor (int len = 2; len <= n; len++) {\\n\\t\\trep(l, n - len + 1) {\\n\\t\\t\\tint r = l + len;\\n\\t\\t\\t//[l,r)\\n\\t\\t\\trep(col, c) {\\n\\t\\t\\t\\tfor (auto v : mk[col]) {\\n\\t\\t\\t\\t\\tRep1(i, l, r)rep(j, v.size()+1) {\\n\\t\\t\\t\\t\\t\\tsub[i][j] = false;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tsub[l][0] = true;\\n\\t\\t\\t\\t\\tRep(i, l, r) {\\n\\t\\t\\t\\t\\t\\trep(j, v.size())if (sub[i][j]) {\\n\\t\\t\\t\\t\\t\\t\\tfor (int ni = i + 1; ni <= r; ni++) {\\n\\t\\t\\t\\t\\t\\t\\t\\tif (ok[i][ni][v[j]]) {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tsub[ni][j + 1] = true;\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\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\\tif (sub[r][v.size()]) {\\n\\t\\t\\t\\t\\t\\tok[l][r][col] = true; break;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nbool oka[55][55][c];\\nbool okb[55][55][c];\\nint n, m, r;\\n\\nbool sok[55][55][55][55];\\nvoid solve() {\\n\\trep(i, c)mk[i].clear();\\n\\tvector<int> a(n);\\n\\trep(i, n)cin >> a[i]; rep(i, n)a.push_back(a[i]);\\n\\tvector<int> b(m);\\n\\trep(i, m)cin >> b[i]; rep(i, m)b.push_back(b[i]);\\n\\trep(i, r) {\\n\\t\\tint num; cin >> num;\\n\\t\\tvector<int> v(num);\\n\\t\\trep(j, num)cin >> v[j];\\n\\t\\tint alf; cin >> alf;\\n\\t\\tmk[alf].push_back(v);\\n\\t}\\n\\tyaru(a);\\n\\trep(i, a.size())Rep1(j, i + 1, a.size())rep(k, c) {\\n\\t\\toka[i][j][k] = ok[i][j][k];\\n\\t}\\n\\tyaru(b);\\n\\trep(i, b.size())Rep1(j, i + 1, b.size())rep(k, c) {\\n\\t\\tokb[i][j][k] = ok[i][j][k];\\n\\t}\\n\\trep(i, a.size())Rep(j, i + 1, a.size() + 1) {\\n\\t\\trep(k, b.size())Rep(l, k + 1, b.size() + 1) {\\n\\t\\t\\tsok[i][j][k][l] = false;\\n\\t\\t\\trep(col, c) {\\n\\t\\t\\t\\tif (oka[i][j][col] && okb[k][l][col]) {\\n\\t\\t\\t\\t\\tsok[i][j][k][l] = true; break;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint ans = -1;\\n\\trep(s, n)rep(t, m) {\\n\\t\\t//[s,s+n)\\n\\t\\t//[t,t+m)\\n\\t\\tvector<vector<int>> dp(n + 1, vector<int>(m + 1,-1));\\n\\t\\tdp[0][0] = 0;\\n\\t\\trep(i, n + 1)rep(j, m + 1) {\\n\\t\\t\\tif (dp[i][j] < 0)continue;\\n\\t\\t\\tfor (int ni = i + 1; ni <= n; ni++) {\\n\\t\\t\\t\\tfor (int nj = j + 1; nj <= m; nj++) {\\n\\t\\t\\t\\t\\tif (sok[s + i][s + ni][t + j][t + nj]) {\\n\\t\\t\\t\\t\\t\\tdp[ni][nj] = max(dp[ni][nj], dp[i][j] + 1);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tans = max(ans, dp[n][m]);\\n\\t}\\n\\tcout << ans << \\\"\\\\n\\\";\\n}\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\t//cout << fixed << setprecision(10);\\n\\t//init_f();\\n\\t//init();\\n\\t//int t; cin >> t; rep(i, t)\\n\\twhile (cin>>n>>m>>r,n)\\n\\t\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 510,\n \"memory_kb\": 28656,\n \"score_of_the_acc\": -1.0403,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1191_5821073\",\n \"code_snippet\": \"/*\\tauthor: Kite_kuma\\n\\tcreated: 2021.08.25 09:49:47 */\\n\\n// #ifdef LOCAL\\n#define _GLIBCXX_DEBUG\\n// #endif\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#pragma region macros\\n\\n#define foa(s, v) for(auto &s : v)\\n#define all(v) (v).begin(), (v).end()\\n#define rall(v) (v).rbegin(), (v).rend()\\n#define popcnt(n) __builtin_popcountll((long long)n)\\n\\n#define REPname(a, b, c, d, e, ...) e\\n#define rep(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\\n#define REP0(x) for(int Counter_in_rep_macro = 0; Counter_in_rep_macro < (x); ++Counter_in_rep_macro)\\n#define REP1(i, x) for(int i = 0; i < (x); ++i)\\n#define REP2(i, l, r) for(int i = (l); i < (r); ++i)\\n#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))\\n\\n#define DREPname(a, b, c, d, e, ...) e\\n#define drep(...) DREPname(__VA_ARGS__, DREP3, DREP2, DREP1)(__VA_ARGS__)\\n#define DREP1(i, x) for(int i = (x)-1; i >= 0; --i)\\n#define DREP2(i, l, r) for(int i = (r)-1; i >= (l); --i)\\n#define DREP3(i, l, r, c) for(int i = (r)-1; i >= (l); i -= (c))\\n\\n#pragma endregion\\n\\n#pragma region aliases\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\nusing vi = std::vector<int>;\\nusing vvi = std::vector<std::vector<int>>;\\nusing vvvi = std::vector<std::vector<std::vector<int>>>;\\nusing vll = std::vector<ll>;\\nusing vvll = std::vector<vll>;\\nusing vvvll = std::vector<vvll>;\\nusing pii = std::pair<int, int>;\\nusing pll = std::pair<long long, long long>;\\ntemplate <class T = ll>\\nusing V = std::vector<T>;\\ntemplate <class T = ll>\\nusing VV = V<V<T>>;\\ntemplate <class T = ll>\\nusing VVV = V<V<V<T>>>;\\ntemplate <class T = ll>\\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\\ntemplate <class T = ll>\\nusing pqdn = std::priority_queue<T>;\\n\\n#pragma endregion\\n\\n#pragma region constants\\n\\nconst int inf = 1e9;\\nconst long long INF = 1e18;\\nconst long double pi = acos(-1);\\nconst char dl = '\\\\n';\\nconst char sp = ' ';\\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\\n\\nconst int mod_1000000007 = 1000000007;\\nconst int mod_998244353 = 998244353;\\n\\n#pragma endregion\\n\\n#pragma region basic_operation\\n\\ntemplate <class T0, class T1, class T2>\\ninline bool in_range(T0 x, T1 lef, T2 rig) {\\n\\treturn ((lef <= x) && (x < rig));\\n}\\n\\ntemplate <class T>\\ninline bool chmin(T &a, T b) {\\n\\tif(a > b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\ntemplate <class T>\\ninline bool chmax(T &a, T b) {\\n\\tif(a < b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\n\\nvoid Yes(bool f = 1) { std::cout << (f ? \\\"Yes\\\" : \\\"No\\\") << '\\\\n'; }\\nvoid No() { std::cout << \\\"No\\\\n\\\"; }\\nvoid YES(bool f = 1) { std::cout << (f ? \\\"YES\\\" : \\\"NO\\\") << '\\\\n'; }\\nvoid NO() { std::cout << \\\"NO\\\\n\\\"; }\\n\\ntemplate <class T>\\nvoid drop(T answer) {\\n\\tstd::cout << answer << '\\\\n';\\n\\texit(0);\\n}\\n\\nvoid err(bool flag = true) {\\n\\tif(!flag) return;\\n\\tstd::cout << -1 << '\\\\n';\\n\\texit(0);\\n}\\n\\ntemplate <class T>\\nvoid vout(std::vector<T> const &v, bool vertically = 0) {\\n\\tif(vertically) {\\n\\t\\tfor(auto const &a : v) {\\n\\t\\t\\tstd::cout << a << '\\\\n';\\n\\t\\t}\\n\\t\\treturn;\\n\\t}\\n\\tfor(auto it = v.begin(); it != v.end(); it++) {\\n\\t\\tstd::cout << (*it);\\n\\t\\tif(it != v.end() - 1) {\\n\\t\\t\\tstd::cout << ' ';\\n\\t\\t}\\n\\t}\\n\\tstd::cout << '\\\\n';\\n\\treturn;\\n}\\n\\ninline void print() { std::cout << '\\\\n'; }\\ntemplate <class T>\\ninline void print(T x) {\\n\\tstd::cout << x << '\\\\n';\\n\\treturn;\\n}\\ntemplate <typename Head, typename... Tail>\\nvoid print(Head H, Tail... T) {\\n\\tstd::cout << H << \\\" \\\";\\n\\tprint(T...);\\n}\\n\\ntemplate <class T>\\nvoid add(std::vector<T> &v, T val) {\\n\\tfor(auto &a : v) a += val;\\n\\treturn;\\n}\\n\\ntemplate <class T>\\nT dup(T a, T b) {\\n\\tassert(b != 0);\\n\\treturn (a + b - 1) / b;\\n}\\n\\ntemplate <class T>\\nT greatest_lower_multiple(T x, T d) {\\n\\tif(d == 0) return 0;\\n\\tif(d < 0) d *= -1;\\n\\tT y = x % d;\\n\\tif(y < 0) y += d;\\n\\treturn x - y;\\n}\\n\\ntemplate <class T>\\nT least_upper_multiple(T x, T d) {\\n\\treturn -greatest_lower_multiple(-x, d);\\n}\\n\\nlong long POW(long long a, long long n) {\\n\\tlong long res = 1;\\n\\twhile(n > 0) {\\n\\t\\tif(n & 1) res = res * a;\\n\\t\\ta = a * a;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn res;\\n}\\n\\nlong long modpow(long long a, long long n, long long mod) {\\t // a^n mod\\n\\tassert(n >= 0 && mod);\\n\\tif(mod == 1) return 0LL;\\n\\tlong long res = 1;\\n\\ta %= mod;\\n\\twhile(n > 0) {\\n\\t\\tif(n & 1) res = res * a % mod;\\n\\t\\ta = a * a % mod;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn res < 0 ? res + mod : res;\\n}\\n\\n// return x which satisfies a * x % mod == gcd(a, mod)\\n// not (mod | a)\\nlong long modinv(long long a, long long mod) {\\n\\tlong long b = mod, u = 1, v = 0;\\n\\twhile(b) {\\n\\t\\tlong long t = a / b;\\n\\t\\ta -= t * b;\\n\\t\\tstd::swap(a, b);\\n\\t\\tu -= t * v;\\n\\t\\tstd::swap(u, v);\\n\\t}\\n\\tu %= mod;\\n\\tif(u < 0) u += mod;\\n\\treturn u;\\n}\\n\\ntemplate <class T>\\nint lb(const std::vector<T> &a, const T x) {\\n\\treturn std::distance(a.begin(), std::lower_bound(a.begin(), a.end(), x));\\n}\\ntemplate <class T>\\nint ub(const std::vector<T> &a, const T x) {\\n\\treturn std::distance(a.begin(), std::upper_bound(a.begin(), a.end(), x));\\n}\\ntemplate <class T>\\nvoid unq_sort(std::vector<T> &a) {\\n\\tstd::sort(a.begin(), a.end());\\n\\ta.erase(std::unique(a.begin(), a.end()), a.end());\\n}\\ntemplate <class T>\\nstd::vector<int> press(std::vector<T> &a) {\\n\\tauto vec = a;\\n\\tunq_sort(vec);\\n\\tstd::vector<int> ret;\\n\\tfor(auto &v : a) ret.push_back(lb(vec, v));\\n\\treturn ret;\\n}\\n\\n#pragma endregion\\n\\n#pragma region input\\n#define VEC(type, name, size) \\\\\\n\\tvector<type> name(size); \\\\\\n\\tscanner::INPUT(name)\\n#define VVEC(type, name, h, w) \\\\\\n\\tvector<vector<type>> name(h, vector<type>(w)); \\\\\\n\\tscanner::INPUT(name)\\n#define INT(...) \\\\\\n\\tint __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define LL(...) \\\\\\n\\tlong long __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define STR(...) \\\\\\n\\tstring __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define CHR(...) \\\\\\n\\tchar __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define DBL(...) \\\\\\n\\tdouble __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define LD(...) \\\\\\n\\tlong double __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define TPL3(type0, type1, type2, name) \\\\\\n\\tstd::tuple<type0, type1, type2> name; \\\\\\n\\tscanner::INPUT(name);\\n#define TPL4(type0, type1, type2, type3, name) \\\\\\n\\tstd::tuple<type0, type1, type2, type3> name; \\\\\\n\\tscanner::INPUT(name);\\n\\nnamespace scanner {\\ntemplate <class T>\\nvoid scan(T &a) {\\n\\tstd::cin >> a;\\n}\\n\\ntemplate <class T, class L>\\nvoid scan(std::pair<T, L> &p) {\\n\\tscan(p.first);\\n\\tscan(p.second);\\n}\\n\\ntemplate <class T0, class T1, class T2>\\nvoid scan(std::tuple<T0, T1, T2> &p) {\\n\\tT0 t0;\\n\\tT1 t1;\\n\\tT2 t2;\\n\\tscan(t0);\\n\\tscan(t1);\\n\\tscan(t2);\\n\\tp = std::make_tuple(t0, t1, t2);\\n}\\n\\ntemplate <class T0, class T1, class T2, class T3>\\nvoid scan(std::tuple<T0, T1, T2, T3> &p) {\\n\\tT0 t0;\\n\\tT1 t1;\\n\\tT2 t2;\\n\\tT3 t3;\\n\\tscan(t0);\\n\\tscan(t1);\\n\\tscan(t2);\\n\\tscan(t3);\\n\\tp = std::make_tuple(t0, t1, t2, t3);\\n}\\n\\ntemplate <class T>\\nvoid scan(std::vector<T> &a) {\\n\\tfor(auto &i : a) scan(i);\\n}\\n\\nvoid INPUT() {}\\ntemplate <class Head, class... Tail>\\nvoid INPUT(Head &head, Tail &... tail) {\\n\\tscan(head);\\n\\tINPUT(tail...);\\n}\\n} // namespace scanner\\n\\ntemplate <typename T1, typename T2>\\nstd::istream &operator>>(std::istream &is, std::pair<T1, T2> &p) {\\n\\tis >> p.first >> p.second;\\n\\treturn is;\\n}\\n#pragma endregion\\n\\n#pragma region debug\\n\\n#pragma region output\\ntemplate <typename T1, typename T2>\\nstd::ostream &std::operator<<(std::ostream &os, const std::pair<T1, T2> &p) {\\n\\tos << p.first << \\\" \\\" << p.second;\\n\\treturn os;\\n}\\ntemplate <class T>\\nstd::ostream &std::operator<<(std::ostream &os, const std::vector<T> &v) {\\n\\tfor(int i = 0; i < (int)v.size(); i++) {\\n\\t\\tif(i) os << \\\" \\\";\\n\\t\\tos << v[i];\\n\\t}\\n\\treturn os;\\n}\\n#pragma endregion\\n\\n#pragma region view\\n\\nnamespace viewer {\\nvoid view(const long long e) {\\n\\tif(e == INF)\\n\\t\\tstd::cerr << \\\"INF\\\";\\n\\telse if(e == -INF)\\n\\t\\tstd::cerr << \\\"-INF\\\";\\n\\telse\\n\\t\\tstd::cerr << e;\\n}\\n\\nvoid view(const int e) {\\n\\tif(e == inf)\\n\\t\\tstd::cerr << \\\"inf\\\";\\n\\telse if(e == -inf)\\n\\t\\tstd::cerr << \\\"-inf\\\";\\n\\telse\\n\\t\\tstd::cerr << e;\\n}\\n\\ntemplate <typename T>\\nvoid view(const T e) {\\n\\tstd::cerr << e;\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::pair<T, U> &p) {\\n\\tstd::cerr << \\\"(\\\";\\n\\tview(p.first);\\n\\tstd::cerr << \\\", \\\";\\n\\tview(p.second);\\n\\tstd::cerr << \\\")\\\";\\n}\\n\\ntemplate <class T0, class T1, class T2>\\nvoid view(const std::tuple<T0, T1, T2> &p) {\\n\\tstd::cerr << \\\"(\\\";\\n\\tview(std::get<0>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<1>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<2>(p));\\n\\tstd::cerr << \\\")\\\";\\n}\\n\\ntemplate <class T0, class T1, class T2, class T3>\\nvoid view(const std::tuple<T0, T1, T2, T3> &p) {\\n\\tstd::cerr << \\\"(\\\";\\n\\tview(std::get<0>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<1>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<2>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<3>(p));\\n\\tstd::cerr << \\\")\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::set<T> &s) {\\n\\tif(s.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(auto &t : s) {\\n\\t\\tview(t);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::unordered_set<T> &s) {\\n\\tif(s.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(auto &t : s) {\\n\\t\\tview(t);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::vector<T> &v) {\\n\\tif(v.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(const auto &e : v) {\\n\\t\\tview(e);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::vector<std::vector<T>> &vv) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &v : vv) {\\n\\t\\tstd::cerr << \\\"\\\\t\\\";\\n\\t\\tview(v);\\n\\t\\tstd::cerr << '\\\\n';\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::vector<std::pair<T, U>> &v) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &c : v) {\\n\\t\\tstd::cerr << \\\"\\\\t(\\\";\\n\\t\\tview(c.first);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t\\tview(c.second);\\n\\t\\tstd::cerr << \\\")\\\\n\\\";\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <class T0, class T1, class T2>\\nvoid view(const std::vector<std::tuple<T0, T1, T2>> &v) {\\n\\tif(v.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << '{';\\n\\tfor(const auto &t : v) {\\n\\t\\tstd::cerr << \\\"\\\\n\\\\t\\\";\\n\\t\\tview(t);\\n\\t\\tstd::cerr << \\\",\\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\n}\\\";\\n}\\n\\ntemplate <class T0, class T1, class T2, class T3>\\nvoid view(const std::vector<std::tuple<T0, T1, T2, T3>> &v) {\\n\\tif(v.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << '{';\\n\\tfor(const auto &t : v) {\\n\\t\\tstd::cerr << \\\"\\\\n\\\\t\\\";\\n\\t\\tview(t);\\n\\t\\tstd::cerr << \\\",\\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\n}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::map<T, U> &m) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &t : m) {\\n\\t\\tstd::cerr << \\\"\\\\t[\\\";\\n\\t\\tview(t.first);\\n\\t\\tstd::cerr << \\\"] : \\\";\\n\\t\\tview(t.second);\\n\\t\\tstd::cerr << '\\\\n';\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::unordered_map<T, U> &m) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &t : m) {\\n\\t\\tstd::cerr << \\\"\\\\t[\\\";\\n\\t\\tview(t.first);\\n\\t\\tstd::cerr << \\\"] : \\\";\\n\\t\\tview(t.second);\\n\\t\\tstd::cerr << '\\\\n';\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n} // namespace viewer\\n\\n#pragma endregion\\n\\n// when debugging : g++ foo.cpp -DLOCAL\\n#ifdef LOCAL\\nvoid debug_out() {}\\ntemplate <typename Head, typename... Tail>\\nvoid debug_out(Head H, Tail... T) {\\n\\tviewer::view(H);\\n\\tstd::cerr << \\\", \\\";\\n\\tdebug_out(T...);\\n}\\n#define debug(...) \\\\\\n\\tdo { \\\\\\n\\t\\tstd::cerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"] : [\\\"; \\\\\\n\\t\\tdebug_out(__VA_ARGS__); \\\\\\n\\t\\tstd::cerr << \\\"\\\\b\\\\b]\\\\n\\\"; \\\\\\n\\t} while(0)\\n#define dump(x) \\\\\\n\\tdo { \\\\\\n\\t\\tstd::cerr << __LINE__ << \\\" \\\" << #x << \\\" : \\\"; \\\\\\n\\t\\tviewer::view(x); \\\\\\n\\t\\tstd::cerr << '\\\\n'; \\\\\\n\\t} while(0)\\n\\n#else\\n#define debug(...) (void(0))\\n#define dump(x) (void(0))\\n#endif\\n\\n#pragma endregion\\n\\nvvvi make_dp_table(vector<int> a, vector<vi> x, vector<int> y) {\\n\\tint n = a.size();\\n\\tint n2 = n + n;\\n\\tint r = x.size();\\n\\trep(i, n) a.push_back(a[i]);\\n\\tVV<VV<int>> dp_rule(n, vvvi(n2, vvi(r, vi(11))));\\n\\n\\tvvvi ret(n, vvi(n2, vi(31)));\\n\\n\\trep(len, 0, n + 1) {\\n\\t\\trep(left, n) {\\n\\t\\t\\tint right = left + len;\\n\\t\\t\\trep(rule_number, r) {\\n\\t\\t\\t\\trep(xr, 0, x[rule_number].size() + 1) {\\n\\t\\t\\t\\t\\t// dp_rule[left][right][rulenumber][xr]\\n\\t\\t\\t\\t\\tauto &change = dp_rule[left][right][rule_number][xr];\\n\\n\\t\\t\\t\\t\\tif(len == 0) {\\n\\t\\t\\t\\t\\t\\tchange = (xr == 0);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tif(!xr) continue;\\n\\t\\t\\t\\t\\t\\tif(len == 1) {\\n\\t\\t\\t\\t\\t\\t\\tif(a[left] == x[rule_number][0] && xr == 1) {\\n\\t\\t\\t\\t\\t\\t\\t\\tchange = 1;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\t\\trep(mid, left + 1, right) {\\n\\t\\t\\t\\t\\t\\t\\t\\tint m = mid;\\n\\t\\t\\t\\t\\t\\t\\t\\tint R = right;\\n\\t\\t\\t\\t\\t\\t\\t\\tif(m >= n) {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tm -= n;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tR -= n;\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\tchange |= (dp_rule[left][mid][rule_number][xr - 1] && ret[m][R][x[rule_number][xr - 1]]);\\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}\\n\\t\\t\\t}\\n\\n\\t\\t\\tauto &change = ret[left][right];\\n\\t\\t\\tif(len == 1) {\\n\\t\\t\\t\\tchange[a[left]] = 1;\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\n\\t\\t\\trep(rule_number, r) {\\n\\t\\t\\t\\tif(dp_rule[left][right][rule_number][x[rule_number].size()]) {\\n\\t\\t\\t\\t\\tchange[y[rule_number]] = 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\trep(rule_number, r){\\n\\t\\t\\t\\trep(number, 31){\\n\\t\\t\\t\\t\\tif(x[rule_number][0] == number && change[number]){\\n\\t\\t\\t\\t\\t\\tdp_rule[left][right][rule_number][1] = 1;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn ret;\\n}\\n\\nint solve(int n) {\\n\\tint m, r;\\n\\tcin >> m >> r;\\n\\n\\tvector<int> a, b;\\n\\trep(n) {\\n\\t\\tINT(x);\\n\\t\\ta.push_back(x);\\n\\t}\\n\\trep(m) {\\n\\t\\tINT(x);\\n\\t\\tb.push_back(x);\\n\\t}\\n\\n\\t// vector<pair<vector<int>, int>> rules;\\n\\tvvi x(r);\\n\\tvi y(r);\\n\\trep(i, r) {\\n\\t\\tint len;\\n\\t\\tcin >> len;\\n\\t\\tx[i].resize(len);\\n\\t\\trep(j, len) cin >> x[i][j];\\n\\t\\tcin >> y[i];\\n\\t}\\n\\n\\tdebug(x, y);\\n\\n\\tauto dp_a = make_dp_table(a, x, y);\\n\\tauto dp_b = make_dp_table(b, x, y);\\n\\n\\n\\trep(i, n) a.push_back(a[i]);\\n\\trep(i, m) b.push_back(b[i]);\\n\\n\\tint n2 = n + n;\\n\\tint m2 = m + m;\\n\\n\\tvvi longest_path(n2, vi(m2));\\n\\n\\tVV<VV<int>> match(n, vvvi(n2, vvi(m, vi(m2))));\\n\\n\\trep(i, n) rep(j, i + 1, n2) rep(k, m) rep(l, k + 1, m2) {\\n\\t\\trep(num, 31) {\\n\\t\\t\\tif(dp_a[i][j][num] && dp_b[k][l][num]) {\\n\\t\\t\\t\\tmatch[i][j][k][l] = 1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tint ans = -1;\\n\\n\\trep(start_a, n) rep(start_b, m) {\\n\\t\\tint goal_a = start_a + n;\\n\\t\\tint goal_b = start_b + m;\\n\\n\\t\\tvvi dp(n + 1, vi(m + 1, -inf));\\n\\t\\tdp[0][0] = 0;\\n\\n\\t\\trep(i, start_a + 1, goal_a + 1) rep(j, start_b + 1, goal_b + 1) {\\n\\t\\t\\trep(pre_i, start_a, i) rep(pre_j, start_b, j) {\\n\\t\\t\\t\\tint c, d, e, f;\\n\\t\\t\\t\\tif(pre_i >= n) {\\n\\t\\t\\t\\t\\tc = pre_i - n;\\n\\t\\t\\t\\t\\td = i - n;\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tc = pre_i;\\n\\t\\t\\t\\t\\td = i;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(pre_j >= m) {\\n\\t\\t\\t\\t\\te = pre_j - m;\\n\\t\\t\\t\\t\\tf = j - m;\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\te = pre_j;\\n\\t\\t\\t\\t\\tf = j;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(match[c][d][e][f]) {\\n\\t\\t\\t\\t\\tchmax(dp[i - start_a][j - start_b], dp[pre_i - start_a][pre_j - start_b] + 1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tchmax(ans, dp[n][m]);\\n\\t}\\n\\n\\treturn ans;\\n}\\n\\nint main() {\\n\\tstd::ios::sync_with_stdio(false);\\n\\tstd::cin.tie(nullptr);\\n\\tstd::cout << std::fixed << std::setprecision(15);\\n\\tsrand((unsigned)time(NULL));\\n\\n\\tint n;\\n\\twhile(cin >> n) {\\n\\t\\tif(!n) exit(0);\\n\\t\\tcout << solve(n) << dl;\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2860,\n \"memory_kb\": 12612,\n \"score_of_the_acc\": -0.7465,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1191_3709978\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate<typename T>\\nstd::vector<T> table(int n, T v) { return std::vector<T>(n, v); }\\n\\ntemplate <class... Args>\\nauto table(int n, Args... args) {\\n auto val = table(args...);\\n return std::vector<decltype(val)>(n, std::move(val));\\n}\\n\\nconstexpr int max_a = 30;\\nconstexpr int max_k = 10;\\n\\nauto calc_can_make(vector<int> const& a, vector<vector<int>> const& xs, vector<int> const& ys) {\\n const int n = a.size() / 2, r_sz = xs.size();\\n auto can_make = table(a.size(), a.size(), max_a + 1, false);\\n // r_dp[i][j][k][l] := can match a[i..j) with xs[k][0..l) ?\\n auto r_dp = table(a.size(), a.size(), r_sz, max_k + 1, false);\\n for(int i = 0; i + 1 < n * 2; ++i) {\\n can_make[i][i + 1][a[i]] = true;\\n }\\n for(int i = 0; i < n; ++i) {\\n for(int j = 0; j < r_sz; ++j) {\\n r_dp[i][i][j][0] = true;\\n }\\n }\\n for(int len = 1; len <= n; ++len) {\\n for(int l = 0; l + len < 2 * n; ++l) {\\n const int r = l + len;\\n for(int i = 0; i < r_sz; ++i) {\\n for(int j = 1; j <= (int)xs[i].size(); ++j) {\\n for(int k = l; k < r; ++k) {\\n r_dp[l][r][i][j] = r_dp[l][r][i][j] | (r_dp[l][k][i][j - 1] && can_make[k][r][xs[i][j - 1]]);\\n }\\n }\\n }\\n for(int i = 0; i < r_sz; ++i) {\\n if(r_dp[l][r][i][xs[i].size()]) {\\n can_make[l][r][ys[i]] = true;\\n }\\n }\\n for(int i = 0; i < r_sz; ++i) {\\n if(can_make[l][r][xs[i][0]]) {\\n r_dp[l][r][i][1] = true;\\n }\\n }\\n }\\n }\\n return can_make;\\n}\\n\\nint main() {\\n int n, m, r;\\n while(cin >> n >> m >> r, n) {\\n vector<int> a(n * 2), b(m * 2);\\n vector<vector<int>> xs(r);\\n vector<int> ys(r);\\n for(int i = 0; i < n; ++i) {\\n cin >> a[i];\\n a[i + n] = a[i];\\n }\\n for(int i = 0; i < m; ++i) {\\n cin >> b[i];\\n b[i + m] = b[i];\\n }\\n for(int i = 0; i < r; ++i) {\\n int k; cin >> k;\\n xs[i].resize(k);\\n for(auto& x : xs[i]) cin >> x;\\n cin >> ys[i];\\n }\\n\\n auto can_make_a = calc_can_make(a, xs, ys);\\n auto can_make_b = calc_can_make(b, xs, ys);\\n int ans = -1;\\n for(int s1 = 0; s1 < n; ++s1) {\\n for(int s2 = 0; s2 < m; ++s2) {\\n vector<vector<int>> dp(n + 1, vector<int>(m + 1, -1));\\n dp[0][0] = 0;\\n for(int i = 0; i < n; ++i) {\\n for(int j = 0; j < m; ++j) {\\n if(dp[i][j] == -1) continue;\\n for(int k = 1; k <= 30; ++k) {\\n for(int l1 = 1; l1 <= n - i; ++l1) {\\n if(!can_make_a[s1 + i][s1 + i + l1][k]) continue;\\n for(int l2 = 1; l2 <= m - j; ++l2) {\\n if(can_make_a[s1 + i][s1 + i + l1][k] && can_make_b[s2 + j][s2 + j + l2][k]) {\\n dp[i + l1][j + l2] = max(dp[i + l1][j + l2], dp[i][j] + 1);\\n }\\n }\\n }\\n }\\n }\\n }\\n ans = max(ans, dp[n][m]);\\n }\\n }\\n\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1920,\n \"memory_kb\": 14220,\n \"score_of_the_acc\": -0.6745,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1191_3672228\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nclass Solve {\\nprivate:\\n\\tusing vi = std::vector<int>;\\n\\tusing vvi = std::vector<vi>;\\n\\tusing vvvi = std::vector<vvi>;\\n\\tusing vvvvi = std::vector<vvvi>;\\n\\n\\tusing vb = std::vector<bool>;\\n\\tusing vvb = std::vector<vb>;\\n\\tusing vvvb = std::vector<vvb>;\\n\\n\\tint n, m, r;\\n\\tvvvi R;\\n\\n\\tvi inputVector(int size)\\n\\t{\\n\\t\\tstd::vector<int> ret(size);\\n\\t\\tfor (auto& e: ret)\\n\\t\\t{\\n\\t\\t\\tscanf(\\\"%d\\\", &e);\\n\\t\\t\\te--;\\n\\t\\t}\\n\\t\\treturn std::move(ret);\\n\\t}\\n\\tvoid inputR()\\n\\t{\\n\\t\\tR.resize(30);\\n\\t\\tfor (int i{}; i < r; i++)\\n\\t\\t{\\n\\t\\t\\tint k;\\n\\t\\t\\tscanf(\\\"%d\\\", &k);\\n\\t\\t\\tstd::vector<int> tmp(k);\\n\\t\\t\\tfor (auto& e: tmp)\\n\\t\\t\\t{\\n\\t\\t\\t\\tscanf(\\\"%d\\\", &e);\\n\\t\\t\\t\\te--;\\n\\t\\t\\t}\\n\\t\\t\\tint y;\\n\\t\\t\\tscanf(\\\"%d\\\", &y);\\n\\t\\t\\ty--;\\n\\t\\t\\tR[y].push_back(tmp);\\n\\t\\t}\\n\\t}\\n\\n\\tvoid execute(vi& arr, vvvi& charTable, vvvb& canMake)\\n\\t{\\n\\t\\tint size{(int)arr.size()};\\n\\t\\tfor (int i{}; i < size; i++)\\n\\t\\t{\\n\\t\\t\\tcharTable[i][arr[i]].push_back((i + 1) % size);\\n\\t\\t\\tcanMake[i][(i + 1) % size][arr[i]] = true;\\n\\t\\t}\\n\\t\\tfor (int width{2}; width <= size; width++)\\n\\t\\t\\tfor (int left{}; left < size; left++)\\n\\t\\t\\t\\tfor (int char_i{}; char_i < 30; char_i++)\\n\\t\\t\\t\\t\\tfor (auto& e: R[char_i])\\n\\t\\t\\t\\t\\t\\tif (e.size() <= width && stringFound(e, 0, left, width, charTable, canMake))\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tcharTable[left][char_i].push_back((left + width) % size);\\n\\t\\t\\t\\t\\t\\t\\tcanMake[left][(left + width) % size][char_i] = true;\\n\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t}\\n\\t}\\n\\n\\tbool stringFound(vi& arr, int arr_i, int left, int width, vvvi& charTable, vvvb& canMake)\\n\\t{\\n\\t\\tint char_i{arr[arr_i]}, size{(int)charTable.size()};\\n\\t\\tif (arr_i + 1 == (int)arr.size())\\n\\t\\t\\treturn canMake[left][(left + width) % size][char_i];\\n\\t\\tfor (auto& e: charTable[left][char_i])\\n\\t\\t{\\n\\t\\t\\tint next_width{e};\\n\\t\\t\\tif (e <= left) next_width += size;\\n\\t\\t\\tnext_width -= left;\\n\\t\\t\\tif ((int)arr.size() - (arr_i + 1) > width - next_width) break;\\n\\t\\t\\tif (stringFound(arr, arr_i + 1, e, width - next_width, charTable, canMake))\\n\\t\\t\\t\\treturn true;\\n\\t\\t}\\n\\t\\treturn false;\\n\\t}\\n\\npublic:\\n\\tbool is_last_query{};\\n\\tSolve()\\n\\t{\\n\\t\\tscanf(\\\"%d%d%d\\\", &n, &m, &r);\\n\\t\\tif (n == 0)\\n\\t\\t{\\n\\t\\t\\tis_last_query = true;\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tvi A(inputVector(n)), B(inputVector(m));\\n\\t\\tinputR();\\n\\t\\tvvvb canMakeA(n, vvb(n, vb(30))), canMakeB(m, vvb(m, vb(30)));\\n\\t\\tvvvi charTableA(n, vvi(30)), charTableB(m, vvi(30));\\n\\t\\texecute(A, charTableA, canMakeA);\\n\\t\\texecute(B, charTableB, canMakeB);\\n\\t\\tvvvvi dp(n, vvvi(n, vvi(m, vi(m))));\\n\\t\\tfor (int la{}; la < n; la++)\\n\\t\\t\\tfor (int lb{}; lb < m; lb++)\\n\\t\\t\\t\\tfor (int ra{}; ra < n; ra++)\\n\\t\\t\\t\\t\\tfor (int rb{}; rb < m; rb++)\\n\\t\\t\\t\\t\\t\\tfor (int char_i{}; char_i < 30; char_i++)\\n\\t\\t\\t\\t\\t\\t\\tif (canMakeA[la][ra][char_i] && canMakeB[lb][rb][char_i])\\n\\t\\t\\t\\t\\t\\t\\t\\tdp[la][ra][lb][rb] = 1;\\n\\t\\tfor (int wa{2}; wa <= n; wa++)\\n\\t\\t\\tfor (int wb{2}; wb <= m; wb++)\\n\\t\\t\\t\\tfor (int la{}; la < n; la++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tint ra{(la + wa) % n};\\n\\t\\t\\t\\t\\tfor (int lb{}; lb < m; lb++)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tint rb{(lb + wb) % m};\\n\\t\\t\\t\\t\\t\\tfor (int ma{(la + 1) % n}; ma != ra; ma = (ma + 1) % n)\\n\\t\\t\\t\\t\\t\\t\\tfor (int mb{(lb + 1) % m}; mb != rb; mb = (mb + 1) % m)\\n\\t\\t\\t\\t\\t\\t\\t\\tif (dp[la][ma][lb][mb] > 0 && dp[ma][ra][mb][rb] > 0)\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tdp[la][ra][lb][rb] = std::max(dp[la][ra][lb][rb], dp[la][ma][lb][mb] + dp[ma][ra][mb][rb]);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\tint max{};\\n\\n\\t\\tfor (int la{}; la < n; la++)\\n\\t\\t\\tfor (int lb{}; lb < m; lb++)\\n\\t\\t\\t\\tmax = std::max(max, dp[la][la][lb][lb]);\\n\\t\\tif (max == 0) puts(\\\"-1\\\");\\n\\t\\telse printf(\\\"%d\\\\n\\\", max);\\n\\t}\\n};\\n\\nint main()\\n{\\n\\twhile (!Solve().is_last_query);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2660,\n \"memory_kb\": 5452,\n \"score_of_the_acc\": -0.4354,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1191_3215735\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 99999999999999999\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define NUM 60\\n\\nenum Type{\\n\\tA,\\n\\tB,\\n};\\n\\nint len[2],num_rule;\\nint table[2][NUM];\\nint num_left[NUM],from_table[NUM][10],to_table[NUM];\\nint max_match[NUM][NUM];\\nbool dp[2][NUM][NUM][30];\\nbool dp2[2][NUM][NUM][NUM][11];\\n\\nvoid make_dp(Type type){\\n\\n\\tint calc_len = 2*len[type]-1;\\n\\n\\tfor(int left = 0; left < calc_len; left++){\\n\\t\\tfor(int right = left; right < calc_len; right++){\\n\\n\\t\\t\\tfor(int num = 0; num < 30; num++){\\n\\t\\t\\t\\tdp[type][left][right][num] = false;\\n\\t\\t\\t}\\n\\n\\t\\t\\tfor(int i = 0; i < num_rule; i++){\\n\\t\\t\\t\\tfor(int k = 0; k <= num_left[i]; k++){\\n\\t\\t\\t\\t\\tdp2[type][left][right][i][k] = false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < calc_len; i++){\\n\\t\\tdp[type][i][i][table[type][i]] = true;\\n\\t}\\n\\n\\tint right;\\n\\n\\tfor(int length = 1; length <= len[type]; length++){\\n\\t\\tfor(int left = 0; left+length <= calc_len; left++){\\n\\n\\t\\t\\tright = left+length-1;\\n\\n\\t\\t\\tfor(int i = 0; i < num_rule; i++){\\n\\t\\t\\t\\tfor(int k = 0; k < num_left[i]; k++){\\n\\t\\t\\t\\t\\tfor(int mid = left; mid < right; mid++){\\n\\n\\t\\t\\t\\t\\t\\tif(dp2[type][left][mid][i][k] == true && dp[type][mid+1][right][from_table[i][k]] == true){\\n\\t\\t\\t\\t\\t\\t\\tdp2[type][left][right][i][k+1] = true;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tfor(int i = 0; i < num_rule; i++){\\n\\t\\t\\t\\tif(dp2[type][left][right][i][num_left[i]]){\\n\\t\\t\\t\\t\\tdp[type][left][right][to_table[i]] = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tfor(int i = 0; i < num_rule; i++){\\n\\t\\t\\t\\tif(dp[type][left][right][from_table[i][0]]){\\n\\t\\t\\t\\t\\tdp2[type][left][right][i][1] = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nvoid func(){\\n\\n\\tfor(int i = 0; i < len[A]; i++){\\n\\n\\t\\tscanf(\\\"%d\\\",&table[A][i]);\\n\\t\\ttable[A][i]--;\\n\\t\\ttable[A][i+len[A]] = table[A][i];\\n\\t}\\n\\n\\tfor(int i = 0; i < len[B]; i++){\\n\\n\\t\\tscanf(\\\"%d\\\",&table[B][i]);\\n\\t\\ttable[B][i]--;\\n\\t\\ttable[B][i+len[B]] = table[B][i];\\n\\t}\\n\\n\\tfor(int i = 0; i < num_rule; i++){\\n\\n\\t\\tscanf(\\\"%d\\\",&num_left[i]);\\n\\n\\t\\tfor(int k = 0; k < num_left[i]; k++){\\n\\t\\t\\tscanf(\\\"%d\\\",&from_table[i][k]);\\n\\t\\t\\tfrom_table[i][k]--;\\n\\t\\t}\\n\\t\\tscanf(\\\"%d\\\",&to_table[i]);\\n\\t\\tto_table[i]--;\\n\\t}\\n\\n\\tmake_dp(A);\\n\\tmake_dp(B);\\n\\n\\tint ans = -1;\\n\\tint A_right,B_right;\\n\\n\\tfor(int A_left = 0; A_left < len[A]; A_left++){\\n\\t\\tfor(int B_left = 0; B_left < len[B]; B_left++){\\n\\n\\t\\t\\tfor(int i = 0; i <= len[A]; i++){\\n\\t\\t\\t\\tfor(int k = 0; k <= len[B]; k++){\\n\\t\\t\\t\\t\\tmax_match[i][k] = -1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tmax_match[0][0] = 0;\\n\\n\\t\\t\\tfor(int len_A = 1; len_A <= len[A]; len_A++){\\n\\t\\t\\t\\tA_right = A_left+len_A-1;\\n\\t\\t\\t\\tfor(int len_B = 1; len_B <= len[B]; len_B++){\\n\\t\\t\\t\\t\\tB_right = B_left+len_B-1;\\n\\t\\t\\t\\t\\tfor(int A_mid = A_left; A_mid <= A_right; A_mid++){\\n\\t\\t\\t\\t\\t\\tfor(int B_mid = B_left; B_mid <= B_right; B_mid++){\\n\\t\\t\\t\\t\\t\\t\\tif(max_match[A_mid-A_left][B_mid-B_left] == -1)continue;\\n\\n\\t\\t\\t\\t\\t\\t\\tfor(int i = 0; i < 30; i++){\\n\\t\\t\\t\\t\\t\\t\\t\\tif(dp[A][A_mid][A_right][i] == true && dp[B][B_mid][B_right][i] == true){\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tmax_match[len_A][len_B] = max(max_match[len_A][len_B],max_match[A_mid-A_left][B_mid-B_left]+1);\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\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}\\n\\t\\t\\t\\tans = max(ans,max_match[len[A]][len[B]]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tprintf(\\\"%d\\\\n\\\",ans);\\n}\\n\\nint main(){\\n\\n\\twhile(true){\\n\\t\\tscanf(\\\"%d %d %d\\\",&len[A],&len[B],&num_rule);\\n\\t\\tif(len[A] == 0 && len[B] == 0 && num_rule == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 7170,\n \"memory_kb\": 5380,\n \"score_of_the_acc\": -1.0825,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1191_3170823\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\\n#define all(x) (x).begin(),(x).end()\\n#define pb push_back\\n#define fi first\\n#define se second\\n#define dbg(x) cout<<#x\\\" = \\\"<<((x))<<endl\\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\\\"(\\\"<<p.fi<<\\\",\\\"<<p.se<<\\\")\\\";return o;}\\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\\\"[\\\";for(T t:v){o<<t<<\\\",\\\";}o<<\\\"]\\\";return o;}\\n\\nint main(){\\n int n,m,RULE;\\n while(scanf(\\\" %d %d %d\\\", &n, &m, &RULE),n){\\n vector<int> A(n),B(m);\\n rep(i,n){\\n scanf(\\\" %d\\\", &A[i]);\\n --A[i];\\n }\\n rep(i,m){\\n scanf(\\\" %d\\\", &B[i]);\\n --B[i];\\n }\\n\\n vector< pair<vector<int>,int> > rule(RULE);\\n rep(i,RULE){\\n int k;\\n scanf(\\\" %d\\\", &k);\\n\\n vector<int> x(k);\\n int y;\\n rep(j,k){\\n scanf(\\\" %d\\\", &x[j]);\\n --x[j];\\n }\\n scanf(\\\" %d\\\", &y);\\n --y;\\n\\n rule[i] = {x,y};\\n }\\n\\n auto make_f = [&](vector<int> &v){\\n int V = v.size();\\n int N = 2*V;\\n vector<vector<int>> f(N,vector<int>(N));\\n\\n rep(i,N){\\n int vv = v[i%V];\\n f[i][i] |= (1<<vv);\\n }\\n\\n for(int b=2; b<=V; ++b){\\n for(int l=0; l+b-1<N; ++l){\\n int r = l+b-1;\\n\\n // calc f[l][r]\\n rep(rr,RULE){\\n vector<int> x = rule[rr].fi;\\n int y = rule[rr].se;\\n\\n int X = x.size();\\n vector<vector<bool>> valid(b+1, vector<bool>(X+1));\\n valid[0][0] = true;\\n rep(i,b)rep(j,X)if(valid[i][j]){\\n int val = x[j];\\n for(int k=i; k<b; ++k){\\n if(f[l+i][l+k]>>val&1) valid[k+1][j+1] = true;\\n }\\n }\\n\\n if(valid[b][X]) f[l][r] |= (1<<y);\\n }\\n }\\n }\\n\\n // rep(i,N)rep(j,N) printf(\\\"f[%d][%d] = %d\\\\n\\\",i,j,f[i][j]);\\n return f;\\n };\\n\\n vector<vector<int>> fa = make_f(A), fb = make_f(B);\\n int ans = -1;\\n rep(i,n)rep(j,m){\\n // printf(\\\"CALC %d %d\\\\n\\\",i,j);\\n vector<vector<int>> dp(n+1,vector<int>(m+1,-1));\\n dp[0][0]=0;\\n rep(ii,n)rep(jj,m)if(dp[ii][jj]>=0){\\n for(int ni=ii+1; ni<=n; ++ni)for(int nj=jj+1; nj<=m; ++nj){\\n if(fa[i+ii][i+ni-1]&fb[j+jj][j+nj-1]) dp[ni][nj] = max(dp[ni][nj], dp[ii][jj]+1);\\n }\\n }\\n ans = max(ans, dp[n][m]);\\n }\\n\\n printf(\\\"%d\\\\n\\\", ans);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1030,\n \"memory_kb\": 3288,\n \"score_of_the_acc\": -0.1153,\n \"final_rank\": 4\n }\n]","isConversational":false}}},{"rowIdx":663,"cells":{"group_id":{"kind":"string","value":"aoj_1194_cpp"},"problem_description":{"kind":"string","value":"Vampire\nMr. C is a vampire. If he is exposed to the sunlight directly, he turns \ninto ash.\nNevertheless, last night, he attended to the meeting of Immortal and \nCorpse Programmers\nCircle, and he has to go home in the near dawn.\nFortunately, there are many tall buildings around Mr. C's home, and \nwhile the sunlight is blocked by the buildings, he can move around \nsafely.\nThe top end of the sun has just reached the horizon now.\nIn how many seconds does Mr. C have to go into his safe coffin?\nTo simplify the problem, we represent the eastern dawn sky as a 2-dimensional\nx\n-\ny\nplane, where the\nx\naxis is horizontal and the\ny\naxis\nis vertical, and approximate building silhouettes by rectangles\nand the sun by a circle on this plane.\nThe\nx\naxis represents the horizon.\nWe denote the time by\nt\n, and the current time is\nt\n=0.\nThe radius of the sun is\nr\nand\nits center is at (0, -\nr\n) when the time\nt\n=0.\nThe sun moves on the\nx\n-\ny\nplane in a uniform linear motion at\na constant velocity of (0, 1) per second.\nThe sunlight is blocked if and only if the entire region of the sun \n(including its edge) is included in the union of the silhouettes \n(including their edges) and the region below the horizon (y ≤ 0).\nWrite a program that computes the time of the last moment when the sunlight is blocked.\nThe following figure shows the layout of silhouettes and the position of the sun at\nthe last moment when the sunlight is blocked, that corresponds to the\nfirst dataset of Sample Input below. As this figure indicates, there are possibilities\nthat the last moment when the sunlight is blocked can be the time\nt\n=0.\nThe sunlight is blocked even when two silhouettes share parts of their edges.\n\nThe following figure shows the layout of silhouettes and the position of the sun at the\nlast moment when the sunlight is blocked, corresponding to the second\ndataset of Sample Input.\nIn this dataset the radius of the sun is 2 and there are two silhouettes:\nthe one with height 4 is in -2 ≤\nx\n≤ 0, and\nthe other with height 3 is in 0 ≤\nx\n≤ 2.\nInput\nThe input consists of multiple datasets.\nThe first line of a dataset contains two\nintegers\nr\nand\nn\nseparated by a space.\nr\nis the radius of the sun and\nn\nis the number of silhouettes\nof the buildings.\n(1 ≤\nr\n≤ 20, 0 ≤\nn\n≤ 20)\nEach of following\nn\nlines contains three integers\nx\nli\n,\nx\nri\n,\nh\ni\n(1 ≤\ni\n≤\nn\n) separated by a space.\nThese three integers represent a silhouette rectangle of a building.\nThe silhouette rectangle is parallel to the horizon, and its left and right edges\nare at\nx\n=\nx\nli\nand\nx\n=\nx\nri\n, its top\nedge is at\ny\n=\nh\ni\n, and its bottom edge is on\nthe horizon.\n(-20 ≤\nx\nli\n<\nx\nri\n≤ 20,\n0 <\nh\ni\n≤ 20)\nThe end of the input is indicated by a line containing two zeros separated by a space.\nNote that these silhouettes may overlap one another.\nOutput\nFor each dataset, output a line containing the number indicating the time\nt\nof the last moment when the sunlight is blocked.\nThe value should not have an error greater than 0.001.\nNo extra character\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1194_10850501","code_snippet":"#include <cstdio>\n#include <cmath>\n#include <algorithm>\n#include <vector>\n\nusing namespace std;\n\nconst double EPS = 1e-9;\nbool EQ(double a, double b) { return abs(a - b) < EPS; }\n\ndouble getHeight(double r, double x) {\n\treturn sqrt(r * r - x * x);\n}\n\nint main(void) {\n\tint r, n;\n\tint T = 0;\n\twhile(scanf(\"%d %d\", &r, &n), r > 0) {\n\t\tT++;\n\t\tint left[20], right[20], height[20];\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tscanf(\"%d %d %d\", left + i, right + i, height + i);\n\t\t}\n\n\t\tvector<double> xs;\n\t\tconst double GAPEPS = 1e-7;\n\t\txs.push_back(-r + GAPEPS);\n\t\txs.push_back(r - GAPEPS);\n\t\txs.push_back(r);\n\t\txs.push_back(-r);\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tdouble cand = left[i] - GAPEPS;\n\t\t\tif(-r <= cand and cand <= r) xs.push_back(cand);\n\t\t\tcand = left[i] + GAPEPS;\n\t\t\tif(-r <= cand and cand <= r) xs.push_back(cand);\n\t\t\tcand = right[i] - GAPEPS;\n\t\t\tif(-r <= cand and cand <= r) xs.push_back(cand);\n\t\t\tcand = right[i] + GAPEPS;\n\t\t\tif(-r <= cand and cand <= r) xs.push_back(cand);\n\t\t\tcand = left[i];\n\t\t\tif(-r <= cand and cand <= r) xs.push_back(cand);\n\t\t\tcand = right[i];\n\t\t\tif(-r <= cand and cand <= r) xs.push_back(cand);\n\t\t}\n\t\tfor(int i = 1; i < 10001; i++) xs.push_back(-r + 2 * r / 10001.0 * i);\n\n\t\tsort(xs.begin(), xs.end());\n\n\t\tdouble s = 0, e = 100;\n\t\tfor(int lv = 0; lv < 100; lv++) {\n\t\t\tdouble mid = (s + e) / 2;\n\t\t\tbool isAble = true;\n\n\t\t\tfor(double x: xs) {\n\t\t\t\tbool isIncluded = false;\n\n\t\t\t\tdouble curHeight = getHeight(r, x) - r + mid;\n\t\t\t\tif(curHeight <= 0 or EQ(curHeight, 0)) continue;\n\t\t\t\tfor(int i = 0; i < n; i++)\n\t\t\t\t\tif(left[i] <= x and x <= right[i] and height[i] > curHeight and !EQ(height[i], curHeight)) {\n\t\t\t\t\t\tisIncluded = true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\n\t\t\t\tif(!isIncluded) {\n\t\t\t\t\tisAble = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(isAble) s = mid;\n\t\t\telse e = mid;\n\t\t}\n\n\t\tprintf(\"%.4lf\\n\", s);\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":630,"memory_kb":3008,"score_of_the_acc":-0.0856,"final_rank":1},{"submission_id":"aoj_1194_10607261","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\nbl solve()\n{\n ll r, n;\n cin >> r >> n;\n if (n == 0 && r == 0)\n return 0;\n vl xl(n), xr(n), h(n);\n rep(i, n)\n {\n cin >> xl[i] >> xr[i] >> h[i];\n }\n // すべてのありうる頂点に対して全探索\n // vl maxH(41);\n // rep(i, n)\n // {\n // if(xl[i]<0){\n // xl[i]--;\n // }\n // if(xr[i]<0){\n // xr[i]--;\n // }\n // for (ll j = xl[i] + 1; j <= xr[i]; j++)\n // {\n // maxH[j+20] = max(maxH[j+20],h[i]);\n // }\n // }\n // debug_vc(maxH);\n // maxH[20] = min(maxH[19],maxH[21]);\n set<P> coord;\n set<P> isRight;\n set<P> isLeft;\n for (ll x = -20; x <= 20; x++)\n {\n for (ll y = 0; y <= 20; y++)\n {\n coord.insert({x, y});\n }\n }\n rep(i, n)\n {\n for (ll x = xl[i] + 1; x < xr[i]; x++)\n {\n for (ll y = 0; y < h[i]; y++)\n {\n coord.erase({x, y});\n }\n }\n for (ll y = 0; y < h[i]; y++)\n {\n isLeft.insert({xl[i], y});\n isRight.insert({xr[i], y});\n }\n }\n for (ll x = -20; x <= 20; x++)\n {\n for (ll y = 0; y <= 20; y++)\n {\n if (isRight.count({x, y}) && isLeft.count({x, y}))\n coord.erase({x, y});\n }\n }\n // for (ll x = -2; x <= 2; x++)\n // {\n // for (ll y = 0; y <= 4; y++)\n // {\n // if (coord.count({x,y})){\n // cout << x << y << endl;\n // }\n // }\n // }\n ld ans = 1e4;\n for (auto [x, y] : coord)\n {\n // debug_x(x);\n // debug_x(y);\n if (x <= -r || r <= x)\n continue;\n ans = min((ld)y - sqrt(r * r - x * x), ans);\n }\n cout << fixed << setprecision(10) << ans + r << endl;\n return 1;\n}\n\nsigned main()\n{\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n while (true)\n {\n if (!solve())\n break;\n }\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":10,"memory_kb":3508,"score_of_the_acc":-0.5,"final_rank":6},{"submission_id":"aoj_1194_9259676","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nconst int MAX = 1000000005;\n\nbool solve() {\n int r, n;\n cin >> r >> n;\n if (r == 0 && n == 0) return false;\n vector<tuple<int, int, int>> rect(n);\n for (int i = 0; i < n; i++) {\n int xl, xr, h;\n cin >> xl >> xr >> h;\n rect[i] = {xl, xr, h};\n }\n double ans = 1e+10;\n for (int i = 1; i < 100000; i++) {\n double x = r*cos(i*M_PI/100000), y = r*sin(i*M_PI/100000);\n int maxh = 0;\n for (int j = 0; j < n; j++) {\n auto [xl, xr, h] = rect[j];\n if (x >= (double)xl && x <= (double)xr) {\n maxh = max(maxh, h);\n }\n }\n ans = min(ans, r + maxh - y);\n }\n cout << fixed << setprecision(10) << ans << endl;\n\n return true;\n}\n\nint main() {\n ios::sync_with_stdio(0); cin.tie();\n while (solve()) {}\n}","accuracy":1,"time_ms":380,"memory_kb":3688,"score_of_the_acc":-0.7311,"final_rank":10},{"submission_id":"aoj_1194_8007092","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing vi = vector<int>;\nusing vvi = vector<vi>;\nusing vl = vector<ll>;\nusing vvl = vector<vl>;\nusing vb = vector<bool>;\nusing vvb = vector<vb>;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\n#define rep(i, s, n) for(int i = (int)(s); i < (int)(n); ++i)\n\nll INF = 1ll << 60;\n\nlong double solve(long double cy, int dr, int x){\n if(abs(x) == dr){\n return -1;\n }\n long double r = dr;\n long double x1 = x, x2 = x;\n long double cx = 0;\n long double y1 = 0;\n long double y2 = 1;\n long double xd = x2 - x1, yd = y2 - y1;\n long double X = x1 - cx, Y = y1 - cy;\n long double a = xd*xd + yd*yd;\n long double b = xd * X + yd * Y;\n long double c = X*X + Y*Y - r*r;\n // D = 0の時は1本で、D < 0の時は存在しない\n long double D = b*b - a*c;\n if(D <= 0){\n return -1;\n }\n long double s1 = (-b + sqrt(D)) / a;\n long double s2 = (-b - sqrt(D)) / a;\n return max(y1 + yd*s1, y1 + yd*s2);\n}\n\nint main(){\n vector<long double> ret;\n while(true){\n int r, n;\n cin >> r >> n;\n if(r == n && r == 0){\n break;\n }\n vi xl(n), xr(n), h(n);\n rep(i, 0, n){\n cin >> xl[i] >> xr[i] >> h[i];\n }\n map<pii, int> mx;\n rep(i, 0, n){\n rep(l, xl[i], xr[i]){\n if(!mx.count({l,l+1})){\n mx[{l,l+1}] = h[i];\n }\n else{\n mx[{l,l+1}] = max(mx[{l,l+1}], h[i]);\n }\n }\n }\n rep(i, -30, 30){\n if(!mx.count({i, i+1})){\n mx[{i,i+1}] = 0;\n }\n //cout << mx[{i,i+1}] << \" \";\n }\n //cout << endl;\n\n long double ans = 0;\n bool ck = true;\n\n rep(time, 0, 300000){\n long double t = 1.0*time/10000;\n rep(x, -r-1, r+2){\n if(solve(t-r, r, x) > 0 || solve(t-r, r, x+1) > 0){\n long double mxh = max(solve(t-r, r, x), solve(t-r, r, x+1));\n if(mxh > mx[{x,x+1}]){\n ck = false;\n /*\n cout << t << \"/\" << x << endl;\n cout << solve(t-r, r, x) <<\" \" << solve(t-r, r, x+1) << endl;\n */\n }\n }\n }\n if(ck){\n ans = t;\n }\n else{\n break;\n }\n }\n ret.push_back(ans);\n }\n\n cout << fixed << setprecision(10);\n for(auto r : ret){\n cout << r << endl;\n }\n \n return 0;\n \n}","accuracy":1,"time_ms":7250,"memory_kb":3512,"score_of_the_acc":-1.504,"final_rank":19},{"submission_id":"aoj_1194_8007084","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing vi = vector<int>;\nusing vvi = vector<vi>;\nusing vl = vector<ll>;\nusing vvl = vector<vl>;\nusing vb = vector<bool>;\nusing vvb = vector<vb>;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\n#define rep(i, s, n) for(int i = (int)(s); i < (int)(n); ++i)\n\nll INF = 1ll << 60;\n\nlong double solve(long double cy, int dr, int x){\n if(abs(x) == dr){\n return -1;\n }\n long double r = dr;\n long double x1 = x, x2 = x;\n long double cx = 0;\n long double y1 = 0;\n long double y2 = 1;\n long double xd = x2 - x1, yd = y2 - y1;\n long double X = x1 - cx, Y = y1 - cy;\n long double a = xd*xd + yd*yd;\n long double b = xd * X + yd * Y;\n long double c = X*X + Y*Y - r*r;\n // D = 0の時は1本で、D < 0の時は存在しない\n long double D = b*b - a*c;\n if(D <= 0){\n return -1;\n }\n long double s1 = (-b + sqrt(D)) / a;\n long double s2 = (-b - sqrt(D)) / a;\n return max(y1 + yd*s1, y1 + yd*s2);\n}\n\nint main(){\n vector<long double> ret;\n while(true){\n int r, n;\n cin >> r >> n;\n if(r == n && r == 0){\n break;\n }\n vi xl(n), xr(n), h(n);\n rep(i, 0, n){\n cin >> xl[i] >> xr[i] >> h[i];\n }\n map<pii, int> mx;\n rep(i, 0, n){\n rep(l, xl[i], xr[i]){\n if(!mx.count({l,l+1})){\n mx[{l,l+1}] = h[i];\n }\n else{\n mx[{l,l+1}] = max(mx[{l,l+1}], h[i]);\n }\n }\n }\n rep(i, -30, 30){\n if(!mx.count({i, i+1})){\n mx[{i,i+1}] = 0;\n }\n //cout << mx[{i,i+1}] << \" \";\n }\n //cout << endl;\n\n long double ans = 0;\n bool ck = true;\n\n rep(time, 1, 300000){\n long double t = 1.0*time/10000;\n long double dx;\n if(t > 2*r){\n dx = r;\n }\n else{\n dx = sqrt(2*t*r-t*t);\n }\n rep(x, ceil(-dx-2), dx+3){\n if(solve(t-r, r, x) > 0 || solve(t-r, r, x+1) > 0){\n long double mxh = max(solve(t-r, r, x), solve(t-r, r, x+1));\n if(mxh > mx[{x,x+1}]){\n ck = false;\n /*\n cout << t << \"/\" << x << endl;\n cout << solve(t-r, r, x) <<\" \" << solve(t-r, r, x+1) << endl;\n */\n }\n }\n }\n if(ck){\n ans = t;\n }\n else{\n break;\n }\n }\n ret.push_back(ans);\n }\n\n cout << fixed << setprecision(10);\n for(auto r : ret){\n cout << r << endl;\n }\n \n return 0;\n \n}","accuracy":0.5,"time_ms":6750,"memory_kb":3404,"score_of_the_acc":-1.3269,"final_rank":20},{"submission_id":"aoj_1194_8002427","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nbool solve() {\n int n;\n double r;\n cin >> r >> n;\n if( abs(r) < 1e-3 ) return false;\n vector<pair<int, int>> event;\n for( int i = 0; i < n; i++ ) {\n int xl, xr, h;\n cin >> xl >> xr >> h;\n event.push_back(make_pair(xl, -h));\n event.push_back(make_pair(xr, h));\n }\n sort(event.begin(), event.end());\n vector<pair<int, int>> boundary;\n multiset<int> Sh;\n Sh.insert(0);\n boundary.push_back(make_pair(-40, 0));\n for( int i = 0; i < event.size(); i++ ) {\n int h_pre = *Sh.rbegin();\n auto [x, h] = event[i];\n if( h > 0 ) {\n Sh.erase(Sh.find(h));\n }else {\n Sh.insert(-h);\n }\n int h_cur = *Sh.rbegin();\n boundary.push_back(make_pair(x, h_pre));\n boundary.push_back(make_pair(x, h_cur));\n }\n boundary.push_back(make_pair(40, 0));\n double t = 0, step = 0.0001;\n auto dist = [&](double xl, double yl, double xr, double yr) -> double {\n if( xl > xr ) swap(xl, xr);\n if( yl > yr ) swap(yl, yr);\n if( xl == xr ) {\n double dy = max({0.0, yl-(-r+t), (-r+t)-yr});\n return hypot(xl, dy);\n }else {\n double dx = max({0.0, xl, -xr});\n return hypot(dx, yl-(-r+t));\n }\n };\n for( ; ; t+=step ) {\n bool is_covered = true;\n for( int i = 0; i < boundary.size()-1; i++ ) {\n auto [xl, yl] = boundary[i];\n auto [xr, yr] = boundary[i+1];\n if( dist(xl, yl, xr, yr) < r ) is_covered = false;\n }\n if( !is_covered ) break;\n }\n cout << fixed << setprecision(8) << t-step << endl;\n return true;\n}\nint main() {\n while( solve() ) {}\n}","accuracy":1,"time_ms":5690,"memory_kb":3472,"score_of_the_acc":-1.2485,"final_rank":16},{"submission_id":"aoj_1194_7952406","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nbool solve() {\n int r, n;\n cin >> r >> n;\n if (r == 0 && n == 0) return false;\n set<pair<int, int>> s;\n for (int i = 0; i < n; i++) {\n int l, r, h;\n cin >> l >> r >> h;\n for (int j = l; j < r; j++) {\n for (int k = 0; k < h; k++) {\n s.emplace(j, k);\n }\n }\n }\n long double ans = 1e18;\n for (int x = -r + 1; x < r; x++) {\n for (int y = 0; y <= 30; y++) {\n long double dy = y - (sqrtl(r * r - x * x) - r);\n if (s.count(make_pair(x, y)) == 0 || s.count(make_pair(x - 1, y)) == 0) {\n ans = std::min(ans, dy);\n }\n }\n }\n cout << fixed << setprecision(10); \n cout << ans << '\\n';\n return true;\n}\n\nint main() {\n while (solve()) ; \n}","accuracy":1,"time_ms":10,"memory_kb":3424,"score_of_the_acc":-0.416,"final_rank":2},{"submission_id":"aoj_1194_7909704","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nusing ull = unsigned long long;\ntypedef pair<ll,ll> pll;\ntypedef vector<ll> vll;\ntypedef vector<pll> vpll;\ntemplate<class T> using pqmin = priority_queue<T, vector<T>, greater<T>>;\ntemplate<class T> using pqmax = priority_queue<T>;\nconst ll inf=LLONG_MAX/3;\nconst ll dx[] = {0, 1, 0, -1, 1, -1, 1, -1};\nconst ll dy[] = {1, 0, -1, 0, 1, 1, -1, -1};\n#define mp make_pair\n#define pb push_back\n#define eb emplace_back\n#define fi first\n#define se secondf\n#define all(x) x.begin(),x.end()\n#define si(x) ll(x.size())\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 rng(i,l,r) for(ll i=l;i<r;i++)\n#define gnr(i,l,r) for(ll i=r-1;i>=l;i--)\n#define fore(i, a) for(auto &&i : a)\n#define fore2(a, b, v) for(auto &&[a, b] : v)\n#define fore3(a, b, c, v) for(auto &&[a, b, c] : v)\ntemplate<class T> bool chmin(T& a, const T& b){ if(a <= b) return 0; a = b; return 1; }\ntemplate<class T> bool chmax(T& a, const T& b){ if(a >= b) return 0; a = b; return 1; }\ntemplate<class T, class U> bool chmin(T& a, const U& b){ return chmin(a, (T)b); }\ntemplate<class T, class U> bool chmax(T& a, const U& b){ return chmax(a, (T)b); }\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\n#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)\n#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)\n#define vec(type,name,...) vector<type>name(__VA_ARGS__)\n#define VEC(type,name,size) vector<type>name(size);in(name)\n#define VLL(name,size) vector<ll>name(size);in(name)\n#define vv(type,name,h,...) vector<vector<type>> name(h,vector<type>(__VA_ARGS__))\n#define VV(type,name,h,w) vector<vector<type>> name(h,vector<type>(w));in(name)\n#define vvv(type,name,h,w,...) vector<vector<vector<type>>> name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\n#define SUM(...) accumulate(all(__VA_ARGS__),0LL)\ntemplate<class T> auto min(const T& a){ return *min_element(all(a)); }\ntemplate<class T> auto max(const T& a){ return *max_element(all(a)); }\ntemplate<class T, class F = less<>> void sor(T& a, F b = F{}){ sort(all(a), b); }\ntemplate<class T> void uniq(T& a){ sor(a); a.erase(unique(all(a)), end(a)); }\nvoid outb(bool x){cout<<(x?\"Yes\":\"No\")<<\"\\n\";}\nll max(int x, ll y) { return max((ll)x, y); }\nll max(ll x, int y) { return max(x, (ll)y); }\nint min(int x, ll y) { return min((ll)x, y); }\nint min(ll x, int y) { return min(x, (ll)y); }\n#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))\n#define lbg(c, x) distance((c).begin(), lower_bound(all(c), (x), greater{}))\n#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))\n#define ubg(c, x) distance((c).begin(), upper_bound(all(c), (x), greater{}))\nll gcd(ll a,ll b){return (b?gcd(b,a%b):a);}\nvector<pll> factor(ull x){ vector<pll> ans; for(ull i = 2; i * i <= x; i++) if(x % i == 0){ ans.push_back({i, 1}); while((x /= i) % i == 0) ans.back().second++; } if(x != 1) ans.push_back({x, 1}); return ans; }\nvector<ll> divisor(ull x){ vector<ll> ans; for(ull i = 1; i * i <= x; i++) if(x % i == 0) ans.push_back(i); per(i,ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]); return ans; }\nvll prime_table(ll n){vec(ll,isp,n+1,1);vll res;rng(i,2,n+1)if(isp[i]){res.pb(i);for(ll j=i*i;j<=n;j+=i)isp[j]=0;}return res;}\n\ntemplate <class T, class S> pair<T, S> operator-(const pair<T, S> &x) { return pair<T, S>(-x.first, -x.second); }\ntemplate <class T, class S> pair<T, S> operator-(const pair<T, S> &x, const pair<T, S> &y) { return pair<T, S>(x.fi - y.fi, x.se - y.se); }\ntemplate <class T, class S> pair<T, S> operator+(const pair<T, S> &x, const pair<T, S> &y) { return pair<T, S>(x.fi + y.fi, x.se + y.se); }\ntemplate <class T> pair<T, T> operator&(const pair<T, T> &l, const pair<T, T> &r) { return pair<T, T>(max(l.fi, r.fi), min(l.se, r.se)); }\ntemplate <class T, class S> pair<T, S> operator+=(pair<T, S> &l, const pair<T, S> &r) { return l = l + r; }\ntemplate <class T, class S> pair<T, S> operator-=(pair<T, S> &l, const pair<T, S> &r) { return l = l - r; }\ntemplate <class T> bool intersect(const pair<T, T> &l, const pair<T, T> &r) { return (l.se < r.se ? r.fi < l.se : l.fi < r.se); }\n\ntemplate <class T> vector<T> &operator++(vector<T> &v) {\n fore(e, v) e++;\n return v;\n}\ntemplate <class T> vector<T> operator++(vector<T> &v, int) {\n auto res = v;\n fore(e, v) e++;\n return res;\n}\ntemplate <class T> vector<T> &operator--(vector<T> &v) {\n fore(e, v) e--;\n return v;\n}\ntemplate <class T> vector<T> operator--(vector<T> &v, int) {\n auto res = v;\n fore(e, v) e--;\n return res;\n}\ntemplate <class T> vector<T> &operator+=(vector<T> &l, const vector<T> &r) {\n fore(e, r) l.eb(e);\n return l;\n}\n\ntemplate<class... Ts> void in(Ts&... t);\n[[maybe_unused]] void print(){}\ntemplate<class T, class... Ts> void print(const T& t, const Ts&... ts);\ntemplate<class... Ts> void out(const Ts&... ts){ print(ts...); cout << '\\n'; }\nnamespace IO{\n#define VOID(a) decltype(void(a))\nstruct S{ S(){ cin.tie(nullptr)->sync_with_stdio(0); fixed(cout).precision(12); } }S;\ntemplate<int I> struct P : P<I-1>{};\ntemplate<> struct P<0>{};\ntemplate<class T> void i(T& t){ i(t, P<3>{}); }\nvoid i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }\ntemplate<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }\ntemplate<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }\ntemplate<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){ in(get<idx>(t)...); }\ntemplate<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){ ituple(t, make_index_sequence<tuple_size<T>::value>{}); }\ntemplate<class T> void o(const T& t){ o(t, P<4>{}); }\ntemplate<size_t N> void o(const char (&t)[N], P<4>){ cout << t; }\ntemplate<class T, size_t N> void o(const T (&t)[N], P<3>){ o(t[0]); for(size_t i = 1; i < N; i++){ o(' '); o(t[i]); } }\ntemplate<class T> auto o(const T& t, P<2>) -> VOID(cout << t){ cout << t; }\ntemplate<class T> auto o(const T& t, P<1>) -> VOID(begin(t)){ bool first = 1; for(auto&& x : t) { if(first) first = 0; else o(' '); o(x); } }\ntemplate<class T, size_t... idx> void otuple(const T& t, index_sequence<idx...>){ print(get<idx>(t)...); }\ntemplate<class T> auto o(T& t, P<0>) -> VOID(tuple_size<T>{}){ otuple(t, make_index_sequence<tuple_size<T>::value>{}); }\n#undef VOID\n}\n#define unpack(a) (void)initializer_list<int>{(a, 0)...}\ntemplate<class... Ts> void in(Ts&... t){ unpack(IO::i(t)); }\ntemplate<class T, class... Ts> void print(const T& t, const Ts&... ts){ IO::o(t); unpack(IO::o((cout << ' ', ts))); }\n#undef unpack\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n while(1){\n LL(r,n);\n if(n==0&&r==0)break;\n map<pll,bool> col;\n rep(i,n){\n LL(xl,xr,h);\n rng(x,xl,xr)rng(y,0,h){\n col[{x,y}]=1;\n }\n }\n auto inc=[&](double p,double x,double y){\n double d=pow(x,2)+pow(y-p,2);\n d=sqrt(d);\n return d<r;\n };\n auto f=[&](double t){\n double p=t-r;\n bool res=1;\n rng(x,-20,20)rng(y,0,20){\n bool ex=0;\n rng(dx,0,2)rng(dy,0,2){\n ex|=inc(p,x+dx,y+dy);\n }\n if(ex){\n res&=col[{x,y}];\n }\n }\n return res;\n };\n {\n double l=0,r=20;\n while(l<r-0.0001){\n double mid=(l+r)/2.0;\n (f(mid)?l:r)=mid;\n }\n cout<<fixed<<setprecision(4);\n out(l);\n }\n }\n}","accuracy":1,"time_ms":30,"memory_kb":3548,"score_of_the_acc":-0.5428,"final_rank":8},{"submission_id":"aoj_1194_7700090","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <deque>\n#include <queue>\n#include <string>\n#include <iomanip>\n#include <set>\n#include <unordered_set>\n#include <map>\n#include <unordered_map>\n#include <utility>\n#include <stack>\n#include <random>\n#include <complex>\n#include <functional>\n#include <stdio.h>\n#include <stdlib.h>\n#include <time.h>\n#include <math.h>\n#include <assert.h>\n#if __has_include(<atcoder/all>)\n#include <atcoder/all>\nusing namespace atcoder;\n#endif\n#if __has_include(<boost/multiprecision/cpp_int.hpp>)\n#include <boost/multiprecision/cpp_int.hpp>\nusing cpp_int=boost::multiprecision::cpp_int;\n#endif\n#if __has_include(<boost/multiprecision/cpp_dec_float.hpp>)\n#include <boost/multiprecision/cpp_dec_float.hpp>\ntemplate<unsigned size>using cpp_float=boost::multiprecision::number<boost::multiprecision::cpp_dec_float<size>>;\ntemplate<unsigned size>using cpp_double=boost::multiprecision::number<boost::multiprecision::cpp_dec_float<size,long long>>;\n#endif\nusing namespace std;\nusing ll=long long;\n#define read(x) cin>>(x);\n#define readll(x) ll (x);cin>>(x);\n#define readS(x) string (x);cin>>(x);\n#define readvll(x,N) vector<ll> (x)((N));for(int i=0;i<(N);i++){cin>>(x)[i];}\n#define rep(i,N) for(ll (i)=0;(i)<(N);(i)++)\n#define rep2d(i,j,H,W) for(ll (i)=0;(i)<(H);(i)++)for(ll (j)=0;(j)<(W);j++)\n#define is_in(x,y) (0<=(x) && (x)<H && 0<=(y) && (y)<W)\n#define yn {cout<<\"Yes\"<<endl;}else{cout<<\"No\"<<endl;}\n#define double_out(x) fixed << setprecision(x)\ntemplate<class T> inline void erase_duplicate(vector<T>& A){sort(A.begin(),A.end());A.erase(unique(A.begin(),A.end()),A.end());}\ninline ll powll(ll x,ll n){ll r=1;while(n>0){if(n&1){r*=x;};x*=x;n>>=1;};return r;}\n\nvoid solve(ll r,ll n){\n vector<ll> xl(n),xr(n),h(n);\n for(ll i=0;i<n;i++){\n cin>>xl[i]>>xr[i]>>h[i];\n }\n // vector<ll> hmax(41);\n // for(ll i=0;i<n;i++){\n // for(ll j=xl[i]+20;j<xr[i]+20;j++){\n // hmax[j]=max(hmax[j],h[i]);\n // }\n // }\n // double ans=100000;\n // for(ll j=0;j<40;j++){\n // ll x1=j-20;\n // ll x2=j-20+1;\n // ll hh=hmax[j];\n // if(abs(x1)>abs(x2)){\n // swap(x1,x2);\n // hh=hmax[j+1];\n // }\n // if(abs(x1)>r || (abs(x1)==r && hh==0)){\n // continue;\n // }\n // ans=min(ans,hh-sqrt(r*r-x1*x1)+r);\n // cerr<<x1<<\" \"<<hh<<\" \"<<ans<<endl;\n // }\n double ans=1000000;\n for(double x=-20.0;x<=20.0;x+=0.00001){\n if(abs(x)>r){\n continue;\n }\n ll hh=0;\n for(ll i=0;i<n;i++){\n if(xl[i]<=x && x<=xr[i]){\n hh=max(hh,h[i]);\n }\n }\n ans=min(ans,hh-sqrt(r*r-x*x)+r);\n }\n cout<<double_out(10)<<ans<<endl;\n}\n\nint main(){\n ll r,n;\n while(cin>>r>>n,r){\n solve(r,n);\n }\n}","accuracy":1,"time_ms":2960,"memory_kb":3568,"score_of_the_acc":-0.9675,"final_rank":11},{"submission_id":"aoj_1194_6771273","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\n\nvoid solve(){\n while(1){\n int r,n;\n cin>>r>>n;\n if(r==0&&n==0) break;\n map<pair<double,double>,bool> mp;\n for(int i=0;i<n;i++){\n int xl,xr,h;\n cin>>xl>>xr>>h;\n for(double x=xl;x<=xr;x+=0.5){\n for(int y=0;y<=h;y++){\n mp[{x,y}]=true;\n }\n }\n }\n long double ans=1000000;\n for(int x=-20;x<=20;x++){\n for(int y=1;y<=20;y++){\n if(!mp[{x+0.5,y+1}]||!mp[{x-0.5,y+1}]){\n if(r*r-x*x>0){\n ans=min(ans,(long double)y+r-sqrt(r*r-x*x));\n }\n }\n }\n }\n for(int x=-20;x<=20;x++){\n if(!mp[{x-0.5,0}]||!mp[{x+0.5,0}]){\n if(r*r-x*x>0){\n ans=min(ans,(long double)r-sqrt(r*r-x*x));\n }\n }\n }\n cout<<fixed<<setprecision(6)<<ans<<endl;\n }\n}\nint main(){\n solve();\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3504,"score_of_the_acc":-0.4974,"final_rank":5},{"submission_id":"aoj_1194_6672119","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <deque>\n#include <queue>\n#include <string>\n#include <iomanip>\n#include <set>\n#include <unordered_set>\n#include <map>\n#include <unordered_map>\n#include <utility>\n#include <stack>\n#include <random>\n#include <stdio.h>\n#include <stdlib.h>\n#include <time.h>\n#include <math.h>\n#include <assert.h>\n#if __has_include(<atcoder/all>)\n#include <atcoder/all>\nusing namespace atcoder;\n#endif\nusing namespace std;\nusing ll=long long;\n#define read(x) cin>>(x);\n#define readll(x) ll (x);cin>>(x);\n#define readS(x) string (x);cin>>(x);\n#define readvll(x,N) vector<ll> (x)((N));for(int i=0;i<(N);i++){cin>>(x)[i];}\n#define rep(i,N) for(ll (i)=0;(i)<(N);(i)++)\n#define rep2d(i,j,H,W) for(ll (i)=0;(i)<(H);(i)++)for(ll (j)=0;(j)<(W);j++)\n#define is_in(x,y) (0<=(x) && (x)<H && 0<=(y) && (y)<W)\n#define yn {cout<<\"Yes\"<<endl;}else{cout<<\"No\"<<endl;}\n\nvoid solve(ll n,ll r){\n vector<ll> X1(n),X2(n),H(n);\n for(ll i=0;i<n;i++){\n cin>>X1[i]>>X2[i]>>H[i];\n }\n double ans=40.0;\n for(ll i=-r;i<r;i++){\n ll u=0;\n for(ll j=0;j<n;j++){\n if(X1[j]<=i && i<X2[j]){\n //cerr<<j<<endl;\n u=max(u,H[j]);\n }\n }\n //cerr<<\"i: \"<<i<<\" u:\"<<u<<endl;\n for(double j=0;j<1.0;j+=0.0001){\n double x=i+j;\n double t=(double)u-sqrt(r*r-x*x);\n ans=min(ans,(double)r+t);\n }\n }\n cout<<ans<<endl;\n}\n\nint main(){\n ll n;\n ll r;\n while(1){\n cin>>r>>n;\n if(n==0 && r==0){\n return 0;\n }\n solve(n,r);\n }\n}","accuracy":1,"time_ms":40,"memory_kb":3448,"score_of_the_acc":-0.4441,"final_rank":3},{"submission_id":"aoj_1194_6027343","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\n\nusing namespace std;\ntemplate <class T> using V = vector<T>;\ntemplate <class T> using VV = V<V<T>>;\n\nconst long double EPS = 1e-4;\nint r, n;\n\nint main() {\n cin >> r >> n;\n cout << fixed << setprecision(6);\n while (r != 0 || n != 0) {\n VV<int> shadow(41, V<int>(41));\n V<int> xls(n), xrs(n), hs(n);\n for (int i = 0; i < n; i++) {\n cin >> xls[i] >> xrs[i] >> hs[i];\n for (int x = xls[i] + 20; x < xrs[i] + 20; x++) {\n for (int y = 0; y < hs[i]; y++) {\n shadow[y][x] = 1;\n }\n }\n }\n // for (auto &&line : shadow) {\n // for (auto &&s : line) {\n // cout << s << \" \";\n // }\n // cout << \"\\n\";\n // }\n\n // 0.0005 ずつ yを上昇させてシミュレーション\n double t = 0.0;\n\n for (;;) {\n double new_t = t + 0.0005;\n bool ok = true;\n for (int i = -r; i <= r; i++) {\n int x = i;\n int y = floor(sqrt(r * r - x * x) - r + new_t);\n if (y < 0) continue;\n if (i == -r) {\n if (!shadow[y][x + 20]) ok = false;\n } else if (i == r) {\n if (!shadow[y][x + 20 - 1]) ok = false;\n } else if (!shadow[y][x + 20 - 1] || !shadow[y][x + 20]) {\n ok = false;\n }\n }\n if (!ok) break;\n t = new_t;\n }\n cout << t << \"\\n\";\n cin >> r >> n;\n }\n}","accuracy":1,"time_ms":400,"memory_kb":3584,"score_of_the_acc":-0.6299,"final_rank":9},{"submission_id":"aoj_1194_6027341","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\n\nusing namespace std;\ntemplate <class T> using V = vector<T>;\ntemplate <class T> using VV = V<V<T>>;\n\nconst long double EPS = 1e-4;\nint r, n;\n\nint main() {\n cin >> r >> n;\n cout << fixed << setprecision(6);\n while (r != 0 || n != 0) {\n VV<int> shadow(41, V<int>(41));\n V<int> xls(n), xrs(n), hs(n);\n for (int i = 0; i < n; i++) {\n cin >> xls[i] >> xrs[i] >> hs[i];\n for (int x = xls[i] + 20; x < xrs[i] + 20; x++) {\n for (int y = 0; y < hs[i]; y++) {\n shadow[y][x] = 1;\n }\n }\n }\n // for (auto &&line : shadow) {\n // for (auto &&s : line) {\n // cout << s << \" \";\n // }\n // cout << \"\\n\";\n // }\n\n // 0.0005 ずつ yを上昇させてシミュレーション\n double t = 0.0;\n\n for (;;) {\n double new_t = t + 0.00005;\n bool ok = true;\n for (int i = -r; i <= r; i++) {\n int x = i;\n int y = floor(sqrt(r * r - x * x) - r + new_t);\n if (y < 0) continue;\n if (i == -r) {\n if (!shadow[y][x + 20]) ok = false;\n } else if (i == r) {\n if (!shadow[y][x + 20 - 1]) ok = false;\n } else if (!shadow[y][x + 20 - 1] || !shadow[y][x + 20]) {\n ok = false;\n }\n }\n if (!ok) break;\n t = new_t;\n }\n cout << t << \"\\n\";\n cin >> r >> n;\n }\n}","accuracy":1,"time_ms":4010,"memory_kb":3504,"score_of_the_acc":-1.0485,"final_rank":13},{"submission_id":"aoj_1194_6027332","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\ntemplate <class T> using V = vector<T>;\ntemplate <class T> using VV = V<V<T>>;\n\nconst long double EPS = 1e-4;\nint r, n;\n\nint main() {\n cin >> r >> n;\n cout << fixed << setprecision(6);\n while (r != 0 || n != 0) {\n VV<int> shadow(41, V<int>(41));\n V<int> xls(n), xrs(n), hs(n);\n for (int i = 0; i < n; i++) {\n cin >> xls[i] >> xrs[i] >> hs[i];\n for (int x = xls[i] + 20; x < xrs[i] + 20; x++) {\n for (int y = 0; y < hs[i]; y++) {\n shadow[y][x] = 1;\n }\n }\n }\n // for (auto &&line : shadow) {\n // for (auto &&s : line) {\n // cout << s << \" \";\n // }\n // cout << \"\\n\";\n // }\n\n // 0.0005 ずつ yを上昇させてシミュレーション\n double t = 0.0;\n\n for (;;) {\n double new_t = t + 0.00005;\n bool ok = true;\n for (int i = -r; i <= r; i++) {\n int x = i;\n int y = floor(sqrt(r * r - x * x) - r + new_t);\n if (y < 0) continue;\n if (i == -r) {\n if (!shadow[y][x + 20]) ok = false;\n } else if (i == r) {\n if (!shadow[y][x + 20 - 1]) ok = false;\n } else if (!shadow[y][x + 20 - 1] || !shadow[y][x + 20]) {\n ok = false;\n }\n }\n if (!ok) break;\n t = new_t;\n }\n cout << t << \"\\n\";\n cin >> r >> n;\n }\n}","accuracy":1,"time_ms":4900,"memory_kb":3516,"score_of_the_acc":-1.1834,"final_rank":15},{"submission_id":"aoj_1194_5974732","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n\ntemplate<typename F>\npair<double,double> Binary(double ok, double ng, const F &isok, int m = 200){\n for(int t = 0; t < m; t++){\n double wj = ((ok - ng)/2) + ng;\n (isok(wj)?ok : ng) = wj;\n }\n return {ok, ng};\n}\n\nnamespace geometry{\n constexpr double eps = 1e-9;\n bool eq(double a, double b){ return fabs(a - b) < eps; }\n template<typename T> bool eq(T a, T b){ return a == b; }\n bool is_zero(double a){ return fabs(a) < eps; }\n template<typename T> bool is_zero(T a){ return a == 0; }\n bool le(double a, double b){ return a <= b + eps; }\n template<typename T> bool le(T a, T b){ return a <= b; }\n bool lt(double a, double b){ return a < b - eps; }\n template<typename T> bool lt(T a, T b){ return a < b; }\n};\n\n\ntemplate<class T> struct Point{\n T x,y;\n Point(){}\n Point(T x, T y) : x(x), y(y) {}\n Point(const pair<T,T> &p) : x(p.first), y(p.second) {}\n\n Point operator*(const T b) const { return Point(x * b, y * b); }\n Point operator/(const T b) const { return Point(x / b, y / b); }\n Point operator+(const Point &b) const { return Point(x + b.x, y + b.y); }\n Point operator-(const Point &b) const { return Point(x - b.x, y - b.y); }\n Point operator*(const Point &b) const { return Point(x*b.x - y*b.y, x*b.y + y*b.x); }\n Point operator/(const Point &b) const { return Point(x*b.x + y*b.y, y*b.x - x*b.y)/(b.x*b.x + b.y*b.y); }\n\n Point &operator*=(const T b){ return (*this) = (*this) * b; }\n Point &operator/=(const T b){ return (*this) = (*this) / b; }\n Point &operator+=(const Point &b){ return (*this) = (*this) + b; }\n Point &operator-=(const Point &b){ return (*this) = (*this) - b; }\n Point &operator*=(const Point &b){ return (*this) = (*this) * b; }\n Point &operator/=(const Point &b){ return (*this) = (*this) / b; }\n \n bool operator==(const Point &b) const {\n return geometry::eq(x, b.x) && geometry::eq(y, b.y);\n }\n bool operator<(const Point &b) const { \n if(geometry::eq(x, b.x)) return y < b.y;\n return x < b.x;\n }\n T Norm() const { return x * x + y * y; }\n double Abs() const { return hypot<double>(x, y); }\n double dist(const Point &b) const { return hypot<double>(x - b.x, y - b.y); }\n double arg() const { return atan2<double>(y, x); }\n \n Point ArgVec() const {\n if((*this) == Point(0, 0)) return (*this);\n if(geometry::is_zero(x)) return Point(0, -1);\n return (*this) / gcd(x, y) * (x < 0 ? -1 : 1);\n }\n\n int ort() const {\n if(geometry::is_zero(x) && geometry::is_zero(y)) return 0;\n if(geometry::is_zero(y)) return x > 0 ? 1 : 3;\n if(geometry::is_zero(x)) return y > 0 ? 2 : 4;\n if (y > 0) return x > 0 ? 1 : 2;\n else return x > 0 ? 4 : 3;\n }\n Point rotate90() const { return Point(-y, x);}\n Point rotate180() const { return Point(-x, -y);}\n Point rotate270() const { return Point(y, -x);}\n\n Point flip_x(T p = 0) const { return Point(p*2 - x, y);}\n Point flip_y(T p = 0) const { return Point(x, p*2 - y);}\n\n Point rotate(double theta) const {\n return Point(cos(theta)*x - sin(theta)*y, sin(theta)*x + cos(theta)*y);\n }\n\n Point flip(double theta) const {\n return (*this).rotate(-theta).flip_y().rotate(theta);\n }\n\n friend ostream &operator<<(ostream &os, const Point &p) {\n return os << p.x << \" \" << p.y;\n }\n friend istream &operator>>(istream &is, Point &p) {\n T a, b; is >> a >> b;\n p = Point<T>(a, b);\n return (is);\n }\n};\n\ntemplate<typename T> Point<T> Polar(const T& rho, const T& theta = 0){\n return Point<T>(rho * cos(theta), rho * sin(theta));\n}\n\n\ntemplate<typename T> using Polygon = vector<Point<T>>;\n\ntemplate<class T> T Cross(const Point<T> &a, const Point<T> &b) { return a.x * b.y - a.y * b.x; }\n\ntemplate<class T> T Dot(const Point<T> &a, const Point<T> &b) { return a.x * b.x + a.y * b.y; }\n\ntemplate<class T> bool Intersect(const Point<T> &a, const Point<T> &b, const Point<T> &c, const Point<T> &d) {\n return (iSP(a, b, c)*iSP(a, b, d) <= 0) && (iSP(c, d, a)*iSP(c, d, b) <= 0);\n}\n\ntemplate<class T> int iSP(const Point<T> &a, const Point<T> &b, const Point<T> &c){\n T fl = Cross(b-a, c-a);\n if(geometry::lt(T(0), fl)) return 1; // CCW\n if(geometry::lt(fl, T(0))) return -1; // CW\n if(geometry::lt(T(0), Dot(b-a, c-b))) return 2; //abc\n if(geometry::lt(T(0), Dot(a-b, c-a))) return -2; //bac\n return 0; // acb\n}\n\ntemplate<class T> int angletype(const Point<T> &a, const Point<T> &b, const Point<T> &c){\n T v = Dot(a-b, c-a);\n if(geometry::is_zero(v)) return 0; // right angle\n if(v > 0) return 1; // acute angle\n return -1; // obtuse angle\n}\n\ntemplate<typename T>\nbool cmp_y(const Point<T>& p1, const Point<T> &p2){\n if(p1.y == p2.y) return p1.x < p2.x;\n return p1.y < p2.y;\n}\n\ntemplate<typename T>\nbool cmp_arg(const Point<T>& p1, const Point<T> &p2){\n if(p1.ort() != p2.ort()) return p1.ort() < p2.ort();\n return iSP(Point<T>(0,0), p1, p2) > 0;\n}\n\ntemplate<typename T>\nvoid ArgSort(Polygon<T> &ps){\n sort(begin(ps), end(ps), cmp_arg<T>);\n}\n\ntemplate<class T> struct Line{\n Point<T> a, b;\n Line() {}\n Line(const Point<T> &a, const Point<T> &b): a(a), b(b) {}\n Line(T A, T B, T C){ // Ax + By = C\n if(A == 0){ a = Point<T>(0, C/B); b = Point<T>(1, C/B); }\n else if(B == 0){ a = Point<T>(C/A, 0); b = Point<T>(C/A, 1); }\n else{ a = Point<T>(0, C/B); b = Point<T>(C/A, 0); }\n }\n //Line(const Segment<T> &s): a(s.a), b(s.b) {}\n Point<T> projection(const Point<T> &p) const {\n return a + (b - a)*Dot(p - a, b - a)/(b - a).Norm();\n }\n Point<T> reflection(const Point<T> &p) const {\n return p + (projection(p) - p)*2;\n }\n int angletype(const Line &l) const {\n if(geometry::is_zero(Cross(b-a, l.b-l.a))) return 1;\n if(geometry::is_zero(Dot(a-b, l.b-l.a))) return -1;\n return 0;\n }\n bool Intersect(const Line &l) const {\n return angletype(l) != 1;\n }\n Point<T> Cross_Point(const Line &l) const {\n if(geometry::is_zero(Cross(b-a,l.b-l.a))) return l.a;\n return (b - a)*Cross(l.a - a, l.b - l.a)/Cross(b - a,l.b - l.a) + a;\n }\n double dist(const Point<T> &p) const {\n return abs(Cross(p - a, b - a)/(b - a).Abs());\n }\n double dist(const Line &l) const {\n if(Intersect(l)) return 0;\n return dist(l.a);\n }\n};\n\ntemplate<class T> struct Segment{\n Point<T> a, b;\n Segment() {}\n Segment(const Point<T> &a, const Point<T> &b): a(a), b(b) {}\n\n double length() const { return a.dist(b); }\n bool Intersect(const Segment &s) const {\n return iSP(a, b, s.a)*iSP(a, b, s.b) <= 0 && iSP(s.a, s.b, a)*iSP(s.a, s.b, b) <= 0;\n }\n Point<T> Center() const { return (a + b) / 2; }\n Line<T> PerpBisector() const {\n Point<T> center = this->Center();\n return Line<T>((a - center).rotate90() + center, center);\n }\n int angletype(const Segment &s) const {\n if(geometry::is_zero(Cross(b-a, s.b-s.a))) return 1;\n if(geometry::is_zero(Dot(a-b, s.b-s.a))) return -1;\n return 0;\n }\n Point<T> Cross_Point(const Segment &s) const {\n if(geometry::is_zero(Cross(b-a,s.b-s.a))) return s.a;\n return (b - a)*Cross(s.a - a, s.b - s.a)/Cross(b - a, s.b - s.a) + a;\n }\n double dist(const Point<T> &p) const {\n if(Dot(b-a, p-a) < 0) return p.dist(a);\n if(Dot(a-b, p-b) < 0) return p.dist(b);\n return abs(Cross(p-a, b-a)/ (b-a).Abs());\n }\n double dist(const Segment &s) const {\n if(Intersect(s)) return 0;\n return min({dist(s.a), dist(s.b), s.dist(a), s.dist(b)});\n }\n};\n\ntemplate<typename T>\nstruct Triangle{\n Point<T> a, b, c;\n Triangle() {}\n Triangle(const Point<T> &a, const Point<T> &b, const Point<T> &c): a(a), b(b), c(c){}\n\n double angle_a() const {\n double ab = a.dist(b), bc = b.dist(c), ca = c.dist(a);\n return acos((ca*ca + ab*ab - bc*bc)/(2*ca*ab));\n }\n double angle_b() const {\n double ab = a.dist(b), bc = b.dist(c), ca = c.dist(a);\n return acos((ab*ab + bc*bc - ca*ca)/(2*ab*bc));\n }\n double angle_c() const {\n double ab = a.dist(b), bc = b.dist(c), ca = c.dist(a);\n return acos((bc*bc + ca*ca - ab*ab)/(2*bc*ca));\n }\n Point<T> divpoint(double p, double q, double r) const {\n return (a*p + b*q + c*r)/(p + q + r);\n }\n\n Point<T> centerofgravity() const {\n return (a + b + c)/3;\n }\n Point<T> circumcenter() const {\n Segment<T> s1(a, b), s2(a, c);\n return s1.PerpBisector().Cross_Point(s2.PerpBisector());\n }\n Point<T> orthocenter() const {\n return centerofgravity()*3 - circumcenter()*2;\n }\n Point<T> innercenter() const {\n return divpoint(b.dist(c), c.dist(a), a.dist(b));\n }\n Point<T> excenterA() const {\n return divpoint(-b.dist(c), c.dist(a), a.dist(b));\n }\n Point<T> excenterB() const {\n return divpoint(b.dist(c), -c.dist(a), a.dist(b));\n }\n Point<T> excenterC() const {\n return divpoint(b.dist(c), c.dist(a), -a.dist(b));\n }\n};\n\ntemplate<class T> struct Circle{\n Point<T> o;\n T r;\n Circle() {}\n Circle(const Point<T> &o, const T &r): o(o), r(r) {}\n Circle(const Point<T> &a, const Point<T> &b): o((a + b)/2), r(a.dist(b)/2) {}\n Circle(const Point<T> &a, const Point<T> &b, const Point<T> &c)\n : o(Triangle(a,b,c).circumcenter()), r(o.dist(a)) {}\n\n int Intersect(const Circle&c) const {\n if(r < c.r) return c.Intersect(*this);\n auto od = (o - c.o).Norm();\n auto ra = (r + c.r)*(r + c.r), rs = (r - c.r)*(r - c.r);\n if(geometry::lt(ra, od)) return 4;\n if(geometry::eq(ra, od)) return 3;\n if(geometry::lt(rs, od)) return 2;\n if(geometry::eq(rs, od)) return 1;\n return 0;\n }\n\n int Intersect(const Line<T> &l) const {\n double d = l.dist(o);\n if(geometry::lt<double>(d, r)) return 2;\n return geometry::eq(d, r);\n }\n\n int Contains(const Point<T> &p) const {\n auto od = (o - p).Norm();\n if(geometry::eq(od, r*r)) return 1; // on\n return (od > r*r) ? 2 : 0; // out/in\n }\n\n Polygon<T> Cross_Points(const Line<T> &l) const {\n int k = this->Intersect(l);\n if(k == 0) return {};\n Point<T> p = l.projection(o);\n if(k == 1) return {p};\n Point<T> d = (l.b - l.a)/l.a.dist(l.b);\n double base = sqrt(r*r - (p - o).Norm());\n return {p + d*base, p - d*base};\n }\n\n Polygon<T> Cross_Points(const Circle &c) const {\n int k = this->Intersect(c);\n if(k == 0 || k == 4) return {};\n double t = (c.o - o).arg();\n if(k == 1 || k == 3) return {o + Polar<T>(r, t)};\n double d = o.dist(c.o), a = acos((r*r + d*d - c.r*c.r) / (r * d * 2));\n return {o + Polar<T>(r, t + a), o + Polar<T>(r, t - a)};\n }\n\n friend ostream &operator<<(ostream &os, const Circle &c) {\n return os << c.o << \" \" << c.r;\n }\n friend istream &operator>>(istream &is, Circle &c) {\n Point<T> p; T l; is >> p >> l;\n c = Circle<T>(p, l);\n return (is);\n }\n};\n\n\n\nint main() {\n cout << fixed << setprecision(12);\n \n while(true){\n int r, n; cin >> r >> n;\n if(r+n == 0) return 0;\n\n int m = 40;\n\n vector<int> h(m);\n\n for(int i = 0; i < n; ++i){\n int l, r, y; cin >> l >> r >> y;\n for(int j = l; j < r; ++j) h[j+20] = max(h[j+20], y);\n }\n\n auto f = [&](double t){\n Point<double> c(0, t-r);\n Circle<double> sun(c, r);\n\n for(int i = 0; i < m-1; ++i){\n double y = min(h[i], h[i+1]), my = max(h[i], h[i+1]);\n double x = i - 19;\n /*\n 中心が (0, t-r) のとき, x = i-19での高さ\n //*/\n if(i-19 == r && t-r <= h[i]) continue;\n if(i-19 == -r && t-r <= h[i+1]) continue;\n\n Line<double> l(1, 0, i-19);\n auto ps = sun.Cross_Points(l);\n for(auto p : ps){\n if(p.y > y) return false;\n }\n }\n return true;\n };\n\n auto[ok,ng] = Binary(0, 40, f);\n cout << ok << \"\\n\";\n }\n}","accuracy":1,"time_ms":20,"memory_kb":3480,"score_of_the_acc":-0.4734,"final_rank":4},{"submission_id":"aoj_1194_5974620","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n\nint main() {\n cout << fixed << setprecision(12);\n \n while(true){\n int r, n; cin >> r >> n;\n if(r+n == 0) return 0;\n\n int m = 40;\n\n vector<int> h(m);\n\n for(int i = 0; i < n; ++i){\n int l, r, y; cin >> l >> r >> y;\n for(int j = l; j < r; ++j) h[j+20] = max(h[j+20], y);\n }\n bool fl = true;\n double t = 0;\n while(fl){\n t += 0.0001;\n for(int i = 0; i < m-1; ++i){\n int y = min(h[i], h[i+1]);\n int x = i - 19;\n\n if(hypot(x, y+r-t) < r) fl = false;\n }\n \n }\n t -= -0.0001;\n cout << t << \"\\n\";\n }\n}","accuracy":1,"time_ms":3940,"memory_kb":3556,"score_of_the_acc":-1.0908,"final_rank":14},{"submission_id":"aoj_1194_5274387","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for(int i = 0; i < (n); ++i)\n\ndouble p(double a) { return a * a; }\n\nbool solve() {\n int rad, n;\n cin >> rad >> n;\n if(rad + n == 0) return false;\n\n map<int, int> mp;\n for(int x = -30; x < 30; ++x) mp[x] = rad;\n rep(_, n) {\n int l, r, h;\n cin >> l >> r >> h;\n for(int i = l; i < r; ++i) {\n mp[i] = max(mp[i], h + rad);\n }\n }\n\n double t = 0, d = 0.0001;\n for(bool ng = false; ng == false && t < 30; t += d) {\n for(auto &[x, h] : mp) if(p(x) + p(t - h) < p(rad)) ng = true;\n for(auto &[x, h] : mp) if(p(x + 1) + p(t - h) < p(rad)) ng = true;\n }\n cout << fixed << setprecision(10) << t - d << '\\n';\n return true;\n}\n\nint main() {\n while(solve());\n return 0;\n}","accuracy":1,"time_ms":5050,"memory_kb":3576,"score_of_the_acc":-1.2641,"final_rank":17},{"submission_id":"aoj_1194_5041185","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define INF_LL (int64)1e18\n#define INF (int32)1e9\n#define REP(i, n) for(int64 i = 0;i < (n);i++)\n#define FOR(i, a, b) for(int64 i = (a);i < (b);i++)\n#define all(x) x.begin(),x.end()\n#define fs first\n#define sc second\n\nusing int32 = int_fast32_t;\nusing uint32 = uint_fast32_t;\nusing int64 = int_fast64_t;\nusing uint64 = uint_fast64_t;\nusing PII = pair<int32, int32>;\nusing PLL = pair<int64, int64>;\n\nconst double eps = 1e-10;\n\ntemplate<typename A, typename B>inline void chmin(A &a, B b){if(a > b) a = b;}\ntemplate<typename A, typename B>inline void chmax(A &a, B b){if(a < b) a = b;}\n\ntemplate<typename T>\nvector<T> make_v(size_t a){return vector<T>(a);}\n\ntemplate<typename T,typename... Ts>\nauto make_v(size_t a,Ts... ts){\n\treturn vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));\n}\n\ntemplate<typename T,typename U,typename... V>\ntypename enable_if<is_same<T, U>::value!=0>::type\nfill_v(U &u,const V... v){u=U(v...);}\n\ntemplate<typename T,typename U,typename... V>\ntypename enable_if<is_same<T, U>::value==0>::type\nfill_v(U &u,const V... v){\n\tfor(auto &e:u) fill_v<T>(e,v...);\n}\n\ntemplate <typename F>\nclass\nFixPoint : private F\n{\npublic:\n explicit constexpr FixPoint(F&& f) noexcept\n : F{std::forward<F>(f)}\n {}\n\n template <typename... Args>\n constexpr decltype(auto)\n operator()(Args&&... args) const\n {\n return F::operator()(*this, std::forward<Args>(args)...);\n }\n}; // class FixPoint\n\n\nnamespace\n{\n template <typename F>\n inline constexpr decltype(auto)\n makeFixPoint(F&& f) noexcept\n {\n return FixPoint<F>{std::forward<F>(f)};\n }\n} // namespace\n\ntemplate<typename T>\nclass Matrix{\nprivate:\n using size_type = ::std::size_t;\n using Row = ::std::vector<T>;\n using Mat = ::std::vector<Row>;\n\n size_type R, C; // row, column\n Mat A;\n\n void add_row_to_another(size_type r1, size_type r2, const T k){ // Row(r1) += Row(r2)*k\n for(size_type i = 0;i < C;i++)\n A[r1][i] += A[r2][i]*k;\n }\n\n void scalar_multiply(size_type r, const T k){\n for(size_type i = 0;i < C;i++)\n A[r][i] *= k;\n }\n\n void scalar_division(size_type r, const T k){\n for(size_type i = 0;i < C;i++)\n A[r][i] /= k;\n }\n\npublic:\n Matrix(){}\n Matrix(size_type r, size_type c) : R(r), C(c), A(r, Row(c)) {}\n Matrix(const Mat &m) : R(m.size()), C(m[0].size()), A(m) {}\n Matrix(const Mat &&m) : R(m.size()), C(m[0].size()), A(m) {}\n Matrix(const Matrix<T> &m) : R(m.R), C(m.C), A(m.A) {}\n Matrix(const Matrix<T> &&m) : R(m.R), C(m.C), A(m.A) {}\n Matrix<T> &operator=(const Matrix<T> &m){\n R = m.R; C = m.C; A = m.A;\n return *this;\n }\n Matrix<T> &operator=(const Matrix<T> &&m){\n R = m.R; C = m.C; A = m.A;\n return *this;\n }\n static Matrix I(const size_type N){\n Matrix m(N, N);\n for(size_type i = 0;i < N;i++) m[i][i] = 1;\n return m;\n }\n\n const Row& operator[](size_type k) const& { return A.at(k); }\n Row& operator[](size_type k) & { return A.at(k); }\n Row operator[](size_type k) const&& { return ::std::move(A.at(k)); }\n\n size_type row() const { return R; } // the number of rows\n size_type column() const { return C; }\n\n T determinant(){\n assert(R == C);\n Mat tmp = A;\n T res = 1;\n for(size_type i = 0;i < R;i++){\n for(size_type j = i;j < R;j++){ // satisfy A[i][i] > 0\n if (A[j][i] != 0) {\n if (i != j) res *= -1;\n swap(A[j], A[i]);\n break;\n }\n }\n if (A[i][i] == 0) return 0;\n res *= A[i][i];\n scalar_division(i, A[i][i]);\n for(size_type j = i+1;j < R;j++){\n add_row_to_another(j, i, -A[j][i]);\n }\n }\n swap(tmp, A);\n return res;\n }\n\n Matrix inverse(){\n assert(R == C);\n assert(determinant() != 0);\n Matrix inv(Matrix::I(R)), tmp(*this);\n for(size_type i = 0;i < R;i++){\n for(size_type j = i;j < R;j++){\n if (A[j][i] != 0) {\n swap(A[j], A[i]);\n swap(inv[j], inv[i]);\n break;\n }\n }\n inv.scalar_division(i, A[i][i]);\n scalar_division(i, A[i][i]);\n for(size_type j = 0;j < R;j++){\n if(i == j) continue;\n inv.add_row_to_another(j, i, -A[j][i]);\n add_row_to_another(j, i, -A[j][i]);\n }\n }\n (*this) = tmp;\n return inv;\n }\n\n Matrix& operator+=(const Matrix &B){\n assert(column() == B.column() && row() == B.row());\n for(size_type i = 0;i < R;i++)\n for(size_type j = 0;j < C;j++)\n (*this)[i][j] += B[i][j];\n return *this;\n }\n\n Matrix& operator-=(const Matrix &B){\n assert(column() == B.column() && row() == B.row());\n for(size_type i = 0;i < R;i++)\n for(size_type j = 0;j < C;j++)\n (*this)[i][j] -= B[i][j];\n return *this;\n }\n\n Matrix& operator*=(const Matrix &B){\n assert(column() == B.row());\n Matrix M(R, B.column());\n for(size_type i = 0;i < R;i++) {\n for(size_type j = 0;j < B.column();j++) {\n M[i][j] = 0;\n for(size_type k = 0;k < C;k++) {\n M[i][j] += (*this)[i][k] * B[k][j];\n }\n }\n }\n swap(M, *this);\n return *this;\n }\n\n Matrix& operator/=(const Matrix &B){\n assert(C == B.row());\n Matrix M(B);\n (*this) *= M.inverse();\n return *this;\n }\n\n Matrix operator+(const Matrix &B) const { return (Matrix(*this) += B); }\n Matrix operator-(const Matrix &B) const { return (Matrix(*this) -= B); }\n Matrix operator*(const Matrix &B) const { return (Matrix(*this) *= B); }\n Matrix operator/(const Matrix &B) const { return (Matrix(*this) /= B); }\n\n bool operator==(const Matrix &B) const {\n if (column() != B.column() || row() != B.row()) return false;\n for(size_type i = 0;i < row();i++)\n for(size_type j = 0;j < column();j++)\n if ((*this)[i][j] != B[i][j]) return false;\n return true;\n }\n bool operator!=(const Matrix &B) const { return !((*this) == B); }\n\n Matrix pow(size_type k, int64 m){\n assert(R == C);\n Matrix M(Matrix::I(R));\n while(k){\n if (k & 1) M *= (*this);\n k >>= 1;\n (*this) *= (*this);\n REP(i, R) {\n REP(j, C) {\n A[i][j] %= m;\n M[i][j] %= m;\n }\n }\n }\n A.swap(M.A);\n return *this;\n }\n\n friend ::std::ostream &operator<<(::std::ostream &os, Matrix &p){\n for(size_type i = 0;i < p.row();i++){\n for(size_type j = 0;j < p.column();j++){\n os << p[i][j] << \" \";\n }\n os << ::std::endl;\n }\n return os;\n }\n};\n\nint main(void) {\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n int64 n, r;\n while (cin >> r >> n && r + n) {\n vector<int64> h(41, 0);\n REP(i, n) {\n int64 xl, xr, hi;\n cin >> xl >> xr >> hi;\n FOR(j, xl+20, xr+20) {\n chmax(h[j], hi);\n }\n }\n\n auto ok = [&](double x) {\n REP(j, 40) {\n double offl = j - 20, offr = j - 19;\n if (j-19 <= -r || r <= j-20) continue;\n double hmax = x + r * max(sin(atan2(sqrt(r * r - offl * offl), offl)), sin(atan2(sqrt(r * r - offr * offr), offr)));\n if (hmax > h[j]) return false;\n }\n return true;\n };\n double lo = -r, hi = 21, mi;\n REP(i, 100) {\n mi = (lo + hi) / 2;\n if (ok(mi)) lo = mi;\n else hi = mi;\n }\n cout << fixed << setprecision(10) << lo + r << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":4008,"score_of_the_acc":-1,"final_rank":12},{"submission_id":"aoj_1194_4968746","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)\n#define rrep(i,n) for(int (i)=((n)-1);(i)>=0;(i)--)\n#define itn int\n#define miele(v) min_element(v.begin(), v.end())\n#define maele(v) max_element(v.begin(), v.end())\n#define SUM(v) accumulate(v.begin(), v.end(), 0LL)\n#define lb(a, key) lower_bound(a.begin(),a.end(),key)\n#define ub(a, key) upper_bound(a.begin(),a.end(),key)\n#define COUNT(a, key) count(a.begin(), a.end(), key) \n#define BITCOUNT(x) __builtin_popcount(x)\n#define pb push_back\n#define all(x) (x).begin(),(x).end()\n#define F first\n#define S second\nusing P = pair <int,int>;\nusing WeightedGraph = vector<vector <P>>;\nusing UnWeightedGraph = vector<vector<int>>;\nusing Real = long double;\nusing Point = complex<Real>; //Point and Vector2d is the same!\nusing Vector2d = complex<Real>;\nconst long long INF = 1LL << 60;\nconst int MOD = 1000000007;\nconst double EPS = 1e-15;\nconst double PI=3.14159265358979323846;\ntemplate <typename T> \nint getIndexOfLowerBound(vector <T> &v, T x){\n return lower_bound(v.begin(),v.end(),x)-v.begin();\n}\ntemplate <typename T> \nint getIndexOfUpperBound(vector <T> &v, T x){\n return upper_bound(v.begin(),v.end(),x)-v.begin();\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; }\n#define DUMPOUT cerr\n#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)\nistream &operator>>(istream &is, Point &p) {\n Real a, b; is >> a >> b; p = Point(a, b); return is;\n}\ntemplate <typename T, typename U>\nistream &operator>>(istream &is, pair<T,U> &p_var) {\n is >> p_var.first >> p_var.second;\n return is;\n}\ntemplate <typename T>\nistream &operator>>(istream &is, vector<T> &vec) {\n for (T &x : vec) is >> x;\n return is;\n}\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, pair<T, U> &pair_var) {\n DUMPOUT<<'{';\n os << pair_var.first;\n DUMPOUT<<',';\n os << \" \"<< pair_var.second;\n DUMPOUT<<'}';\n return os;\n}\ntemplate <typename T>\nostream &operator<<(ostream &os, vector<T> &vec) {\n DUMPOUT<<'[';\n for (int i = 0; i < vec.size(); i++) \n os << vec[i] << (i + 1 == vec.size() ? \"\" : \" \");\n DUMPOUT<<']';\n return os;\n}\ntemplate <typename T>\nostream &operator<<(ostream &os, vector<vector<T>> &df) {\n for (auto& vec : df) os<<vec;\n return os;\n}\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, map<T, U> &map_var) {\n DUMPOUT << \"{\";\n repi(itr, map_var) {\n os << *itr;\n itr++;\n if (itr != map_var.end()) DUMPOUT << \", \";\n itr--;\n }\n DUMPOUT << \"}\";\n return os;\n}\ntemplate <typename T>\nostream &operator<<(ostream &os, set<T> &set_var) {\n DUMPOUT << \"{\";\n repi(itr, set_var) {\n os << *itr;\n itr++;\n if (itr != set_var.end()) DUMPOUT << \", \";\n itr--;\n }\n DUMPOUT << \"}\";\n return os;\n}\nvoid print() {cout << endl;}\ntemplate <class Head, class... Tail>\nvoid print(Head&& head, Tail&&... tail) {\n cout << head;\n if (sizeof...(tail) != 0) cout << \" \";\n print(forward<Tail>(tail)...);\n}\nvoid dump_func() {DUMPOUT << '#'<<endl;}\ntemplate <typename Head, typename... Tail>\nvoid dump_func(Head &&head, Tail &&... tail) {\n DUMPOUT << head;\n if (sizeof...(Tail) > 0) DUMPOUT << \", \";\n dump_func(std::move(tail)...);\n}\n#ifdef DEBUG_\n#define DEB\n#define dump(...) \\\n DUMPOUT << \" \" << string(#__VA_ARGS__) << \": \" \\\n << \"[\" << to_string(__LINE__) << \":\" << __FUNCTION__ << \"]\" \\\n << endl \\\n << \" \", \\\n dump_func(__VA_ARGS__)\n#else\n#define DEB if (false)\n#define dump(...)\n#endif\n\nint main(void) { cin.tie(0); ios::sync_with_stdio(false);\n while(1){\n double r; int n; \n cin>>r>>n;\n if(r == 0 && n == 0) exit(0);\n vector <tuple <double,double,double>> p(n);\n double d = (r+r)/100000;\n for(int i=0;i<n;i++){\n int x1, x2, h;\n cin>>x1>>x2>>h;\n p[i] = {x1, x2, h};\n }\n double ans = 1145141919;\n for(double i=-r;i<=r;i+=d){\n double height = 0;\n for(int j=0;j<n;j++){\n if(get <0>(p[j]) <= i && get <1>(p[j]) >= i) chmax(height, get <2>(p[j]));\n }\n chmin(ans, height - (sqrt(r*r - i*i) - r));\n }\n printf(\"%.4f\\n\", ans);\n }\n}","accuracy":1,"time_ms":110,"memory_kb":3532,"score_of_the_acc":-0.5378,"final_rank":7},{"submission_id":"aoj_1194_4958010","code_snippet":"#include <bits/stdc++.h>\n\n#define rep(i, n) for(int i = 0; i < n; i++)\nusing namespace std;\n\ntypedef long long ll;\n\nconst int INF = 1 << 30;\nconst ll LLINF = 1LL << 62;\n\nconst double eps = 0.00001;\n\nint mod = 1000000007;\n\ndouble deg_to_rad(double deg){\n return deg * M_PI / 180;\n}\n\ndouble calcheight(vector<pair<pair<double, double>, double>>& towers, double x){\n double ret = 0;\n rep(i, towers.size()){\n if(towers[i].first.first <= x && x <= towers[i].first.second) ret = max(ret, towers[i].second);\n }\n return ret;\n}\n\nint main(void){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n vector<double> ans;\n while(true){\n double R; int N; cin >> R >> N;\n if(R <= 0 && N == 0) break;\n vector<pair<pair<double, double>, double>> towers(N);\n rep(i, N) cin >> towers[i].first.first >> towers[i].first.second >> towers[i].second;\n double ok = 0, ng = 1000;\n double m = (ok+ng)/2;\n while(abs(ok-ng) > eps){\n double c = m - R;\n double inc = 0.002;\n double nowDeg = 0;\n bool hide = true;\n\n while(nowDeg <= 180){\n bool res;\n double x = R * cos(deg_to_rad(nowDeg));\n double y = m - R + R * sin(deg_to_rad(nowDeg));\n double height = calcheight(towers, x);\n\n //cout << \"deg: \" << nowDeg << \", \" << y << \" \" << height << endl;\n if(height < y){\n hide = false;\n break;\n }\n nowDeg += inc;\n }\n if(hide) ok = m;\n else ng = m;\n m = (ok+ng)/2;\n }\n ans.push_back(ok);\n }\n rep(i, ans.size()) printf(\"%.6f\\n\", ans[i]);\n return 0;\n}","accuracy":1,"time_ms":4840,"memory_kb":3836,"score_of_the_acc":-1.4951,"final_rank":18}],"string":"[\n {\n \"submission_id\": \"aoj_1194_10850501\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cmath>\\n#include <algorithm>\\n#include <vector>\\n\\nusing namespace std;\\n\\nconst double EPS = 1e-9;\\nbool EQ(double a, double b) { return abs(a - b) < EPS; }\\n\\ndouble getHeight(double r, double x) {\\n\\treturn sqrt(r * r - x * x);\\n}\\n\\nint main(void) {\\n\\tint r, n;\\n\\tint T = 0;\\n\\twhile(scanf(\\\"%d %d\\\", &r, &n), r > 0) {\\n\\t\\tT++;\\n\\t\\tint left[20], right[20], height[20];\\n\\t\\tfor(int i = 0; i < n; i++) {\\n\\t\\t\\tscanf(\\\"%d %d %d\\\", left + i, right + i, height + i);\\n\\t\\t}\\n\\n\\t\\tvector<double> xs;\\n\\t\\tconst double GAPEPS = 1e-7;\\n\\t\\txs.push_back(-r + GAPEPS);\\n\\t\\txs.push_back(r - GAPEPS);\\n\\t\\txs.push_back(r);\\n\\t\\txs.push_back(-r);\\n\\t\\tfor(int i = 0; i < n; i++) {\\n\\t\\t\\tdouble cand = left[i] - GAPEPS;\\n\\t\\t\\tif(-r <= cand and cand <= r) xs.push_back(cand);\\n\\t\\t\\tcand = left[i] + GAPEPS;\\n\\t\\t\\tif(-r <= cand and cand <= r) xs.push_back(cand);\\n\\t\\t\\tcand = right[i] - GAPEPS;\\n\\t\\t\\tif(-r <= cand and cand <= r) xs.push_back(cand);\\n\\t\\t\\tcand = right[i] + GAPEPS;\\n\\t\\t\\tif(-r <= cand and cand <= r) xs.push_back(cand);\\n\\t\\t\\tcand = left[i];\\n\\t\\t\\tif(-r <= cand and cand <= r) xs.push_back(cand);\\n\\t\\t\\tcand = right[i];\\n\\t\\t\\tif(-r <= cand and cand <= r) xs.push_back(cand);\\n\\t\\t}\\n\\t\\tfor(int i = 1; i < 10001; i++) xs.push_back(-r + 2 * r / 10001.0 * i);\\n\\n\\t\\tsort(xs.begin(), xs.end());\\n\\n\\t\\tdouble s = 0, e = 100;\\n\\t\\tfor(int lv = 0; lv < 100; lv++) {\\n\\t\\t\\tdouble mid = (s + e) / 2;\\n\\t\\t\\tbool isAble = true;\\n\\n\\t\\t\\tfor(double x: xs) {\\n\\t\\t\\t\\tbool isIncluded = false;\\n\\n\\t\\t\\t\\tdouble curHeight = getHeight(r, x) - r + mid;\\n\\t\\t\\t\\tif(curHeight <= 0 or EQ(curHeight, 0)) continue;\\n\\t\\t\\t\\tfor(int i = 0; i < n; i++)\\n\\t\\t\\t\\t\\tif(left[i] <= x and x <= right[i] and height[i] > curHeight and !EQ(height[i], curHeight)) {\\n\\t\\t\\t\\t\\t\\tisIncluded = true;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(!isIncluded) {\\n\\t\\t\\t\\t\\tisAble = false;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(isAble) s = mid;\\n\\t\\t\\telse e = mid;\\n\\t\\t}\\n\\n\\t\\tprintf(\\\"%.4lf\\\\n\\\", s);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 630,\n \"memory_kb\": 3008,\n \"score_of_the_acc\": -0.0856,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1194_10607261\",\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\\nbl solve()\\n{\\n ll r, n;\\n cin >> r >> n;\\n if (n == 0 && r == 0)\\n return 0;\\n vl xl(n), xr(n), h(n);\\n rep(i, n)\\n {\\n cin >> xl[i] >> xr[i] >> h[i];\\n }\\n // すべてのありうる頂点に対して全探索\\n // vl maxH(41);\\n // rep(i, n)\\n // {\\n // if(xl[i]<0){\\n // xl[i]--;\\n // }\\n // if(xr[i]<0){\\n // xr[i]--;\\n // }\\n // for (ll j = xl[i] + 1; j <= xr[i]; j++)\\n // {\\n // maxH[j+20] = max(maxH[j+20],h[i]);\\n // }\\n // }\\n // debug_vc(maxH);\\n // maxH[20] = min(maxH[19],maxH[21]);\\n set<P> coord;\\n set<P> isRight;\\n set<P> isLeft;\\n for (ll x = -20; x <= 20; x++)\\n {\\n for (ll y = 0; y <= 20; y++)\\n {\\n coord.insert({x, y});\\n }\\n }\\n rep(i, n)\\n {\\n for (ll x = xl[i] + 1; x < xr[i]; x++)\\n {\\n for (ll y = 0; y < h[i]; y++)\\n {\\n coord.erase({x, y});\\n }\\n }\\n for (ll y = 0; y < h[i]; y++)\\n {\\n isLeft.insert({xl[i], y});\\n isRight.insert({xr[i], y});\\n }\\n }\\n for (ll x = -20; x <= 20; x++)\\n {\\n for (ll y = 0; y <= 20; y++)\\n {\\n if (isRight.count({x, y}) && isLeft.count({x, y}))\\n coord.erase({x, y});\\n }\\n }\\n // for (ll x = -2; x <= 2; x++)\\n // {\\n // for (ll y = 0; y <= 4; y++)\\n // {\\n // if (coord.count({x,y})){\\n // cout << x << y << endl;\\n // }\\n // }\\n // }\\n ld ans = 1e4;\\n for (auto [x, y] : coord)\\n {\\n // debug_x(x);\\n // debug_x(y);\\n if (x <= -r || r <= x)\\n continue;\\n ans = min((ld)y - sqrt(r * r - x * x), ans);\\n }\\n cout << fixed << setprecision(10) << ans + r << endl;\\n return 1;\\n}\\n\\nsigned main()\\n{\\n ios_base::sync_with_stdio(false);\\n cin.tie(nullptr);\\n while (true)\\n {\\n if (!solve())\\n break;\\n }\\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\": 10,\n \"memory_kb\": 3508,\n \"score_of_the_acc\": -0.5,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1194_9259676\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nconst int MAX = 1000000005;\\n\\nbool solve() {\\n int r, n;\\n cin >> r >> n;\\n if (r == 0 && n == 0) return false;\\n vector<tuple<int, int, int>> rect(n);\\n for (int i = 0; i < n; i++) {\\n int xl, xr, h;\\n cin >> xl >> xr >> h;\\n rect[i] = {xl, xr, h};\\n }\\n double ans = 1e+10;\\n for (int i = 1; i < 100000; i++) {\\n double x = r*cos(i*M_PI/100000), y = r*sin(i*M_PI/100000);\\n int maxh = 0;\\n for (int j = 0; j < n; j++) {\\n auto [xl, xr, h] = rect[j];\\n if (x >= (double)xl && x <= (double)xr) {\\n maxh = max(maxh, h);\\n }\\n }\\n ans = min(ans, r + maxh - y);\\n }\\n cout << fixed << setprecision(10) << ans << endl;\\n\\n return true;\\n}\\n\\nint main() {\\n ios::sync_with_stdio(0); cin.tie();\\n while (solve()) {}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 380,\n \"memory_kb\": 3688,\n \"score_of_the_acc\": -0.7311,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1194_8007092\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long;\\nusing vi = vector<int>;\\nusing vvi = vector<vi>;\\nusing vl = vector<ll>;\\nusing vvl = vector<vl>;\\nusing vb = vector<bool>;\\nusing vvb = vector<vb>;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\n#define rep(i, s, n) for(int i = (int)(s); i < (int)(n); ++i)\\n\\nll INF = 1ll << 60;\\n\\nlong double solve(long double cy, int dr, int x){\\n if(abs(x) == dr){\\n return -1;\\n }\\n long double r = dr;\\n long double x1 = x, x2 = x;\\n long double cx = 0;\\n long double y1 = 0;\\n long double y2 = 1;\\n long double xd = x2 - x1, yd = y2 - y1;\\n long double X = x1 - cx, Y = y1 - cy;\\n long double a = xd*xd + yd*yd;\\n long double b = xd * X + yd * Y;\\n long double c = X*X + Y*Y - r*r;\\n // D = 0の時は1本で、D < 0の時は存在しない\\n long double D = b*b - a*c;\\n if(D <= 0){\\n return -1;\\n }\\n long double s1 = (-b + sqrt(D)) / a;\\n long double s2 = (-b - sqrt(D)) / a;\\n return max(y1 + yd*s1, y1 + yd*s2);\\n}\\n\\nint main(){\\n vector<long double> ret;\\n while(true){\\n int r, n;\\n cin >> r >> n;\\n if(r == n && r == 0){\\n break;\\n }\\n vi xl(n), xr(n), h(n);\\n rep(i, 0, n){\\n cin >> xl[i] >> xr[i] >> h[i];\\n }\\n map<pii, int> mx;\\n rep(i, 0, n){\\n rep(l, xl[i], xr[i]){\\n if(!mx.count({l,l+1})){\\n mx[{l,l+1}] = h[i];\\n }\\n else{\\n mx[{l,l+1}] = max(mx[{l,l+1}], h[i]);\\n }\\n }\\n }\\n rep(i, -30, 30){\\n if(!mx.count({i, i+1})){\\n mx[{i,i+1}] = 0;\\n }\\n //cout << mx[{i,i+1}] << \\\" \\\";\\n }\\n //cout << endl;\\n\\n long double ans = 0;\\n bool ck = true;\\n\\n rep(time, 0, 300000){\\n long double t = 1.0*time/10000;\\n rep(x, -r-1, r+2){\\n if(solve(t-r, r, x) > 0 || solve(t-r, r, x+1) > 0){\\n long double mxh = max(solve(t-r, r, x), solve(t-r, r, x+1));\\n if(mxh > mx[{x,x+1}]){\\n ck = false;\\n /*\\n cout << t << \\\"/\\\" << x << endl;\\n cout << solve(t-r, r, x) <<\\\" \\\" << solve(t-r, r, x+1) << endl;\\n */\\n }\\n }\\n }\\n if(ck){\\n ans = t;\\n }\\n else{\\n break;\\n }\\n }\\n ret.push_back(ans);\\n }\\n\\n cout << fixed << setprecision(10);\\n for(auto r : ret){\\n cout << r << endl;\\n }\\n \\n return 0;\\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 7250,\n \"memory_kb\": 3512,\n \"score_of_the_acc\": -1.504,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1194_8007084\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long;\\nusing vi = vector<int>;\\nusing vvi = vector<vi>;\\nusing vl = vector<ll>;\\nusing vvl = vector<vl>;\\nusing vb = vector<bool>;\\nusing vvb = vector<vb>;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\n#define rep(i, s, n) for(int i = (int)(s); i < (int)(n); ++i)\\n\\nll INF = 1ll << 60;\\n\\nlong double solve(long double cy, int dr, int x){\\n if(abs(x) == dr){\\n return -1;\\n }\\n long double r = dr;\\n long double x1 = x, x2 = x;\\n long double cx = 0;\\n long double y1 = 0;\\n long double y2 = 1;\\n long double xd = x2 - x1, yd = y2 - y1;\\n long double X = x1 - cx, Y = y1 - cy;\\n long double a = xd*xd + yd*yd;\\n long double b = xd * X + yd * Y;\\n long double c = X*X + Y*Y - r*r;\\n // D = 0の時は1本で、D < 0の時は存在しない\\n long double D = b*b - a*c;\\n if(D <= 0){\\n return -1;\\n }\\n long double s1 = (-b + sqrt(D)) / a;\\n long double s2 = (-b - sqrt(D)) / a;\\n return max(y1 + yd*s1, y1 + yd*s2);\\n}\\n\\nint main(){\\n vector<long double> ret;\\n while(true){\\n int r, n;\\n cin >> r >> n;\\n if(r == n && r == 0){\\n break;\\n }\\n vi xl(n), xr(n), h(n);\\n rep(i, 0, n){\\n cin >> xl[i] >> xr[i] >> h[i];\\n }\\n map<pii, int> mx;\\n rep(i, 0, n){\\n rep(l, xl[i], xr[i]){\\n if(!mx.count({l,l+1})){\\n mx[{l,l+1}] = h[i];\\n }\\n else{\\n mx[{l,l+1}] = max(mx[{l,l+1}], h[i]);\\n }\\n }\\n }\\n rep(i, -30, 30){\\n if(!mx.count({i, i+1})){\\n mx[{i,i+1}] = 0;\\n }\\n //cout << mx[{i,i+1}] << \\\" \\\";\\n }\\n //cout << endl;\\n\\n long double ans = 0;\\n bool ck = true;\\n\\n rep(time, 1, 300000){\\n long double t = 1.0*time/10000;\\n long double dx;\\n if(t > 2*r){\\n dx = r;\\n }\\n else{\\n dx = sqrt(2*t*r-t*t);\\n }\\n rep(x, ceil(-dx-2), dx+3){\\n if(solve(t-r, r, x) > 0 || solve(t-r, r, x+1) > 0){\\n long double mxh = max(solve(t-r, r, x), solve(t-r, r, x+1));\\n if(mxh > mx[{x,x+1}]){\\n ck = false;\\n /*\\n cout << t << \\\"/\\\" << x << endl;\\n cout << solve(t-r, r, x) <<\\\" \\\" << solve(t-r, r, x+1) << endl;\\n */\\n }\\n }\\n }\\n if(ck){\\n ans = t;\\n }\\n else{\\n break;\\n }\\n }\\n ret.push_back(ans);\\n }\\n\\n cout << fixed << setprecision(10);\\n for(auto r : ret){\\n cout << r << endl;\\n }\\n \\n return 0;\\n \\n}\",\n \"accuracy\": 0.5,\n \"time_ms\": 6750,\n \"memory_kb\": 3404,\n \"score_of_the_acc\": -1.3269,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1194_8002427\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nbool solve() {\\n int n;\\n double r;\\n cin >> r >> n;\\n if( abs(r) < 1e-3 ) return false;\\n vector<pair<int, int>> event;\\n for( int i = 0; i < n; i++ ) {\\n int xl, xr, h;\\n cin >> xl >> xr >> h;\\n event.push_back(make_pair(xl, -h));\\n event.push_back(make_pair(xr, h));\\n }\\n sort(event.begin(), event.end());\\n vector<pair<int, int>> boundary;\\n multiset<int> Sh;\\n Sh.insert(0);\\n boundary.push_back(make_pair(-40, 0));\\n for( int i = 0; i < event.size(); i++ ) {\\n int h_pre = *Sh.rbegin();\\n auto [x, h] = event[i];\\n if( h > 0 ) {\\n Sh.erase(Sh.find(h));\\n }else {\\n Sh.insert(-h);\\n }\\n int h_cur = *Sh.rbegin();\\n boundary.push_back(make_pair(x, h_pre));\\n boundary.push_back(make_pair(x, h_cur));\\n }\\n boundary.push_back(make_pair(40, 0));\\n double t = 0, step = 0.0001;\\n auto dist = [&](double xl, double yl, double xr, double yr) -> double {\\n if( xl > xr ) swap(xl, xr);\\n if( yl > yr ) swap(yl, yr);\\n if( xl == xr ) {\\n double dy = max({0.0, yl-(-r+t), (-r+t)-yr});\\n return hypot(xl, dy);\\n }else {\\n double dx = max({0.0, xl, -xr});\\n return hypot(dx, yl-(-r+t));\\n }\\n };\\n for( ; ; t+=step ) {\\n bool is_covered = true;\\n for( int i = 0; i < boundary.size()-1; i++ ) {\\n auto [xl, yl] = boundary[i];\\n auto [xr, yr] = boundary[i+1];\\n if( dist(xl, yl, xr, yr) < r ) is_covered = false;\\n }\\n if( !is_covered ) break;\\n }\\n cout << fixed << setprecision(8) << t-step << endl;\\n return true;\\n}\\nint main() {\\n while( solve() ) {}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5690,\n \"memory_kb\": 3472,\n \"score_of_the_acc\": -1.2485,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1194_7952406\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nbool solve() {\\n int r, n;\\n cin >> r >> n;\\n if (r == 0 && n == 0) return false;\\n set<pair<int, int>> s;\\n for (int i = 0; i < n; i++) {\\n int l, r, h;\\n cin >> l >> r >> h;\\n for (int j = l; j < r; j++) {\\n for (int k = 0; k < h; k++) {\\n s.emplace(j, k);\\n }\\n }\\n }\\n long double ans = 1e18;\\n for (int x = -r + 1; x < r; x++) {\\n for (int y = 0; y <= 30; y++) {\\n long double dy = y - (sqrtl(r * r - x * x) - r);\\n if (s.count(make_pair(x, y)) == 0 || s.count(make_pair(x - 1, y)) == 0) {\\n ans = std::min(ans, dy);\\n }\\n }\\n }\\n cout << fixed << setprecision(10); \\n cout << ans << '\\\\n';\\n return true;\\n}\\n\\nint main() {\\n while (solve()) ; \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3424,\n \"score_of_the_acc\": -0.416,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1194_7909704\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\nusing ull = unsigned long long;\\ntypedef pair<ll,ll> pll;\\ntypedef vector<ll> vll;\\ntypedef vector<pll> vpll;\\ntemplate<class T> using pqmin = priority_queue<T, vector<T>, greater<T>>;\\ntemplate<class T> using pqmax = priority_queue<T>;\\nconst ll inf=LLONG_MAX/3;\\nconst ll dx[] = {0, 1, 0, -1, 1, -1, 1, -1};\\nconst ll dy[] = {1, 0, -1, 0, 1, 1, -1, -1};\\n#define mp make_pair\\n#define pb push_back\\n#define eb emplace_back\\n#define fi first\\n#define se secondf\\n#define all(x) x.begin(),x.end()\\n#define si(x) ll(x.size())\\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 rng(i,l,r) for(ll i=l;i<r;i++)\\n#define gnr(i,l,r) for(ll i=r-1;i>=l;i--)\\n#define fore(i, a) for(auto &&i : a)\\n#define fore2(a, b, v) for(auto &&[a, b] : v)\\n#define fore3(a, b, c, v) for(auto &&[a, b, c] : v)\\ntemplate<class T> bool chmin(T& a, const T& b){ if(a <= b) return 0; a = b; return 1; }\\ntemplate<class T> bool chmax(T& a, const T& b){ if(a >= b) return 0; a = b; return 1; }\\ntemplate<class T, class U> bool chmin(T& a, const U& b){ return chmin(a, (T)b); }\\ntemplate<class T, class U> bool chmax(T& a, const U& b){ return chmax(a, (T)b); }\\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\\n#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)\\n#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)\\n#define vec(type,name,...) vector<type>name(__VA_ARGS__)\\n#define VEC(type,name,size) vector<type>name(size);in(name)\\n#define VLL(name,size) vector<ll>name(size);in(name)\\n#define vv(type,name,h,...) vector<vector<type>> name(h,vector<type>(__VA_ARGS__))\\n#define VV(type,name,h,w) vector<vector<type>> name(h,vector<type>(w));in(name)\\n#define vvv(type,name,h,w,...) vector<vector<vector<type>>> name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\\n#define SUM(...) accumulate(all(__VA_ARGS__),0LL)\\ntemplate<class T> auto min(const T& a){ return *min_element(all(a)); }\\ntemplate<class T> auto max(const T& a){ return *max_element(all(a)); }\\ntemplate<class T, class F = less<>> void sor(T& a, F b = F{}){ sort(all(a), b); }\\ntemplate<class T> void uniq(T& a){ sor(a); a.erase(unique(all(a)), end(a)); }\\nvoid outb(bool x){cout<<(x?\\\"Yes\\\":\\\"No\\\")<<\\\"\\\\n\\\";}\\nll max(int x, ll y) { return max((ll)x, y); }\\nll max(ll x, int y) { return max(x, (ll)y); }\\nint min(int x, ll y) { return min((ll)x, y); }\\nint min(ll x, int y) { return min(x, (ll)y); }\\n#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))\\n#define lbg(c, x) distance((c).begin(), lower_bound(all(c), (x), greater{}))\\n#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))\\n#define ubg(c, x) distance((c).begin(), upper_bound(all(c), (x), greater{}))\\nll gcd(ll a,ll b){return (b?gcd(b,a%b):a);}\\nvector<pll> factor(ull x){ vector<pll> ans; for(ull i = 2; i * i <= x; i++) if(x % i == 0){ ans.push_back({i, 1}); while((x /= i) % i == 0) ans.back().second++; } if(x != 1) ans.push_back({x, 1}); return ans; }\\nvector<ll> divisor(ull x){ vector<ll> ans; for(ull i = 1; i * i <= x; i++) if(x % i == 0) ans.push_back(i); per(i,ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]); return ans; }\\nvll prime_table(ll n){vec(ll,isp,n+1,1);vll res;rng(i,2,n+1)if(isp[i]){res.pb(i);for(ll j=i*i;j<=n;j+=i)isp[j]=0;}return res;}\\n\\ntemplate <class T, class S> pair<T, S> operator-(const pair<T, S> &x) { return pair<T, S>(-x.first, -x.second); }\\ntemplate <class T, class S> pair<T, S> operator-(const pair<T, S> &x, const pair<T, S> &y) { return pair<T, S>(x.fi - y.fi, x.se - y.se); }\\ntemplate <class T, class S> pair<T, S> operator+(const pair<T, S> &x, const pair<T, S> &y) { return pair<T, S>(x.fi + y.fi, x.se + y.se); }\\ntemplate <class T> pair<T, T> operator&(const pair<T, T> &l, const pair<T, T> &r) { return pair<T, T>(max(l.fi, r.fi), min(l.se, r.se)); }\\ntemplate <class T, class S> pair<T, S> operator+=(pair<T, S> &l, const pair<T, S> &r) { return l = l + r; }\\ntemplate <class T, class S> pair<T, S> operator-=(pair<T, S> &l, const pair<T, S> &r) { return l = l - r; }\\ntemplate <class T> bool intersect(const pair<T, T> &l, const pair<T, T> &r) { return (l.se < r.se ? r.fi < l.se : l.fi < r.se); }\\n\\ntemplate <class T> vector<T> &operator++(vector<T> &v) {\\n fore(e, v) e++;\\n return v;\\n}\\ntemplate <class T> vector<T> operator++(vector<T> &v, int) {\\n auto res = v;\\n fore(e, v) e++;\\n return res;\\n}\\ntemplate <class T> vector<T> &operator--(vector<T> &v) {\\n fore(e, v) e--;\\n return v;\\n}\\ntemplate <class T> vector<T> operator--(vector<T> &v, int) {\\n auto res = v;\\n fore(e, v) e--;\\n return res;\\n}\\ntemplate <class T> vector<T> &operator+=(vector<T> &l, const vector<T> &r) {\\n fore(e, r) l.eb(e);\\n return l;\\n}\\n\\ntemplate<class... Ts> void in(Ts&... t);\\n[[maybe_unused]] void print(){}\\ntemplate<class T, class... Ts> void print(const T& t, const Ts&... ts);\\ntemplate<class... Ts> void out(const Ts&... ts){ print(ts...); cout << '\\\\n'; }\\nnamespace IO{\\n#define VOID(a) decltype(void(a))\\nstruct S{ S(){ cin.tie(nullptr)->sync_with_stdio(0); fixed(cout).precision(12); } }S;\\ntemplate<int I> struct P : P<I-1>{};\\ntemplate<> struct P<0>{};\\ntemplate<class T> void i(T& t){ i(t, P<3>{}); }\\nvoid i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }\\ntemplate<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }\\ntemplate<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }\\ntemplate<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){ in(get<idx>(t)...); }\\ntemplate<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){ ituple(t, make_index_sequence<tuple_size<T>::value>{}); }\\ntemplate<class T> void o(const T& t){ o(t, P<4>{}); }\\ntemplate<size_t N> void o(const char (&t)[N], P<4>){ cout << t; }\\ntemplate<class T, size_t N> void o(const T (&t)[N], P<3>){ o(t[0]); for(size_t i = 1; i < N; i++){ o(' '); o(t[i]); } }\\ntemplate<class T> auto o(const T& t, P<2>) -> VOID(cout << t){ cout << t; }\\ntemplate<class T> auto o(const T& t, P<1>) -> VOID(begin(t)){ bool first = 1; for(auto&& x : t) { if(first) first = 0; else o(' '); o(x); } }\\ntemplate<class T, size_t... idx> void otuple(const T& t, index_sequence<idx...>){ print(get<idx>(t)...); }\\ntemplate<class T> auto o(T& t, P<0>) -> VOID(tuple_size<T>{}){ otuple(t, make_index_sequence<tuple_size<T>::value>{}); }\\n#undef VOID\\n}\\n#define unpack(a) (void)initializer_list<int>{(a, 0)...}\\ntemplate<class... Ts> void in(Ts&... t){ unpack(IO::i(t)); }\\ntemplate<class T, class... Ts> void print(const T& t, const Ts&... ts){ IO::o(t); unpack(IO::o((cout << ' ', ts))); }\\n#undef unpack\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n while(1){\\n LL(r,n);\\n if(n==0&&r==0)break;\\n map<pll,bool> col;\\n rep(i,n){\\n LL(xl,xr,h);\\n rng(x,xl,xr)rng(y,0,h){\\n col[{x,y}]=1;\\n }\\n }\\n auto inc=[&](double p,double x,double y){\\n double d=pow(x,2)+pow(y-p,2);\\n d=sqrt(d);\\n return d<r;\\n };\\n auto f=[&](double t){\\n double p=t-r;\\n bool res=1;\\n rng(x,-20,20)rng(y,0,20){\\n bool ex=0;\\n rng(dx,0,2)rng(dy,0,2){\\n ex|=inc(p,x+dx,y+dy);\\n }\\n if(ex){\\n res&=col[{x,y}];\\n }\\n }\\n return res;\\n };\\n {\\n double l=0,r=20;\\n while(l<r-0.0001){\\n double mid=(l+r)/2.0;\\n (f(mid)?l:r)=mid;\\n }\\n cout<<fixed<<setprecision(4);\\n out(l);\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3548,\n \"score_of_the_acc\": -0.5428,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1194_7700090\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <deque>\\n#include <queue>\\n#include <string>\\n#include <iomanip>\\n#include <set>\\n#include <unordered_set>\\n#include <map>\\n#include <unordered_map>\\n#include <utility>\\n#include <stack>\\n#include <random>\\n#include <complex>\\n#include <functional>\\n#include <stdio.h>\\n#include <stdlib.h>\\n#include <time.h>\\n#include <math.h>\\n#include <assert.h>\\n#if __has_include(<atcoder/all>)\\n#include <atcoder/all>\\nusing namespace atcoder;\\n#endif\\n#if __has_include(<boost/multiprecision/cpp_int.hpp>)\\n#include <boost/multiprecision/cpp_int.hpp>\\nusing cpp_int=boost::multiprecision::cpp_int;\\n#endif\\n#if __has_include(<boost/multiprecision/cpp_dec_float.hpp>)\\n#include <boost/multiprecision/cpp_dec_float.hpp>\\ntemplate<unsigned size>using cpp_float=boost::multiprecision::number<boost::multiprecision::cpp_dec_float<size>>;\\ntemplate<unsigned size>using cpp_double=boost::multiprecision::number<boost::multiprecision::cpp_dec_float<size,long long>>;\\n#endif\\nusing namespace std;\\nusing ll=long long;\\n#define read(x) cin>>(x);\\n#define readll(x) ll (x);cin>>(x);\\n#define readS(x) string (x);cin>>(x);\\n#define readvll(x,N) vector<ll> (x)((N));for(int i=0;i<(N);i++){cin>>(x)[i];}\\n#define rep(i,N) for(ll (i)=0;(i)<(N);(i)++)\\n#define rep2d(i,j,H,W) for(ll (i)=0;(i)<(H);(i)++)for(ll (j)=0;(j)<(W);j++)\\n#define is_in(x,y) (0<=(x) && (x)<H && 0<=(y) && (y)<W)\\n#define yn {cout<<\\\"Yes\\\"<<endl;}else{cout<<\\\"No\\\"<<endl;}\\n#define double_out(x) fixed << setprecision(x)\\ntemplate<class T> inline void erase_duplicate(vector<T>& A){sort(A.begin(),A.end());A.erase(unique(A.begin(),A.end()),A.end());}\\ninline ll powll(ll x,ll n){ll r=1;while(n>0){if(n&1){r*=x;};x*=x;n>>=1;};return r;}\\n\\nvoid solve(ll r,ll n){\\n vector<ll> xl(n),xr(n),h(n);\\n for(ll i=0;i<n;i++){\\n cin>>xl[i]>>xr[i]>>h[i];\\n }\\n // vector<ll> hmax(41);\\n // for(ll i=0;i<n;i++){\\n // for(ll j=xl[i]+20;j<xr[i]+20;j++){\\n // hmax[j]=max(hmax[j],h[i]);\\n // }\\n // }\\n // double ans=100000;\\n // for(ll j=0;j<40;j++){\\n // ll x1=j-20;\\n // ll x2=j-20+1;\\n // ll hh=hmax[j];\\n // if(abs(x1)>abs(x2)){\\n // swap(x1,x2);\\n // hh=hmax[j+1];\\n // }\\n // if(abs(x1)>r || (abs(x1)==r && hh==0)){\\n // continue;\\n // }\\n // ans=min(ans,hh-sqrt(r*r-x1*x1)+r);\\n // cerr<<x1<<\\\" \\\"<<hh<<\\\" \\\"<<ans<<endl;\\n // }\\n double ans=1000000;\\n for(double x=-20.0;x<=20.0;x+=0.00001){\\n if(abs(x)>r){\\n continue;\\n }\\n ll hh=0;\\n for(ll i=0;i<n;i++){\\n if(xl[i]<=x && x<=xr[i]){\\n hh=max(hh,h[i]);\\n }\\n }\\n ans=min(ans,hh-sqrt(r*r-x*x)+r);\\n }\\n cout<<double_out(10)<<ans<<endl;\\n}\\n\\nint main(){\\n ll r,n;\\n while(cin>>r>>n,r){\\n solve(r,n);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2960,\n \"memory_kb\": 3568,\n \"score_of_the_acc\": -0.9675,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1194_6771273\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll=long long;\\n\\nvoid solve(){\\n while(1){\\n int r,n;\\n cin>>r>>n;\\n if(r==0&&n==0) break;\\n map<pair<double,double>,bool> mp;\\n for(int i=0;i<n;i++){\\n int xl,xr,h;\\n cin>>xl>>xr>>h;\\n for(double x=xl;x<=xr;x+=0.5){\\n for(int y=0;y<=h;y++){\\n mp[{x,y}]=true;\\n }\\n }\\n }\\n long double ans=1000000;\\n for(int x=-20;x<=20;x++){\\n for(int y=1;y<=20;y++){\\n if(!mp[{x+0.5,y+1}]||!mp[{x-0.5,y+1}]){\\n if(r*r-x*x>0){\\n ans=min(ans,(long double)y+r-sqrt(r*r-x*x));\\n }\\n }\\n }\\n }\\n for(int x=-20;x<=20;x++){\\n if(!mp[{x-0.5,0}]||!mp[{x+0.5,0}]){\\n if(r*r-x*x>0){\\n ans=min(ans,(long double)r-sqrt(r*r-x*x));\\n }\\n }\\n }\\n cout<<fixed<<setprecision(6)<<ans<<endl;\\n }\\n}\\nint main(){\\n solve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3504,\n \"score_of_the_acc\": -0.4974,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1194_6672119\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <deque>\\n#include <queue>\\n#include <string>\\n#include <iomanip>\\n#include <set>\\n#include <unordered_set>\\n#include <map>\\n#include <unordered_map>\\n#include <utility>\\n#include <stack>\\n#include <random>\\n#include <stdio.h>\\n#include <stdlib.h>\\n#include <time.h>\\n#include <math.h>\\n#include <assert.h>\\n#if __has_include(<atcoder/all>)\\n#include <atcoder/all>\\nusing namespace atcoder;\\n#endif\\nusing namespace std;\\nusing ll=long long;\\n#define read(x) cin>>(x);\\n#define readll(x) ll (x);cin>>(x);\\n#define readS(x) string (x);cin>>(x);\\n#define readvll(x,N) vector<ll> (x)((N));for(int i=0;i<(N);i++){cin>>(x)[i];}\\n#define rep(i,N) for(ll (i)=0;(i)<(N);(i)++)\\n#define rep2d(i,j,H,W) for(ll (i)=0;(i)<(H);(i)++)for(ll (j)=0;(j)<(W);j++)\\n#define is_in(x,y) (0<=(x) && (x)<H && 0<=(y) && (y)<W)\\n#define yn {cout<<\\\"Yes\\\"<<endl;}else{cout<<\\\"No\\\"<<endl;}\\n\\nvoid solve(ll n,ll r){\\n vector<ll> X1(n),X2(n),H(n);\\n for(ll i=0;i<n;i++){\\n cin>>X1[i]>>X2[i]>>H[i];\\n }\\n double ans=40.0;\\n for(ll i=-r;i<r;i++){\\n ll u=0;\\n for(ll j=0;j<n;j++){\\n if(X1[j]<=i && i<X2[j]){\\n //cerr<<j<<endl;\\n u=max(u,H[j]);\\n }\\n }\\n //cerr<<\\\"i: \\\"<<i<<\\\" u:\\\"<<u<<endl;\\n for(double j=0;j<1.0;j+=0.0001){\\n double x=i+j;\\n double t=(double)u-sqrt(r*r-x*x);\\n ans=min(ans,(double)r+t);\\n }\\n }\\n cout<<ans<<endl;\\n}\\n\\nint main(){\\n ll n;\\n ll r;\\n while(1){\\n cin>>r>>n;\\n if(n==0 && r==0){\\n return 0;\\n }\\n solve(n,r);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3448,\n \"score_of_the_acc\": -0.4441,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1194_6027343\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#include <bits/stdc++.h>\\n\\nusing namespace std;\\ntemplate <class T> using V = vector<T>;\\ntemplate <class T> using VV = V<V<T>>;\\n\\nconst long double EPS = 1e-4;\\nint r, n;\\n\\nint main() {\\n cin >> r >> n;\\n cout << fixed << setprecision(6);\\n while (r != 0 || n != 0) {\\n VV<int> shadow(41, V<int>(41));\\n V<int> xls(n), xrs(n), hs(n);\\n for (int i = 0; i < n; i++) {\\n cin >> xls[i] >> xrs[i] >> hs[i];\\n for (int x = xls[i] + 20; x < xrs[i] + 20; x++) {\\n for (int y = 0; y < hs[i]; y++) {\\n shadow[y][x] = 1;\\n }\\n }\\n }\\n // for (auto &&line : shadow) {\\n // for (auto &&s : line) {\\n // cout << s << \\\" \\\";\\n // }\\n // cout << \\\"\\\\n\\\";\\n // }\\n\\n // 0.0005 ずつ yを上昇させてシミュレーション\\n double t = 0.0;\\n\\n for (;;) {\\n double new_t = t + 0.0005;\\n bool ok = true;\\n for (int i = -r; i <= r; i++) {\\n int x = i;\\n int y = floor(sqrt(r * r - x * x) - r + new_t);\\n if (y < 0) continue;\\n if (i == -r) {\\n if (!shadow[y][x + 20]) ok = false;\\n } else if (i == r) {\\n if (!shadow[y][x + 20 - 1]) ok = false;\\n } else if (!shadow[y][x + 20 - 1] || !shadow[y][x + 20]) {\\n ok = false;\\n }\\n }\\n if (!ok) break;\\n t = new_t;\\n }\\n cout << t << \\\"\\\\n\\\";\\n cin >> r >> n;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 400,\n \"memory_kb\": 3584,\n \"score_of_the_acc\": -0.6299,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1194_6027341\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#include <bits/stdc++.h>\\n\\nusing namespace std;\\ntemplate <class T> using V = vector<T>;\\ntemplate <class T> using VV = V<V<T>>;\\n\\nconst long double EPS = 1e-4;\\nint r, n;\\n\\nint main() {\\n cin >> r >> n;\\n cout << fixed << setprecision(6);\\n while (r != 0 || n != 0) {\\n VV<int> shadow(41, V<int>(41));\\n V<int> xls(n), xrs(n), hs(n);\\n for (int i = 0; i < n; i++) {\\n cin >> xls[i] >> xrs[i] >> hs[i];\\n for (int x = xls[i] + 20; x < xrs[i] + 20; x++) {\\n for (int y = 0; y < hs[i]; y++) {\\n shadow[y][x] = 1;\\n }\\n }\\n }\\n // for (auto &&line : shadow) {\\n // for (auto &&s : line) {\\n // cout << s << \\\" \\\";\\n // }\\n // cout << \\\"\\\\n\\\";\\n // }\\n\\n // 0.0005 ずつ yを上昇させてシミュレーション\\n double t = 0.0;\\n\\n for (;;) {\\n double new_t = t + 0.00005;\\n bool ok = true;\\n for (int i = -r; i <= r; i++) {\\n int x = i;\\n int y = floor(sqrt(r * r - x * x) - r + new_t);\\n if (y < 0) continue;\\n if (i == -r) {\\n if (!shadow[y][x + 20]) ok = false;\\n } else if (i == r) {\\n if (!shadow[y][x + 20 - 1]) ok = false;\\n } else if (!shadow[y][x + 20 - 1] || !shadow[y][x + 20]) {\\n ok = false;\\n }\\n }\\n if (!ok) break;\\n t = new_t;\\n }\\n cout << t << \\\"\\\\n\\\";\\n cin >> r >> n;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4010,\n \"memory_kb\": 3504,\n \"score_of_the_acc\": -1.0485,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1194_6027332\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\ntemplate <class T> using V = vector<T>;\\ntemplate <class T> using VV = V<V<T>>;\\n\\nconst long double EPS = 1e-4;\\nint r, n;\\n\\nint main() {\\n cin >> r >> n;\\n cout << fixed << setprecision(6);\\n while (r != 0 || n != 0) {\\n VV<int> shadow(41, V<int>(41));\\n V<int> xls(n), xrs(n), hs(n);\\n for (int i = 0; i < n; i++) {\\n cin >> xls[i] >> xrs[i] >> hs[i];\\n for (int x = xls[i] + 20; x < xrs[i] + 20; x++) {\\n for (int y = 0; y < hs[i]; y++) {\\n shadow[y][x] = 1;\\n }\\n }\\n }\\n // for (auto &&line : shadow) {\\n // for (auto &&s : line) {\\n // cout << s << \\\" \\\";\\n // }\\n // cout << \\\"\\\\n\\\";\\n // }\\n\\n // 0.0005 ずつ yを上昇させてシミュレーション\\n double t = 0.0;\\n\\n for (;;) {\\n double new_t = t + 0.00005;\\n bool ok = true;\\n for (int i = -r; i <= r; i++) {\\n int x = i;\\n int y = floor(sqrt(r * r - x * x) - r + new_t);\\n if (y < 0) continue;\\n if (i == -r) {\\n if (!shadow[y][x + 20]) ok = false;\\n } else if (i == r) {\\n if (!shadow[y][x + 20 - 1]) ok = false;\\n } else if (!shadow[y][x + 20 - 1] || !shadow[y][x + 20]) {\\n ok = false;\\n }\\n }\\n if (!ok) break;\\n t = new_t;\\n }\\n cout << t << \\\"\\\\n\\\";\\n cin >> r >> n;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4900,\n \"memory_kb\": 3516,\n \"score_of_the_acc\": -1.1834,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1194_5974732\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n\\ntemplate<typename F>\\npair<double,double> Binary(double ok, double ng, const F &isok, int m = 200){\\n for(int t = 0; t < m; t++){\\n double wj = ((ok - ng)/2) + ng;\\n (isok(wj)?ok : ng) = wj;\\n }\\n return {ok, ng};\\n}\\n\\nnamespace geometry{\\n constexpr double eps = 1e-9;\\n bool eq(double a, double b){ return fabs(a - b) < eps; }\\n template<typename T> bool eq(T a, T b){ return a == b; }\\n bool is_zero(double a){ return fabs(a) < eps; }\\n template<typename T> bool is_zero(T a){ return a == 0; }\\n bool le(double a, double b){ return a <= b + eps; }\\n template<typename T> bool le(T a, T b){ return a <= b; }\\n bool lt(double a, double b){ return a < b - eps; }\\n template<typename T> bool lt(T a, T b){ return a < b; }\\n};\\n\\n\\ntemplate<class T> struct Point{\\n T x,y;\\n Point(){}\\n Point(T x, T y) : x(x), y(y) {}\\n Point(const pair<T,T> &p) : x(p.first), y(p.second) {}\\n\\n Point operator*(const T b) const { return Point(x * b, y * b); }\\n Point operator/(const T b) const { return Point(x / b, y / b); }\\n Point operator+(const Point &b) const { return Point(x + b.x, y + b.y); }\\n Point operator-(const Point &b) const { return Point(x - b.x, y - b.y); }\\n Point operator*(const Point &b) const { return Point(x*b.x - y*b.y, x*b.y + y*b.x); }\\n Point operator/(const Point &b) const { return Point(x*b.x + y*b.y, y*b.x - x*b.y)/(b.x*b.x + b.y*b.y); }\\n\\n Point &operator*=(const T b){ return (*this) = (*this) * b; }\\n Point &operator/=(const T b){ return (*this) = (*this) / b; }\\n Point &operator+=(const Point &b){ return (*this) = (*this) + b; }\\n Point &operator-=(const Point &b){ return (*this) = (*this) - b; }\\n Point &operator*=(const Point &b){ return (*this) = (*this) * b; }\\n Point &operator/=(const Point &b){ return (*this) = (*this) / b; }\\n \\n bool operator==(const Point &b) const {\\n return geometry::eq(x, b.x) && geometry::eq(y, b.y);\\n }\\n bool operator<(const Point &b) const { \\n if(geometry::eq(x, b.x)) return y < b.y;\\n return x < b.x;\\n }\\n T Norm() const { return x * x + y * y; }\\n double Abs() const { return hypot<double>(x, y); }\\n double dist(const Point &b) const { return hypot<double>(x - b.x, y - b.y); }\\n double arg() const { return atan2<double>(y, x); }\\n \\n Point ArgVec() const {\\n if((*this) == Point(0, 0)) return (*this);\\n if(geometry::is_zero(x)) return Point(0, -1);\\n return (*this) / gcd(x, y) * (x < 0 ? -1 : 1);\\n }\\n\\n int ort() const {\\n if(geometry::is_zero(x) && geometry::is_zero(y)) return 0;\\n if(geometry::is_zero(y)) return x > 0 ? 1 : 3;\\n if(geometry::is_zero(x)) return y > 0 ? 2 : 4;\\n if (y > 0) return x > 0 ? 1 : 2;\\n else return x > 0 ? 4 : 3;\\n }\\n Point rotate90() const { return Point(-y, x);}\\n Point rotate180() const { return Point(-x, -y);}\\n Point rotate270() const { return Point(y, -x);}\\n\\n Point flip_x(T p = 0) const { return Point(p*2 - x, y);}\\n Point flip_y(T p = 0) const { return Point(x, p*2 - y);}\\n\\n Point rotate(double theta) const {\\n return Point(cos(theta)*x - sin(theta)*y, sin(theta)*x + cos(theta)*y);\\n }\\n\\n Point flip(double theta) const {\\n return (*this).rotate(-theta).flip_y().rotate(theta);\\n }\\n\\n friend ostream &operator<<(ostream &os, const Point &p) {\\n return os << p.x << \\\" \\\" << p.y;\\n }\\n friend istream &operator>>(istream &is, Point &p) {\\n T a, b; is >> a >> b;\\n p = Point<T>(a, b);\\n return (is);\\n }\\n};\\n\\ntemplate<typename T> Point<T> Polar(const T& rho, const T& theta = 0){\\n return Point<T>(rho * cos(theta), rho * sin(theta));\\n}\\n\\n\\ntemplate<typename T> using Polygon = vector<Point<T>>;\\n\\ntemplate<class T> T Cross(const Point<T> &a, const Point<T> &b) { return a.x * b.y - a.y * b.x; }\\n\\ntemplate<class T> T Dot(const Point<T> &a, const Point<T> &b) { return a.x * b.x + a.y * b.y; }\\n\\ntemplate<class T> bool Intersect(const Point<T> &a, const Point<T> &b, const Point<T> &c, const Point<T> &d) {\\n return (iSP(a, b, c)*iSP(a, b, d) <= 0) && (iSP(c, d, a)*iSP(c, d, b) <= 0);\\n}\\n\\ntemplate<class T> int iSP(const Point<T> &a, const Point<T> &b, const Point<T> &c){\\n T fl = Cross(b-a, c-a);\\n if(geometry::lt(T(0), fl)) return 1; // CCW\\n if(geometry::lt(fl, T(0))) return -1; // CW\\n if(geometry::lt(T(0), Dot(b-a, c-b))) return 2; //abc\\n if(geometry::lt(T(0), Dot(a-b, c-a))) return -2; //bac\\n return 0; // acb\\n}\\n\\ntemplate<class T> int angletype(const Point<T> &a, const Point<T> &b, const Point<T> &c){\\n T v = Dot(a-b, c-a);\\n if(geometry::is_zero(v)) return 0; // right angle\\n if(v > 0) return 1; // acute angle\\n return -1; // obtuse angle\\n}\\n\\ntemplate<typename T>\\nbool cmp_y(const Point<T>& p1, const Point<T> &p2){\\n if(p1.y == p2.y) return p1.x < p2.x;\\n return p1.y < p2.y;\\n}\\n\\ntemplate<typename T>\\nbool cmp_arg(const Point<T>& p1, const Point<T> &p2){\\n if(p1.ort() != p2.ort()) return p1.ort() < p2.ort();\\n return iSP(Point<T>(0,0), p1, p2) > 0;\\n}\\n\\ntemplate<typename T>\\nvoid ArgSort(Polygon<T> &ps){\\n sort(begin(ps), end(ps), cmp_arg<T>);\\n}\\n\\ntemplate<class T> struct Line{\\n Point<T> a, b;\\n Line() {}\\n Line(const Point<T> &a, const Point<T> &b): a(a), b(b) {}\\n Line(T A, T B, T C){ // Ax + By = C\\n if(A == 0){ a = Point<T>(0, C/B); b = Point<T>(1, C/B); }\\n else if(B == 0){ a = Point<T>(C/A, 0); b = Point<T>(C/A, 1); }\\n else{ a = Point<T>(0, C/B); b = Point<T>(C/A, 0); }\\n }\\n //Line(const Segment<T> &s): a(s.a), b(s.b) {}\\n Point<T> projection(const Point<T> &p) const {\\n return a + (b - a)*Dot(p - a, b - a)/(b - a).Norm();\\n }\\n Point<T> reflection(const Point<T> &p) const {\\n return p + (projection(p) - p)*2;\\n }\\n int angletype(const Line &l) const {\\n if(geometry::is_zero(Cross(b-a, l.b-l.a))) return 1;\\n if(geometry::is_zero(Dot(a-b, l.b-l.a))) return -1;\\n return 0;\\n }\\n bool Intersect(const Line &l) const {\\n return angletype(l) != 1;\\n }\\n Point<T> Cross_Point(const Line &l) const {\\n if(geometry::is_zero(Cross(b-a,l.b-l.a))) return l.a;\\n return (b - a)*Cross(l.a - a, l.b - l.a)/Cross(b - a,l.b - l.a) + a;\\n }\\n double dist(const Point<T> &p) const {\\n return abs(Cross(p - a, b - a)/(b - a).Abs());\\n }\\n double dist(const Line &l) const {\\n if(Intersect(l)) return 0;\\n return dist(l.a);\\n }\\n};\\n\\ntemplate<class T> struct Segment{\\n Point<T> a, b;\\n Segment() {}\\n Segment(const Point<T> &a, const Point<T> &b): a(a), b(b) {}\\n\\n double length() const { return a.dist(b); }\\n bool Intersect(const Segment &s) const {\\n return iSP(a, b, s.a)*iSP(a, b, s.b) <= 0 && iSP(s.a, s.b, a)*iSP(s.a, s.b, b) <= 0;\\n }\\n Point<T> Center() const { return (a + b) / 2; }\\n Line<T> PerpBisector() const {\\n Point<T> center = this->Center();\\n return Line<T>((a - center).rotate90() + center, center);\\n }\\n int angletype(const Segment &s) const {\\n if(geometry::is_zero(Cross(b-a, s.b-s.a))) return 1;\\n if(geometry::is_zero(Dot(a-b, s.b-s.a))) return -1;\\n return 0;\\n }\\n Point<T> Cross_Point(const Segment &s) const {\\n if(geometry::is_zero(Cross(b-a,s.b-s.a))) return s.a;\\n return (b - a)*Cross(s.a - a, s.b - s.a)/Cross(b - a, s.b - s.a) + a;\\n }\\n double dist(const Point<T> &p) const {\\n if(Dot(b-a, p-a) < 0) return p.dist(a);\\n if(Dot(a-b, p-b) < 0) return p.dist(b);\\n return abs(Cross(p-a, b-a)/ (b-a).Abs());\\n }\\n double dist(const Segment &s) const {\\n if(Intersect(s)) return 0;\\n return min({dist(s.a), dist(s.b), s.dist(a), s.dist(b)});\\n }\\n};\\n\\ntemplate<typename T>\\nstruct Triangle{\\n Point<T> a, b, c;\\n Triangle() {}\\n Triangle(const Point<T> &a, const Point<T> &b, const Point<T> &c): a(a), b(b), c(c){}\\n\\n double angle_a() const {\\n double ab = a.dist(b), bc = b.dist(c), ca = c.dist(a);\\n return acos((ca*ca + ab*ab - bc*bc)/(2*ca*ab));\\n }\\n double angle_b() const {\\n double ab = a.dist(b), bc = b.dist(c), ca = c.dist(a);\\n return acos((ab*ab + bc*bc - ca*ca)/(2*ab*bc));\\n }\\n double angle_c() const {\\n double ab = a.dist(b), bc = b.dist(c), ca = c.dist(a);\\n return acos((bc*bc + ca*ca - ab*ab)/(2*bc*ca));\\n }\\n Point<T> divpoint(double p, double q, double r) const {\\n return (a*p + b*q + c*r)/(p + q + r);\\n }\\n\\n Point<T> centerofgravity() const {\\n return (a + b + c)/3;\\n }\\n Point<T> circumcenter() const {\\n Segment<T> s1(a, b), s2(a, c);\\n return s1.PerpBisector().Cross_Point(s2.PerpBisector());\\n }\\n Point<T> orthocenter() const {\\n return centerofgravity()*3 - circumcenter()*2;\\n }\\n Point<T> innercenter() const {\\n return divpoint(b.dist(c), c.dist(a), a.dist(b));\\n }\\n Point<T> excenterA() const {\\n return divpoint(-b.dist(c), c.dist(a), a.dist(b));\\n }\\n Point<T> excenterB() const {\\n return divpoint(b.dist(c), -c.dist(a), a.dist(b));\\n }\\n Point<T> excenterC() const {\\n return divpoint(b.dist(c), c.dist(a), -a.dist(b));\\n }\\n};\\n\\ntemplate<class T> struct Circle{\\n Point<T> o;\\n T r;\\n Circle() {}\\n Circle(const Point<T> &o, const T &r): o(o), r(r) {}\\n Circle(const Point<T> &a, const Point<T> &b): o((a + b)/2), r(a.dist(b)/2) {}\\n Circle(const Point<T> &a, const Point<T> &b, const Point<T> &c)\\n : o(Triangle(a,b,c).circumcenter()), r(o.dist(a)) {}\\n\\n int Intersect(const Circle&c) const {\\n if(r < c.r) return c.Intersect(*this);\\n auto od = (o - c.o).Norm();\\n auto ra = (r + c.r)*(r + c.r), rs = (r - c.r)*(r - c.r);\\n if(geometry::lt(ra, od)) return 4;\\n if(geometry::eq(ra, od)) return 3;\\n if(geometry::lt(rs, od)) return 2;\\n if(geometry::eq(rs, od)) return 1;\\n return 0;\\n }\\n\\n int Intersect(const Line<T> &l) const {\\n double d = l.dist(o);\\n if(geometry::lt<double>(d, r)) return 2;\\n return geometry::eq(d, r);\\n }\\n\\n int Contains(const Point<T> &p) const {\\n auto od = (o - p).Norm();\\n if(geometry::eq(od, r*r)) return 1; // on\\n return (od > r*r) ? 2 : 0; // out/in\\n }\\n\\n Polygon<T> Cross_Points(const Line<T> &l) const {\\n int k = this->Intersect(l);\\n if(k == 0) return {};\\n Point<T> p = l.projection(o);\\n if(k == 1) return {p};\\n Point<T> d = (l.b - l.a)/l.a.dist(l.b);\\n double base = sqrt(r*r - (p - o).Norm());\\n return {p + d*base, p - d*base};\\n }\\n\\n Polygon<T> Cross_Points(const Circle &c) const {\\n int k = this->Intersect(c);\\n if(k == 0 || k == 4) return {};\\n double t = (c.o - o).arg();\\n if(k == 1 || k == 3) return {o + Polar<T>(r, t)};\\n double d = o.dist(c.o), a = acos((r*r + d*d - c.r*c.r) / (r * d * 2));\\n return {o + Polar<T>(r, t + a), o + Polar<T>(r, t - a)};\\n }\\n\\n friend ostream &operator<<(ostream &os, const Circle &c) {\\n return os << c.o << \\\" \\\" << c.r;\\n }\\n friend istream &operator>>(istream &is, Circle &c) {\\n Point<T> p; T l; is >> p >> l;\\n c = Circle<T>(p, l);\\n return (is);\\n }\\n};\\n\\n\\n\\nint main() {\\n cout << fixed << setprecision(12);\\n \\n while(true){\\n int r, n; cin >> r >> n;\\n if(r+n == 0) return 0;\\n\\n int m = 40;\\n\\n vector<int> h(m);\\n\\n for(int i = 0; i < n; ++i){\\n int l, r, y; cin >> l >> r >> y;\\n for(int j = l; j < r; ++j) h[j+20] = max(h[j+20], y);\\n }\\n\\n auto f = [&](double t){\\n Point<double> c(0, t-r);\\n Circle<double> sun(c, r);\\n\\n for(int i = 0; i < m-1; ++i){\\n double y = min(h[i], h[i+1]), my = max(h[i], h[i+1]);\\n double x = i - 19;\\n /*\\n 中心が (0, t-r) のとき, x = i-19での高さ\\n //*/\\n if(i-19 == r && t-r <= h[i]) continue;\\n if(i-19 == -r && t-r <= h[i+1]) continue;\\n\\n Line<double> l(1, 0, i-19);\\n auto ps = sun.Cross_Points(l);\\n for(auto p : ps){\\n if(p.y > y) return false;\\n }\\n }\\n return true;\\n };\\n\\n auto[ok,ng] = Binary(0, 40, f);\\n cout << ok << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3480,\n \"score_of_the_acc\": -0.4734,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1194_5974620\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n\\nint main() {\\n cout << fixed << setprecision(12);\\n \\n while(true){\\n int r, n; cin >> r >> n;\\n if(r+n == 0) return 0;\\n\\n int m = 40;\\n\\n vector<int> h(m);\\n\\n for(int i = 0; i < n; ++i){\\n int l, r, y; cin >> l >> r >> y;\\n for(int j = l; j < r; ++j) h[j+20] = max(h[j+20], y);\\n }\\n bool fl = true;\\n double t = 0;\\n while(fl){\\n t += 0.0001;\\n for(int i = 0; i < m-1; ++i){\\n int y = min(h[i], h[i+1]);\\n int x = i - 19;\\n\\n if(hypot(x, y+r-t) < r) fl = false;\\n }\\n \\n }\\n t -= -0.0001;\\n cout << t << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3940,\n \"memory_kb\": 3556,\n \"score_of_the_acc\": -1.0908,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1194_5274387\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i, n) for(int i = 0; i < (n); ++i)\\n\\ndouble p(double a) { return a * a; }\\n\\nbool solve() {\\n int rad, n;\\n cin >> rad >> n;\\n if(rad + n == 0) return false;\\n\\n map<int, int> mp;\\n for(int x = -30; x < 30; ++x) mp[x] = rad;\\n rep(_, n) {\\n int l, r, h;\\n cin >> l >> r >> h;\\n for(int i = l; i < r; ++i) {\\n mp[i] = max(mp[i], h + rad);\\n }\\n }\\n\\n double t = 0, d = 0.0001;\\n for(bool ng = false; ng == false && t < 30; t += d) {\\n for(auto &[x, h] : mp) if(p(x) + p(t - h) < p(rad)) ng = true;\\n for(auto &[x, h] : mp) if(p(x + 1) + p(t - h) < p(rad)) ng = true;\\n }\\n cout << fixed << setprecision(10) << t - d << '\\\\n';\\n return true;\\n}\\n\\nint main() {\\n while(solve());\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5050,\n \"memory_kb\": 3576,\n \"score_of_the_acc\": -1.2641,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1194_5041185\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define INF_LL (int64)1e18\\n#define INF (int32)1e9\\n#define REP(i, n) for(int64 i = 0;i < (n);i++)\\n#define FOR(i, a, b) for(int64 i = (a);i < (b);i++)\\n#define all(x) x.begin(),x.end()\\n#define fs first\\n#define sc second\\n\\nusing int32 = int_fast32_t;\\nusing uint32 = uint_fast32_t;\\nusing int64 = int_fast64_t;\\nusing uint64 = uint_fast64_t;\\nusing PII = pair<int32, int32>;\\nusing PLL = pair<int64, int64>;\\n\\nconst double eps = 1e-10;\\n\\ntemplate<typename A, typename B>inline void chmin(A &a, B b){if(a > b) a = b;}\\ntemplate<typename A, typename B>inline void chmax(A &a, B b){if(a < b) a = b;}\\n\\ntemplate<typename T>\\nvector<T> make_v(size_t a){return vector<T>(a);}\\n\\ntemplate<typename T,typename... Ts>\\nauto make_v(size_t a,Ts... ts){\\n\\treturn vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));\\n}\\n\\ntemplate<typename T,typename U,typename... V>\\ntypename enable_if<is_same<T, U>::value!=0>::type\\nfill_v(U &u,const V... v){u=U(v...);}\\n\\ntemplate<typename T,typename U,typename... V>\\ntypename enable_if<is_same<T, U>::value==0>::type\\nfill_v(U &u,const V... v){\\n\\tfor(auto &e:u) fill_v<T>(e,v...);\\n}\\n\\ntemplate <typename F>\\nclass\\nFixPoint : private F\\n{\\npublic:\\n explicit constexpr FixPoint(F&& f) noexcept\\n : F{std::forward<F>(f)}\\n {}\\n\\n template <typename... Args>\\n constexpr decltype(auto)\\n operator()(Args&&... args) const\\n {\\n return F::operator()(*this, std::forward<Args>(args)...);\\n }\\n}; // class FixPoint\\n\\n\\nnamespace\\n{\\n template <typename F>\\n inline constexpr decltype(auto)\\n makeFixPoint(F&& f) noexcept\\n {\\n return FixPoint<F>{std::forward<F>(f)};\\n }\\n} // namespace\\n\\ntemplate<typename T>\\nclass Matrix{\\nprivate:\\n using size_type = ::std::size_t;\\n using Row = ::std::vector<T>;\\n using Mat = ::std::vector<Row>;\\n\\n size_type R, C; // row, column\\n Mat A;\\n\\n void add_row_to_another(size_type r1, size_type r2, const T k){ // Row(r1) += Row(r2)*k\\n for(size_type i = 0;i < C;i++)\\n A[r1][i] += A[r2][i]*k;\\n }\\n\\n void scalar_multiply(size_type r, const T k){\\n for(size_type i = 0;i < C;i++)\\n A[r][i] *= k;\\n }\\n\\n void scalar_division(size_type r, const T k){\\n for(size_type i = 0;i < C;i++)\\n A[r][i] /= k;\\n }\\n\\npublic:\\n Matrix(){}\\n Matrix(size_type r, size_type c) : R(r), C(c), A(r, Row(c)) {}\\n Matrix(const Mat &m) : R(m.size()), C(m[0].size()), A(m) {}\\n Matrix(const Mat &&m) : R(m.size()), C(m[0].size()), A(m) {}\\n Matrix(const Matrix<T> &m) : R(m.R), C(m.C), A(m.A) {}\\n Matrix(const Matrix<T> &&m) : R(m.R), C(m.C), A(m.A) {}\\n Matrix<T> &operator=(const Matrix<T> &m){\\n R = m.R; C = m.C; A = m.A;\\n return *this;\\n }\\n Matrix<T> &operator=(const Matrix<T> &&m){\\n R = m.R; C = m.C; A = m.A;\\n return *this;\\n }\\n static Matrix I(const size_type N){\\n Matrix m(N, N);\\n for(size_type i = 0;i < N;i++) m[i][i] = 1;\\n return m;\\n }\\n\\n const Row& operator[](size_type k) const& { return A.at(k); }\\n Row& operator[](size_type k) & { return A.at(k); }\\n Row operator[](size_type k) const&& { return ::std::move(A.at(k)); }\\n\\n size_type row() const { return R; } // the number of rows\\n size_type column() const { return C; }\\n\\n T determinant(){\\n assert(R == C);\\n Mat tmp = A;\\n T res = 1;\\n for(size_type i = 0;i < R;i++){\\n for(size_type j = i;j < R;j++){ // satisfy A[i][i] > 0\\n if (A[j][i] != 0) {\\n if (i != j) res *= -1;\\n swap(A[j], A[i]);\\n break;\\n }\\n }\\n if (A[i][i] == 0) return 0;\\n res *= A[i][i];\\n scalar_division(i, A[i][i]);\\n for(size_type j = i+1;j < R;j++){\\n add_row_to_another(j, i, -A[j][i]);\\n }\\n }\\n swap(tmp, A);\\n return res;\\n }\\n\\n Matrix inverse(){\\n assert(R == C);\\n assert(determinant() != 0);\\n Matrix inv(Matrix::I(R)), tmp(*this);\\n for(size_type i = 0;i < R;i++){\\n for(size_type j = i;j < R;j++){\\n if (A[j][i] != 0) {\\n swap(A[j], A[i]);\\n swap(inv[j], inv[i]);\\n break;\\n }\\n }\\n inv.scalar_division(i, A[i][i]);\\n scalar_division(i, A[i][i]);\\n for(size_type j = 0;j < R;j++){\\n if(i == j) continue;\\n inv.add_row_to_another(j, i, -A[j][i]);\\n add_row_to_another(j, i, -A[j][i]);\\n }\\n }\\n (*this) = tmp;\\n return inv;\\n }\\n\\n Matrix& operator+=(const Matrix &B){\\n assert(column() == B.column() && row() == B.row());\\n for(size_type i = 0;i < R;i++)\\n for(size_type j = 0;j < C;j++)\\n (*this)[i][j] += B[i][j];\\n return *this;\\n }\\n\\n Matrix& operator-=(const Matrix &B){\\n assert(column() == B.column() && row() == B.row());\\n for(size_type i = 0;i < R;i++)\\n for(size_type j = 0;j < C;j++)\\n (*this)[i][j] -= B[i][j];\\n return *this;\\n }\\n\\n Matrix& operator*=(const Matrix &B){\\n assert(column() == B.row());\\n Matrix M(R, B.column());\\n for(size_type i = 0;i < R;i++) {\\n for(size_type j = 0;j < B.column();j++) {\\n M[i][j] = 0;\\n for(size_type k = 0;k < C;k++) {\\n M[i][j] += (*this)[i][k] * B[k][j];\\n }\\n }\\n }\\n swap(M, *this);\\n return *this;\\n }\\n\\n Matrix& operator/=(const Matrix &B){\\n assert(C == B.row());\\n Matrix M(B);\\n (*this) *= M.inverse();\\n return *this;\\n }\\n\\n Matrix operator+(const Matrix &B) const { return (Matrix(*this) += B); }\\n Matrix operator-(const Matrix &B) const { return (Matrix(*this) -= B); }\\n Matrix operator*(const Matrix &B) const { return (Matrix(*this) *= B); }\\n Matrix operator/(const Matrix &B) const { return (Matrix(*this) /= B); }\\n\\n bool operator==(const Matrix &B) const {\\n if (column() != B.column() || row() != B.row()) return false;\\n for(size_type i = 0;i < row();i++)\\n for(size_type j = 0;j < column();j++)\\n if ((*this)[i][j] != B[i][j]) return false;\\n return true;\\n }\\n bool operator!=(const Matrix &B) const { return !((*this) == B); }\\n\\n Matrix pow(size_type k, int64 m){\\n assert(R == C);\\n Matrix M(Matrix::I(R));\\n while(k){\\n if (k & 1) M *= (*this);\\n k >>= 1;\\n (*this) *= (*this);\\n REP(i, R) {\\n REP(j, C) {\\n A[i][j] %= m;\\n M[i][j] %= m;\\n }\\n }\\n }\\n A.swap(M.A);\\n return *this;\\n }\\n\\n friend ::std::ostream &operator<<(::std::ostream &os, Matrix &p){\\n for(size_type i = 0;i < p.row();i++){\\n for(size_type j = 0;j < p.column();j++){\\n os << p[i][j] << \\\" \\\";\\n }\\n os << ::std::endl;\\n }\\n return os;\\n }\\n};\\n\\nint main(void) {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n int64 n, r;\\n while (cin >> r >> n && r + n) {\\n vector<int64> h(41, 0);\\n REP(i, n) {\\n int64 xl, xr, hi;\\n cin >> xl >> xr >> hi;\\n FOR(j, xl+20, xr+20) {\\n chmax(h[j], hi);\\n }\\n }\\n\\n auto ok = [&](double x) {\\n REP(j, 40) {\\n double offl = j - 20, offr = j - 19;\\n if (j-19 <= -r || r <= j-20) continue;\\n double hmax = x + r * max(sin(atan2(sqrt(r * r - offl * offl), offl)), sin(atan2(sqrt(r * r - offr * offr), offr)));\\n if (hmax > h[j]) return false;\\n }\\n return true;\\n };\\n double lo = -r, hi = 21, mi;\\n REP(i, 100) {\\n mi = (lo + hi) / 2;\\n if (ok(mi)) lo = mi;\\n else hi = mi;\\n }\\n cout << fixed << setprecision(10) << lo + r << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4008,\n \"score_of_the_acc\": -1,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1194_4968746\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)\\n#define rrep(i,n) for(int (i)=((n)-1);(i)>=0;(i)--)\\n#define itn int\\n#define miele(v) min_element(v.begin(), v.end())\\n#define maele(v) max_element(v.begin(), v.end())\\n#define SUM(v) accumulate(v.begin(), v.end(), 0LL)\\n#define lb(a, key) lower_bound(a.begin(),a.end(),key)\\n#define ub(a, key) upper_bound(a.begin(),a.end(),key)\\n#define COUNT(a, key) count(a.begin(), a.end(), key) \\n#define BITCOUNT(x) __builtin_popcount(x)\\n#define pb push_back\\n#define all(x) (x).begin(),(x).end()\\n#define F first\\n#define S second\\nusing P = pair <int,int>;\\nusing WeightedGraph = vector<vector <P>>;\\nusing UnWeightedGraph = vector<vector<int>>;\\nusing Real = long double;\\nusing Point = complex<Real>; //Point and Vector2d is the same!\\nusing Vector2d = complex<Real>;\\nconst long long INF = 1LL << 60;\\nconst int MOD = 1000000007;\\nconst double EPS = 1e-15;\\nconst double PI=3.14159265358979323846;\\ntemplate <typename T> \\nint getIndexOfLowerBound(vector <T> &v, T x){\\n return lower_bound(v.begin(),v.end(),x)-v.begin();\\n}\\ntemplate <typename T> \\nint getIndexOfUpperBound(vector <T> &v, T x){\\n return upper_bound(v.begin(),v.end(),x)-v.begin();\\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; }\\n#define DUMPOUT cerr\\n#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)\\nistream &operator>>(istream &is, Point &p) {\\n Real a, b; is >> a >> b; p = Point(a, b); return is;\\n}\\ntemplate <typename T, typename U>\\nistream &operator>>(istream &is, pair<T,U> &p_var) {\\n is >> p_var.first >> p_var.second;\\n return is;\\n}\\ntemplate <typename T>\\nistream &operator>>(istream &is, vector<T> &vec) {\\n for (T &x : vec) is >> x;\\n return is;\\n}\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, pair<T, U> &pair_var) {\\n DUMPOUT<<'{';\\n os << pair_var.first;\\n DUMPOUT<<',';\\n os << \\\" \\\"<< pair_var.second;\\n DUMPOUT<<'}';\\n return os;\\n}\\ntemplate <typename T>\\nostream &operator<<(ostream &os, vector<T> &vec) {\\n DUMPOUT<<'[';\\n for (int i = 0; i < vec.size(); i++) \\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\" \\\");\\n DUMPOUT<<']';\\n return os;\\n}\\ntemplate <typename T>\\nostream &operator<<(ostream &os, vector<vector<T>> &df) {\\n for (auto& vec : df) os<<vec;\\n return os;\\n}\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, map<T, U> &map_var) {\\n DUMPOUT << \\\"{\\\";\\n repi(itr, map_var) {\\n os << *itr;\\n itr++;\\n if (itr != map_var.end()) DUMPOUT << \\\", \\\";\\n itr--;\\n }\\n DUMPOUT << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T>\\nostream &operator<<(ostream &os, set<T> &set_var) {\\n DUMPOUT << \\\"{\\\";\\n repi(itr, set_var) {\\n os << *itr;\\n itr++;\\n if (itr != set_var.end()) DUMPOUT << \\\", \\\";\\n itr--;\\n }\\n DUMPOUT << \\\"}\\\";\\n return os;\\n}\\nvoid print() {cout << endl;}\\ntemplate <class Head, class... Tail>\\nvoid print(Head&& head, Tail&&... tail) {\\n cout << head;\\n if (sizeof...(tail) != 0) cout << \\\" \\\";\\n print(forward<Tail>(tail)...);\\n}\\nvoid dump_func() {DUMPOUT << '#'<<endl;}\\ntemplate <typename Head, typename... Tail>\\nvoid dump_func(Head &&head, Tail &&... tail) {\\n DUMPOUT << head;\\n if (sizeof...(Tail) > 0) DUMPOUT << \\\", \\\";\\n dump_func(std::move(tail)...);\\n}\\n#ifdef DEBUG_\\n#define DEB\\n#define dump(...) \\\\\\n DUMPOUT << \\\" \\\" << string(#__VA_ARGS__) << \\\": \\\" \\\\\\n << \\\"[\\\" << to_string(__LINE__) << \\\":\\\" << __FUNCTION__ << \\\"]\\\" \\\\\\n << endl \\\\\\n << \\\" \\\", \\\\\\n dump_func(__VA_ARGS__)\\n#else\\n#define DEB if (false)\\n#define dump(...)\\n#endif\\n\\nint main(void) { cin.tie(0); ios::sync_with_stdio(false);\\n while(1){\\n double r; int n; \\n cin>>r>>n;\\n if(r == 0 && n == 0) exit(0);\\n vector <tuple <double,double,double>> p(n);\\n double d = (r+r)/100000;\\n for(int i=0;i<n;i++){\\n int x1, x2, h;\\n cin>>x1>>x2>>h;\\n p[i] = {x1, x2, h};\\n }\\n double ans = 1145141919;\\n for(double i=-r;i<=r;i+=d){\\n double height = 0;\\n for(int j=0;j<n;j++){\\n if(get <0>(p[j]) <= i && get <1>(p[j]) >= i) chmax(height, get <2>(p[j]));\\n }\\n chmin(ans, height - (sqrt(r*r - i*i) - r));\\n }\\n printf(\\\"%.4f\\\\n\\\", ans);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 3532,\n \"score_of_the_acc\": -0.5378,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1194_4958010\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n#define rep(i, n) for(int i = 0; i < n; i++)\\nusing namespace std;\\n\\ntypedef long long ll;\\n\\nconst int INF = 1 << 30;\\nconst ll LLINF = 1LL << 62;\\n\\nconst double eps = 0.00001;\\n\\nint mod = 1000000007;\\n\\ndouble deg_to_rad(double deg){\\n return deg * M_PI / 180;\\n}\\n\\ndouble calcheight(vector<pair<pair<double, double>, double>>& towers, double x){\\n double ret = 0;\\n rep(i, towers.size()){\\n if(towers[i].first.first <= x && x <= towers[i].first.second) ret = max(ret, towers[i].second);\\n }\\n return ret;\\n}\\n\\nint main(void){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n vector<double> ans;\\n while(true){\\n double R; int N; cin >> R >> N;\\n if(R <= 0 && N == 0) break;\\n vector<pair<pair<double, double>, double>> towers(N);\\n rep(i, N) cin >> towers[i].first.first >> towers[i].first.second >> towers[i].second;\\n double ok = 0, ng = 1000;\\n double m = (ok+ng)/2;\\n while(abs(ok-ng) > eps){\\n double c = m - R;\\n double inc = 0.002;\\n double nowDeg = 0;\\n bool hide = true;\\n\\n while(nowDeg <= 180){\\n bool res;\\n double x = R * cos(deg_to_rad(nowDeg));\\n double y = m - R + R * sin(deg_to_rad(nowDeg));\\n double height = calcheight(towers, x);\\n\\n //cout << \\\"deg: \\\" << nowDeg << \\\", \\\" << y << \\\" \\\" << height << endl;\\n if(height < y){\\n hide = false;\\n break;\\n }\\n nowDeg += inc;\\n }\\n if(hide) ok = m;\\n else ng = m;\\n m = (ok+ng)/2;\\n }\\n ans.push_back(ok);\\n }\\n rep(i, ans.size()) printf(\\\"%.6f\\\\n\\\", ans[i]);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4840,\n \"memory_kb\": 3836,\n \"score_of_the_acc\": -1.4951,\n \"final_rank\": 18\n }\n]","isConversational":false}}},{"rowIdx":664,"cells":{"group_id":{"kind":"string","value":"aoj_1195_cpp"},"problem_description":{"kind":"string","value":"Encryption System\nA programmer developed a new encryption system.\nHowever, his system has an issue that\ntwo or more distinct strings are `encrypted' to the same string.\nWe have a string encrypted by his system. \nTo decode the original string, we want to enumerate all the candidates of the string before the encryption.\nYour mission is to write a program for this task.\nThe encryption is performed taking the following steps. Given a string that consists only of lowercase letters ('a' to 'z').\nChange the first 'b' to 'a'. If there is no 'b', do nothing.\nChange the first 'c' to 'b'. If there is no 'c', do nothing.\n...\nChange the first 'z' to 'y'. If there is no 'z', do nothing.\nInput\nThe input consists of at most 100 datasets.\nEach dataset is a line containing an encrypted string.\nThe encrypted string consists only of lowercase letters, and contains at least 1 and at most 20 characters.\nThe input ends with a line with a single '#' symbol.\nOutput\nFor each dataset,\nthe number of candidates\nn\nof the string before encryption should be printed in a line first,\nfollowed by lines each containing a candidate of the string before encryption.\nIf\nn\ndoes not exceed 10, print all candidates in dictionary order;\notherwise, print the first five and the last five candidates in dictionary order.\nHere, dictionary order is recursively defined as follows.\nThe empty string comes the first in dictionary order.\nFor two nonempty strings\nx\n=\nx\n1\n...\nx\nk\nand\ny\n=\ny\n1\n...\ny\nl\n, \nthe string\nx\nprecedes the string\ny\nin dictionary order if\nx\n1\nprecedes\ny\n1\nin alphabetical order ('a' to 'z'), or\nx\n1\nand\ny\n1\nare the same character and\nx\n2\n...\nx\nk\nprecedes\ny\n2\n...\ny\nl\nin dictionary order.\nSample Input\nenw\nabc\nabcdefghijklmnopqrst\nz\n#\nOutput for the Sample Input\n1\nfox\n5\nacc\nacd\nbbd\nbcc\nbcd\n17711\nacceeggiikkmmooqqssu\nacceeggiikkmmooqqstt\nacceeggiikkmmooqqstu\nacceeggiikkmmooqrrtt\nacceeggiikkmmooqrrtu\nbcdefghijklmnopqrrtt\nbcdefghijklmnopqrrtu\nbcdefghijklmnopqrssu\nbcdefghijklmnopqrstt\nbcdefghijklmnopqrstu\n0"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1195_10848117","code_snippet":"#include <stdio.h>\n#include <memory.h>\n#include <string.h>\n#define MAX 30\n\nchar ch[MAX], p[MAX];\nint len, b[MAX], ac[30], cnt;\nchar ch2[1050000][22];\n\nvoid dfs(int now, int sw){\n\tint i;\n\tb[now]=sw;\n\tif (now==len){\n\t\tfor (i=1;i<=len;i++){\n\t\t\tp[i]=ch[i];\n\t\t\tif (b[i]) p[i]++;\n\t\t}\n\t\tmemset(ac, 0, sizeof(ac));\n\t\tint flag=0;\n\t\tfor (i=1;i<=len;i++){\n\t\t\tif (ac[p[i]-'a']){\n\t\t\t\tif (p[i]!=ch[i]){\n\t\t\t\t\tflag=1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\tac[p[i]-'a']=1;\n\t\t\t\tif (p[i]-1!=ch[i] && p[i]!='a'){\n\t\t\t\t\tflag=1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (flag==0){\n\t\t\tcnt++;\n\t\t\tfor (i=1;i<=len;i++) ch2[cnt][i]=p[i];\n\t\t}\n\t}else{\n\t\tdfs(now+1, 0);\n\t\tif (ch[now+1]!='z') dfs(now+1, 1);\n\t}\n}\n\nint main(void){\n\tint i,j;\n\tfor (;;){\n\t\tscanf(\"%s\", &ch[1]);\n\t\tif (ch[1]=='#') break;\n\t\tlen=strlen(&ch[1]);\n\t\tdfs(1, 0);\n\t\tif (ch[1]!='z') dfs(1, 1);\n\t\tprintf(\"%d\\n\", cnt);\n\t\tif (cnt>=10){\n\t\t\tfor (i=1;i<=5;i++) printf(\"%s\\n\", &ch2[i][1]);\n\t\t\tfor (i=cnt-4;i<=cnt;i++) printf(\"%s\\n\", &ch2[i][1]);\n\t\t}else{\n\t\t\tfor (i=1;i<=cnt;i++) printf(\"%s\\n\", &ch2[i][1]);\n\t\t}\n\t\tfor (i=1;i<=cnt;i++){\n\t\t\tfor (j=1;j<=len;j++) ch2[i][j]=0;\n\t\t}\n\t\tcnt=0;\n\n\t}\n\treturn false;\n}","accuracy":1,"time_ms":1630,"memory_kb":3196,"score_of_the_acc":-0.2028,"final_rank":2},{"submission_id":"aoj_1195_10801516","code_snippet":"#include <bits/stdc++.h>\n#define Mid (l + r >> 1)\n#define lson (rt << 1)\n#define rson (rt << 1 | 1)\nusing namespace std;\nint read() {\n\tchar c; int num, f = 1;\n\twhile(c = getchar(),!isdigit(c)) if(c == '-') f = -1; num = c - '0';\n\twhile(c = getchar(), isdigit(c)) num = num * 10 + c - '0';\n\treturn f * num;\n}\nstring s;\nvector<string> v;\nvoid dfs(char c) {\n\tif(c == 'a' - 1) {\n\t\tv.push_back(s);\n\t\treturn ;\n\t}\n\tint f = 0;\n\tfor(int i = 0; i < s.size(); i++) {\n\t\tif(s[i] == c + 1) {\n\t\t\tf = 1;\n\t\t\tbreak;\n\t\t} else if(s[i] == c) {\n\t\t\ts[i] = c + 1;\n\t\t\tdfs(c - 1);\n\t\t\ts[i] = c;\n\t\t}\n\t}\n\tif(!f) dfs(c - 1);\n}\nvoid work() {\n\tif(s.size() == 1 && s[0] == '#') exit(0);\n\tv.clear();\n\tdfs('y');\n\tsort(v.begin(), v.end());\n\tcout << v.size() << endl;\n\tif(v.size() <= 10) {\n\t\tfor(auto x : v)\n\t\t\tcout << x << endl;\n\t} else {\n\t\tfor(int i = 0; i < 5; i++)\n\t\t\tcout << v[i] << endl;\n\t\tfor(int i = v.size() - 5; i < v.size(); i++)\n\t\t\tcout << v[i] << endl;\n\t}\n}\nsigned main()\n{\n\twhile(cin >> s) work();\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":4568,"score_of_the_acc":-0.4561,"final_rank":9},{"submission_id":"aoj_1195_10612579","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\nbl solve()\n{\n string s;\n cin >> s;\n if (s == \"#\")\n return 0;\n ll n = s.size();\n vvs t(n + 1);\n t[0].pb({\"\"});\n rep(i, n)\n {\n char x = s[i];\n rep(j, t[i].size())\n {\n string st = t[i][j];\n bl include = false;\n rep(k, st.size())\n {\n if (st[k] == x)\n {\n include = true;\n break;\n }\n }\n if (include||x=='a')\n {\n string nex = st;\n nex += x;\n t[i + 1].pb(nex);\n if (x != 'z')\n {\n bl ok = true;\n rep(k, st.size())\n {\n if (st[k] == x + 1)\n {\n ok = false;\n break;\n }\n }\n if (!ok)\n continue;\n string nex2 = st;\n nex2 += (x + 1);\n t[i + 1].pb(nex2);\n }\n }\n else\n {\n if (x == 'z')\n continue;\n bl ok = true;\n rep(k, st.size())\n {\n if (st[k] == x + 1)\n {\n ok = false;\n break;\n }\n }\n if (!ok)\n continue;\n string nex = st;\n nex += (x + 1);\n t[i + 1].pb(nex);\n }\n }\n }\n // debug_vv(t);\n // rep(i, 25)\n // {\n // char tar = 'a' + i;\n // char prev = tar + 1;\n // vs cand;\n // for (auto t : st)\n // {\n // rep(j, t.size())\n // {\n // if (t[j] == tar)\n // {\n // t[j] = prev;\n // cand.pb(t);\n // t[j] = tar;\n // break;\n // }\n // }\n // }\n // rep(j, cand.size())\n // {\n // string tmp = cand[j];\n // rep(k, 25)\n // {\n // char tar = 'a' + k + 1;\n // char nex = tar - 1;\n // rep(l, tmp.size())\n // {\n // if (tmp[l] == tar)\n // {\n // tmp[l] = nex;\n // break;\n // }\n // }\n // // if (i < 3)\n // // {\n // // cout << i << endl;\n // // cout << t << endl;\n // // }\n // }\n // if (tmp == s)\n // {\n // // cout << \"ERIRIRIRIRIIRIIIIIII\" << t << endl;\n // st.insert(cand[j]);\n // }\n // }\n // }\n // vs elimi;\n // for (auto t : st)\n // {\n // // cout << \"start is\" << t << endl;\n // string start = t;\n // rep(i, 25)\n // {\n // char tar = 'a' + i + 1;\n // char nex = tar - 1;\n // rep(j, t.size())\n // {\n // if (t[j] == tar)\n // {\n // t[j] = nex;\n // break;\n // }\n // }\n // // if (i < 3)\n // // {\n // // cout << i << endl;\n // // cout << t << endl;\n // // }\n // }\n // if (t != s)\n // {\n // // cout << \"ERIRIRIRIRIIRIIIIIII\" << t << endl;\n // elimi.pb(start);\n // }\n // }\n // rep(i, elimi.size())\n // {\n // // cout << elimi[i] << endl;\n // st.erase(elimi[i]);\n // }\n cout << t[n].size() << endl;\n if (t[n].size() <= 10)\n {\n rep(i,t[n].size()){\n cout << t[n][i] << endl;\n }\n }\n else\n {\n for(ll i=0;i<5;i++){\n cout << t[n][i] << endl;\n }\n for(ll i=t[n].size()-5;i<t[n].size();i++){\n cout << t[n][i] << endl;\n }\n }\n return 1;\n}\n\nsigned main()\n{\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n while (true)\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":20,"memory_kb":6204,"score_of_the_acc":-1.0013,"final_rank":16},{"submission_id":"aoj_1195_10556325","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\npair<ll,set<string>> myans(string s){\n //答えの型注意\n ll n = sz(s);\n set<string> mae;\n set<string> usi;\n auto check = [&](string &t){\n vll fin(26,-1);\n // string u = t;\n rep(i,sz(t)){\n ll v= t[i]-'a';\n if(fin[v] == -1 && v != 0){\n fin[v] = i ;\n t[i] = char('a'+v-1);\n }\n }\n bool same = t == s;\n rep(i,26)if(fin[i]!= -1){\n ll v= t[fin[i]]-'a';\n t[fin[i]] = char('a' + v+1);\n }\n return same;\n };\n ll ans = 0;\n rep(i,1 << n){\n string t = \"\";\n bool able = true;\n rep(j,n){\n //次にする\n if(i >> j & 1){\n if(s[j] == 'z'){\n able = false;\n }else{\n t += char('a'+(s[j]-'a')+1);\n }\n }else{\n t += s[j];\n }\n }\n if(!able)continue;\n \n if(check(t)){\n ans++;\n mae.insert(t);\n while(sz(mae) > 5){\n mae.erase(*mae.rbegin());\n }\n usi.insert(t);\n while(sz(usi) > 5){\n usi.erase(*usi.begin());\n }\n }\n }\n set<string> ret = mae;\n each(p,usi){\n ret.insert(p);\n }\n // cout << ans << endl;\n // each(p,ret){\n // cout << p << endl;\n // }\n return {ans,ret};\n}\n\n\nint main(){\n ios::sync_with_stdio(false);cin.tie(nullptr);\n while(true) {\n string s;\n cin >> s;\n if (s == \"#\") break;\n auto [ans,ret] = myans(s);\n cout << ans << endl;\n each(p,ret){\n cout << p << endl;\n }\n }\n // string t = \"acd\";\n // cout << encode(t) << endl;\n}","accuracy":1,"time_ms":7050,"memory_kb":3456,"score_of_the_acc":-0.9675,"final_rank":15},{"submission_id":"aoj_1195_10447118","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\n\nconstexpr int SIZ = 26;\n\nvector<string> ans;\nvoid dfs(string cur, string& S, vector<bool> shifted) {\n if (cur.size() == S.size()) {\n ans.push_back(cur);\n return;\n }\n\n const int pos = static_cast<int>(cur.size());\n if (shifted[S[pos] - 'a'] || S[pos] == 'a') {\n cur.push_back(S[pos]);\n dfs(cur, S, shifted);\n cur.pop_back();\n }\n\n if (S[pos] != 'z') {\n if (shifted[S[pos] + 1 - 'a']) {\n return;\n }\n shifted[S[pos] + 1 - 'a'] = true;\n cur.push_back(static_cast<char>(S[pos] + 1));\n dfs(cur, S, shifted);\n cur.pop_back();\n shifted[S[pos] + 1 - 'a'] = false;\n }\n}\n\nint main() {\n while (true) {\n string S;\n cin >> S;\n if (S == \"#\") {\n break;\n }\n\n ans.clear();\n vector shifted(SIZ, false);\n dfs(\"\", S, shifted);\n\n ranges::sort(ans);\n ans.erase(ranges::unique(ans).begin(), ans.end());\n\n const int n = static_cast<int>(ans.size());\n cout << n << endl;\n if (n <= 10) {\n for (int i = 0; i < n; i++) {\n cout << ans[i] << endl;\n }\n } else {\n for (int i = 0; i < 5; i++) {\n cout << ans[i] << endl;\n }\n for (int i = n - 5; i < n; i++) {\n cout << ans[i] << endl;\n }\n }\n }\n}","accuracy":1,"time_ms":20,"memory_kb":4952,"score_of_the_acc":-0.585,"final_rank":10},{"submission_id":"aoj_1195_10447112","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\n\nconstexpr int SIZ = 26;\n\nvector<string> ans;\nvoid solve(string cur, string& S, vector<bool> used) {\n if (cur.size() == S.size()) {\n ans.push_back(cur);\n return;\n }\n\n const int id = static_cast<int>(cur.size());\n if (used[S[id] - 'a'] || S[id] == 'a') {\n cur.push_back(S[id]);\n solve(cur, S, used);\n cur.pop_back();\n }\n\n if (S[id] != 'z') {\n if (used[S[id] + 1 - 'a']) {\n return;\n }\n used[S[id] + 1 - 'a'] = true;\n cur.push_back(char(S[id] + 1));\n solve(cur, S, used);\n cur.pop_back();\n used[S[id] + 1 - 'a'] = false;\n }\n}\n\nint main() {\n while (true) {\n string S;\n cin >> S;\n if (S == \"#\") {\n break;\n }\n\n ans.clear();\n vector used(SIZ, false);\n solve(\"\", S, used);\n\n ranges::sort(ans);\n ans.erase(ranges::unique(ans).begin(), ans.end());\n\n const int n = static_cast<int>(ans.size());\n cout << n << endl;\n if (n <= 10) {\n for (int i = 0; i < n; i++) {\n cout << ans[i] << endl;\n }\n } else {\n for (int i = 0; i < 5; i++) {\n cout << ans[i] << endl;\n }\n for (int i = n - 5; i < n; i++) {\n cout << ans[i] << endl;\n }\n }\n }\n}","accuracy":1,"time_ms":20,"memory_kb":4952,"score_of_the_acc":-0.585,"final_rank":10},{"submission_id":"aoj_1195_10272480","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\n\nstring s;\nint n;\nvector<string> ans(0);\n\n\nvoid f(int st, string t) {\n if (st == -1) {\n ans.push_back(t);\n return;\n }\n\n int fl = 0;\n rep(i,n) {\n if (t[i] == 'a'+st) {\n fl++;\n t[i]++;\n f(st-1,t);\n t[i]--;\n }\n else if (t[i] == 'a'+st+1) {\n return;\n }\n }\n\n f(st-1,t);\n \n}\n\n\nvoid solve() {\n ans.resize(0);\n n = s.length();\n\n f(24,s);\n\n sort(all(ans));\n\n cout << ans.size() << endl;\n if (ans.size() >= 11) {\n rep(i,5) {\n cout << ans[i] << endl;\n }\n rep(i,5) {\n cout << ans[ans.size()+i-5] << endl;\n }\n }\n else {\n rep(i,ans.size()) {\n cout << ans[i] << endl;\n }\n }\n return;\n\n\n}\n\n\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n\n while (cin >> s && s != \"#\") {\n solve();\n }\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":4500,"score_of_the_acc":-0.4348,"final_rank":6},{"submission_id":"aoj_1195_10272414","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); } }\nvc<string> tot;\nstring S;\nvoid f(int c){\n if (c == 0){\n tot.push_back(S);\n return;\n }\n \n rep(i, len(S)){\n if (S[i] == 'a' + c) return;\n if (S[i] == 'a' + c - 1){\n S[i]++;\n f(c - 1);\n S[i]--;\n }\n }\n f(c - 1);\n}\nvoid solve(){\n tot.clear();\n f(25);\n sort(all(tot));\n cout << len(tot) << endl;\n if (len(tot) < 10){\n for (auto x : tot) cout << x << endl;\n }else{\n rep(i, 5) cout << tot[i] << endl;\n srep(i, len(tot) - 5, len(tot)) cout << tot[i] << endl;\n }\n}\n\nint main(){\n while (true){\n cin >> S;\n if (S == \"#\") break;\n solve();\n }\n}","accuracy":1,"time_ms":10,"memory_kb":4540,"score_of_the_acc":-0.4468,"final_rank":8},{"submission_id":"aoj_1195_9704774","code_snippet":"#include <bits/stdc++.h>\n using namespace std;\n \n template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\n template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n #define rep(i,n) for (int i = 0; i < (n); ++i)\n\n typedef long long ll;\n typedef unsigned long long ull;\n using P=pair<ll,ll>;\n using tp=tuple<ll,ll,ll>;\n const int INF=1001001001;\n const ll INFL=1e18;\n const int mod=998244353;\n\n\tbool check(string s,string target){\n\t\tint n=s.size();\n\t\tfor(char c='b';c<='z';c++){\n\t\t\trep(i,n){\n\t\t\t\tif(s[i]==c){\n\t\t\t\t\ts[i]=c-1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn s==target;\n\t}\n\n\tvoid dfs(int i,string& s,string& target,vector<string>& t){\n\t\tint n=s.size();\n\t\tif(i==s.size()){\n\t\t\tif(check(s,target))t.push_back(s);\n\t\t\treturn;\n\t\t}\n\t\tdfs(i+1,s,target,t);\n\t\ts[i]+=1;\n\t\tdfs(i+1,s,target,t);\n\t\ts[i]-=1;\n\t}\n bool solve(){\n\t\tstring s;\n\t\tcin>>s;\n\t\tif(s==\"#\")return false;\n\n\t\tvector<string>t;\n\t\tstring target=s;\n\t\tdfs(0,s,target,t);\n\t\tsort(t.begin(),t.end());\n\n\t\tint T=t.size();\n\t\tcout<<T<<endl;\n\t\tif(T>10){\n\t\t\trep(i,5){\n\t\t\t\tcout<<t[i]<<endl;\n\t\t\t}\n\t\t\trep(i,5){\n\t\t\t\tcout<<t[T-5+i]<<endl;\n\t\t\t}\n\t\t}else{\n\t\t\trep(i,T){\n\t\t\t\tcout<<t[i]<<endl;\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn true;\n }\n\n int main(){\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n\n\t\twhile(1){\n\t\t\tif(!solve())break;\n\t\t}\n\t\t\n return 0;\n }","accuracy":1,"time_ms":6620,"memory_kb":4968,"score_of_the_acc":-1.4164,"final_rank":18},{"submission_id":"aoj_1195_9529179","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\npair<ll,vector<string>> DFS(string S, int K) {\n if (K == 0) return {1,{S}};\n vector<int> V;\n rep(i,0,S.size()) {\n if (S[i] == (char)(K+'a')) V.push_back(i);\n }\n ll Ret = 0;\n vector<string> ANS;\n pair<ll,vector<string>> P;\n if (V.empty()) {\n P = DFS(S,K-1);\n Ret += P.first;\n rep(i,0,P.second.size()) ANS.push_back(P.second[i]);\n rep(i,0,S.size()) {\n if (S[i] == (char)(K-1+'a')) {\n S[i] = (char)(K+'a');\n auto P = DFS(S,K-1);\n Ret += P.first;\n rep(i,0,P.second.size()) ANS.push_back(P.second[i]);\n S[i] = (char)(K-1+'a');\n }\n }\n }\n else {\n rep(i,0,V[0]) {\n if (S[i] == (char)(K-1+'a')) {\n S[i] = (char)(K+'a');\n P = DFS(S,K-1);\n Ret += P.first;\n rep(i,0,P.second.size()) ANS.push_back(P.second[i]);\n S[i] = (char)(K-1+'a');\n }\n }\n }\n sort(ANS.begin(), ANS.end());\n vector<string> ANS2;\n if (ANS.size() <= 10) ANS2 = ANS;\n else {\n rep(i,0,5) ANS2.push_back(ANS[i]);\n rep(i,0,5) ANS2.push_back(ANS[ANS.size()-5+i]);\n }\n return {Ret, ANS2};\n}\n\nint main() {\nwhile(1) {\n string S;\n cin >> S;\n if (S == \"#\") return 0;\n pair<ll,vector<string>> P = DFS(S,25);\n cout << P.first << endl;\n rep(i,0,P.second.size()) cout << P.second[i] << endl;\n}\n}","accuracy":1,"time_ms":110,"memory_kb":3420,"score_of_the_acc":-0.087,"final_rank":1},{"submission_id":"aoj_1195_9360072","code_snippet":"#include <bits/stdc++.h>\n//#include <atcoder/all>\nusing namespace std;\n\nusing ll = long long;\nusing i64 = long long;\nusing pll = pair<ll,ll>;\nusing plll = pair<pll,ll>;\nusing pii =pair<int,int>;\n\nconstexpr ll mod = 1000000007;\n\nint dx[4]={1,0,-1,0};\nint dy[4]={0,1,0,-1};\nint dX[4]={1,0,-1,0};\nint dY[4]={0,-1,0,1};\n\n\n\n//library\n\n//end\n\n\nusing Graph =vector<vector<ll>>;\n\nint main(){\n while (true){\n string S;\n cin>>S;\n if (S==\"#\")break;\n\n int n=S.size();\n vector<string> ans;\n\n for (int i=0; i<(1<<n); i++){\n unordered_set<int> cset;\n string T=S;\n for (int j=0; j<n; j++){\n int num=S[j]-'a';\n if ((1<<j)&i){\n if (cset.count(num+1)!=0 || S[j]=='z')goto end;\n cset.emplace(num+1);\n T[j]='a'+num+1;\n }\n else{\n if (cset.count(num)==0 && S[j]!='a')goto end;\n cset.emplace(num);\n }\n }\n ans.push_back(T);\n end:;\n }\n sort(ans.begin(),ans.end());\n cout<<ans.size()<<endl;\n if (ans.size()<10){\n for (auto v: ans)cout<<v<<endl;\n }\n else{\n for (int i=0; i<5; i++){\n cout<<ans[i]<<endl;\n }\n for (int i=4; i>=0; i--){\n cout<<ans[ans.size()-1-i]<<endl;\n }\n }\n\n }\n\n return 0;\n\n}","accuracy":1,"time_ms":4630,"memory_kb":4812,"score_of_the_acc":-1.1155,"final_rank":17},{"submission_id":"aoj_1195_9303905","code_snippet":"#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n\n#include <bits/stdc++.h>\nusing namespace std;\n\nvector<short> exist(26);\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n while (true) {\n string s;\n cin >> s;\n if (s == \"#\") break;\n\n int n = s.size();\n vector<string> ans;\n for (int i = 0; i < (1<<n); ++i) {\n string t = s;\n for (int j = 0; j < n; ++j) {\n if ((i >> j & 1) && s[j] != 'z') {\n ++t[j];\n }\n }\n\n string cand = t;\n fill(exist.begin(), exist.end(), 0);\n for (char &c : t) {\n exist[c-'a'] = 1;\n }\n for (int i = 1; i < 26; ++i) {\n if (!exist[i]) continue;\n for (int j = 0; j < t.size(); ++j) {\n if (t[j] == 'a' + i) {\n t[j] -= 1;\n break;\n }\n }\n }\n if (s == t) ans.emplace_back(cand);\n }\n\n sort(ans.begin(), ans.end());\n ans.erase(unique(ans.begin(), ans.end()), ans.end());\n cout << ans.size() << '\\n';\n if (ans.size() <= 10) {\n for (string &c : ans) {\n cout << c << '\\n';\n }\n } else {\n int m = ans.size();\n for (int i = 0; i < 5; ++i) cout << ans[i] << '\\n';\n for (int i = m-5; i < m; ++i) cout << ans[i] << '\\n';\n }\n }\n}","accuracy":1,"time_ms":7480,"memory_kb":4936,"score_of_the_acc":-1.5134,"final_rank":19},{"submission_id":"aoj_1195_9303888","code_snippet":"#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n\n#include <bits/stdc++.h>\nusing namespace std;\n\nvector<short> exist(26);\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n while (true) {\n string s;\n cin >> s;\n if (s == \"#\") break;\n\n int n = s.size();\n vector<string> ans;\n for (int i = 0; i < (1<<n); ++i) {\n string t = s;\n for (int j = 0; j < n; ++j) {\n if ((i >> j & 1) && s[j] != 'z') {\n ++t[j];\n }\n }\n\n string cand = t;\n fill(exist.begin(), exist.end(), 0);\n for (char &c : t) {\n exist[c-'a'] = 1;\n }\n for (int i = 1; i < 26; ++i) {\n if (!exist[i]) continue;\n for (int j = 0; j < t.size(); ++j) {\n if (t[j] == 'a' + i) {\n t[j] -= 1;\n break;\n }\n }\n }\n if (s == t) ans.emplace_back(cand);\n }\n\n unordered_set<string> st;\n for (string & t: ans) {\n st.emplace(t);\n }\n ans.clear();\n for (const string &t : st) {\n ans.emplace_back(t);\n }\n sort(ans.begin(), ans.end());\n cout << ans.size() << '\\n';\n if (ans.size() <= 10) {\n for (string &c : ans) {\n cout << c << '\\n';\n }\n } else {\n int m = ans.size();\n for (int i = 0; i < 5; ++i) cout << ans[i] << '\\n';\n for (int i = m-5; i < m; ++i) cout << ans[i] << '\\n';\n }\n }\n}","accuracy":1,"time_ms":8000,"memory_kb":6008,"score_of_the_acc":-1.9348,"final_rank":20},{"submission_id":"aoj_1195_9173554","code_snippet":"#include <bits/stdc++.h>\n\nint to(char c) {\n return c - 'a';\n}\n\nbool solve() {\n std::string S;\n std::cin >> S;\n if (S == \"#\") return false;\n std::vector<std::string> ans;\n auto rec{[&](auto rec, int i, int used, std::string& cur) -> void {\n if (i == (int)S.size()) {\n assert(cur.size() == S.size());\n ans.push_back(cur);\n return;\n }\n if (S[i] == 'a') {\n if (!(used & (1 << to('b')))) {\n cur += 'b';\n rec(rec, i + 1, used | (1 << to('b')), cur);\n cur.pop_back();\n }\n cur += 'a';\n rec(rec, i + 1, used, cur);\n cur.pop_back();\n }\n else if (S[i] == 'z') {\n if (!(used & (1 << to('z')))) {\n return;\n }\n cur += 'z';\n rec(rec, i + 1, used, cur);\n cur.pop_back();\n }\n else {\n if (!(used & (1 << to(S[i] + 1)))) {\n cur += S[i] + 1;\n rec(rec, i + 1, used | (1 << to(S[i] + 1)), cur);\n cur.pop_back();\n }\n if ((used & (1 << to(S[i])))) {\n cur += S[i];\n rec(rec, i + 1, used, cur);\n cur.pop_back();\n }\n }\n }};\n std::string T;\n rec(rec, 0, 0, T);\n std::sort(ans.begin(), ans.end());\n std::cout << ans.size() << '\\n';\n if (ans.size() <= 10u) {\n for (const auto& x : ans) std::cout << x << '\\n';\n }\n else {\n for (int i{} ; i < 5 ; i++) std::cout << ans[i] << '\\n';\n for (int i{4} ; i >= 0 ; i--) std::cout << ans[ans.size() - i - 1] << '\\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":10,"memory_kb":4400,"score_of_the_acc":-0.4003,"final_rank":4},{"submission_id":"aoj_1195_8976254","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\n} // namespace macro\n\nusing namespace macro;\n#line 3 \"A.cpp\"\n\nvector<string> solve(string target) {\n vector<string> ans;\n auto dfs = [&](auto self, string s, int id) -> void {\n if(id == 25) {\n ans.push_back(s);\n return;\n } else {\n char y = char('z' - id - 1), z = char('z' - id);\n int lz = s.size();\n for(int i : revrep(s.size())) if(s[i] == z) lz = i;\n for(int i : rep(s.size())) if(s[i] == y and i < lz) {\n string t = s;\n t[i] = z;\n self(self, t, id + 1);\n }\n if(lz == s.size()) self(self, s, id + 1);\n }\n };\n\n dfs(dfs, target, 0);\n sort(ans);\n return ans;\n}\n\nint main() {\n while(true) {\n string s = in();\n if(s == \"#\") return 0;\n auto ans = solve(s);\n print(ans.size());\n if(ans.size() <= 10) {\n print_n(ans);\n } else {\n for(int i : rep(5)) print(ans[i]);\n for(int i : revrep(5)) print(ans[ans.size() - 1 - i]);\n }\n }\n}","accuracy":1,"time_ms":20,"memory_kb":4972,"score_of_the_acc":-0.5917,"final_rank":12},{"submission_id":"aoj_1195_8291178","code_snippet":"#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nvoid solve(string S) {\n\tvector<string> Cand;\n\n\t// Brute Force\n\tfor (int i = 0; i < (1 << S.size()); i++) {\n\t\tvector<bool> used(26, false);\n\t\tbool flag = true;\n\t\tfor (int j = 0; j < S.size(); j++) {\n\t\t\tint chr = (S[j] - 'a');\n\t\t\tint prv = chr + ((i >> j) & 1);\n\t\t\tif (chr != prv && (S[j] == 'z' || used[prv] == true)) { flag = false; break; }\n\t\t\tif (chr == prv && (S[j] != 'a' && used[prv] == false)) { flag = false; break; }\n\t\t\tused[prv] = true;\n\t\t}\n\t\tif (flag == false) continue;\n\t\tstring str = \"\";\n\t\tfor (int j = 0; j < S.size(); j++) {\n\t\t\tif (((i >> j) & 1) == 1) str += (S[j] + 1);\n\t\t\tif (((i >> j) & 1) == 0) str += (S[j] + 0);\n\t\t}\n\t\tCand.push_back(str);\n\t}\n\n\t// Sorting\n\tsort(Cand.begin(), Cand.end());\n\tcout << Cand.size() << endl;\n\tif (Cand.size() <= 10) {\n\t\tfor (int i = 0; i < Cand.size(); i++) cout << Cand[i] << endl;\n\t}\n\telse {\n\t\tfor (int i = 0; i < 5; i++) cout << Cand[i] << endl;\n\t\tfor (int i = Cand.size() - 5; i < Cand.size(); i++) cout << Cand[i] << endl;\n\t}\n}\n\nint main() {\n\twhile (true) {\n\t\tstring str; cin >> str;\n\t\tif (str == \"#\") break;\n\t\tsolve(str);\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":690,"memory_kb":4776,"score_of_the_acc":-0.6104,"final_rank":13},{"submission_id":"aoj_1195_8215570","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#define rep(i, a, n) for (int i = a; i < n; i++)\nusing namespace std;\n\nstring s;\nvector<string> vs;\n\nvoid dfs(string &t, int now) {\n if (now == s.size()) {\n vs.push_back(t);\n return;\n }\n int d[26] = {};\n rep(i, 0, now) d[t[i] - 'a']++;\n if (t[now] != 'z' && d[t[now] + 1 - 'a'] == 0) {\n t[now] = t[now] + 1;\n dfs(t, now + 1);\n t[now] = t[now] - 1;\n }\n if (t[now] == 'a' || d[t[now] - 'a'] != 0)\n dfs(t, now + 1);\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n while (1) {\n cin >> s;\n if (s == \"#\")\n break;\n vs.clear();\n dfs(s, 0);\n int ans = vs.size();\n sort(vs.begin(), vs.end());\n cout << ans << endl;\n if (ans <= 10) {\n rep(i, 0, ans) { cout << vs[i] << endl; }\n } else {\n rep(i, 0, 5) { cout << vs[i] << endl; }\n rep(i, ans - 5, ans) { cout << vs[i] << endl; }\n }\n }\n}","accuracy":1,"time_ms":10,"memory_kb":4452,"score_of_the_acc":-0.4176,"final_rank":5},{"submission_id":"aoj_1195_8215566","code_snippet":"#include <bits/stdc++.h>\n#define rep(i, a, n) for (int i = a; i < n; i++)\nusing namespace std;\nstring s;\nset<string> vs;\nbool f[26];\nvoid dfs(string t, int now) {\n if (now == s.size()) {\n vs.insert(t);\n return;\n }\n int d[26] = {};\n rep(i, 0, now) d[t[i] - 'a']++;\n if (t[now] != 'z' && d[t[now] + 1 - 'a'] == 0) {\n string tmp = t;\n tmp[now] = tmp[now] + 1;\n dfs(tmp, now + 1);\n }\n if (t[now] == 'a' || d[t[now] - 'a'] != 0)\n dfs(t, now + 1);\n}\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n while (1) {\n cin >> s;\n if (s == \"#\")\n break;\n vs.clear();\n dfs(s, 0);\n int ans = vs.size();\n cout << ans << endl;\n auto it = vs.begin();\n if (ans <= 10) {\n rep(i, 0, ans) { \n cout << *it++ << endl; \n }\n } else {\n rep(i, 0, 5) { \n cout << *it++ << endl; \n }\n it = prev(vs.end(), 5);\n rep(i, ans - 5, ans) { \n cout << *it++ << endl; \n }\n }\n }\n}","accuracy":1,"time_ms":20,"memory_kb":5236,"score_of_the_acc":-0.6794,"final_rank":14},{"submission_id":"aoj_1195_8215563","code_snippet":"#include <bits/stdc++.h>\n#define rep(i, a, n) for (int i = a; i < n; i++)\nusing namespace std;\nstring s;\nvector<string> vs;\nvoid dfs(string t, int now) {\n if (now == s.size()) {\n vs.push_back(t);\n return;\n }\n int d[26] = {};\n rep(i, 0, now) d[t[i] - 'a']++;\n if (t[now] != 'z' && d[t[now] + 1 - 'a'] == 0) {\n string tmp = t;\n tmp[now] = tmp[now] + 1;\n dfs(tmp, now + 1);\n }\n if (t[now] == 'a' || d[t[now] - 'a'] != 0)\n dfs(t, now + 1);\n}\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n while (1) {\n cin >> s;\n if (s == \"#\")\n break;\n vs.clear();\n dfs(s, 0);\n int ans = vs.size();\n sort(vs.begin(), vs.end());\n cout << ans << endl;\n if (ans <= 10) {\n rep(i, 0, ans) { cout << vs[i] << endl; }\n } else {\n rep(i, 0, 5) { cout << vs[i] << endl; }\n rep(i, ans - 5, ans) { cout << vs[i] << endl; }\n }\n }\n}","accuracy":1,"time_ms":10,"memory_kb":4336,"score_of_the_acc":-0.379,"final_rank":3},{"submission_id":"aoj_1195_8215559","code_snippet":"#include <bits/stdc++.h>\n#define rep(i, a, n) for (int i = a; i < n; i++)\nusing namespace std;\nstring s;\nvector<string> vs;\nbool f[26];\nvoid dfs(string t, int now) {\n if (now == s.size()) {\n vs.push_back(t);\n return;\n }\n int d[26] = {};\n rep(i, 0, now) d[t[i] - 'a']++;\n if (t[now] != 'z' && d[t[now] + 1 - 'a'] == 0) {\n string tmp = t;\n tmp[now] = tmp[now] + 1;\n dfs(tmp, now + 1);\n }\n if (t[now] == 'a' || d[t[now] - 'a'] != 0)\n dfs(t, now + 1);\n}\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n while (1) {\n cin >> s;\n if (s == \"#\")\n break;\n vs.clear();\n dfs(s, 0);\n int ans = vs.size();\n sort(vs.begin(), vs.end());\n cout << ans << endl;\n if (ans <= 10) {\n rep(i, 0, ans) { cout << vs[i] << endl; }\n } else {\n rep(i, 0, 5) { cout << vs[i] << endl; }\n rep(i, ans - 5, ans) { cout << vs[i] << endl; }\n }\n }\n}","accuracy":1,"time_ms":10,"memory_kb":4520,"score_of_the_acc":-0.4402,"final_rank":7}],"string":"[\n {\n \"submission_id\": \"aoj_1195_10848117\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <memory.h>\\n#include <string.h>\\n#define MAX 30\\n\\nchar ch[MAX], p[MAX];\\nint len, b[MAX], ac[30], cnt;\\nchar ch2[1050000][22];\\n\\nvoid dfs(int now, int sw){\\n\\tint i;\\n\\tb[now]=sw;\\n\\tif (now==len){\\n\\t\\tfor (i=1;i<=len;i++){\\n\\t\\t\\tp[i]=ch[i];\\n\\t\\t\\tif (b[i]) p[i]++;\\n\\t\\t}\\n\\t\\tmemset(ac, 0, sizeof(ac));\\n\\t\\tint flag=0;\\n\\t\\tfor (i=1;i<=len;i++){\\n\\t\\t\\tif (ac[p[i]-'a']){\\n\\t\\t\\t\\tif (p[i]!=ch[i]){\\n\\t\\t\\t\\t\\tflag=1;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tac[p[i]-'a']=1;\\n\\t\\t\\t\\tif (p[i]-1!=ch[i] && p[i]!='a'){\\n\\t\\t\\t\\t\\tflag=1;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (flag==0){\\n\\t\\t\\tcnt++;\\n\\t\\t\\tfor (i=1;i<=len;i++) ch2[cnt][i]=p[i];\\n\\t\\t}\\n\\t}else{\\n\\t\\tdfs(now+1, 0);\\n\\t\\tif (ch[now+1]!='z') dfs(now+1, 1);\\n\\t}\\n}\\n\\nint main(void){\\n\\tint i,j;\\n\\tfor (;;){\\n\\t\\tscanf(\\\"%s\\\", &ch[1]);\\n\\t\\tif (ch[1]=='#') break;\\n\\t\\tlen=strlen(&ch[1]);\\n\\t\\tdfs(1, 0);\\n\\t\\tif (ch[1]!='z') dfs(1, 1);\\n\\t\\tprintf(\\\"%d\\\\n\\\", cnt);\\n\\t\\tif (cnt>=10){\\n\\t\\t\\tfor (i=1;i<=5;i++) printf(\\\"%s\\\\n\\\", &ch2[i][1]);\\n\\t\\t\\tfor (i=cnt-4;i<=cnt;i++) printf(\\\"%s\\\\n\\\", &ch2[i][1]);\\n\\t\\t}else{\\n\\t\\t\\tfor (i=1;i<=cnt;i++) printf(\\\"%s\\\\n\\\", &ch2[i][1]);\\n\\t\\t}\\n\\t\\tfor (i=1;i<=cnt;i++){\\n\\t\\t\\tfor (j=1;j<=len;j++) ch2[i][j]=0;\\n\\t\\t}\\n\\t\\tcnt=0;\\n\\n\\t}\\n\\treturn false;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1630,\n \"memory_kb\": 3196,\n \"score_of_the_acc\": -0.2028,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1195_10801516\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define Mid (l + r >> 1)\\n#define lson (rt << 1)\\n#define rson (rt << 1 | 1)\\nusing namespace std;\\nint read() {\\n\\tchar c; int num, f = 1;\\n\\twhile(c = getchar(),!isdigit(c)) if(c == '-') f = -1; num = c - '0';\\n\\twhile(c = getchar(), isdigit(c)) num = num * 10 + c - '0';\\n\\treturn f * num;\\n}\\nstring s;\\nvector<string> v;\\nvoid dfs(char c) {\\n\\tif(c == 'a' - 1) {\\n\\t\\tv.push_back(s);\\n\\t\\treturn ;\\n\\t}\\n\\tint f = 0;\\n\\tfor(int i = 0; i < s.size(); i++) {\\n\\t\\tif(s[i] == c + 1) {\\n\\t\\t\\tf = 1;\\n\\t\\t\\tbreak;\\n\\t\\t} else if(s[i] == c) {\\n\\t\\t\\ts[i] = c + 1;\\n\\t\\t\\tdfs(c - 1);\\n\\t\\t\\ts[i] = c;\\n\\t\\t}\\n\\t}\\n\\tif(!f) dfs(c - 1);\\n}\\nvoid work() {\\n\\tif(s.size() == 1 && s[0] == '#') exit(0);\\n\\tv.clear();\\n\\tdfs('y');\\n\\tsort(v.begin(), v.end());\\n\\tcout << v.size() << endl;\\n\\tif(v.size() <= 10) {\\n\\t\\tfor(auto x : v)\\n\\t\\t\\tcout << x << endl;\\n\\t} else {\\n\\t\\tfor(int i = 0; i < 5; i++)\\n\\t\\t\\tcout << v[i] << endl;\\n\\t\\tfor(int i = v.size() - 5; i < v.size(); i++)\\n\\t\\t\\tcout << v[i] << endl;\\n\\t}\\n}\\nsigned main()\\n{\\n\\twhile(cin >> s) work();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4568,\n \"score_of_the_acc\": -0.4561,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1195_10612579\",\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\\nbl solve()\\n{\\n string s;\\n cin >> s;\\n if (s == \\\"#\\\")\\n return 0;\\n ll n = s.size();\\n vvs t(n + 1);\\n t[0].pb({\\\"\\\"});\\n rep(i, n)\\n {\\n char x = s[i];\\n rep(j, t[i].size())\\n {\\n string st = t[i][j];\\n bl include = false;\\n rep(k, st.size())\\n {\\n if (st[k] == x)\\n {\\n include = true;\\n break;\\n }\\n }\\n if (include||x=='a')\\n {\\n string nex = st;\\n nex += x;\\n t[i + 1].pb(nex);\\n if (x != 'z')\\n {\\n bl ok = true;\\n rep(k, st.size())\\n {\\n if (st[k] == x + 1)\\n {\\n ok = false;\\n break;\\n }\\n }\\n if (!ok)\\n continue;\\n string nex2 = st;\\n nex2 += (x + 1);\\n t[i + 1].pb(nex2);\\n }\\n }\\n else\\n {\\n if (x == 'z')\\n continue;\\n bl ok = true;\\n rep(k, st.size())\\n {\\n if (st[k] == x + 1)\\n {\\n ok = false;\\n break;\\n }\\n }\\n if (!ok)\\n continue;\\n string nex = st;\\n nex += (x + 1);\\n t[i + 1].pb(nex);\\n }\\n }\\n }\\n // debug_vv(t);\\n // rep(i, 25)\\n // {\\n // char tar = 'a' + i;\\n // char prev = tar + 1;\\n // vs cand;\\n // for (auto t : st)\\n // {\\n // rep(j, t.size())\\n // {\\n // if (t[j] == tar)\\n // {\\n // t[j] = prev;\\n // cand.pb(t);\\n // t[j] = tar;\\n // break;\\n // }\\n // }\\n // }\\n // rep(j, cand.size())\\n // {\\n // string tmp = cand[j];\\n // rep(k, 25)\\n // {\\n // char tar = 'a' + k + 1;\\n // char nex = tar - 1;\\n // rep(l, tmp.size())\\n // {\\n // if (tmp[l] == tar)\\n // {\\n // tmp[l] = nex;\\n // break;\\n // }\\n // }\\n // // if (i < 3)\\n // // {\\n // // cout << i << endl;\\n // // cout << t << endl;\\n // // }\\n // }\\n // if (tmp == s)\\n // {\\n // // cout << \\\"ERIRIRIRIRIIRIIIIIII\\\" << t << endl;\\n // st.insert(cand[j]);\\n // }\\n // }\\n // }\\n // vs elimi;\\n // for (auto t : st)\\n // {\\n // // cout << \\\"start is\\\" << t << endl;\\n // string start = t;\\n // rep(i, 25)\\n // {\\n // char tar = 'a' + i + 1;\\n // char nex = tar - 1;\\n // rep(j, t.size())\\n // {\\n // if (t[j] == tar)\\n // {\\n // t[j] = nex;\\n // break;\\n // }\\n // }\\n // // if (i < 3)\\n // // {\\n // // cout << i << endl;\\n // // cout << t << endl;\\n // // }\\n // }\\n // if (t != s)\\n // {\\n // // cout << \\\"ERIRIRIRIRIIRIIIIIII\\\" << t << endl;\\n // elimi.pb(start);\\n // }\\n // }\\n // rep(i, elimi.size())\\n // {\\n // // cout << elimi[i] << endl;\\n // st.erase(elimi[i]);\\n // }\\n cout << t[n].size() << endl;\\n if (t[n].size() <= 10)\\n {\\n rep(i,t[n].size()){\\n cout << t[n][i] << endl;\\n }\\n }\\n else\\n {\\n for(ll i=0;i<5;i++){\\n cout << t[n][i] << endl;\\n }\\n for(ll i=t[n].size()-5;i<t[n].size();i++){\\n cout << t[n][i] << endl;\\n }\\n }\\n return 1;\\n}\\n\\nsigned main()\\n{\\n ios_base::sync_with_stdio(false);\\n cin.tie(nullptr);\\n while (true)\\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\": 20,\n \"memory_kb\": 6204,\n \"score_of_the_acc\": -1.0013,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1195_10556325\",\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\\npair<ll,set<string>> myans(string s){\\n //答えの型注意\\n ll n = sz(s);\\n set<string> mae;\\n set<string> usi;\\n auto check = [&](string &t){\\n vll fin(26,-1);\\n // string u = t;\\n rep(i,sz(t)){\\n ll v= t[i]-'a';\\n if(fin[v] == -1 && v != 0){\\n fin[v] = i ;\\n t[i] = char('a'+v-1);\\n }\\n }\\n bool same = t == s;\\n rep(i,26)if(fin[i]!= -1){\\n ll v= t[fin[i]]-'a';\\n t[fin[i]] = char('a' + v+1);\\n }\\n return same;\\n };\\n ll ans = 0;\\n rep(i,1 << n){\\n string t = \\\"\\\";\\n bool able = true;\\n rep(j,n){\\n //次にする\\n if(i >> j & 1){\\n if(s[j] == 'z'){\\n able = false;\\n }else{\\n t += char('a'+(s[j]-'a')+1);\\n }\\n }else{\\n t += s[j];\\n }\\n }\\n if(!able)continue;\\n \\n if(check(t)){\\n ans++;\\n mae.insert(t);\\n while(sz(mae) > 5){\\n mae.erase(*mae.rbegin());\\n }\\n usi.insert(t);\\n while(sz(usi) > 5){\\n usi.erase(*usi.begin());\\n }\\n }\\n }\\n set<string> ret = mae;\\n each(p,usi){\\n ret.insert(p);\\n }\\n // cout << ans << endl;\\n // each(p,ret){\\n // cout << p << endl;\\n // }\\n return {ans,ret};\\n}\\n\\n\\nint main(){\\n ios::sync_with_stdio(false);cin.tie(nullptr);\\n while(true) {\\n string s;\\n cin >> s;\\n if (s == \\\"#\\\") break;\\n auto [ans,ret] = myans(s);\\n cout << ans << endl;\\n each(p,ret){\\n cout << p << endl;\\n }\\n }\\n // string t = \\\"acd\\\";\\n // cout << encode(t) << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 7050,\n \"memory_kb\": 3456,\n \"score_of_the_acc\": -0.9675,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1195_10447118\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\nusing ll = long long;\\n\\nconstexpr int SIZ = 26;\\n\\nvector<string> ans;\\nvoid dfs(string cur, string& S, vector<bool> shifted) {\\n if (cur.size() == S.size()) {\\n ans.push_back(cur);\\n return;\\n }\\n\\n const int pos = static_cast<int>(cur.size());\\n if (shifted[S[pos] - 'a'] || S[pos] == 'a') {\\n cur.push_back(S[pos]);\\n dfs(cur, S, shifted);\\n cur.pop_back();\\n }\\n\\n if (S[pos] != 'z') {\\n if (shifted[S[pos] + 1 - 'a']) {\\n return;\\n }\\n shifted[S[pos] + 1 - 'a'] = true;\\n cur.push_back(static_cast<char>(S[pos] + 1));\\n dfs(cur, S, shifted);\\n cur.pop_back();\\n shifted[S[pos] + 1 - 'a'] = false;\\n }\\n}\\n\\nint main() {\\n while (true) {\\n string S;\\n cin >> S;\\n if (S == \\\"#\\\") {\\n break;\\n }\\n\\n ans.clear();\\n vector shifted(SIZ, false);\\n dfs(\\\"\\\", S, shifted);\\n\\n ranges::sort(ans);\\n ans.erase(ranges::unique(ans).begin(), ans.end());\\n\\n const int n = static_cast<int>(ans.size());\\n cout << n << endl;\\n if (n <= 10) {\\n for (int i = 0; i < n; i++) {\\n cout << ans[i] << endl;\\n }\\n } else {\\n for (int i = 0; i < 5; i++) {\\n cout << ans[i] << endl;\\n }\\n for (int i = n - 5; i < n; i++) {\\n cout << ans[i] << endl;\\n }\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4952,\n \"score_of_the_acc\": -0.585,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1195_10447112\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\nusing ll = long long;\\n\\nconstexpr int SIZ = 26;\\n\\nvector<string> ans;\\nvoid solve(string cur, string& S, vector<bool> used) {\\n if (cur.size() == S.size()) {\\n ans.push_back(cur);\\n return;\\n }\\n\\n const int id = static_cast<int>(cur.size());\\n if (used[S[id] - 'a'] || S[id] == 'a') {\\n cur.push_back(S[id]);\\n solve(cur, S, used);\\n cur.pop_back();\\n }\\n\\n if (S[id] != 'z') {\\n if (used[S[id] + 1 - 'a']) {\\n return;\\n }\\n used[S[id] + 1 - 'a'] = true;\\n cur.push_back(char(S[id] + 1));\\n solve(cur, S, used);\\n cur.pop_back();\\n used[S[id] + 1 - 'a'] = false;\\n }\\n}\\n\\nint main() {\\n while (true) {\\n string S;\\n cin >> S;\\n if (S == \\\"#\\\") {\\n break;\\n }\\n\\n ans.clear();\\n vector used(SIZ, false);\\n solve(\\\"\\\", S, used);\\n\\n ranges::sort(ans);\\n ans.erase(ranges::unique(ans).begin(), ans.end());\\n\\n const int n = static_cast<int>(ans.size());\\n cout << n << endl;\\n if (n <= 10) {\\n for (int i = 0; i < n; i++) {\\n cout << ans[i] << endl;\\n }\\n } else {\\n for (int i = 0; i < 5; i++) {\\n cout << ans[i] << endl;\\n }\\n for (int i = n - 5; i < n; i++) {\\n cout << ans[i] << endl;\\n }\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4952,\n \"score_of_the_acc\": -0.585,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1195_10272480\",\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\\n\\nstring s;\\nint n;\\nvector<string> ans(0);\\n\\n\\nvoid f(int st, string t) {\\n if (st == -1) {\\n ans.push_back(t);\\n return;\\n }\\n\\n int fl = 0;\\n rep(i,n) {\\n if (t[i] == 'a'+st) {\\n fl++;\\n t[i]++;\\n f(st-1,t);\\n t[i]--;\\n }\\n else if (t[i] == 'a'+st+1) {\\n return;\\n }\\n }\\n\\n f(st-1,t);\\n \\n}\\n\\n\\nvoid solve() {\\n ans.resize(0);\\n n = s.length();\\n\\n f(24,s);\\n\\n sort(all(ans));\\n\\n cout << ans.size() << endl;\\n if (ans.size() >= 11) {\\n rep(i,5) {\\n cout << ans[i] << endl;\\n }\\n rep(i,5) {\\n cout << ans[ans.size()+i-5] << endl;\\n }\\n }\\n else {\\n rep(i,ans.size()) {\\n cout << ans[i] << endl;\\n }\\n }\\n return;\\n\\n\\n}\\n\\n\\nint main() {\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n\\n while (cin >> s && s != \\\"#\\\") {\\n solve();\\n }\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4500,\n \"score_of_the_acc\": -0.4348,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1195_10272414\",\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); } }\\nvc<string> tot;\\nstring S;\\nvoid f(int c){\\n if (c == 0){\\n tot.push_back(S);\\n return;\\n }\\n \\n rep(i, len(S)){\\n if (S[i] == 'a' + c) return;\\n if (S[i] == 'a' + c - 1){\\n S[i]++;\\n f(c - 1);\\n S[i]--;\\n }\\n }\\n f(c - 1);\\n}\\nvoid solve(){\\n tot.clear();\\n f(25);\\n sort(all(tot));\\n cout << len(tot) << endl;\\n if (len(tot) < 10){\\n for (auto x : tot) cout << x << endl;\\n }else{\\n rep(i, 5) cout << tot[i] << endl;\\n srep(i, len(tot) - 5, len(tot)) cout << tot[i] << endl;\\n }\\n}\\n\\nint main(){\\n while (true){\\n cin >> S;\\n if (S == \\\"#\\\") break;\\n solve();\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4540,\n \"score_of_the_acc\": -0.4468,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1195_9704774\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n using namespace std;\\n \\n template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\n template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n #define rep(i,n) for (int i = 0; i < (n); ++i)\\n\\n typedef long long ll;\\n typedef unsigned long long ull;\\n using P=pair<ll,ll>;\\n using tp=tuple<ll,ll,ll>;\\n const int INF=1001001001;\\n const ll INFL=1e18;\\n const int mod=998244353;\\n\\n\\tbool check(string s,string target){\\n\\t\\tint n=s.size();\\n\\t\\tfor(char c='b';c<='z';c++){\\n\\t\\t\\trep(i,n){\\n\\t\\t\\t\\tif(s[i]==c){\\n\\t\\t\\t\\t\\ts[i]=c-1;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn s==target;\\n\\t}\\n\\n\\tvoid dfs(int i,string& s,string& target,vector<string>& t){\\n\\t\\tint n=s.size();\\n\\t\\tif(i==s.size()){\\n\\t\\t\\tif(check(s,target))t.push_back(s);\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tdfs(i+1,s,target,t);\\n\\t\\ts[i]+=1;\\n\\t\\tdfs(i+1,s,target,t);\\n\\t\\ts[i]-=1;\\n\\t}\\n bool solve(){\\n\\t\\tstring s;\\n\\t\\tcin>>s;\\n\\t\\tif(s==\\\"#\\\")return false;\\n\\n\\t\\tvector<string>t;\\n\\t\\tstring target=s;\\n\\t\\tdfs(0,s,target,t);\\n\\t\\tsort(t.begin(),t.end());\\n\\n\\t\\tint T=t.size();\\n\\t\\tcout<<T<<endl;\\n\\t\\tif(T>10){\\n\\t\\t\\trep(i,5){\\n\\t\\t\\t\\tcout<<t[i]<<endl;\\n\\t\\t\\t}\\n\\t\\t\\trep(i,5){\\n\\t\\t\\t\\tcout<<t[T-5+i]<<endl;\\n\\t\\t\\t}\\n\\t\\t}else{\\n\\t\\t\\trep(i,T){\\n\\t\\t\\t\\tcout<<t[i]<<endl;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn true;\\n }\\n\\n int main(){\\n ios_base::sync_with_stdio(false);\\n cin.tie(NULL);\\n\\n\\t\\twhile(1){\\n\\t\\t\\tif(!solve())break;\\n\\t\\t}\\n\\t\\t\\n return 0;\\n }\",\n \"accuracy\": 1,\n \"time_ms\": 6620,\n \"memory_kb\": 4968,\n \"score_of_the_acc\": -1.4164,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1195_9529179\",\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\\npair<ll,vector<string>> DFS(string S, int K) {\\n if (K == 0) return {1,{S}};\\n vector<int> V;\\n rep(i,0,S.size()) {\\n if (S[i] == (char)(K+'a')) V.push_back(i);\\n }\\n ll Ret = 0;\\n vector<string> ANS;\\n pair<ll,vector<string>> P;\\n if (V.empty()) {\\n P = DFS(S,K-1);\\n Ret += P.first;\\n rep(i,0,P.second.size()) ANS.push_back(P.second[i]);\\n rep(i,0,S.size()) {\\n if (S[i] == (char)(K-1+'a')) {\\n S[i] = (char)(K+'a');\\n auto P = DFS(S,K-1);\\n Ret += P.first;\\n rep(i,0,P.second.size()) ANS.push_back(P.second[i]);\\n S[i] = (char)(K-1+'a');\\n }\\n }\\n }\\n else {\\n rep(i,0,V[0]) {\\n if (S[i] == (char)(K-1+'a')) {\\n S[i] = (char)(K+'a');\\n P = DFS(S,K-1);\\n Ret += P.first;\\n rep(i,0,P.second.size()) ANS.push_back(P.second[i]);\\n S[i] = (char)(K-1+'a');\\n }\\n }\\n }\\n sort(ANS.begin(), ANS.end());\\n vector<string> ANS2;\\n if (ANS.size() <= 10) ANS2 = ANS;\\n else {\\n rep(i,0,5) ANS2.push_back(ANS[i]);\\n rep(i,0,5) ANS2.push_back(ANS[ANS.size()-5+i]);\\n }\\n return {Ret, ANS2};\\n}\\n\\nint main() {\\nwhile(1) {\\n string S;\\n cin >> S;\\n if (S == \\\"#\\\") return 0;\\n pair<ll,vector<string>> P = DFS(S,25);\\n cout << P.first << endl;\\n rep(i,0,P.second.size()) cout << P.second[i] << endl;\\n}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 3420,\n \"score_of_the_acc\": -0.087,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1195_9360072\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//#include <atcoder/all>\\nusing namespace std;\\n\\nusing ll = long long;\\nusing i64 = long long;\\nusing pll = pair<ll,ll>;\\nusing plll = pair<pll,ll>;\\nusing pii =pair<int,int>;\\n\\nconstexpr ll mod = 1000000007;\\n\\nint dx[4]={1,0,-1,0};\\nint dy[4]={0,1,0,-1};\\nint dX[4]={1,0,-1,0};\\nint dY[4]={0,-1,0,1};\\n\\n\\n\\n//library\\n\\n//end\\n\\n\\nusing Graph =vector<vector<ll>>;\\n\\nint main(){\\n while (true){\\n string S;\\n cin>>S;\\n if (S==\\\"#\\\")break;\\n\\n int n=S.size();\\n vector<string> ans;\\n\\n for (int i=0; i<(1<<n); i++){\\n unordered_set<int> cset;\\n string T=S;\\n for (int j=0; j<n; j++){\\n int num=S[j]-'a';\\n if ((1<<j)&i){\\n if (cset.count(num+1)!=0 || S[j]=='z')goto end;\\n cset.emplace(num+1);\\n T[j]='a'+num+1;\\n }\\n else{\\n if (cset.count(num)==0 && S[j]!='a')goto end;\\n cset.emplace(num);\\n }\\n }\\n ans.push_back(T);\\n end:;\\n }\\n sort(ans.begin(),ans.end());\\n cout<<ans.size()<<endl;\\n if (ans.size()<10){\\n for (auto v: ans)cout<<v<<endl;\\n }\\n else{\\n for (int i=0; i<5; i++){\\n cout<<ans[i]<<endl;\\n }\\n for (int i=4; i>=0; i--){\\n cout<<ans[ans.size()-1-i]<<endl;\\n }\\n }\\n\\n }\\n\\n return 0;\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4630,\n \"memory_kb\": 4812,\n \"score_of_the_acc\": -1.1155,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1195_9303905\",\n \"code_snippet\": \"#pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\nvector<short> exist(26);\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n while (true) {\\n string s;\\n cin >> s;\\n if (s == \\\"#\\\") break;\\n\\n int n = s.size();\\n vector<string> ans;\\n for (int i = 0; i < (1<<n); ++i) {\\n string t = s;\\n for (int j = 0; j < n; ++j) {\\n if ((i >> j & 1) && s[j] != 'z') {\\n ++t[j];\\n }\\n }\\n\\n string cand = t;\\n fill(exist.begin(), exist.end(), 0);\\n for (char &c : t) {\\n exist[c-'a'] = 1;\\n }\\n for (int i = 1; i < 26; ++i) {\\n if (!exist[i]) continue;\\n for (int j = 0; j < t.size(); ++j) {\\n if (t[j] == 'a' + i) {\\n t[j] -= 1;\\n break;\\n }\\n }\\n }\\n if (s == t) ans.emplace_back(cand);\\n }\\n\\n sort(ans.begin(), ans.end());\\n ans.erase(unique(ans.begin(), ans.end()), ans.end());\\n cout << ans.size() << '\\\\n';\\n if (ans.size() <= 10) {\\n for (string &c : ans) {\\n cout << c << '\\\\n';\\n }\\n } else {\\n int m = ans.size();\\n for (int i = 0; i < 5; ++i) cout << ans[i] << '\\\\n';\\n for (int i = m-5; i < m; ++i) cout << ans[i] << '\\\\n';\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 7480,\n \"memory_kb\": 4936,\n \"score_of_the_acc\": -1.5134,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1195_9303888\",\n \"code_snippet\": \"#pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\nvector<short> exist(26);\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n while (true) {\\n string s;\\n cin >> s;\\n if (s == \\\"#\\\") break;\\n\\n int n = s.size();\\n vector<string> ans;\\n for (int i = 0; i < (1<<n); ++i) {\\n string t = s;\\n for (int j = 0; j < n; ++j) {\\n if ((i >> j & 1) && s[j] != 'z') {\\n ++t[j];\\n }\\n }\\n\\n string cand = t;\\n fill(exist.begin(), exist.end(), 0);\\n for (char &c : t) {\\n exist[c-'a'] = 1;\\n }\\n for (int i = 1; i < 26; ++i) {\\n if (!exist[i]) continue;\\n for (int j = 0; j < t.size(); ++j) {\\n if (t[j] == 'a' + i) {\\n t[j] -= 1;\\n break;\\n }\\n }\\n }\\n if (s == t) ans.emplace_back(cand);\\n }\\n\\n unordered_set<string> st;\\n for (string & t: ans) {\\n st.emplace(t);\\n }\\n ans.clear();\\n for (const string &t : st) {\\n ans.emplace_back(t);\\n }\\n sort(ans.begin(), ans.end());\\n cout << ans.size() << '\\\\n';\\n if (ans.size() <= 10) {\\n for (string &c : ans) {\\n cout << c << '\\\\n';\\n }\\n } else {\\n int m = ans.size();\\n for (int i = 0; i < 5; ++i) cout << ans[i] << '\\\\n';\\n for (int i = m-5; i < m; ++i) cout << ans[i] << '\\\\n';\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 8000,\n \"memory_kb\": 6008,\n \"score_of_the_acc\": -1.9348,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1195_9173554\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nint to(char c) {\\n return c - 'a';\\n}\\n\\nbool solve() {\\n std::string S;\\n std::cin >> S;\\n if (S == \\\"#\\\") return false;\\n std::vector<std::string> ans;\\n auto rec{[&](auto rec, int i, int used, std::string& cur) -> void {\\n if (i == (int)S.size()) {\\n assert(cur.size() == S.size());\\n ans.push_back(cur);\\n return;\\n }\\n if (S[i] == 'a') {\\n if (!(used & (1 << to('b')))) {\\n cur += 'b';\\n rec(rec, i + 1, used | (1 << to('b')), cur);\\n cur.pop_back();\\n }\\n cur += 'a';\\n rec(rec, i + 1, used, cur);\\n cur.pop_back();\\n }\\n else if (S[i] == 'z') {\\n if (!(used & (1 << to('z')))) {\\n return;\\n }\\n cur += 'z';\\n rec(rec, i + 1, used, cur);\\n cur.pop_back();\\n }\\n else {\\n if (!(used & (1 << to(S[i] + 1)))) {\\n cur += S[i] + 1;\\n rec(rec, i + 1, used | (1 << to(S[i] + 1)), cur);\\n cur.pop_back();\\n }\\n if ((used & (1 << to(S[i])))) {\\n cur += S[i];\\n rec(rec, i + 1, used, cur);\\n cur.pop_back();\\n }\\n }\\n }};\\n std::string T;\\n rec(rec, 0, 0, T);\\n std::sort(ans.begin(), ans.end());\\n std::cout << ans.size() << '\\\\n';\\n if (ans.size() <= 10u) {\\n for (const auto& x : ans) std::cout << x << '\\\\n';\\n }\\n else {\\n for (int i{} ; i < 5 ; i++) std::cout << ans[i] << '\\\\n';\\n for (int i{4} ; i >= 0 ; i--) std::cout << ans[ans.size() - i - 1] << '\\\\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\": 10,\n \"memory_kb\": 4400,\n \"score_of_the_acc\": -0.4003,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1195_8976254\",\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\\n} // namespace macro\\n\\nusing namespace macro;\\n#line 3 \\\"A.cpp\\\"\\n\\nvector<string> solve(string target) {\\n vector<string> ans;\\n auto dfs = [&](auto self, string s, int id) -> void {\\n if(id == 25) {\\n ans.push_back(s);\\n return;\\n } else {\\n char y = char('z' - id - 1), z = char('z' - id);\\n int lz = s.size();\\n for(int i : revrep(s.size())) if(s[i] == z) lz = i;\\n for(int i : rep(s.size())) if(s[i] == y and i < lz) {\\n string t = s;\\n t[i] = z;\\n self(self, t, id + 1);\\n }\\n if(lz == s.size()) self(self, s, id + 1);\\n }\\n };\\n\\n dfs(dfs, target, 0);\\n sort(ans);\\n return ans;\\n}\\n\\nint main() {\\n while(true) {\\n string s = in();\\n if(s == \\\"#\\\") return 0;\\n auto ans = solve(s);\\n print(ans.size());\\n if(ans.size() <= 10) {\\n print_n(ans);\\n } else {\\n for(int i : rep(5)) print(ans[i]);\\n for(int i : revrep(5)) print(ans[ans.size() - 1 - i]);\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4972,\n \"score_of_the_acc\": -0.5917,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1195_8291178\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <vector>\\n#include <algorithm>\\nusing namespace std;\\n\\nvoid solve(string S) {\\n\\tvector<string> Cand;\\n\\n\\t// Brute Force\\n\\tfor (int i = 0; i < (1 << S.size()); i++) {\\n\\t\\tvector<bool> used(26, false);\\n\\t\\tbool flag = true;\\n\\t\\tfor (int j = 0; j < S.size(); j++) {\\n\\t\\t\\tint chr = (S[j] - 'a');\\n\\t\\t\\tint prv = chr + ((i >> j) & 1);\\n\\t\\t\\tif (chr != prv && (S[j] == 'z' || used[prv] == true)) { flag = false; break; }\\n\\t\\t\\tif (chr == prv && (S[j] != 'a' && used[prv] == false)) { flag = false; break; }\\n\\t\\t\\tused[prv] = true;\\n\\t\\t}\\n\\t\\tif (flag == false) continue;\\n\\t\\tstring str = \\\"\\\";\\n\\t\\tfor (int j = 0; j < S.size(); j++) {\\n\\t\\t\\tif (((i >> j) & 1) == 1) str += (S[j] + 1);\\n\\t\\t\\tif (((i >> j) & 1) == 0) str += (S[j] + 0);\\n\\t\\t}\\n\\t\\tCand.push_back(str);\\n\\t}\\n\\n\\t// Sorting\\n\\tsort(Cand.begin(), Cand.end());\\n\\tcout << Cand.size() << endl;\\n\\tif (Cand.size() <= 10) {\\n\\t\\tfor (int i = 0; i < Cand.size(); i++) cout << Cand[i] << endl;\\n\\t}\\n\\telse {\\n\\t\\tfor (int i = 0; i < 5; i++) cout << Cand[i] << endl;\\n\\t\\tfor (int i = Cand.size() - 5; i < Cand.size(); i++) cout << Cand[i] << endl;\\n\\t}\\n}\\n\\nint main() {\\n\\twhile (true) {\\n\\t\\tstring str; cin >> str;\\n\\t\\tif (str == \\\"#\\\") break;\\n\\t\\tsolve(str);\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 690,\n \"memory_kb\": 4776,\n \"score_of_the_acc\": -0.6104,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1195_8215570\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#define rep(i, a, n) for (int i = a; i < n; i++)\\nusing namespace std;\\n\\nstring s;\\nvector<string> vs;\\n\\nvoid dfs(string &t, int now) {\\n if (now == s.size()) {\\n vs.push_back(t);\\n return;\\n }\\n int d[26] = {};\\n rep(i, 0, now) d[t[i] - 'a']++;\\n if (t[now] != 'z' && d[t[now] + 1 - 'a'] == 0) {\\n t[now] = t[now] + 1;\\n dfs(t, now + 1);\\n t[now] = t[now] - 1;\\n }\\n if (t[now] == 'a' || d[t[now] - 'a'] != 0)\\n dfs(t, now + 1);\\n}\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n while (1) {\\n cin >> s;\\n if (s == \\\"#\\\")\\n break;\\n vs.clear();\\n dfs(s, 0);\\n int ans = vs.size();\\n sort(vs.begin(), vs.end());\\n cout << ans << endl;\\n if (ans <= 10) {\\n rep(i, 0, ans) { cout << vs[i] << endl; }\\n } else {\\n rep(i, 0, 5) { cout << vs[i] << endl; }\\n rep(i, ans - 5, ans) { cout << vs[i] << endl; }\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4452,\n \"score_of_the_acc\": -0.4176,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1195_8215566\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define rep(i, a, n) for (int i = a; i < n; i++)\\nusing namespace std;\\nstring s;\\nset<string> vs;\\nbool f[26];\\nvoid dfs(string t, int now) {\\n if (now == s.size()) {\\n vs.insert(t);\\n return;\\n }\\n int d[26] = {};\\n rep(i, 0, now) d[t[i] - 'a']++;\\n if (t[now] != 'z' && d[t[now] + 1 - 'a'] == 0) {\\n string tmp = t;\\n tmp[now] = tmp[now] + 1;\\n dfs(tmp, now + 1);\\n }\\n if (t[now] == 'a' || d[t[now] - 'a'] != 0)\\n dfs(t, now + 1);\\n}\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n while (1) {\\n cin >> s;\\n if (s == \\\"#\\\")\\n break;\\n vs.clear();\\n dfs(s, 0);\\n int ans = vs.size();\\n cout << ans << endl;\\n auto it = vs.begin();\\n if (ans <= 10) {\\n rep(i, 0, ans) { \\n cout << *it++ << endl; \\n }\\n } else {\\n rep(i, 0, 5) { \\n cout << *it++ << endl; \\n }\\n it = prev(vs.end(), 5);\\n rep(i, ans - 5, ans) { \\n cout << *it++ << endl; \\n }\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 5236,\n \"score_of_the_acc\": -0.6794,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1195_8215563\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define rep(i, a, n) for (int i = a; i < n; i++)\\nusing namespace std;\\nstring s;\\nvector<string> vs;\\nvoid dfs(string t, int now) {\\n if (now == s.size()) {\\n vs.push_back(t);\\n return;\\n }\\n int d[26] = {};\\n rep(i, 0, now) d[t[i] - 'a']++;\\n if (t[now] != 'z' && d[t[now] + 1 - 'a'] == 0) {\\n string tmp = t;\\n tmp[now] = tmp[now] + 1;\\n dfs(tmp, now + 1);\\n }\\n if (t[now] == 'a' || d[t[now] - 'a'] != 0)\\n dfs(t, now + 1);\\n}\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n while (1) {\\n cin >> s;\\n if (s == \\\"#\\\")\\n break;\\n vs.clear();\\n dfs(s, 0);\\n int ans = vs.size();\\n sort(vs.begin(), vs.end());\\n cout << ans << endl;\\n if (ans <= 10) {\\n rep(i, 0, ans) { cout << vs[i] << endl; }\\n } else {\\n rep(i, 0, 5) { cout << vs[i] << endl; }\\n rep(i, ans - 5, ans) { cout << vs[i] << endl; }\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4336,\n \"score_of_the_acc\": -0.379,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1195_8215559\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define rep(i, a, n) for (int i = a; i < n; i++)\\nusing namespace std;\\nstring s;\\nvector<string> vs;\\nbool f[26];\\nvoid dfs(string t, int now) {\\n if (now == s.size()) {\\n vs.push_back(t);\\n return;\\n }\\n int d[26] = {};\\n rep(i, 0, now) d[t[i] - 'a']++;\\n if (t[now] != 'z' && d[t[now] + 1 - 'a'] == 0) {\\n string tmp = t;\\n tmp[now] = tmp[now] + 1;\\n dfs(tmp, now + 1);\\n }\\n if (t[now] == 'a' || d[t[now] - 'a'] != 0)\\n dfs(t, now + 1);\\n}\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n while (1) {\\n cin >> s;\\n if (s == \\\"#\\\")\\n break;\\n vs.clear();\\n dfs(s, 0);\\n int ans = vs.size();\\n sort(vs.begin(), vs.end());\\n cout << ans << endl;\\n if (ans <= 10) {\\n rep(i, 0, ans) { cout << vs[i] << endl; }\\n } else {\\n rep(i, 0, 5) { cout << vs[i] << endl; }\\n rep(i, ans - 5, ans) { cout << vs[i] << endl; }\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4520,\n \"score_of_the_acc\": -0.4402,\n \"final_rank\": 7\n }\n]","isConversational":false}}},{"rowIdx":665,"cells":{"group_id":{"kind":"string","value":"aoj_1192_cpp"},"problem_description":{"kind":"string","value":"Tax Rate Changed\nVAT (value-added tax) is a tax imposed at a certain rate proportional to the sale price.\nOur store uses the following rules to calculate the after-tax prices.\nWhen the VAT rate is\nx\n%,\n\tfor an item with the before-tax price of\np\nyen,\n\tits after-tax price of the item is\np\n(100+\nx\n) / 100 yen, fractions rounded off.\nThe total after-tax price of multiple items paid at once is\n\tthe sum of after-tax prices of the items.\nThe VAT rate is changed quite often.\n Our accountant has become aware that\n \"different pairs of items that had the same total after-tax price\n may have different total after-tax prices after VAT rate changes.\"\n For example, when the VAT rate rises from 5% to 8%,\n a pair of items that had the total after-tax prices of 105 yen before\n can now have after-tax prices either of 107, 108, or 109 yen, as shown in the table below.\nBefore-tax prices of two items\nAfter-tax price with 5% VAT\nAfter-tax price with 8% VAT\n20, 80\n21 + 84 = 105\n21 + 86 = 107\n2, 99\n2 + 103 = 105\n2 + 106 = 108\n13, 88\n13 + 92 = 105\n14 + 95 = 109\nOur accountant is examining effects of VAT-rate changes on after-tax prices.\n You are asked to write a program that calculates the possible maximum\n total after-tax price of two items with the new VAT rate,\n knowing their total after-tax price before the VAT rate change.\nInput\nThe input consists of multiple datasets.\n Each dataset is in one line,\n which consists of three integers\nx\n,\ny\n, and\ns\nseparated by a space.\nx\nis the VAT rate in percent\nbefore\nthe VAT-rate change,\ny\nis the VAT rate in percent\nafter\nthe VAT-rate change,\n and\ns\nis the sum of after-tax prices of two items\nbefore\nthe VAT-rate change.\n For these integers, 0 <\nx\n< 100, 0 <\ny\n< 100,\n 10 <\ns\n< 1000, and\nx\n≠\ny\nhold.\n For before-tax prices of items, all possibilities of 1 yen through\ns\n-1 yen should be considered.\nThe end of the input is specified by three zeros separated by a space.\nOutput\nFor each dataset,\n output in a line the possible maximum total after-tax price when the VAT rate is changed to\ny\n%.\nSample Input\n5 8 105\n8 5 105\n1 2 24\n99 98 24\n12 13 26\n1 22 23\n1 13 201\n13 16 112\n2 24 50\n1 82 61\n1 84 125\n1 99 999\n99 1 999\n98 99 999\n1 99 11\n99 1 12\n0 0 0\nOutput for the Sample Input\n109\n103\n24\n24\n26\n27\n225\n116\n62\n111\n230\n1972\n508\n1004\n20\n7\nHints\nIn the following table,\n an instance of a before-tax price pair that has the maximum after-tax price after the VAT-rate change\n is given for each dataset of the sample input.\nDataset\nBefore-tax prices\nAfter-tax price with\ny\n% VAT\n5 8 105\n13, 88\n14 + 95 = 109\n8 5 105\n12, 87\n12 + 91 = 103\n1 2 24\n1, 23\n1 + 23 = 24\n99 98 24\n1, 12\n1 + 23 = 24\n12 13 26\n1, 23\n1 + 25 = 26\n1 22 23\n1, 22\n1 + 26 = 27\n1 13 201\n1,199\n1 +224 = 225\n13 16 112\n25, 75\n29 + 87 = 116\n2 24 50\n25, 25\n31 + 31 = 62\n1 82 61\n11, 50\n20 + 91 = 111\n1 84 125\n50, 75\n92 +138 = 230\n1 99 999\n92,899\n183+1789 =1972\n99 1 999\n1,502\n1 +507 = 508\n98 99 999\n5,500\n9 +995 =1004\n1 99 11\n1, 10\n1 + 19 = 20\n99 \n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1192_10851356","code_snippet":"#include <cstdio>\n#include <algorithm>\n\nusing namespace std;\n\nint main(void) {\n\tint x, y, s;\n\twhile(scanf(\"%d %d %d\", &x, &y, &s), !(x == 0 and y == 0 and s == 0)) {\n\t\tint ans = 0;\n\n\t\tfor(int i = 1; i < s; i++) {\n\t\t\tint j = s - i;\n\t\t\tint xcost = 0;\n\t\t\twhile(xcost * (100 + x) / 100 <= i) xcost++;\n\t\t\txcost--;\n\t\t\tint ycost = 0;\n\t\t\twhile(ycost * (100 + x) / 100 <= j) ycost++;\n\t\t\tycost--;\n\n\t\t\tif(xcost * (100 + x) / 100 + ycost * (100 + x) / 100 != s) continue;\n\n\t\t\tint cand = xcost * (100 + y) / 100 + ycost * (100 + y) / 100;\n\t\t\tif(cand > ans) {\n\t\t\t\tans = cand;\n\t\t\t}\n\t\t}\n\n\t\tprintf(\"%d\\n\", ans);\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":40,"memory_kb":2944,"score_of_the_acc":-0.125,"final_rank":1},{"submission_id":"aoj_1192_10767163","code_snippet":"//Q:https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?lang=jp&id=1192\n\n#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int x, y, s;\n while (cin >> x >> y >> s) {\n if (x == 0 && y == 0 && s == 0) break;\n int ma = 0;\n for (int a = 1; a < s; a++) {\n for (int b = 1; b < s; b++){\n int ta = a * (100 + x) / 100;\n int tb = b * (100 + x) / 100;\n if (ta + tb == s) {\n int na = a * (100 + y) / 100;\n int nb = b * (100 + y) / 100;\n ma = max(ma, na + nb);\n }\n } \n }\n cout << ma << endl;\n }\n}","accuracy":1,"time_ms":60,"memory_kb":3356,"score_of_the_acc":-0.8938,"final_rank":13},{"submission_id":"aoj_1192_10683815","code_snippet":"#include <iostream>\n#include <cassert>\nusing namespace std;\nusing ll = long long;\ntemplate<class T> inline bool chmax(T& a, const T& b) {if (a<b) {a=b; return true;} return false;}\ntemplate<class T> inline bool chmin(T& a, const T& b) {if (b<a) {a=b; return true;} return false;}\nconstexpr int INTINF = 1000001000;\nconstexpr int INTMAX = 2147483647;\nconstexpr ll LLMAX = 9223372036854775807;\nconstexpr ll LLINF = 4450000000011100000;\n\nint calc(int p, int x) {\n return p * (100 + x) / 100; \n}\n\nvoid solve(int x, int y, int s) {\n int ans = 0;\n // s: 税率がx%のときの税込み合計額\n // s = floor(p * (100+x) / x) + floor(\n for (int s1=1; s1<=s-1; s1++){\n for (int s2=1; s2<=s-1; s2++) {\n if (calc(s1,x) + calc(s2,x) != s) continue;\n chmax(ans, calc(s1,y) + calc(s2,y));\n }\n }\n cout << ans << endl;\n}\n\nint main() {\n ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);\n while(true) {\n int x, y, s; cin >> x >> y >> s;\n if (x==0 && y == 0 && s == 0) break;\n solve(x,y,s);\n }\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":3456,"score_of_the_acc":-1.05,"final_rank":15},{"submission_id":"aoj_1192_10683806","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 x, int y, int s) {\n int mx = 0;\n for (int i=1; i<s; ++i) {\n for (int j=1; j<s; ++j) {\n int before = i*(100+x)/100 + j*(100+x)/100;\n if (before != s) continue;\n int after = i*(100+y)/100 + j*(100+y)/100;\n mx = max(mx, after);\n }\n }\n cout << mx << endl;\n}\n\nsigned main() {\n ios::sync_with_stdio(false);cin.tie(nullptr);\n while(true) {\n int x, y, s;\n cin >> x >> y >> s;\n if (x+y+s == 0) break;\n solve(x, y, s);\n }\n}\n\n/*\nmemo\n\n*/","accuracy":1,"time_ms":60,"memory_kb":3584,"score_of_the_acc":-1.25,"final_rank":17},{"submission_id":"aoj_1192_10661873","code_snippet":"// This is free and unencumbered software released into the public domain.\n\n// Anyone is free to copy, modify, publish, use, compile, sell, or\n// distribute this software, either in source code form or as a compiled\n// binary, for any purpose, commercial or non-commercial, and by any\n// means.\n\n// In jurisdictions that recognize copyright laws, the author or authors\n// of this software dedicate any and all copyright interest in the\n// software to the public domain. We make this dedication for the benefit\n// of the public at large and to the detriment of our heirs and\n// successors. We intend this dedication to be an overt act of\n// relinquishment in perpetuity of all present and future rights to this\n// software under copyright law.\n\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n// EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n// IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR\n// OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,\n// ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\n// OTHER DEALINGS IN THE SOFTWARE.\n\n// For more information, please refer to <http://unlicense.org>\n\n/****************/\n/* template.hpp */\n/****************/\n\n#include <cassert>\n#include <iomanip>\n#include <iostream>\n#include <limits>\n\nusing namespace std;\n\n\ntemplate <typename T> void debug(T x) {\n cerr << __LINE__ << \" \" << var_name(x) << \" \" << (x) << endl;\n}\n\ntemplate <typename T> void debug_v(T x) {\n cerr << __LINE__ << \" \" << var_name(x) << \" [\";\n bool first = true;\n for (const auto &itr : x) {\n if (!first) {\n cerr << \", \";\n }\n cerr << itr;\n first = false;\n }\n cerr << \"]\" << endl;\n}\n\nstruct Initializer {\n Initializer() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(15) << boolalpha;\n }\n} initializer;\n\ntemplate <typename T, typename S> bool chmin(T &a, const S &b) {\n return a > b ? a = b, true : false;\n}\n\ntemplate <typename T, typename S> bool chmax(T &a, const S &b) {\n return a < b ? a = b, true : false;\n}\n\ntemplate <typename T> constexpr T inf() {\n return numeric_limits<T>::max() / 2 - 1;\n}\n\n/************/\n/* main.cpp */\n/************/\n\nint main() {\n auto tax = [](int x, int p) { return x * (100 + p) / 100; };\n int x, y, s;\n while (true) {\n cin >> x >> y >> s;\n if (x == 0 && y == 0 && s == 0) {\n break;\n }\n int res = -1;\n for (int i = 1; i < s; ++i) {\n for (int j = i; j < s; ++j) {\n if (tax(i, x) + tax(j, x) == s) {\n chmax(res, tax(i, y) + tax(j, y));\n }\n }\n }\n cout << res << endl;\n }\n}","accuracy":1,"time_ms":30,"memory_kb":3456,"score_of_the_acc":-0.8625,"final_rank":12},{"submission_id":"aoj_1192_10609642","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\nll n,m,a;\nvoid input() {\n cin>>n>>m>>a;\n}\n\nvoid solve() {\n ll ans = 0;\n for(int i=1;i<=a;i++)\n {\n for(int j=i;j<=a;j++)\n {\n if((i*(100+n))/100+(j*(100+n))/100==a)\n {\n chmax(ans,(i*(100+m))/100+(j*(100+m))/100);\n }\n }\n }\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":30,"memory_kb":3340,"score_of_the_acc":-0.6813,"final_rank":7},{"submission_id":"aoj_1192_10589197","code_snippet":"#include <iostream>\n#include <algorithm>\nusing namespace std;\n\nusing ll = long long;\n\nll tax(ll price, ll tax_rate) {\n return (price * (100 + tax_rate)) / 100;\n}\n\nint main() {\n ll x, y, s;\n\n while (cin >> x >> y >> s) {\n if (x == 0 && y == 0 && s == 0) break;\n\n ll max_sum = 0;\n\n for (ll a = 1; a < s; ++a) {\n for (ll b = a; b < s; ++b) {\n ll sum_before = tax(a, x) + tax(b, x);\n if (sum_before == s) {\n ll sum_after = tax(a, y) + tax(b, y);\n max_sum = max(max_sum, sum_after);\n }\n }\n }\n\n cout << max_sum << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3372,"score_of_the_acc":-0.7937,"final_rank":10},{"submission_id":"aoj_1192_10566459","code_snippet":"// AOJ 1192 - Tax Rate Changed\n// ICPC Japan Domestic Contest 2014 - Problem A\n\n#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n while(true) {\n int X, Y, S; cin >> X >> Y >> S;\n if(X == 0) break;\n\n int ans = 0;\n for(int a = 1; a < S; ++a) {\n for(int b = 1; b <= S - a; ++b) {\n if(a * (100 + X) / 100 + b * (100 + X) / 100 == S) {\n ans = max(ans, a * (100 + Y) / 100 + b * (100 + Y) / 100);\n }\n }\n }\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":30,"memory_kb":3320,"score_of_the_acc":-0.65,"final_rank":6},{"submission_id":"aoj_1192_10488380","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 < 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\n// Linear Algebra ////////////////////////////////////////////////\nconst double Rad2Deg = 180.0 / M_PI;\nconst double Deg2Rad = M_PI / 180.0;\n//////////////////////////////////////////////////////////////////\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 x, y, s;\n\tcin >> x >> y >> s;\n\tif (x == 0) return 1;\n\n\tll ans = -INF;\n\tloop(i, 1, 999) {\n\t\tloop(j, 1, 999) {\n\t\t\tll before = i * (100 + x) / 100 + j * (100 + x) / 100;\n\t\t\tif (before == s) {\n\t\t\t\tll after = i * (100 + y) / 100 + j * (100 + y) / 100;\n\t\t\t\tchmax(ans, after);\n\t\t\t}\n\t\t}\n\t}\n\n\tcout << ans << endl;\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":180,"memory_kb":3584,"score_of_the_acc":-2,"final_rank":20},{"submission_id":"aoj_1192_10454995","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n//#include <bits/stdc++.h>\nusing namespace std;\n\nint newtax(int a,int p){\n return p * (100 + a) / 100;\n}\n\nint main(){\n int x,y,s;\n while(true){\n cin >> x >> y >> s;\n if (x == 0 && y == 0 && s == 0){\n break;\n }\n int M = 0;\n /*\n for (int i = 1; i<s; i++){\n int sum = newtax(x,y,i) + newtax(x,y,s-i);\n M = max(M,sum);\n }\n */\n for (int i=1; i<s; i++){\n for (int j=1; j<s; j++){\n if (newtax(x,i) + newtax(x,j) == s){\n int sum = newtax(y,i) + newtax(y,j);\n M = max(M,sum);\n }\n }\n }\n cout << M << endl;\n }\n}","accuracy":1,"time_ms":60,"memory_kb":3584,"score_of_the_acc":-1.25,"final_rank":17},{"submission_id":"aoj_1192_10454965","code_snippet":"#include<iostream>\n#include<map>\n#include<vector>\n#include<algorithm>\n#include<cmath>\n#include<climits>\n#include<ctime>\n#include<cstring>\n#include<numeric>\n\n#define ALL(v) (v).begin(),(v).end()\n#define REP(i,p,n) for(int i=p;i<(int)(n);++i)\n#define rep(i,n) REP(i,0,n)\n#define dump(a) (cerr << #a << \"=\" << (a) << endl)\n#define DUMP(list) cout << \"{ \"; for(auto nth : list){ cout << nth << \" \"; } cout << \"}\" << endl;\n\nusing namespace std;\n\nint calc(int p, int x){\n\treturn p*(100+x)/100;\n}\n\nint main()\n{\n\tint X,Y,S;\n\n\twhile(cin >> X >> Y >> S && X)\n\t{\n\t\tint ans=0;\n\t\tREP( y, 1, S ){\n\t\t\tREP( x, 1, S ){\t\n\t\t\t\tif(calc(x,X)+calc(y,X) == S){\n\t\t\t\t\tint x2 = calc(x,Y);\n\t\t\t\t\tint y2 = calc(y,Y);\n\t\t\t\t\tans = max(x2+y2,ans);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\t\n\t\tcout << ans << endl;\n\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":60,"memory_kb":3456,"score_of_the_acc":-1.05,"final_rank":15},{"submission_id":"aoj_1192_10404467","code_snippet":"#include <iostream> \nusing namespace std;\nint main() { \n int x,y,s;\n while (cin >> x && x>0){\n cin >>y;\n cin >>s;\n int a,b,max;\n max=0;\n for (int i=1;i<s;i++){\n for(int j=1;j<=i;j++){\n a=i*(100+x)/100;\n b=j*(100+x)/100;\n if(a+b==s){\n a=i*(100+y)/100;\n b=j*(100+y)/100;\n if((a+b)>max){\n max = a+b;\n }\n }\n }\n }\n cout<<max<<endl;\n }\n}","accuracy":1,"time_ms":30,"memory_kb":3364,"score_of_the_acc":-0.7188,"final_rank":8},{"submission_id":"aoj_1192_10404425","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main() {\n int x,y,s;\n while(cin >> x >> y >> s){\n if(x == 0&&y == 0&&s == 0) break;\n int ans = 0;\n for(int i = 1; i < s; i++){\n for(int j = 1 ; j < s;j++){\n int I = i*(100+x)/100;\n int J = j*(100+x)/100;\n if(I+J == s){\n ans = max(ans,i*(100+y)/100+j*(100+y)/100);\n }\n }\n }\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":60,"memory_kb":3356,"score_of_the_acc":-0.8938,"final_rank":13},{"submission_id":"aoj_1192_10403360","code_snippet":"#include <bits/stdc++.h>\n#include <atcoder/all>\nusing namespace atcoder;\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\nvoid solve(ll x,ll y,ll s){\n ll ans = 0;\n rep(i,1,s){\n rep(j,1,s){\n ll z = i * (100 + x) / 100 + j * (100 + x) / 100;\n if(z == s){\n ans = max(ans,i * (100 + y) / 100 + j * (100 + y) / 100);\n }\n }\n }\n print(ans);\n}\n\nint main(){\n while(1){\n LL(x,y,s);\n if(x == 0 && y == 0 && s == 0){break;}\n solve(x,y,s);\n }\n}","accuracy":1,"time_ms":60,"memory_kb":3584,"score_of_the_acc":-1.25,"final_rank":17},{"submission_id":"aoj_1192_9578905","code_snippet":"#include <iostream>\n#include <cmath>\nusing namespace std;\nint X, Y, S;\n\nint tax(int rate, int price)\n{\n return ((100 + rate) * price) / 100;\n}\n\nint solve()\n{\n int maximum = 0;\n for (int i = 1; i < S; ++i)\n for (int j = i; j < S; ++j)\n if (tax(X, i) + tax(X, j) == S)\n maximum = max(maximum, tax(Y, i) + tax(Y, j));\n\n return maximum;\n}\n\nint main()\n{\n while (cin >> X >> Y >> S && X > 0)\n {\n cout << solve() << endl;\n }\n}","accuracy":1,"time_ms":30,"memory_kb":3076,"score_of_the_acc":-0.2687,"final_rank":4},{"submission_id":"aoj_1192_9570619","code_snippet":"#include <iostream>\nusing namespace std;\n\nint x, y, s;\nint p1, p2, tax_old, tax_new;\n\nint main()\n{\n cin >> x >> y >> s;\n while (x || y || s)\n {\n for (p1 = 1; p1 < s; p1++)\n {\n for (p2 = 1; p2 <= s - p1; p2++)\n {\n tax_old = (p1 * (100 + x)) / 100 + (p2 * (100 + x)) / 100;\n if (tax_old == s)\n {\n tax_new = max(tax_new, (p1 * (100 + y)) / 100 + (p2 * (100 + y)) / 100);\n }\n }\n }\n\n cout << tax_new << endl;\n tax_new = 0;\n cin >> x >> y >> s;\n }\n\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3080,"score_of_the_acc":-0.275,"final_rank":5},{"submission_id":"aoj_1192_9451321","code_snippet":"#include <iostream>\n#include <algorithm>\nusing namespace std;\n\nint calculate_tax(int price, int tax_rate) {\n return (price * (100 + tax_rate)) / 100;\n}\n\nint main() {\n int x, y, s;\n\n while (true) {\n cin >> x >> y >> s;\n if (x == 0 && y == 0 && s == 0) break;\n\n int maximum = 0;\n\n for (int i = 1; i <= s - 1; ++i) {\n for (int k = i; k <= s - 1; ++k) {\n if (i + k > s) break;\n\n int old_total1 = calculate_tax(i, x);\n int old_total2 = calculate_tax(k, x);\n\n if (old_total1 + old_total2 == s) {\n int new_total = calculate_tax(i, y) + calculate_tax(k, y);\n maximum = max(maximum, new_total);\n }\n }\n }\n\n cout << maximum << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3084,"score_of_the_acc":-0.2188,"final_rank":3},{"submission_id":"aoj_1192_9451176","code_snippet":"#include <iostream>\n#include <cmath>\n#include <algorithm>\n\nusing namespace std;\n\nint calculate_tax_inclusive_price(int price, int tax_rate) {\n return (price * (100 + tax_rate)) / 100;\n}\n\nint main() {\n int x, y, s;\n\n while (true) {\n cin >> x >> y >> s;\n if (x == 0 && y == 0 && s == 0) break;\n\n int maximum = 0;\n\n for (int i = 1; i <= s - 1; ++i) {\n for (int k = i; k <= s - 1; ++k) {\n if (i + k > s) break;\n\n int old_total1 = calculate_tax_inclusive_price(i, x);\n int old_total2 = calculate_tax_inclusive_price(k, x);\n \n if (old_total1 + old_total2 == s) {\n int new_total = calculate_tax_inclusive_price(i, y) + calculate_tax_inclusive_price(k, y);\n maximum = max(maximum, new_total);\n }\n }\n }\n\n cout << maximum << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3072,"score_of_the_acc":-0.2,"final_rank":2},{"submission_id":"aoj_1192_9351678","code_snippet":"#include <bits/stdc++.h>\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define all(x) (x).begin(),(x).end()\n#define eb emplace_back\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing vl = vector<long long>;\nusing vvl = vector<vector<long long>>; using vs = vector<string>;\nusing pl = pair<long long, long long>;\ntemplate <typename T> inline bool chmin(T& a, const T& b) {bool compare = a > b; if (a > b) a = b; return compare;}\ntemplate <typename T> inline bool chmax(T& a, const T& b) {bool compare = a < b; if (a < b) a = b; return compare;}\ntemplate<class T>using rp_queue=priority_queue<T,vector<T>,greater<T>>;\ntemplate <typename T> T gcd(T a, T b) {if (b == 0)return a; else return gcd(b, a % b);}\ntemplate <typename T> inline T lcm(T a, T b) {return a /gcd(a, b)*b;}\nconst ll INF = 1LL << 60;\nconst ld PI = acos(-1);\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);\ntemplate <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);\ntemplate <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);\ntemplate <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);\ntemplate <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);\ntemplate <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);\ntemplate <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);\ntemplate <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);\n \ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }\ntemplate <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }\ntemplate <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }\ntemplate <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }\ntemplate <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << \"deq[\"; for (auto v : vec) os << v << ','; os << ']'; return os; }\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }\ntemplate <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }\ntemplate <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << \"=>\" << v.second << ','; os << '}'; return os; }\ntemplate <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << \"=>\" << v.second << ','; os << '}'; return os; }\n#ifdef 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) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << \" = \" << (x) << NORMAL_FAINT << \" (L\" << __LINE__ << \") \" << __FILE__ << COLOR_RESET << std::endl\n#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << \" = \" << (x) << NORMAL_FAINT << \" (L\" << __LINE__ << \") \" << __FILE__ << COLOR_RESET << std::endl : std::cerr)\n#else\n#define dbg(x) ((void)0)\n#define dbgif(cond, x) ((void)0)\n#endif\nvoid solve();\nint main(){\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n cout<<fixed<<setprecision(15);\n int num_tc = 1;\n //cin >> num_tc;\n rep(tc,num_tc){\n //cout << \"Case #\" << tc+1 << \": \" ;// << endl;\n solve();\n }\n}\n//見切り発車で実装しては行けない．頭の中でコードが完全に出来上がるまで書き始めるな．\n//オーバーフローしているか確認する\n//小さいケースで動いているかを確認する。\nvoid solve(){\n while(true){\n ll x,y,s;cin>>x>>y>>s;\n if(x==0&&y==0&&s==0)return;\n ll ans = 0;\n for(int i=1;i<s;i++){\n //元がi + j円\n for(int j=s-i;j>=1;j--){\n ll ni = i *(100+x)/100;\n ll nj = j *(100+x)/100;\n if(ni+nj==s){\n ll now = i*(100+y)/100;\n now+=j*(100+y)/100;\n chmax(ans,now);\n }\n }\n }\n cout<<ans<<endl;\n }\n}","accuracy":1,"time_ms":30,"memory_kb":3388,"score_of_the_acc":-0.7562,"final_rank":9},{"submission_id":"aoj_1192_9346148","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst int INF = (int)1e9 + 1001010;\nconst ll llINF = (long long)4e18 + 22000020;\nconst string endn = \"\\n\";\ntemplate <class T> inline auto vector2(size_t i, size_t j, const T &init = T()) {return vector(i, vector<T>(j, init));}\nconst string ELEM_SEPARATION = \" \", VEC_SEPARATION = endn;\ntemplate<class T> istream& operator >>(istream &i, vector<T> &A) {for(auto &I : A) {i >> I;} return i;}\ntemplate<class T> ostream& operator <<(ostream &o, const vector<T> &A) {int i=A.size(); for(const auto &I : A){o << I << (--i ? ELEM_SEPARATION : \"\");} return o;}\ntemplate<class T> ostream& operator <<(ostream &o, const vector<vector<T>> &A) {int i=A.size(); for(const auto &I : A){o << I << (--i ? VEC_SEPARATION : \"\");} return o;}\ntemplate<class T> vector<T>& operator ++(vector<T> &A, int n) {for(auto &I : A) {I++;} return A;}\ntemplate<class T> vector<T>& operator --(vector<T> &A, int n) {for(auto &I : A) {I--;} return A;}\ntemplate<class T, class U> bool chmax(T &a, const U &b) {return ((a < b) ? (a = b, true) : false);}\ntemplate<class T, class U> bool chmin(T &a, const U &b) {return ((a > b) ? (a = b, true) : false);}\nll floor(ll a, ll b){if (b < 0) a = -a, b = -b; if(a >= 0) return a / b; else return (a + 1) / b - 1;}\nll ceil(ll a, ll b){if (b < 0) a = -a, b = -b; if(a > 0) return (a - 1) / b + 1; else return a / b;}\nll bit(unsigned long long val, unsigned long long digit){return (val >> digit) & 1;}\n#ifdef DEBUG\n#include <debug_slephy.cpp>\n#else\n#define debug(...)\n#endif\n// ================================== ここまでテンプレ ==================================\n\n\nvoid solve(){\n ll x, y, s; cin >> x >> y >> s;\n if(x == 0) exit(0);\n\n // p円, x%\n auto add_tax = [&](ll p, ll x) -> ll {\n return floor(p * (100 + x), 100);\n };\n\n map<ll, ll> max_value;\n for(int p = 1; p < 1010; p++){\n ll t1 = add_tax(p, x);\n ll t2 = add_tax(p, y);\n chmax(max_value[t1], t2);\n }\n\n ll ans = 0;\n for(ll s1 = 1; s1 <= s-1; s1++){\n ll s2 = s - s1;\n ll this_ans = max_value[s1] + max_value[s2];\n chmax(ans, this_ans);\n }\n cout << ans << endl;\n}\n\nint main(int argc, char *argv[]){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n\n while(true) solve();\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3488,"score_of_the_acc":-0.85,"final_rank":11}],"string":"[\n {\n \"submission_id\": \"aoj_1192_10851356\",\n \"code_snippet\": \"#include <cstdio>\\n#include <algorithm>\\n\\nusing namespace std;\\n\\nint main(void) {\\n\\tint x, y, s;\\n\\twhile(scanf(\\\"%d %d %d\\\", &x, &y, &s), !(x == 0 and y == 0 and s == 0)) {\\n\\t\\tint ans = 0;\\n\\n\\t\\tfor(int i = 1; i < s; i++) {\\n\\t\\t\\tint j = s - i;\\n\\t\\t\\tint xcost = 0;\\n\\t\\t\\twhile(xcost * (100 + x) / 100 <= i) xcost++;\\n\\t\\t\\txcost--;\\n\\t\\t\\tint ycost = 0;\\n\\t\\t\\twhile(ycost * (100 + x) / 100 <= j) ycost++;\\n\\t\\t\\tycost--;\\n\\n\\t\\t\\tif(xcost * (100 + x) / 100 + ycost * (100 + x) / 100 != s) continue;\\n\\n\\t\\t\\tint cand = xcost * (100 + y) / 100 + ycost * (100 + y) / 100;\\n\\t\\t\\tif(cand > ans) {\\n\\t\\t\\t\\tans = cand;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tprintf(\\\"%d\\\\n\\\", ans);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 2944,\n \"score_of_the_acc\": -0.125,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1192_10767163\",\n \"code_snippet\": \"//Q:https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?lang=jp&id=1192\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint main(){\\n int x, y, s;\\n while (cin >> x >> y >> s) {\\n if (x == 0 && y == 0 && s == 0) break;\\n int ma = 0;\\n for (int a = 1; a < s; a++) {\\n for (int b = 1; b < s; b++){\\n int ta = a * (100 + x) / 100;\\n int tb = b * (100 + x) / 100;\\n if (ta + tb == s) {\\n int na = a * (100 + y) / 100;\\n int nb = b * (100 + y) / 100;\\n ma = max(ma, na + nb);\\n }\\n } \\n }\\n cout << ma << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3356,\n \"score_of_the_acc\": -0.8938,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1192_10683815\",\n \"code_snippet\": \"#include <iostream>\\n#include <cassert>\\nusing namespace std;\\nusing ll = long long;\\ntemplate<class T> inline bool chmax(T& a, const T& b) {if (a<b) {a=b; return true;} return false;}\\ntemplate<class T> inline bool chmin(T& a, const T& b) {if (b<a) {a=b; return true;} return false;}\\nconstexpr int INTINF = 1000001000;\\nconstexpr int INTMAX = 2147483647;\\nconstexpr ll LLMAX = 9223372036854775807;\\nconstexpr ll LLINF = 4450000000011100000;\\n\\nint calc(int p, int x) {\\n return p * (100 + x) / 100; \\n}\\n\\nvoid solve(int x, int y, int s) {\\n int ans = 0;\\n // s: 税率がx%のときの税込み合計額\\n // s = floor(p * (100+x) / x) + floor(\\n for (int s1=1; s1<=s-1; s1++){\\n for (int s2=1; s2<=s-1; s2++) {\\n if (calc(s1,x) + calc(s2,x) != s) continue;\\n chmax(ans, calc(s1,y) + calc(s2,y));\\n }\\n }\\n cout << ans << endl;\\n}\\n\\nint main() {\\n ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);\\n while(true) {\\n int x, y, s; cin >> x >> y >> s;\\n if (x==0 && y == 0 && s == 0) break;\\n solve(x,y,s);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3456,\n \"score_of_the_acc\": -1.05,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1192_10683806\",\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 x, int y, int s) {\\n int mx = 0;\\n for (int i=1; i<s; ++i) {\\n for (int j=1; j<s; ++j) {\\n int before = i*(100+x)/100 + j*(100+x)/100;\\n if (before != s) continue;\\n int after = i*(100+y)/100 + j*(100+y)/100;\\n mx = max(mx, after);\\n }\\n }\\n cout << mx << endl;\\n}\\n\\nsigned main() {\\n ios::sync_with_stdio(false);cin.tie(nullptr);\\n while(true) {\\n int x, y, s;\\n cin >> x >> y >> s;\\n if (x+y+s == 0) break;\\n solve(x, y, s);\\n }\\n}\\n\\n/*\\nmemo\\n\\n*/\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3584,\n \"score_of_the_acc\": -1.25,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1192_10661873\",\n \"code_snippet\": \"// This is free and unencumbered software released into the public domain.\\n\\n// Anyone is free to copy, modify, publish, use, compile, sell, or\\n// distribute this software, either in source code form or as a compiled\\n// binary, for any purpose, commercial or non-commercial, and by any\\n// means.\\n\\n// In jurisdictions that recognize copyright laws, the author or authors\\n// of this software dedicate any and all copyright interest in the\\n// software to the public domain. We make this dedication for the benefit\\n// of the public at large and to the detriment of our heirs and\\n// successors. We intend this dedication to be an overt act of\\n// relinquishment in perpetuity of all present and future rights to this\\n// software under copyright law.\\n\\n// THE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND,\\n// EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\\n// IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR\\n// OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,\\n// ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\\n// OTHER DEALINGS IN THE SOFTWARE.\\n\\n// For more information, please refer to <http://unlicense.org>\\n\\n/****************/\\n/* template.hpp */\\n/****************/\\n\\n#include <cassert>\\n#include <iomanip>\\n#include <iostream>\\n#include <limits>\\n\\nusing namespace std;\\n\\n\\ntemplate <typename T> void debug(T x) {\\n cerr << __LINE__ << \\\" \\\" << var_name(x) << \\\" \\\" << (x) << endl;\\n}\\n\\ntemplate <typename T> void debug_v(T x) {\\n cerr << __LINE__ << \\\" \\\" << var_name(x) << \\\" [\\\";\\n bool first = true;\\n for (const auto &itr : x) {\\n if (!first) {\\n cerr << \\\", \\\";\\n }\\n cerr << itr;\\n first = false;\\n }\\n cerr << \\\"]\\\" << endl;\\n}\\n\\nstruct Initializer {\\n Initializer() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(15) << boolalpha;\\n }\\n} initializer;\\n\\ntemplate <typename T, typename S> bool chmin(T &a, const S &b) {\\n return a > b ? a = b, true : false;\\n}\\n\\ntemplate <typename T, typename S> bool chmax(T &a, const S &b) {\\n return a < b ? a = b, true : false;\\n}\\n\\ntemplate <typename T> constexpr T inf() {\\n return numeric_limits<T>::max() / 2 - 1;\\n}\\n\\n/************/\\n/* main.cpp */\\n/************/\\n\\nint main() {\\n auto tax = [](int x, int p) { return x * (100 + p) / 100; };\\n int x, y, s;\\n while (true) {\\n cin >> x >> y >> s;\\n if (x == 0 && y == 0 && s == 0) {\\n break;\\n }\\n int res = -1;\\n for (int i = 1; i < s; ++i) {\\n for (int j = i; j < s; ++j) {\\n if (tax(i, x) + tax(j, x) == s) {\\n chmax(res, tax(i, y) + tax(j, y));\\n }\\n }\\n }\\n cout << res << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3456,\n \"score_of_the_acc\": -0.8625,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1192_10609642\",\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\\nll n,m,a;\\nvoid input() {\\n cin>>n>>m>>a;\\n}\\n\\nvoid solve() {\\n ll ans = 0;\\n for(int i=1;i<=a;i++)\\n {\\n for(int j=i;j<=a;j++)\\n {\\n if((i*(100+n))/100+(j*(100+n))/100==a)\\n {\\n chmax(ans,(i*(100+m))/100+(j*(100+m))/100);\\n }\\n }\\n }\\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\": 30,\n \"memory_kb\": 3340,\n \"score_of_the_acc\": -0.6813,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1192_10589197\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\nusing namespace std;\\n\\nusing ll = long long;\\n\\nll tax(ll price, ll tax_rate) {\\n return (price * (100 + tax_rate)) / 100;\\n}\\n\\nint main() {\\n ll x, y, s;\\n\\n while (cin >> x >> y >> s) {\\n if (x == 0 && y == 0 && s == 0) break;\\n\\n ll max_sum = 0;\\n\\n for (ll a = 1; a < s; ++a) {\\n for (ll b = a; b < s; ++b) {\\n ll sum_before = tax(a, x) + tax(b, x);\\n if (sum_before == s) {\\n ll sum_after = tax(a, y) + tax(b, y);\\n max_sum = max(max_sum, sum_after);\\n }\\n }\\n }\\n\\n cout << max_sum << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3372,\n \"score_of_the_acc\": -0.7937,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1192_10566459\",\n \"code_snippet\": \"// AOJ 1192 - Tax Rate Changed\\n// ICPC Japan Domestic Contest 2014 - Problem A\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint main() {\\n while(true) {\\n int X, Y, S; cin >> X >> Y >> S;\\n if(X == 0) break;\\n\\n int ans = 0;\\n for(int a = 1; a < S; ++a) {\\n for(int b = 1; b <= S - a; ++b) {\\n if(a * (100 + X) / 100 + b * (100 + X) / 100 == S) {\\n ans = max(ans, a * (100 + Y) / 100 + b * (100 + Y) / 100);\\n }\\n }\\n }\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3320,\n \"score_of_the_acc\": -0.65,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1192_10488380\",\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 < 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\\n// Linear Algebra ////////////////////////////////////////////////\\nconst double Rad2Deg = 180.0 / M_PI;\\nconst double Deg2Rad = M_PI / 180.0;\\n//////////////////////////////////////////////////////////////////\\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 x, y, s;\\n\\tcin >> x >> y >> s;\\n\\tif (x == 0) return 1;\\n\\n\\tll ans = -INF;\\n\\tloop(i, 1, 999) {\\n\\t\\tloop(j, 1, 999) {\\n\\t\\t\\tll before = i * (100 + x) / 100 + j * (100 + x) / 100;\\n\\t\\t\\tif (before == s) {\\n\\t\\t\\t\\tll after = i * (100 + y) / 100 + j * (100 + y) / 100;\\n\\t\\t\\t\\tchmax(ans, after);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tcout << ans << endl;\\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\": 180,\n \"memory_kb\": 3584,\n \"score_of_the_acc\": -2,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1192_10454995\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n//#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint newtax(int a,int p){\\n return p * (100 + a) / 100;\\n}\\n\\nint main(){\\n int x,y,s;\\n while(true){\\n cin >> x >> y >> s;\\n if (x == 0 && y == 0 && s == 0){\\n break;\\n }\\n int M = 0;\\n /*\\n for (int i = 1; i<s; i++){\\n int sum = newtax(x,y,i) + newtax(x,y,s-i);\\n M = max(M,sum);\\n }\\n */\\n for (int i=1; i<s; i++){\\n for (int j=1; j<s; j++){\\n if (newtax(x,i) + newtax(x,j) == s){\\n int sum = newtax(y,i) + newtax(y,j);\\n M = max(M,sum);\\n }\\n }\\n }\\n cout << M << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3584,\n \"score_of_the_acc\": -1.25,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1192_10454965\",\n \"code_snippet\": \"#include<iostream>\\n#include<map>\\n#include<vector>\\n#include<algorithm>\\n#include<cmath>\\n#include<climits>\\n#include<ctime>\\n#include<cstring>\\n#include<numeric>\\n\\n#define ALL(v) (v).begin(),(v).end()\\n#define REP(i,p,n) for(int i=p;i<(int)(n);++i)\\n#define rep(i,n) REP(i,0,n)\\n#define dump(a) (cerr << #a << \\\"=\\\" << (a) << endl)\\n#define DUMP(list) cout << \\\"{ \\\"; for(auto nth : list){ cout << nth << \\\" \\\"; } cout << \\\"}\\\" << endl;\\n\\nusing namespace std;\\n\\nint calc(int p, int x){\\n\\treturn p*(100+x)/100;\\n}\\n\\nint main()\\n{\\n\\tint X,Y,S;\\n\\n\\twhile(cin >> X >> Y >> S && X)\\n\\t{\\n\\t\\tint ans=0;\\n\\t\\tREP( y, 1, S ){\\n\\t\\t\\tREP( x, 1, S ){\\t\\n\\t\\t\\t\\tif(calc(x,X)+calc(y,X) == S){\\n\\t\\t\\t\\t\\tint x2 = calc(x,Y);\\n\\t\\t\\t\\t\\tint y2 = calc(y,Y);\\n\\t\\t\\t\\t\\tans = max(x2+y2,ans);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\t\\n\\t\\tcout << ans << endl;\\n\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3456,\n \"score_of_the_acc\": -1.05,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1192_10404467\",\n \"code_snippet\": \"#include <iostream> \\nusing namespace std;\\nint main() { \\n int x,y,s;\\n while (cin >> x && x>0){\\n cin >>y;\\n cin >>s;\\n int a,b,max;\\n max=0;\\n for (int i=1;i<s;i++){\\n for(int j=1;j<=i;j++){\\n a=i*(100+x)/100;\\n b=j*(100+x)/100;\\n if(a+b==s){\\n a=i*(100+y)/100;\\n b=j*(100+y)/100;\\n if((a+b)>max){\\n max = a+b;\\n }\\n }\\n }\\n }\\n cout<<max<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3364,\n \"score_of_the_acc\": -0.7188,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1192_10404425\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\nint main() {\\n int x,y,s;\\n while(cin >> x >> y >> s){\\n if(x == 0&&y == 0&&s == 0) break;\\n int ans = 0;\\n for(int i = 1; i < s; i++){\\n for(int j = 1 ; j < s;j++){\\n int I = i*(100+x)/100;\\n int J = j*(100+x)/100;\\n if(I+J == s){\\n ans = max(ans,i*(100+y)/100+j*(100+y)/100);\\n }\\n }\\n }\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3356,\n \"score_of_the_acc\": -0.8938,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1192_10403360\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#include <atcoder/all>\\nusing namespace atcoder;\\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\\nvoid solve(ll x,ll y,ll s){\\n ll ans = 0;\\n rep(i,1,s){\\n rep(j,1,s){\\n ll z = i * (100 + x) / 100 + j * (100 + x) / 100;\\n if(z == s){\\n ans = max(ans,i * (100 + y) / 100 + j * (100 + y) / 100);\\n }\\n }\\n }\\n print(ans);\\n}\\n\\nint main(){\\n while(1){\\n LL(x,y,s);\\n if(x == 0 && y == 0 && s == 0){break;}\\n solve(x,y,s);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3584,\n \"score_of_the_acc\": -1.25,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1192_9578905\",\n \"code_snippet\": \"#include <iostream>\\n#include <cmath>\\nusing namespace std;\\nint X, Y, S;\\n\\nint tax(int rate, int price)\\n{\\n return ((100 + rate) * price) / 100;\\n}\\n\\nint solve()\\n{\\n int maximum = 0;\\n for (int i = 1; i < S; ++i)\\n for (int j = i; j < S; ++j)\\n if (tax(X, i) + tax(X, j) == S)\\n maximum = max(maximum, tax(Y, i) + tax(Y, j));\\n\\n return maximum;\\n}\\n\\nint main()\\n{\\n while (cin >> X >> Y >> S && X > 0)\\n {\\n cout << solve() << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3076,\n \"score_of_the_acc\": -0.2687,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1192_9570619\",\n \"code_snippet\": \"#include <iostream>\\nusing namespace std;\\n\\nint x, y, s;\\nint p1, p2, tax_old, tax_new;\\n\\nint main()\\n{\\n cin >> x >> y >> s;\\n while (x || y || s)\\n {\\n for (p1 = 1; p1 < s; p1++)\\n {\\n for (p2 = 1; p2 <= s - p1; p2++)\\n {\\n tax_old = (p1 * (100 + x)) / 100 + (p2 * (100 + x)) / 100;\\n if (tax_old == s)\\n {\\n tax_new = max(tax_new, (p1 * (100 + y)) / 100 + (p2 * (100 + y)) / 100);\\n }\\n }\\n }\\n\\n cout << tax_new << endl;\\n tax_new = 0;\\n cin >> x >> y >> s;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3080,\n \"score_of_the_acc\": -0.275,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1192_9451321\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\nusing namespace std;\\n\\nint calculate_tax(int price, int tax_rate) {\\n return (price * (100 + tax_rate)) / 100;\\n}\\n\\nint main() {\\n int x, y, s;\\n\\n while (true) {\\n cin >> x >> y >> s;\\n if (x == 0 && y == 0 && s == 0) break;\\n\\n int maximum = 0;\\n\\n for (int i = 1; i <= s - 1; ++i) {\\n for (int k = i; k <= s - 1; ++k) {\\n if (i + k > s) break;\\n\\n int old_total1 = calculate_tax(i, x);\\n int old_total2 = calculate_tax(k, x);\\n\\n if (old_total1 + old_total2 == s) {\\n int new_total = calculate_tax(i, y) + calculate_tax(k, y);\\n maximum = max(maximum, new_total);\\n }\\n }\\n }\\n\\n cout << maximum << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3084,\n \"score_of_the_acc\": -0.2188,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1192_9451176\",\n \"code_snippet\": \"#include <iostream>\\n#include <cmath>\\n#include <algorithm>\\n\\nusing namespace std;\\n\\nint calculate_tax_inclusive_price(int price, int tax_rate) {\\n return (price * (100 + tax_rate)) / 100;\\n}\\n\\nint main() {\\n int x, y, s;\\n\\n while (true) {\\n cin >> x >> y >> s;\\n if (x == 0 && y == 0 && s == 0) break;\\n\\n int maximum = 0;\\n\\n for (int i = 1; i <= s - 1; ++i) {\\n for (int k = i; k <= s - 1; ++k) {\\n if (i + k > s) break;\\n\\n int old_total1 = calculate_tax_inclusive_price(i, x);\\n int old_total2 = calculate_tax_inclusive_price(k, x);\\n \\n if (old_total1 + old_total2 == s) {\\n int new_total = calculate_tax_inclusive_price(i, y) + calculate_tax_inclusive_price(k, y);\\n maximum = max(maximum, new_total);\\n }\\n }\\n }\\n\\n cout << maximum << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3072,\n \"score_of_the_acc\": -0.2,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1192_9351678\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\\n#define all(x) (x).begin(),(x).end()\\n#define eb emplace_back\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing vl = vector<long long>;\\nusing vvl = vector<vector<long long>>; using vs = vector<string>;\\nusing pl = pair<long long, long long>;\\ntemplate <typename T> inline bool chmin(T& a, const T& b) {bool compare = a > b; if (a > b) a = b; return compare;}\\ntemplate <typename T> inline bool chmax(T& a, const T& b) {bool compare = a < b; if (a < b) a = b; return compare;}\\ntemplate<class T>using rp_queue=priority_queue<T,vector<T>,greater<T>>;\\ntemplate <typename T> T gcd(T a, T b) {if (b == 0)return a; else return gcd(b, a % b);}\\ntemplate <typename T> inline T lcm(T a, T b) {return a /gcd(a, b)*b;}\\nconst ll INF = 1LL << 60;\\nconst ld PI = acos(-1);\\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);\\ntemplate <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);\\ntemplate <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);\\ntemplate <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);\\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);\\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);\\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);\\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);\\ntemplate <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);\\ntemplate <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);\\ntemplate <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);\\ntemplate <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);\\n \\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }\\ntemplate <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }\\ntemplate <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }\\ntemplate <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }\\ntemplate <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }\\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << \\\"deq[\\\"; for (auto v : vec) os << v << ','; os << ']'; return os; }\\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }\\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }\\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }\\ntemplate <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }\\ntemplate <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << \\\"=>\\\" << v.second << ','; os << '}'; return os; }\\ntemplate <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << \\\"=>\\\" << v.second << ','; os << '}'; return os; }\\n#ifdef 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) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << \\\" = \\\" << (x) << NORMAL_FAINT << \\\" (L\\\" << __LINE__ << \\\") \\\" << __FILE__ << COLOR_RESET << std::endl\\n#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << \\\" = \\\" << (x) << NORMAL_FAINT << \\\" (L\\\" << __LINE__ << \\\") \\\" << __FILE__ << COLOR_RESET << std::endl : std::cerr)\\n#else\\n#define dbg(x) ((void)0)\\n#define dbgif(cond, x) ((void)0)\\n#endif\\nvoid solve();\\nint main(){\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n cout<<fixed<<setprecision(15);\\n int num_tc = 1;\\n //cin >> num_tc;\\n rep(tc,num_tc){\\n //cout << \\\"Case #\\\" << tc+1 << \\\": \\\" ;// << endl;\\n solve();\\n }\\n}\\n//見切り発車で実装しては行けない．頭の中でコードが完全に出来上がるまで書き始めるな．\\n//オーバーフローしているか確認する\\n//小さいケースで動いているかを確認する。\\nvoid solve(){\\n while(true){\\n ll x,y,s;cin>>x>>y>>s;\\n if(x==0&&y==0&&s==0)return;\\n ll ans = 0;\\n for(int i=1;i<s;i++){\\n //元がi + j円\\n for(int j=s-i;j>=1;j--){\\n ll ni = i *(100+x)/100;\\n ll nj = j *(100+x)/100;\\n if(ni+nj==s){\\n ll now = i*(100+y)/100;\\n now+=j*(100+y)/100;\\n chmax(ans,now);\\n }\\n }\\n }\\n cout<<ans<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3388,\n \"score_of_the_acc\": -0.7562,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1192_9346148\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nconst int INF = (int)1e9 + 1001010;\\nconst ll llINF = (long long)4e18 + 22000020;\\nconst string endn = \\\"\\\\n\\\";\\ntemplate <class T> inline auto vector2(size_t i, size_t j, const T &init = T()) {return vector(i, vector<T>(j, init));}\\nconst string ELEM_SEPARATION = \\\" \\\", VEC_SEPARATION = endn;\\ntemplate<class T> istream& operator >>(istream &i, vector<T> &A) {for(auto &I : A) {i >> I;} return i;}\\ntemplate<class T> ostream& operator <<(ostream &o, const vector<T> &A) {int i=A.size(); for(const auto &I : A){o << I << (--i ? ELEM_SEPARATION : \\\"\\\");} return o;}\\ntemplate<class T> ostream& operator <<(ostream &o, const vector<vector<T>> &A) {int i=A.size(); for(const auto &I : A){o << I << (--i ? VEC_SEPARATION : \\\"\\\");} return o;}\\ntemplate<class T> vector<T>& operator ++(vector<T> &A, int n) {for(auto &I : A) {I++;} return A;}\\ntemplate<class T> vector<T>& operator --(vector<T> &A, int n) {for(auto &I : A) {I--;} return A;}\\ntemplate<class T, class U> bool chmax(T &a, const U &b) {return ((a < b) ? (a = b, true) : false);}\\ntemplate<class T, class U> bool chmin(T &a, const U &b) {return ((a > b) ? (a = b, true) : false);}\\nll floor(ll a, ll b){if (b < 0) a = -a, b = -b; if(a >= 0) return a / b; else return (a + 1) / b - 1;}\\nll ceil(ll a, ll b){if (b < 0) a = -a, b = -b; if(a > 0) return (a - 1) / b + 1; else return a / b;}\\nll bit(unsigned long long val, unsigned long long digit){return (val >> digit) & 1;}\\n#ifdef DEBUG\\n#include <debug_slephy.cpp>\\n#else\\n#define debug(...)\\n#endif\\n// ================================== ここまでテンプレ ==================================\\n\\n\\nvoid solve(){\\n ll x, y, s; cin >> x >> y >> s;\\n if(x == 0) exit(0);\\n\\n // p円, x%\\n auto add_tax = [&](ll p, ll x) -> ll {\\n return floor(p * (100 + x), 100);\\n };\\n\\n map<ll, ll> max_value;\\n for(int p = 1; p < 1010; p++){\\n ll t1 = add_tax(p, x);\\n ll t2 = add_tax(p, y);\\n chmax(max_value[t1], t2);\\n }\\n\\n ll ans = 0;\\n for(ll s1 = 1; s1 <= s-1; s1++){\\n ll s2 = s - s1;\\n ll this_ans = max_value[s1] + max_value[s2];\\n chmax(ans, this_ans);\\n }\\n cout << ans << endl;\\n}\\n\\nint main(int argc, char *argv[]){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n\\n\\n while(true) solve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3488,\n \"score_of_the_acc\": -0.85,\n \"final_rank\": 11\n }\n]","isConversational":false}}},{"rowIdx":666,"cells":{"group_id":{"kind":"string","value":"aoj_1196_cpp"},"problem_description":{"kind":"string","value":"Bridge Removal\nICPC islands once had been a popular tourist destination.\nFor nature preservation, however, the government decided to prohibit entrance to the islands,\nand to remove all the man-made structures there.\nThe hardest part of the project is to remove all the bridges connecting the islands.\nThere are\nn\nislands and\nn\n-1 bridges.\nThe bridges are built so that all the islands are reachable from all the other islands by\ncrossing one or more bridges.\nThe bridge removal team can choose any island as the starting point, and can repeat either of the\nfollowing steps.\nMove to another island by crossing a bridge that is connected to the current island.\nRemove one bridge that is connected to the current island, and stay at the same island after the removal.\nOf course, a bridge, once removed, cannot be crossed in either direction.\nCrossing or removing a bridge both takes time proportional to the length of the bridge.\nYour task is to compute the shortest time necessary for removing all the bridges.\nNote that the island where the team starts can differ from where the team finishes the work.\nInput\nThe input consists of at most 100 datasets.\nEach dataset is formatted as follows.\nn\np\n2\np\n3\n...\np\nn\nd\n2\nd\n3\n...\nd\nn\nThe first integer\nn\n(3 ≤\nn\n≤ 800) is the number of the islands.\nThe islands are numbered from 1 to\nn\n.\nThe second line contains\nn\n-1 island numbers\np\ni\n(1 ≤\np\ni\n<\ni\n), and tells that for each\ni\nfrom 2 to\nn\nthe island\ni\nand the island\np\ni\nare connected by a bridge.\nThe third line contains\nn\n-1 integers\nd\ni\n(1 ≤\nd\ni\n≤ 100,000)\neach denoting the length of the corresponding bridge.\nThat is, the length of the bridge connecting the island\ni\nand\np\ni\nis\nd\ni\n. It takes\nd\ni\nunits of time to cross the bridge, and\nalso the same units of time to remove it.\n\nNote that, with this input format, it is assured that all the islands are reachable each other by\ncrossing one or more bridges.\nThe input ends with a line with a single zero.\nOutput\nFor each dataset, print the minimum time units required to remove all the bridges in a single line.\nEach line should not have any character other than this number.\nSample Input\n4\n1 2 3\n10 20 30\n10\n1 2 2 1 5 5 1 8 8\n10 1 1 20 1 1 30 1 1\n3\n1 1\n1 1\n0\nOutput for the Sample Input\n80\n136\n2"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1196_10853372","code_snippet":"#include <stdio.h>\n#include <vector>\n#define MAX 810\n\nint n, p[MAX], d[MAX], check[MAX];\nint val, answer=2147483647;\nstruct data{\n\tint go, dis;\n};\nstd::vector<data> vec[MAX];\nint dy[MAX][2];\n\nvoid reset(void){\n\tint i;\n\tanswer=2147483647;\n\tfor (i=1;i<=n;i++){\n\t\tvec[i].clear();\n\t}\n}\n\nint max(int a, int b){\n\treturn (a>b) ? a : b;\n}\nint min(int a, int b){\n\treturn (a<b) ? a : b;\n}\n\nint dfs(int now, int root){\n\tint i, s, ret=0, t, minus=0;\n\tdata chd;\n\tcheck[now]=1;\n\ts=vec[now].size();\n\tfor (i=0;i<s;i++){\n\t\tchd=vec[now][i];\n\t\tif (check[chd.go]) continue;\n\t\tt=dfs(chd.go, root);\n\t\tif (t==0) ret+=chd.dis;\n\t\telse{\n\t\t\tret+=chd.dis*3+t;\n\t\t\tif (minus<chd.dis+t-min(dy[chd.go][0], dy[chd.go][1])){\n\t\t\t\tminus=chd.dis+t-min(dy[chd.go][0], dy[chd.go][1]);\n\t\t\t}\n\t\t}\n\t}\n\tdy[now][1]=ret;\n\tfor (i=0;i<s;i++){\n\t\tchd=vec[now][i];\n\t\tif (check[chd.go]) continue;\n\t\tif (ret-minus<dy[now][1] && minus!=100000000) dy[now][1]=ret-minus;\n\t}\n\tdy[now][0]=ret;\n\tcheck[now]=0;\n\treturn dy[now][0];\n}\n\nint main(void){\n\tint i, r;\n\tdata tmp;\n\tfor (;;){\n\t\tscanf(\"%d\", &n);\n\t\tif (n==0) break;\n\t\tfor (i=2;i<=n;i++) scanf(\"%d\", &p[i]);\n\t\tfor (i=2;i<=n;i++){\n\t\t\tscanf(\"%d\", &d[i]);\n\t\t\ttmp.go=p[i], tmp.dis=d[i];\n\t\t\tvec[i].push_back(tmp);\n\t\t\ttmp.go=i;\n\t\t\tvec[p[i]].push_back(tmp);\n\t\t}\n\n\t\tfor (r=1;r<=n;r++){\n\t\t\tval=dfs(r, r);\n\t\t\tif (min(dy[r][0],dy[r][1])<answer) answer=min(dy[r][0],dy[r][1]);\n\t\t\tfor (i=1;i<=n;i++){\n\t\t\t\tdy[i][0]=dy[i][1]=0;\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\", answer);\n\t\treset();\n\t}\n\treturn false;\n}","accuracy":1,"time_ms":260,"memory_kb":3104,"score_of_the_acc":-0.2604,"final_rank":1},{"submission_id":"aoj_1196_10630144","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 1e9\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\nvl dist;\nvector<vector<pair<ll,ll>>> g;\n\nvoid dfs(ll before,ll node){\n\trep(i,g[node].size()){\n\t\tif(g[node][i].first==before)continue;\n\t\t//次が葉じゃなければ遷移\n\t\tif(g[g[node][i].first].size()==1)continue;\n\t\tdist[g[node][i].first]=dist[node]+g[node][i].second;\n\t\tdfs(node,g[node][i].first);\n\t}\n}\n\nll solve(){\n\tll n;\n\tcin>>n;\n\tif(n==0){return 1;}\n\n\tdist=vl(n,0);\n\tg=vector<vector<pair<ll,ll>>>(n);\n\t\n\tvl p(n);\n\tvl d(n);\n\n\tll ans=0;\n\n\tloop(i,1,n-1)cin>>p[i],p[i]--;\n\tloop(i,1,n-1)cin>>d[i];\n\n\tloop(i,1,n-1){\n\t\tg[i].push_back({p[i],d[i]});\n\t\tg[p[i]].push_back({i,d[i]});\n\t\tans+=d[i];\n\t}\n\n\t//葉以外同士辺を全て2回足す\n\trep(i,n){\n\t\tif(g[i].size()==1)continue;\n\t\trep(j,g[i].size()){\n\t\t\tif(g[g[i][j].first].size()==1)continue;\n\t\t\tans+=g[i][j].second;\n\t\t}\n\t}\n\n\tll mxi;\n\trep(i,n){\n\t\tif(g[i].size()==1)continue;\n\t\tdfs(-1,i);\n\t\tmxi=i;\n\t\tbreak;\n\t}\n\n\trep(i,n){\n\t\tif(g[i].size()==1)continue;\n\t\tif(dist[i]>dist[mxi])mxi=i;\n\t}\n\tdist=vl(n);\n\tdfs(-1,mxi);\n\trep(i,n){\n\t\tif(g[i].size()==1)continue;\n\t\tif(dist[i]>dist[mxi])mxi=i;\n\t}\n\n\tans-=dist[mxi];\n\tcout<<ans<<endl;\n\treturn 0;\n}\n\n//メイン\nint main(){\n\twhile(solve()==0);\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3544,"score_of_the_acc":-0.4867,"final_rank":4},{"submission_id":"aoj_1196_10579935","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint diam(vector<vector<pair<int, int>>> G) {\n int N = G.size();\n auto D = [&] (int r) -> vector<int> {\n vector<int> d(N);\n auto dfs = [&] (auto dfs, int u, int p) -> void {\n for (auto [v, w] : G[u]) {\n if (v != p) {\n d[v] = d[u] + w;\n dfs(dfs, v, u);\n }\n }\n };\n dfs(dfs, r, -1);\n return d;\n };\n auto d = D(0);\n int r = max_element(d.begin(), d.end()) - d.begin();\n d = D(r);\n return *max_element(d.begin(), d.end());\n}\n\nbool solve() {\n int N;\n cin >> N;\n if (N == 0) return false;\n vector<int> P(N), D(N);\n for (int i = 1; i < N; i++) {\n cin >> P[i];\n P[i]--;\n }\n for (int i = 1; i < N; i++) cin >> D[i];\n vector<vector<pair<int, int>>> G(N);\n long long ans = 0;\n for (int i = 1; i < N; i++) {\n G[i].emplace_back(P[i], D[i]);\n G[P[i]].emplace_back(i, D[i]);\n ans += 3 * D[i];\n }\n vector<int> alive;\n for (int i = 0; i < N; i++) {\n if (G[i].size() > 1) alive.push_back(i);\n }\n vector<vector<pair<int, int>>> H(N);\n for (int u = 0; u < N; u++) {\n for (auto [v, w] : G[u]) {\n if (u < v) continue;\n if (G[u].size() > 1 && G[v].size() > 1) {\n int a = lower_bound(alive.begin(), alive.end(), u) - alive.begin();\n int b = lower_bound(alive.begin(), alive.end(), v) - alive.begin();\n H[a].emplace_back(b, w);\n H[b].emplace_back(a, w);\n } else {\n ans -= 2 * w;\n }\n }\n }\n ans -= diam(H);\n cout << ans << '\\n';\n return true;\n}\n\nint main() {\n while (solve()) {}\n}","accuracy":1,"time_ms":10,"memory_kb":3840,"score_of_the_acc":-0.8142,"final_rank":15},{"submission_id":"aoj_1196_10571365","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint Diam(vector<vector<pair<int, int>>> G) {\n int N = G.size();\n auto BFS = [&] (int r) -> vector<int> {\n vector<int> D(N, 1 << 30);\n D[r] = 0;\n queue<int> q;\n q.push(r);\n while (q.size()) {\n int u = q.front();\n q.pop();\n for (auto [v, w] : G[u]) {\n if (D[v] > D[u] + w) {\n D[v] = D[u] + w;\n q.push(v);\n }\n }\n }\n return D;\n };\n auto D = BFS(0);\n int L = max_element(D.begin(), D.end()) - D.begin();\n D = BFS(L);\n return *max_element(D.begin(), D.end());\n}\n\nbool solve() {\n int N;\n cin >> N;\n if (N == 0) return false;\n vector<int> P(N), D(N);\n int ans = 0;\n for (int i = 1; i < N; i++) cin >> P[i], P[i]--;\n for (int i = 1; i < N; i++) cin >> D[i], ans += 3 * D[i];\n vector<vector<pair<int, int>>> G(N);\n for (int i = 1; i < N; i++) {\n G[i].emplace_back(P[i], D[i]);\n G[P[i]].emplace_back(i, D[i]);\n }\n vector<int> alive;\n for (int i = 0; i < N; i++) {\n if (G[i].size() >= 2) alive.push_back(i);\n }\n vector<int> id(N, -1);\n for (int i = 0; i < N; i++) {\n if (G[i].size() >= 2) {\n id[i] = lower_bound(alive.begin(), alive.end(), i) - alive.begin();\n }\n }\n int M = alive.size();\n vector<vector<pair<int, int>>> H(M);\n for (int u = 0; u < N; u++) {\n for (auto [v, d] : G[u]) {\n if (u > v) continue;\n if (G[u].size() >= 2 && G[v].size() >= 2) {\n H[id[u]].emplace_back(id[v], d);\n H[id[v]].emplace_back(id[u], d);\n } else {\n ans -= 2 * d;\n }\n }\n }\n cout << ans - Diam(H) << '\\n';\n return true;\n}\n\nint main() {\n while (solve()) {}\n}","accuracy":1,"time_ms":10,"memory_kb":3840,"score_of_the_acc":-0.8142,"final_rank":15},{"submission_id":"aoj_1196_10554767","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)-1;i>=0;i--)\n#define RREP2(i, n) for(ll i=(n)-1;i>=0;i--)\n#define RREP3(i, a, n) for(ll i=(n)-1;i>=(a);i--)\n#define RREP4(i, a, b, n) for(ll i=(n)-1;i>=(a);i-=(b))\n#define rrep(...) OVERLOAD_RREP(__VA_ARGS__, RREP4, RREP3, RREP2, RREP1)(__VA_ARGS__)\n#define uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))\n#define len(n) (long long)(n).size()\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>;\nusing vvpll = vector<vpll>;\n\nll intpow(ll a,ll b){\n ll ans = 1;\n while (b){\n if (b & 1){\n ans *= a;\n }\n a *= a;\n b /= 2;\n }\n return ans;\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\ntemplate<class... T>\nvoid input(T&... a){\n (cin >> ... >> a);\n}\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\";}\n\ntemplate <typename T1, typename T2>\nstd::ostream& operator<<(std::ostream& os, const std::pair<T1, T2>& p) {\n os << \"(\" << p.first << \", \" << p.second << \")\";\n return os;\n}\n\ntemplate <typename T>\nstd::ostream& operator<<(std::ostream& os, const std::vector<T>& vec) {\n os << \"[\";\n for (size_t i = 0; i < vec.size(); ++i) {\n os << vec[i];\n if (i + 1 < vec.size()) os << \", \";\n }\n os << \"]\";\n return os;\n}\n\ntemplate <typename T1, typename T2>\nstd::ostream& operator<<(std::ostream& os, const std::vector<std::pair<T1, T2>>& a) {\n os << \"[\";\n for (size_t j = 0; j < a.size(); ++j) {\n os << \"(\" << a[j].first << \", \" << a[j].second << \")\";\n\t\tif (j + 1 < a.size()) os << \", \";\n }\n\tos << \"]\";\n return os;\n}\n\ntemplate <typename T1, typename T2>\nstd::ostream& operator<<(std::ostream& os, const std::vector<std::vector<std::pair<T1, T2>>>& mat) {\n\tos << \"[\";\n for (size_t i = 0; i < mat.size(); ++i) {\n\t\tos << \"[\";\n for (size_t j = 0; j < mat[i].size(); ++j) {\n os << \"(\" << mat[i][j].first << \", \" << mat[i][j].second << \")\";\n\t\t\tif (j + 1 < mat[i].size()) os << \", \";\n }\n\t\tos << \"]\";\n\t\tif (i + 1 < mat.size()) os << \", \";\n }\n\tos << \"]\";\n return os;\n}\n\ntemplate <typename T>\nstd::ostream& operator<<(std::ostream& os, const std::set<T>& s) {\n os << \"{\";\n bool first = true;\n for (const auto& x : s) {\n if (!first) os << \", \";\n os << x;\n first = false;\n }\n os << \"}\";\n return os;\n}\n\ntemplate <typename K, typename V>\nstd::ostream& operator<<(std::ostream& os, const std::map<K, V>& m) {\n os << \"{\";\n bool first = true;\n for (const auto& [key, val] : m) {\n if (!first) os << \", \";\n os << key << \": \" << val;\n first = false;\n }\n os << \"}\";\n return os;\n}\n\ntemplate<class T, class... Ts>\nvoid print(const T& a, const Ts&... b){cout << a;(cout << ... << (cout << ' ', b));cout << '\\n';}\n\nvoid write(){cout << \"\\n\";}\ntemplate<class T, class... Ts>\nvoid write(const T& a, const Ts&... b){cout << a;(cout << ... << (cout << ' ', b));cout << '\\n';}\nvoid write(vll x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << \" \";}else{cout << '\\n';}}}\nvoid write(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';}}}\nvoid write(vi x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << \" \";}else{cout << '\\n';}}}\nvoid write(vvi x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j];if(j!=len(x[i])-1){cout << \" \";}else{cout << '\\n';}}}\nvoid write(vvvi x){rep(i,len(x))rep(j,len(x[i]))rep(k,len(x[i][j])){cout << x[i][j][k];if(k!=len(x[i][j])-1){cout << \" \";}else if(j!=len(x[i])-1){cout << \" | \";}else{cout << '\\n';}}}\nvoid write(vld x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << \" \";}else{cout << '\\n';}}}\nvoid write(vvld x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j];if(j!=len(x[i])-1){cout << \" \";}else{cout << '\\n';}}}\nvoid write(vvvld x){rep(i,len(x))rep(j,len(x[i]))rep(k,len(x[i][j])){cout << x[i][j][k];if(k!=len(x[i][j])-1){cout << \" \";}else if(j!=len(x[i])-1){cout << \" | \";}else{cout << '\\n';}}}\nvoid write(vc x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << \" \";}else{cout << '\\n';}}}\nvoid write(vvc x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j];if(j!=len(x[i])-1){cout << \" \";}else{cout << '\\n';}}}\nvoid write(vvvc x){rep(i,len(x))rep(j,len(x[i]))rep(k,len(x[i][j])){cout << x[i][j][k];if(k!=len(x[i][j])-1){cout << \" \";}else if(j!=len(x[i])-1){cout << \" | \";}else{cout << '\\n';}}}\nvoid write(vs x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << \" \";}else{cout << '\\n';}}}\nvoid write(vvs x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j];if(j!=len(x[i])-1){cout << \" \";}else{cout << '\\n';}}}\nvoid write(vvvs x){rep(i,len(x))rep(j,len(x[i]))rep(k,len(x[i][j])){cout << x[i][j][k];if(k!=len(x[i][j])-1){cout << \" \";}else if(j!=len(x[i])-1){cout << \" | \";}else{cout << '\\n';}}}\nvoid write(pll x){cout << x.first << ' ' << x.second << '\\n';}\nvoid write(vpll x){rep(i,len(x)){cout << x[i].first << ' ' << x[i].second << '\\n';}}\nvoid write(vvpll x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j].first << ' ' << x[i][j].second;if(j!=len(x[i])-1){cout << \" \";}else{cout << '\\n';}}}\n\ntemplate <typename T>\nT sum(const std::vector<T>& v) {\n return std::accumulate(v.begin(), v.end(), T(0));\n}\n\ntemplate<class T> bool chmin(T& a, const T& b){ if(a > b){ a = b; return 1; } return 0; }\ntemplate<class T> bool chmax(T& a, const T& b){ if(a < b){ a = b; return 1; } return 0; }\ntemplate<class T, class U> bool chmin(T& a, const U& b){ if(a > T(b)){ a = b; return 1; } return 0; }\ntemplate<class T, class U> bool chmax(T& a, const U& b){ if(a < T(b)){ a = b; return 1; } return 0; }\n\nlong long mod_mul(long long a, long long b, long long mod) {\n return (__int128)a * b % mod;\n}\n\nlong long mod_pow(long long a, long long b, long long mod) {\n long long result = 1;\n a %= mod;\n while (b > 0) {\n if (b & 1) result = mod_mul(result, a, mod);\n a = mod_mul(a, a, mod);\n b >>= 1;\n }\n return result;\n}\n\nbool MillerRabin(ll x){\n \n if(x <= 1){return false;}\n if(x == 2){return true;}\n if((x & 1) == 0){return false;}\n vll test;\n if(x < (1 << 30)){\n test = {2, 7, 61};\n } \n else{\n test = {2, 325, 9375, 28178, 450775, 9780504, 1795265022};\n }\n ll s = 0;\n ll d = x - 1;\n while((d & 1) == 0){\n s++;\n d >>= 1;\n }\n for(ll i:test){\n if(x <= i){return true;}\n ll y = mod_pow(i,d,x);\n if(y == 1 || y == x - 1){continue;}\n ll c = 0;\n for(int j=0;j<s-1;j++){\n y = mod_mul(y,y,x);\n if(y == x - 1){\n c = 1;\n break;\n }\n }\n if(c == 0){\n return false;\n }\n }\n return true;\n}\n\n#include<atcoder/dsu>\nvpll rle(vll seq){\n vpll res;\n for(auto x:seq){\n if(res.empty() || res.back().first != x){\n res.emplace_back(x,1);\n }\n else{\n res.back().second++;\n }\n }\n return res;\n}\nint main(){\n\tios::sync_with_stdio(false);\n\tstd::cin.tie(nullptr);\n \n while(1){\n LL(n);\n if(n == 0){break;}\n VLL(p,n-1);\n VLL(d,n-1);\n vvpll edge(n);\n vll deg(n,0);\n rep(i,n-1){\n edge[i+1].emplace_back(p[i]-1,d[i]);\n edge[p[i]-1].emplace_back(i+1,d[i]);\n deg[i+1]++;\n deg[p[i]-1]++;\n //print(i+1,p[i]-1,d[i]);\n }\n ll ans = 1LL<<60;\n vll dp1(n,1LL<<60);\n vll dp2(n,1LL<<60);\n auto dfs = [&](auto dfs, ll now, ll pa) -> void{\n dp1[now] = 0;\n vll a;\n vll b;\n for(auto [to,cost]:edge[now]){\n if(to == pa){\n continue;\n }\n if(deg[to] == 1){\n dp1[to] = 0;\n dp2[to] = 0;\n a.push_back(dp1[to]);\n b.push_back(dp2[to]);\n continue;\n }\n dfs(dfs,to,now);\n a.push_back(dp1[to] + 2 * cost);\n b.push_back(dp2[to] + 1 * cost);\n dp1[now] += dp1[to] + 2 * cost;\n }\n ll c = 1LL<<60;;\n rep(i,len(a)){\n chmin(c,-a[i]+b[i]);\n }\n dp2[now] = sum(a) + c;\n return;\n ll x = 0;\n rep(i,len(a)){\n ll temp = 0;\n rep(j,len(a)){\n temp += (i == j? b[j]:a[j]);\n }\n chmin(dp2[now],temp);\n }\n \n };\n\n rep(i,n){\n rep(j,n){\n dp1[j] = 1LL<<60;\n dp2[j] = 1LL<<60;\n \n }\n dfs(dfs,i,-1);\n chmin(ans,dp2[i]);\n //print(i,dp2[i] + sum(d),dp1,dp2);\n }\n print(ans + sum(d));\n //print(edge);\n }\n \n}","accuracy":1,"time_ms":970,"memory_kb":3840,"score_of_the_acc":-1.8142,"final_rank":20},{"submission_id":"aoj_1196_10449339","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\nusing edge = pair<int, int>; // {to, cost}\n\nconstexpr int INF = 1e9;\nconstexpr bool DEBUG = false;\n\nvector<int> bfs(const int& n, const int& start_vertex, const vector<vector<edge>>& graph) {\n vector<int> dist(n, INF);\n queue<int> q;\n dist[start_vertex] = 0;\n q.push(start_vertex);\n\n while (!q.empty()) {\n const int from = q.front();\n q.pop();\n for (auto& [to, cost] : graph[from]) {\n if (dist[to] == INF) {\n dist[to] = dist[from] + cost;\n q.push(to);\n }\n }\n }\n\n return dist;\n}\n\nint solve(const int& n, const vector<int>& p, const vector<int>& d) {\n // グラフの作成\n int rm_cost = 0;\n vector<int> deg(n, 0);\n vector<vector<edge>> graph(n);\n for (int i = 0; i < n - 1; i++) {\n int u = i + 1;\n int v = p[i];\n int w = d[i];\n graph[u].emplace_back(v, w);\n graph[v].emplace_back(u, w);\n deg[u]++;\n deg[v]++;\n rm_cost += w;\n }\n\n // 葉を除いたグラフ作成\n int g_cost = 0;\n vector<vector<edge>> g(n);\n for (int i = 0; i < n - 1; i++) {\n int u = i + 1;\n int v = p[i];\n int w = d[i];\n if (deg[u] > 1 && deg[v] > 1) {\n g[u].emplace_back(v, w);\n g[v].emplace_back(u, w);\n g_cost += w;\n }\n }\n\n // 木の直径を求める\n int start_v = -1;\n for (int i = 0; i < n; i++) {\n if (deg[i] > 1) {\n start_v = i;\n }\n }\n const auto dist1 = bfs(n, start_v, g);\n\n int far_v = start_v;\n for (int i = 0; i < n; i++) {\n if (dist1[i] != INF && dist1[i] > dist1[far_v]) {\n far_v = i;\n }\n }\n const auto dist2 = bfs(n, far_v, g);\n\n int D = 0;\n for (int i = 0; i < n; i++) {\n if (dist2[i] != INF && dist2[i] > D) {\n D = dist2[i];\n }\n }\n\n // 答えを求める: 橋を取り除くコスト + 移動コスト(葉を除いたグラフの辺の総和*2 - 直径)\n const int mv_cost = g_cost * 2 - D;\n const int ret = rm_cost + mv_cost;\n if (DEBUG) {\n printf(\"%d+%d(2*%d-%d)=%d\\n\", rm_cost, mv_cost, g_cost, D, ret);\n }\n return ret;\n}\n\nint main() {\n while (true) {\n int n;\n cin >> n;\n if (n == 0) {\n break;\n }\n\n vector<int> p(n - 1);\n vector<int> d(n - 1);\n for (auto& pi : p) {\n cin >> pi;\n pi--;\n }\n for (auto& di : d) {\n cin >> di;\n }\n cout << solve(n, p, d) << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3584,"score_of_the_acc":-0.531,"final_rank":7},{"submission_id":"aoj_1196_10449328","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\nusing edge = pair<int, int>; // {to, cost}\n\nconstexpr int INF = 1e9;\nconstexpr bool DEBUG = false;\n\nvector<int> bfs(const int& n, const int& start_vertex, const vector<vector<edge>>& graph) {\n vector<int> dist(n, INF);\n queue<int> q;\n dist[start_vertex] = 0;\n q.push(start_vertex);\n\n while (!q.empty()) {\n const int from = q.front();\n q.pop();\n for (auto& [to, cost] : graph[from]) {\n if (dist[to] == INF) {\n dist[to] = dist[from] + cost;\n q.push(to);\n }\n }\n }\n\n return dist;\n}\n\nint solve(const int& n, const vector<int>& p, const vector<int>& d) {\n // グラフの作成\n int rm_cost = 0;\n vector<int> deg(n, 0);\n vector<vector<edge>> graph(n);\n for (int i = 0; i < n - 1; i++) {\n int u = i + 1;\n int v = p[i];\n int w = d[i];\n graph[u].emplace_back(v, w);\n graph[v].emplace_back(u, w);\n deg[u]++;\n deg[v]++;\n rm_cost += w;\n }\n\n // 木の直径を求める(葉は考慮しない)\n int g_cost = 0;\n vector<vector<edge>> g(n);\n for (int i = 0; i < n - 1; i++) {\n int u = i + 1;\n int v = p[i];\n int w = d[i];\n if (deg[u] > 1 && deg[v] > 1) {\n g[u].emplace_back(v, w);\n g[v].emplace_back(u, w);\n g_cost += w;\n }\n }\n\n int start_v = -1;\n for (int i = 0; i < n; i++) {\n if (deg[i] > 1) {\n start_v = i;\n }\n }\n const auto dist1 = bfs(n, start_v, g);\n\n int far_v = start_v;\n for (int i = 0; i < n; i++) {\n if (dist1[i] != INF && dist1[i] > dist1[far_v]) {\n far_v = i;\n }\n }\n const auto dist2 = bfs(n, far_v, g);\n\n int D = 0;\n for (int i = 0; i < n; i++) {\n if (dist2[i] != INF && dist2[i] > D) {\n D = dist2[i];\n }\n }\n\n // 答えを求める: 橋を取り除くコスト + 移動コスト(葉を除いたグラフのコストの総和*2 - 直径)\n const int mv_cost = g_cost * 2 - D;\n const int ret = rm_cost + mv_cost;\n if (DEBUG) {\n printf(\"%d+%d(2*%d-%d)=%d\\n\", rm_cost, mv_cost, g_cost, D, ret);\n }\n return ret;\n}\n\nint main() {\n while (true) {\n int n;\n cin >> n;\n if (n == 0) {\n break;\n }\n\n vector<int> p(n - 1);\n vector<int> d(n - 1);\n for (auto& pi : p) {\n cin >> pi;\n pi--;\n }\n for (auto& di : d) {\n cin >> di;\n }\n cout << solve(n, p, d) << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3712,"score_of_the_acc":-0.6726,"final_rank":12},{"submission_id":"aoj_1196_10449325","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\nusing edge = pair<int, int>; // {to, cost}\n\nconstexpr int INF = 1e9;\n\nvector<int> bfs(const int& n, const int& start_vertex, const vector<vector<edge>>& graph) {\n vector<int> dist(n, INF);\n queue<int> q;\n dist[start_vertex] = 0;\n q.push(start_vertex);\n\n while (!q.empty()) {\n const int from = q.front();\n q.pop();\n for (auto& [to, cost] : graph[from]) {\n if (dist[to] == INF) {\n dist[to] = dist[from] + cost;\n q.push(to);\n }\n }\n }\n\n return dist;\n}\n\nint solve(const int& n, const vector<int>& p, const vector<int>& d) {\n // グラフの作成\n int rm_cost = 0;\n vector<int> deg(n, 0);\n vector<vector<edge>> graph(n);\n for (int i = 0; i < n - 1; i++) {\n int u = i + 1;\n int v = p[i];\n int w = d[i];\n graph[u].emplace_back(v, w);\n graph[v].emplace_back(u, w);\n deg[u]++;\n deg[v]++;\n rm_cost += w;\n }\n\n // 木の直径を求める(葉は考慮しない)\n int g_cost = 0;\n vector<vector<edge>> g(n);\n for (int i = 0; i < n - 1; i++) {\n int u = i + 1;\n int v = p[i];\n int w = d[i];\n if (deg[u] > 1 && deg[v] > 1) {\n g[u].emplace_back(v, w);\n g[v].emplace_back(u, w);\n g_cost += w;\n }\n }\n\n\n int start_v = -1;\n for (int i = 0; i < n; i++) {\n if (deg[i] > 1) {\n start_v = i;\n }\n }\n const auto dist1 = bfs(n, start_v, g);\n\n int far_v = start_v;\n for (int i = 0; i < n; i++) {\n if (dist1[i] != INF && dist1[i] > dist1[far_v]) {\n far_v = i;\n }\n }\n const auto dist2 = bfs(n, far_v, g);\n\n int D = 0;\n for (int i = 0; i < n; i++) {\n if (dist2[i] != INF && dist2[i] > D) {\n D = dist2[i];\n }\n }\n\n // 答えを求める: 橋を取り除くコスト + 移動コスト(葉を除いたグラフのコストの総和*2 - 直径)\n const int mv_cost = g_cost * 2 - D;\n const int ret = rm_cost + mv_cost;\n // printf(\"%d+%d(2*%d-%d)=%d\\n\", rm_cost, mv_cost, g_cost, D, ret);\n return ret;\n}\n\nint main() {\n while (true) {\n int n;\n cin >> n;\n if (n == 0) {\n break;\n }\n\n vector<int> p(n - 1);\n vector<int> d(n - 1);\n for (auto& pi : p) {\n cin >> pi;\n pi--;\n }\n for (auto& di : d) {\n cin >> di;\n }\n cout << solve(n, p, d) << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3712,"score_of_the_acc":-0.6726,"final_rank":12},{"submission_id":"aoj_1196_10449321","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\nusing edge = pair<int, int>; // {to, cost}\n\nconstexpr int INF = 1e9;\n\nvector<int> bfs(const int& n, const int& start_vertex, const vector<vector<edge>>& graph) {\n vector<int> dist(n, INF);\n queue<int> q;\n dist[start_vertex] = 0;\n q.push(start_vertex);\n\n while (!q.empty()) {\n const int from = q.front();\n q.pop();\n for (auto& [to, cost] : graph[from]) {\n if (dist[to] == INF) {\n dist[to] = dist[from] + cost;\n q.push(to);\n }\n }\n }\n\n return dist;\n}\n\nint solve(const int& n, const vector<int>& p, const vector<int>& d) {\n // グラフの作成\n vector<int> deg(n, 0);\n vector<vector<edge>> graph(n);\n for (int i = 1; i < n; i++) {\n graph[i].emplace_back(p[i - 1], d[i - 1]);\n graph[p[i - 1]].emplace_back(i, d[i - 1]);\n deg[i]++;\n deg[p[i - 1]]++;\n }\n\n // 木の直径を求める(葉は考慮しない)\n vector<vector<edge>> g(n);\n for (int i = 0; i < n - 1; i++) {\n int u = i + 1;\n int v = p[i];\n int w = d[i];\n if (deg[u] > 1 && deg[v] > 1) {\n g[u].emplace_back(v, w);\n g[v].emplace_back(u, w);\n }\n }\n\n\n int start_v = -1;\n for (int i = 0; i < n; i++) {\n if (deg[i] > 1) {\n start_v = i;\n }\n }\n const auto dist1 = bfs(n, start_v, g);\n\n int far_v = start_v;\n for (int i = 0; i < n; i++) {\n if (dist1[i] != INF && dist1[i] > dist1[far_v]) {\n far_v = i;\n }\n }\n const auto dist2 = bfs(n, far_v, g);\n\n int D = 0;\n for (int i = 0; i < n; i++) {\n if (dist2[i] != INF && dist2[i] > D) {\n D = dist2[i];\n }\n }\n\n // 答えを求める: 橋を取り除くコスト + 移動コスト(葉を除いたグラフのコストの総和*2 - 直径)\n int rm_cost = 0;\n for (auto& di : d) {\n rm_cost += di;\n }\n\n int g_cost = 0;\n for (int i = 0; i < n - 1; i++) {\n const int u = i + 1;\n const int v = p[i];\n if (deg[u] > 1 && deg[v] > 1) {\n g_cost += d[i];\n }\n }\n\n const int mv_cost = g_cost * 2 - D;\n const int ret = rm_cost + mv_cost;\n // printf(\"%d+%d(2*%d-%d)=%d\\n\", rm_cost, mv_cost, g_cost, D, ret);\n return ret;\n}\n\nint main() {\n while (true) {\n int n;\n cin >> n;\n if (n == 0) {\n break;\n }\n\n vector<int> p(n - 1);\n vector<int> d(n - 1);\n for (auto& pi : p) {\n cin >> pi;\n pi--;\n }\n for (auto& di : d) {\n cin >> di;\n }\n cout << solve(n, p, d) << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3712,"score_of_the_acc":-0.6726,"final_rank":12},{"submission_id":"aoj_1196_9757618","code_snippet":"#include <bits/stdc++.h>\n using namespace std;\n \n template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\n template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n #define rep(i,n) for (int i = 0; i < (n); ++i)\n\n typedef long long ll;\n typedef unsigned long long ull;\n using P=pair<int,int>;\n using T=tuple<ll,ll,ll>;\n const int INF=1001001001;\n const ll INFL=1e18;\n const int mod=998244353;\n\t\n\tvoid dfs(int v,int pre,vector<int>& mx,vector<vector<P>>& G){\n\t\tfor(auto[u,w]:G[v]){\n\t\t\tif(u==pre)continue;\n\t\t\tdfs(u,v,mx,G);\n\t\t\tchmax(mx[v],mx[u]+w);\n\t\t}\n\t}\n\n bool solve(){\n\t\tint n;\n\t\tcin>>n;\n\t\tif(!n)return false;\n\t\tvector<int>a(n),b(n),deg(n);\n\t\trep(i,n-1){\n\t\t\tcin>>a[i];\n\t\t\ta[i]--;\n\t\t\tdeg[a[i]]++;deg[i+1]++;\n\t\t}\n\t\trep(i,n-1){cin>>b[i];}\n\t\t\n\t\tvector<vector<P>>G(n);\n\t\tint tot=0;\n\t\trep(i,n-1){\n\t\t\tif(deg[a[i]]>1&°[i+1]>1){\n\t\t\t\ttot+=b[i]*3;\n\t\t\t\tG[i+1].push_back({a[i],b[i]});\n\t\t\t\tG[a[i]].push_back({i+1,b[i]});\n\t\t\t}else{\n\t\t\t\ttot+=b[i];\n\t\t\t}\n\t\t}\n\t\t\n\t\tint ans=INF;\n\t\trep(i,n){\n\t\t\tvector<int>mx(n);\n\t\t\tdfs(i,-1,mx,G);\n\t\t\tchmin(ans,tot-mx[i]);\n\t\t}\n\t\tcout<<ans<<endl;\n\t\t\n\t\treturn true;\n }\n\n int main(){\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n\n\t\twhile(1){\n\t\t\tif(!solve()){break;}\n\t\t}\n\t\t\n return 0;\n }","accuracy":1,"time_ms":80,"memory_kb":3584,"score_of_the_acc":-0.6039,"final_rank":11},{"submission_id":"aoj_1196_9531684","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 Diam(int N, int S, vector<vector<pair<int,int>>>& G) {\n vector<int> DP(N,inf);\n queue<int> Q;\n DP[S] = 0;\n Q.push(S);\n while(!Q.empty()) {\n int P = Q.front();\n Q.pop();\n for (pair<int,int> E : G[P]) {\n if (DP[E.first] == inf) {\n DP[E.first] = DP[P] + E.second;\n Q.push(E.first);\n }\n }\n }\n int NS = -1, MAX = -1;\n rep(i,0,N) {\n if (DP[i] == inf) continue;\n if (DP[i] > MAX) {\n MAX = DP[i], NS = i;\n }\n }\n DP.assign(N,inf);\n DP[NS] = 0;\n Q.push(NS);\n while(!Q.empty()) {\n int P = Q.front();\n Q.pop();\n for (pair<int,int> E : G[P]) {\n if (DP[E.first] == inf) {\n DP[E.first] = DP[P] + E.second;\n Q.push(E.first);\n }\n }\n }\n int Ret = -1;\n rep(i,0,N) {\n if (DP[i] == inf) continue;\n chmax(Ret, DP[i]);\n }\n return Ret;\n}\n\nint main() {\nwhile(1) {\n int N;\n cin >> N;\n if (N == 0) return 0;\n vector<int> P(N,-1), D(N,0);\n vector<vector<pair<int,int>>> G(N);\n rep(i,1,N) cin >> P[i], P[i]--;\n rep(i,1,N) cin >> D[i];\n int ANS = 0;\n rep(i,1,N) {\n G[P[i]].push_back({i,D[i]});\n G[i].push_back({P[i],D[i]});\n ANS += D[i] * 3;\n }\n vector<int> S(N);\n rep(i,0,N) S[i] = G[i].size();\n rep(i,0,N) {\n if (S[i] == 1) {\n ANS -= G[i][0].second * 2;\n }\n }\n vector<vector<pair<int,int>>> NG(N);\n rep(i,0,N) {\n if (S[i] == 1) continue;\n for (pair<int,int> P : G[i]) {\n if (S[P.first] == 1) continue;\n NG[i].push_back(P);\n }\n }\n rep(i,0,N) {\n if (!NG[i].empty()) {\n ANS -= Diam(N,i,NG);\n break;\n }\n }\n cout << ANS << endl;\n}\n}","accuracy":1,"time_ms":10,"memory_kb":3620,"score_of_the_acc":-0.5708,"final_rank":8},{"submission_id":"aoj_1196_9447328","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// verify 木DP https://atcoder.jp/contests/dp/submissions/55190036\n// verify 全方位木DP(直径) https://onlinejudge.u-aizu.ac.jp/status/users/shkii/submissions/1/GRL_5_A/judge/9411502/C++17\n// verify 全方位木DP https://atcoder.jp/contests/arc179/submissions/55189994\ntuple<vector<int>,vector<int>,vector<int>> tree_dfs(vector<vector<int>> &v,int root = 0){\n int n = v.size();\n vector<int> par(n,-1); // par[i] := rootを根とした頂点iの親\n vector<int> par_idx(n,-1); // par_idx[ov] := v[ov]の中でpar[ov]がいるidx\n vector<int> order(n,-1); // order[i] := dfs帰りがけ順i番目の頂点。この昇順に木DP そのあと降順に全方位木DP\n int cnt = 0;\n auto dfs = [&](auto &dfs,int ov,int pre)->void{\n par[ov] = pre;\n for(int i = 0;i < v[ov].size();i++){\n int nv = v[ov][i];\n if(nv == pre){\n par_idx[ov] = i;\n continue;\n }\n dfs(dfs,nv,ov);\n }\n order[cnt++] = ov;\n };\n dfs(dfs,root,-1);\n return {par,par_idx,order};\n};\n\n\nint main(){\n \n ios_base::sync_with_stdio(0), cin.tie(0);\n while(1){\n int n;cin >> n;\n if(!n)break;\n vi p(n-1),d(n-1);\n cin >> p >> d;\n vi cnt(n);\n ll res = 0;\n rep(i,n-1){\n p[i]--;\n cnt[p[i]]++;cnt[i+1]++;\n res += d[i];\n }\n ve v(n);\n vvi w(n);\n int root = 0;\n rep(i,n-1){\n if(cnt[i+1] != 1 && cnt[p[i]] != 1){\n v[i+1].emplace_back(p[i]);\n v[p[i]].emplace_back(i+1);\n w[i+1].emplace_back(d[i]);\n w[p[i]].emplace_back(d[i]);\n res += 2*d[i];\n }\n }\n rep(i,n)if(cnt[i] != 1)root = i;\n vvi dp(n);\n auto [par,p_idx,ord] = tree_dfs(v,root);\n auto f = [](ll a,ll c,ll w){return max(a,c+w);};\n auto g = [](ll a,ll b){return max(a,b);};\n rep(_,n){\n int ov = ord[_];\n if(ov == -1)break;\n int deg = sz(v[ov]);\n dp[ov].resize(deg+1);\n rep(i,deg){\n int nv = v[ov][i];\n if(nv == par[ov])continue;\n dp[ov][i] = dp[nv][sz(v[nv])];\n dp[ov][deg] = f(dp[ov][deg],dp[ov][i],w[ov][i]);\n }\n }\n vi ans(n,-1);\n for(int _ = n-1;_ >= 0;_--){\n int ov = ord[_];\n if(ov == -1)continue;\n int deg = sz(v[ov]);\n vi L(deg+1),R(deg+1);\n rep(i,deg)L[i+1] = f(L[i],dp[ov][i],w[ov][i]);\n for(int i = deg-1;i >= 0;i--)R[i] = f(R[i+1],dp[ov][i],w[ov][i]);\n ans[ov] = L[deg];\n rep(i,deg){\n int nv = v[ov][i];\n if(nv == par[ov])continue;\n dp[nv][p_idx[nv]] = g(L[i],R[i+1]);\n }\n }\n res = res-*max_element(ALL(ans));\n cout << res << \"\\n\";\n }\n \n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3556,"score_of_the_acc":-0.5,"final_rank":5},{"submission_id":"aoj_1196_9417088","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nstruct Edge{\n int idx, val;\n Edge(int idx, int val) : idx(idx), val(val) {}\n};\n\nconstexpr long long INF = 1e18;\n\nint main() {\n while(true) {\n int N;\n cin >> N;\n if(N == 0) return 0;\n vector<vector<pair<int, Edge>>> G(N);\n vector<int> P(N), D(N);\n long long edge_sum = 0;\n for(int i = 1; i < N; i++) {\n cin >> P[i];\n P[i]--;\n }\n for(int i = 1; i < N; i++) {\n cin >> D[i];\n edge_sum += D[i];\n G[i].push_back({P[i], Edge(i, D[i])});\n G[P[i]].push_back({i, Edge(i, D[i])});\n }\n\n long long delete_sum = 0;\n set<int> delete_edge;\n for(int i = 0; i < N; i++) {\n if(G[i].size() != 1) continue;\n delete_edge.insert(G[i][0].second.idx);\n delete_sum += G[i][0].second.val;\n }\n \n int s = 0;\n while(G[s].size() == 1) s++;\n\n vector<long long> dist(N, INF);\n dist[s] = 0;\n priority_queue<pair<long long, int>> pq;\n pq.push({0, s});\n while(pq.size()) {\n auto [d, v] = pq.top(); pq.pop();\n for(auto [nv, e] : G[v]) {\n if(delete_edge.count(e.idx)) continue;\n if(dist[nv] <= dist[v] + e.val) continue;\n dist[nv] = dist[v] + e.val;\n pq.push({-dist[nv], nv});\n }\n }\n\n long long ma = 0;\n for(int i = 0; i < N; i++) {\n if(dist[i] == INF) continue;\n if(ma < dist[i]) {\n ma = dist[i];\n s = i;\n }\n }\n\n dist = vector<long long>(N, INF);\n dist[s] = 0;\n pq.push({0, s});\n while(pq.size()) {\n auto [d, v] = pq.top(); pq.pop();\n for(auto [nv, e] : G[v]) {\n if(delete_edge.count(e.idx)) continue;\n if(dist[nv] <= dist[v] + e.val) continue;\n dist[nv] = dist[v] + e.val;\n pq.push({-dist[nv], nv});\n }\n }\n\n ma = 0;\n for(int i = 0; i < N; i++) {\n if(dist[i] == INF) continue;\n if(ma < dist[i]) {\n ma = dist[i];\n s = i;\n }\n }\n\n long long ans = edge_sum + (edge_sum - delete_sum) * 2 - ma;\n cout << ans << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3488,"score_of_the_acc":-0.4352,"final_rank":2},{"submission_id":"aoj_1196_9343042","code_snippet":"// #pragma GCC target(\"avx2\")\n// #pragma GCC optimize(\"O3\")\n// #pragma GCC optimize(\"unroll-loops\")\n#include<bits/stdc++.h>\n#ifdef DEBUG\n#include \"cpp-dump/dump.hpp\"\n#define dump(...) cpp_dump(__VA_ARGS__)\n#else\n#define dump(...)\n#endif\nusing namespace std;\n#define rep(i,n) for (long long i=0;i<n;i++)\n#define loop(i,m,n) for(long long i=m;i<=n;i++)\n#define range(value,range) for(const auto &value : range)\n#define ll long long\n#define vl vector<long long>\n#define vvl vector<vector<long long>>\n#define vdbg(a) rep(ii,a.size()){cout<<a[ii]<<\" \";}cout<<endl;\n#define vvdbg(a) rep(ii,a.size()){rep(jj,a[ii].size()){cout<<a[ii][jj]<<\" \";}cout<<endl;}\n#define inf 4000000000000000000LL\n#define mod 998244353\nconst int lim = INT16_MAX;\nmap<pair<int, int>,ll> memo;\n\ntemplate<class Monoid> struct ReRooting {\n using Graph = vector<vector<int>>;\n using MergeFunc = function<Monoid(Monoid, Monoid)>;\n using AddNodeFunc = function<Monoid(int,int, Monoid)>;\n \n // core member\n Graph G;\n Monoid IDENTITY;\n MergeFunc MERGE;\n AddNodeFunc ADDNODE;\n \n // inner data\n vector<vector<Monoid>> dp;\n \n // constructor\n ReRooting() {}\n ReRooting(const Graph &g, const Monoid &identity,\n const MergeFunc &merge, const AddNodeFunc &addnode) {\n G = g;\n IDENTITY = identity;\n MERGE = merge;\n ADDNODE = addnode;\n build();\n }\n \n // re-looting dp\n Monoid rec(int v, int p) {\n Monoid res = IDENTITY;\n dp[v].assign(G[v].size(), IDENTITY);\n for (int i = 0; i < G[v].size(); ++i) {\n int v2 = G[v][i];\n if (v2 == p) continue;\n dp[v][i] = rec(v2, v);\n res = MERGE(res, dp[v][i]);\n }\n return ADDNODE(v,p, res);\n }\n void rerec(int v, int p, Monoid pval) {\n for (int i = 0; i < G[v].size(); ++i) {\n int v2 = G[v][i];\n if (v2 == p) {\n dp[v][i] = pval;\n continue;\n }\n }\n vector<Monoid> left(G[v].size() + 1, IDENTITY);\n vector<Monoid> right(G[v].size() + 1, IDENTITY);\n for (int i = 0; i < G[v].size(); ++i) {\n left[i + 1] = MERGE(left[i], dp[v][i]);\n right[i + 1] = MERGE(right[i], dp[v][(int)G[v].size() - i - 1]);\n }\n for (int i = 0; i < G[v].size(); ++i) {\n int v2 = G[v][i];\n if (v2 == p) continue;\n Monoid pval2 = MERGE(left[i], right[(int)G[v].size() - i - 1]);\n rerec(v2, v, ADDNODE(v,v2, pval2));\n }\n }\n void build() {\n dp.assign(G.size(), vector<Monoid>());\n int root = 0, nullparent = -1;\n rec(root, nullparent);\n rerec(root, nullparent, IDENTITY);\n }\n \n // getter\n Monoid get(int v) {\n Monoid res = IDENTITY;\n for (int i = 0; i < G[v].size(); ++i) {\n res = MERGE(res, dp[v][i]);\n }\n return ADDNODE(v,lim, res);\n }\n \n // dump\n friend constexpr ostream& operator << (ostream &os, const ReRooting<Monoid> &rr) {\n for (int v = 0; v < rr.G.size(); ++v) {\n for (int i = 0; i < rr.G[v].size(); ++i) {\n os << v << \" -> \" << rr.G[v][i] << \": \" << rr.dp[v][i] << endl;\n }\n }\n return os;\n }\n};\n\nll solve() {\n \n ll n;\n cin >> n;\n memo.clear();\n if (n == 0) return 1;\n vector<vector<int>> G(n);\n vector<ll> P(n), D(n);\n for (ll i = 0; i < n-1; ++i) {\n int p;\n cin >> p;\n --p;\n G[i+1].push_back(p);\n G[p].push_back(i+1);\n P[i] = p;\n }\n for (ll i = 0; i < n-1; ++i) {\n ll d;\n cin >> d;\n memo[{(int)i+1,P[i]}] = d;\n memo[{P[i],(int)i+1}] = d;\n }\n\n dump(memo);\n dump(G | cpp_dump::index());\n\n // 行って戻るコスト: 部分木の中のパスグラフの最大コスト\n using Monoid = pair<ll, ll>;\n Monoid identity = {0,0};\n auto merge = [&](Monoid a, Monoid b) -> Monoid{\n ll fir = a.first+b.first;\n ll sec = max(a.second, b.second);\n\n return {fir,sec};\n };\n\n auto addnode = [&](int from, int to, Monoid a) -> Monoid {\n if (to == lim) {\n return a;\n }\n\n if (a.first == 0) {\n return {memo[{from,to}],0};\n }\n\n return {memo[{from,to}]*3+a.first, memo[{from,to}]+a.second};\n };\n\n ReRooting<Monoid> reroot(G, identity,merge,addnode);\n\n ll ans = inf;\n for (ll i = 0; i < n; ++i) {\n ans = min(ans,reroot.get(i).first - reroot.get(i).second);\n }\n\n cout << ans << endl;\n\n return 0;\n\n}\n\nint main(){\n while(1){\n if(solve()==1)break;\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":4004,"score_of_the_acc":-1.0164,"final_rank":17},{"submission_id":"aoj_1196_9343014","code_snippet":"// #pragma GCC target(\"avx2\")\n// #pragma GCC optimize(\"O3\")\n// #pragma GCC optimize(\"unroll-loops\")\n#include<bits/stdc++.h>\n#ifdef DEBUG\n#include \"cpp-dump/dump.hpp\"\n#define dump(...) cpp_dump(__VA_ARGS__)\n#else\n#define dump(...)\n#endif\nusing namespace std;\n#define rep(i,n) for (long long i=0;i<n;i++)\n#define loop(i,m,n) for(long long i=m;i<=n;i++)\n#define range(value,range) for(const auto &value : range)\n#define ll long long\n#define vl vector<long long>\n#define vvl vector<vector<long long>>\n#define vdbg(a) rep(ii,a.size()){cout<<a[ii]<<\" \";}cout<<endl;\n#define vvdbg(a) rep(ii,a.size()){rep(jj,a[ii].size()){cout<<a[ii][jj]<<\" \";}cout<<endl;}\n#define inf 4000000000000000000LL\n#define mod 998244353\nconst int lim = INT16_MAX;\nmap<pair<int, int>,ll> memo;\n\ntemplate<class Monoid> struct ReRooting {\n using Graph = vector<vector<int>>;\n using MergeFunc = function<Monoid(Monoid, Monoid)>;\n using AddNodeFunc = function<Monoid(int,int, Monoid)>;\n \n // core member\n Graph G;\n Monoid IDENTITY;\n MergeFunc MERGE;\n AddNodeFunc ADDNODE;\n \n // inner data\n vector<vector<Monoid>> dp;\n \n // constructor\n ReRooting() {}\n ReRooting(const Graph &g, const Monoid &identity,\n const MergeFunc &merge, const AddNodeFunc &addnode) {\n G = g;\n IDENTITY = identity;\n MERGE = merge;\n ADDNODE = addnode;\n build();\n }\n \n // re-looting dp\n Monoid rec(int v, int p) {\n Monoid res = IDENTITY;\n dp[v].assign(G[v].size(), IDENTITY);\n for (int i = 0; i < G[v].size(); ++i) {\n int v2 = G[v][i];\n if (v2 == p) continue;\n dp[v][i] = rec(v2, v);\n res = MERGE(res, dp[v][i]);\n }\n return ADDNODE(v,p, res);\n }\n void rerec(int v, int p, Monoid pval) {\n for (int i = 0; i < G[v].size(); ++i) {\n int v2 = G[v][i];\n if (v2 == p) {\n dp[v][i] = pval;\n continue;\n }\n }\n vector<Monoid> left(G[v].size() + 1, IDENTITY);\n vector<Monoid> right(G[v].size() + 1, IDENTITY);\n for (int i = 0; i < G[v].size(); ++i) {\n left[i + 1] = MERGE(left[i], dp[v][i]);\n right[i + 1] = MERGE(right[i], dp[v][(int)G[v].size() - i - 1]);\n }\n for (int i = 0; i < G[v].size(); ++i) {\n int v2 = G[v][i];\n if (v2 == p) continue;\n Monoid pval2 = MERGE(left[i], right[(int)G[v].size() - i - 1]);\n rerec(v2, v, ADDNODE(v,v2, pval2));\n }\n }\n void build() {\n dp.assign(G.size(), vector<Monoid>());\n int root = 0, nullparent = -1;\n rec(root, nullparent);\n rerec(root, nullparent, IDENTITY);\n }\n \n // getter\n Monoid get(int v) {\n Monoid res = IDENTITY;\n for (int i = 0; i < G[v].size(); ++i) {\n res = MERGE(res, dp[v][i]);\n }\n return ADDNODE(v,lim, res);\n }\n \n // dump\n friend constexpr ostream& operator << (ostream &os, const ReRooting<Monoid> &rr) {\n for (int v = 0; v < rr.G.size(); ++v) {\n for (int i = 0; i < rr.G[v].size(); ++i) {\n os << v << \" -> \" << rr.G[v][i] << \": \" << rr.dp[v][i] << endl;\n }\n }\n return os;\n }\n};\n\nll solve() {\n \n ll n;\n cin >> n;\n memo.clear();\n if (n == 0) return 1;\n vector<vector<int>> G(n);\n vector<ll> P(n), D(n);\n for (ll i = 0; i < n-1; ++i) {\n int p;\n cin >> p;\n --p;\n G[i+1].push_back(p);\n G[p].push_back(i+1);\n P[i] = p;\n }\n for (ll i = 0; i < n-1; ++i) {\n ll d;\n cin >> d;\n memo[{(int)i+1,P[i]}] = d;\n memo[{P[i],(int)i+1}] = d;\n }\n\n dump(memo);\n dump(G | cpp_dump::index());\n\n // 行って戻るコスト: 部分木の中のパスグラフの最大コスト\n using Monoid = pair<ll, ll>;\n Monoid identity = {0,0};\n auto merge = [&](Monoid a, Monoid b) -> Monoid{\n ll fir = a.first+b.first;\n ll sec = max(a.second, b.second);\n\n return {fir,sec};\n };\n\n auto addnode = [&](int from, int to, Monoid a) -> Monoid {\n if (to == lim) {\n return a;\n }\n\n if (a.first == 0) {\n return {memo[{from,to}],0};\n }\n\n return {memo[{from,to}]*3+a.first, memo[{from,to}]+a.second};\n };\n\n ReRooting<Monoid> reroot(G, identity,merge,addnode);\n\n ll ans = inf;\n for (ll i = 0; i < n; ++i) {\n ans = min(ans,reroot.get(i).first - reroot.get(i).second);\n }\n\n cout << ans << endl;\n\n return 0;\n\n}\n\nint main(){\n while(1){\n if(solve()==1)break;\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":4008,"score_of_the_acc":-1.0208,"final_rank":18},{"submission_id":"aoj_1196_9329403","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\n#define rep(i,n) for(int i = 0;i < n;i++)\n\n#define int ll\n\npair<int,int> far(int s, int n, const vector<vector<pair<int,int>>> &adj)\n{\n vector<int> dist(n, (1LL<<60));\n priority_queue<pair<int,int>> que;\n que.emplace(0,s);\n dist.at(s) = 0;\n\n while(!que.empty())\n {\n int d = - que.top().first;\n int now = que.top().second;\n que.pop();\n if(dist.at(now) < d) continue;\n dist.at(now) = d;\n for(auto [nxt, c] : adj.at(now))\n {\n if(dist.at(nxt) < d + c) continue;\n que.emplace(-(d+c), nxt);\n }\n }\n int pnt = s;\n int d = 0;\n rep(i,n)\n {\n if(dist.at(i) > d)\n {\n d = dist.at(i);\n pnt = i;\n }\n }\n return make_pair(pnt, d);\n}\n\nvoid main_()\n{\n int n;\n cin >> n;\n if(!n) exit(0);\n\n vector<int> b(n-1), c(n-1);\n rep(i,n-1) cin >> b[i];\n rep(i,n-1) b[i]--;\n rep(i,n-1) cin >> c[i];\n\n int sum_a = 0;\n rep(i,n-1) sum_a += c[i];\n\n vector<int> deg(n,1);\n deg[0] = 0;\n rep(i,n-1) deg.at(b[i]) += 1;\n\n set<int> st;\n rep(i,n)\n if(deg.at(i) >= 2) st.insert(i);\n\n int m = st.size();\n map<int, int> mp;\n int idx = 0;\n for(int i : st) mp[i] = idx++;\n // 1 ~ m\n vector<vector<pair<int,int>>> adj(m);\n int sum_b = 0;\n rep(i,n-1)\n {\n // i + 1 to b[i]\n int from = i + 1;\n if(st.find(from) == st.end()) continue;\n if(st.find(b[i]) == st.end()) continue;\n\n adj.at(mp[from]).emplace_back(mp[b[i]], c[i]);\n adj.at(mp[b[i]]).emplace_back(mp[from], c[i]);\n sum_b += c[i];\n }\n pair<int,int> one = far(0, m, adj);\n pair<int,int> two = far(one.first, m, adj);\n int dist = two.second;\n\n int ans = sum_a + (2*sum_b) - dist;\n cout << ans << endl;\n}\n\n\nsigned main()\n{\n while(1) main_();\n}","accuracy":1,"time_ms":20,"memory_kb":3624,"score_of_the_acc":-0.5856,"final_rank":9},{"submission_id":"aoj_1196_9327982","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, a, n) for(int i = a; i < n; i++)\n#define rrep(i, a, n) for(int i = a; i >= n; i--)\n#define inr(l, x, r) (l <= x && x < r)\n#define ll long long\n#define ld long double\n\nconstexpr int IINF = 1001001001;\nconstexpr ll INF = 9e18;\n\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\nint main() {\n while(1){\n int n; cin >> n;\n if(n == 0) break;\n vector<vector<pair<int,int>>> g(n);\n vector<int> p(n-1), d(n-1);\n int dsum = 0;\n rep(i,0,n-1){\n cin >> p[i];\n p[i]--;\n }\n rep(i,0,n-1){\n cin >> d[i];\n dsum += d[i]*3;\n }\n rep(i,0,n-1){\n g[i+1].push_back({p[i],d[i]});\n g[p[i]].push_back({i+1,d[i]});\n }\n int ans = IINF;\n int maxdist;\n int res;\n\n auto dfs = [&](auto dfs, int v, int p, int dist)->void{\n if(g[v].size() >= 2 || g[v][0].first != p){\n chmax(maxdist, dist);\n }else{\n res -= 2*g[v][0].second;\n }\n for(auto nv: g[v]){\n if(nv.first == p) continue;\n dfs(dfs, nv.first, v, dist+nv.second);\n }\n };\n \n auto solve = [&](int i)->int{\n maxdist = 0;\n res = dsum;\n dfs(dfs, i, -1, 0);\n res -= maxdist;\n return res;\n };\n\n rep(i,0,n){\n chmin(ans,solve(i));\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":150,"memory_kb":3504,"score_of_the_acc":-0.5883,"final_rank":10},{"submission_id":"aoj_1196_9269408","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst ll LINF = 1e18;\n\nint main(){\n while(1){\n int N; cin >> N;\n if(N == 0) break;\n vector<int> P(N - 1); for(int i = 0; i < N - 1; i++) cin >> P[i];\n vector<int> D(N - 1); for(int i = 0; i < N - 1; i++) cin >> D[i];\n\n vector<vector<pair<int, int>>> G(N);\n for(int i = 0; i < N - 1; i++){\n int u = P[i] - 1, v = i + 1;\n G[u].emplace_back(make_pair(v, D[i]));\n G[v].emplace_back(make_pair(u, D[i]));\n }\n\n auto dfs = [&](auto f, int u, int par) -> ll {\n ll res = 0;\n for(auto [v, d] : G[u]){\n\t\t\t\tif(v == par) continue;\n if(G[v].size() == 1) continue;\n else{\n res = max(res, f(f, v, u) + d);\n }\n }\n return res;\n };\n\n // auto rec = [&](auto f, int u, int par) -> ll {\n // ll res = 0;\n // for(auto [v, d] : G[u]){\n\t\t// \t\tcout << \"(\" << v << \",\" << d << \")\";\n // if(v == par) continue;\n // if(G[v].size() == 1) res += d;\n // else{\n // f(f, v, u);\n // res += d * 3;\n // }\n // }\n // return res;\n // };\n\n ll ans = LINF;\n\t\tll num = 0;\n\t\tfor(int i = 0; i < N; i++){\n\t\t\tfor(auto [j, d] : G[i]){\n\t\t\t\tif(i > j) continue;\n\t\t\t\tif(G[i].size() == 1 || G[j].size() == 1){\n\t\t\t\t\tnum += d;\n\t\t\t\t}\n\t\t\t\telse num += d * 3;\n\t\t\t}\n\t\t}\n for(int i = 0; i < N; i++){\n if(G[i].size() == 1) continue;\n\t\t\tll val = dfs(dfs, i, -1);\n\t\t\t// cout << num << \" \" << val << \" \";\n ans = min(ans, num - val);\n }\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":70,"memory_kb":3484,"score_of_the_acc":-0.4829,"final_rank":3},{"submission_id":"aoj_1196_9247544","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,n) for(int i=0;i<n;i++)\n\nusing Edge=pair<int,int>;\nusing Graph=vector<vector<Edge>>;\n\n\n#define INF 1<<30\n\nvoid dijkstra(Graph& g, int s, int n, vector<int>& dist){\n dist.assign(n, INF);\n dist[s]=0;\n\n vector<int> seen(n,false);\n\n for(;;){\n int pos=-1;\n int mi=INF;\n rep(i,n){\n if(seen[i] || mi<= dist[i]) continue;\n pos=i;\n mi=dist[i];\n }\n if(pos==-1) break;\n\n seen[pos]=true;\n rep(i,g[pos].size()){\n int next=g[pos][i].first;\n int cost=g[pos][i].second;\n dist[next]=min(dist[next], dist[pos]+cost);\n }\n }\n}\n\nint solve(int n){\n vector<int> p(n-1), d(n-1);\n rep(i,n-1){cin>>p[i];p[i]--;}\n rep(i,n-1) cin>>d[i];\n\n int res=0;\n rep(i,n-1) res+=d[i];\n res*=3;\n\n Graph graph(n);\n rep(i,n-1){\n graph[i+1].push_back({p[i], d[i]});\n graph[p[i]].push_back({i+1, d[i]});\n }\n\n rep(i,n){\n if(graph[i].size()==1){\n res-=2*graph[i][0].second;\n int to=graph[i][0].first;\n graph[i][0].second=0;\n rep(j,graph[to].size()) if(graph[to][j].first==i) graph[to][j].second=0;\n }\n }\n\n vector<int> dist;\n dijkstra(graph,0,n,dist);\n int tmp=0;\n rep(i,n) if(dist[tmp]<dist[i]) tmp=i;\n dijkstra(graph,tmp,n,dist);\n tmp=0;\n rep(i,n) if(dist[tmp]<dist[i]) tmp=i;\n res-=dist[tmp];\n return res;\n\n}\n\nint main(){\n for(;;){\n int n; cin>>n;\n if(n==0) return 0;\n cout<<solve(n)<<endl;\n }\n}","accuracy":1,"time_ms":80,"memory_kb":3504,"score_of_the_acc":-0.5154,"final_rank":6},{"submission_id":"aoj_1196_9180296","code_snippet":"#include <bits/stdc++.h>\n\nbool solve() {\n int N;\n std::cin >> N;\n if (N == 0) return false;\n std::vector<std::vector<int>> g(N);\n for (int i{1} ; i < N ; i++) {\n int P;\n std::cin >> P;\n P--;\n g[P].push_back(i);\n g[i].push_back(P);\n }\n std::vector<int> D(N);\n for (int i{1} ; i < N ; i++) {\n std::cin >> D[i];\n }\n if (N == 2) {\n std::cout << D[1] << '\\n';\n return true;\n }\n auto cost{[&](int u, int v) -> int {\n assert(0 <= u and u < N);\n assert(0 <= v and v < N);\n return D[std::max(u, v)];\n }};\n std::vector<bool> leaf(N);\n for (int i{} ; i < N ; i++) {\n leaf[i] = (g[i].size() == 1u);\n }\n std::map<std::pair<int, int>, long long> dp1;\n // return to v\n auto rec1{[&](auto rec, int v, int p) -> long long {\n if (dp1.find(std::pair{ p, v }) != dp1.end()) {\n return dp1[std::pair{ p, v }];\n }\n long long res{};\n for (auto x : g[v]) {\n if (x == p) continue;\n if (leaf[x]) res += cost(v, x);\n else res += 3 * cost(v, x) + rec(rec, x, v);\n }\n return dp1[std::pair{ p, v }] = res;\n }};\n std::map<std::pair<int, int>, long long> dp2;\n auto rec2{[&](auto rec, int v, int p) -> long long {\n if (dp2.find(std::pair{ p, v }) != dp2.end()) {\n return dp2[std::pair{ p, v }];\n }\n long long base{};\n for (auto x : g[v]) {\n if (x == p) continue;\n if (leaf[x]) base += cost(v, x);\n else base += 3 * cost(v, x) + rec1(rec1, x, v);\n }\n long long res{base};\n for (auto x : g[v]) {\n if (x == p) continue;\n if (leaf[x]) continue;\n long long value{base};\n value -= 3 * cost(v, x) + rec1(rec1, x, v);\n value += 2 * cost(v, x) + rec(rec, x, v);\n res = std::min(res, value);\n }\n return dp2[std::pair{ p, v }] = res;\n }};\n long long ans{(long long)9e18};\n for (int s{} ; s < N ; s++) {\n if (leaf[s]) continue;\n ans = std::min(ans, rec2(rec2, s, -1));\n }\n std::cout << ans << '\\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":170,"memory_kb":3996,"score_of_the_acc":-1.1534,"final_rank":19}],"string":"[\n {\n \"submission_id\": \"aoj_1196_10853372\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <vector>\\n#define MAX 810\\n\\nint n, p[MAX], d[MAX], check[MAX];\\nint val, answer=2147483647;\\nstruct data{\\n\\tint go, dis;\\n};\\nstd::vector<data> vec[MAX];\\nint dy[MAX][2];\\n\\nvoid reset(void){\\n\\tint i;\\n\\tanswer=2147483647;\\n\\tfor (i=1;i<=n;i++){\\n\\t\\tvec[i].clear();\\n\\t}\\n}\\n\\nint max(int a, int b){\\n\\treturn (a>b) ? a : b;\\n}\\nint min(int a, int b){\\n\\treturn (a<b) ? a : b;\\n}\\n\\nint dfs(int now, int root){\\n\\tint i, s, ret=0, t, minus=0;\\n\\tdata chd;\\n\\tcheck[now]=1;\\n\\ts=vec[now].size();\\n\\tfor (i=0;i<s;i++){\\n\\t\\tchd=vec[now][i];\\n\\t\\tif (check[chd.go]) continue;\\n\\t\\tt=dfs(chd.go, root);\\n\\t\\tif (t==0) ret+=chd.dis;\\n\\t\\telse{\\n\\t\\t\\tret+=chd.dis*3+t;\\n\\t\\t\\tif (minus<chd.dis+t-min(dy[chd.go][0], dy[chd.go][1])){\\n\\t\\t\\t\\tminus=chd.dis+t-min(dy[chd.go][0], dy[chd.go][1]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tdy[now][1]=ret;\\n\\tfor (i=0;i<s;i++){\\n\\t\\tchd=vec[now][i];\\n\\t\\tif (check[chd.go]) continue;\\n\\t\\tif (ret-minus<dy[now][1] && minus!=100000000) dy[now][1]=ret-minus;\\n\\t}\\n\\tdy[now][0]=ret;\\n\\tcheck[now]=0;\\n\\treturn dy[now][0];\\n}\\n\\nint main(void){\\n\\tint i, r;\\n\\tdata tmp;\\n\\tfor (;;){\\n\\t\\tscanf(\\\"%d\\\", &n);\\n\\t\\tif (n==0) break;\\n\\t\\tfor (i=2;i<=n;i++) scanf(\\\"%d\\\", &p[i]);\\n\\t\\tfor (i=2;i<=n;i++){\\n\\t\\t\\tscanf(\\\"%d\\\", &d[i]);\\n\\t\\t\\ttmp.go=p[i], tmp.dis=d[i];\\n\\t\\t\\tvec[i].push_back(tmp);\\n\\t\\t\\ttmp.go=i;\\n\\t\\t\\tvec[p[i]].push_back(tmp);\\n\\t\\t}\\n\\n\\t\\tfor (r=1;r<=n;r++){\\n\\t\\t\\tval=dfs(r, r);\\n\\t\\t\\tif (min(dy[r][0],dy[r][1])<answer) answer=min(dy[r][0],dy[r][1]);\\n\\t\\t\\tfor (i=1;i<=n;i++){\\n\\t\\t\\t\\tdy[i][0]=dy[i][1]=0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tprintf(\\\"%d\\\\n\\\", answer);\\n\\t\\treset();\\n\\t}\\n\\treturn false;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 260,\n \"memory_kb\": 3104,\n \"score_of_the_acc\": -0.2604,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1196_10630144\",\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 1e9\\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\\nvl dist;\\nvector<vector<pair<ll,ll>>> g;\\n\\nvoid dfs(ll before,ll node){\\n\\trep(i,g[node].size()){\\n\\t\\tif(g[node][i].first==before)continue;\\n\\t\\t//次が葉じゃなければ遷移\\n\\t\\tif(g[g[node][i].first].size()==1)continue;\\n\\t\\tdist[g[node][i].first]=dist[node]+g[node][i].second;\\n\\t\\tdfs(node,g[node][i].first);\\n\\t}\\n}\\n\\nll solve(){\\n\\tll n;\\n\\tcin>>n;\\n\\tif(n==0){return 1;}\\n\\n\\tdist=vl(n,0);\\n\\tg=vector<vector<pair<ll,ll>>>(n);\\n\\t\\n\\tvl p(n);\\n\\tvl d(n);\\n\\n\\tll ans=0;\\n\\n\\tloop(i,1,n-1)cin>>p[i],p[i]--;\\n\\tloop(i,1,n-1)cin>>d[i];\\n\\n\\tloop(i,1,n-1){\\n\\t\\tg[i].push_back({p[i],d[i]});\\n\\t\\tg[p[i]].push_back({i,d[i]});\\n\\t\\tans+=d[i];\\n\\t}\\n\\n\\t//葉以外同士辺を全て2回足す\\n\\trep(i,n){\\n\\t\\tif(g[i].size()==1)continue;\\n\\t\\trep(j,g[i].size()){\\n\\t\\t\\tif(g[g[i][j].first].size()==1)continue;\\n\\t\\t\\tans+=g[i][j].second;\\n\\t\\t}\\n\\t}\\n\\n\\tll mxi;\\n\\trep(i,n){\\n\\t\\tif(g[i].size()==1)continue;\\n\\t\\tdfs(-1,i);\\n\\t\\tmxi=i;\\n\\t\\tbreak;\\n\\t}\\n\\n\\trep(i,n){\\n\\t\\tif(g[i].size()==1)continue;\\n\\t\\tif(dist[i]>dist[mxi])mxi=i;\\n\\t}\\n\\tdist=vl(n);\\n\\tdfs(-1,mxi);\\n\\trep(i,n){\\n\\t\\tif(g[i].size()==1)continue;\\n\\t\\tif(dist[i]>dist[mxi])mxi=i;\\n\\t}\\n\\n\\tans-=dist[mxi];\\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\": 10,\n \"memory_kb\": 3544,\n \"score_of_the_acc\": -0.4867,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1196_10579935\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint diam(vector<vector<pair<int, int>>> G) {\\n int N = G.size();\\n auto D = [&] (int r) -> vector<int> {\\n vector<int> d(N);\\n auto dfs = [&] (auto dfs, int u, int p) -> void {\\n for (auto [v, w] : G[u]) {\\n if (v != p) {\\n d[v] = d[u] + w;\\n dfs(dfs, v, u);\\n }\\n }\\n };\\n dfs(dfs, r, -1);\\n return d;\\n };\\n auto d = D(0);\\n int r = max_element(d.begin(), d.end()) - d.begin();\\n d = D(r);\\n return *max_element(d.begin(), d.end());\\n}\\n\\nbool solve() {\\n int N;\\n cin >> N;\\n if (N == 0) return false;\\n vector<int> P(N), D(N);\\n for (int i = 1; i < N; i++) {\\n cin >> P[i];\\n P[i]--;\\n }\\n for (int i = 1; i < N; i++) cin >> D[i];\\n vector<vector<pair<int, int>>> G(N);\\n long long ans = 0;\\n for (int i = 1; i < N; i++) {\\n G[i].emplace_back(P[i], D[i]);\\n G[P[i]].emplace_back(i, D[i]);\\n ans += 3 * D[i];\\n }\\n vector<int> alive;\\n for (int i = 0; i < N; i++) {\\n if (G[i].size() > 1) alive.push_back(i);\\n }\\n vector<vector<pair<int, int>>> H(N);\\n for (int u = 0; u < N; u++) {\\n for (auto [v, w] : G[u]) {\\n if (u < v) continue;\\n if (G[u].size() > 1 && G[v].size() > 1) {\\n int a = lower_bound(alive.begin(), alive.end(), u) - alive.begin();\\n int b = lower_bound(alive.begin(), alive.end(), v) - alive.begin();\\n H[a].emplace_back(b, w);\\n H[b].emplace_back(a, w);\\n } else {\\n ans -= 2 * w;\\n }\\n }\\n }\\n ans -= diam(H);\\n cout << ans << '\\\\n';\\n return true;\\n}\\n\\nint main() {\\n while (solve()) {}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3840,\n \"score_of_the_acc\": -0.8142,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1196_10571365\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint Diam(vector<vector<pair<int, int>>> G) {\\n int N = G.size();\\n auto BFS = [&] (int r) -> vector<int> {\\n vector<int> D(N, 1 << 30);\\n D[r] = 0;\\n queue<int> q;\\n q.push(r);\\n while (q.size()) {\\n int u = q.front();\\n q.pop();\\n for (auto [v, w] : G[u]) {\\n if (D[v] > D[u] + w) {\\n D[v] = D[u] + w;\\n q.push(v);\\n }\\n }\\n }\\n return D;\\n };\\n auto D = BFS(0);\\n int L = max_element(D.begin(), D.end()) - D.begin();\\n D = BFS(L);\\n return *max_element(D.begin(), D.end());\\n}\\n\\nbool solve() {\\n int N;\\n cin >> N;\\n if (N == 0) return false;\\n vector<int> P(N), D(N);\\n int ans = 0;\\n for (int i = 1; i < N; i++) cin >> P[i], P[i]--;\\n for (int i = 1; i < N; i++) cin >> D[i], ans += 3 * D[i];\\n vector<vector<pair<int, int>>> G(N);\\n for (int i = 1; i < N; i++) {\\n G[i].emplace_back(P[i], D[i]);\\n G[P[i]].emplace_back(i, D[i]);\\n }\\n vector<int> alive;\\n for (int i = 0; i < N; i++) {\\n if (G[i].size() >= 2) alive.push_back(i);\\n }\\n vector<int> id(N, -1);\\n for (int i = 0; i < N; i++) {\\n if (G[i].size() >= 2) {\\n id[i] = lower_bound(alive.begin(), alive.end(), i) - alive.begin();\\n }\\n }\\n int M = alive.size();\\n vector<vector<pair<int, int>>> H(M);\\n for (int u = 0; u < N; u++) {\\n for (auto [v, d] : G[u]) {\\n if (u > v) continue;\\n if (G[u].size() >= 2 && G[v].size() >= 2) {\\n H[id[u]].emplace_back(id[v], d);\\n H[id[v]].emplace_back(id[u], d);\\n } else {\\n ans -= 2 * d;\\n }\\n }\\n }\\n cout << ans - Diam(H) << '\\\\n';\\n return true;\\n}\\n\\nint main() {\\n while (solve()) {}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3840,\n \"score_of_the_acc\": -0.8142,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1196_10554767\",\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)-1;i>=0;i--)\\n#define RREP2(i, n) for(ll i=(n)-1;i>=0;i--)\\n#define RREP3(i, a, n) for(ll i=(n)-1;i>=(a);i--)\\n#define RREP4(i, a, b, n) for(ll i=(n)-1;i>=(a);i-=(b))\\n#define rrep(...) OVERLOAD_RREP(__VA_ARGS__, RREP4, RREP3, RREP2, RREP1)(__VA_ARGS__)\\n#define uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))\\n#define len(n) (long long)(n).size()\\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>;\\nusing vvpll = vector<vpll>;\\n\\nll intpow(ll a,ll b){\\n ll ans = 1;\\n while (b){\\n if (b & 1){\\n ans *= a;\\n }\\n a *= a;\\n b /= 2;\\n }\\n return ans;\\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\\ntemplate<class... T>\\nvoid input(T&... a){\\n (cin >> ... >> a);\\n}\\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\\\";}\\n\\ntemplate <typename T1, typename T2>\\nstd::ostream& operator<<(std::ostream& os, const std::pair<T1, T2>& p) {\\n os << \\\"(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n return os;\\n}\\n\\ntemplate <typename T>\\nstd::ostream& operator<<(std::ostream& os, const std::vector<T>& vec) {\\n os << \\\"[\\\";\\n for (size_t i = 0; i < vec.size(); ++i) {\\n os << vec[i];\\n if (i + 1 < vec.size()) os << \\\", \\\";\\n }\\n os << \\\"]\\\";\\n return os;\\n}\\n\\ntemplate <typename T1, typename T2>\\nstd::ostream& operator<<(std::ostream& os, const std::vector<std::pair<T1, T2>>& a) {\\n os << \\\"[\\\";\\n for (size_t j = 0; j < a.size(); ++j) {\\n os << \\\"(\\\" << a[j].first << \\\", \\\" << a[j].second << \\\")\\\";\\n\\t\\tif (j + 1 < a.size()) os << \\\", \\\";\\n }\\n\\tos << \\\"]\\\";\\n return os;\\n}\\n\\ntemplate <typename T1, typename T2>\\nstd::ostream& operator<<(std::ostream& os, const std::vector<std::vector<std::pair<T1, T2>>>& mat) {\\n\\tos << \\\"[\\\";\\n for (size_t i = 0; i < mat.size(); ++i) {\\n\\t\\tos << \\\"[\\\";\\n for (size_t j = 0; j < mat[i].size(); ++j) {\\n os << \\\"(\\\" << mat[i][j].first << \\\", \\\" << mat[i][j].second << \\\")\\\";\\n\\t\\t\\tif (j + 1 < mat[i].size()) os << \\\", \\\";\\n }\\n\\t\\tos << \\\"]\\\";\\n\\t\\tif (i + 1 < mat.size()) os << \\\", \\\";\\n }\\n\\tos << \\\"]\\\";\\n return os;\\n}\\n\\ntemplate <typename T>\\nstd::ostream& operator<<(std::ostream& os, const std::set<T>& s) {\\n os << \\\"{\\\";\\n bool first = true;\\n for (const auto& x : s) {\\n if (!first) os << \\\", \\\";\\n os << x;\\n first = false;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n\\ntemplate <typename K, typename V>\\nstd::ostream& operator<<(std::ostream& os, const std::map<K, V>& m) {\\n os << \\\"{\\\";\\n bool first = true;\\n for (const auto& [key, val] : m) {\\n if (!first) os << \\\", \\\";\\n os << key << \\\": \\\" << val;\\n first = false;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n\\ntemplate<class T, class... Ts>\\nvoid print(const T& a, const Ts&... b){cout << a;(cout << ... << (cout << ' ', b));cout << '\\\\n';}\\n\\nvoid write(){cout << \\\"\\\\n\\\";}\\ntemplate<class T, class... Ts>\\nvoid write(const T& a, const Ts&... b){cout << a;(cout << ... << (cout << ' ', b));cout << '\\\\n';}\\nvoid write(vll x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << \\\" \\\";}else{cout << '\\\\n';}}}\\nvoid write(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';}}}\\nvoid write(vi x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << \\\" \\\";}else{cout << '\\\\n';}}}\\nvoid write(vvi x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j];if(j!=len(x[i])-1){cout << \\\" \\\";}else{cout << '\\\\n';}}}\\nvoid write(vvvi x){rep(i,len(x))rep(j,len(x[i]))rep(k,len(x[i][j])){cout << x[i][j][k];if(k!=len(x[i][j])-1){cout << \\\" \\\";}else if(j!=len(x[i])-1){cout << \\\" | \\\";}else{cout << '\\\\n';}}}\\nvoid write(vld x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << \\\" \\\";}else{cout << '\\\\n';}}}\\nvoid write(vvld x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j];if(j!=len(x[i])-1){cout << \\\" \\\";}else{cout << '\\\\n';}}}\\nvoid write(vvvld x){rep(i,len(x))rep(j,len(x[i]))rep(k,len(x[i][j])){cout << x[i][j][k];if(k!=len(x[i][j])-1){cout << \\\" \\\";}else if(j!=len(x[i])-1){cout << \\\" | \\\";}else{cout << '\\\\n';}}}\\nvoid write(vc x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << \\\" \\\";}else{cout << '\\\\n';}}}\\nvoid write(vvc x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j];if(j!=len(x[i])-1){cout << \\\" \\\";}else{cout << '\\\\n';}}}\\nvoid write(vvvc x){rep(i,len(x))rep(j,len(x[i]))rep(k,len(x[i][j])){cout << x[i][j][k];if(k!=len(x[i][j])-1){cout << \\\" \\\";}else if(j!=len(x[i])-1){cout << \\\" | \\\";}else{cout << '\\\\n';}}}\\nvoid write(vs x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << \\\" \\\";}else{cout << '\\\\n';}}}\\nvoid write(vvs x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j];if(j!=len(x[i])-1){cout << \\\" \\\";}else{cout << '\\\\n';}}}\\nvoid write(vvvs x){rep(i,len(x))rep(j,len(x[i]))rep(k,len(x[i][j])){cout << x[i][j][k];if(k!=len(x[i][j])-1){cout << \\\" \\\";}else if(j!=len(x[i])-1){cout << \\\" | \\\";}else{cout << '\\\\n';}}}\\nvoid write(pll x){cout << x.first << ' ' << x.second << '\\\\n';}\\nvoid write(vpll x){rep(i,len(x)){cout << x[i].first << ' ' << x[i].second << '\\\\n';}}\\nvoid write(vvpll x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j].first << ' ' << x[i][j].second;if(j!=len(x[i])-1){cout << \\\" \\\";}else{cout << '\\\\n';}}}\\n\\ntemplate <typename T>\\nT sum(const std::vector<T>& v) {\\n return std::accumulate(v.begin(), v.end(), T(0));\\n}\\n\\ntemplate<class T> bool chmin(T& a, const T& b){ if(a > b){ a = b; return 1; } return 0; }\\ntemplate<class T> bool chmax(T& a, const T& b){ if(a < b){ a = b; return 1; } return 0; }\\ntemplate<class T, class U> bool chmin(T& a, const U& b){ if(a > T(b)){ a = b; return 1; } return 0; }\\ntemplate<class T, class U> bool chmax(T& a, const U& b){ if(a < T(b)){ a = b; return 1; } return 0; }\\n\\nlong long mod_mul(long long a, long long b, long long mod) {\\n return (__int128)a * b % mod;\\n}\\n\\nlong long mod_pow(long long a, long long b, long long mod) {\\n long long result = 1;\\n a %= mod;\\n while (b > 0) {\\n if (b & 1) result = mod_mul(result, a, mod);\\n a = mod_mul(a, a, mod);\\n b >>= 1;\\n }\\n return result;\\n}\\n\\nbool MillerRabin(ll x){\\n \\n if(x <= 1){return false;}\\n if(x == 2){return true;}\\n if((x & 1) == 0){return false;}\\n vll test;\\n if(x < (1 << 30)){\\n test = {2, 7, 61};\\n } \\n else{\\n test = {2, 325, 9375, 28178, 450775, 9780504, 1795265022};\\n }\\n ll s = 0;\\n ll d = x - 1;\\n while((d & 1) == 0){\\n s++;\\n d >>= 1;\\n }\\n for(ll i:test){\\n if(x <= i){return true;}\\n ll y = mod_pow(i,d,x);\\n if(y == 1 || y == x - 1){continue;}\\n ll c = 0;\\n for(int j=0;j<s-1;j++){\\n y = mod_mul(y,y,x);\\n if(y == x - 1){\\n c = 1;\\n break;\\n }\\n }\\n if(c == 0){\\n return false;\\n }\\n }\\n return true;\\n}\\n\\n#include<atcoder/dsu>\\nvpll rle(vll seq){\\n vpll res;\\n for(auto x:seq){\\n if(res.empty() || res.back().first != x){\\n res.emplace_back(x,1);\\n }\\n else{\\n res.back().second++;\\n }\\n }\\n return res;\\n}\\nint main(){\\n\\tios::sync_with_stdio(false);\\n\\tstd::cin.tie(nullptr);\\n \\n while(1){\\n LL(n);\\n if(n == 0){break;}\\n VLL(p,n-1);\\n VLL(d,n-1);\\n vvpll edge(n);\\n vll deg(n,0);\\n rep(i,n-1){\\n edge[i+1].emplace_back(p[i]-1,d[i]);\\n edge[p[i]-1].emplace_back(i+1,d[i]);\\n deg[i+1]++;\\n deg[p[i]-1]++;\\n //print(i+1,p[i]-1,d[i]);\\n }\\n ll ans = 1LL<<60;\\n vll dp1(n,1LL<<60);\\n vll dp2(n,1LL<<60);\\n auto dfs = [&](auto dfs, ll now, ll pa) -> void{\\n dp1[now] = 0;\\n vll a;\\n vll b;\\n for(auto [to,cost]:edge[now]){\\n if(to == pa){\\n continue;\\n }\\n if(deg[to] == 1){\\n dp1[to] = 0;\\n dp2[to] = 0;\\n a.push_back(dp1[to]);\\n b.push_back(dp2[to]);\\n continue;\\n }\\n dfs(dfs,to,now);\\n a.push_back(dp1[to] + 2 * cost);\\n b.push_back(dp2[to] + 1 * cost);\\n dp1[now] += dp1[to] + 2 * cost;\\n }\\n ll c = 1LL<<60;;\\n rep(i,len(a)){\\n chmin(c,-a[i]+b[i]);\\n }\\n dp2[now] = sum(a) + c;\\n return;\\n ll x = 0;\\n rep(i,len(a)){\\n ll temp = 0;\\n rep(j,len(a)){\\n temp += (i == j? b[j]:a[j]);\\n }\\n chmin(dp2[now],temp);\\n }\\n \\n };\\n\\n rep(i,n){\\n rep(j,n){\\n dp1[j] = 1LL<<60;\\n dp2[j] = 1LL<<60;\\n \\n }\\n dfs(dfs,i,-1);\\n chmin(ans,dp2[i]);\\n //print(i,dp2[i] + sum(d),dp1,dp2);\\n }\\n print(ans + sum(d));\\n //print(edge);\\n }\\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 970,\n \"memory_kb\": 3840,\n \"score_of_the_acc\": -1.8142,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1196_10449339\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\nusing ll = long long;\\nusing edge = pair<int, int>; // {to, cost}\\n\\nconstexpr int INF = 1e9;\\nconstexpr bool DEBUG = false;\\n\\nvector<int> bfs(const int& n, const int& start_vertex, const vector<vector<edge>>& graph) {\\n vector<int> dist(n, INF);\\n queue<int> q;\\n dist[start_vertex] = 0;\\n q.push(start_vertex);\\n\\n while (!q.empty()) {\\n const int from = q.front();\\n q.pop();\\n for (auto& [to, cost] : graph[from]) {\\n if (dist[to] == INF) {\\n dist[to] = dist[from] + cost;\\n q.push(to);\\n }\\n }\\n }\\n\\n return dist;\\n}\\n\\nint solve(const int& n, const vector<int>& p, const vector<int>& d) {\\n // グラフの作成\\n int rm_cost = 0;\\n vector<int> deg(n, 0);\\n vector<vector<edge>> graph(n);\\n for (int i = 0; i < n - 1; i++) {\\n int u = i + 1;\\n int v = p[i];\\n int w = d[i];\\n graph[u].emplace_back(v, w);\\n graph[v].emplace_back(u, w);\\n deg[u]++;\\n deg[v]++;\\n rm_cost += w;\\n }\\n\\n // 葉を除いたグラフ作成\\n int g_cost = 0;\\n vector<vector<edge>> g(n);\\n for (int i = 0; i < n - 1; i++) {\\n int u = i + 1;\\n int v = p[i];\\n int w = d[i];\\n if (deg[u] > 1 && deg[v] > 1) {\\n g[u].emplace_back(v, w);\\n g[v].emplace_back(u, w);\\n g_cost += w;\\n }\\n }\\n\\n // 木の直径を求める\\n int start_v = -1;\\n for (int i = 0; i < n; i++) {\\n if (deg[i] > 1) {\\n start_v = i;\\n }\\n }\\n const auto dist1 = bfs(n, start_v, g);\\n\\n int far_v = start_v;\\n for (int i = 0; i < n; i++) {\\n if (dist1[i] != INF && dist1[i] > dist1[far_v]) {\\n far_v = i;\\n }\\n }\\n const auto dist2 = bfs(n, far_v, g);\\n\\n int D = 0;\\n for (int i = 0; i < n; i++) {\\n if (dist2[i] != INF && dist2[i] > D) {\\n D = dist2[i];\\n }\\n }\\n\\n // 答えを求める: 橋を取り除くコスト + 移動コスト(葉を除いたグラフの辺の総和*2 - 直径)\\n const int mv_cost = g_cost * 2 - D;\\n const int ret = rm_cost + mv_cost;\\n if (DEBUG) {\\n printf(\\\"%d+%d(2*%d-%d)=%d\\\\n\\\", rm_cost, mv_cost, g_cost, D, ret);\\n }\\n return ret;\\n}\\n\\nint main() {\\n while (true) {\\n int n;\\n cin >> n;\\n if (n == 0) {\\n break;\\n }\\n\\n vector<int> p(n - 1);\\n vector<int> d(n - 1);\\n for (auto& pi : p) {\\n cin >> pi;\\n pi--;\\n }\\n for (auto& di : d) {\\n cin >> di;\\n }\\n cout << solve(n, p, d) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3584,\n \"score_of_the_acc\": -0.531,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1196_10449328\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\nusing ll = long long;\\nusing edge = pair<int, int>; // {to, cost}\\n\\nconstexpr int INF = 1e9;\\nconstexpr bool DEBUG = false;\\n\\nvector<int> bfs(const int& n, const int& start_vertex, const vector<vector<edge>>& graph) {\\n vector<int> dist(n, INF);\\n queue<int> q;\\n dist[start_vertex] = 0;\\n q.push(start_vertex);\\n\\n while (!q.empty()) {\\n const int from = q.front();\\n q.pop();\\n for (auto& [to, cost] : graph[from]) {\\n if (dist[to] == INF) {\\n dist[to] = dist[from] + cost;\\n q.push(to);\\n }\\n }\\n }\\n\\n return dist;\\n}\\n\\nint solve(const int& n, const vector<int>& p, const vector<int>& d) {\\n // グラフの作成\\n int rm_cost = 0;\\n vector<int> deg(n, 0);\\n vector<vector<edge>> graph(n);\\n for (int i = 0; i < n - 1; i++) {\\n int u = i + 1;\\n int v = p[i];\\n int w = d[i];\\n graph[u].emplace_back(v, w);\\n graph[v].emplace_back(u, w);\\n deg[u]++;\\n deg[v]++;\\n rm_cost += w;\\n }\\n\\n // 木の直径を求める(葉は考慮しない)\\n int g_cost = 0;\\n vector<vector<edge>> g(n);\\n for (int i = 0; i < n - 1; i++) {\\n int u = i + 1;\\n int v = p[i];\\n int w = d[i];\\n if (deg[u] > 1 && deg[v] > 1) {\\n g[u].emplace_back(v, w);\\n g[v].emplace_back(u, w);\\n g_cost += w;\\n }\\n }\\n\\n int start_v = -1;\\n for (int i = 0; i < n; i++) {\\n if (deg[i] > 1) {\\n start_v = i;\\n }\\n }\\n const auto dist1 = bfs(n, start_v, g);\\n\\n int far_v = start_v;\\n for (int i = 0; i < n; i++) {\\n if (dist1[i] != INF && dist1[i] > dist1[far_v]) {\\n far_v = i;\\n }\\n }\\n const auto dist2 = bfs(n, far_v, g);\\n\\n int D = 0;\\n for (int i = 0; i < n; i++) {\\n if (dist2[i] != INF && dist2[i] > D) {\\n D = dist2[i];\\n }\\n }\\n\\n // 答えを求める: 橋を取り除くコスト + 移動コスト(葉を除いたグラフのコストの総和*2 - 直径)\\n const int mv_cost = g_cost * 2 - D;\\n const int ret = rm_cost + mv_cost;\\n if (DEBUG) {\\n printf(\\\"%d+%d(2*%d-%d)=%d\\\\n\\\", rm_cost, mv_cost, g_cost, D, ret);\\n }\\n return ret;\\n}\\n\\nint main() {\\n while (true) {\\n int n;\\n cin >> n;\\n if (n == 0) {\\n break;\\n }\\n\\n vector<int> p(n - 1);\\n vector<int> d(n - 1);\\n for (auto& pi : p) {\\n cin >> pi;\\n pi--;\\n }\\n for (auto& di : d) {\\n cin >> di;\\n }\\n cout << solve(n, p, d) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3712,\n \"score_of_the_acc\": -0.6726,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1196_10449325\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\nusing ll = long long;\\nusing edge = pair<int, int>; // {to, cost}\\n\\nconstexpr int INF = 1e9;\\n\\nvector<int> bfs(const int& n, const int& start_vertex, const vector<vector<edge>>& graph) {\\n vector<int> dist(n, INF);\\n queue<int> q;\\n dist[start_vertex] = 0;\\n q.push(start_vertex);\\n\\n while (!q.empty()) {\\n const int from = q.front();\\n q.pop();\\n for (auto& [to, cost] : graph[from]) {\\n if (dist[to] == INF) {\\n dist[to] = dist[from] + cost;\\n q.push(to);\\n }\\n }\\n }\\n\\n return dist;\\n}\\n\\nint solve(const int& n, const vector<int>& p, const vector<int>& d) {\\n // グラフの作成\\n int rm_cost = 0;\\n vector<int> deg(n, 0);\\n vector<vector<edge>> graph(n);\\n for (int i = 0; i < n - 1; i++) {\\n int u = i + 1;\\n int v = p[i];\\n int w = d[i];\\n graph[u].emplace_back(v, w);\\n graph[v].emplace_back(u, w);\\n deg[u]++;\\n deg[v]++;\\n rm_cost += w;\\n }\\n\\n // 木の直径を求める(葉は考慮しない)\\n int g_cost = 0;\\n vector<vector<edge>> g(n);\\n for (int i = 0; i < n - 1; i++) {\\n int u = i + 1;\\n int v = p[i];\\n int w = d[i];\\n if (deg[u] > 1 && deg[v] > 1) {\\n g[u].emplace_back(v, w);\\n g[v].emplace_back(u, w);\\n g_cost += w;\\n }\\n }\\n\\n\\n int start_v = -1;\\n for (int i = 0; i < n; i++) {\\n if (deg[i] > 1) {\\n start_v = i;\\n }\\n }\\n const auto dist1 = bfs(n, start_v, g);\\n\\n int far_v = start_v;\\n for (int i = 0; i < n; i++) {\\n if (dist1[i] != INF && dist1[i] > dist1[far_v]) {\\n far_v = i;\\n }\\n }\\n const auto dist2 = bfs(n, far_v, g);\\n\\n int D = 0;\\n for (int i = 0; i < n; i++) {\\n if (dist2[i] != INF && dist2[i] > D) {\\n D = dist2[i];\\n }\\n }\\n\\n // 答えを求める: 橋を取り除くコスト + 移動コスト(葉を除いたグラフのコストの総和*2 - 直径)\\n const int mv_cost = g_cost * 2 - D;\\n const int ret = rm_cost + mv_cost;\\n // printf(\\\"%d+%d(2*%d-%d)=%d\\\\n\\\", rm_cost, mv_cost, g_cost, D, ret);\\n return ret;\\n}\\n\\nint main() {\\n while (true) {\\n int n;\\n cin >> n;\\n if (n == 0) {\\n break;\\n }\\n\\n vector<int> p(n - 1);\\n vector<int> d(n - 1);\\n for (auto& pi : p) {\\n cin >> pi;\\n pi--;\\n }\\n for (auto& di : d) {\\n cin >> di;\\n }\\n cout << solve(n, p, d) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3712,\n \"score_of_the_acc\": -0.6726,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1196_10449321\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\nusing ll = long long;\\nusing edge = pair<int, int>; // {to, cost}\\n\\nconstexpr int INF = 1e9;\\n\\nvector<int> bfs(const int& n, const int& start_vertex, const vector<vector<edge>>& graph) {\\n vector<int> dist(n, INF);\\n queue<int> q;\\n dist[start_vertex] = 0;\\n q.push(start_vertex);\\n\\n while (!q.empty()) {\\n const int from = q.front();\\n q.pop();\\n for (auto& [to, cost] : graph[from]) {\\n if (dist[to] == INF) {\\n dist[to] = dist[from] + cost;\\n q.push(to);\\n }\\n }\\n }\\n\\n return dist;\\n}\\n\\nint solve(const int& n, const vector<int>& p, const vector<int>& d) {\\n // グラフの作成\\n vector<int> deg(n, 0);\\n vector<vector<edge>> graph(n);\\n for (int i = 1; i < n; i++) {\\n graph[i].emplace_back(p[i - 1], d[i - 1]);\\n graph[p[i - 1]].emplace_back(i, d[i - 1]);\\n deg[i]++;\\n deg[p[i - 1]]++;\\n }\\n\\n // 木の直径を求める(葉は考慮しない)\\n vector<vector<edge>> g(n);\\n for (int i = 0; i < n - 1; i++) {\\n int u = i + 1;\\n int v = p[i];\\n int w = d[i];\\n if (deg[u] > 1 && deg[v] > 1) {\\n g[u].emplace_back(v, w);\\n g[v].emplace_back(u, w);\\n }\\n }\\n\\n\\n int start_v = -1;\\n for (int i = 0; i < n; i++) {\\n if (deg[i] > 1) {\\n start_v = i;\\n }\\n }\\n const auto dist1 = bfs(n, start_v, g);\\n\\n int far_v = start_v;\\n for (int i = 0; i < n; i++) {\\n if (dist1[i] != INF && dist1[i] > dist1[far_v]) {\\n far_v = i;\\n }\\n }\\n const auto dist2 = bfs(n, far_v, g);\\n\\n int D = 0;\\n for (int i = 0; i < n; i++) {\\n if (dist2[i] != INF && dist2[i] > D) {\\n D = dist2[i];\\n }\\n }\\n\\n // 答えを求める: 橋を取り除くコスト + 移動コスト(葉を除いたグラフのコストの総和*2 - 直径)\\n int rm_cost = 0;\\n for (auto& di : d) {\\n rm_cost += di;\\n }\\n\\n int g_cost = 0;\\n for (int i = 0; i < n - 1; i++) {\\n const int u = i + 1;\\n const int v = p[i];\\n if (deg[u] > 1 && deg[v] > 1) {\\n g_cost += d[i];\\n }\\n }\\n\\n const int mv_cost = g_cost * 2 - D;\\n const int ret = rm_cost + mv_cost;\\n // printf(\\\"%d+%d(2*%d-%d)=%d\\\\n\\\", rm_cost, mv_cost, g_cost, D, ret);\\n return ret;\\n}\\n\\nint main() {\\n while (true) {\\n int n;\\n cin >> n;\\n if (n == 0) {\\n break;\\n }\\n\\n vector<int> p(n - 1);\\n vector<int> d(n - 1);\\n for (auto& pi : p) {\\n cin >> pi;\\n pi--;\\n }\\n for (auto& di : d) {\\n cin >> di;\\n }\\n cout << solve(n, p, d) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3712,\n \"score_of_the_acc\": -0.6726,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1196_9757618\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n using namespace std;\\n \\n template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\n template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n #define rep(i,n) for (int i = 0; i < (n); ++i)\\n\\n typedef long long ll;\\n typedef unsigned long long ull;\\n using P=pair<int,int>;\\n using T=tuple<ll,ll,ll>;\\n const int INF=1001001001;\\n const ll INFL=1e18;\\n const int mod=998244353;\\n\\t\\n\\tvoid dfs(int v,int pre,vector<int>& mx,vector<vector<P>>& G){\\n\\t\\tfor(auto[u,w]:G[v]){\\n\\t\\t\\tif(u==pre)continue;\\n\\t\\t\\tdfs(u,v,mx,G);\\n\\t\\t\\tchmax(mx[v],mx[u]+w);\\n\\t\\t}\\n\\t}\\n\\n bool solve(){\\n\\t\\tint n;\\n\\t\\tcin>>n;\\n\\t\\tif(!n)return false;\\n\\t\\tvector<int>a(n),b(n),deg(n);\\n\\t\\trep(i,n-1){\\n\\t\\t\\tcin>>a[i];\\n\\t\\t\\ta[i]--;\\n\\t\\t\\tdeg[a[i]]++;deg[i+1]++;\\n\\t\\t}\\n\\t\\trep(i,n-1){cin>>b[i];}\\n\\t\\t\\n\\t\\tvector<vector<P>>G(n);\\n\\t\\tint tot=0;\\n\\t\\trep(i,n-1){\\n\\t\\t\\tif(deg[a[i]]>1&°[i+1]>1){\\n\\t\\t\\t\\ttot+=b[i]*3;\\n\\t\\t\\t\\tG[i+1].push_back({a[i],b[i]});\\n\\t\\t\\t\\tG[a[i]].push_back({i+1,b[i]});\\n\\t\\t\\t}else{\\n\\t\\t\\t\\ttot+=b[i];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tint ans=INF;\\n\\t\\trep(i,n){\\n\\t\\t\\tvector<int>mx(n);\\n\\t\\t\\tdfs(i,-1,mx,G);\\n\\t\\t\\tchmin(ans,tot-mx[i]);\\n\\t\\t}\\n\\t\\tcout<<ans<<endl;\\n\\t\\t\\n\\t\\treturn true;\\n }\\n\\n int main(){\\n ios_base::sync_with_stdio(false);\\n cin.tie(NULL);\\n\\n\\t\\twhile(1){\\n\\t\\t\\tif(!solve()){break;}\\n\\t\\t}\\n\\t\\t\\n return 0;\\n }\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3584,\n \"score_of_the_acc\": -0.6039,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1196_9531684\",\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 Diam(int N, int S, vector<vector<pair<int,int>>>& G) {\\n vector<int> DP(N,inf);\\n queue<int> Q;\\n DP[S] = 0;\\n Q.push(S);\\n while(!Q.empty()) {\\n int P = Q.front();\\n Q.pop();\\n for (pair<int,int> E : G[P]) {\\n if (DP[E.first] == inf) {\\n DP[E.first] = DP[P] + E.second;\\n Q.push(E.first);\\n }\\n }\\n }\\n int NS = -1, MAX = -1;\\n rep(i,0,N) {\\n if (DP[i] == inf) continue;\\n if (DP[i] > MAX) {\\n MAX = DP[i], NS = i;\\n }\\n }\\n DP.assign(N,inf);\\n DP[NS] = 0;\\n Q.push(NS);\\n while(!Q.empty()) {\\n int P = Q.front();\\n Q.pop();\\n for (pair<int,int> E : G[P]) {\\n if (DP[E.first] == inf) {\\n DP[E.first] = DP[P] + E.second;\\n Q.push(E.first);\\n }\\n }\\n }\\n int Ret = -1;\\n rep(i,0,N) {\\n if (DP[i] == inf) continue;\\n chmax(Ret, DP[i]);\\n }\\n return Ret;\\n}\\n\\nint main() {\\nwhile(1) {\\n int N;\\n cin >> N;\\n if (N == 0) return 0;\\n vector<int> P(N,-1), D(N,0);\\n vector<vector<pair<int,int>>> G(N);\\n rep(i,1,N) cin >> P[i], P[i]--;\\n rep(i,1,N) cin >> D[i];\\n int ANS = 0;\\n rep(i,1,N) {\\n G[P[i]].push_back({i,D[i]});\\n G[i].push_back({P[i],D[i]});\\n ANS += D[i] * 3;\\n }\\n vector<int> S(N);\\n rep(i,0,N) S[i] = G[i].size();\\n rep(i,0,N) {\\n if (S[i] == 1) {\\n ANS -= G[i][0].second * 2;\\n }\\n }\\n vector<vector<pair<int,int>>> NG(N);\\n rep(i,0,N) {\\n if (S[i] == 1) continue;\\n for (pair<int,int> P : G[i]) {\\n if (S[P.first] == 1) continue;\\n NG[i].push_back(P);\\n }\\n }\\n rep(i,0,N) {\\n if (!NG[i].empty()) {\\n ANS -= Diam(N,i,NG);\\n break;\\n }\\n }\\n cout << ANS << endl;\\n}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3620,\n \"score_of_the_acc\": -0.5708,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1196_9447328\",\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// verify 木DP https://atcoder.jp/contests/dp/submissions/55190036\\n// verify 全方位木DP(直径) https://onlinejudge.u-aizu.ac.jp/status/users/shkii/submissions/1/GRL_5_A/judge/9411502/C++17\\n// verify 全方位木DP https://atcoder.jp/contests/arc179/submissions/55189994\\ntuple<vector<int>,vector<int>,vector<int>> tree_dfs(vector<vector<int>> &v,int root = 0){\\n int n = v.size();\\n vector<int> par(n,-1); // par[i] := rootを根とした頂点iの親\\n vector<int> par_idx(n,-1); // par_idx[ov] := v[ov]の中でpar[ov]がいるidx\\n vector<int> order(n,-1); // order[i] := dfs帰りがけ順i番目の頂点。この昇順に木DP そのあと降順に全方位木DP\\n int cnt = 0;\\n auto dfs = [&](auto &dfs,int ov,int pre)->void{\\n par[ov] = pre;\\n for(int i = 0;i < v[ov].size();i++){\\n int nv = v[ov][i];\\n if(nv == pre){\\n par_idx[ov] = i;\\n continue;\\n }\\n dfs(dfs,nv,ov);\\n }\\n order[cnt++] = ov;\\n };\\n dfs(dfs,root,-1);\\n return {par,par_idx,order};\\n};\\n\\n\\nint main(){\\n \\n ios_base::sync_with_stdio(0), cin.tie(0);\\n while(1){\\n int n;cin >> n;\\n if(!n)break;\\n vi p(n-1),d(n-1);\\n cin >> p >> d;\\n vi cnt(n);\\n ll res = 0;\\n rep(i,n-1){\\n p[i]--;\\n cnt[p[i]]++;cnt[i+1]++;\\n res += d[i];\\n }\\n ve v(n);\\n vvi w(n);\\n int root = 0;\\n rep(i,n-1){\\n if(cnt[i+1] != 1 && cnt[p[i]] != 1){\\n v[i+1].emplace_back(p[i]);\\n v[p[i]].emplace_back(i+1);\\n w[i+1].emplace_back(d[i]);\\n w[p[i]].emplace_back(d[i]);\\n res += 2*d[i];\\n }\\n }\\n rep(i,n)if(cnt[i] != 1)root = i;\\n vvi dp(n);\\n auto [par,p_idx,ord] = tree_dfs(v,root);\\n auto f = [](ll a,ll c,ll w){return max(a,c+w);};\\n auto g = [](ll a,ll b){return max(a,b);};\\n rep(_,n){\\n int ov = ord[_];\\n if(ov == -1)break;\\n int deg = sz(v[ov]);\\n dp[ov].resize(deg+1);\\n rep(i,deg){\\n int nv = v[ov][i];\\n if(nv == par[ov])continue;\\n dp[ov][i] = dp[nv][sz(v[nv])];\\n dp[ov][deg] = f(dp[ov][deg],dp[ov][i],w[ov][i]);\\n }\\n }\\n vi ans(n,-1);\\n for(int _ = n-1;_ >= 0;_--){\\n int ov = ord[_];\\n if(ov == -1)continue;\\n int deg = sz(v[ov]);\\n vi L(deg+1),R(deg+1);\\n rep(i,deg)L[i+1] = f(L[i],dp[ov][i],w[ov][i]);\\n for(int i = deg-1;i >= 0;i--)R[i] = f(R[i+1],dp[ov][i],w[ov][i]);\\n ans[ov] = L[deg];\\n rep(i,deg){\\n int nv = v[ov][i];\\n if(nv == par[ov])continue;\\n dp[nv][p_idx[nv]] = g(L[i],R[i+1]);\\n }\\n }\\n res = res-*max_element(ALL(ans));\\n cout << res << \\\"\\\\n\\\";\\n }\\n \\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3556,\n \"score_of_the_acc\": -0.5,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1196_9417088\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nstruct Edge{\\n int idx, val;\\n Edge(int idx, int val) : idx(idx), val(val) {}\\n};\\n\\nconstexpr long long INF = 1e18;\\n\\nint main() {\\n while(true) {\\n int N;\\n cin >> N;\\n if(N == 0) return 0;\\n vector<vector<pair<int, Edge>>> G(N);\\n vector<int> P(N), D(N);\\n long long edge_sum = 0;\\n for(int i = 1; i < N; i++) {\\n cin >> P[i];\\n P[i]--;\\n }\\n for(int i = 1; i < N; i++) {\\n cin >> D[i];\\n edge_sum += D[i];\\n G[i].push_back({P[i], Edge(i, D[i])});\\n G[P[i]].push_back({i, Edge(i, D[i])});\\n }\\n\\n long long delete_sum = 0;\\n set<int> delete_edge;\\n for(int i = 0; i < N; i++) {\\n if(G[i].size() != 1) continue;\\n delete_edge.insert(G[i][0].second.idx);\\n delete_sum += G[i][0].second.val;\\n }\\n \\n int s = 0;\\n while(G[s].size() == 1) s++;\\n\\n vector<long long> dist(N, INF);\\n dist[s] = 0;\\n priority_queue<pair<long long, int>> pq;\\n pq.push({0, s});\\n while(pq.size()) {\\n auto [d, v] = pq.top(); pq.pop();\\n for(auto [nv, e] : G[v]) {\\n if(delete_edge.count(e.idx)) continue;\\n if(dist[nv] <= dist[v] + e.val) continue;\\n dist[nv] = dist[v] + e.val;\\n pq.push({-dist[nv], nv});\\n }\\n }\\n\\n long long ma = 0;\\n for(int i = 0; i < N; i++) {\\n if(dist[i] == INF) continue;\\n if(ma < dist[i]) {\\n ma = dist[i];\\n s = i;\\n }\\n }\\n\\n dist = vector<long long>(N, INF);\\n dist[s] = 0;\\n pq.push({0, s});\\n while(pq.size()) {\\n auto [d, v] = pq.top(); pq.pop();\\n for(auto [nv, e] : G[v]) {\\n if(delete_edge.count(e.idx)) continue;\\n if(dist[nv] <= dist[v] + e.val) continue;\\n dist[nv] = dist[v] + e.val;\\n pq.push({-dist[nv], nv});\\n }\\n }\\n\\n ma = 0;\\n for(int i = 0; i < N; i++) {\\n if(dist[i] == INF) continue;\\n if(ma < dist[i]) {\\n ma = dist[i];\\n s = i;\\n }\\n }\\n\\n long long ans = edge_sum + (edge_sum - delete_sum) * 2 - ma;\\n cout << ans << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3488,\n \"score_of_the_acc\": -0.4352,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1196_9343042\",\n \"code_snippet\": \"// #pragma GCC target(\\\"avx2\\\")\\n// #pragma GCC optimize(\\\"O3\\\")\\n// #pragma GCC optimize(\\\"unroll-loops\\\")\\n#include<bits/stdc++.h>\\n#ifdef DEBUG\\n#include \\\"cpp-dump/dump.hpp\\\"\\n#define dump(...) cpp_dump(__VA_ARGS__)\\n#else\\n#define dump(...)\\n#endif\\nusing namespace std;\\n#define rep(i,n) for (long long i=0;i<n;i++)\\n#define loop(i,m,n) for(long long i=m;i<=n;i++)\\n#define range(value,range) for(const auto &value : range)\\n#define ll long long\\n#define vl vector<long long>\\n#define vvl vector<vector<long long>>\\n#define vdbg(a) rep(ii,a.size()){cout<<a[ii]<<\\\" \\\";}cout<<endl;\\n#define vvdbg(a) rep(ii,a.size()){rep(jj,a[ii].size()){cout<<a[ii][jj]<<\\\" \\\";}cout<<endl;}\\n#define inf 4000000000000000000LL\\n#define mod 998244353\\nconst int lim = INT16_MAX;\\nmap<pair<int, int>,ll> memo;\\n\\ntemplate<class Monoid> struct ReRooting {\\n using Graph = vector<vector<int>>;\\n using MergeFunc = function<Monoid(Monoid, Monoid)>;\\n using AddNodeFunc = function<Monoid(int,int, Monoid)>;\\n \\n // core member\\n Graph G;\\n Monoid IDENTITY;\\n MergeFunc MERGE;\\n AddNodeFunc ADDNODE;\\n \\n // inner data\\n vector<vector<Monoid>> dp;\\n \\n // constructor\\n ReRooting() {}\\n ReRooting(const Graph &g, const Monoid &identity,\\n const MergeFunc &merge, const AddNodeFunc &addnode) {\\n G = g;\\n IDENTITY = identity;\\n MERGE = merge;\\n ADDNODE = addnode;\\n build();\\n }\\n \\n // re-looting dp\\n Monoid rec(int v, int p) {\\n Monoid res = IDENTITY;\\n dp[v].assign(G[v].size(), IDENTITY);\\n for (int i = 0; i < G[v].size(); ++i) {\\n int v2 = G[v][i];\\n if (v2 == p) continue;\\n dp[v][i] = rec(v2, v);\\n res = MERGE(res, dp[v][i]);\\n }\\n return ADDNODE(v,p, res);\\n }\\n void rerec(int v, int p, Monoid pval) {\\n for (int i = 0; i < G[v].size(); ++i) {\\n int v2 = G[v][i];\\n if (v2 == p) {\\n dp[v][i] = pval;\\n continue;\\n }\\n }\\n vector<Monoid> left(G[v].size() + 1, IDENTITY);\\n vector<Monoid> right(G[v].size() + 1, IDENTITY);\\n for (int i = 0; i < G[v].size(); ++i) {\\n left[i + 1] = MERGE(left[i], dp[v][i]);\\n right[i + 1] = MERGE(right[i], dp[v][(int)G[v].size() - i - 1]);\\n }\\n for (int i = 0; i < G[v].size(); ++i) {\\n int v2 = G[v][i];\\n if (v2 == p) continue;\\n Monoid pval2 = MERGE(left[i], right[(int)G[v].size() - i - 1]);\\n rerec(v2, v, ADDNODE(v,v2, pval2));\\n }\\n }\\n void build() {\\n dp.assign(G.size(), vector<Monoid>());\\n int root = 0, nullparent = -1;\\n rec(root, nullparent);\\n rerec(root, nullparent, IDENTITY);\\n }\\n \\n // getter\\n Monoid get(int v) {\\n Monoid res = IDENTITY;\\n for (int i = 0; i < G[v].size(); ++i) {\\n res = MERGE(res, dp[v][i]);\\n }\\n return ADDNODE(v,lim, res);\\n }\\n \\n // dump\\n friend constexpr ostream& operator << (ostream &os, const ReRooting<Monoid> &rr) {\\n for (int v = 0; v < rr.G.size(); ++v) {\\n for (int i = 0; i < rr.G[v].size(); ++i) {\\n os << v << \\\" -> \\\" << rr.G[v][i] << \\\": \\\" << rr.dp[v][i] << endl;\\n }\\n }\\n return os;\\n }\\n};\\n\\nll solve() {\\n \\n ll n;\\n cin >> n;\\n memo.clear();\\n if (n == 0) return 1;\\n vector<vector<int>> G(n);\\n vector<ll> P(n), D(n);\\n for (ll i = 0; i < n-1; ++i) {\\n int p;\\n cin >> p;\\n --p;\\n G[i+1].push_back(p);\\n G[p].push_back(i+1);\\n P[i] = p;\\n }\\n for (ll i = 0; i < n-1; ++i) {\\n ll d;\\n cin >> d;\\n memo[{(int)i+1,P[i]}] = d;\\n memo[{P[i],(int)i+1}] = d;\\n }\\n\\n dump(memo);\\n dump(G | cpp_dump::index());\\n\\n // 行って戻るコスト: 部分木の中のパスグラフの最大コスト\\n using Monoid = pair<ll, ll>;\\n Monoid identity = {0,0};\\n auto merge = [&](Monoid a, Monoid b) -> Monoid{\\n ll fir = a.first+b.first;\\n ll sec = max(a.second, b.second);\\n\\n return {fir,sec};\\n };\\n\\n auto addnode = [&](int from, int to, Monoid a) -> Monoid {\\n if (to == lim) {\\n return a;\\n }\\n\\n if (a.first == 0) {\\n return {memo[{from,to}],0};\\n }\\n\\n return {memo[{from,to}]*3+a.first, memo[{from,to}]+a.second};\\n };\\n\\n ReRooting<Monoid> reroot(G, identity,merge,addnode);\\n\\n ll ans = inf;\\n for (ll i = 0; i < n; ++i) {\\n ans = min(ans,reroot.get(i).first - reroot.get(i).second);\\n }\\n\\n cout << ans << endl;\\n\\n return 0;\\n\\n}\\n\\nint main(){\\n while(1){\\n if(solve()==1)break;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 4004,\n \"score_of_the_acc\": -1.0164,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1196_9343014\",\n \"code_snippet\": \"// #pragma GCC target(\\\"avx2\\\")\\n// #pragma GCC optimize(\\\"O3\\\")\\n// #pragma GCC optimize(\\\"unroll-loops\\\")\\n#include<bits/stdc++.h>\\n#ifdef DEBUG\\n#include \\\"cpp-dump/dump.hpp\\\"\\n#define dump(...) cpp_dump(__VA_ARGS__)\\n#else\\n#define dump(...)\\n#endif\\nusing namespace std;\\n#define rep(i,n) for (long long i=0;i<n;i++)\\n#define loop(i,m,n) for(long long i=m;i<=n;i++)\\n#define range(value,range) for(const auto &value : range)\\n#define ll long long\\n#define vl vector<long long>\\n#define vvl vector<vector<long long>>\\n#define vdbg(a) rep(ii,a.size()){cout<<a[ii]<<\\\" \\\";}cout<<endl;\\n#define vvdbg(a) rep(ii,a.size()){rep(jj,a[ii].size()){cout<<a[ii][jj]<<\\\" \\\";}cout<<endl;}\\n#define inf 4000000000000000000LL\\n#define mod 998244353\\nconst int lim = INT16_MAX;\\nmap<pair<int, int>,ll> memo;\\n\\ntemplate<class Monoid> struct ReRooting {\\n using Graph = vector<vector<int>>;\\n using MergeFunc = function<Monoid(Monoid, Monoid)>;\\n using AddNodeFunc = function<Monoid(int,int, Monoid)>;\\n \\n // core member\\n Graph G;\\n Monoid IDENTITY;\\n MergeFunc MERGE;\\n AddNodeFunc ADDNODE;\\n \\n // inner data\\n vector<vector<Monoid>> dp;\\n \\n // constructor\\n ReRooting() {}\\n ReRooting(const Graph &g, const Monoid &identity,\\n const MergeFunc &merge, const AddNodeFunc &addnode) {\\n G = g;\\n IDENTITY = identity;\\n MERGE = merge;\\n ADDNODE = addnode;\\n build();\\n }\\n \\n // re-looting dp\\n Monoid rec(int v, int p) {\\n Monoid res = IDENTITY;\\n dp[v].assign(G[v].size(), IDENTITY);\\n for (int i = 0; i < G[v].size(); ++i) {\\n int v2 = G[v][i];\\n if (v2 == p) continue;\\n dp[v][i] = rec(v2, v);\\n res = MERGE(res, dp[v][i]);\\n }\\n return ADDNODE(v,p, res);\\n }\\n void rerec(int v, int p, Monoid pval) {\\n for (int i = 0; i < G[v].size(); ++i) {\\n int v2 = G[v][i];\\n if (v2 == p) {\\n dp[v][i] = pval;\\n continue;\\n }\\n }\\n vector<Monoid> left(G[v].size() + 1, IDENTITY);\\n vector<Monoid> right(G[v].size() + 1, IDENTITY);\\n for (int i = 0; i < G[v].size(); ++i) {\\n left[i + 1] = MERGE(left[i], dp[v][i]);\\n right[i + 1] = MERGE(right[i], dp[v][(int)G[v].size() - i - 1]);\\n }\\n for (int i = 0; i < G[v].size(); ++i) {\\n int v2 = G[v][i];\\n if (v2 == p) continue;\\n Monoid pval2 = MERGE(left[i], right[(int)G[v].size() - i - 1]);\\n rerec(v2, v, ADDNODE(v,v2, pval2));\\n }\\n }\\n void build() {\\n dp.assign(G.size(), vector<Monoid>());\\n int root = 0, nullparent = -1;\\n rec(root, nullparent);\\n rerec(root, nullparent, IDENTITY);\\n }\\n \\n // getter\\n Monoid get(int v) {\\n Monoid res = IDENTITY;\\n for (int i = 0; i < G[v].size(); ++i) {\\n res = MERGE(res, dp[v][i]);\\n }\\n return ADDNODE(v,lim, res);\\n }\\n \\n // dump\\n friend constexpr ostream& operator << (ostream &os, const ReRooting<Monoid> &rr) {\\n for (int v = 0; v < rr.G.size(); ++v) {\\n for (int i = 0; i < rr.G[v].size(); ++i) {\\n os << v << \\\" -> \\\" << rr.G[v][i] << \\\": \\\" << rr.dp[v][i] << endl;\\n }\\n }\\n return os;\\n }\\n};\\n\\nll solve() {\\n \\n ll n;\\n cin >> n;\\n memo.clear();\\n if (n == 0) return 1;\\n vector<vector<int>> G(n);\\n vector<ll> P(n), D(n);\\n for (ll i = 0; i < n-1; ++i) {\\n int p;\\n cin >> p;\\n --p;\\n G[i+1].push_back(p);\\n G[p].push_back(i+1);\\n P[i] = p;\\n }\\n for (ll i = 0; i < n-1; ++i) {\\n ll d;\\n cin >> d;\\n memo[{(int)i+1,P[i]}] = d;\\n memo[{P[i],(int)i+1}] = d;\\n }\\n\\n dump(memo);\\n dump(G | cpp_dump::index());\\n\\n // 行って戻るコスト: 部分木の中のパスグラフの最大コスト\\n using Monoid = pair<ll, ll>;\\n Monoid identity = {0,0};\\n auto merge = [&](Monoid a, Monoid b) -> Monoid{\\n ll fir = a.first+b.first;\\n ll sec = max(a.second, b.second);\\n\\n return {fir,sec};\\n };\\n\\n auto addnode = [&](int from, int to, Monoid a) -> Monoid {\\n if (to == lim) {\\n return a;\\n }\\n\\n if (a.first == 0) {\\n return {memo[{from,to}],0};\\n }\\n\\n return {memo[{from,to}]*3+a.first, memo[{from,to}]+a.second};\\n };\\n\\n ReRooting<Monoid> reroot(G, identity,merge,addnode);\\n\\n ll ans = inf;\\n for (ll i = 0; i < n; ++i) {\\n ans = min(ans,reroot.get(i).first - reroot.get(i).second);\\n }\\n\\n cout << ans << endl;\\n\\n return 0;\\n\\n}\\n\\nint main(){\\n while(1){\\n if(solve()==1)break;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 4008,\n \"score_of_the_acc\": -1.0208,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1196_9329403\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\n#define rep(i,n) for(int i = 0;i < n;i++)\\n\\n#define int ll\\n\\npair<int,int> far(int s, int n, const vector<vector<pair<int,int>>> &adj)\\n{\\n vector<int> dist(n, (1LL<<60));\\n priority_queue<pair<int,int>> que;\\n que.emplace(0,s);\\n dist.at(s) = 0;\\n\\n while(!que.empty())\\n {\\n int d = - que.top().first;\\n int now = que.top().second;\\n que.pop();\\n if(dist.at(now) < d) continue;\\n dist.at(now) = d;\\n for(auto [nxt, c] : adj.at(now))\\n {\\n if(dist.at(nxt) < d + c) continue;\\n que.emplace(-(d+c), nxt);\\n }\\n }\\n int pnt = s;\\n int d = 0;\\n rep(i,n)\\n {\\n if(dist.at(i) > d)\\n {\\n d = dist.at(i);\\n pnt = i;\\n }\\n }\\n return make_pair(pnt, d);\\n}\\n\\nvoid main_()\\n{\\n int n;\\n cin >> n;\\n if(!n) exit(0);\\n\\n vector<int> b(n-1), c(n-1);\\n rep(i,n-1) cin >> b[i];\\n rep(i,n-1) b[i]--;\\n rep(i,n-1) cin >> c[i];\\n\\n int sum_a = 0;\\n rep(i,n-1) sum_a += c[i];\\n\\n vector<int> deg(n,1);\\n deg[0] = 0;\\n rep(i,n-1) deg.at(b[i]) += 1;\\n\\n set<int> st;\\n rep(i,n)\\n if(deg.at(i) >= 2) st.insert(i);\\n\\n int m = st.size();\\n map<int, int> mp;\\n int idx = 0;\\n for(int i : st) mp[i] = idx++;\\n // 1 ~ m\\n vector<vector<pair<int,int>>> adj(m);\\n int sum_b = 0;\\n rep(i,n-1)\\n {\\n // i + 1 to b[i]\\n int from = i + 1;\\n if(st.find(from) == st.end()) continue;\\n if(st.find(b[i]) == st.end()) continue;\\n\\n adj.at(mp[from]).emplace_back(mp[b[i]], c[i]);\\n adj.at(mp[b[i]]).emplace_back(mp[from], c[i]);\\n sum_b += c[i];\\n }\\n pair<int,int> one = far(0, m, adj);\\n pair<int,int> two = far(one.first, m, adj);\\n int dist = two.second;\\n\\n int ans = sum_a + (2*sum_b) - dist;\\n cout << ans << endl;\\n}\\n\\n\\nsigned main()\\n{\\n while(1) main_();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3624,\n \"score_of_the_acc\": -0.5856,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1196_9327982\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i, a, n) for(int i = a; i < n; i++)\\n#define rrep(i, a, n) for(int i = a; i >= n; i--)\\n#define inr(l, x, r) (l <= x && x < r)\\n#define ll long long\\n#define ld long double\\n\\nconstexpr int IINF = 1001001001;\\nconstexpr ll INF = 9e18;\\n\\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\\nint main() {\\n while(1){\\n int n; cin >> n;\\n if(n == 0) break;\\n vector<vector<pair<int,int>>> g(n);\\n vector<int> p(n-1), d(n-1);\\n int dsum = 0;\\n rep(i,0,n-1){\\n cin >> p[i];\\n p[i]--;\\n }\\n rep(i,0,n-1){\\n cin >> d[i];\\n dsum += d[i]*3;\\n }\\n rep(i,0,n-1){\\n g[i+1].push_back({p[i],d[i]});\\n g[p[i]].push_back({i+1,d[i]});\\n }\\n int ans = IINF;\\n int maxdist;\\n int res;\\n\\n auto dfs = [&](auto dfs, int v, int p, int dist)->void{\\n if(g[v].size() >= 2 || g[v][0].first != p){\\n chmax(maxdist, dist);\\n }else{\\n res -= 2*g[v][0].second;\\n }\\n for(auto nv: g[v]){\\n if(nv.first == p) continue;\\n dfs(dfs, nv.first, v, dist+nv.second);\\n }\\n };\\n \\n auto solve = [&](int i)->int{\\n maxdist = 0;\\n res = dsum;\\n dfs(dfs, i, -1, 0);\\n res -= maxdist;\\n return res;\\n };\\n\\n rep(i,0,n){\\n chmin(ans,solve(i));\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 3504,\n \"score_of_the_acc\": -0.5883,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1196_9269408\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nconst ll LINF = 1e18;\\n\\nint main(){\\n while(1){\\n int N; cin >> N;\\n if(N == 0) break;\\n vector<int> P(N - 1); for(int i = 0; i < N - 1; i++) cin >> P[i];\\n vector<int> D(N - 1); for(int i = 0; i < N - 1; i++) cin >> D[i];\\n\\n vector<vector<pair<int, int>>> G(N);\\n for(int i = 0; i < N - 1; i++){\\n int u = P[i] - 1, v = i + 1;\\n G[u].emplace_back(make_pair(v, D[i]));\\n G[v].emplace_back(make_pair(u, D[i]));\\n }\\n\\n auto dfs = [&](auto f, int u, int par) -> ll {\\n ll res = 0;\\n for(auto [v, d] : G[u]){\\n\\t\\t\\t\\tif(v == par) continue;\\n if(G[v].size() == 1) continue;\\n else{\\n res = max(res, f(f, v, u) + d);\\n }\\n }\\n return res;\\n };\\n\\n // auto rec = [&](auto f, int u, int par) -> ll {\\n // ll res = 0;\\n // for(auto [v, d] : G[u]){\\n\\t\\t// \\t\\tcout << \\\"(\\\" << v << \\\",\\\" << d << \\\")\\\";\\n // if(v == par) continue;\\n // if(G[v].size() == 1) res += d;\\n // else{\\n // f(f, v, u);\\n // res += d * 3;\\n // }\\n // }\\n // return res;\\n // };\\n\\n ll ans = LINF;\\n\\t\\tll num = 0;\\n\\t\\tfor(int i = 0; i < N; i++){\\n\\t\\t\\tfor(auto [j, d] : G[i]){\\n\\t\\t\\t\\tif(i > j) continue;\\n\\t\\t\\t\\tif(G[i].size() == 1 || G[j].size() == 1){\\n\\t\\t\\t\\t\\tnum += d;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse num += d * 3;\\n\\t\\t\\t}\\n\\t\\t}\\n for(int i = 0; i < N; i++){\\n if(G[i].size() == 1) continue;\\n\\t\\t\\tll val = dfs(dfs, i, -1);\\n\\t\\t\\t// cout << num << \\\" \\\" << val << \\\" \\\";\\n ans = min(ans, num - val);\\n }\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3484,\n \"score_of_the_acc\": -0.4829,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1196_9247544\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define rep(i,n) for(int i=0;i<n;i++)\\n\\nusing Edge=pair<int,int>;\\nusing Graph=vector<vector<Edge>>;\\n\\n\\n#define INF 1<<30\\n\\nvoid dijkstra(Graph& g, int s, int n, vector<int>& dist){\\n dist.assign(n, INF);\\n dist[s]=0;\\n\\n vector<int> seen(n,false);\\n\\n for(;;){\\n int pos=-1;\\n int mi=INF;\\n rep(i,n){\\n if(seen[i] || mi<= dist[i]) continue;\\n pos=i;\\n mi=dist[i];\\n }\\n if(pos==-1) break;\\n\\n seen[pos]=true;\\n rep(i,g[pos].size()){\\n int next=g[pos][i].first;\\n int cost=g[pos][i].second;\\n dist[next]=min(dist[next], dist[pos]+cost);\\n }\\n }\\n}\\n\\nint solve(int n){\\n vector<int> p(n-1), d(n-1);\\n rep(i,n-1){cin>>p[i];p[i]--;}\\n rep(i,n-1) cin>>d[i];\\n\\n int res=0;\\n rep(i,n-1) res+=d[i];\\n res*=3;\\n\\n Graph graph(n);\\n rep(i,n-1){\\n graph[i+1].push_back({p[i], d[i]});\\n graph[p[i]].push_back({i+1, d[i]});\\n }\\n\\n rep(i,n){\\n if(graph[i].size()==1){\\n res-=2*graph[i][0].second;\\n int to=graph[i][0].first;\\n graph[i][0].second=0;\\n rep(j,graph[to].size()) if(graph[to][j].first==i) graph[to][j].second=0;\\n }\\n }\\n\\n vector<int> dist;\\n dijkstra(graph,0,n,dist);\\n int tmp=0;\\n rep(i,n) if(dist[tmp]<dist[i]) tmp=i;\\n dijkstra(graph,tmp,n,dist);\\n tmp=0;\\n rep(i,n) if(dist[tmp]<dist[i]) tmp=i;\\n res-=dist[tmp];\\n return res;\\n\\n}\\n\\nint main(){\\n for(;;){\\n int n; cin>>n;\\n if(n==0) return 0;\\n cout<<solve(n)<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3504,\n \"score_of_the_acc\": -0.5154,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1196_9180296\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nbool solve() {\\n int N;\\n std::cin >> N;\\n if (N == 0) return false;\\n std::vector<std::vector<int>> g(N);\\n for (int i{1} ; i < N ; i++) {\\n int P;\\n std::cin >> P;\\n P--;\\n g[P].push_back(i);\\n g[i].push_back(P);\\n }\\n std::vector<int> D(N);\\n for (int i{1} ; i < N ; i++) {\\n std::cin >> D[i];\\n }\\n if (N == 2) {\\n std::cout << D[1] << '\\\\n';\\n return true;\\n }\\n auto cost{[&](int u, int v) -> int {\\n assert(0 <= u and u < N);\\n assert(0 <= v and v < N);\\n return D[std::max(u, v)];\\n }};\\n std::vector<bool> leaf(N);\\n for (int i{} ; i < N ; i++) {\\n leaf[i] = (g[i].size() == 1u);\\n }\\n std::map<std::pair<int, int>, long long> dp1;\\n // return to v\\n auto rec1{[&](auto rec, int v, int p) -> long long {\\n if (dp1.find(std::pair{ p, v }) != dp1.end()) {\\n return dp1[std::pair{ p, v }];\\n }\\n long long res{};\\n for (auto x : g[v]) {\\n if (x == p) continue;\\n if (leaf[x]) res += cost(v, x);\\n else res += 3 * cost(v, x) + rec(rec, x, v);\\n }\\n return dp1[std::pair{ p, v }] = res;\\n }};\\n std::map<std::pair<int, int>, long long> dp2;\\n auto rec2{[&](auto rec, int v, int p) -> long long {\\n if (dp2.find(std::pair{ p, v }) != dp2.end()) {\\n return dp2[std::pair{ p, v }];\\n }\\n long long base{};\\n for (auto x : g[v]) {\\n if (x == p) continue;\\n if (leaf[x]) base += cost(v, x);\\n else base += 3 * cost(v, x) + rec1(rec1, x, v);\\n }\\n long long res{base};\\n for (auto x : g[v]) {\\n if (x == p) continue;\\n if (leaf[x]) continue;\\n long long value{base};\\n value -= 3 * cost(v, x) + rec1(rec1, x, v);\\n value += 2 * cost(v, x) + rec(rec, x, v);\\n res = std::min(res, value);\\n }\\n return dp2[std::pair{ p, v }] = res;\\n }};\\n long long ans{(long long)9e18};\\n for (int s{} ; s < N ; s++) {\\n if (leaf[s]) continue;\\n ans = std::min(ans, rec2(rec2, s, -1));\\n }\\n std::cout << ans << '\\\\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\": 170,\n \"memory_kb\": 3996,\n \"score_of_the_acc\": -1.1534,\n \"final_rank\": 19\n }\n]","isConversational":false}}},{"rowIdx":667,"cells":{"group_id":{"kind":"string","value":"aoj_1197_cpp"},"problem_description":{"kind":"string","value":"A Die Maker\nThe work of die makers starts early in the morning.\nYou are a die maker.\nYou receive orders from customers, and make various kinds of dice every day.\nToday, you received an order of a cubic die with six numbers\nt\n1\n,\nt\n2\n, ...,\nt\n6\non whichever faces.\nFor making the ordered die, you use a tool of flat-board shape.\nYou initially have a die with a zero on each face.\nIf you rotate the die by 90 degrees on the tool towards one of northward, southward, eastward, and southward,\nthe number on the face that newly touches the tool is increased by one.\nBy rotating the die towards appropriate directions repeatedly,\nyou may obtain the ordered die.\nThe final numbers on the faces of the die\nis determined by the sequence of directions towards which you rotate the die.\nWe call the string that represents the sequence of directions an\noperation sequence.\nFormally, we define operation sequences as follows.\nAn operation sequence consists of\nn\ncharacters, where\nn\nis the number of rotations made.\nIf you rotate the die eastward in the\ni\n-th rotation,\nthe\ni\n-th character of the operation sequence is\nE\n.\nSimilarly, if you rotate it westward, it is\nW\n,\nif southward, it is\nS\n, otherwise,\nif northward, it is\nN\n.\nFor example, the operation sequence\nNWS\nrepresents\nthe sequence of three rotations, northward first, westward next,\nand finally southward.\nGiven six integers of the customer's order,\ncompute an operation sequence that makes a die to order.\nIf there are two or more possibilities, you should compute the earliest operation sequence in dictionary order.\nInput\nThe input consists of multiple datasets.\nThe number of datasets does not exceed 40.\nEach dataset has the following form.\nt\n1\nt\n2\nt\n3\nt\n4\nt\n5\nt\n6\np\nq\nt\n1\n,\nt\n2\n, ...,\nt\n6\nare integers that represent the order from the customer.\nFurther,\np\nand\nq\nare positive integers that specify the output range of the operation sequence (see the details below).\nEach dataset satisfies\n0 ≤\nt\n1\n≤\nt\n2\n≤ ... ≤\nt\n6\n≤ 5,000\nand\n1 ≤\np\n≤\nq\n≤\nt\n1\n+\nt\n2\n+...+\nt\n6\n.\nA line containing six zeros denotes the end of the input.\nOutput\nFor each dataset,\nprint the subsequence,\nfrom the\np\n-th position to the\nq\n-th position, inclusively,\nof the operation sequence that is the earliest in dictionary order.\nIf it is impossible to make the ordered die, print\nimpossible\n.\nHere, dictionary order is recursively defined as follows.\nThe empty string comes the first in dictionary order.\nFor two nonempty strings\nx\n=\nx\n1\n...\nx\nk\nand\ny\n=\ny\n1\n...\ny\nl\n, the string\nx\nprecedes the string\ny\nin dictionary order if\nx\n1\nprecedes\ny\n1\nin alphabetical order ('A' to 'Z'), or\nx\n1\nand\ny\n1\nare the same character and\nx\n2\n...\nx\nk\nprecedes\ny\n2\n...\ny\nl\nin dictionary order.\nSample Input\n1 1 1 1 1 1\n1 6\n1 1 1 1 1 1\n4 5\n0 0 0 0 0 2\n1 2\n0 0 2 2 2 4\n5 9\n1 2 3 4 5 6\n15 16\n0 1 2 3 5 9\n13 16\n2 13 22 27 31 91\n100 170\n0 0 0 0 0 0\nOutput for the Sample Input\nEEENEE\nNE\nimpossible\nNSSNW\nEN\nEWNS\nSNSNSNSNSNSNSNSNSNSNSNSSNSNSNSNSNSNSNSNSNSNSNSNSNSNSNSNSNSNSNSNSNSNWEWE"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1197_9857905","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/**\n * @brief template\n */\n\nchar CINF = (char)('Z'+1);\nstring SINF(1,CINF);\n\nstring MOVE = \"ENSW\";\n\nstruct Dice {\n int A[6];\n int &operator[] (int i) {\n return A[i];\n }\n};\n\nDice rotE(Dice D) {\n Dice E;\n E[0] = D[1];\n E[1] = D[5];\n E[2] = D[2];\n E[3] = D[3];\n E[4] = D[0];\n E[5] = D[4];\n return E;\n}\n\nDice rotN(Dice D) {\n Dice E;\n E[0] = D[2];\n E[1] = D[1];\n E[2] = D[5];\n E[3] = D[0];\n E[4] = D[4];\n E[5] = D[3];\n return E;\n}\n\nDice rotS(Dice D) {\n Dice E;\n E[0] = D[3];\n E[1] = D[1];\n E[2] = D[0];\n E[3] = D[5];\n E[4] = D[4];\n E[5] = D[2];\n return E;\n}\n\nDice rotW(Dice D) {\n Dice E;\n E[0] = D[4];\n E[1] = D[0];\n E[2] = D[2];\n E[3] = D[3];\n E[4] = D[5];\n E[5] = D[1];\n return E;\n}\n\nDice rot(Dice D, int i) {\n if (i == 0) return rotE(D);\n if (i == 1) return rotN(D);\n if (i == 2) return rotS(D);\n if (i == 3) return rotW(D);\n return D;\n}\n\nstring Solve(vector<int> A) {\n auto Judge = [&](Dice D) -> bool {\n if (D[0] < 0) return false;\n int SUM = 0;\n rep(i,0,6) SUM += D[i];\n vector<int> Y(3);\n rep(i,0,3) Y[i] = D[i] + D[5-i];\n if (Y[0] > SUM / 2) return false;\n if (Y[1] > (SUM+1) / 2) return false;\n if (Y[2] > (SUM+1) / 2) return false;\n return true;\n };\n auto canMove = [&](Dice D, int i) -> bool {\n auto E = rot(D,i);\n E[0]--;\n return Judge(E);\n };\n bool check = false;\n Dice D;\n rep(i,0,6) D[i] = A[i];\n rep(i,0,4) {\n if (canMove(D,i)) check = true;\n }\n if (!check) return SINF;\n string Ret = \"\";\n int COUNT = 0;\n rep(i,0,6) COUNT += A[i];\n while(COUNT--) {\n int next = -1;\n rep(i,0,4) {\n if (canMove(D,i)) {\n next = i;\n break;\n }\n }\n Ret += MOVE[next];\n D = rot(D,next);\n D[0]--;\n }\n return Ret;\n}\n\nint main() {\nwhile(1) {\n vector<int> A(6);\n int COUNT = 0;\n rep(i,0,6) cin >> A[i], COUNT += A[i];\n if (COUNT == 0) return 0;\n int X, Y;\n cin >> X >> Y;\n X--;\n vector<int> ord(6);\n iota(ALL(ord),0);\n string ANS = SINF;\n do {\n vector<int> B(6);\n rep(i,0,6) B[i] = A[ord[i]];\n string Ret = Solve(B);\n chmin(ANS, Ret);\n } while(next_permutation(ALL(ord)));\n if (ANS == SINF) {\n cout << \"impossible\" << endl;\n }\n else {\n cout << ANS.substr(X,Y-X) << endl;\n }\n}\n}","accuracy":1,"time_ms":6490,"memory_kb":3260,"score_of_the_acc":-0.9462,"final_rank":17},{"submission_id":"aoj_1197_9324064","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = int;\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};\ntemplate<class T>\nbool chmin(T& p, T q) {\n if (p > q) {\n p = q; return 1;\n }\n return 0;\n};\n\n\nvoid roll(vll &D, char C) {\n ll SV=D[0];\n if (C == 'E') {\n D[0] = D[1];\n D[1] = D[5];\n D[5] = D[3];\n D[3] = SV;\n }\n else if (C == 'W'){\n D[0] = D[3];\n D[3] = D[5];\n D[5] = D[1];\n D[1] = SV;\n }\n else if (C == 'N') {\n D[0] = D[4];\n D[4] = D[5];\n D[5] = D[2];\n D[2] = SV;\n }\n else if (C == 'S'){\n D[0] = D[2];\n D[2] = D[5];\n D[5] = D[4];\n D[4] = SV;\n }\n}\n\nbool is_valid(vll &D,char C){\n if(C=='E'||C=='W'){\n if(C=='E'&&D[1]==0)return 0;\n if(C=='W'&&D[3]==0)return 0;\n if (D[0] + D[5] > D[1] + D[2] + D[3] + D[4])return 0;\n if (D[1]-1 + D[3] > D[0] + D[2] + D[5] + D[4])return 0;\n if (D[2] + D[4] > D[1] + D[0] + D[3] + D[5])return 0;\n return 1;\n }\n if(C=='N'||C=='S'){\n if(C=='N'&&D[4]==0)return 0;\n if(C=='S'&&D[2]==0)return 0;\n if (D[0] + D[5] > D[1] + D[2] + D[3] + D[4])return 0;\n if (D[1] + D[3] > D[0] + D[2] + D[5] + D[4])return 0;\n if (D[2] + D[4]-1 > D[1] + D[0] + D[3] + D[5])return 0;\n return 1;\n }\n return 1;\n}\n\nvoid solve(vll D, ll S) {\n ll P, Q;\n cin >> P >> Q;\n P--; Q -= P;\n string AN ;\n rep(i,S)AN.push_back('Z');\n sort(all(D));\n ll MX=D[5];\n do {\n vll P = D;\n string R = \"\";\n string G = \"ENSW\";\n bool is_same=1;\n rep(i, S) {\n bool is_OK = 0;\n rep(k, 4) {\n if(i==0&&k!=0)break;\n if(is_valid(P,G[k])){\n roll(P, G[k]);\n P[0]--;\n R.push_back(G[k]);\n if(is_same&&G[k]>AN[i]){\n is_OK = 0;\n }\n if(G[k]<AN[i])is_same=0;\n is_OK = 1;\n break;\n }\n }\n if (!is_OK){\n R = \"Z\";\n break;\n }\n }\n chmin(AN, R);\n } while (next_permutation(all(D)));\n if (AN == \"Z\") {\n cout << \"impossible\" << endl;\n }\n else {\n cout << AN.substr(P, Q) << endl;\n }\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n vll D(6);\n while (1) {\n ll S = 0;\n rep(i, 6) {\n cin >> D[i];\n S += D[i];\n }\n if (S == 0)return 0;\n solve(D, S);\n }\n\n}","accuracy":1,"time_ms":930,"memory_kb":3512,"score_of_the_acc":-0.1398,"final_rank":5},{"submission_id":"aoj_1197_9324063","code_snippet":"#include <bits/stdc++.h>\n#include <time.h>\nusing namespace std;\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};\ntemplate<class T>\nbool chmin(T& p, T q) {\n if (p > q) {\n p = q; return 1;\n }\n return 0;\n};\n\n\nvoid roll(vll &D, char C) {\n ll SV=D[0];\n if (C == 'E') {\n D[0] = D[1];\n D[1] = D[5];\n D[5] = D[3];\n D[3] = SV;\n }\n else if (C == 'W'){\n D[0] = D[3];\n D[3] = D[5];\n D[5] = D[1];\n D[1] = SV;\n }\n else if (C == 'N') {\n D[0] = D[4];\n D[4] = D[5];\n D[5] = D[2];\n D[2] = SV;\n }\n else if (C == 'S'){\n D[0] = D[2];\n D[2] = D[5];\n D[5] = D[4];\n D[4] = SV;\n }\n}\n\nbool is_valid(vll &D,char C){\n if(C=='E'||C=='W'){\n if(C=='E'&&D[1]==0)return 0;\n if(C=='W'&&D[3]==0)return 0;\n if (D[0] + D[5] > D[1] + D[2] + D[3] + D[4])return 0;\n if (D[1]-1 + D[3] > D[0] + D[2] + D[5] + D[4])return 0;\n if (D[2] + D[4] > D[1] + D[0] + D[3] + D[5])return 0;\n return 1;\n }\n if(C=='N'||C=='S'){\n if(C=='N'&&D[4]==0)return 0;\n if(C=='S'&&D[2]==0)return 0;\n if (D[0] + D[5] > D[1] + D[2] + D[3] + D[4])return 0;\n if (D[1] + D[3] > D[0] + D[2] + D[5] + D[4])return 0;\n if (D[2] + D[4]-1 > D[1] + D[0] + D[3] + D[5])return 0;\n return 1;\n }\n return 1;\n}\n\nbool is_valid(vll &D) {\n if (D[0]-1 + D[5] > D[1] + D[2] + D[3] + D[4])return 0;\n if (D[1] + D[3] > D[0] + D[2] + D[5] + D[4])return 0;\n if (D[2] + D[4] > D[1] + D[0] + D[3] + D[5])return 0;\n return 1;\n}\n\nvoid solve(vll D, ll S) {\n clock_t start = clock();\n ll P, Q;\n cin >> P >> Q;\n P--; Q -= P;\n string AN ;\n rep(i,S)AN.push_back('Z');\n sort(all(D));\n ll MX=D[5];\n do {\n vll P = D;\n string R = \"\";\n string G = \"ENSW\";\n bool is_same=1;\n rep(i, S) {\n bool is_OK = 0;\n rep(k, 4) {\n if(i==0&&k!=0)break;\n if(is_valid(P,G[k])){\n roll(P, G[k]);\n P[0]--;\n R.push_back(G[k]);\n if(is_same&&G[k]>AN[i]){\n is_OK = 0;\n }\n if(G[k]<AN[i])is_same=0;\n is_OK = 1;\n break;\n }\n }\n if (!is_OK){\n R = \"Z\";\n break;\n }\n }\n chmin(AN, R);\n } while (next_permutation(all(D)));\n if (AN == \"Z\") {\n cout << \"impossible\" << endl;\n }\n else {\n // cout<<\"OK\"<<endl;\n cout << AN.substr(P, Q) << endl;\n }\n clock_t end = clock();\n\n // const double time = static_cast<double>(end - start) / CLOCKS_PER_SEC * 1000.0;\n // cout<<time<<endl;\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n vll D(6);\n while (1) {\n ll S = 0;\n rep(i, 6) {\n cin >> D[i];\n S += D[i];\n }\n if (S == 0)return 0;\n solve(D, S);\n }\n\n}","accuracy":1,"time_ms":940,"memory_kb":3588,"score_of_the_acc":-0.1635,"final_rank":7},{"submission_id":"aoj_1197_9324060","code_snippet":"#include <bits/stdc++.h>\n#include <time.h>\nusing namespace std;\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};\ntemplate<class T>\nbool chmin(T& p, T q) {\n if (p > q) {\n p = q; return 1;\n }\n return 0;\n};\n\n\nvoid roll(vll &D, char C) {\n ll SV=D[0];\n if (C == 'E') {\n D[0] = D[1];\n D[1] = D[5];\n D[5] = D[3];\n D[3] = SV;\n }\n else if (C == 'W'){\n D[0] = D[3];\n D[3] = D[5];\n D[5] = D[1];\n D[1] = SV;\n }\n else if (C == 'N') {\n D[0] = D[4];\n D[4] = D[5];\n D[5] = D[2];\n D[2] = SV;\n }\n else if (C == 'S'){\n D[0] = D[2];\n D[2] = D[5];\n D[5] = D[4];\n D[4] = SV;\n }\n}\n\nbool is_valid(vll &D) {\n if (D[0]-1 + D[5] > D[1] + D[2] + D[3] + D[4])return 0;\n if (D[1] + D[3] > D[0] + D[2] + D[5] + D[4])return 0;\n if (D[2] + D[4] > D[1] + D[0] + D[3] + D[5])return 0;\n return 1;\n}\n\nvoid solve(vll D, ll S) {\n clock_t start = clock();\n ll P, Q;\n cin >> P >> Q;\n P--; Q -= P;\n string AN ;\n rep(i,S)AN.push_back('Z');\n sort(all(D));\n ll MX=D[5];\n do {\n vll P = D;\n string R = \"\";\n string G = \"ENSW\";\n bool is_same=1;\n rep(i, S) {\n bool is_OK = 0;\n rep(k, 4) {\n if(i==0&&k!=0)break;\n roll(P, G[k]);\n if (is_valid(P)&&P[0]>0) {\n P[0]--;\n R.push_back(G[k]);\n if(is_same&&G[k]>AN[i]){\n is_OK = 0;\n }\n if(G[k]<AN[i])is_same=0;\n is_OK = 1;\n break;\n }\n roll(P,G[3-k]);\n }\n if (!is_OK){\n R = \"Z\";\n break;\n }\n }\n chmin(AN, R);\n } while (next_permutation(all(D)));\n if (AN == \"Z\") {\n cout << \"impossible\" << endl;\n }\n else {\n // cout<<\"OK\"<<endl;\n cout << AN.substr(P, Q) << endl;\n }\n clock_t end = clock();\n\n // const double time = static_cast<double>(end - start) / CLOCKS_PER_SEC * 1000.0;\n // cout<<time<<endl;\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n vll D(6);\n while (1) {\n ll S = 0;\n rep(i, 6) {\n cin >> D[i];\n S += D[i];\n }\n if (S == 0)return 0;\n solve(D, S);\n }\n\n}","accuracy":1,"time_ms":1150,"memory_kb":3496,"score_of_the_acc":-0.17,"final_rank":8},{"submission_id":"aoj_1197_9324057","code_snippet":"#include <bits/stdc++.h>\n#include <time.h>\nusing namespace std;\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};\ntemplate<class T>\nbool chmin(T& p, T q) {\n if (p > q) {\n p = q; return 1;\n }\n return 0;\n};\n\n\nvll roll(vll &D, char C) {\n vll res = D;\n if (C == 'E') {\n res[0] = D[1];\n res[1] = D[5];\n res[5] = D[3];\n res[3] = D[0];\n }\n else if (C == 'W'){\n res[0] = D[3];\n res[3] = D[5];\n res[5] = D[1];\n res[1] = D[0];\n }\n else if (C == 'N') {\n res[0] = D[4];\n res[4] = D[5];\n res[5] = D[2];\n res[2] = D[0];\n }\n else if (C == 'S'){\n res[0] = D[2];\n res[2] = D[5];\n res[5] = D[4];\n res[4] = D[0];\n }\n return res;\n}\n\nbool is_valid(vll &D) {\n if (D[0]-1 + D[5] > D[1] + D[2] + D[3] + D[4])return 0;\n if (D[1] + D[3] > D[0] + D[2] + D[5] + D[4])return 0;\n if (D[2] + D[4] > D[1] + D[0] + D[3] + D[5])return 0;\n\n return 1;\n}\n\nvoid solve(vll D, ll S) {\n clock_t start = clock();\n ll P, Q;\n cin >> P >> Q;\n P--; Q -= P;\n string AN ;\n rep(i,S)AN.push_back('Z');\n sort(all(D));\n ll MX=D[5];\n do {\n vll P = D;\n string R = \"\";\n string G = \"ENSW\";\n bool is_same=1;\n rep(i, S) {\n bool is_OK = 0;\n rep(k, 4) {\n if(i==0&&k!=0)break;\n vll NP = roll(P, G[k]);\n if (is_valid(NP)&&NP[0]>0) {\n P = NP;\n P[0]--;\n R.push_back(G[k]);\n if(is_same&&G[k]>AN[i]){\n is_OK = 0;\n }\n if(G[k]<AN[i])is_same=0;\n is_OK = 1;\n break;\n }\n }\n if (!is_OK){\n R = \"Z\";\n break;\n }\n }\n chmin(AN, R);\n } while (next_permutation(all(D)));\n if (AN == \"Z\") {\n cout << \"impossible\" << endl;\n }\n else {\n // cout<<\"OK\"<<endl;\n cout << AN.substr(P, Q) << endl;\n }\n clock_t end = clock();\n\n // const double time = static_cast<double>(end - start) / CLOCKS_PER_SEC * 1000.0;\n // cout<<time<<endl;\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n vll D(6);\n while (1) {\n ll S = 0;\n rep(i, 6) {\n cin >> D[i];\n S += D[i];\n }\n if (S == 0)return 0;\n solve(D, S);\n }\n\n}","accuracy":1,"time_ms":4490,"memory_kb":3528,"score_of_the_acc":-0.7077,"final_rank":16},{"submission_id":"aoj_1197_9298481","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>\nbool chmax(T& a, const T& b) {\n return a < b ? (a = b, 1) : 0;\n}\ntemplate <typename T>\nbool chmin(T& a, const T& b) {\n return a > b ? (a = b, 1) : 0;\n}\n\nstruct Die {\n int top = 1, south = 2, east = 3, west = 4, north = 5, bottom = 6;\n\n void roll(char dir) {\n if (dir == 'N') {\n int tmp = top;\n top = south;\n south = bottom;\n bottom = north;\n north = tmp;\n } else if (dir == 'E') {\n int tmp = top;\n top = west;\n west = bottom;\n bottom = east;\n east = tmp;\n } else if (dir == 'W') {\n int tmp = top;\n top = east;\n east = bottom;\n bottom = west;\n west = tmp;\n } else if (dir == 'S') {\n int tmp = top;\n top = north;\n north = bottom;\n bottom = south;\n south = tmp;\n } else {\n assert(false);\n }\n }\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];\n if (i < (int)v.size() - 1) os << \" \";\n }\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 const string dir = \"ENSW\";\n\n auto check = [&](vector<int>& val, int cur) {\n int sum = 0;\n rep(i, 0, 6) {\n if (val[i] < 0) return false;\n sum += val[i];\n }\n rep(i, 0, 3) {\n int x = val[i] + val[5 - i];\n if (i == min(cur, 5 - i)) {\n if (sum - x < x) return false;\n } else {\n if (sum - x < x - 1) return false;\n }\n }\n return true;\n };\n\n while (true) {\n vector<int> t(6);\n int sum = 0;\n for (auto& x : t) cin >> x, sum += x;\n if (t[5] == 0) break;\n int p, q;\n cin >> p >> q;\n --p;\n\n string ans = \"Z\";\n\n vector<int> idx(6);\n iota(all(idx), 0);\n do {\n vector<int> val(6);\n rep(v, 0, 6) val[v] = t[idx[v]];\n if (val[0] == 0) continue;\n --val[0];\n string res = \"E\";\n Die die;\n die.roll('N');\n die.roll('N');\n // 1 is facing down\n\n int edges = sum - 1;\n rep(t, 0, sum - 1) {\n char move = '?';\n --edges;\n for (char c : dir) {\n die.roll(c);\n --val[die.bottom - 1];\n if (check(val, die.bottom - 1)) {\n move = c;\n break;\n } else {\n ++val[die.bottom - 1];\n die.roll(c);\n die.roll(c);\n die.roll(c);\n }\n }\n if (move == '?') {\n res = \"Z\";\n break;\n }\n res.push_back(move);\n }\n chmin(ans, res);\n } while (next_permutation(all(idx)));\n\n cout << (ans == \"Z\" ? \"impossible\" : ans.substr(p, q - p)) << \"\\n\";\n }\n}","accuracy":1,"time_ms":2210,"memory_kb":3456,"score_of_the_acc":-0.326,"final_rank":13},{"submission_id":"aoj_1197_9248869","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC optimize(\"unroll-loops\")\n\nusing ll = long long;\n\ntemplate<class T>\nbool chmin(T &a, const T &b) {if (a > b) {a = b; return 1;} return 0;}\n\nbool is_end = false;\n\nstring ENSW = \"ENSW\";\n\n// origin = {0, 1, 2, 3, 4, 5}\nint rotate_dice[4][6] = \n{\n {2, 1, 5, 0, 4, 3}, // to E\n {4, 0, 2, 3, 5, 1}, // to N\n {1, 5, 2, 3, 0, 4}, // to S\n {3, 1, 0, 5, 4, 2} // to W\n};\n\nbool isvalid(const array<int, 6> &vec)\n{\n if (vec[0] < 0) return false;\n int sum = accumulate(vec.begin(), vec.end(), 0);\n \n if (2 * vec[0] + 2 * vec[5] > sum) return false;\n if (2 * vec[1] + 2 * vec[4] - 1 > sum) return false;\n if (2 * vec[2] + 2 * vec[3] - 1 > sum) return false;\n \n return true;\n}\n\nbool is_zero(const array<int, 6> &dice)\n{\n for (uint i = 0; i < 6; ++i)\n {\n if (dice[i] != 0) return false;\n }\n return true;\n}\n\n\nvector<int> global_vec(30000 + 100);\n\nbool dfs(int depth, array<int, 6> dice)\n{\n if (depth == 0) return true;\n \n for (uint dir = 0; dir < 4; ++dir)\n {\n array<int, 6> ndice = dice;\n for (int j = 0; j < 6; ++j) ndice[j] = dice[rotate_dice[dir][j]];\n ndice[0] -= 1;\n \n if (!isvalid(ndice)) continue;\n \n global_vec[depth] = dir;\n if (dfs(depth - 1, ndice)) return true;\n // global_vec.pop_back();\n }\n \n return false;\n}\n\n\nvoid solve()\n{\n array<int, 6> T;\n for (uint i = 0; i < 6; ++i) cin >> T[i];\n if (T[5] == 0)\n {\n is_end = true;\n return;\n }\n int P, Q; cin >> P >> Q;\n P--, Q--;\n \n int sum = accumulate(T.begin(), T.end(), 0);\n \n string res = \"Z\";\n do\n {\n \n if (dfs(sum, T))\n {\n string tmp = \"\";\n for (uint i = sum; i > 0; --i)\n {\n tmp += ENSW[global_vec[i]];\n }\n chmin(res, tmp);\n }\n \n } while (next_permutation(T.begin(), T.end()));\n \n if (res == \"Z\") cout << \"impossible\" << endl;\n else\n {\n string ans = res.substr(P, Q + 1 - P);\n cout << ans << endl;\n // cerr << -1 << endl;\n // cout << res << endl;\n }\n \n return;\n}\n\nint main()\n{\n while (!is_end)\n {\n solve();\n }\n \n return 0;\n}","accuracy":1,"time_ms":1540,"memory_kb":6696,"score_of_the_acc":-1.163,"final_rank":20},{"submission_id":"aoj_1197_9070212","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\nconst string op = \"ENSW\";\nusing dice = array<int, 6>;\nenum { l, r, f, b, d, u };\nconst vector<dice> g = {\n {d, u, f, b, r, l},\n {l, r, d, u, b, f},\n {l, r, u, d, f, b},\n {u, d, f, b, l, r}\n};\n\nstring solve(dice t) {\n sort(t);\n const int len = accumulate(t.begin(), t.end(), 0);\n string ans(len, 'Z');\n\n auto check = [&](dice& x) -> bool {\n for(int i : rep(6)) if(x[i] < 0) return false;\n int sum = accumulate(x.begin(), x.end(), 0);\n return x[0] + x[1] <= sum - (x[0] + x[1]) + 1\n and x[2] + x[3] <= sum - (x[2] + x[3]) + 1\n and x[4] + x[5] <= sum - (x[4] + x[5]) + 0;\n };\n\n do {\n if(check(t)) {\n string s = \"\";\n dice x = t;\n while(x != dice{}) {\n for(int k : rep(4)) {\n dice nx;\n for(int i : rep(6)) nx[i] = x[g[k][i]];\n nx[4] -= 1;\n if(check(nx)) {\n s += op[k];\n x = move(nx);\n break;\n }\n }\n }\n chmin(ans, s);\n }\n } while(next_permutation(t.begin(), t.end()));\n\n int p = in(), q = in(); p--;\n if(ans[0] == 'Z') return \"impossible\";\n return move(ans.substr(p, q - p));\n}\n\nint main() {\n while(true) {\n dice t;\n for(int i : rep(6)) t[i] = in();\n if(t == dice{}) return 0;\n print(solve(t));\n }\n}","accuracy":1,"time_ms":1570,"memory_kb":3504,"score_of_the_acc":-0.2387,"final_rank":12},{"submission_id":"aoj_1197_9070202","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\nconst string op = \"ENSW\";\nenum { l, r, f, b, d, u };\nconst vector<vector<int>> g = {\n {d, u, f, b, r, l},\n {l, r, d, u, b, f},\n {l, r, u, d, f, b},\n {u, d, f, b, l, r}\n};\n\nstring solve(vector<int> t) {\n sort(t);\n const int len = accumulate(t.begin(), t.end(), 0);\n string ans(len, 'Z');\n\n auto check = [&](vector<int>& x) -> bool {\n for(int i : rep(6)) if(x[i] < 0) return false;\n int sum = accumulate(x.begin(), x.end(), 0);\n return x[0] + x[1] <= sum - (x[0] + x[1]) + 1\n and x[2] + x[3] <= sum - (x[2] + x[3]) + 1\n and x[4] + x[5] <= sum - (x[4] + x[5]) + 0;\n };\n\n do {\n if(check(t)) {\n string s = \"\";\n vector<int> x = t;\n while(x != vector(6, 0)) {\n for(int k : rep(4)) {\n vector<int> nx(6);\n for(int i : rep(6)) nx[i] = x[g[k][i]];\n nx[4] -= 1;\n if(check(nx)) {\n s += op[k];\n x = move(nx);\n break;\n }\n }\n }\n chmin(ans, s);\n }\n } while(next_permutation(t.begin(), t.end()));\n\n int p = in(), q = in(); p--;\n if(ans[0] == 'Z') return \"impossible\";\n return move(ans.substr(p, q - p));\n}\n\nint main() {\n while(true) {\n vector<int> t = in(6);\n if(t == vector<int>(6, 0)) return 0;\n print(solve(t));\n }\n}","accuracy":1,"time_ms":6360,"memory_kb":3492,"score_of_the_acc":-0.9932,"final_rank":18},{"submission_id":"aoj_1197_9035374","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;\n\nbool check(vector<int> mass) {\n bool ok = true;\n if(mass[0]+mass[1] > mass[2]+mass[3]+mass[4]+mass[5]) ok = false;\n if(mass[2]+mass[3]-1 > mass[0]+mass[1]+mass[4]+mass[5]) ok = false;\n if(mass[4]+mass[5]-1 > mass[0]+mass[1]+mass[2]+mass[3]) ok = false;\n return ok;\n}\nint main(void) {\n cin.tie(0);\n ios::sync_with_stdio(0);\n vector<char> dir = {'E', 'N', 'S', 'W'};\n\n while(1) {\n string min_ans = \"\";\n vector<int> mass(6);\n rep(i, 0, 6) cin >> mass[i];\n bool end = true;\n rep(i, 0, 6) if(mass[i] != 0) end = false;\n if(end) break;\n int ans_l = 0;\n rep(i, 0, 6) ans_l += mass[i];\n do {\n string ans = \"\";\n vector<int> n_mass(6);\n rep(i, 0, 6) n_mass[i] = mass[i];\n\n if(!check(n_mass)) continue;\n while(1) {\n bool end = true;\n rep(i, 0, 6) if(n_mass[i] != 0) end = false;\n if(end) {\n if(min_ans == \"\") min_ans = ans;\n else if(min_ans > ans) min_ans = ans;\n break;\n }\n if(!check(n_mass)) break;\n rep(i, 0, 4) {\n vector<int> nv;\n if(i==0 and n_mass[2] != 0) {\n nv = {n_mass[2]-1, n_mass[3], n_mass[1], n_mass[0], n_mass[4], n_mass[5]};\n if(check(nv)) {\n swap(n_mass, nv);\n ans.push_back(dir[i]);\n break;\n }\n }\n else if(i==1 and n_mass[4] != 0) {\n nv = {n_mass[4]-1, n_mass[5], n_mass[2], n_mass[3], n_mass[1], n_mass[0]};\n if(check(nv)) {\n swap(n_mass, nv);\n ans.push_back(dir[i]);\n break;\n }\n }\n else if(i==2 and n_mass[5] != 0) {\n nv = {n_mass[5]-1, n_mass[4], n_mass[2], n_mass[3], n_mass[0], n_mass[1]};\n if(check(nv)) {\n swap(n_mass, nv);\n ans.push_back(dir[i]);\n break;\n }\n }\n else if(i==3 and n_mass[3] != 0) {\n nv = {n_mass[3]-1, n_mass[2], n_mass[0], n_mass[1], n_mass[4], n_mass[5]};\n if(check(nv)) {\n swap(n_mass, nv);\n ans.push_back(dir[i]);\n break;\n }\n }\n \n }\n }\n } while(next_permutation(mass.begin(), mass.end()));\n // cout << endl << endl << min_ans << endl;\n int p, q;\n cin >> p >> q;\n if(min_ans == \"\") {\n cout << \"impossible\" << endl;\n continue;\n }\n for(int i=p-1; i<q; i++) cout << min_ans[i];\n cout << endl;\n }\n}","accuracy":1,"time_ms":6830,"memory_kb":3548,"score_of_the_acc":-1.0838,"final_rank":19},{"submission_id":"aoj_1197_7984127","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 >= (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\n#define debug(...) \\\n std::cerr << \"LINE: \" << __LINE__ << \" [\" << #__VA_ARGS__ << \"]:\", \\\n debug_out(__VA_ARGS__)\n\nvoid debug_out() {\n std::cerr << std::endl;\n}\n\ntemplate <typename Head, typename... Tail> void debug_out(Head h, Tail... t) {\n std::cerr << \" \" << h;\n if (sizeof...(t) > 0) std::cerr << \" :\";\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 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\ntypedef std::string::const_iterator State;\n\nbool expect(State &begin, char expected) {\n return *begin == expected;\n}\n\nvoid consume(State &begin, char expected) {\n assert(*begin == expected);\n begin++;\n}\n\nbool isdigit(char c) {\n return '0' <= c && c <= '9';\n}\n\nbool isAlpha(char c) {\n return 'A' <= c && c <= 'Z';\n}\n\nbool isalpha(char c) {\n return 'a' <= c && c <= 'z';\n}\n\nstruct Dice {\n int up = 0, front = 1, right = 2, left = 3, back = 4, down = 5;\n\n Dice() = default;\n\n void setval(const std::vector<int> &_val) {\n assert(int(_val.size()) == 6);\n val = _val;\n }\n\n // y++\n void rollN() {\n int buff = down;\n down = back;\n back = up;\n up = front;\n front = buff;\n }\n\n // y--\n void rollS() {\n int buff = down;\n down = front;\n front = up;\n up = back;\n back = buff;\n }\n\n // x++\n void rollE() {\n int buff = down;\n down = right;\n right = up;\n up = left;\n left = buff;\n }\n\n // x--\n void rollW() {\n int buff = down;\n down = left;\n left = up;\n up = right;\n right = buff;\n }\n\n // 右回転(時計回り)\n void rollR() {\n int buff = right;\n right = back;\n back = left;\n left = front;\n front = buff;\n }\n\n // 左回転(反時計回り)\n void rollL() {\n int buff = left;\n left = back;\n back = right;\n right = front;\n front = buff;\n }\n\n void roll(char c) {\n if (c == 'N')\n rollN();\n else if (c == 'S')\n rollS();\n else if (c == 'E')\n rollE();\n else if (c == 'W')\n rollW();\n else if (c == 'R')\n rollR();\n else if (c == 'L')\n rollL();\n else\n assert(0);\n }\n\n int get_index(int x) const {\n for (int i = 0; i < 6; i++) {\n if (val[i] == x) return i;\n }\n assert(0);\n }\n\n std::vector<Dice> makeDice() const {\n std::vector<Dice> ret;\n for (int i = 0; i < 6; i++) {\n Dice d(*this);\n if (i == 1) d.rollN();\n if (i == 2) d.rollS();\n if (i == 3) {\n d.rollS();\n d.rollS();\n }\n if (i == 4) d.rollL();\n if (i == 5) d.rollR();\n for (int j = 0; j < 4; j++) {\n ret.emplace_back(d);\n d.rollE();\n }\n }\n return ret;\n }\n\n int top_val() const {\n return val[up];\n }\n\n int right_val() const {\n return val[right];\n }\n\n int left_val() const {\n return val[left];\n }\n\n int front_val() const {\n return val[front];\n }\n\n int back_val() const {\n return val[back];\n }\n\n int down_val() const {\n return val[down];\n }\n\n std::vector<int> now() const {\n std::vector<int> ret(6);\n ret[0] = top_val();\n ret[1] = front_val();\n ret[2] = right_val();\n ret[3] = left_val();\n ret[4] = back_val();\n ret[5] = down_val();\n return ret;\n }\n\n std::vector<int> val = {0, 1, 2, 3, 4, 5};\n};\n\nbool input(std::vector<int> &t) {\n int zero = 0;\n rep(i,0,6) {\n std::cin >> t[i];\n if(t[i] == 0) zero++;\n }\n if(zero == 6) return false;\n return true;\n}\n\nint main() {\n std::vector<int> t(6);\n while(input(t)) {\n int sum = 0;\n rep(i,0,6) sum += t[i];\n int p,q;\n std::cin >> p >> q;\n p--;\n std::vector<int> idxs(6);\n std::iota(all(idxs), 0);\n std::string ans = \"\";\n do {\n std::vector<int> val(6);\n rep(i,0,6) val[i] = t[idxs[i]];\n Dice dice;\n dice.setval(val);\n auto check = [&]() -> bool {\n int na = dice.top_val() + dice.down_val();\n int nb = dice.left_val() + dice.right_val();\n int nc = dice.front_val() + dice.back_val();\n return dice.top_val() >= 0 && na <= nb + nc && nb <= 1 + nc + na && nc <= 1 + na + nb;\n };\n if(!check()) {\n continue;\n }\n std::string s = \"\";\n rep(_,0,sum) {\n {\n dice.rollE();\n dice.val[dice.up]--;\n if(check()) {\n s += 'E';\n continue;\n }\n dice.val[dice.up]++;\n dice.rollW();\n }\n {\n dice.rollN();\n dice.val[dice.up]--;\n if(check()) {\n s += 'N';\n continue;\n }\n dice.val[dice.up]++;\n dice.rollS();\n }\n {\n dice.rollS();\n dice.val[dice.up]--;\n if(check()) {\n s += 'S';\n continue;\n }\n dice.val[dice.up]++;\n dice.rollN();\n } {\n dice.rollW();\n dice.val[dice.up]--;\n if(check()) {\n s += 'W';\n continue;\n }\n dice.val[dice.up]++;\n dice.rollE();\n }\n assert(0);\n }\n if(ans.empty()) ans = s;\n else chmin(ans, s);\n } while(std::next_permutation(all(idxs)));\n if(ans.empty()) {\n std::cout << \"impossible\\n\";\n continue;\n }\n std::cout << ans.substr(p, q-p) << '\\n';\n }\n}","accuracy":1,"time_ms":640,"memory_kb":3468,"score_of_the_acc":-0.0811,"final_rank":3},{"submission_id":"aoj_1197_6021158","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\ntemplate<typename T = int>\nstruct Die {\n array<T, 6> fs;\n int& top() { return fs[0]; }\n int& south() { return fs[1]; }\n int& east() { return fs[2]; }\n int& west() { return fs[3]; }\n int& north() { return fs[4]; }\n int& bottom() { return fs[5]; }\n\n int sum() { return fs[0] + fs[1] + fs[2] + fs[3] + fs[4] + fs[5]; }\n\n void roll(char c) {\n //the view from above\n // N\n //W E\n // S\n string b(\"EWNSRL\");\n int v[6][4] = { {0,3,5,2},\n {0,2,5,3},\n {0,1,5,4},\n {0,4,5,1},\n {1,2,4,3},\n {1,3,4,2} };\n for (int k = 0; k < 6; k++) {\n if (b[k] != c) continue;\n int t = fs[v[k][0]];\n fs[v[k][0]] = fs[v[k][1]];\n fs[v[k][1]] = fs[v[k][2]];\n fs[v[k][2]] = fs[v[k][3]];\n fs[v[k][3]] = t;\n break;\n }\n }\n using ll = long long;\n ll hash() {\n ll res = 0;\n for (int i = 0; i < 6; i++) res = res * 256 + fs[i];\n return res;\n }\n bool operator==(const Die& d) const {\n for (int i = 0; i < 6; i++) if (fs[i] != d.fs[i]) return 0;\n return 1;\n }\n};\n\ntemplate<typename T>\nvector<Die<T>> makeDice(Die<T> d) {\n vector<Die<T>> res;\n for (int i = 0; i < 6; i++) {\n Die t(d);\n if (i == 1) t.roll('N');\n if (i == 2) t.roll('S');\n if (i == 3) t.roll('S'), t.roll('S');\n if (i == 4) t.roll('L');\n if (i == 5) t.roll('R');\n for (int k = 0; k < 4; k++) {\n res.emplace_back(t);\n t.roll('E');\n }\n }\n return res;\n}\n\nstring rotates(\"ENSW\");\nbool is_valid(Die<int>& die) {\n int sum = die.sum();\n if (sum == 0) return true;\n if (sum % 2 == 1) {\n for (var&& c : rotates) {\n var nxt = die;\n nxt.roll(c);\n if (nxt.bottom() == 0) continue;\n nxt.bottom()--;\n if (is_valid(nxt)) return true;\n }\n return false;\n }\n\n int X = die.fs[2] + die.fs[3];\n int Y = die.fs[1] + die.fs[4];\n int Z = die.fs[0] + die.fs[5];\n\n if (X > Y) swap(Y, X);\n if (X + Y < Z) return true;\n if (Z < Y - X) return false;\n Z -= Y - X;\n\n return Z % 2 == 0;\n}\n\nbool solve() {\n vector<int> t(6);\n for (var&& elem : t) cin >> elem;\n var sum = accumulate(t.begin(), t.end(), 0);\n if (sum == 0) return false;\n int p, q;\n cin >> p >> q;\n\n string res;\n\n sort(t.begin(), t.end());\n do\n {\n Die die;\n for (int i = 0; i < t.size(); i++) die.fs[i] = t[i];\n \n // if (die.bottom() == 0) continue;\n // die.bottom()--;\n\n bool same = res.size() == sum;\n\n string cur_res = \"\";\n for (int cnt = 0; cnt < sum; cnt++) {\n for (var c : rotates) {\n // 枝刈り\n if (same && res[cnt] < c) break;\n\n var nxt = die;\n nxt.roll(c);\n if (nxt.bottom() == 0) continue;\n nxt.bottom()--;\n\n if (is_valid(nxt)) {\n die = nxt;\n cur_res += c;\n if (same && cur_res[cnt] < res[cnt]) same = false;\n goto end;\n }\n }\n break;\n end:;\n }\n\n if (cur_res.size() != sum) continue;\n res = cur_res;\n\n } while (next_permutation(t.begin(), t.end()));\n\n if (res == \"\") {\n cout << \"impossible\" << endl;\n }\n else {\n cout << res.substr(p - 1, q - p + 1) << endl;\n }\n\n \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":1340,"memory_kb":3428,"score_of_the_acc":-0.1802,"final_rank":10},{"submission_id":"aoj_1197_6020837","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\nbool is_opposite[6][6];\n\ntemplate<typename T = int>\nstruct Die {\n array<T, 6> fs;\n int& top() { return fs[0]; }\n int& south() { return fs[1]; }\n int& east() { return fs[2]; }\n int& west() { return fs[3]; }\n int& north() { return fs[4]; }\n int& bottom() { return fs[5]; }\n\n int sum() { return fs[0] + fs[1] + fs[2] + fs[3] + fs[4] + fs[5]; }\n\n void roll(char c) {\n //the view from above\n // N\n //W E\n // S\n string b(\"EWNSRL\");\n int v[6][4] = { {0,3,5,2},\n {0,2,5,3},\n {0,1,5,4},\n {0,4,5,1},\n {1,2,4,3},\n {1,3,4,2} };\n for (int k = 0; k < 6; k++) {\n if (b[k] != c) continue;\n int t = fs[v[k][0]];\n fs[v[k][0]] = fs[v[k][1]];\n fs[v[k][1]] = fs[v[k][2]];\n fs[v[k][2]] = fs[v[k][3]];\n fs[v[k][3]] = t;\n break;\n }\n }\n using ll = long long;\n ll hash() {\n ll res = 0;\n for (int i = 0; i < 6; i++) res = res * 256 + fs[i];\n return res;\n }\n bool operator==(const Die& d) const {\n for (int i = 0; i < 6; i++) if (fs[i] != d.fs[i]) return 0;\n return 1;\n }\n};\n\ntemplate<typename T>\nvector<Die<T>> makeDice(Die<T> d) {\n vector<Die<T>> res;\n for (int i = 0; i < 6; i++) {\n Die t(d);\n if (i == 1) t.roll('N');\n if (i == 2) t.roll('S');\n if (i == 3) t.roll('S'), t.roll('S');\n if (i == 4) t.roll('L');\n if (i == 5) t.roll('R');\n for (int k = 0; k < 4; k++) {\n res.emplace_back(t);\n t.roll('E');\n }\n }\n return res;\n}\n\nbool check(array<int, 6>& x) {\n int Z = x[0] + x[5];\n int Y = x[1] + x[4];\n int X = x[2] + x[3];\n\n if (X > Y) swap(Y, X);\n\n if (X + Y < Z) return true;\n\n if (Z < Y - X) return false;\n\n Z -= Y - X;\n\n return Z % 2 == 0;\n}\n\nstring rotates(\"ENSW\");\nbool is_valid(Die<int>& die) {\n int sum = die.sum();\n if (sum == 0) return true;\n if (sum % 2 == 1) {\n for (var&& c : rotates) {\n var nxt = die;\n nxt.roll(c);\n if (nxt.bottom() == 0) continue;\n nxt.bottom()--;\n if (is_valid(nxt)) return true;\n }\n return false;\n }\n\n return check(die.fs);\n\n int fst = 0;\n int fstInd = -1;\n int snd = 0;\n int sndInd = -1;\n for (int i = 0; i < 6; i++) {\n if (fst <= die.fs[i]) {\n snd = fst;\n sndInd = fstInd;\n fst = die.fs[i];\n fstInd = i;\n }\n else if (snd <= die.fs[i]) {\n snd = die.fs[i];\n sndInd = i;\n }\n }\n\n assert(sndInd != -1);\n \n if (not is_opposite[fstInd][sndInd]) return true;\n if (fst + snd <= sum / 2) return true;\n return false;\n}\n\nbool solve() {\n vector<int> t(6);\n for (var&& elem : t) cin >> elem;\n var sum = accumulate(t.begin(), t.end(), 0);\n if (sum == 0) return false;\n int p, q;\n cin >> p >> q;\n\n string res;\n\n sort(t.begin(), t.end());\n do\n {\n Die die;\n for (int i = 0; i < t.size(); i++) die.fs[i] = t[i];\n \n // if (die.bottom() == 0) continue;\n // die.bottom()--;\n\n bool same = res.size() == sum;\n\n string cur_res = \"\";\n for (int cnt = 0; cnt < sum; cnt++) {\n for (var c : rotates) {\n // 枝刈り\n if (same && res[cnt] < c) break;\n\n var nxt = die;\n nxt.roll(c);\n if (nxt.bottom() == 0) continue;\n nxt.bottom()--;\n\n if (is_valid(nxt)) {\n die = nxt;\n cur_res += c;\n if (same && cur_res[cnt] < res[cnt]) same = false;\n goto end;\n }\n }\n break;\n end:;\n }\n\n if (cur_res.size() != sum) continue;\n res = cur_res;\n\n } while (next_permutation(t.begin(), t.end()));\n\n if (res == \"\") {\n cout << \"impossible\" << endl;\n }\n else {\n cout << res.substr(p - 1, q - p + 1) << endl;\n }\n\n \n return true;\n}\n\nint main() {\n is_opposite[0][5] = true;\n is_opposite[5][0] = true;\n\n is_opposite[1][4] = true;\n is_opposite[4][1] = true;\n\n is_opposite[2][3] = true;\n is_opposite[3][2] = true;\n\n\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n while (solve()){}\n}","accuracy":1,"time_ms":1320,"memory_kb":3476,"score_of_the_acc":-0.191,"final_rank":11},{"submission_id":"aoj_1197_5978745","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nstruct Dice {\n std::array<int, 6> surface;\n\n Dice(int TOP = 1, int FRONT = 2) {\n assert(1 <= TOP and TOP <= 6);\n assert(1 <= FRONT and FRONT <= 6);\n assert(TOP + FRONT != 7);\n surface[0] = TOP;\n surface[1] = FRONT;\n surface[2] = dice[TOP - 1][FRONT - 1];\n surface[3] = 7 - surface[2];\n surface[4] = 7 - surface[1];\n surface[5] = 7 - surface[0];\n }\n\n Dice(const std::vector<int>& v) {\n assert(v.size() == 6);\n for (size_t i = 0; i < 6; i++) surface[i] = v[i];\n }\n\n const int& top() const { return surface[0]; }\n const int& front() const { return surface[1]; }\n const int& right() const { return surface[2]; }\n const int& left() const { return surface[3]; }\n const int& back() const { return surface[4]; }\n const int& bottom() const { return surface[5]; }\n const int& operator[](int k) const { return surface[k]; }\n\n int& top() { return surface[0]; }\n int& front() { return surface[1]; }\n int& right() { return surface[2]; }\n int& left() { return surface[3]; }\n int& back() { return surface[4]; }\n int& bottom() { return surface[5]; }\n int& operator[](int k) { return surface[k]; }\n\n bool operator==(const Dice& d) const { return surface == d.surface; }\n bool operator!=(const Dice& d) const { return surface != d.surface; }\n bool operator<(const Dice& d) const { return surface < d.surface; }\n\n int roll(int k) { // x++, x--, y++, y--, turn right, turn left\n assert(0 <= k and k < 6);\n int tmp = surface[code[k][0]];\n for (int i = 0; i < 3; i++) surface[code[k][i]] = surface[code[k][i + 1]];\n surface[code[k][3]] = tmp;\n return surface[0];\n }\n\n int rollc(char c) {\n for (int k = 0; k < 6; k++) {\n if (direction[k] != c) continue;\n return roll(k);\n }\n assert(false);\n }\n\n int hash() const {\n int res = 0;\n for (size_t i = 0; i < 6; i++) {\n assert(1 <= surface[i] and surface[i] <= 6);\n (res *= 6) += surface[i] - 1;\n }\n return res;\n }\n\n std::vector<Dice> make_all() {\n std::vector<Dice> res;\n for (int i = 0; i < 6; i++) {\n Dice d(*this);\n if (i == 1) d.roll(2);\n if (i == 2) d.roll(3);\n if (i == 3) d.roll(3), d.roll(3);\n if (i == 4) d.roll(5);\n if (i == 5) d.roll(4);\n for (int j = 0; j < 4; j++) {\n res.emplace_back(d);\n d.roll(0);\n }\n }\n return res;\n }\n\n Dice identifier() {\n auto dices = make_all();\n return *min_element(dices.begin(), dices.end());\n }\n\nprivate:\n const int dice[6][6] = {{0, 3, 5, 2, 4, 0}, {4, 0, 1, 6, 0, 3}, {2, 6, 0, 0, 1, 5},\n {5, 1, 0, 0, 6, 2}, {3, 0, 6, 1, 0, 4}, {0, 4, 2, 5, 3, 0}};\n const int code[6][4] = {{0, 3, 5, 2}, {0, 2, 5, 3}, {0, 1, 5, 4}, {0, 4, 5, 1}, {1, 2, 4, 3}, {1, 3, 4, 2}};\n const char direction[6] = {'E', 'W', 'N', 'S', 'R', 'L'};\n};\n\n/**\n * @brief Dice\n * @docs docs/util/Dice.md\n */\n\nconst string directions = \"EWNS\";\n\nvoid solve(vector<int> t) {\n string ans = \"\";\n sort(t.begin(), t.end());\n int sum = accumulate(t.begin(), t.end(), 0);\n\n do {\n Dice dice(t);\n string cur = \"\";\n bool update = true;\n for (int rest = sum - 1; rest >= 0 and exchange(update, false); rest--) {\n for (int dir : {0, 2, 3, 1}) {\n dice.roll(dir);\n dice.bottom()--;\n bool ok = true;\n if (dice.bottom() < 0) ok = false;\n for (int i = 0; i < 3; i++) {\n int opposite = dice[i] + dice[5 - i];\n if (opposite > rest - opposite + (i > 0)) ok = false;\n }\n if (ok) {\n update = true;\n cur += directions[dir];\n break;\n }\n dice.bottom()++;\n dice.roll(dir ^ 1);\n }\n }\n if (!update) continue;\n if (ans == \"\")\n ans = cur;\n else\n ans = min(ans, cur);\n } while (next_permutation(t.begin(), t.end()));\n\n int p, q;\n cin >> p >> q;\n if (ans == \"\") {\n cout << \"impossible\" << '\\n';\n return;\n }\n for (int i = --p; i < q; i++) cout << ans[i];\n cout << '\\n';\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n vector<int> t(6);\n while (1) {\n for (int i = 0; i < 6; i++) cin >> t[i];\n if (t.back() == 0) break;\n solve(t);\n }\n return 0;\n}","accuracy":1,"time_ms":960,"memory_kb":3484,"score_of_the_acc":-0.1364,"final_rank":4},{"submission_id":"aoj_1197_5978741","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 <array>\n#include <cassert>\n#include <string>\n#include <vector>\n\nstruct Dice {\n std::array<int, 6> surface;\n\n Dice(int TOP = 1, int FRONT = 2) {\n assert(1 <= TOP and TOP <= 6);\n assert(1 <= FRONT and FRONT <= 6);\n assert(TOP + FRONT != 7);\n surface[0] = TOP;\n surface[1] = FRONT;\n surface[2] = dice[TOP - 1][FRONT - 1];\n surface[3] = 7 - surface[2];\n surface[4] = 7 - surface[1];\n surface[5] = 7 - surface[0];\n }\n\n Dice(const std::vector<int>& v) {\n assert(v.size() == 6);\n for (size_t i = 0; i < 6; i++) surface[i] = v[i];\n }\n\n const int& top() const { return surface[0]; }\n const int& front() const { return surface[1]; }\n const int& right() const { return surface[2]; }\n const int& left() const { return surface[3]; }\n const int& back() const { return surface[4]; }\n const int& bottom() const { return surface[5]; }\n const int& operator[](int k) const { return surface[k]; }\n\n int& top() { return surface[0]; }\n int& front() { return surface[1]; }\n int& right() { return surface[2]; }\n int& left() { return surface[3]; }\n int& back() { return surface[4]; }\n int& bottom() { return surface[5]; }\n int& operator[](int k) { return surface[k]; }\n\n bool operator==(const Dice& d) const { return surface == d.surface; }\n bool operator!=(const Dice& d) const { return surface != d.surface; }\n bool operator<(const Dice& d) const { return surface < d.surface; }\n\n int roll(int k) { // x++, x--, y++, y--, turn right, turn left\n assert(0 <= k and k < 6);\n int tmp = surface[code[k][0]];\n for (int i = 0; i < 3; i++) surface[code[k][i]] = surface[code[k][i + 1]];\n surface[code[k][3]] = tmp;\n return surface[0];\n }\n\n int rollc(char c) {\n for (int k = 0; k < 6; k++) {\n if (direction[k] != c) continue;\n return roll(k);\n }\n assert(false);\n }\n\n int hash() const {\n int res = 0;\n for (size_t i = 0; i < 6; i++) {\n assert(1 <= surface[i] and surface[i] <= 6);\n (res *= 6) += surface[i] - 1;\n }\n return res;\n }\n\n std::vector<Dice> make_all() {\n std::vector<Dice> res;\n for (int i = 0; i < 6; i++) {\n Dice d(*this);\n if (i == 1) d.roll(2);\n if (i == 2) d.roll(3);\n if (i == 3) d.roll(3), d.roll(3);\n if (i == 4) d.roll(5);\n if (i == 5) d.roll(4);\n for (int j = 0; j < 4; j++) {\n res.emplace_back(d);\n d.roll(0);\n }\n }\n return res;\n }\n\n Dice identifier() {\n auto dices = make_all();\n return *min_element(dices.begin(), dices.end());\n }\n\nprivate:\n const int dice[6][6] = {{0, 3, 5, 2, 4, 0}, {4, 0, 1, 6, 0, 3}, {2, 6, 0, 0, 1, 5},\n {5, 1, 0, 0, 6, 2}, {3, 0, 6, 1, 0, 4}, {0, 4, 2, 5, 3, 0}};\n const int code[6][4] = {{0, 3, 5, 2}, {0, 2, 5, 3}, {0, 1, 5, 4}, {0, 4, 5, 1}, {1, 2, 4, 3}, {1, 3, 4, 2}};\n const char direction[6] = {'E', 'W', 'N', 'S', 'R', 'L'};\n};\n\n/**\n * @brief Dice\n * @docs docs/util/Dice.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 long long MOD = 1000000007;\n// const long long MOD = 998244353;\n\nconst string directions = \"EWNS\";\n\nvoid solve(vector<int> t) {\n string ans = \"\";\n sort(t.begin(), t.end());\n int sum = accumulate(t.begin(), t.end(), 0);\n\n do {\n Dice dice(t);\n string cur = \"\";\n bool update = true;\n for (int rest = sum - 1; rest >= 0 and exchange(update, false); rest--) {\n for (int dir : {0, 2, 3, 1}) {\n dice.roll(dir);\n dice.bottom()--;\n bool ok = true;\n if (dice.bottom() < 0) ok = false;\n for (int i = 0; i < 3; i++) {\n int opposite = dice[i] + dice[5 - i];\n if (opposite > rest - opposite + (i > 0)) ok = false;\n }\n if (ok) {\n update = true;\n cur += directions[dir];\n break;\n }\n dice.bottom()++;\n dice.roll(dir ^ 1);\n }\n }\n if (!update) continue;\n if (ans == \"\")\n ans = cur;\n else\n ans = min(ans, cur);\n } while (next_permutation(t.begin(), t.end()));\n\n int p, q;\n cin >> p >> q;\n if (ans == \"\") {\n cout << \"impossible\" << '\\n';\n return;\n }\n for (int i = --p; i < q; i++) cout << ans[i];\n cout << '\\n';\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n vector<int> t(6);\n while (1) {\n for (int i = 0; i < 6; i++) cin >> t[i];\n if (t.back() == 0) break;\n solve(t);\n }\n return 0;\n}","accuracy":1,"time_ms":970,"memory_kb":3560,"score_of_the_acc":-0.1601,"final_rank":6},{"submission_id":"aoj_1197_5970955","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }\n#define all(x) (x).begin(),(x).end()\n#define fi first\n#define se second\n#define mp make_pair\n#define si(x) int(x.size())\nconst int mod=1000000007,MAX=200005,INF=1<<30;\n\nstruct dice{\n int u,f,r,b,l,d;\n \n void init(int uu,int ff,int rr,int bb,int ll,int dd){\n u=uu;\n f=ff;\n r=rr;\n b=bb;\n l=ll;\n d=dd;\n }\n \n void init(vector<int> S){\n init(S[0],S[1],S[2],S[3],S[4],S[5]);\n }\n \n void turnE(){\n int save=r;\n r=u;\n u=l;\n l=d;\n d=save;\n }\n \n void turnN(){\n int save=b;\n b=u;\n u=f;\n f=d;\n d=save;\n }\n \n void turnS(){\n int save=f;\n f=u;\n u=b;\n b=d;\n d=save;\n }\n \n void turnW(){\n int save=l;\n l=u;\n u=r;\n r=d;\n d=save;\n }\n \n bool check(){\n int x=l+r,y=f+b,z=u+d;\n if(d<0) return false;\n if(x==0&&y==0&z==0) return true;\n if(x>=y&&x>=z){\n if(x<=y+z+1) return true;\n else return false;\n }\n if(y>=x&&y>=z){\n if(y<=x+z+1) return true;\n else return false;\n }\n if(z>=x&&z>=y){\n if(z<=x+y) return true;\n else return false;\n }\n return false;\n }\n};\n\nint main(){\n \n std::ifstream in(\"text.txt\");\n std::cin.rdbuf(in.rdbuf());\n cin.tie(0);\n ios::sync_with_stdio(false);\n \n while(1){\n int sum=0;\n vector<int> S(6);\n for(int i=0;i<6;i++){\n cin>>S[i];\n sum+=S[i];\n }\n if(S.back()==0) break;\n int s,t;cin>>s>>t;s--;\n bool f=false;\n do{\n dice X;X.init(S);\n if(X.check()) f=true;\n }while(next_permutation(all(S)));\n \n if(!f){\n cout<<\"impossible\\n\";\n continue;\n }\n string ans=\"Z\";\n sort(all(S));\n \n do{\n dice X;X.init(S);\n if(!X.check()) continue;\n \n string T;\n for(int q=0;q<sum;q++){\n X.turnE();\n X.d--;\n if(X.check()){\n T+='E';\n continue;\n }else{\n X.d++;\n X.turnW();\n }\n \n X.turnN();\n X.d--;\n if(X.check()){\n T+='N';\n continue;\n }else{\n X.d++;\n X.turnS();\n }\n \n X.turnS();\n X.d--;\n if(X.check()){\n T+='S';\n continue;\n }else{\n X.d++;\n X.turnN();\n }\n \n X.turnW();\n X.d--;\n if(X.check()){\n T+='W';\n continue;\n }else{\n X.d++;\n X.turnE();\n }\n }\n \n chmin(ans,T);\n \n }while(next_permutation(all(S)));\n \n cout<<ans.substr(s,t-s)<<\"\\n\";\n }\n}","accuracy":1,"time_ms":510,"memory_kb":3308,"score_of_the_acc":-0.014,"final_rank":1},{"submission_id":"aoj_1197_5951015","code_snippet":"#include<iostream>\n#include<cstdio>\n#include<cstring>\n#include<string>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<map>\n#include<queue>\n#include<deque>\n#include<iomanip>\n#include<tuple>\n#include<cassert>\n#include<set>\n#include<complex>\n#include<numeric>\n#include<functional>\n#include<unordered_map>\n#include<unordered_set>\nusing namespace std;\ntypedef long long int LL;\ntypedef pair<int,int> P;\ntypedef pair<LL,LL> LP;\nconst int INF=1<<30;\nconst LL MAX=1e9+7;\n\nvoid array_show(int *array,int array_n,char middle=' '){\n for(int i=0;i<array_n;i++)printf(\"%d%c\",array[i],(i!=array_n-1?middle:'\\n'));\n}\nvoid array_show(LL *array,int array_n,char middle=' '){\n for(int i=0;i<array_n;i++)printf(\"%lld%c\",array[i],(i!=array_n-1?middle:'\\n'));\n}\nvoid array_show(vector<int> &vec_s,int vec_n=-1,char middle=' '){\n if(vec_n==-1)vec_n=vec_s.size();\n for(int i=0;i<vec_n;i++)printf(\"%d%c\",vec_s[i],(i!=vec_n-1?middle:'\\n'));\n}\nvoid array_show(vector<LL> &vec_s,int vec_n=-1,char middle=' '){\n if(vec_n==-1)vec_n=vec_s.size();\n for(int i=0;i<vec_n;i++)printf(\"%lld%c\",vec_s[i],(i!=vec_n-1?middle:'\\n'));\n}\ntemplate<typename T> ostream& operator<<(ostream& os,const vector<T>& v1){\n int n=v1.size();\n for(int i=0;i<n;i++){\n if(i)os<<\" \";\n os<<v1[i];\n }\n return os;\n}\ntemplate<typename T1,typename T2> ostream& operator<<(ostream& os,const pair<T1,T2>& p){\n os<<p.first<<\" \"<<p.second;\n return os;\n}\ntemplate<typename T> istream& operator>>(istream& is,vector<T>& v1){\n int n=v1.size();\n for(int i=0;i<n;i++)is>>v1[i];\n return is;\n}\ntemplate<typename T1,typename T2> istream& operator>>(istream& is,pair<T1,T2>& p){\n is>>p.first>>p.second;\n return is;\n}\n\nclass Dice{\n // 0\n //1234\n // 5\n //top:0, front:2, x:13, y:24, z:50\n static const int N=6;\n int A[N];\npublic:\n Dice(const vector<int> v1){\n assert(v1.size()>=N);\n for(int i=0;i<N;i++){\n A[i]=v1[i];\n }\n }\n\n //rotate: clockwise\n void rotateX(){//0->2->5->4->0\n swap(A[0],A[4]);\n swap(A[4],A[5]);\n swap(A[5],A[2]);\n }\n\n void rotateXrev(){\n swap(A[5],A[2]);\n swap(A[4],A[5]);\n swap(A[0],A[4]);\n }\n\n void rotateY(){//0->3->5->1\n swap(A[0],A[1]);\n swap(A[1],A[5]);\n swap(A[5],A[3]);\n }\n\n void rotateYrev(){\n swap(A[5],A[3]);\n swap(A[1],A[5]);\n swap(A[0],A[1]);\n }\n\n void rotateZ(){//1->2->3->4\n swap(A[4],A[3]);\n swap(A[3],A[2]);\n swap(A[2],A[1]);\n }\n\n void rotateZrev(){//1->2->3->4\n swap(A[2],A[1]);\n swap(A[3],A[2]);\n swap(A[4],A[3]);\n }\n\n bool check(){\n int a=0;\n for(int i=0;i<N;i++){\n if(A[i]<0)return false;\n a+=A[i];\n }\n if((A[0]+A[5])*2>a)return false;\n if((A[1]+A[3])*2-1>a)return false;\n if((A[2]+A[4])*2-1>a)return false;\n return true;\n }\n\n string calc(){\n string sa=\"ENSW\",ss=\"\";\n int i,j;\n while(1){\n for(i=0;i<4;i++){\n if(i==0)rotateX();\n if(i==1)rotateY();\n if(i==2)rotateYrev();\n if(i==3)rotateXrev();\n A[5]--;\n if(check())break;\n A[5]++;\n if(i==0)rotateXrev();\n if(i==1)rotateYrev();\n if(i==2)rotateY();\n if(i==3)rotateX();\n }\n if(A[5]<0 || i==4)return \"impossible\";\n ss.push_back(sa[i]);\n for(i=0;i<N;i++){\n if(A[i]>0)break;\n }\n if(i==N)return ss;\n }\n }\n\n\n template<typename T> T hash(int base){\n T s=0;\n for(int i=0;i<N;i++){\n s*=base;\n s+=A[i];\n }\n return s;\n }\n\n template<typename T> vector<T> all_hash(int base){\n int i,j;\n vector<T> vs;\n const int M=4;\n for(i=0;i<2*M;i++){\n if(i<M)rotateX();\n else rotateY();\n if(i>=M && i%2)continue;\n for(j=0;j<4;j++){\n rotateZ();\n vs.push_back(hash<T>(base));\n }\n }\n return vs;\n }\n};\n\n\nnamespace sol{\n const int N=6;\n string ss;\n vector<int> v1(N);\n vector<int> vi(N,-1);\n\n void dfs(int d){\n int i;\n if(d<N){\n for(i=0;i<N;i++){\n if(vi[i]!=-1)continue;\n vi[i]=d;\n dfs(d+1);\n vi[i]=-1;\n }\n return;\n }\n vector<int> v2(N);\n for(i=0;i<N;i++){\n v2[vi[i]]=v1[i];\n }\n Dice dice(v2);\n string sa=dice.calc();\n if(sa<ss)ss=sa;\n }\n\n void solve(){\n int n,m;\n int i,j,k;\n int a,b,c;\n int p,q;\n while(cin>>v1){\n sort(v1.begin(),v1.end());\n if(v1.back()==0)return;\n cin>>p>>q;\n p--;\n vi.assign(N,-1);\n ss=\"z\";\n dfs(0);\n if(ss==\"impossible\")cout<<ss<<endl;\n else cout<<ss.substr(p,q-p)<<endl;\n }\n }\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n sol::solve();\n}","accuracy":1,"time_ms":1330,"memory_kb":3428,"score_of_the_acc":-0.1786,"final_rank":9},{"submission_id":"aoj_1197_5801779","code_snippet":"/**\n *\tauthor: nok0\n *\tcreated: 2021.06.29 22:18:07\n**/\n#ifdef LOCAL\n#define _GLIBCXX_DEBUG\n#endif\n\n#include <bits/stdc++.h>\nusing namespace std;\n#if __has_include(<atcoder/all>)\n#include <atcoder/all>\nusing namespace atcoder;\n#endif\n\n#pragma region Macros\n// rep macro\n#define foa(v, a) for(auto &v : a)\n#define REPname(a, b, c, d, e, ...) e\n#define REP(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\n#define REP0(x) for(int i = 0; i < (x); ++i)\n#define REP1(i, x) for(int i = 0; i < (x); ++i)\n#define REP2(i, l, r) for(int i = (l); i < (r); ++i)\n#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))\n#define REPSname(a, b, c, ...) c\n#define REPS(...) REPSname(__VA_ARGS__, REPS1, REPS0)(__VA_ARGS__)\n#define REPS0(x) for(int i = 1; i <= (x); ++i)\n#define REPS1(i, x) for(int i = 1; i <= (x); ++i)\n#define RREPname(a, b, c, d, e, ...) e\n#define RREP(...) RREPname(__VA_ARGS__, RREP3, RREP2, RREP1, RREP0)(__VA_ARGS__)\n#define RREP0(x) for(int i = (x)-1; i >= 0; --i)\n#define RREP1(i, x) for(int i = (x)-1; i >= 0; --i)\n#define RREP2(i, r, l) for(int i = (r)-1; i >= (l); --i)\n#define RREP3(i, r, l, c) for(int i = (r)-1; i >= (l); i -= (c))\n#define RREPSname(a, b, c, ...) c\n#define RREPS(...) RREPSname(__VA_ARGS__, RREPS1, RREPS0)(__VA_ARGS__)\n#define RREPS0(x) for(int i = (x); i >= 1; --i)\n#define RREPS1(i, x) for(int i = (x); i >= 1; --i)\n\n// name macro\n#define pb push_back\n#define eb emplace_back\n#define SZ(x) ((int)(x).size())\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n#define popcnt(x) __builtin_popcountll(x)\ntemplate <class T = int>\nusing V = std::vector<T>;\ntemplate <class T = int>\nusing VV = std::vector<std::vector<T>>;\ntemplate <class T>\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\nusing ll = long long;\nusing ld = long double;\nusing int128 = __int128_t;\nusing pii = std::pair<int, int>;\nusing pll = std::pair<long long, long long>;\n\n// input macro\ntemplate <class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\n\tis >> p.first >> p.second;\n\treturn is;\n}\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\n\tfor(T &i : v) is >> i;\n\treturn is;\n}\nstd::istream &operator>>(std::istream &is, __int128_t &a) {\n\tstd::string s;\n\tis >> s;\n\t__int128_t ret = 0;\n\tfor(int i = 0; i < s.length(); i++)\n\t\tif('0' <= s[i] and s[i] <= '9')\n\t\t\tret = 10 * ret + s[i] - '0';\n\ta = ret * (s[0] == '-' ? -1 : 1);\n\treturn is;\n}\n#if __has_include(<atcoder/all>)\nstd::istream &operator>>(std::istream &is, atcoder::modint998244353 &a) {\n\tlong long v;\n\tis >> v;\n\ta = v;\n\treturn is;\n}\nstd::istream &operator>>(std::istream &is, atcoder::modint1000000007 &a) {\n\tlong long v;\n\tis >> v;\n\ta = v;\n\treturn is;\n}\ntemplate <int m>\nstd::istream &operator>>(std::istream &is, atcoder::static_modint<m> &a) {\n\tlong long v;\n\tis >> v;\n\ta = v;\n\treturn is;\n}\ntemplate <int m>\nstd::istream &operator>>(std::istream &is, atcoder::dynamic_modint<m> &a) {\n\tlong long v;\n\tis >> v;\n\ta = v;\n\treturn is;\n}\n#endif\nnamespace scanner {\nvoid scan(int &a) { std::cin >> a; }\nvoid scan(long long &a) { std::cin >> a; }\nvoid scan(std::string &a) { std::cin >> a; }\nvoid scan(char &a) { std::cin >> a; }\nvoid scan(char a[]) { std::scanf(\"%s\", a); }\nvoid scan(double &a) { std::cin >> a; }\nvoid scan(long double &a) { std::cin >> a; }\ntemplate <class T, class U>\nvoid scan(std::pair<T, U> &p) { std::cin >> p; }\ntemplate <class T>\nvoid scan(std::vector<T> &a) { std::cin >> a; }\nvoid INPUT() {}\ntemplate <class Head, class... Tail>\nvoid INPUT(Head &head, Tail &... tail) {\n\tscan(head);\n\tINPUT(tail...);\n}\n} // namespace scanner\n#define VEC(type, name, size) \\\n\tstd::vector<type> name(size); \\\n\tscanner::INPUT(name)\n#define VVEC(type, name, h, w) \\\n\tstd::vector<std::vector<type>> name(h, std::vector<type>(w)); \\\n\tscanner::INPUT(name)\n#define INT(...) \\\n\tint __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LL(...) \\\n\tlong long __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define STR(...) \\\n\tstd::string __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define CHAR(...) \\\n\tchar __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define DOUBLE(...) \\\n\tdouble __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LD(...) \\\n\tlong double __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n\n// output-macro\ntemplate <class T, class U>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\n\tos << p.first << \" \" << p.second;\n\treturn os;\n}\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &a) {\n\tfor(int i = 0; i < int(a.size()); ++i) {\n\t\tif(i) os << \" \";\n\t\tos << a[i];\n\t}\n\treturn os;\n}\nstd::ostream &operator<<(std::ostream &dest, __int128_t &value) {\n\tstd::ostream::sentry s(dest);\n\tif(s) {\n\t\t__uint128_t tmp = value < 0 ? -value : value;\n\t\tchar buffer[128];\n\t\tchar *d = std::end(buffer);\n\t\tdo {\n\t\t\t--d;\n\t\t\t*d = \"0123456789\"[tmp % 10];\n\t\t\ttmp /= 10;\n\t\t} while(tmp != 0);\n\t\tif(value < 0) {\n\t\t\t--d;\n\t\t\t*d = '-';\n\t\t}\n\t\tint len = std::end(buffer) - d;\n\t\tif(dest.rdbuf()->sputn(d, len) != len) {\n\t\t\tdest.setstate(std::ios_base::badbit);\n\t\t}\n\t}\n\treturn dest;\n}\n#if __has_include(<atcoder/all>)\nstd::ostream &operator<<(std::ostream &os, const atcoder::modint998244353 &a) { return os << a.val(); }\nstd::ostream &operator<<(std::ostream &os, const atcoder::modint1000000007 &a) { return os << a.val(); }\ntemplate <int m>\nstd::ostream &operator<<(std::ostream &os, const atcoder::static_modint<m> &a) { return os << a.val(); }\ntemplate <int m>\nstd::ostream &operator<<(std::ostream &os, const atcoder::dynamic_modint<m> &a) { return os << a.val(); }\n#endif\ntemplate <class T>\nvoid print(const T a) { std::cout << a << '\\n'; }\ntemplate <class Head, class... Tail>\nvoid print(Head H, Tail... T) {\n\tstd::cout << H << ' ';\n\tprint(T...);\n}\ntemplate <class T>\nvoid printel(const T a) { std::cout << a << '\\n'; }\ntemplate <class T>\nvoid printel(const std::vector<T> &a) {\n\tfor(const auto &v : a)\n\t\tstd::cout << v << '\\n';\n}\ntemplate <class Head, class... Tail>\nvoid printel(Head H, Tail... T) {\n\tstd::cout << H << '\\n';\n\tprintel(T...);\n}\nvoid Yes(const bool b = true) { std::cout << (b ? \"Yes\\n\" : \"No\\n\"); }\nvoid No() { std::cout << \"No\\n\"; }\nvoid YES(const bool b = true) { std::cout << (b ? \"YES\\n\" : \"NO\\n\"); }\nvoid NO() { std::cout << \"NO\\n\"; }\nvoid err(const bool b = true) {\n\tif(b) {\n\t\tstd::cout << \"-1\\n\", exit(0);\n\t}\n}\n\n//debug macro\nnamespace debugger {\ntemplate <class T>\nvoid view(const std::vector<T> &a) {\n\tstd::cerr << \"{ \";\n\tfor(const auto &v : a) {\n\t\tstd::cerr << v << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\ntemplate <class T>\nvoid view(const std::vector<std::vector<T>> &a) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &v : a) {\n\t\tstd::cerr << \"\\t\";\n\t\tview(v);\n\t\tstd::cerr << \"\\n\";\n\t}\n\tstd::cerr << \"}\";\n}\ntemplate <class T, class U>\nvoid view(const std::vector<std::pair<T, U>> &a) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &p : a) std::cerr << \"\\t(\" << p.first << \", \" << p.second << \")\\n\";\n\tstd::cerr << \"}\";\n}\ntemplate <class T, class U>\nvoid view(const std::map<T, U> &m) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &p : m) std::cerr << \"\\t[\" << p.first << \"] : \" << p.second << \"\\n\";\n\tstd::cerr << \"}\";\n}\ntemplate <class T, class U>\nvoid view(const std::pair<T, U> &p) { std::cerr << \"(\" << p.first << \", \" << p.second << \")\"; }\ntemplate <class T>\nvoid view(const std::set<T> &s) {\n\tstd::cerr << \"{ \";\n\tfor(auto &v : s) {\n\t\tview(v);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <class T>\nvoid view(const T &e) { std::cerr << e; }\n} // namespace debugger\n#ifdef LOCAL\nvoid debug_out() {}\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head H, Tail... T) {\n\tdebugger::view(H);\n\tstd::cerr << \", \";\n\tdebug_out(T...);\n}\n#define debug(...) \\\n\tdo { \\\n\t\tstd::cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"] : [\"; \\\n\t\tdebug_out(__VA_ARGS__); \\\n\t\tstd::cerr << \"\\b\\b]\\n\"; \\\n\t} while(false)\n#else\n#define debug(...) (void(0))\n#endif\n\n// vector macro\ntemplate <class T>\nint lb(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::lower_bound((a).begin(), (a).end(), (x))); }\ntemplate <class T>\nint ub(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::upper_bound((a).begin(), (a).end(), (x))); }\ntemplate <class T>\nvoid UNIQUE(std::vector<T> &a) {\n\tstd::sort(a.begin(), a.end());\n\ta.erase(std::unique(a.begin(), a.end()), a.end());\n}\ntemplate <class T>\nstd::vector<T> press(std::vector<T> &a) {\n\tauto res = a;\n\tUNIQUE(res);\n\tfor(auto &v : a)\n\t\tv = lb(res, v);\n\treturn res;\n}\n#define SORTname(a, b, c, ...) c\n#define SORT(...) SORTname(__VA_ARGS__, SORT1, SORT0, ...)(__VA_ARGS__)\n#define SORT0(a) std::sort((a).begin(), (a).end())\n#define SORT1(a, c) std::sort((a).begin(), (a).end(), [](const auto x, const auto y) { return x c y; })\ntemplate <class T>\nvoid ADD(std::vector<T> &a, const T x) {\n\tfor(auto &v : a) v += x;\n}\ntemplate <class T>\nvoid SUB(std::vector<T> &a, const T x = 1) {\n\tfor(auto &v : a) v -= x;\n}\ntemplate <class T>\nvoid MUL(std::vector<T> &a, const T x) {\n\tfor(auto &v : a) v *= x;\n}\ntemplate <class T>\nvoid DIV(std::vector<T> &a, const T x) {\n\tfor(auto &v : a) v /= x;\n}\n\n// math macro\ntemplate <class T, class U>\ninline bool chmin(T &a, const U &b) { return a > b ? a = b, true : false; }\ntemplate <class T, class U>\ninline bool chmax(T &a, const U &b) { return a < b ? a = b, true : false; }\ntemplate <class T>\nT divup(T x, T y) { return (x + y - 1) / y; }\ntemplate <class T>\nT POW(T a, long long n) {\n\tT ret = 1;\n\twhile(n) {\n\t\tif(n & 1) ret *= a;\n\t\ta *= a;\n\t\tn >>= 1;\n\t}\n\treturn ret;\n}\n// modpow\nlong long POW(long long a, long long n, const int mod) {\n\tlong long ret = 1;\n\twhile(n) {\n\t\tif(n & 1) (ret *= a) %= mod;\n\t\t(a *= a) %= mod;\n\t\tn >>= 1;\n\t}\n\treturn ret;\n}\n\n// others\nstruct fast_io {\n\tfast_io() {\n\t\tios::sync_with_stdio(false);\n\t\tcin.tie(nullptr);\n\t\tcout << fixed << setprecision(15);\n\t}\n} fast_io_;\nconst int inf = 1e9;\nconst ll INF = 1e18;\n#pragma endregion\n\nV<> nd(6);\nvoid main_() {\n\tstring ans = \"\";\n\tVEC(int, t, 6);\n\tint sum = accumulate(all(t), 0);\n\tif(!sum) exit(0);\n\tINT(p, q);\n\tV<> perm(6);\n\tiota(all(perm), 0);\n\tdo {\n\t\tstring res = \"\";\n\t\tV<> d(6);\n\t\tREP(i, 6) { d[i] = t[perm[i]]; }\n\n\t\tauto chk = [&d]() -> bool {\n\t\t\tif(*min_element(all(d)) < 0) return 0;\n\t\t\tint a = d[0] + d[1];\n\t\t\tint b = d[2] + d[3];\n\t\t\tint c = d[4] + d[5];\n\t\t\tbool ok = 1;\n\t\t\tok &= a <= b + c + 1;\n\t\t\tok &= b <= a + c + 1;\n\t\t\tok &= c <= a + b;\n\t\t\treturn ok;\n\t\t};\n\n\t\tauto east_rotate = [&]() {\n\t\t\tnd[2] = d[2];\n\t\t\tnd[3] = d[3];\n\t\t\tnd[4] = d[1];\n\t\t\tnd[1] = d[5];\n\t\t\tnd[5] = d[0];\n\t\t\tnd[0] = d[4];\n\t\t\td = nd;\n\t\t\treturn;\n\t\t};\n\n\t\tauto west_rotate = [&]() {\n\t\t\tnd[2] = d[2];\n\t\t\tnd[3] = d[3];\n\t\t\tnd[1] = d[4];\n\t\t\tnd[5] = d[1];\n\t\t\tnd[0] = d[5];\n\t\t\tnd[4] = d[0];\n\t\t\td = nd;\n\t\t\treturn;\n\t\t};\n\n\t\tauto north_rotate = [&]() {\n\t\t\tnd[0] = d[0];\n\t\t\tnd[1] = d[1];\n\t\t\tnd[4] = d[3];\n\t\t\tnd[3] = d[5];\n\t\t\tnd[5] = d[2];\n\t\t\tnd[2] = d[4];\n\t\t\td = nd;\n\t\t\treturn;\n\t\t};\n\n\t\tauto south_rotate = [&]() {\n\t\t\tnd[0] = d[0];\n\t\t\tnd[1] = d[1];\n\t\t\tnd[3] = d[4];\n\t\t\tnd[5] = d[3];\n\t\t\tnd[2] = d[5];\n\t\t\tnd[4] = d[2];\n\t\t\td = nd;\n\t\t\treturn;\n\t\t};\n\n\t\tREP(_, sum) {\n\t\t\t{\n\t\t\t\teast_rotate();\n\t\t\t\td[4]--;\n\t\t\t\tif(chk()) {\n\t\t\t\t\tres += 'E';\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\td[4]++;\n\t\t\t\twest_rotate();\n\t\t\t}\n\t\t\t{\n\t\t\t\tnorth_rotate();\n\t\t\t\td[4]--;\n\t\t\t\tif(chk()) {\n\t\t\t\t\tres += 'N';\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\td[4]++;\n\t\t\t\tsouth_rotate();\n\t\t\t}\n\t\t\t{\n\t\t\t\tsouth_rotate();\n\t\t\t\td[4]--;\n\t\t\t\tif(chk()) {\n\t\t\t\t\tres += 'S';\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\td[4]++;\n\t\t\t\tnorth_rotate();\n\t\t\t}\n\t\t\t{\n\t\t\t\twest_rotate();\n\t\t\t\td[4]--;\n\t\t\t\tif(chk()) {\n\t\t\t\t\tres += 'W';\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\td[4]++;\n\t\t\t\teast_rotate();\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\tif(SZ(res) == sum) {\n\t\t\tif(SZ(ans) == 0)\n\t\t\t\tans = res;\n\t\t\telse\n\t\t\t\tchmin(ans, res);\n\t\t}\n\t} while(next_permutation(all(perm)));\n\tif(SZ(ans) != sum) {\n\t\tprint(\"impossible\");\n\t\treturn;\n\t}\n\tREP(i, p - 1, q) {\n\t\tcout << ans[i];\n\t}\n\tcout << endl;\n\treturn;\n}\n\nint main() {\n\tint t = 1;\n\t//cin >> t;\n\twhile(1) main_();\n\treturn 0;\n}","accuracy":1,"time_ms":3050,"memory_kb":3568,"score_of_the_acc":-0.4915,"final_rank":15},{"submission_id":"aoj_1197_5628812","code_snippet":"/**\n *\tauthor: nok0\n *\tcreated: 2021.06.29 22:18:07\n**/\n#ifdef LOCAL\n#define _GLIBCXX_DEBUG\n#endif\n\n#include <bits/stdc++.h>\nusing namespace std;\n#if __has_include(<atcoder/all>)\n#include <atcoder/all>\nusing namespace atcoder;\n#endif\n\n#pragma region Macros\n// rep macro\n#define foa(v, a) for(auto &v : a)\n#define REPname(a, b, c, d, e, ...) e\n#define REP(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\n#define REP0(x) for(int i = 0; i < (x); ++i)\n#define REP1(i, x) for(int i = 0; i < (x); ++i)\n#define REP2(i, l, r) for(int i = (l); i < (r); ++i)\n#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))\n#define REPSname(a, b, c, ...) c\n#define REPS(...) REPSname(__VA_ARGS__, REPS1, REPS0)(__VA_ARGS__)\n#define REPS0(x) for(int i = 1; i <= (x); ++i)\n#define REPS1(i, x) for(int i = 1; i <= (x); ++i)\n#define RREPname(a, b, c, d, e, ...) e\n#define RREP(...) RREPname(__VA_ARGS__, RREP3, RREP2, RREP1, RREP0)(__VA_ARGS__)\n#define RREP0(x) for(int i = (x)-1; i >= 0; --i)\n#define RREP1(i, x) for(int i = (x)-1; i >= 0; --i)\n#define RREP2(i, r, l) for(int i = (r)-1; i >= (l); --i)\n#define RREP3(i, r, l, c) for(int i = (r)-1; i >= (l); i -= (c))\n#define RREPSname(a, b, c, ...) c\n#define RREPS(...) RREPSname(__VA_ARGS__, RREPS1, RREPS0)(__VA_ARGS__)\n#define RREPS0(x) for(int i = (x); i >= 1; --i)\n#define RREPS1(i, x) for(int i = (x); i >= 1; --i)\n\n// name macro\n#define pb push_back\n#define eb emplace_back\n#define SZ(x) ((int)(x).size())\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n#define popcnt(x) __builtin_popcountll(x)\ntemplate <class T = int>\nusing V = std::vector<T>;\ntemplate <class T = int>\nusing VV = std::vector<std::vector<T>>;\ntemplate <class T>\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\nusing ll = long long;\nusing ld = long double;\nusing int128 = __int128_t;\nusing pii = std::pair<int, int>;\nusing pll = std::pair<long long, long long>;\n\n// input macro\ntemplate <class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\n\tis >> p.first >> p.second;\n\treturn is;\n}\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\n\tfor(T &i : v) is >> i;\n\treturn is;\n}\nstd::istream &operator>>(std::istream &is, __int128_t &a) {\n\tstd::string s;\n\tis >> s;\n\t__int128_t ret = 0;\n\tfor(int i = 0; i < s.length(); i++)\n\t\tif('0' <= s[i] and s[i] <= '9')\n\t\t\tret = 10 * ret + s[i] - '0';\n\ta = ret * (s[0] == '-' ? -1 : 1);\n\treturn is;\n}\n#if __has_include(<atcoder/all>)\nstd::istream &operator>>(std::istream &is, atcoder::modint998244353 &a) {\n\tlong long v;\n\tis >> v;\n\ta = v;\n\treturn is;\n}\nstd::istream &operator>>(std::istream &is, atcoder::modint1000000007 &a) {\n\tlong long v;\n\tis >> v;\n\ta = v;\n\treturn is;\n}\ntemplate <int m>\nstd::istream &operator>>(std::istream &is, atcoder::static_modint<m> &a) {\n\tlong long v;\n\tis >> v;\n\ta = v;\n\treturn is;\n}\ntemplate <int m>\nstd::istream &operator>>(std::istream &is, atcoder::dynamic_modint<m> &a) {\n\tlong long v;\n\tis >> v;\n\ta = v;\n\treturn is;\n}\n#endif\nnamespace scanner {\nvoid scan(int &a) { std::cin >> a; }\nvoid scan(long long &a) { std::cin >> a; }\nvoid scan(std::string &a) { std::cin >> a; }\nvoid scan(char &a) { std::cin >> a; }\nvoid scan(char a[]) { std::scanf(\"%s\", a); }\nvoid scan(double &a) { std::cin >> a; }\nvoid scan(long double &a) { std::cin >> a; }\ntemplate <class T, class U>\nvoid scan(std::pair<T, U> &p) { std::cin >> p; }\ntemplate <class T>\nvoid scan(std::vector<T> &a) { std::cin >> a; }\nvoid INPUT() {}\ntemplate <class Head, class... Tail>\nvoid INPUT(Head &head, Tail &... tail) {\n\tscan(head);\n\tINPUT(tail...);\n}\n} // namespace scanner\n#define VEC(type, name, size) \\\n\tstd::vector<type> name(size); \\\n\tscanner::INPUT(name)\n#define VVEC(type, name, h, w) \\\n\tstd::vector<std::vector<type>> name(h, std::vector<type>(w)); \\\n\tscanner::INPUT(name)\n#define INT(...) \\\n\tint __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LL(...) \\\n\tlong long __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define STR(...) \\\n\tstd::string __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define CHAR(...) \\\n\tchar __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define DOUBLE(...) \\\n\tdouble __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LD(...) \\\n\tlong double __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n\n// output-macro\ntemplate <class T, class U>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\n\tos << p.first << \" \" << p.second;\n\treturn os;\n}\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &a) {\n\tfor(int i = 0; i < int(a.size()); ++i) {\n\t\tif(i) os << \" \";\n\t\tos << a[i];\n\t}\n\treturn os;\n}\nstd::ostream &operator<<(std::ostream &dest, __int128_t &value) {\n\tstd::ostream::sentry s(dest);\n\tif(s) {\n\t\t__uint128_t tmp = value < 0 ? -value : value;\n\t\tchar buffer[128];\n\t\tchar *d = std::end(buffer);\n\t\tdo {\n\t\t\t--d;\n\t\t\t*d = \"0123456789\"[tmp % 10];\n\t\t\ttmp /= 10;\n\t\t} while(tmp != 0);\n\t\tif(value < 0) {\n\t\t\t--d;\n\t\t\t*d = '-';\n\t\t}\n\t\tint len = std::end(buffer) - d;\n\t\tif(dest.rdbuf()->sputn(d, len) != len) {\n\t\t\tdest.setstate(std::ios_base::badbit);\n\t\t}\n\t}\n\treturn dest;\n}\n#if __has_include(<atcoder/all>)\nstd::ostream &operator<<(std::ostream &os, const atcoder::modint998244353 &a) { return os << a.val(); }\nstd::ostream &operator<<(std::ostream &os, const atcoder::modint1000000007 &a) { return os << a.val(); }\ntemplate <int m>\nstd::ostream &operator<<(std::ostream &os, const atcoder::static_modint<m> &a) { return os << a.val(); }\ntemplate <int m>\nstd::ostream &operator<<(std::ostream &os, const atcoder::dynamic_modint<m> &a) { return os << a.val(); }\n#endif\ntemplate <class T>\nvoid print(const T a) { std::cout << a << '\\n'; }\ntemplate <class Head, class... Tail>\nvoid print(Head H, Tail... T) {\n\tstd::cout << H << ' ';\n\tprint(T...);\n}\ntemplate <class T>\nvoid printel(const T a) { std::cout << a << '\\n'; }\ntemplate <class T>\nvoid printel(const std::vector<T> &a) {\n\tfor(const auto &v : a)\n\t\tstd::cout << v << '\\n';\n}\ntemplate <class Head, class... Tail>\nvoid printel(Head H, Tail... T) {\n\tstd::cout << H << '\\n';\n\tprintel(T...);\n}\nvoid Yes(const bool b = true) { std::cout << (b ? \"Yes\\n\" : \"No\\n\"); }\nvoid No() { std::cout << \"No\\n\"; }\nvoid YES(const bool b = true) { std::cout << (b ? \"YES\\n\" : \"NO\\n\"); }\nvoid NO() { std::cout << \"NO\\n\"; }\nvoid err(const bool b = true) {\n\tif(b) {\n\t\tstd::cout << \"-1\\n\", exit(0);\n\t}\n}\n\n//debug macro\nnamespace debugger {\ntemplate <class T>\nvoid view(const std::vector<T> &a) {\n\tstd::cerr << \"{ \";\n\tfor(const auto &v : a) {\n\t\tstd::cerr << v << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\ntemplate <class T>\nvoid view(const std::vector<std::vector<T>> &a) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &v : a) {\n\t\tstd::cerr << \"\\t\";\n\t\tview(v);\n\t\tstd::cerr << \"\\n\";\n\t}\n\tstd::cerr << \"}\";\n}\ntemplate <class T, class U>\nvoid view(const std::vector<std::pair<T, U>> &a) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &p : a) std::cerr << \"\\t(\" << p.first << \", \" << p.second << \")\\n\";\n\tstd::cerr << \"}\";\n}\ntemplate <class T, class U>\nvoid view(const std::map<T, U> &m) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &p : m) std::cerr << \"\\t[\" << p.first << \"] : \" << p.second << \"\\n\";\n\tstd::cerr << \"}\";\n}\ntemplate <class T, class U>\nvoid view(const std::pair<T, U> &p) { std::cerr << \"(\" << p.first << \", \" << p.second << \")\"; }\ntemplate <class T>\nvoid view(const std::set<T> &s) {\n\tstd::cerr << \"{ \";\n\tfor(auto &v : s) {\n\t\tview(v);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <class T>\nvoid view(const T &e) { std::cerr << e; }\n} // namespace debugger\n#ifdef LOCAL\nvoid debug_out() {}\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head H, Tail... T) {\n\tdebugger::view(H);\n\tstd::cerr << \", \";\n\tdebug_out(T...);\n}\n#define debug(...) \\\n\tdo { \\\n\t\tstd::cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"] : [\"; \\\n\t\tdebug_out(__VA_ARGS__); \\\n\t\tstd::cerr << \"\\b\\b]\\n\"; \\\n\t} while(false)\n#else\n#define debug(...) (void(0))\n#endif\n\n// vector macro\ntemplate <class T>\nint lb(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::lower_bound((a).begin(), (a).end(), (x))); }\ntemplate <class T>\nint ub(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::upper_bound((a).begin(), (a).end(), (x))); }\ntemplate <class T>\nvoid UNIQUE(std::vector<T> &a) {\n\tstd::sort(a.begin(), a.end());\n\ta.erase(std::unique(a.begin(), a.end()), a.end());\n}\ntemplate <class T>\nstd::vector<T> press(std::vector<T> &a) {\n\tauto res = a;\n\tUNIQUE(res);\n\tfor(auto &v : a)\n\t\tv = lb(res, v);\n\treturn res;\n}\n#define SORTname(a, b, c, ...) c\n#define SORT(...) SORTname(__VA_ARGS__, SORT1, SORT0, ...)(__VA_ARGS__)\n#define SORT0(a) std::sort((a).begin(), (a).end())\n#define SORT1(a, c) std::sort((a).begin(), (a).end(), [](const auto x, const auto y) { return x c y; })\ntemplate <class T>\nvoid ADD(std::vector<T> &a, const T x) {\n\tfor(auto &v : a) v += x;\n}\ntemplate <class T>\nvoid SUB(std::vector<T> &a, const T x = 1) {\n\tfor(auto &v : a) v -= x;\n}\ntemplate <class T>\nvoid MUL(std::vector<T> &a, const T x) {\n\tfor(auto &v : a) v *= x;\n}\ntemplate <class T>\nvoid DIV(std::vector<T> &a, const T x) {\n\tfor(auto &v : a) v /= x;\n}\n\n// math macro\ntemplate <class T, class U>\ninline bool chmin(T &a, const U &b) { return a > b ? a = b, true : false; }\ntemplate <class T, class U>\ninline bool chmax(T &a, const U &b) { return a < b ? a = b, true : false; }\ntemplate <class T>\nT divup(T x, T y) { return (x + y - 1) / y; }\ntemplate <class T>\nT POW(T a, long long n) {\n\tT ret = 1;\n\twhile(n) {\n\t\tif(n & 1) ret *= a;\n\t\ta *= a;\n\t\tn >>= 1;\n\t}\n\treturn ret;\n}\n// modpow\nlong long POW(long long a, long long n, const int mod) {\n\tlong long ret = 1;\n\twhile(n) {\n\t\tif(n & 1) (ret *= a) %= mod;\n\t\t(a *= a) %= mod;\n\t\tn >>= 1;\n\t}\n\treturn ret;\n}\n\n// others\nstruct fast_io {\n\tfast_io() {\n\t\tios::sync_with_stdio(false);\n\t\tcin.tie(nullptr);\n\t\tcout << fixed << setprecision(15);\n\t}\n} fast_io_;\nconst int inf = 1e9;\nconst ll INF = 1e18;\n#pragma endregion\n\nV<> nd(6);\nvoid main_() {\n\tstring ans = \"\";\n\tVEC(int, t, 6);\n\tint sum = accumulate(all(t), 0);\n\tif(!sum) exit(0);\n\tINT(p, q);\n\tV<> perm(6);\n\tiota(all(perm), 0);\n\tdo {\n\t\tstring res = \"\";\n\t\tV<> d(6);\n\t\tREP(i, 6) { d[i] = t[perm[i]]; }\n\n\t\tauto chk = [&d]() -> bool {\n\t\t\tif(*min_element(all(d)) < 0) return 0;\n\t\t\tint a = d[0] + d[1];\n\t\t\tint b = d[2] + d[3];\n\t\t\tint c = d[4] + d[5];\n\t\t\tbool ok = 1;\n\t\t\tok &= a <= b + c + 1;\n\t\t\tok &= b <= a + c + 1;\n\t\t\tok &= c <= a + b;\n\t\t\treturn ok;\n\t\t};\n\n\t\tauto east_rotate = [&]() {\n\t\t\tnd[2] = d[2];\n\t\t\tnd[3] = d[3];\n\t\t\tnd[4] = d[1];\n\t\t\tnd[1] = d[5];\n\t\t\tnd[5] = d[0];\n\t\t\tnd[0] = d[4];\n\t\t\td = nd;\n\t\t\treturn;\n\t\t};\n\n\t\tauto west_rotate = [&]() {\n\t\t\tnd[2] = d[2];\n\t\t\tnd[3] = d[3];\n\t\t\tnd[1] = d[4];\n\t\t\tnd[5] = d[1];\n\t\t\tnd[0] = d[5];\n\t\t\tnd[4] = d[0];\n\t\t\td = nd;\n\t\t\treturn;\n\t\t};\n\n\t\tauto north_rotate = [&]() {\n\t\t\tnd[0] = d[0];\n\t\t\tnd[1] = d[1];\n\t\t\tnd[4] = d[3];\n\t\t\tnd[3] = d[5];\n\t\t\tnd[5] = d[2];\n\t\t\tnd[2] = d[4];\n\t\t\td = nd;\n\t\t\treturn;\n\t\t};\n\n\t\tauto south_rotate = [&]() {\n\t\t\tnd[0] = d[0];\n\t\t\tnd[1] = d[1];\n\t\t\tnd[3] = d[4];\n\t\t\tnd[5] = d[3];\n\t\t\tnd[2] = d[5];\n\t\t\tnd[4] = d[2];\n\t\t\td = nd;\n\t\t\treturn;\n\t\t};\n\n\t\tREP(_, sum) {\n\t\t\t{\n\t\t\t\teast_rotate();\n\t\t\t\td[4]--;\n\t\t\t\tif(chk()) {\n\t\t\t\t\tres += 'E';\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\td[4]++;\n\t\t\t\twest_rotate();\n\t\t\t}\n\t\t\t{\n\t\t\t\tnorth_rotate();\n\t\t\t\td[4]--;\n\t\t\t\tif(chk()) {\n\t\t\t\t\tres += 'N';\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\td[4]++;\n\t\t\t\tsouth_rotate();\n\t\t\t}\n\t\t\t{\n\t\t\t\tsouth_rotate();\n\t\t\t\td[4]--;\n\t\t\t\tif(chk()) {\n\t\t\t\t\tres += 'S';\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\td[4]++;\n\t\t\t\tnorth_rotate();\n\t\t\t}\n\t\t\t{\n\t\t\t\twest_rotate();\n\t\t\t\td[4]--;\n\t\t\t\tif(chk()) {\n\t\t\t\t\tres += 'W';\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\td[4]++;\n\t\t\t\teast_rotate();\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\tif(SZ(res) == sum) {\n\t\t\tif(SZ(ans) == 0)\n\t\t\t\tans = res;\n\t\t\telse\n\t\t\t\tchmin(ans, res);\n\t\t}\n\t} while(next_permutation(all(perm)));\n\tif(SZ(ans) != sum) {\n\t\tprint(\"impossible\");\n\t\treturn;\n\t}\n\tREP(i, p - 1, q) {\n\t\tcout << ans[i];\n\t}\n\tcout << endl;\n\treturn;\n}\n\nint main() {\n\tint t = 1;\n\t//cin >> t;\n\twhile(1) main_();\n\treturn 0;\n}","accuracy":1,"time_ms":3050,"memory_kb":3488,"score_of_the_acc":-0.4683,"final_rank":14},{"submission_id":"aoj_1197_5628370","code_snippet":"//#define _GLIBCXX_DEBUG\n\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define endl '\\n'\n#define lfs cout<<fixed<<setprecision(10)\n#define ALL(a) (a).begin(),(a).end()\n#define ALLR(a) (a).rbegin(),(a).rend()\n#define spa << \" \" <<\n#define fi first\n#define se second\n#define MP make_pair\n#define MT make_tuple\n#define PB push_back\n#define EB emplace_back\n#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)\n#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)\nusing ll = long long;\nusing ld = long double;\nconst ll MOD1 = 1e9+7;\nconst ll MOD9 = 998244353;\nconst ll INF = 1e18;\nusing P = pair<ll, ll>;\ntemplate<typename T> using PQ = priority_queue<T>;\ntemplate<typename T> using QP = priority_queue<T,vector<T>,greater<T>>;\ntemplate<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}\ntemplate<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}\nll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}\nvoid ans1(bool x){if(x) cout<<\"Yes\"<<endl;else cout<<\"No\"<<endl;}\nvoid ans2(bool x){if(x) cout<<\"YES\"<<endl;else cout<<\"NO\"<<endl;}\nvoid ans3(bool x){if(x) cout<<\"Yay!\"<<endl;else cout<<\":(\"<<endl;}\ntemplate<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;} \ntemplate<typename T1,typename T2,typename T3>void anss(T1 x,T2 y,T3 z){ans(x!=y,x,z);}; \ntemplate<typename T>void debug(const T &v,ll h,ll w,string sv=\" \"){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout<<sv<<v[i][j];cout<<endl;}};\ntemplate<typename T>void debug(const T &v,ll n,string sv=\" \"){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout<<sv<<v[i];cout<<endl;};\ntemplate<typename T>void debug(const vector<T>&v){debug(v,v.size());}\ntemplate<typename T>void debug(const vector<vector<T>>&v){for(auto &vv:v)debug(vv,vv.size());}\ntemplate<typename T>void debug(stack<T> st){while(!st.empty()){cout<<st.top()<<\" \";st.pop();}cout<<endl;}\ntemplate<typename T>void debug(queue<T> st){while(!st.empty()){cout<<st.front()<<\" \";st.pop();}cout<<endl;}\ntemplate<typename T>void debug(deque<T> st){while(!st.empty()){cout<<st.front()<<\" \";st.pop_front();}cout<<endl;}\ntemplate<typename T>void debug(PQ<T> st){while(!st.empty()){cout<<st.top()<<\" \";st.pop();}cout<<endl;}\ntemplate<typename T>void debug(QP<T> st){while(!st.empty()){cout<<st.top()<<\" \";st.pop();}cout<<endl;}\ntemplate<typename T>void debug(const set<T>&v){for(auto z:v)cout<<z<<\" \";cout<<endl;}\ntemplate<typename T>void debug(const multiset<T>&v){for(auto z:v)cout<<z<<\" \";cout<<endl;}\ntemplate<typename T,size_t size>void debug(const array<T, size> &a){for(auto z:a)cout<<z<<\" \";cout<<endl;}\ntemplate<typename T,typename V>void debug(const map<T,V>&v){for(auto z:v)cout<<\"[\"<<z.first<<\"]=\"<<z.second<<\",\";cout<<endl;}\ntemplate<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}\nll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}\nvector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};\ntemplate<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}\ntemplate<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}\ntemplate<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << \" \" << p.second;}\ntemplate<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << \" \";cout<<\"|\"; return os;}\ntemplate<typename T>void rearrange(vector<int>&ord, vector<T>&v){\n auto tmp = v;\n for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];\n}\ntemplate<typename Head, typename... Tail>void rearrange(vector<int>&ord,Head&& head, Tail&&... tail){\n rearrange(ord, head);\n rearrange(ord, tail...);\n}\ntemplate<typename T> vector<int> ascend(const vector<T>&v){\n vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);\n sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]<v[j];});\n return ord;\n}\ntemplate<typename T> vector<int> descend(const vector<T>&v){\n vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);\n sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]>v[j];});\n return ord;\n}\nll FLOOR(ll n,ll div){return n>=0?n/div:(n-div+1)/div;}\nll CEIL(ll n,ll div){return n>=0?(n+div-1)/div:n/div;}\nll digitsum(ll n){ll ret=0;while(n){ret+=n%10;n/=10;}return ret;}\ntemplate<typename T>T min(const vector<T>&v){return *min_element(v.begin(),v.end());}\ntemplate<typename T>T max(const vector<T>&v){return *max_element(v.begin(),v.end());}\ntemplate<typename T>T acc(const vector<T>&v){return accumulate(v.begin(),v.end(),T(0));};\ntemplate<typename T>T reverse(const T &v){return T(v.rbegin(),v.rend());};\n//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());\nint popcount(ll x){return __builtin_popcountll(x);};\nint poplow(ll x){return __builtin_ctzll(x);};\nint pophigh(ll x){return 63 - __builtin_clzll(x);};\ntemplate<typename T>T poll(queue<T> &q){auto ret=q.front();q.pop();return ret;};\ntemplate<typename T>T poll(priority_queue<T> &q){auto ret=q.top();q.pop();return ret;};\ntemplate<typename T>T poll(QP<T> &q){auto ret=q.top();q.pop();return ret;};\ntemplate<typename T>T poll(stack<T> &s){auto ret=s.top();s.pop();return ret;};\ntemplate< typename T = int >\nstruct edge {\n int to;\n T cost;\n int id;\n edge():id(-1){};\n edge(int to, T cost = 1, int id = -1):to(to), cost(cost), id(id){}\n operator int() const { return to; }\n};\n\ntemplate<typename T>\nusing Graph = vector<vector<edge<T>>>;\ntemplate<typename T>\nGraph<T>revgraph(const Graph<T> &g){\n Graph<T>ret(g.size());\n for(int i=0;i<g.size();i++){\n for(auto e:g[i]){\n int to = e.to;\n e.to = i;\n ret[to].push_back(e);\n }\n }\n return ret;\n}\ntemplate<typename T>\nGraph<T> readGraph(int n,int m,int indexed=1,bool directed=false,bool weighted=false){\n Graph<T> ret(n);\n for(int es = 0; es < m; es++){\n int u,v;\n T w=1;\n cin>>u>>v;u-=indexed,v-=indexed;\n if(weighted)cin>>w;\n ret[u].emplace_back(v,w,es);\n if(!directed)ret[v].emplace_back(u,w,es);\n }\n return ret;\n}\ntemplate<typename T>\nGraph<T> readParent(int n,int indexed=1,bool directed=true){\n Graph<T>ret(n);\n for(int i=1;i<n;i++){\n int p;cin>>p;\n p-=indexed;\n ret[p].emplace_back(i);\n if(!directed)ret[i].emplace_back(p);\n }\n return ret;\n}\ntemplate<typename T>\nstruct Dice{\n array<T, 6>ar;\n Dice() = default;\n // 1\n //342\n // 0\n // 5\n Dice(array<T, 6>ar):ar(ar){}\n //xが上下、yが左右\n //0:x++\n //1:x--\n //2:y++\n //3:y--\n //4:clockwise\n //5:counter-clockwise\n void roll(int x){\n array<int, 6>trans;\n if(x == 0)ar = {ar[4],ar[5],ar[2],ar[3],ar[1],ar[0]};\n if(x == 1)ar = {ar[5],ar[4],ar[2],ar[3],ar[0],ar[1]};\n if(x == 2)ar = {ar[0],ar[1],ar[4],ar[5],ar[3],ar[2]};\n if(x == 3)ar = {ar[0],ar[1],ar[5],ar[4],ar[2],ar[3]};\n if(x == 4)ar = {ar[2],ar[3],ar[1],ar[0],ar[4],ar[5]};\n if(x == 5)ar = {ar[3],ar[2],ar[0],ar[1],ar[4],ar[5]};\n }\n bool operator==(const Dice &d) const{\n return ar == d.ar;\n }\n bool operator!=(const Dice &d) const{\n return ar != d.ar;\n }\n bool operator<(const Dice &d) const{\n return ar < d.ar;\n }\n T &operator[](int x){\n return ar[x];\n }\n T operator[](int x) const{\n return ar[x];\n }\n vector<Dice<T>>makeAll(){\n vector<Dice<T>>ret;\n for(int i=0;i<6;i++){\n Dice tmp = *this;\n if(i==1)tmp.roll(0);\n if(i==2)tmp.roll(1);\n if(i==3)tmp.roll(1),tmp.roll(1);\n if(i==4)tmp.roll(4);\n if(i==5)tmp.roll(5);\n for(int k=0;k<4;k++){\n ret.push_back(tmp);\n tmp.roll(2);\n }\n }\n return ret;\n }\n Dice<T> minDice(){\n auto dice = this->makeAll();\n return *min_element(dice.begin(), dice.end());\n }\n};\nint main(){\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n ll res=0,buf=0;\n bool judge = true;\n while(1){\n array<int,6>t;\n rep(i,0,6)cin>>t[i];\n if(t[5]==0)break;\n int p,q;cin>>p>>q;\n sort(ALL(t));\n string ret=\"impossible\";\n string ope=\"SNEW\";\n int m=0;for(auto z:t)m+=z;\n auto check=[&](const Dice<int>&d,int sum){\n if((d[4]+d[5])*2>sum)return false;\n if((d[0]+d[1])*2>sum+1)return false;\n if((d[2]+d[3])*2>sum+1)return false;\n return true;\n };\n do{\n Dice<int>dice(t);\n if(!check(dice,m))continue;\n string s;\n rrep(sum,0,m){\n for(auto i:{2,1,0,3}){\n auto tmp=dice;\n tmp.roll(i);\n if(tmp[5]<=0)continue;\n tmp[5]-=1;\n if(check(tmp,sum)){\n s+=ope[i];\n dice=tmp;\n break;\n }\n }\n if(s.size()+sum!=m)break;\n }\n if(s.size()==m){\n chmin(ret,s);\n }\n }while(next_permutation(ALL(t)));\n //cout<<ret<<endl;\n if(ret[0]=='i')cout<<ret<<endl;\n else cout<<ret.substr(p-1,q-p+1)<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":620,"memory_kb":3264,"score_of_the_acc":-0.0186,"final_rank":2}],"string":"[\n {\n \"submission_id\": \"aoj_1197_9857905\",\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/**\\n * @brief template\\n */\\n\\nchar CINF = (char)('Z'+1);\\nstring SINF(1,CINF);\\n\\nstring MOVE = \\\"ENSW\\\";\\n\\nstruct Dice {\\n int A[6];\\n int &operator[] (int i) {\\n return A[i];\\n }\\n};\\n\\nDice rotE(Dice D) {\\n Dice E;\\n E[0] = D[1];\\n E[1] = D[5];\\n E[2] = D[2];\\n E[3] = D[3];\\n E[4] = D[0];\\n E[5] = D[4];\\n return E;\\n}\\n\\nDice rotN(Dice D) {\\n Dice E;\\n E[0] = D[2];\\n E[1] = D[1];\\n E[2] = D[5];\\n E[3] = D[0];\\n E[4] = D[4];\\n E[5] = D[3];\\n return E;\\n}\\n\\nDice rotS(Dice D) {\\n Dice E;\\n E[0] = D[3];\\n E[1] = D[1];\\n E[2] = D[0];\\n E[3] = D[5];\\n E[4] = D[4];\\n E[5] = D[2];\\n return E;\\n}\\n\\nDice rotW(Dice D) {\\n Dice E;\\n E[0] = D[4];\\n E[1] = D[0];\\n E[2] = D[2];\\n E[3] = D[3];\\n E[4] = D[5];\\n E[5] = D[1];\\n return E;\\n}\\n\\nDice rot(Dice D, int i) {\\n if (i == 0) return rotE(D);\\n if (i == 1) return rotN(D);\\n if (i == 2) return rotS(D);\\n if (i == 3) return rotW(D);\\n return D;\\n}\\n\\nstring Solve(vector<int> A) {\\n auto Judge = [&](Dice D) -> bool {\\n if (D[0] < 0) return false;\\n int SUM = 0;\\n rep(i,0,6) SUM += D[i];\\n vector<int> Y(3);\\n rep(i,0,3) Y[i] = D[i] + D[5-i];\\n if (Y[0] > SUM / 2) return false;\\n if (Y[1] > (SUM+1) / 2) return false;\\n if (Y[2] > (SUM+1) / 2) return false;\\n return true;\\n };\\n auto canMove = [&](Dice D, int i) -> bool {\\n auto E = rot(D,i);\\n E[0]--;\\n return Judge(E);\\n };\\n bool check = false;\\n Dice D;\\n rep(i,0,6) D[i] = A[i];\\n rep(i,0,4) {\\n if (canMove(D,i)) check = true;\\n }\\n if (!check) return SINF;\\n string Ret = \\\"\\\";\\n int COUNT = 0;\\n rep(i,0,6) COUNT += A[i];\\n while(COUNT--) {\\n int next = -1;\\n rep(i,0,4) {\\n if (canMove(D,i)) {\\n next = i;\\n break;\\n }\\n }\\n Ret += MOVE[next];\\n D = rot(D,next);\\n D[0]--;\\n }\\n return Ret;\\n}\\n\\nint main() {\\nwhile(1) {\\n vector<int> A(6);\\n int COUNT = 0;\\n rep(i,0,6) cin >> A[i], COUNT += A[i];\\n if (COUNT == 0) return 0;\\n int X, Y;\\n cin >> X >> Y;\\n X--;\\n vector<int> ord(6);\\n iota(ALL(ord),0);\\n string ANS = SINF;\\n do {\\n vector<int> B(6);\\n rep(i,0,6) B[i] = A[ord[i]];\\n string Ret = Solve(B);\\n chmin(ANS, Ret);\\n } while(next_permutation(ALL(ord)));\\n if (ANS == SINF) {\\n cout << \\\"impossible\\\" << endl;\\n }\\n else {\\n cout << ANS.substr(X,Y-X) << endl;\\n }\\n}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6490,\n \"memory_kb\": 3260,\n \"score_of_the_acc\": -0.9462,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1197_9324064\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = int;\\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};\\ntemplate<class T>\\nbool chmin(T& p, T q) {\\n if (p > q) {\\n p = q; return 1;\\n }\\n return 0;\\n};\\n\\n\\nvoid roll(vll &D, char C) {\\n ll SV=D[0];\\n if (C == 'E') {\\n D[0] = D[1];\\n D[1] = D[5];\\n D[5] = D[3];\\n D[3] = SV;\\n }\\n else if (C == 'W'){\\n D[0] = D[3];\\n D[3] = D[5];\\n D[5] = D[1];\\n D[1] = SV;\\n }\\n else if (C == 'N') {\\n D[0] = D[4];\\n D[4] = D[5];\\n D[5] = D[2];\\n D[2] = SV;\\n }\\n else if (C == 'S'){\\n D[0] = D[2];\\n D[2] = D[5];\\n D[5] = D[4];\\n D[4] = SV;\\n }\\n}\\n\\nbool is_valid(vll &D,char C){\\n if(C=='E'||C=='W'){\\n if(C=='E'&&D[1]==0)return 0;\\n if(C=='W'&&D[3]==0)return 0;\\n if (D[0] + D[5] > D[1] + D[2] + D[3] + D[4])return 0;\\n if (D[1]-1 + D[3] > D[0] + D[2] + D[5] + D[4])return 0;\\n if (D[2] + D[4] > D[1] + D[0] + D[3] + D[5])return 0;\\n return 1;\\n }\\n if(C=='N'||C=='S'){\\n if(C=='N'&&D[4]==0)return 0;\\n if(C=='S'&&D[2]==0)return 0;\\n if (D[0] + D[5] > D[1] + D[2] + D[3] + D[4])return 0;\\n if (D[1] + D[3] > D[0] + D[2] + D[5] + D[4])return 0;\\n if (D[2] + D[4]-1 > D[1] + D[0] + D[3] + D[5])return 0;\\n return 1;\\n }\\n return 1;\\n}\\n\\nvoid solve(vll D, ll S) {\\n ll P, Q;\\n cin >> P >> Q;\\n P--; Q -= P;\\n string AN ;\\n rep(i,S)AN.push_back('Z');\\n sort(all(D));\\n ll MX=D[5];\\n do {\\n vll P = D;\\n string R = \\\"\\\";\\n string G = \\\"ENSW\\\";\\n bool is_same=1;\\n rep(i, S) {\\n bool is_OK = 0;\\n rep(k, 4) {\\n if(i==0&&k!=0)break;\\n if(is_valid(P,G[k])){\\n roll(P, G[k]);\\n P[0]--;\\n R.push_back(G[k]);\\n if(is_same&&G[k]>AN[i]){\\n is_OK = 0;\\n }\\n if(G[k]<AN[i])is_same=0;\\n is_OK = 1;\\n break;\\n }\\n }\\n if (!is_OK){\\n R = \\\"Z\\\";\\n break;\\n }\\n }\\n chmin(AN, R);\\n } while (next_permutation(all(D)));\\n if (AN == \\\"Z\\\") {\\n cout << \\\"impossible\\\" << endl;\\n }\\n else {\\n cout << AN.substr(P, Q) << endl;\\n }\\n}\\n\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n\\n vll D(6);\\n while (1) {\\n ll S = 0;\\n rep(i, 6) {\\n cin >> D[i];\\n S += D[i];\\n }\\n if (S == 0)return 0;\\n solve(D, S);\\n }\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 930,\n \"memory_kb\": 3512,\n \"score_of_the_acc\": -0.1398,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1197_9324063\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#include <time.h>\\nusing namespace std;\\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};\\ntemplate<class T>\\nbool chmin(T& p, T q) {\\n if (p > q) {\\n p = q; return 1;\\n }\\n return 0;\\n};\\n\\n\\nvoid roll(vll &D, char C) {\\n ll SV=D[0];\\n if (C == 'E') {\\n D[0] = D[1];\\n D[1] = D[5];\\n D[5] = D[3];\\n D[3] = SV;\\n }\\n else if (C == 'W'){\\n D[0] = D[3];\\n D[3] = D[5];\\n D[5] = D[1];\\n D[1] = SV;\\n }\\n else if (C == 'N') {\\n D[0] = D[4];\\n D[4] = D[5];\\n D[5] = D[2];\\n D[2] = SV;\\n }\\n else if (C == 'S'){\\n D[0] = D[2];\\n D[2] = D[5];\\n D[5] = D[4];\\n D[4] = SV;\\n }\\n}\\n\\nbool is_valid(vll &D,char C){\\n if(C=='E'||C=='W'){\\n if(C=='E'&&D[1]==0)return 0;\\n if(C=='W'&&D[3]==0)return 0;\\n if (D[0] + D[5] > D[1] + D[2] + D[3] + D[4])return 0;\\n if (D[1]-1 + D[3] > D[0] + D[2] + D[5] + D[4])return 0;\\n if (D[2] + D[4] > D[1] + D[0] + D[3] + D[5])return 0;\\n return 1;\\n }\\n if(C=='N'||C=='S'){\\n if(C=='N'&&D[4]==0)return 0;\\n if(C=='S'&&D[2]==0)return 0;\\n if (D[0] + D[5] > D[1] + D[2] + D[3] + D[4])return 0;\\n if (D[1] + D[3] > D[0] + D[2] + D[5] + D[4])return 0;\\n if (D[2] + D[4]-1 > D[1] + D[0] + D[3] + D[5])return 0;\\n return 1;\\n }\\n return 1;\\n}\\n\\nbool is_valid(vll &D) {\\n if (D[0]-1 + D[5] > D[1] + D[2] + D[3] + D[4])return 0;\\n if (D[1] + D[3] > D[0] + D[2] + D[5] + D[4])return 0;\\n if (D[2] + D[4] > D[1] + D[0] + D[3] + D[5])return 0;\\n return 1;\\n}\\n\\nvoid solve(vll D, ll S) {\\n clock_t start = clock();\\n ll P, Q;\\n cin >> P >> Q;\\n P--; Q -= P;\\n string AN ;\\n rep(i,S)AN.push_back('Z');\\n sort(all(D));\\n ll MX=D[5];\\n do {\\n vll P = D;\\n string R = \\\"\\\";\\n string G = \\\"ENSW\\\";\\n bool is_same=1;\\n rep(i, S) {\\n bool is_OK = 0;\\n rep(k, 4) {\\n if(i==0&&k!=0)break;\\n if(is_valid(P,G[k])){\\n roll(P, G[k]);\\n P[0]--;\\n R.push_back(G[k]);\\n if(is_same&&G[k]>AN[i]){\\n is_OK = 0;\\n }\\n if(G[k]<AN[i])is_same=0;\\n is_OK = 1;\\n break;\\n }\\n }\\n if (!is_OK){\\n R = \\\"Z\\\";\\n break;\\n }\\n }\\n chmin(AN, R);\\n } while (next_permutation(all(D)));\\n if (AN == \\\"Z\\\") {\\n cout << \\\"impossible\\\" << endl;\\n }\\n else {\\n // cout<<\\\"OK\\\"<<endl;\\n cout << AN.substr(P, Q) << endl;\\n }\\n clock_t end = clock();\\n\\n // const double time = static_cast<double>(end - start) / CLOCKS_PER_SEC * 1000.0;\\n // cout<<time<<endl;\\n}\\n\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n\\n vll D(6);\\n while (1) {\\n ll S = 0;\\n rep(i, 6) {\\n cin >> D[i];\\n S += D[i];\\n }\\n if (S == 0)return 0;\\n solve(D, S);\\n }\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 940,\n \"memory_kb\": 3588,\n \"score_of_the_acc\": -0.1635,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1197_9324060\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#include <time.h>\\nusing namespace std;\\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};\\ntemplate<class T>\\nbool chmin(T& p, T q) {\\n if (p > q) {\\n p = q; return 1;\\n }\\n return 0;\\n};\\n\\n\\nvoid roll(vll &D, char C) {\\n ll SV=D[0];\\n if (C == 'E') {\\n D[0] = D[1];\\n D[1] = D[5];\\n D[5] = D[3];\\n D[3] = SV;\\n }\\n else if (C == 'W'){\\n D[0] = D[3];\\n D[3] = D[5];\\n D[5] = D[1];\\n D[1] = SV;\\n }\\n else if (C == 'N') {\\n D[0] = D[4];\\n D[4] = D[5];\\n D[5] = D[2];\\n D[2] = SV;\\n }\\n else if (C == 'S'){\\n D[0] = D[2];\\n D[2] = D[5];\\n D[5] = D[4];\\n D[4] = SV;\\n }\\n}\\n\\nbool is_valid(vll &D) {\\n if (D[0]-1 + D[5] > D[1] + D[2] + D[3] + D[4])return 0;\\n if (D[1] + D[3] > D[0] + D[2] + D[5] + D[4])return 0;\\n if (D[2] + D[4] > D[1] + D[0] + D[3] + D[5])return 0;\\n return 1;\\n}\\n\\nvoid solve(vll D, ll S) {\\n clock_t start = clock();\\n ll P, Q;\\n cin >> P >> Q;\\n P--; Q -= P;\\n string AN ;\\n rep(i,S)AN.push_back('Z');\\n sort(all(D));\\n ll MX=D[5];\\n do {\\n vll P = D;\\n string R = \\\"\\\";\\n string G = \\\"ENSW\\\";\\n bool is_same=1;\\n rep(i, S) {\\n bool is_OK = 0;\\n rep(k, 4) {\\n if(i==0&&k!=0)break;\\n roll(P, G[k]);\\n if (is_valid(P)&&P[0]>0) {\\n P[0]--;\\n R.push_back(G[k]);\\n if(is_same&&G[k]>AN[i]){\\n is_OK = 0;\\n }\\n if(G[k]<AN[i])is_same=0;\\n is_OK = 1;\\n break;\\n }\\n roll(P,G[3-k]);\\n }\\n if (!is_OK){\\n R = \\\"Z\\\";\\n break;\\n }\\n }\\n chmin(AN, R);\\n } while (next_permutation(all(D)));\\n if (AN == \\\"Z\\\") {\\n cout << \\\"impossible\\\" << endl;\\n }\\n else {\\n // cout<<\\\"OK\\\"<<endl;\\n cout << AN.substr(P, Q) << endl;\\n }\\n clock_t end = clock();\\n\\n // const double time = static_cast<double>(end - start) / CLOCKS_PER_SEC * 1000.0;\\n // cout<<time<<endl;\\n}\\n\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n\\n vll D(6);\\n while (1) {\\n ll S = 0;\\n rep(i, 6) {\\n cin >> D[i];\\n S += D[i];\\n }\\n if (S == 0)return 0;\\n solve(D, S);\\n }\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1150,\n \"memory_kb\": 3496,\n \"score_of_the_acc\": -0.17,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1197_9324057\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#include <time.h>\\nusing namespace std;\\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};\\ntemplate<class T>\\nbool chmin(T& p, T q) {\\n if (p > q) {\\n p = q; return 1;\\n }\\n return 0;\\n};\\n\\n\\nvll roll(vll &D, char C) {\\n vll res = D;\\n if (C == 'E') {\\n res[0] = D[1];\\n res[1] = D[5];\\n res[5] = D[3];\\n res[3] = D[0];\\n }\\n else if (C == 'W'){\\n res[0] = D[3];\\n res[3] = D[5];\\n res[5] = D[1];\\n res[1] = D[0];\\n }\\n else if (C == 'N') {\\n res[0] = D[4];\\n res[4] = D[5];\\n res[5] = D[2];\\n res[2] = D[0];\\n }\\n else if (C == 'S'){\\n res[0] = D[2];\\n res[2] = D[5];\\n res[5] = D[4];\\n res[4] = D[0];\\n }\\n return res;\\n}\\n\\nbool is_valid(vll &D) {\\n if (D[0]-1 + D[5] > D[1] + D[2] + D[3] + D[4])return 0;\\n if (D[1] + D[3] > D[0] + D[2] + D[5] + D[4])return 0;\\n if (D[2] + D[4] > D[1] + D[0] + D[3] + D[5])return 0;\\n\\n return 1;\\n}\\n\\nvoid solve(vll D, ll S) {\\n clock_t start = clock();\\n ll P, Q;\\n cin >> P >> Q;\\n P--; Q -= P;\\n string AN ;\\n rep(i,S)AN.push_back('Z');\\n sort(all(D));\\n ll MX=D[5];\\n do {\\n vll P = D;\\n string R = \\\"\\\";\\n string G = \\\"ENSW\\\";\\n bool is_same=1;\\n rep(i, S) {\\n bool is_OK = 0;\\n rep(k, 4) {\\n if(i==0&&k!=0)break;\\n vll NP = roll(P, G[k]);\\n if (is_valid(NP)&&NP[0]>0) {\\n P = NP;\\n P[0]--;\\n R.push_back(G[k]);\\n if(is_same&&G[k]>AN[i]){\\n is_OK = 0;\\n }\\n if(G[k]<AN[i])is_same=0;\\n is_OK = 1;\\n break;\\n }\\n }\\n if (!is_OK){\\n R = \\\"Z\\\";\\n break;\\n }\\n }\\n chmin(AN, R);\\n } while (next_permutation(all(D)));\\n if (AN == \\\"Z\\\") {\\n cout << \\\"impossible\\\" << endl;\\n }\\n else {\\n // cout<<\\\"OK\\\"<<endl;\\n cout << AN.substr(P, Q) << endl;\\n }\\n clock_t end = clock();\\n\\n // const double time = static_cast<double>(end - start) / CLOCKS_PER_SEC * 1000.0;\\n // cout<<time<<endl;\\n}\\n\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n\\n vll D(6);\\n while (1) {\\n ll S = 0;\\n rep(i, 6) {\\n cin >> D[i];\\n S += D[i];\\n }\\n if (S == 0)return 0;\\n solve(D, S);\\n }\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4490,\n \"memory_kb\": 3528,\n \"score_of_the_acc\": -0.7077,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1197_9298481\",\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>\\nbool chmax(T& a, const T& b) {\\n return a < b ? (a = b, 1) : 0;\\n}\\ntemplate <typename T>\\nbool chmin(T& a, const T& b) {\\n return a > b ? (a = b, 1) : 0;\\n}\\n\\nstruct Die {\\n int top = 1, south = 2, east = 3, west = 4, north = 5, bottom = 6;\\n\\n void roll(char dir) {\\n if (dir == 'N') {\\n int tmp = top;\\n top = south;\\n south = bottom;\\n bottom = north;\\n north = tmp;\\n } else if (dir == 'E') {\\n int tmp = top;\\n top = west;\\n west = bottom;\\n bottom = east;\\n east = tmp;\\n } else if (dir == 'W') {\\n int tmp = top;\\n top = east;\\n east = bottom;\\n bottom = west;\\n west = tmp;\\n } else if (dir == 'S') {\\n int tmp = top;\\n top = north;\\n north = bottom;\\n bottom = south;\\n south = tmp;\\n } else {\\n assert(false);\\n }\\n }\\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];\\n if (i < (int)v.size() - 1) os << \\\" \\\";\\n }\\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 const string dir = \\\"ENSW\\\";\\n\\n auto check = [&](vector<int>& val, int cur) {\\n int sum = 0;\\n rep(i, 0, 6) {\\n if (val[i] < 0) return false;\\n sum += val[i];\\n }\\n rep(i, 0, 3) {\\n int x = val[i] + val[5 - i];\\n if (i == min(cur, 5 - i)) {\\n if (sum - x < x) return false;\\n } else {\\n if (sum - x < x - 1) return false;\\n }\\n }\\n return true;\\n };\\n\\n while (true) {\\n vector<int> t(6);\\n int sum = 0;\\n for (auto& x : t) cin >> x, sum += x;\\n if (t[5] == 0) break;\\n int p, q;\\n cin >> p >> q;\\n --p;\\n\\n string ans = \\\"Z\\\";\\n\\n vector<int> idx(6);\\n iota(all(idx), 0);\\n do {\\n vector<int> val(6);\\n rep(v, 0, 6) val[v] = t[idx[v]];\\n if (val[0] == 0) continue;\\n --val[0];\\n string res = \\\"E\\\";\\n Die die;\\n die.roll('N');\\n die.roll('N');\\n // 1 is facing down\\n\\n int edges = sum - 1;\\n rep(t, 0, sum - 1) {\\n char move = '?';\\n --edges;\\n for (char c : dir) {\\n die.roll(c);\\n --val[die.bottom - 1];\\n if (check(val, die.bottom - 1)) {\\n move = c;\\n break;\\n } else {\\n ++val[die.bottom - 1];\\n die.roll(c);\\n die.roll(c);\\n die.roll(c);\\n }\\n }\\n if (move == '?') {\\n res = \\\"Z\\\";\\n break;\\n }\\n res.push_back(move);\\n }\\n chmin(ans, res);\\n } while (next_permutation(all(idx)));\\n\\n cout << (ans == \\\"Z\\\" ? \\\"impossible\\\" : ans.substr(p, q - p)) << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2210,\n \"memory_kb\": 3456,\n \"score_of_the_acc\": -0.326,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1197_9248869\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"Ofast\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n\\nusing ll = long long;\\n\\ntemplate<class T>\\nbool chmin(T &a, const T &b) {if (a > b) {a = b; return 1;} return 0;}\\n\\nbool is_end = false;\\n\\nstring ENSW = \\\"ENSW\\\";\\n\\n// origin = {0, 1, 2, 3, 4, 5}\\nint rotate_dice[4][6] = \\n{\\n {2, 1, 5, 0, 4, 3}, // to E\\n {4, 0, 2, 3, 5, 1}, // to N\\n {1, 5, 2, 3, 0, 4}, // to S\\n {3, 1, 0, 5, 4, 2} // to W\\n};\\n\\nbool isvalid(const array<int, 6> &vec)\\n{\\n if (vec[0] < 0) return false;\\n int sum = accumulate(vec.begin(), vec.end(), 0);\\n \\n if (2 * vec[0] + 2 * vec[5] > sum) return false;\\n if (2 * vec[1] + 2 * vec[4] - 1 > sum) return false;\\n if (2 * vec[2] + 2 * vec[3] - 1 > sum) return false;\\n \\n return true;\\n}\\n\\nbool is_zero(const array<int, 6> &dice)\\n{\\n for (uint i = 0; i < 6; ++i)\\n {\\n if (dice[i] != 0) return false;\\n }\\n return true;\\n}\\n\\n\\nvector<int> global_vec(30000 + 100);\\n\\nbool dfs(int depth, array<int, 6> dice)\\n{\\n if (depth == 0) return true;\\n \\n for (uint dir = 0; dir < 4; ++dir)\\n {\\n array<int, 6> ndice = dice;\\n for (int j = 0; j < 6; ++j) ndice[j] = dice[rotate_dice[dir][j]];\\n ndice[0] -= 1;\\n \\n if (!isvalid(ndice)) continue;\\n \\n global_vec[depth] = dir;\\n if (dfs(depth - 1, ndice)) return true;\\n // global_vec.pop_back();\\n }\\n \\n return false;\\n}\\n\\n\\nvoid solve()\\n{\\n array<int, 6> T;\\n for (uint i = 0; i < 6; ++i) cin >> T[i];\\n if (T[5] == 0)\\n {\\n is_end = true;\\n return;\\n }\\n int P, Q; cin >> P >> Q;\\n P--, Q--;\\n \\n int sum = accumulate(T.begin(), T.end(), 0);\\n \\n string res = \\\"Z\\\";\\n do\\n {\\n \\n if (dfs(sum, T))\\n {\\n string tmp = \\\"\\\";\\n for (uint i = sum; i > 0; --i)\\n {\\n tmp += ENSW[global_vec[i]];\\n }\\n chmin(res, tmp);\\n }\\n \\n } while (next_permutation(T.begin(), T.end()));\\n \\n if (res == \\\"Z\\\") cout << \\\"impossible\\\" << endl;\\n else\\n {\\n string ans = res.substr(P, Q + 1 - P);\\n cout << ans << endl;\\n // cerr << -1 << endl;\\n // cout << res << endl;\\n }\\n \\n return;\\n}\\n\\nint main()\\n{\\n while (!is_end)\\n {\\n solve();\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1540,\n \"memory_kb\": 6696,\n \"score_of_the_acc\": -1.163,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1197_9070212\",\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\\nconst string op = \\\"ENSW\\\";\\nusing dice = array<int, 6>;\\nenum { l, r, f, b, d, u };\\nconst vector<dice> g = {\\n {d, u, f, b, r, l},\\n {l, r, d, u, b, f},\\n {l, r, u, d, f, b},\\n {u, d, f, b, l, r}\\n};\\n\\nstring solve(dice t) {\\n sort(t);\\n const int len = accumulate(t.begin(), t.end(), 0);\\n string ans(len, 'Z');\\n\\n auto check = [&](dice& x) -> bool {\\n for(int i : rep(6)) if(x[i] < 0) return false;\\n int sum = accumulate(x.begin(), x.end(), 0);\\n return x[0] + x[1] <= sum - (x[0] + x[1]) + 1\\n and x[2] + x[3] <= sum - (x[2] + x[3]) + 1\\n and x[4] + x[5] <= sum - (x[4] + x[5]) + 0;\\n };\\n\\n do {\\n if(check(t)) {\\n string s = \\\"\\\";\\n dice x = t;\\n while(x != dice{}) {\\n for(int k : rep(4)) {\\n dice nx;\\n for(int i : rep(6)) nx[i] = x[g[k][i]];\\n nx[4] -= 1;\\n if(check(nx)) {\\n s += op[k];\\n x = move(nx);\\n break;\\n }\\n }\\n }\\n chmin(ans, s);\\n }\\n } while(next_permutation(t.begin(), t.end()));\\n\\n int p = in(), q = in(); p--;\\n if(ans[0] == 'Z') return \\\"impossible\\\";\\n return move(ans.substr(p, q - p));\\n}\\n\\nint main() {\\n while(true) {\\n dice t;\\n for(int i : rep(6)) t[i] = in();\\n if(t == dice{}) return 0;\\n print(solve(t));\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1570,\n \"memory_kb\": 3504,\n \"score_of_the_acc\": -0.2387,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1197_9070202\",\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\\nconst string op = \\\"ENSW\\\";\\nenum { l, r, f, b, d, u };\\nconst vector<vector<int>> g = {\\n {d, u, f, b, r, l},\\n {l, r, d, u, b, f},\\n {l, r, u, d, f, b},\\n {u, d, f, b, l, r}\\n};\\n\\nstring solve(vector<int> t) {\\n sort(t);\\n const int len = accumulate(t.begin(), t.end(), 0);\\n string ans(len, 'Z');\\n\\n auto check = [&](vector<int>& x) -> bool {\\n for(int i : rep(6)) if(x[i] < 0) return false;\\n int sum = accumulate(x.begin(), x.end(), 0);\\n return x[0] + x[1] <= sum - (x[0] + x[1]) + 1\\n and x[2] + x[3] <= sum - (x[2] + x[3]) + 1\\n and x[4] + x[5] <= sum - (x[4] + x[5]) + 0;\\n };\\n\\n do {\\n if(check(t)) {\\n string s = \\\"\\\";\\n vector<int> x = t;\\n while(x != vector(6, 0)) {\\n for(int k : rep(4)) {\\n vector<int> nx(6);\\n for(int i : rep(6)) nx[i] = x[g[k][i]];\\n nx[4] -= 1;\\n if(check(nx)) {\\n s += op[k];\\n x = move(nx);\\n break;\\n }\\n }\\n }\\n chmin(ans, s);\\n }\\n } while(next_permutation(t.begin(), t.end()));\\n\\n int p = in(), q = in(); p--;\\n if(ans[0] == 'Z') return \\\"impossible\\\";\\n return move(ans.substr(p, q - p));\\n}\\n\\nint main() {\\n while(true) {\\n vector<int> t = in(6);\\n if(t == vector<int>(6, 0)) return 0;\\n print(solve(t));\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6360,\n \"memory_kb\": 3492,\n \"score_of_the_acc\": -0.9932,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1197_9035374\",\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;\\n\\nbool check(vector<int> mass) {\\n bool ok = true;\\n if(mass[0]+mass[1] > mass[2]+mass[3]+mass[4]+mass[5]) ok = false;\\n if(mass[2]+mass[3]-1 > mass[0]+mass[1]+mass[4]+mass[5]) ok = false;\\n if(mass[4]+mass[5]-1 > mass[0]+mass[1]+mass[2]+mass[3]) ok = false;\\n return ok;\\n}\\nint main(void) {\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n vector<char> dir = {'E', 'N', 'S', 'W'};\\n\\n while(1) {\\n string min_ans = \\\"\\\";\\n vector<int> mass(6);\\n rep(i, 0, 6) cin >> mass[i];\\n bool end = true;\\n rep(i, 0, 6) if(mass[i] != 0) end = false;\\n if(end) break;\\n int ans_l = 0;\\n rep(i, 0, 6) ans_l += mass[i];\\n do {\\n string ans = \\\"\\\";\\n vector<int> n_mass(6);\\n rep(i, 0, 6) n_mass[i] = mass[i];\\n\\n if(!check(n_mass)) continue;\\n while(1) {\\n bool end = true;\\n rep(i, 0, 6) if(n_mass[i] != 0) end = false;\\n if(end) {\\n if(min_ans == \\\"\\\") min_ans = ans;\\n else if(min_ans > ans) min_ans = ans;\\n break;\\n }\\n if(!check(n_mass)) break;\\n rep(i, 0, 4) {\\n vector<int> nv;\\n if(i==0 and n_mass[2] != 0) {\\n nv = {n_mass[2]-1, n_mass[3], n_mass[1], n_mass[0], n_mass[4], n_mass[5]};\\n if(check(nv)) {\\n swap(n_mass, nv);\\n ans.push_back(dir[i]);\\n break;\\n }\\n }\\n else if(i==1 and n_mass[4] != 0) {\\n nv = {n_mass[4]-1, n_mass[5], n_mass[2], n_mass[3], n_mass[1], n_mass[0]};\\n if(check(nv)) {\\n swap(n_mass, nv);\\n ans.push_back(dir[i]);\\n break;\\n }\\n }\\n else if(i==2 and n_mass[5] != 0) {\\n nv = {n_mass[5]-1, n_mass[4], n_mass[2], n_mass[3], n_mass[0], n_mass[1]};\\n if(check(nv)) {\\n swap(n_mass, nv);\\n ans.push_back(dir[i]);\\n break;\\n }\\n }\\n else if(i==3 and n_mass[3] != 0) {\\n nv = {n_mass[3]-1, n_mass[2], n_mass[0], n_mass[1], n_mass[4], n_mass[5]};\\n if(check(nv)) {\\n swap(n_mass, nv);\\n ans.push_back(dir[i]);\\n break;\\n }\\n }\\n \\n }\\n }\\n } while(next_permutation(mass.begin(), mass.end()));\\n // cout << endl << endl << min_ans << endl;\\n int p, q;\\n cin >> p >> q;\\n if(min_ans == \\\"\\\") {\\n cout << \\\"impossible\\\" << endl;\\n continue;\\n }\\n for(int i=p-1; i<q; i++) cout << min_ans[i];\\n cout << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6830,\n \"memory_kb\": 3548,\n \"score_of_the_acc\": -1.0838,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1197_7984127\",\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 >= (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\\n#define debug(...) \\\\\\n std::cerr << \\\"LINE: \\\" << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"]:\\\", \\\\\\n debug_out(__VA_ARGS__)\\n\\nvoid debug_out() {\\n std::cerr << std::endl;\\n}\\n\\ntemplate <typename Head, typename... Tail> void debug_out(Head h, Tail... t) {\\n std::cerr << \\\" \\\" << h;\\n if (sizeof...(t) > 0) std::cerr << \\\" :\\\";\\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 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\\ntypedef std::string::const_iterator State;\\n\\nbool expect(State &begin, char expected) {\\n return *begin == expected;\\n}\\n\\nvoid consume(State &begin, char expected) {\\n assert(*begin == expected);\\n begin++;\\n}\\n\\nbool isdigit(char c) {\\n return '0' <= c && c <= '9';\\n}\\n\\nbool isAlpha(char c) {\\n return 'A' <= c && c <= 'Z';\\n}\\n\\nbool isalpha(char c) {\\n return 'a' <= c && c <= 'z';\\n}\\n\\nstruct Dice {\\n int up = 0, front = 1, right = 2, left = 3, back = 4, down = 5;\\n\\n Dice() = default;\\n\\n void setval(const std::vector<int> &_val) {\\n assert(int(_val.size()) == 6);\\n val = _val;\\n }\\n\\n // y++\\n void rollN() {\\n int buff = down;\\n down = back;\\n back = up;\\n up = front;\\n front = buff;\\n }\\n\\n // y--\\n void rollS() {\\n int buff = down;\\n down = front;\\n front = up;\\n up = back;\\n back = buff;\\n }\\n\\n // x++\\n void rollE() {\\n int buff = down;\\n down = right;\\n right = up;\\n up = left;\\n left = buff;\\n }\\n\\n // x--\\n void rollW() {\\n int buff = down;\\n down = left;\\n left = up;\\n up = right;\\n right = buff;\\n }\\n\\n // 右回転(時計回り)\\n void rollR() {\\n int buff = right;\\n right = back;\\n back = left;\\n left = front;\\n front = buff;\\n }\\n\\n // 左回転(反時計回り)\\n void rollL() {\\n int buff = left;\\n left = back;\\n back = right;\\n right = front;\\n front = buff;\\n }\\n\\n void roll(char c) {\\n if (c == 'N')\\n rollN();\\n else if (c == 'S')\\n rollS();\\n else if (c == 'E')\\n rollE();\\n else if (c == 'W')\\n rollW();\\n else if (c == 'R')\\n rollR();\\n else if (c == 'L')\\n rollL();\\n else\\n assert(0);\\n }\\n\\n int get_index(int x) const {\\n for (int i = 0; i < 6; i++) {\\n if (val[i] == x) return i;\\n }\\n assert(0);\\n }\\n\\n std::vector<Dice> makeDice() const {\\n std::vector<Dice> ret;\\n for (int i = 0; i < 6; i++) {\\n Dice d(*this);\\n if (i == 1) d.rollN();\\n if (i == 2) d.rollS();\\n if (i == 3) {\\n d.rollS();\\n d.rollS();\\n }\\n if (i == 4) d.rollL();\\n if (i == 5) d.rollR();\\n for (int j = 0; j < 4; j++) {\\n ret.emplace_back(d);\\n d.rollE();\\n }\\n }\\n return ret;\\n }\\n\\n int top_val() const {\\n return val[up];\\n }\\n\\n int right_val() const {\\n return val[right];\\n }\\n\\n int left_val() const {\\n return val[left];\\n }\\n\\n int front_val() const {\\n return val[front];\\n }\\n\\n int back_val() const {\\n return val[back];\\n }\\n\\n int down_val() const {\\n return val[down];\\n }\\n\\n std::vector<int> now() const {\\n std::vector<int> ret(6);\\n ret[0] = top_val();\\n ret[1] = front_val();\\n ret[2] = right_val();\\n ret[3] = left_val();\\n ret[4] = back_val();\\n ret[5] = down_val();\\n return ret;\\n }\\n\\n std::vector<int> val = {0, 1, 2, 3, 4, 5};\\n};\\n\\nbool input(std::vector<int> &t) {\\n int zero = 0;\\n rep(i,0,6) {\\n std::cin >> t[i];\\n if(t[i] == 0) zero++;\\n }\\n if(zero == 6) return false;\\n return true;\\n}\\n\\nint main() {\\n std::vector<int> t(6);\\n while(input(t)) {\\n int sum = 0;\\n rep(i,0,6) sum += t[i];\\n int p,q;\\n std::cin >> p >> q;\\n p--;\\n std::vector<int> idxs(6);\\n std::iota(all(idxs), 0);\\n std::string ans = \\\"\\\";\\n do {\\n std::vector<int> val(6);\\n rep(i,0,6) val[i] = t[idxs[i]];\\n Dice dice;\\n dice.setval(val);\\n auto check = [&]() -> bool {\\n int na = dice.top_val() + dice.down_val();\\n int nb = dice.left_val() + dice.right_val();\\n int nc = dice.front_val() + dice.back_val();\\n return dice.top_val() >= 0 && na <= nb + nc && nb <= 1 + nc + na && nc <= 1 + na + nb;\\n };\\n if(!check()) {\\n continue;\\n }\\n std::string s = \\\"\\\";\\n rep(_,0,sum) {\\n {\\n dice.rollE();\\n dice.val[dice.up]--;\\n if(check()) {\\n s += 'E';\\n continue;\\n }\\n dice.val[dice.up]++;\\n dice.rollW();\\n }\\n {\\n dice.rollN();\\n dice.val[dice.up]--;\\n if(check()) {\\n s += 'N';\\n continue;\\n }\\n dice.val[dice.up]++;\\n dice.rollS();\\n }\\n {\\n dice.rollS();\\n dice.val[dice.up]--;\\n if(check()) {\\n s += 'S';\\n continue;\\n }\\n dice.val[dice.up]++;\\n dice.rollN();\\n } {\\n dice.rollW();\\n dice.val[dice.up]--;\\n if(check()) {\\n s += 'W';\\n continue;\\n }\\n dice.val[dice.up]++;\\n dice.rollE();\\n }\\n assert(0);\\n }\\n if(ans.empty()) ans = s;\\n else chmin(ans, s);\\n } while(std::next_permutation(all(idxs)));\\n if(ans.empty()) {\\n std::cout << \\\"impossible\\\\n\\\";\\n continue;\\n }\\n std::cout << ans.substr(p, q-p) << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 640,\n \"memory_kb\": 3468,\n \"score_of_the_acc\": -0.0811,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1197_6021158\",\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\\ntemplate<typename T = int>\\nstruct Die {\\n array<T, 6> fs;\\n int& top() { return fs[0]; }\\n int& south() { return fs[1]; }\\n int& east() { return fs[2]; }\\n int& west() { return fs[3]; }\\n int& north() { return fs[4]; }\\n int& bottom() { return fs[5]; }\\n\\n int sum() { return fs[0] + fs[1] + fs[2] + fs[3] + fs[4] + fs[5]; }\\n\\n void roll(char c) {\\n //the view from above\\n // N\\n //W E\\n // S\\n string b(\\\"EWNSRL\\\");\\n int v[6][4] = { {0,3,5,2},\\n {0,2,5,3},\\n {0,1,5,4},\\n {0,4,5,1},\\n {1,2,4,3},\\n {1,3,4,2} };\\n for (int k = 0; k < 6; k++) {\\n if (b[k] != c) continue;\\n int t = fs[v[k][0]];\\n fs[v[k][0]] = fs[v[k][1]];\\n fs[v[k][1]] = fs[v[k][2]];\\n fs[v[k][2]] = fs[v[k][3]];\\n fs[v[k][3]] = t;\\n break;\\n }\\n }\\n using ll = long long;\\n ll hash() {\\n ll res = 0;\\n for (int i = 0; i < 6; i++) res = res * 256 + fs[i];\\n return res;\\n }\\n bool operator==(const Die& d) const {\\n for (int i = 0; i < 6; i++) if (fs[i] != d.fs[i]) return 0;\\n return 1;\\n }\\n};\\n\\ntemplate<typename T>\\nvector<Die<T>> makeDice(Die<T> d) {\\n vector<Die<T>> res;\\n for (int i = 0; i < 6; i++) {\\n Die t(d);\\n if (i == 1) t.roll('N');\\n if (i == 2) t.roll('S');\\n if (i == 3) t.roll('S'), t.roll('S');\\n if (i == 4) t.roll('L');\\n if (i == 5) t.roll('R');\\n for (int k = 0; k < 4; k++) {\\n res.emplace_back(t);\\n t.roll('E');\\n }\\n }\\n return res;\\n}\\n\\nstring rotates(\\\"ENSW\\\");\\nbool is_valid(Die<int>& die) {\\n int sum = die.sum();\\n if (sum == 0) return true;\\n if (sum % 2 == 1) {\\n for (var&& c : rotates) {\\n var nxt = die;\\n nxt.roll(c);\\n if (nxt.bottom() == 0) continue;\\n nxt.bottom()--;\\n if (is_valid(nxt)) return true;\\n }\\n return false;\\n }\\n\\n int X = die.fs[2] + die.fs[3];\\n int Y = die.fs[1] + die.fs[4];\\n int Z = die.fs[0] + die.fs[5];\\n\\n if (X > Y) swap(Y, X);\\n if (X + Y < Z) return true;\\n if (Z < Y - X) return false;\\n Z -= Y - X;\\n\\n return Z % 2 == 0;\\n}\\n\\nbool solve() {\\n vector<int> t(6);\\n for (var&& elem : t) cin >> elem;\\n var sum = accumulate(t.begin(), t.end(), 0);\\n if (sum == 0) return false;\\n int p, q;\\n cin >> p >> q;\\n\\n string res;\\n\\n sort(t.begin(), t.end());\\n do\\n {\\n Die die;\\n for (int i = 0; i < t.size(); i++) die.fs[i] = t[i];\\n \\n // if (die.bottom() == 0) continue;\\n // die.bottom()--;\\n\\n bool same = res.size() == sum;\\n\\n string cur_res = \\\"\\\";\\n for (int cnt = 0; cnt < sum; cnt++) {\\n for (var c : rotates) {\\n // 枝刈り\\n if (same && res[cnt] < c) break;\\n\\n var nxt = die;\\n nxt.roll(c);\\n if (nxt.bottom() == 0) continue;\\n nxt.bottom()--;\\n\\n if (is_valid(nxt)) {\\n die = nxt;\\n cur_res += c;\\n if (same && cur_res[cnt] < res[cnt]) same = false;\\n goto end;\\n }\\n }\\n break;\\n end:;\\n }\\n\\n if (cur_res.size() != sum) continue;\\n res = cur_res;\\n\\n } while (next_permutation(t.begin(), t.end()));\\n\\n if (res == \\\"\\\") {\\n cout << \\\"impossible\\\" << endl;\\n }\\n else {\\n cout << res.substr(p - 1, q - p + 1) << endl;\\n }\\n\\n \\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\": 1340,\n \"memory_kb\": 3428,\n \"score_of_the_acc\": -0.1802,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1197_6020837\",\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\\nbool is_opposite[6][6];\\n\\ntemplate<typename T = int>\\nstruct Die {\\n array<T, 6> fs;\\n int& top() { return fs[0]; }\\n int& south() { return fs[1]; }\\n int& east() { return fs[2]; }\\n int& west() { return fs[3]; }\\n int& north() { return fs[4]; }\\n int& bottom() { return fs[5]; }\\n\\n int sum() { return fs[0] + fs[1] + fs[2] + fs[3] + fs[4] + fs[5]; }\\n\\n void roll(char c) {\\n //the view from above\\n // N\\n //W E\\n // S\\n string b(\\\"EWNSRL\\\");\\n int v[6][4] = { {0,3,5,2},\\n {0,2,5,3},\\n {0,1,5,4},\\n {0,4,5,1},\\n {1,2,4,3},\\n {1,3,4,2} };\\n for (int k = 0; k < 6; k++) {\\n if (b[k] != c) continue;\\n int t = fs[v[k][0]];\\n fs[v[k][0]] = fs[v[k][1]];\\n fs[v[k][1]] = fs[v[k][2]];\\n fs[v[k][2]] = fs[v[k][3]];\\n fs[v[k][3]] = t;\\n break;\\n }\\n }\\n using ll = long long;\\n ll hash() {\\n ll res = 0;\\n for (int i = 0; i < 6; i++) res = res * 256 + fs[i];\\n return res;\\n }\\n bool operator==(const Die& d) const {\\n for (int i = 0; i < 6; i++) if (fs[i] != d.fs[i]) return 0;\\n return 1;\\n }\\n};\\n\\ntemplate<typename T>\\nvector<Die<T>> makeDice(Die<T> d) {\\n vector<Die<T>> res;\\n for (int i = 0; i < 6; i++) {\\n Die t(d);\\n if (i == 1) t.roll('N');\\n if (i == 2) t.roll('S');\\n if (i == 3) t.roll('S'), t.roll('S');\\n if (i == 4) t.roll('L');\\n if (i == 5) t.roll('R');\\n for (int k = 0; k < 4; k++) {\\n res.emplace_back(t);\\n t.roll('E');\\n }\\n }\\n return res;\\n}\\n\\nbool check(array<int, 6>& x) {\\n int Z = x[0] + x[5];\\n int Y = x[1] + x[4];\\n int X = x[2] + x[3];\\n\\n if (X > Y) swap(Y, X);\\n\\n if (X + Y < Z) return true;\\n\\n if (Z < Y - X) return false;\\n\\n Z -= Y - X;\\n\\n return Z % 2 == 0;\\n}\\n\\nstring rotates(\\\"ENSW\\\");\\nbool is_valid(Die<int>& die) {\\n int sum = die.sum();\\n if (sum == 0) return true;\\n if (sum % 2 == 1) {\\n for (var&& c : rotates) {\\n var nxt = die;\\n nxt.roll(c);\\n if (nxt.bottom() == 0) continue;\\n nxt.bottom()--;\\n if (is_valid(nxt)) return true;\\n }\\n return false;\\n }\\n\\n return check(die.fs);\\n\\n int fst = 0;\\n int fstInd = -1;\\n int snd = 0;\\n int sndInd = -1;\\n for (int i = 0; i < 6; i++) {\\n if (fst <= die.fs[i]) {\\n snd = fst;\\n sndInd = fstInd;\\n fst = die.fs[i];\\n fstInd = i;\\n }\\n else if (snd <= die.fs[i]) {\\n snd = die.fs[i];\\n sndInd = i;\\n }\\n }\\n\\n assert(sndInd != -1);\\n \\n if (not is_opposite[fstInd][sndInd]) return true;\\n if (fst + snd <= sum / 2) return true;\\n return false;\\n}\\n\\nbool solve() {\\n vector<int> t(6);\\n for (var&& elem : t) cin >> elem;\\n var sum = accumulate(t.begin(), t.end(), 0);\\n if (sum == 0) return false;\\n int p, q;\\n cin >> p >> q;\\n\\n string res;\\n\\n sort(t.begin(), t.end());\\n do\\n {\\n Die die;\\n for (int i = 0; i < t.size(); i++) die.fs[i] = t[i];\\n \\n // if (die.bottom() == 0) continue;\\n // die.bottom()--;\\n\\n bool same = res.size() == sum;\\n\\n string cur_res = \\\"\\\";\\n for (int cnt = 0; cnt < sum; cnt++) {\\n for (var c : rotates) {\\n // 枝刈り\\n if (same && res[cnt] < c) break;\\n\\n var nxt = die;\\n nxt.roll(c);\\n if (nxt.bottom() == 0) continue;\\n nxt.bottom()--;\\n\\n if (is_valid(nxt)) {\\n die = nxt;\\n cur_res += c;\\n if (same && cur_res[cnt] < res[cnt]) same = false;\\n goto end;\\n }\\n }\\n break;\\n end:;\\n }\\n\\n if (cur_res.size() != sum) continue;\\n res = cur_res;\\n\\n } while (next_permutation(t.begin(), t.end()));\\n\\n if (res == \\\"\\\") {\\n cout << \\\"impossible\\\" << endl;\\n }\\n else {\\n cout << res.substr(p - 1, q - p + 1) << endl;\\n }\\n\\n \\n return true;\\n}\\n\\nint main() {\\n is_opposite[0][5] = true;\\n is_opposite[5][0] = true;\\n\\n is_opposite[1][4] = true;\\n is_opposite[4][1] = true;\\n\\n is_opposite[2][3] = true;\\n is_opposite[3][2] = true;\\n\\n\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n while (solve()){}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1320,\n \"memory_kb\": 3476,\n \"score_of_the_acc\": -0.191,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1197_5978745\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nstruct Dice {\\n std::array<int, 6> surface;\\n\\n Dice(int TOP = 1, int FRONT = 2) {\\n assert(1 <= TOP and TOP <= 6);\\n assert(1 <= FRONT and FRONT <= 6);\\n assert(TOP + FRONT != 7);\\n surface[0] = TOP;\\n surface[1] = FRONT;\\n surface[2] = dice[TOP - 1][FRONT - 1];\\n surface[3] = 7 - surface[2];\\n surface[4] = 7 - surface[1];\\n surface[5] = 7 - surface[0];\\n }\\n\\n Dice(const std::vector<int>& v) {\\n assert(v.size() == 6);\\n for (size_t i = 0; i < 6; i++) surface[i] = v[i];\\n }\\n\\n const int& top() const { return surface[0]; }\\n const int& front() const { return surface[1]; }\\n const int& right() const { return surface[2]; }\\n const int& left() const { return surface[3]; }\\n const int& back() const { return surface[4]; }\\n const int& bottom() const { return surface[5]; }\\n const int& operator[](int k) const { return surface[k]; }\\n\\n int& top() { return surface[0]; }\\n int& front() { return surface[1]; }\\n int& right() { return surface[2]; }\\n int& left() { return surface[3]; }\\n int& back() { return surface[4]; }\\n int& bottom() { return surface[5]; }\\n int& operator[](int k) { return surface[k]; }\\n\\n bool operator==(const Dice& d) const { return surface == d.surface; }\\n bool operator!=(const Dice& d) const { return surface != d.surface; }\\n bool operator<(const Dice& d) const { return surface < d.surface; }\\n\\n int roll(int k) { // x++, x--, y++, y--, turn right, turn left\\n assert(0 <= k and k < 6);\\n int tmp = surface[code[k][0]];\\n for (int i = 0; i < 3; i++) surface[code[k][i]] = surface[code[k][i + 1]];\\n surface[code[k][3]] = tmp;\\n return surface[0];\\n }\\n\\n int rollc(char c) {\\n for (int k = 0; k < 6; k++) {\\n if (direction[k] != c) continue;\\n return roll(k);\\n }\\n assert(false);\\n }\\n\\n int hash() const {\\n int res = 0;\\n for (size_t i = 0; i < 6; i++) {\\n assert(1 <= surface[i] and surface[i] <= 6);\\n (res *= 6) += surface[i] - 1;\\n }\\n return res;\\n }\\n\\n std::vector<Dice> make_all() {\\n std::vector<Dice> res;\\n for (int i = 0; i < 6; i++) {\\n Dice d(*this);\\n if (i == 1) d.roll(2);\\n if (i == 2) d.roll(3);\\n if (i == 3) d.roll(3), d.roll(3);\\n if (i == 4) d.roll(5);\\n if (i == 5) d.roll(4);\\n for (int j = 0; j < 4; j++) {\\n res.emplace_back(d);\\n d.roll(0);\\n }\\n }\\n return res;\\n }\\n\\n Dice identifier() {\\n auto dices = make_all();\\n return *min_element(dices.begin(), dices.end());\\n }\\n\\nprivate:\\n const int dice[6][6] = {{0, 3, 5, 2, 4, 0}, {4, 0, 1, 6, 0, 3}, {2, 6, 0, 0, 1, 5},\\n {5, 1, 0, 0, 6, 2}, {3, 0, 6, 1, 0, 4}, {0, 4, 2, 5, 3, 0}};\\n const int code[6][4] = {{0, 3, 5, 2}, {0, 2, 5, 3}, {0, 1, 5, 4}, {0, 4, 5, 1}, {1, 2, 4, 3}, {1, 3, 4, 2}};\\n const char direction[6] = {'E', 'W', 'N', 'S', 'R', 'L'};\\n};\\n\\n/**\\n * @brief Dice\\n * @docs docs/util/Dice.md\\n */\\n\\nconst string directions = \\\"EWNS\\\";\\n\\nvoid solve(vector<int> t) {\\n string ans = \\\"\\\";\\n sort(t.begin(), t.end());\\n int sum = accumulate(t.begin(), t.end(), 0);\\n\\n do {\\n Dice dice(t);\\n string cur = \\\"\\\";\\n bool update = true;\\n for (int rest = sum - 1; rest >= 0 and exchange(update, false); rest--) {\\n for (int dir : {0, 2, 3, 1}) {\\n dice.roll(dir);\\n dice.bottom()--;\\n bool ok = true;\\n if (dice.bottom() < 0) ok = false;\\n for (int i = 0; i < 3; i++) {\\n int opposite = dice[i] + dice[5 - i];\\n if (opposite > rest - opposite + (i > 0)) ok = false;\\n }\\n if (ok) {\\n update = true;\\n cur += directions[dir];\\n break;\\n }\\n dice.bottom()++;\\n dice.roll(dir ^ 1);\\n }\\n }\\n if (!update) continue;\\n if (ans == \\\"\\\")\\n ans = cur;\\n else\\n ans = min(ans, cur);\\n } while (next_permutation(t.begin(), t.end()));\\n\\n int p, q;\\n cin >> p >> q;\\n if (ans == \\\"\\\") {\\n cout << \\\"impossible\\\" << '\\\\n';\\n return;\\n }\\n for (int i = --p; i < q; i++) cout << ans[i];\\n cout << '\\\\n';\\n}\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n vector<int> t(6);\\n while (1) {\\n for (int i = 0; i < 6; i++) cin >> t[i];\\n if (t.back() == 0) break;\\n solve(t);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 960,\n \"memory_kb\": 3484,\n \"score_of_the_acc\": -0.1364,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1197_5978741\",\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 <array>\\n#include <cassert>\\n#include <string>\\n#include <vector>\\n\\nstruct Dice {\\n std::array<int, 6> surface;\\n\\n Dice(int TOP = 1, int FRONT = 2) {\\n assert(1 <= TOP and TOP <= 6);\\n assert(1 <= FRONT and FRONT <= 6);\\n assert(TOP + FRONT != 7);\\n surface[0] = TOP;\\n surface[1] = FRONT;\\n surface[2] = dice[TOP - 1][FRONT - 1];\\n surface[3] = 7 - surface[2];\\n surface[4] = 7 - surface[1];\\n surface[5] = 7 - surface[0];\\n }\\n\\n Dice(const std::vector<int>& v) {\\n assert(v.size() == 6);\\n for (size_t i = 0; i < 6; i++) surface[i] = v[i];\\n }\\n\\n const int& top() const { return surface[0]; }\\n const int& front() const { return surface[1]; }\\n const int& right() const { return surface[2]; }\\n const int& left() const { return surface[3]; }\\n const int& back() const { return surface[4]; }\\n const int& bottom() const { return surface[5]; }\\n const int& operator[](int k) const { return surface[k]; }\\n\\n int& top() { return surface[0]; }\\n int& front() { return surface[1]; }\\n int& right() { return surface[2]; }\\n int& left() { return surface[3]; }\\n int& back() { return surface[4]; }\\n int& bottom() { return surface[5]; }\\n int& operator[](int k) { return surface[k]; }\\n\\n bool operator==(const Dice& d) const { return surface == d.surface; }\\n bool operator!=(const Dice& d) const { return surface != d.surface; }\\n bool operator<(const Dice& d) const { return surface < d.surface; }\\n\\n int roll(int k) { // x++, x--, y++, y--, turn right, turn left\\n assert(0 <= k and k < 6);\\n int tmp = surface[code[k][0]];\\n for (int i = 0; i < 3; i++) surface[code[k][i]] = surface[code[k][i + 1]];\\n surface[code[k][3]] = tmp;\\n return surface[0];\\n }\\n\\n int rollc(char c) {\\n for (int k = 0; k < 6; k++) {\\n if (direction[k] != c) continue;\\n return roll(k);\\n }\\n assert(false);\\n }\\n\\n int hash() const {\\n int res = 0;\\n for (size_t i = 0; i < 6; i++) {\\n assert(1 <= surface[i] and surface[i] <= 6);\\n (res *= 6) += surface[i] - 1;\\n }\\n return res;\\n }\\n\\n std::vector<Dice> make_all() {\\n std::vector<Dice> res;\\n for (int i = 0; i < 6; i++) {\\n Dice d(*this);\\n if (i == 1) d.roll(2);\\n if (i == 2) d.roll(3);\\n if (i == 3) d.roll(3), d.roll(3);\\n if (i == 4) d.roll(5);\\n if (i == 5) d.roll(4);\\n for (int j = 0; j < 4; j++) {\\n res.emplace_back(d);\\n d.roll(0);\\n }\\n }\\n return res;\\n }\\n\\n Dice identifier() {\\n auto dices = make_all();\\n return *min_element(dices.begin(), dices.end());\\n }\\n\\nprivate:\\n const int dice[6][6] = {{0, 3, 5, 2, 4, 0}, {4, 0, 1, 6, 0, 3}, {2, 6, 0, 0, 1, 5},\\n {5, 1, 0, 0, 6, 2}, {3, 0, 6, 1, 0, 4}, {0, 4, 2, 5, 3, 0}};\\n const int code[6][4] = {{0, 3, 5, 2}, {0, 2, 5, 3}, {0, 1, 5, 4}, {0, 4, 5, 1}, {1, 2, 4, 3}, {1, 3, 4, 2}};\\n const char direction[6] = {'E', 'W', 'N', 'S', 'R', 'L'};\\n};\\n\\n/**\\n * @brief Dice\\n * @docs docs/util/Dice.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 long long MOD = 1000000007;\\n// const long long MOD = 998244353;\\n\\nconst string directions = \\\"EWNS\\\";\\n\\nvoid solve(vector<int> t) {\\n string ans = \\\"\\\";\\n sort(t.begin(), t.end());\\n int sum = accumulate(t.begin(), t.end(), 0);\\n\\n do {\\n Dice dice(t);\\n string cur = \\\"\\\";\\n bool update = true;\\n for (int rest = sum - 1; rest >= 0 and exchange(update, false); rest--) {\\n for (int dir : {0, 2, 3, 1}) {\\n dice.roll(dir);\\n dice.bottom()--;\\n bool ok = true;\\n if (dice.bottom() < 0) ok = false;\\n for (int i = 0; i < 3; i++) {\\n int opposite = dice[i] + dice[5 - i];\\n if (opposite > rest - opposite + (i > 0)) ok = false;\\n }\\n if (ok) {\\n update = true;\\n cur += directions[dir];\\n break;\\n }\\n dice.bottom()++;\\n dice.roll(dir ^ 1);\\n }\\n }\\n if (!update) continue;\\n if (ans == \\\"\\\")\\n ans = cur;\\n else\\n ans = min(ans, cur);\\n } while (next_permutation(t.begin(), t.end()));\\n\\n int p, q;\\n cin >> p >> q;\\n if (ans == \\\"\\\") {\\n cout << \\\"impossible\\\" << '\\\\n';\\n return;\\n }\\n for (int i = --p; i < q; i++) cout << ans[i];\\n cout << '\\\\n';\\n}\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n vector<int> t(6);\\n while (1) {\\n for (int i = 0; i < 6; i++) cin >> t[i];\\n if (t.back() == 0) break;\\n solve(t);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 970,\n \"memory_kb\": 3560,\n \"score_of_the_acc\": -0.1601,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1197_5970955\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }\\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }\\n#define all(x) (x).begin(),(x).end()\\n#define fi first\\n#define se second\\n#define mp make_pair\\n#define si(x) int(x.size())\\nconst int mod=1000000007,MAX=200005,INF=1<<30;\\n\\nstruct dice{\\n int u,f,r,b,l,d;\\n \\n void init(int uu,int ff,int rr,int bb,int ll,int dd){\\n u=uu;\\n f=ff;\\n r=rr;\\n b=bb;\\n l=ll;\\n d=dd;\\n }\\n \\n void init(vector<int> S){\\n init(S[0],S[1],S[2],S[3],S[4],S[5]);\\n }\\n \\n void turnE(){\\n int save=r;\\n r=u;\\n u=l;\\n l=d;\\n d=save;\\n }\\n \\n void turnN(){\\n int save=b;\\n b=u;\\n u=f;\\n f=d;\\n d=save;\\n }\\n \\n void turnS(){\\n int save=f;\\n f=u;\\n u=b;\\n b=d;\\n d=save;\\n }\\n \\n void turnW(){\\n int save=l;\\n l=u;\\n u=r;\\n r=d;\\n d=save;\\n }\\n \\n bool check(){\\n int x=l+r,y=f+b,z=u+d;\\n if(d<0) return false;\\n if(x==0&&y==0&z==0) return true;\\n if(x>=y&&x>=z){\\n if(x<=y+z+1) return true;\\n else return false;\\n }\\n if(y>=x&&y>=z){\\n if(y<=x+z+1) return true;\\n else return false;\\n }\\n if(z>=x&&z>=y){\\n if(z<=x+y) return true;\\n else return false;\\n }\\n return false;\\n }\\n};\\n\\nint main(){\\n \\n std::ifstream in(\\\"text.txt\\\");\\n std::cin.rdbuf(in.rdbuf());\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n \\n while(1){\\n int sum=0;\\n vector<int> S(6);\\n for(int i=0;i<6;i++){\\n cin>>S[i];\\n sum+=S[i];\\n }\\n if(S.back()==0) break;\\n int s,t;cin>>s>>t;s--;\\n bool f=false;\\n do{\\n dice X;X.init(S);\\n if(X.check()) f=true;\\n }while(next_permutation(all(S)));\\n \\n if(!f){\\n cout<<\\\"impossible\\\\n\\\";\\n continue;\\n }\\n string ans=\\\"Z\\\";\\n sort(all(S));\\n \\n do{\\n dice X;X.init(S);\\n if(!X.check()) continue;\\n \\n string T;\\n for(int q=0;q<sum;q++){\\n X.turnE();\\n X.d--;\\n if(X.check()){\\n T+='E';\\n continue;\\n }else{\\n X.d++;\\n X.turnW();\\n }\\n \\n X.turnN();\\n X.d--;\\n if(X.check()){\\n T+='N';\\n continue;\\n }else{\\n X.d++;\\n X.turnS();\\n }\\n \\n X.turnS();\\n X.d--;\\n if(X.check()){\\n T+='S';\\n continue;\\n }else{\\n X.d++;\\n X.turnN();\\n }\\n \\n X.turnW();\\n X.d--;\\n if(X.check()){\\n T+='W';\\n continue;\\n }else{\\n X.d++;\\n X.turnE();\\n }\\n }\\n \\n chmin(ans,T);\\n \\n }while(next_permutation(all(S)));\\n \\n cout<<ans.substr(s,t-s)<<\\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 510,\n \"memory_kb\": 3308,\n \"score_of_the_acc\": -0.014,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1197_5951015\",\n \"code_snippet\": \"#include<iostream>\\n#include<cstdio>\\n#include<cstring>\\n#include<string>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<map>\\n#include<queue>\\n#include<deque>\\n#include<iomanip>\\n#include<tuple>\\n#include<cassert>\\n#include<set>\\n#include<complex>\\n#include<numeric>\\n#include<functional>\\n#include<unordered_map>\\n#include<unordered_set>\\nusing namespace std;\\ntypedef long long int LL;\\ntypedef pair<int,int> P;\\ntypedef pair<LL,LL> LP;\\nconst int INF=1<<30;\\nconst LL MAX=1e9+7;\\n\\nvoid array_show(int *array,int array_n,char middle=' '){\\n for(int i=0;i<array_n;i++)printf(\\\"%d%c\\\",array[i],(i!=array_n-1?middle:'\\\\n'));\\n}\\nvoid array_show(LL *array,int array_n,char middle=' '){\\n for(int i=0;i<array_n;i++)printf(\\\"%lld%c\\\",array[i],(i!=array_n-1?middle:'\\\\n'));\\n}\\nvoid array_show(vector<int> &vec_s,int vec_n=-1,char middle=' '){\\n if(vec_n==-1)vec_n=vec_s.size();\\n for(int i=0;i<vec_n;i++)printf(\\\"%d%c\\\",vec_s[i],(i!=vec_n-1?middle:'\\\\n'));\\n}\\nvoid array_show(vector<LL> &vec_s,int vec_n=-1,char middle=' '){\\n if(vec_n==-1)vec_n=vec_s.size();\\n for(int i=0;i<vec_n;i++)printf(\\\"%lld%c\\\",vec_s[i],(i!=vec_n-1?middle:'\\\\n'));\\n}\\ntemplate<typename T> ostream& operator<<(ostream& os,const vector<T>& v1){\\n int n=v1.size();\\n for(int i=0;i<n;i++){\\n if(i)os<<\\\" \\\";\\n os<<v1[i];\\n }\\n return os;\\n}\\ntemplate<typename T1,typename T2> ostream& operator<<(ostream& os,const pair<T1,T2>& p){\\n os<<p.first<<\\\" \\\"<<p.second;\\n return os;\\n}\\ntemplate<typename T> istream& operator>>(istream& is,vector<T>& v1){\\n int n=v1.size();\\n for(int i=0;i<n;i++)is>>v1[i];\\n return is;\\n}\\ntemplate<typename T1,typename T2> istream& operator>>(istream& is,pair<T1,T2>& p){\\n is>>p.first>>p.second;\\n return is;\\n}\\n\\nclass Dice{\\n // 0\\n //1234\\n // 5\\n //top:0, front:2, x:13, y:24, z:50\\n static const int N=6;\\n int A[N];\\npublic:\\n Dice(const vector<int> v1){\\n assert(v1.size()>=N);\\n for(int i=0;i<N;i++){\\n A[i]=v1[i];\\n }\\n }\\n\\n //rotate: clockwise\\n void rotateX(){//0->2->5->4->0\\n swap(A[0],A[4]);\\n swap(A[4],A[5]);\\n swap(A[5],A[2]);\\n }\\n\\n void rotateXrev(){\\n swap(A[5],A[2]);\\n swap(A[4],A[5]);\\n swap(A[0],A[4]);\\n }\\n\\n void rotateY(){//0->3->5->1\\n swap(A[0],A[1]);\\n swap(A[1],A[5]);\\n swap(A[5],A[3]);\\n }\\n\\n void rotateYrev(){\\n swap(A[5],A[3]);\\n swap(A[1],A[5]);\\n swap(A[0],A[1]);\\n }\\n\\n void rotateZ(){//1->2->3->4\\n swap(A[4],A[3]);\\n swap(A[3],A[2]);\\n swap(A[2],A[1]);\\n }\\n\\n void rotateZrev(){//1->2->3->4\\n swap(A[2],A[1]);\\n swap(A[3],A[2]);\\n swap(A[4],A[3]);\\n }\\n\\n bool check(){\\n int a=0;\\n for(int i=0;i<N;i++){\\n if(A[i]<0)return false;\\n a+=A[i];\\n }\\n if((A[0]+A[5])*2>a)return false;\\n if((A[1]+A[3])*2-1>a)return false;\\n if((A[2]+A[4])*2-1>a)return false;\\n return true;\\n }\\n\\n string calc(){\\n string sa=\\\"ENSW\\\",ss=\\\"\\\";\\n int i,j;\\n while(1){\\n for(i=0;i<4;i++){\\n if(i==0)rotateX();\\n if(i==1)rotateY();\\n if(i==2)rotateYrev();\\n if(i==3)rotateXrev();\\n A[5]--;\\n if(check())break;\\n A[5]++;\\n if(i==0)rotateXrev();\\n if(i==1)rotateYrev();\\n if(i==2)rotateY();\\n if(i==3)rotateX();\\n }\\n if(A[5]<0 || i==4)return \\\"impossible\\\";\\n ss.push_back(sa[i]);\\n for(i=0;i<N;i++){\\n if(A[i]>0)break;\\n }\\n if(i==N)return ss;\\n }\\n }\\n\\n\\n template<typename T> T hash(int base){\\n T s=0;\\n for(int i=0;i<N;i++){\\n s*=base;\\n s+=A[i];\\n }\\n return s;\\n }\\n\\n template<typename T> vector<T> all_hash(int base){\\n int i,j;\\n vector<T> vs;\\n const int M=4;\\n for(i=0;i<2*M;i++){\\n if(i<M)rotateX();\\n else rotateY();\\n if(i>=M && i%2)continue;\\n for(j=0;j<4;j++){\\n rotateZ();\\n vs.push_back(hash<T>(base));\\n }\\n }\\n return vs;\\n }\\n};\\n\\n\\nnamespace sol{\\n const int N=6;\\n string ss;\\n vector<int> v1(N);\\n vector<int> vi(N,-1);\\n\\n void dfs(int d){\\n int i;\\n if(d<N){\\n for(i=0;i<N;i++){\\n if(vi[i]!=-1)continue;\\n vi[i]=d;\\n dfs(d+1);\\n vi[i]=-1;\\n }\\n return;\\n }\\n vector<int> v2(N);\\n for(i=0;i<N;i++){\\n v2[vi[i]]=v1[i];\\n }\\n Dice dice(v2);\\n string sa=dice.calc();\\n if(sa<ss)ss=sa;\\n }\\n\\n void solve(){\\n int n,m;\\n int i,j,k;\\n int a,b,c;\\n int p,q;\\n while(cin>>v1){\\n sort(v1.begin(),v1.end());\\n if(v1.back()==0)return;\\n cin>>p>>q;\\n p--;\\n vi.assign(N,-1);\\n ss=\\\"z\\\";\\n dfs(0);\\n if(ss==\\\"impossible\\\")cout<<ss<<endl;\\n else cout<<ss.substr(p,q-p)<<endl;\\n }\\n }\\n}\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n sol::solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1330,\n \"memory_kb\": 3428,\n \"score_of_the_acc\": -0.1786,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1197_5801779\",\n \"code_snippet\": \"/**\\n *\\tauthor: nok0\\n *\\tcreated: 2021.06.29 22:18:07\\n**/\\n#ifdef LOCAL\\n#define _GLIBCXX_DEBUG\\n#endif\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#if __has_include(<atcoder/all>)\\n#include <atcoder/all>\\nusing namespace atcoder;\\n#endif\\n\\n#pragma region Macros\\n// rep macro\\n#define foa(v, a) for(auto &v : a)\\n#define REPname(a, b, c, d, e, ...) e\\n#define REP(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\\n#define REP0(x) for(int i = 0; i < (x); ++i)\\n#define REP1(i, x) for(int i = 0; i < (x); ++i)\\n#define REP2(i, l, r) for(int i = (l); i < (r); ++i)\\n#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))\\n#define REPSname(a, b, c, ...) c\\n#define REPS(...) REPSname(__VA_ARGS__, REPS1, REPS0)(__VA_ARGS__)\\n#define REPS0(x) for(int i = 1; i <= (x); ++i)\\n#define REPS1(i, x) for(int i = 1; i <= (x); ++i)\\n#define RREPname(a, b, c, d, e, ...) e\\n#define RREP(...) RREPname(__VA_ARGS__, RREP3, RREP2, RREP1, RREP0)(__VA_ARGS__)\\n#define RREP0(x) for(int i = (x)-1; i >= 0; --i)\\n#define RREP1(i, x) for(int i = (x)-1; i >= 0; --i)\\n#define RREP2(i, r, l) for(int i = (r)-1; i >= (l); --i)\\n#define RREP3(i, r, l, c) for(int i = (r)-1; i >= (l); i -= (c))\\n#define RREPSname(a, b, c, ...) c\\n#define RREPS(...) RREPSname(__VA_ARGS__, RREPS1, RREPS0)(__VA_ARGS__)\\n#define RREPS0(x) for(int i = (x); i >= 1; --i)\\n#define RREPS1(i, x) for(int i = (x); i >= 1; --i)\\n\\n// name macro\\n#define pb push_back\\n#define eb emplace_back\\n#define SZ(x) ((int)(x).size())\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\n#define popcnt(x) __builtin_popcountll(x)\\ntemplate <class T = int>\\nusing V = std::vector<T>;\\ntemplate <class T = int>\\nusing VV = std::vector<std::vector<T>>;\\ntemplate <class T>\\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\\nusing ll = long long;\\nusing ld = long double;\\nusing int128 = __int128_t;\\nusing pii = std::pair<int, int>;\\nusing pll = std::pair<long long, long long>;\\n\\n// input macro\\ntemplate <class T, class U>\\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\\n\\tis >> p.first >> p.second;\\n\\treturn is;\\n}\\ntemplate <class T>\\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\\n\\tfor(T &i : v) is >> i;\\n\\treturn is;\\n}\\nstd::istream &operator>>(std::istream &is, __int128_t &a) {\\n\\tstd::string s;\\n\\tis >> s;\\n\\t__int128_t ret = 0;\\n\\tfor(int i = 0; i < s.length(); i++)\\n\\t\\tif('0' <= s[i] and s[i] <= '9')\\n\\t\\t\\tret = 10 * ret + s[i] - '0';\\n\\ta = ret * (s[0] == '-' ? -1 : 1);\\n\\treturn is;\\n}\\n#if __has_include(<atcoder/all>)\\nstd::istream &operator>>(std::istream &is, atcoder::modint998244353 &a) {\\n\\tlong long v;\\n\\tis >> v;\\n\\ta = v;\\n\\treturn is;\\n}\\nstd::istream &operator>>(std::istream &is, atcoder::modint1000000007 &a) {\\n\\tlong long v;\\n\\tis >> v;\\n\\ta = v;\\n\\treturn is;\\n}\\ntemplate <int m>\\nstd::istream &operator>>(std::istream &is, atcoder::static_modint<m> &a) {\\n\\tlong long v;\\n\\tis >> v;\\n\\ta = v;\\n\\treturn is;\\n}\\ntemplate <int m>\\nstd::istream &operator>>(std::istream &is, atcoder::dynamic_modint<m> &a) {\\n\\tlong long v;\\n\\tis >> v;\\n\\ta = v;\\n\\treturn is;\\n}\\n#endif\\nnamespace scanner {\\nvoid scan(int &a) { std::cin >> a; }\\nvoid scan(long long &a) { std::cin >> a; }\\nvoid scan(std::string &a) { std::cin >> a; }\\nvoid scan(char &a) { std::cin >> a; }\\nvoid scan(char a[]) { std::scanf(\\\"%s\\\", a); }\\nvoid scan(double &a) { std::cin >> a; }\\nvoid scan(long double &a) { std::cin >> a; }\\ntemplate <class T, class U>\\nvoid scan(std::pair<T, U> &p) { std::cin >> p; }\\ntemplate <class T>\\nvoid scan(std::vector<T> &a) { std::cin >> a; }\\nvoid INPUT() {}\\ntemplate <class Head, class... Tail>\\nvoid INPUT(Head &head, Tail &... tail) {\\n\\tscan(head);\\n\\tINPUT(tail...);\\n}\\n} // namespace scanner\\n#define VEC(type, name, size) \\\\\\n\\tstd::vector<type> name(size); \\\\\\n\\tscanner::INPUT(name)\\n#define VVEC(type, name, h, w) \\\\\\n\\tstd::vector<std::vector<type>> name(h, std::vector<type>(w)); \\\\\\n\\tscanner::INPUT(name)\\n#define INT(...) \\\\\\n\\tint __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define LL(...) \\\\\\n\\tlong long __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define STR(...) \\\\\\n\\tstd::string __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define CHAR(...) \\\\\\n\\tchar __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define DOUBLE(...) \\\\\\n\\tdouble __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define LD(...) \\\\\\n\\tlong double __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n\\n// output-macro\\ntemplate <class T, class U>\\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\\n\\tos << p.first << \\\" \\\" << p.second;\\n\\treturn os;\\n}\\ntemplate <class T>\\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &a) {\\n\\tfor(int i = 0; i < int(a.size()); ++i) {\\n\\t\\tif(i) os << \\\" \\\";\\n\\t\\tos << a[i];\\n\\t}\\n\\treturn os;\\n}\\nstd::ostream &operator<<(std::ostream &dest, __int128_t &value) {\\n\\tstd::ostream::sentry s(dest);\\n\\tif(s) {\\n\\t\\t__uint128_t tmp = value < 0 ? -value : value;\\n\\t\\tchar buffer[128];\\n\\t\\tchar *d = std::end(buffer);\\n\\t\\tdo {\\n\\t\\t\\t--d;\\n\\t\\t\\t*d = \\\"0123456789\\\"[tmp % 10];\\n\\t\\t\\ttmp /= 10;\\n\\t\\t} while(tmp != 0);\\n\\t\\tif(value < 0) {\\n\\t\\t\\t--d;\\n\\t\\t\\t*d = '-';\\n\\t\\t}\\n\\t\\tint len = std::end(buffer) - d;\\n\\t\\tif(dest.rdbuf()->sputn(d, len) != len) {\\n\\t\\t\\tdest.setstate(std::ios_base::badbit);\\n\\t\\t}\\n\\t}\\n\\treturn dest;\\n}\\n#if __has_include(<atcoder/all>)\\nstd::ostream &operator<<(std::ostream &os, const atcoder::modint998244353 &a) { return os << a.val(); }\\nstd::ostream &operator<<(std::ostream &os, const atcoder::modint1000000007 &a) { return os << a.val(); }\\ntemplate <int m>\\nstd::ostream &operator<<(std::ostream &os, const atcoder::static_modint<m> &a) { return os << a.val(); }\\ntemplate <int m>\\nstd::ostream &operator<<(std::ostream &os, const atcoder::dynamic_modint<m> &a) { return os << a.val(); }\\n#endif\\ntemplate <class T>\\nvoid print(const T a) { std::cout << a << '\\\\n'; }\\ntemplate <class Head, class... Tail>\\nvoid print(Head H, Tail... T) {\\n\\tstd::cout << H << ' ';\\n\\tprint(T...);\\n}\\ntemplate <class T>\\nvoid printel(const T a) { std::cout << a << '\\\\n'; }\\ntemplate <class T>\\nvoid printel(const std::vector<T> &a) {\\n\\tfor(const auto &v : a)\\n\\t\\tstd::cout << v << '\\\\n';\\n}\\ntemplate <class Head, class... Tail>\\nvoid printel(Head H, Tail... T) {\\n\\tstd::cout << H << '\\\\n';\\n\\tprintel(T...);\\n}\\nvoid Yes(const bool b = true) { std::cout << (b ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\"); }\\nvoid No() { std::cout << \\\"No\\\\n\\\"; }\\nvoid YES(const bool b = true) { std::cout << (b ? \\\"YES\\\\n\\\" : \\\"NO\\\\n\\\"); }\\nvoid NO() { std::cout << \\\"NO\\\\n\\\"; }\\nvoid err(const bool b = true) {\\n\\tif(b) {\\n\\t\\tstd::cout << \\\"-1\\\\n\\\", exit(0);\\n\\t}\\n}\\n\\n//debug macro\\nnamespace debugger {\\ntemplate <class T>\\nvoid view(const std::vector<T> &a) {\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(const auto &v : a) {\\n\\t\\tstd::cerr << v << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\ntemplate <class T>\\nvoid view(const std::vector<std::vector<T>> &a) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &v : a) {\\n\\t\\tstd::cerr << \\\"\\\\t\\\";\\n\\t\\tview(v);\\n\\t\\tstd::cerr << \\\"\\\\n\\\";\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\ntemplate <class T, class U>\\nvoid view(const std::vector<std::pair<T, U>> &a) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &p : a) std::cerr << \\\"\\\\t(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\\n\\\";\\n\\tstd::cerr << \\\"}\\\";\\n}\\ntemplate <class T, class U>\\nvoid view(const std::map<T, U> &m) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &p : m) std::cerr << \\\"\\\\t[\\\" << p.first << \\\"] : \\\" << p.second << \\\"\\\\n\\\";\\n\\tstd::cerr << \\\"}\\\";\\n}\\ntemplate <class T, class U>\\nvoid view(const std::pair<T, U> &p) { std::cerr << \\\"(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\"; }\\ntemplate <class T>\\nvoid view(const std::set<T> &s) {\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(auto &v : s) {\\n\\t\\tview(v);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <class T>\\nvoid view(const T &e) { std::cerr << e; }\\n} // namespace debugger\\n#ifdef LOCAL\\nvoid debug_out() {}\\ntemplate <typename Head, typename... Tail>\\nvoid debug_out(Head H, Tail... T) {\\n\\tdebugger::view(H);\\n\\tstd::cerr << \\\", \\\";\\n\\tdebug_out(T...);\\n}\\n#define debug(...) \\\\\\n\\tdo { \\\\\\n\\t\\tstd::cerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"] : [\\\"; \\\\\\n\\t\\tdebug_out(__VA_ARGS__); \\\\\\n\\t\\tstd::cerr << \\\"\\\\b\\\\b]\\\\n\\\"; \\\\\\n\\t} while(false)\\n#else\\n#define debug(...) (void(0))\\n#endif\\n\\n// vector macro\\ntemplate <class T>\\nint lb(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::lower_bound((a).begin(), (a).end(), (x))); }\\ntemplate <class T>\\nint ub(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::upper_bound((a).begin(), (a).end(), (x))); }\\ntemplate <class T>\\nvoid UNIQUE(std::vector<T> &a) {\\n\\tstd::sort(a.begin(), a.end());\\n\\ta.erase(std::unique(a.begin(), a.end()), a.end());\\n}\\ntemplate <class T>\\nstd::vector<T> press(std::vector<T> &a) {\\n\\tauto res = a;\\n\\tUNIQUE(res);\\n\\tfor(auto &v : a)\\n\\t\\tv = lb(res, v);\\n\\treturn res;\\n}\\n#define SORTname(a, b, c, ...) c\\n#define SORT(...) SORTname(__VA_ARGS__, SORT1, SORT0, ...)(__VA_ARGS__)\\n#define SORT0(a) std::sort((a).begin(), (a).end())\\n#define SORT1(a, c) std::sort((a).begin(), (a).end(), [](const auto x, const auto y) { return x c y; })\\ntemplate <class T>\\nvoid ADD(std::vector<T> &a, const T x) {\\n\\tfor(auto &v : a) v += x;\\n}\\ntemplate <class T>\\nvoid SUB(std::vector<T> &a, const T x = 1) {\\n\\tfor(auto &v : a) v -= x;\\n}\\ntemplate <class T>\\nvoid MUL(std::vector<T> &a, const T x) {\\n\\tfor(auto &v : a) v *= x;\\n}\\ntemplate <class T>\\nvoid DIV(std::vector<T> &a, const T x) {\\n\\tfor(auto &v : a) v /= x;\\n}\\n\\n// math macro\\ntemplate <class T, class U>\\ninline bool chmin(T &a, const U &b) { return a > b ? a = b, true : false; }\\ntemplate <class T, class U>\\ninline bool chmax(T &a, const U &b) { return a < b ? a = b, true : false; }\\ntemplate <class T>\\nT divup(T x, T y) { return (x + y - 1) / y; }\\ntemplate <class T>\\nT POW(T a, long long n) {\\n\\tT ret = 1;\\n\\twhile(n) {\\n\\t\\tif(n & 1) ret *= a;\\n\\t\\ta *= a;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn ret;\\n}\\n// modpow\\nlong long POW(long long a, long long n, const int mod) {\\n\\tlong long ret = 1;\\n\\twhile(n) {\\n\\t\\tif(n & 1) (ret *= a) %= mod;\\n\\t\\t(a *= a) %= mod;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn ret;\\n}\\n\\n// others\\nstruct fast_io {\\n\\tfast_io() {\\n\\t\\tios::sync_with_stdio(false);\\n\\t\\tcin.tie(nullptr);\\n\\t\\tcout << fixed << setprecision(15);\\n\\t}\\n} fast_io_;\\nconst int inf = 1e9;\\nconst ll INF = 1e18;\\n#pragma endregion\\n\\nV<> nd(6);\\nvoid main_() {\\n\\tstring ans = \\\"\\\";\\n\\tVEC(int, t, 6);\\n\\tint sum = accumulate(all(t), 0);\\n\\tif(!sum) exit(0);\\n\\tINT(p, q);\\n\\tV<> perm(6);\\n\\tiota(all(perm), 0);\\n\\tdo {\\n\\t\\tstring res = \\\"\\\";\\n\\t\\tV<> d(6);\\n\\t\\tREP(i, 6) { d[i] = t[perm[i]]; }\\n\\n\\t\\tauto chk = [&d]() -> bool {\\n\\t\\t\\tif(*min_element(all(d)) < 0) return 0;\\n\\t\\t\\tint a = d[0] + d[1];\\n\\t\\t\\tint b = d[2] + d[3];\\n\\t\\t\\tint c = d[4] + d[5];\\n\\t\\t\\tbool ok = 1;\\n\\t\\t\\tok &= a <= b + c + 1;\\n\\t\\t\\tok &= b <= a + c + 1;\\n\\t\\t\\tok &= c <= a + b;\\n\\t\\t\\treturn ok;\\n\\t\\t};\\n\\n\\t\\tauto east_rotate = [&]() {\\n\\t\\t\\tnd[2] = d[2];\\n\\t\\t\\tnd[3] = d[3];\\n\\t\\t\\tnd[4] = d[1];\\n\\t\\t\\tnd[1] = d[5];\\n\\t\\t\\tnd[5] = d[0];\\n\\t\\t\\tnd[0] = d[4];\\n\\t\\t\\td = nd;\\n\\t\\t\\treturn;\\n\\t\\t};\\n\\n\\t\\tauto west_rotate = [&]() {\\n\\t\\t\\tnd[2] = d[2];\\n\\t\\t\\tnd[3] = d[3];\\n\\t\\t\\tnd[1] = d[4];\\n\\t\\t\\tnd[5] = d[1];\\n\\t\\t\\tnd[0] = d[5];\\n\\t\\t\\tnd[4] = d[0];\\n\\t\\t\\td = nd;\\n\\t\\t\\treturn;\\n\\t\\t};\\n\\n\\t\\tauto north_rotate = [&]() {\\n\\t\\t\\tnd[0] = d[0];\\n\\t\\t\\tnd[1] = d[1];\\n\\t\\t\\tnd[4] = d[3];\\n\\t\\t\\tnd[3] = d[5];\\n\\t\\t\\tnd[5] = d[2];\\n\\t\\t\\tnd[2] = d[4];\\n\\t\\t\\td = nd;\\n\\t\\t\\treturn;\\n\\t\\t};\\n\\n\\t\\tauto south_rotate = [&]() {\\n\\t\\t\\tnd[0] = d[0];\\n\\t\\t\\tnd[1] = d[1];\\n\\t\\t\\tnd[3] = d[4];\\n\\t\\t\\tnd[5] = d[3];\\n\\t\\t\\tnd[2] = d[5];\\n\\t\\t\\tnd[4] = d[2];\\n\\t\\t\\td = nd;\\n\\t\\t\\treturn;\\n\\t\\t};\\n\\n\\t\\tREP(_, sum) {\\n\\t\\t\\t{\\n\\t\\t\\t\\teast_rotate();\\n\\t\\t\\t\\td[4]--;\\n\\t\\t\\t\\tif(chk()) {\\n\\t\\t\\t\\t\\tres += 'E';\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\td[4]++;\\n\\t\\t\\t\\twest_rotate();\\n\\t\\t\\t}\\n\\t\\t\\t{\\n\\t\\t\\t\\tnorth_rotate();\\n\\t\\t\\t\\td[4]--;\\n\\t\\t\\t\\tif(chk()) {\\n\\t\\t\\t\\t\\tres += 'N';\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\td[4]++;\\n\\t\\t\\t\\tsouth_rotate();\\n\\t\\t\\t}\\n\\t\\t\\t{\\n\\t\\t\\t\\tsouth_rotate();\\n\\t\\t\\t\\td[4]--;\\n\\t\\t\\t\\tif(chk()) {\\n\\t\\t\\t\\t\\tres += 'S';\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\td[4]++;\\n\\t\\t\\t\\tnorth_rotate();\\n\\t\\t\\t}\\n\\t\\t\\t{\\n\\t\\t\\t\\twest_rotate();\\n\\t\\t\\t\\td[4]--;\\n\\t\\t\\t\\tif(chk()) {\\n\\t\\t\\t\\t\\tres += 'W';\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\td[4]++;\\n\\t\\t\\t\\teast_rotate();\\n\\t\\t\\t}\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tif(SZ(res) == sum) {\\n\\t\\t\\tif(SZ(ans) == 0)\\n\\t\\t\\t\\tans = res;\\n\\t\\t\\telse\\n\\t\\t\\t\\tchmin(ans, res);\\n\\t\\t}\\n\\t} while(next_permutation(all(perm)));\\n\\tif(SZ(ans) != sum) {\\n\\t\\tprint(\\\"impossible\\\");\\n\\t\\treturn;\\n\\t}\\n\\tREP(i, p - 1, q) {\\n\\t\\tcout << ans[i];\\n\\t}\\n\\tcout << endl;\\n\\treturn;\\n}\\n\\nint main() {\\n\\tint t = 1;\\n\\t//cin >> t;\\n\\twhile(1) main_();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3050,\n \"memory_kb\": 3568,\n \"score_of_the_acc\": -0.4915,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1197_5628812\",\n \"code_snippet\": \"/**\\n *\\tauthor: nok0\\n *\\tcreated: 2021.06.29 22:18:07\\n**/\\n#ifdef LOCAL\\n#define _GLIBCXX_DEBUG\\n#endif\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#if __has_include(<atcoder/all>)\\n#include <atcoder/all>\\nusing namespace atcoder;\\n#endif\\n\\n#pragma region Macros\\n// rep macro\\n#define foa(v, a) for(auto &v : a)\\n#define REPname(a, b, c, d, e, ...) e\\n#define REP(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\\n#define REP0(x) for(int i = 0; i < (x); ++i)\\n#define REP1(i, x) for(int i = 0; i < (x); ++i)\\n#define REP2(i, l, r) for(int i = (l); i < (r); ++i)\\n#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))\\n#define REPSname(a, b, c, ...) c\\n#define REPS(...) REPSname(__VA_ARGS__, REPS1, REPS0)(__VA_ARGS__)\\n#define REPS0(x) for(int i = 1; i <= (x); ++i)\\n#define REPS1(i, x) for(int i = 1; i <= (x); ++i)\\n#define RREPname(a, b, c, d, e, ...) e\\n#define RREP(...) RREPname(__VA_ARGS__, RREP3, RREP2, RREP1, RREP0)(__VA_ARGS__)\\n#define RREP0(x) for(int i = (x)-1; i >= 0; --i)\\n#define RREP1(i, x) for(int i = (x)-1; i >= 0; --i)\\n#define RREP2(i, r, l) for(int i = (r)-1; i >= (l); --i)\\n#define RREP3(i, r, l, c) for(int i = (r)-1; i >= (l); i -= (c))\\n#define RREPSname(a, b, c, ...) c\\n#define RREPS(...) RREPSname(__VA_ARGS__, RREPS1, RREPS0)(__VA_ARGS__)\\n#define RREPS0(x) for(int i = (x); i >= 1; --i)\\n#define RREPS1(i, x) for(int i = (x); i >= 1; --i)\\n\\n// name macro\\n#define pb push_back\\n#define eb emplace_back\\n#define SZ(x) ((int)(x).size())\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\n#define popcnt(x) __builtin_popcountll(x)\\ntemplate <class T = int>\\nusing V = std::vector<T>;\\ntemplate <class T = int>\\nusing VV = std::vector<std::vector<T>>;\\ntemplate <class T>\\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\\nusing ll = long long;\\nusing ld = long double;\\nusing int128 = __int128_t;\\nusing pii = std::pair<int, int>;\\nusing pll = std::pair<long long, long long>;\\n\\n// input macro\\ntemplate <class T, class U>\\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\\n\\tis >> p.first >> p.second;\\n\\treturn is;\\n}\\ntemplate <class T>\\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\\n\\tfor(T &i : v) is >> i;\\n\\treturn is;\\n}\\nstd::istream &operator>>(std::istream &is, __int128_t &a) {\\n\\tstd::string s;\\n\\tis >> s;\\n\\t__int128_t ret = 0;\\n\\tfor(int i = 0; i < s.length(); i++)\\n\\t\\tif('0' <= s[i] and s[i] <= '9')\\n\\t\\t\\tret = 10 * ret + s[i] - '0';\\n\\ta = ret * (s[0] == '-' ? -1 : 1);\\n\\treturn is;\\n}\\n#if __has_include(<atcoder/all>)\\nstd::istream &operator>>(std::istream &is, atcoder::modint998244353 &a) {\\n\\tlong long v;\\n\\tis >> v;\\n\\ta = v;\\n\\treturn is;\\n}\\nstd::istream &operator>>(std::istream &is, atcoder::modint1000000007 &a) {\\n\\tlong long v;\\n\\tis >> v;\\n\\ta = v;\\n\\treturn is;\\n}\\ntemplate <int m>\\nstd::istream &operator>>(std::istream &is, atcoder::static_modint<m> &a) {\\n\\tlong long v;\\n\\tis >> v;\\n\\ta = v;\\n\\treturn is;\\n}\\ntemplate <int m>\\nstd::istream &operator>>(std::istream &is, atcoder::dynamic_modint<m> &a) {\\n\\tlong long v;\\n\\tis >> v;\\n\\ta = v;\\n\\treturn is;\\n}\\n#endif\\nnamespace scanner {\\nvoid scan(int &a) { std::cin >> a; }\\nvoid scan(long long &a) { std::cin >> a; }\\nvoid scan(std::string &a) { std::cin >> a; }\\nvoid scan(char &a) { std::cin >> a; }\\nvoid scan(char a[]) { std::scanf(\\\"%s\\\", a); }\\nvoid scan(double &a) { std::cin >> a; }\\nvoid scan(long double &a) { std::cin >> a; }\\ntemplate <class T, class U>\\nvoid scan(std::pair<T, U> &p) { std::cin >> p; }\\ntemplate <class T>\\nvoid scan(std::vector<T> &a) { std::cin >> a; }\\nvoid INPUT() {}\\ntemplate <class Head, class... Tail>\\nvoid INPUT(Head &head, Tail &... tail) {\\n\\tscan(head);\\n\\tINPUT(tail...);\\n}\\n} // namespace scanner\\n#define VEC(type, name, size) \\\\\\n\\tstd::vector<type> name(size); \\\\\\n\\tscanner::INPUT(name)\\n#define VVEC(type, name, h, w) \\\\\\n\\tstd::vector<std::vector<type>> name(h, std::vector<type>(w)); \\\\\\n\\tscanner::INPUT(name)\\n#define INT(...) \\\\\\n\\tint __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define LL(...) \\\\\\n\\tlong long __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define STR(...) \\\\\\n\\tstd::string __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define CHAR(...) \\\\\\n\\tchar __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define DOUBLE(...) \\\\\\n\\tdouble __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define LD(...) \\\\\\n\\tlong double __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n\\n// output-macro\\ntemplate <class T, class U>\\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\\n\\tos << p.first << \\\" \\\" << p.second;\\n\\treturn os;\\n}\\ntemplate <class T>\\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &a) {\\n\\tfor(int i = 0; i < int(a.size()); ++i) {\\n\\t\\tif(i) os << \\\" \\\";\\n\\t\\tos << a[i];\\n\\t}\\n\\treturn os;\\n}\\nstd::ostream &operator<<(std::ostream &dest, __int128_t &value) {\\n\\tstd::ostream::sentry s(dest);\\n\\tif(s) {\\n\\t\\t__uint128_t tmp = value < 0 ? -value : value;\\n\\t\\tchar buffer[128];\\n\\t\\tchar *d = std::end(buffer);\\n\\t\\tdo {\\n\\t\\t\\t--d;\\n\\t\\t\\t*d = \\\"0123456789\\\"[tmp % 10];\\n\\t\\t\\ttmp /= 10;\\n\\t\\t} while(tmp != 0);\\n\\t\\tif(value < 0) {\\n\\t\\t\\t--d;\\n\\t\\t\\t*d = '-';\\n\\t\\t}\\n\\t\\tint len = std::end(buffer) - d;\\n\\t\\tif(dest.rdbuf()->sputn(d, len) != len) {\\n\\t\\t\\tdest.setstate(std::ios_base::badbit);\\n\\t\\t}\\n\\t}\\n\\treturn dest;\\n}\\n#if __has_include(<atcoder/all>)\\nstd::ostream &operator<<(std::ostream &os, const atcoder::modint998244353 &a) { return os << a.val(); }\\nstd::ostream &operator<<(std::ostream &os, const atcoder::modint1000000007 &a) { return os << a.val(); }\\ntemplate <int m>\\nstd::ostream &operator<<(std::ostream &os, const atcoder::static_modint<m> &a) { return os << a.val(); }\\ntemplate <int m>\\nstd::ostream &operator<<(std::ostream &os, const atcoder::dynamic_modint<m> &a) { return os << a.val(); }\\n#endif\\ntemplate <class T>\\nvoid print(const T a) { std::cout << a << '\\\\n'; }\\ntemplate <class Head, class... Tail>\\nvoid print(Head H, Tail... T) {\\n\\tstd::cout << H << ' ';\\n\\tprint(T...);\\n}\\ntemplate <class T>\\nvoid printel(const T a) { std::cout << a << '\\\\n'; }\\ntemplate <class T>\\nvoid printel(const std::vector<T> &a) {\\n\\tfor(const auto &v : a)\\n\\t\\tstd::cout << v << '\\\\n';\\n}\\ntemplate <class Head, class... Tail>\\nvoid printel(Head H, Tail... T) {\\n\\tstd::cout << H << '\\\\n';\\n\\tprintel(T...);\\n}\\nvoid Yes(const bool b = true) { std::cout << (b ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\"); }\\nvoid No() { std::cout << \\\"No\\\\n\\\"; }\\nvoid YES(const bool b = true) { std::cout << (b ? \\\"YES\\\\n\\\" : \\\"NO\\\\n\\\"); }\\nvoid NO() { std::cout << \\\"NO\\\\n\\\"; }\\nvoid err(const bool b = true) {\\n\\tif(b) {\\n\\t\\tstd::cout << \\\"-1\\\\n\\\", exit(0);\\n\\t}\\n}\\n\\n//debug macro\\nnamespace debugger {\\ntemplate <class T>\\nvoid view(const std::vector<T> &a) {\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(const auto &v : a) {\\n\\t\\tstd::cerr << v << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\ntemplate <class T>\\nvoid view(const std::vector<std::vector<T>> &a) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &v : a) {\\n\\t\\tstd::cerr << \\\"\\\\t\\\";\\n\\t\\tview(v);\\n\\t\\tstd::cerr << \\\"\\\\n\\\";\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\ntemplate <class T, class U>\\nvoid view(const std::vector<std::pair<T, U>> &a) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &p : a) std::cerr << \\\"\\\\t(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\\n\\\";\\n\\tstd::cerr << \\\"}\\\";\\n}\\ntemplate <class T, class U>\\nvoid view(const std::map<T, U> &m) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &p : m) std::cerr << \\\"\\\\t[\\\" << p.first << \\\"] : \\\" << p.second << \\\"\\\\n\\\";\\n\\tstd::cerr << \\\"}\\\";\\n}\\ntemplate <class T, class U>\\nvoid view(const std::pair<T, U> &p) { std::cerr << \\\"(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\"; }\\ntemplate <class T>\\nvoid view(const std::set<T> &s) {\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(auto &v : s) {\\n\\t\\tview(v);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <class T>\\nvoid view(const T &e) { std::cerr << e; }\\n} // namespace debugger\\n#ifdef LOCAL\\nvoid debug_out() {}\\ntemplate <typename Head, typename... Tail>\\nvoid debug_out(Head H, Tail... T) {\\n\\tdebugger::view(H);\\n\\tstd::cerr << \\\", \\\";\\n\\tdebug_out(T...);\\n}\\n#define debug(...) \\\\\\n\\tdo { \\\\\\n\\t\\tstd::cerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"] : [\\\"; \\\\\\n\\t\\tdebug_out(__VA_ARGS__); \\\\\\n\\t\\tstd::cerr << \\\"\\\\b\\\\b]\\\\n\\\"; \\\\\\n\\t} while(false)\\n#else\\n#define debug(...) (void(0))\\n#endif\\n\\n// vector macro\\ntemplate <class T>\\nint lb(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::lower_bound((a).begin(), (a).end(), (x))); }\\ntemplate <class T>\\nint ub(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::upper_bound((a).begin(), (a).end(), (x))); }\\ntemplate <class T>\\nvoid UNIQUE(std::vector<T> &a) {\\n\\tstd::sort(a.begin(), a.end());\\n\\ta.erase(std::unique(a.begin(), a.end()), a.end());\\n}\\ntemplate <class T>\\nstd::vector<T> press(std::vector<T> &a) {\\n\\tauto res = a;\\n\\tUNIQUE(res);\\n\\tfor(auto &v : a)\\n\\t\\tv = lb(res, v);\\n\\treturn res;\\n}\\n#define SORTname(a, b, c, ...) c\\n#define SORT(...) SORTname(__VA_ARGS__, SORT1, SORT0, ...)(__VA_ARGS__)\\n#define SORT0(a) std::sort((a).begin(), (a).end())\\n#define SORT1(a, c) std::sort((a).begin(), (a).end(), [](const auto x, const auto y) { return x c y; })\\ntemplate <class T>\\nvoid ADD(std::vector<T> &a, const T x) {\\n\\tfor(auto &v : a) v += x;\\n}\\ntemplate <class T>\\nvoid SUB(std::vector<T> &a, const T x = 1) {\\n\\tfor(auto &v : a) v -= x;\\n}\\ntemplate <class T>\\nvoid MUL(std::vector<T> &a, const T x) {\\n\\tfor(auto &v : a) v *= x;\\n}\\ntemplate <class T>\\nvoid DIV(std::vector<T> &a, const T x) {\\n\\tfor(auto &v : a) v /= x;\\n}\\n\\n// math macro\\ntemplate <class T, class U>\\ninline bool chmin(T &a, const U &b) { return a > b ? a = b, true : false; }\\ntemplate <class T, class U>\\ninline bool chmax(T &a, const U &b) { return a < b ? a = b, true : false; }\\ntemplate <class T>\\nT divup(T x, T y) { return (x + y - 1) / y; }\\ntemplate <class T>\\nT POW(T a, long long n) {\\n\\tT ret = 1;\\n\\twhile(n) {\\n\\t\\tif(n & 1) ret *= a;\\n\\t\\ta *= a;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn ret;\\n}\\n// modpow\\nlong long POW(long long a, long long n, const int mod) {\\n\\tlong long ret = 1;\\n\\twhile(n) {\\n\\t\\tif(n & 1) (ret *= a) %= mod;\\n\\t\\t(a *= a) %= mod;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn ret;\\n}\\n\\n// others\\nstruct fast_io {\\n\\tfast_io() {\\n\\t\\tios::sync_with_stdio(false);\\n\\t\\tcin.tie(nullptr);\\n\\t\\tcout << fixed << setprecision(15);\\n\\t}\\n} fast_io_;\\nconst int inf = 1e9;\\nconst ll INF = 1e18;\\n#pragma endregion\\n\\nV<> nd(6);\\nvoid main_() {\\n\\tstring ans = \\\"\\\";\\n\\tVEC(int, t, 6);\\n\\tint sum = accumulate(all(t), 0);\\n\\tif(!sum) exit(0);\\n\\tINT(p, q);\\n\\tV<> perm(6);\\n\\tiota(all(perm), 0);\\n\\tdo {\\n\\t\\tstring res = \\\"\\\";\\n\\t\\tV<> d(6);\\n\\t\\tREP(i, 6) { d[i] = t[perm[i]]; }\\n\\n\\t\\tauto chk = [&d]() -> bool {\\n\\t\\t\\tif(*min_element(all(d)) < 0) return 0;\\n\\t\\t\\tint a = d[0] + d[1];\\n\\t\\t\\tint b = d[2] + d[3];\\n\\t\\t\\tint c = d[4] + d[5];\\n\\t\\t\\tbool ok = 1;\\n\\t\\t\\tok &= a <= b + c + 1;\\n\\t\\t\\tok &= b <= a + c + 1;\\n\\t\\t\\tok &= c <= a + b;\\n\\t\\t\\treturn ok;\\n\\t\\t};\\n\\n\\t\\tauto east_rotate = [&]() {\\n\\t\\t\\tnd[2] = d[2];\\n\\t\\t\\tnd[3] = d[3];\\n\\t\\t\\tnd[4] = d[1];\\n\\t\\t\\tnd[1] = d[5];\\n\\t\\t\\tnd[5] = d[0];\\n\\t\\t\\tnd[0] = d[4];\\n\\t\\t\\td = nd;\\n\\t\\t\\treturn;\\n\\t\\t};\\n\\n\\t\\tauto west_rotate = [&]() {\\n\\t\\t\\tnd[2] = d[2];\\n\\t\\t\\tnd[3] = d[3];\\n\\t\\t\\tnd[1] = d[4];\\n\\t\\t\\tnd[5] = d[1];\\n\\t\\t\\tnd[0] = d[5];\\n\\t\\t\\tnd[4] = d[0];\\n\\t\\t\\td = nd;\\n\\t\\t\\treturn;\\n\\t\\t};\\n\\n\\t\\tauto north_rotate = [&]() {\\n\\t\\t\\tnd[0] = d[0];\\n\\t\\t\\tnd[1] = d[1];\\n\\t\\t\\tnd[4] = d[3];\\n\\t\\t\\tnd[3] = d[5];\\n\\t\\t\\tnd[5] = d[2];\\n\\t\\t\\tnd[2] = d[4];\\n\\t\\t\\td = nd;\\n\\t\\t\\treturn;\\n\\t\\t};\\n\\n\\t\\tauto south_rotate = [&]() {\\n\\t\\t\\tnd[0] = d[0];\\n\\t\\t\\tnd[1] = d[1];\\n\\t\\t\\tnd[3] = d[4];\\n\\t\\t\\tnd[5] = d[3];\\n\\t\\t\\tnd[2] = d[5];\\n\\t\\t\\tnd[4] = d[2];\\n\\t\\t\\td = nd;\\n\\t\\t\\treturn;\\n\\t\\t};\\n\\n\\t\\tREP(_, sum) {\\n\\t\\t\\t{\\n\\t\\t\\t\\teast_rotate();\\n\\t\\t\\t\\td[4]--;\\n\\t\\t\\t\\tif(chk()) {\\n\\t\\t\\t\\t\\tres += 'E';\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\td[4]++;\\n\\t\\t\\t\\twest_rotate();\\n\\t\\t\\t}\\n\\t\\t\\t{\\n\\t\\t\\t\\tnorth_rotate();\\n\\t\\t\\t\\td[4]--;\\n\\t\\t\\t\\tif(chk()) {\\n\\t\\t\\t\\t\\tres += 'N';\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\td[4]++;\\n\\t\\t\\t\\tsouth_rotate();\\n\\t\\t\\t}\\n\\t\\t\\t{\\n\\t\\t\\t\\tsouth_rotate();\\n\\t\\t\\t\\td[4]--;\\n\\t\\t\\t\\tif(chk()) {\\n\\t\\t\\t\\t\\tres += 'S';\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\td[4]++;\\n\\t\\t\\t\\tnorth_rotate();\\n\\t\\t\\t}\\n\\t\\t\\t{\\n\\t\\t\\t\\twest_rotate();\\n\\t\\t\\t\\td[4]--;\\n\\t\\t\\t\\tif(chk()) {\\n\\t\\t\\t\\t\\tres += 'W';\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\td[4]++;\\n\\t\\t\\t\\teast_rotate();\\n\\t\\t\\t}\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tif(SZ(res) == sum) {\\n\\t\\t\\tif(SZ(ans) == 0)\\n\\t\\t\\t\\tans = res;\\n\\t\\t\\telse\\n\\t\\t\\t\\tchmin(ans, res);\\n\\t\\t}\\n\\t} while(next_permutation(all(perm)));\\n\\tif(SZ(ans) != sum) {\\n\\t\\tprint(\\\"impossible\\\");\\n\\t\\treturn;\\n\\t}\\n\\tREP(i, p - 1, q) {\\n\\t\\tcout << ans[i];\\n\\t}\\n\\tcout << endl;\\n\\treturn;\\n}\\n\\nint main() {\\n\\tint t = 1;\\n\\t//cin >> t;\\n\\twhile(1) main_();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3050,\n \"memory_kb\": 3488,\n \"score_of_the_acc\": -0.4683,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1197_5628370\",\n \"code_snippet\": \"//#define _GLIBCXX_DEBUG\\n\\n#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define endl '\\\\n'\\n#define lfs cout<<fixed<<setprecision(10)\\n#define ALL(a) (a).begin(),(a).end()\\n#define ALLR(a) (a).rbegin(),(a).rend()\\n#define spa << \\\" \\\" <<\\n#define fi first\\n#define se second\\n#define MP make_pair\\n#define MT make_tuple\\n#define PB push_back\\n#define EB emplace_back\\n#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)\\n#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)\\nusing ll = long long;\\nusing ld = long double;\\nconst ll MOD1 = 1e9+7;\\nconst ll MOD9 = 998244353;\\nconst ll INF = 1e18;\\nusing P = pair<ll, ll>;\\ntemplate<typename T> using PQ = priority_queue<T>;\\ntemplate<typename T> using QP = priority_queue<T,vector<T>,greater<T>>;\\ntemplate<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}\\ntemplate<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}\\nll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}\\nvoid ans1(bool x){if(x) cout<<\\\"Yes\\\"<<endl;else cout<<\\\"No\\\"<<endl;}\\nvoid ans2(bool x){if(x) cout<<\\\"YES\\\"<<endl;else cout<<\\\"NO\\\"<<endl;}\\nvoid ans3(bool x){if(x) cout<<\\\"Yay!\\\"<<endl;else cout<<\\\":(\\\"<<endl;}\\ntemplate<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;} \\ntemplate<typename T1,typename T2,typename T3>void anss(T1 x,T2 y,T3 z){ans(x!=y,x,z);}; \\ntemplate<typename T>void debug(const T &v,ll h,ll w,string sv=\\\" \\\"){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout<<sv<<v[i][j];cout<<endl;}};\\ntemplate<typename T>void debug(const T &v,ll n,string sv=\\\" \\\"){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout<<sv<<v[i];cout<<endl;};\\ntemplate<typename T>void debug(const vector<T>&v){debug(v,v.size());}\\ntemplate<typename T>void debug(const vector<vector<T>>&v){for(auto &vv:v)debug(vv,vv.size());}\\ntemplate<typename T>void debug(stack<T> st){while(!st.empty()){cout<<st.top()<<\\\" \\\";st.pop();}cout<<endl;}\\ntemplate<typename T>void debug(queue<T> st){while(!st.empty()){cout<<st.front()<<\\\" \\\";st.pop();}cout<<endl;}\\ntemplate<typename T>void debug(deque<T> st){while(!st.empty()){cout<<st.front()<<\\\" \\\";st.pop_front();}cout<<endl;}\\ntemplate<typename T>void debug(PQ<T> st){while(!st.empty()){cout<<st.top()<<\\\" \\\";st.pop();}cout<<endl;}\\ntemplate<typename T>void debug(QP<T> st){while(!st.empty()){cout<<st.top()<<\\\" \\\";st.pop();}cout<<endl;}\\ntemplate<typename T>void debug(const set<T>&v){for(auto z:v)cout<<z<<\\\" \\\";cout<<endl;}\\ntemplate<typename T>void debug(const multiset<T>&v){for(auto z:v)cout<<z<<\\\" \\\";cout<<endl;}\\ntemplate<typename T,size_t size>void debug(const array<T, size> &a){for(auto z:a)cout<<z<<\\\" \\\";cout<<endl;}\\ntemplate<typename T,typename V>void debug(const map<T,V>&v){for(auto z:v)cout<<\\\"[\\\"<<z.first<<\\\"]=\\\"<<z.second<<\\\",\\\";cout<<endl;}\\ntemplate<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}\\nll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}\\nvector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};\\ntemplate<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}\\ntemplate<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}\\ntemplate<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << \\\" \\\" << p.second;}\\ntemplate<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << \\\" \\\";cout<<\\\"|\\\"; return os;}\\ntemplate<typename T>void rearrange(vector<int>&ord, vector<T>&v){\\n auto tmp = v;\\n for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];\\n}\\ntemplate<typename Head, typename... Tail>void rearrange(vector<int>&ord,Head&& head, Tail&&... tail){\\n rearrange(ord, head);\\n rearrange(ord, tail...);\\n}\\ntemplate<typename T> vector<int> ascend(const vector<T>&v){\\n vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);\\n sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]<v[j];});\\n return ord;\\n}\\ntemplate<typename T> vector<int> descend(const vector<T>&v){\\n vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);\\n sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]>v[j];});\\n return ord;\\n}\\nll FLOOR(ll n,ll div){return n>=0?n/div:(n-div+1)/div;}\\nll CEIL(ll n,ll div){return n>=0?(n+div-1)/div:n/div;}\\nll digitsum(ll n){ll ret=0;while(n){ret+=n%10;n/=10;}return ret;}\\ntemplate<typename T>T min(const vector<T>&v){return *min_element(v.begin(),v.end());}\\ntemplate<typename T>T max(const vector<T>&v){return *max_element(v.begin(),v.end());}\\ntemplate<typename T>T acc(const vector<T>&v){return accumulate(v.begin(),v.end(),T(0));};\\ntemplate<typename T>T reverse(const T &v){return T(v.rbegin(),v.rend());};\\n//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());\\nint popcount(ll x){return __builtin_popcountll(x);};\\nint poplow(ll x){return __builtin_ctzll(x);};\\nint pophigh(ll x){return 63 - __builtin_clzll(x);};\\ntemplate<typename T>T poll(queue<T> &q){auto ret=q.front();q.pop();return ret;};\\ntemplate<typename T>T poll(priority_queue<T> &q){auto ret=q.top();q.pop();return ret;};\\ntemplate<typename T>T poll(QP<T> &q){auto ret=q.top();q.pop();return ret;};\\ntemplate<typename T>T poll(stack<T> &s){auto ret=s.top();s.pop();return ret;};\\ntemplate< typename T = int >\\nstruct edge {\\n int to;\\n T cost;\\n int id;\\n edge():id(-1){};\\n edge(int to, T cost = 1, int id = -1):to(to), cost(cost), id(id){}\\n operator int() const { return to; }\\n};\\n\\ntemplate<typename T>\\nusing Graph = vector<vector<edge<T>>>;\\ntemplate<typename T>\\nGraph<T>revgraph(const Graph<T> &g){\\n Graph<T>ret(g.size());\\n for(int i=0;i<g.size();i++){\\n for(auto e:g[i]){\\n int to = e.to;\\n e.to = i;\\n ret[to].push_back(e);\\n }\\n }\\n return ret;\\n}\\ntemplate<typename T>\\nGraph<T> readGraph(int n,int m,int indexed=1,bool directed=false,bool weighted=false){\\n Graph<T> ret(n);\\n for(int es = 0; es < m; es++){\\n int u,v;\\n T w=1;\\n cin>>u>>v;u-=indexed,v-=indexed;\\n if(weighted)cin>>w;\\n ret[u].emplace_back(v,w,es);\\n if(!directed)ret[v].emplace_back(u,w,es);\\n }\\n return ret;\\n}\\ntemplate<typename T>\\nGraph<T> readParent(int n,int indexed=1,bool directed=true){\\n Graph<T>ret(n);\\n for(int i=1;i<n;i++){\\n int p;cin>>p;\\n p-=indexed;\\n ret[p].emplace_back(i);\\n if(!directed)ret[i].emplace_back(p);\\n }\\n return ret;\\n}\\ntemplate<typename T>\\nstruct Dice{\\n array<T, 6>ar;\\n Dice() = default;\\n // 1\\n //342\\n // 0\\n // 5\\n Dice(array<T, 6>ar):ar(ar){}\\n //xが上下、yが左右\\n //0:x++\\n //1:x--\\n //2:y++\\n //3:y--\\n //4:clockwise\\n //5:counter-clockwise\\n void roll(int x){\\n array<int, 6>trans;\\n if(x == 0)ar = {ar[4],ar[5],ar[2],ar[3],ar[1],ar[0]};\\n if(x == 1)ar = {ar[5],ar[4],ar[2],ar[3],ar[0],ar[1]};\\n if(x == 2)ar = {ar[0],ar[1],ar[4],ar[5],ar[3],ar[2]};\\n if(x == 3)ar = {ar[0],ar[1],ar[5],ar[4],ar[2],ar[3]};\\n if(x == 4)ar = {ar[2],ar[3],ar[1],ar[0],ar[4],ar[5]};\\n if(x == 5)ar = {ar[3],ar[2],ar[0],ar[1],ar[4],ar[5]};\\n }\\n bool operator==(const Dice &d) const{\\n return ar == d.ar;\\n }\\n bool operator!=(const Dice &d) const{\\n return ar != d.ar;\\n }\\n bool operator<(const Dice &d) const{\\n return ar < d.ar;\\n }\\n T &operator[](int x){\\n return ar[x];\\n }\\n T operator[](int x) const{\\n return ar[x];\\n }\\n vector<Dice<T>>makeAll(){\\n vector<Dice<T>>ret;\\n for(int i=0;i<6;i++){\\n Dice tmp = *this;\\n if(i==1)tmp.roll(0);\\n if(i==2)tmp.roll(1);\\n if(i==3)tmp.roll(1),tmp.roll(1);\\n if(i==4)tmp.roll(4);\\n if(i==5)tmp.roll(5);\\n for(int k=0;k<4;k++){\\n ret.push_back(tmp);\\n tmp.roll(2);\\n }\\n }\\n return ret;\\n }\\n Dice<T> minDice(){\\n auto dice = this->makeAll();\\n return *min_element(dice.begin(), dice.end());\\n }\\n};\\nint main(){\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n ll res=0,buf=0;\\n bool judge = true;\\n while(1){\\n array<int,6>t;\\n rep(i,0,6)cin>>t[i];\\n if(t[5]==0)break;\\n int p,q;cin>>p>>q;\\n sort(ALL(t));\\n string ret=\\\"impossible\\\";\\n string ope=\\\"SNEW\\\";\\n int m=0;for(auto z:t)m+=z;\\n auto check=[&](const Dice<int>&d,int sum){\\n if((d[4]+d[5])*2>sum)return false;\\n if((d[0]+d[1])*2>sum+1)return false;\\n if((d[2]+d[3])*2>sum+1)return false;\\n return true;\\n };\\n do{\\n Dice<int>dice(t);\\n if(!check(dice,m))continue;\\n string s;\\n rrep(sum,0,m){\\n for(auto i:{2,1,0,3}){\\n auto tmp=dice;\\n tmp.roll(i);\\n if(tmp[5]<=0)continue;\\n tmp[5]-=1;\\n if(check(tmp,sum)){\\n s+=ope[i];\\n dice=tmp;\\n break;\\n }\\n }\\n if(s.size()+sum!=m)break;\\n }\\n if(s.size()==m){\\n chmin(ret,s);\\n }\\n }while(next_permutation(ALL(t)));\\n //cout<<ret<<endl;\\n if(ret[0]=='i')cout<<ret<<endl;\\n else cout<<ret.substr(p-1,q-p+1)<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 620,\n \"memory_kb\": 3264,\n \"score_of_the_acc\": -0.0186,\n \"final_rank\": 2\n }\n]","isConversational":false}}},{"rowIdx":668,"cells":{"group_id":{"kind":"string","value":"aoj_1198_cpp"},"problem_description":{"kind":"string","value":"Don't Cross the Circles!\nThere are one or more circles on a plane.\nAny two circles have different center positions and/or different radiuses.\nA circle may intersect with another circle,\nbut no three or more circles have areas nor points shared by all of them.\nA circle may completely contain another circle or two circles may intersect at two separate points,\nbut you can assume that the circumferences of two circles never\ntouch at a single point.\nYour task is to judge\nwhether there exists a path that connects the given two points,\nP\nand\nQ\n,\nwithout crossing the circumferences of the circles.\nYou are given one or more point pairs for each layout of circles.\nIn the case of Figure G-1,\nwe can connect\nP\nand\nQ\n1\nwithout crossing the circumferences of the circles, but we cannot connect\nP\nwith\nQ\n2\n,\nQ\n3\n, or\nQ\n4\nwithout crossing the circumferences of the circles.\nFigure G-1: Sample layout of circles and points\nInput\nThe input consists of multiple datasets, each in the following format.\nn\nm\nCx\n1\nCy\n1\nr\n1\n...\nCx\nn\nCy\nn\nr\nn\nPx\n1\nPy\n1\nQx\n1\nQy\n1\n...\nPx\nm\nPy\nm\nQx\nm\nQy\nm\nThe first line of a dataset contains two integers\nn\nand\nm\nseparated by a space.\nn\nrepresents the number of circles, and\nyou can assume 1 ≤\nn\n≤ 100.\nm\nrepresents the number of point pairs, and\nyou can assume 1 ≤\nm\n≤ 10.\nEach of the following\nn\nlines contains three integers separated by a single space.\n(\nCx\ni\n,\nCy\ni\n) and\nr\ni\nrepresent the center position and the radius of the\ni\n-th circle, respectively.\nEach of the following\nm\nlines contains four integers separated by a single space.\nThese four integers represent coordinates of two separate points\nP\nj\n= (\nPx\nj\n,\nPy\nj\n) and\nQ\nj\n=(\nQx\nj\n,\nQy\nj\n).\nThese two points\nP\nj\nand\nQ\nj\nform the\nj\n-th point pair.\nYou can assume\n0 ≤\nCx\ni\n≤ 10000,\n0 ≤\nCy\ni\n≤ 10000,\n1 ≤\nr\ni\n≤ 1000,\n0 ≤\nPx\nj\n≤ 10000,\n0 ≤\nPy\nj\n≤ 10000,\n0 ≤\nQx\nj\n≤ 10000,\n0 ≤\nQy\nj\n≤ 10000.\nIn addition,\nyou can assume\nP\nj\nor\nQ\nj\nare not located on the circumference of any circle.\nThe end of the input is indicated by a line containing two zeros separated by a space.\nFigure G-1 shows the layout of the circles and the points in the first dataset of the sample input below.\nFigure G-2 shows the layouts of the subsequent datasets in the sample input.\nFigure G-2: Sample layout of circles and points\nOutput\nFor each dataset,\noutput a single line containing the\nm\nresults separated by a space.\nThe\nj\n-th result should be \"YES\" if there exists a path connecting\nP\nj\nand\nQ\nj\n, and \"NO\" otherwise.\nSample Input\n5 3\n0 0 1000\n1399 1331 931\n0 1331 500\n1398 0 400\n2000 360 340\n450 950 1600 380\n450 950 1399 1331\n450 950 450 2000\n1 2\n50 50 50\n0 10 100 90\n0 10 50 50\n2 2\n50 50 50\n100 50 50\n40 50 110 50\n40 50 0 0\n4 1\n25 100 26\n75 100 26\n50 40 40\n50 160 40\n50 81 50 119\n6 1\n100 50 40\n0 50 40\n50 0 48\n50 50 3\n55 55 4\n55 105 48\n50 55 55 50\n20 6\n270 180 50\n360 170 50\n0 0 50\n10 0 10\n0 90 50\n0 180 50\n90 180 50\n180 180 50\n205 90 50\n180 0 50\n65 0 20\n75 30 16\n90 78 36\n105 30 16\n115 0 20\n128 48 15\n128 100 15\n280 0 30\n330 0 30\n305 65 42\n0 2\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1198_9340740","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing Real = long double;\nusing Point = complex<Real>;\nconst Real EPS = 1e-9, PI = acos(-1);\n\ninline bool eq(Real a, Real b) {\n return fabs(b - a) < EPS;\n}\n\nPoint operator*(const Point &p, const Real &d) {\n return Point(real(p) * d, imag(p) * d);\n}\n\nistream &operator>>(istream &is, Point &p) {\n Real a, b;\n is >> a >> b;\n p = Point(a, b);\n return is;\n}\n\nostream &operator<<(ostream &os, Point &p) {\n return os << fixed << setprecision(10) << p.real() << \" \" << p.imag();\n}\n\n// 点 p を反時計回りに theta 回転\nPoint rotate(Real theta, const Point &p) {\n return Point(\n cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\n}\n\nReal radian_to_degree(Real r) {\n return (r * 180.0 / PI);\n}\n\nReal degree_to_radian(Real d) {\n return (d * PI / 180.0);\n}\n\n// a-b-c の角度のうち小さい方を返す\nReal get_angle(const Point &a, const Point &b, const Point &c) {\n const Point v(b - a), w(c - b);\n Real alpha = atan2(v.imag(), v.real()), beta = atan2(w.imag(), w.real());\n if (alpha > beta) swap(alpha, beta);\n Real theta = (beta - alpha);\n return min(theta, 2 * acos(-1) - theta);\n}\n\nnamespace std {\nbool operator<(const Point &a, const Point &b) {\n return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag();\n}\n} // namespace std\n\nstruct Line {\n Point a, b;\n\n Line() = default;\n\n Line(Point a, Point b) : a(a), b(b) {}\n\n Line(Real A, Real B, Real C) // Ax + By = C\n {\n if (eq(A, 0)) a = Point(0, C / B), b = Point(1, C / B);\n else if (eq(B, 0)) b = Point(C / A, 0), b = Point(C / A, 1);\n else a = Point(0, C / B), b = Point(C / A, 0);\n }\n\n friend ostream &operator<<(ostream &os, Line &p) { return os << p.a << \" to \" << p.b; }\n\n friend istream &operator>>(istream &is, Line &a) { return is >> a.a >> a.b; }\n};\n\nstruct Segment : Line {\n Segment() = default;\n\n Segment(Point a, Point b) : Line(a, b) {}\n};\n\nstruct Circle {\n Point p;\n Real r;\n\n Circle() = default;\n\n Circle(Point p, Real r) : p(p), r(r) {}\n};\n\nusing Points = vector<Point>;\nusing Polygon = vector<Point>;\nusing Segments = vector<Segment>;\nusing Lines = vector<Line>;\nusing Circles = vector<Circle>;\n\nReal cross(const Point &a, const Point &b) {\n return real(a) * imag(b) - imag(a) * real(b);\n}\n\nReal dot(const Point &a, const Point &b) {\n return real(a) * real(b) + imag(a) * imag(b);\n}\n\n// 点の回転方向\nint ccw(const Point &a, Point b, Point c) {\n b = b - a, c = c - a;\n if (cross(b, c) > EPS) return +1; // \"COUNTER_CLOCKWISE\"\n if (cross(b, c) < -EPS) return -1; // \"CLOCKWISE\"\n if (dot(b, c) < 0) return +2; // \"ONLINE_BACK\"\n if (norm(b) < norm(c)) return -2; // \"ONLINE_FRONT\"\n return 0; // \"ON_SEGMENT\"\n}\n\n// 平行判定\nbool parallel(const Line &a, const Line &b) {\n return eq(cross(a.b - a.a, b.b - b.a), 0.0);\n}\n\n// 垂直判定\nbool orthogonal(const Line &a, const Line &b) {\n return eq(dot(a.a - a.b, b.a - b.b), 0.0);\n}\n\n// 射影\n// 直線 l に p から垂線を引いた交点を求める\nPoint projection(const Line &l, const Point &p) {\n double t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n return l.a + (l.a - l.b) * t;\n}\nPoint projection(const Segment &l, const Point &p) {\n double t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n return l.a + (l.a - l.b) * t;\n}\n\n// 反射\n// 直線 l を対称軸として点 p と線対称にある点を求める\nPoint reflection(const Line &l, const Point &p) {\n return p + (projection(l, p) - p) * 2.0;\n}\n\nbool intersect(const Line &l, const Point &p) {\n return abs(ccw(l.a, l.b, p)) != 1;\n}\nbool intersect(const Line &l, const Line &m) {\n return abs(cross(l.b - l.a, m.b - m.a)) > EPS || abs(cross(l.b - l.a, m.b - l.a)) < EPS;\n}\nbool intersect(const Segment &s, const Point &p) {\n return ccw(s.a, s.b, p) == 0;\n}\nbool intersect(const Line &l, const Segment &s) {\n return cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < EPS;\n}\n\nReal distance(const Line &l, const Point &p);\n\nbool intersect(const Circle &c, const Line &l) {\n return distance(l, c.p) <= c.r + EPS;\n}\nbool intersect(const Circle &c, const Point &p) {\n return abs(abs(p - c.p) - c.r) < EPS;\n}\nbool intersect(const Segment &s, const Segment &t) {\n return ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\n ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\n}\n\nint intersect(const Circle &c, const Segment &l) {\n if (norm(projection(l, c.p) - c.p) - c.r * c.r > EPS) return 0;\n auto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\n if (d1 < c.r + EPS && d2 < c.r + EPS) return 0;\n if (d1 < c.r - EPS && d2 > c.r + EPS || d1 > c.r + EPS && d2 < c.r - EPS) return 1;\n const Point h = projection(l, c.p);\n if (dot(l.a - h, l.b - h) < 0) return 2;\n return 0;\n}\n// 0 -> 包含, 1 -> 内接, 2 -> 交差, 3 -> 外接, 4 -> 分離\nint intersect(Circle c1, Circle c2) {\n if (c1.r < c2.r) swap(c1, c2);\n Real d = abs(c1.p - c2.p);\n if (c1.r + c2.r < d) return 4;\n if (eq(c1.r + c2.r, d)) return 3;\n if (c1.r - c2.r < d) return 2;\n if (eq(c1.r - c2.r, d)) return 1;\n return 0;\n}\n\nReal distance(const Point &a, const Point &b) {\n return abs(a - b);\n}\nReal distance(const Line &l, const Point &p) {\n return abs(p - projection(l, p));\n}\nReal distance(const Line &l, const Line &m) {\n return intersect(l, m) ? 0 : distance(l, m.a);\n}\nReal distance(const Segment &s, const Point &p) {\n Point r = projection(s, p);\n if (intersect(s, r)) return abs(r - p);\n return min(abs(s.a - p), abs(s.b - p));\n}\nReal distance(const Segment &a, const Segment &b) {\n if (intersect(a, b)) return 0;\n return min({distance(a, b.a), distance(a, b.b), distance(b, a.a), distance(b, a.b)});\n}\nReal distance(const Line &l, const Segment &s) {\n if (intersect(l, s)) return 0;\n return min(distance(l, s.a), distance(l, s.b));\n}\n\nPoint crosspoint(const Line &l, const Line &m) {\n Real A = cross(l.b - l.a, m.b - m.a);\n Real B = cross(l.b - l.a, l.b - m.a);\n if (eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\n return m.a + (m.b - m.a) * B / A;\n}\nPoint crosspoint(const Segment &l, const Segment &m) {\n return crosspoint(Line(l), Line(m));\n}\npair<Point, Point> crosspoint(const Circle &c, const Line l) {\n Point pr = projection(l, c.p);\n Point e = (l.b - l.a) / abs(l.b - l.a);\n if (eq(distance(l, c.p), c.r)) return {pr, pr};\n double base = sqrt(c.r * c.r - norm(pr - c.p));\n return {pr - e * base, pr + e * base};\n}\npair<Point, Point> crosspoint(const Circle &c, const Segment &l) {\n Line aa = Line(l.a, l.b);\n if (intersect(c, l) == 2) return crosspoint(c, aa);\n auto ret = crosspoint(c, aa);\n if (dot(l.a - ret.first, l.b - ret.first) < 0) ret.second = ret.first;\n else ret.first = ret.second;\n return ret;\n}\npair<Point, Point> crosspoint(const Circle &c1, const Circle &c2) {\n Real d = abs(c1.p - c2.p);\n Real a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));\n Real t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\n Point p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\n Point p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\n return {p1, p2};\n}\n\n// 点 p を通る円 c の接線\npair<Point, Point> tangent(const Circle &c1, const Point &p2) {\n return crosspoint(c1, Circle(p2, sqrt(norm(c1.p - p2) - c1.r * c1.r)));\n}\n\n// 円 c1, c2 の共通接線\nLines tangent(Circle c1, Circle c2) {\n Lines ret;\n if (c1.r < c2.r) swap(c1, c2);\n Real g = norm(c1.p - c2.p);\n if (eq(g, 0)) return ret;\n Point u = (c2.p - c1.p) / sqrt(g);\n Point v = rotate(PI * 0.5, u);\n for (int s : {-1, 1}) {\n Real h = (c1.r + s * c2.r) / sqrt(g);\n if (eq(1 - h * h, 0)) {\n ret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\n } else if (1 - h * h > 0) {\n Point uu = u * h, vv = v * sqrt(1 - h * h);\n ret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\n ret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\n }\n }\n return ret;\n}\n\n// 凸性判定\nbool is_convex(const Polygon &p) {\n int n = (int)p.size();\n for (int i = 0; i < n; i++) {\n if (ccw(p[(i + n - 1) % n], p[i], p[(i + 1) % n]) == -1) return false;\n }\n return true;\n}\n\n// 凸包\nPolygon convex_hull(Polygon &p) {\n int n = (int)p.size(), k = 0;\n if (n <= 2) return p;\n sort(p.begin(), p.end());\n vector<Point> ch(2 * n);\n for (int i = 0; i < n; ch[k++] = p[i++]) {\n while (k >= 2 && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < EPS) --k;\n }\n for (int i = n - 2, t = k + 1; i >= 0; ch[k++] = p[i--]) {\n while (k >= t && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < EPS) --k;\n }\n ch.resize(k - 1);\n return ch;\n}\n\n// 多角形と点の包含判定\nenum { OUT, ON, IN };\n\nint contains(const Polygon &Q, const Point &p) {\n bool in = false;\n for (int i = 0; i < Q.size(); i++) {\n Point a = Q[i] - p, b = Q[(i + 1) % Q.size()] - p;\n if (a.imag() > b.imag()) swap(a, b);\n if (a.imag() <= 0 && 0 < b.imag() && cross(a, b) < 0) in = !in;\n if (cross(a, b) == 0 && dot(a, b) <= 0) return ON;\n }\n return in ? IN : OUT;\n}\n\n// 線分の重複除去\nvoid merge_segments(vector<Segment> &segs) {\n auto merge_if_able = [](Segment &s1, const Segment &s2) {\n if (abs(cross(s1.b - s1.a, s2.b - s2.a)) > EPS) return false;\n if (ccw(s1.a, s2.a, s1.b) == 1 || ccw(s1.a, s2.a, s1.b) == -1) return false;\n if (ccw(s1.a, s1.b, s2.a) == -2 || ccw(s2.a, s2.b, s1.a) == -2) return false;\n s1 = Segment(min(s1.a, s2.a), max(s1.b, s2.b));\n return true;\n };\n\n for (int i = 0; i < segs.size(); i++) {\n if (segs[i].b < segs[i].a) swap(segs[i].a, segs[i].b);\n }\n for (int i = 0; i < segs.size(); i++) {\n for (int j = i + 1; j < segs.size(); j++) {\n if (merge_if_able(segs[i], segs[j])) {\n segs[j--] = segs.back(), segs.pop_back();\n }\n }\n }\n}\n\n// 線分アレンジメント\n// 任意の2線分の交点を頂点としたグラフを構築する\nvector<vector<int>> segment_arrangement(vector<Segment> &segs, vector<Point> &ps) {\n vector<vector<int>> g;\n int N = (int)segs.size();\n for (int i = 0; i < N; i++) {\n ps.emplace_back(segs[i].a);\n ps.emplace_back(segs[i].b);\n for (int j = i + 1; j < N; j++) {\n const Point p1 = segs[i].b - segs[i].a;\n const Point p2 = segs[j].b - segs[j].a;\n if (cross(p1, p2) == 0) continue;\n if (intersect(segs[i], segs[j])) {\n ps.emplace_back(crosspoint(segs[i], segs[j]));\n }\n }\n }\n sort(begin(ps), end(ps));\n ps.erase(unique(begin(ps), end(ps)), end(ps));\n\n int M = (int)ps.size();\n g.resize(M);\n for (int i = 0; i < N; i++) {\n vector<int> vec;\n for (int j = 0; j < M; j++) {\n if (intersect(segs[i], ps[j])) {\n vec.emplace_back(j);\n }\n }\n for (int j = 1; j < vec.size(); j++) {\n g[vec[j - 1]].push_back(vec[j]);\n g[vec[j]].push_back(vec[j - 1]);\n }\n }\n return (g);\n}\n\n// 凸多角形の切断\n// 直線 l.a-l.b で切断しその左側にできる凸多角形を返す\nPolygon convex_cut(const Polygon &U, Line l) {\n Polygon ret;\n for (int i = 0; i < U.size(); i++) {\n Point now = U[i], nxt = U[(i + 1) % U.size()];\n if (ccw(l.a, l.b, now) != -1) ret.push_back(now);\n if (ccw(l.a, l.b, now) * ccw(l.a, l.b, nxt) < 0) {\n ret.push_back(crosspoint(Line(now, nxt), l));\n }\n }\n return (ret);\n}\n\n// 多角形の面積\nReal area(const Polygon &p) {\n Real A = 0;\n for (int i = 0; i < p.size(); ++i) {\n A += cross(p[i], p[(i + 1) % p.size()]);\n }\n return A * 0.5;\n}\n\n// 円と多角形の共通部分の面積\nReal area(const Polygon &p, const Circle &c) {\n if (p.size() < 3) return 0.0;\n function<Real(Circle, Point, Point)> cross_area = [&](const Circle &c, const Point &a,\n const Point &b) {\n Point va = c.p - a, vb = c.p - b;\n Real f = cross(va, vb), ret = 0.0;\n if (eq(f, 0.0)) return ret;\n if (max(abs(va), abs(vb)) < c.r + EPS) return f;\n if (distance(Segment(a, b), c.p) > c.r - EPS) return c.r * c.r * arg(vb * conj(va));\n auto u = crosspoint(c, Segment(a, b));\n vector<Point> tot{a, u.first, u.second, b};\n for (int i = 0; i + 1 < tot.size(); i++) {\n ret += cross_area(c, tot[i], tot[i + 1]);\n }\n return ret;\n };\n Real A = 0;\n for (int i = 0; i < p.size(); i++) {\n A += cross_area(c, p[i], p[(i + 1) % p.size()]);\n }\n return A;\n}\n\n// 凸多角形の直径(最遠頂点対間距離)\nReal convex_diameter(const Polygon &p) {\n int N = (int)p.size();\n int is = 0, js = 0;\n for (int i = 1; i < N; i++) {\n if (p[i].imag() > p[is].imag()) is = i;\n if (p[i].imag() < p[js].imag()) js = i;\n }\n Real maxdis = norm(p[is] - p[js]);\n\n int maxi, maxj, i, j;\n i = maxi = is;\n j = maxj = js;\n do {\n if (cross(p[(i + 1) % N] - p[i], p[(j + 1) % N] - p[j]) >= 0) {\n j = (j + 1) % N;\n } else {\n i = (i + 1) % N;\n }\n if (norm(p[i] - p[j]) > maxdis) {\n maxdis = norm(p[i] - p[j]);\n maxi = i;\n maxj = j;\n }\n } while (i != is || j != js);\n return sqrt(maxdis);\n}\n\n// 最近点対\nReal closest_pair(Points ps) {\n if (ps.size() <= 1) throw(0);\n sort(begin(ps), end(ps));\n\n auto compare_y = [&](const Point &a, const Point &b) { return imag(a) < imag(b); };\n vector<Point> beet(ps.size());\n const Real INF = 1e18;\n\n function<Real(int, int)> rec = [&](int left, int right) {\n if (right - left <= 1) return INF;\n int mid = (left + right) >> 1;\n auto x = real(ps[mid]);\n auto ret = min(rec(left, mid), rec(mid, right));\n inplace_merge(begin(ps) + left, begin(ps) + mid, begin(ps) + right, compare_y);\n int ptr = 0;\n for (int i = left; i < right; i++) {\n if (abs(real(ps[i]) - x) >= ret) continue;\n for (int j = 0; j < ptr; j++) {\n auto luz = ps[i] - beet[ptr - j - 1];\n if (imag(luz) >= ret) break;\n ret = min(ret, abs(luz));\n }\n beet[ptr++] = ps[i];\n }\n return ret;\n };\n return rec(0, (int)ps.size());\n}\n\n// 平面グラフを多角形に分割する (基本的に反時計回り、外平面のみ時計回り)\n// graph は無向グラフを想定 (u-v <=> v-u)。変なグラフを入れると壊れるはず\nvector<vector<int>> decompose_to_cycle(const vector<vector<int>> &graph, const vector<Point> &pos) {\n assert(graph.size() == pos.size());\n int n = graph.size();\n int m = 0;\n map<array<int, 2>, int> mp;\n vector<array<int, 2>> edge;\n for (int i = 0; i < n; ++i) {\n for (auto ni : graph[i]) {\n mp[{i, ni}] = m++;\n edge.push_back({i, ni});\n }\n }\n \n vector<int> nex(m, -1);\n for (int i = 0; i < n; ++i) {\n if (graph[i].empty()) continue;\n \n vector<pair<long double, int>> adj;\n for (int ni : graph[i]) {\n Point diff = pos[ni] - pos[i];\n assert(pos[ni] != pos[i]);\n adj.push_back({arg(diff), ni});\n }\n \n sort(adj.begin(), adj.end());\n int siz = adj.size();\n adj.emplace_back(adj[0]);\n adj[siz].first += 2 * PI;\n \n for (int j = 0; j < siz; ++j) {\n auto [arg0, to] = adj[j];\n auto [arg1, from] = adj[j + 1];\n int ein = mp[{from, i}];\n int eout = mp[{i, to}];\n \n nex[ein] = eout;\n }\n }\n \n vector<vector<int>> ret;\n vector<bool> used(m, false);\n for (int i = 0; i < m; ++i) {\n if (used[i]) continue;\n \n vector<int> tmp;\n int now = i;\n while (!used[now]) {\n used[now] = true;\n tmp.emplace_back(edge[now][0]);\n now = nex[now];\n }\n ret.emplace_back(tmp);\n }\n \n return ret;\n}\n\n/*-- main --*/\n\nbool is_end = false;\n\nvoid solve()\n{\n int N, Q; cin >> N >> Q;\n if (N == 0 && Q == 0)\n {\n is_end = true;\n return;\n }\n vector<Circle> circles(N);\n vector<Point> centers(N);\n for (int i = 0; i < N; ++i)\n {\n Real x, y, r; cin >> x >> y >> r;\n centers[i] = Point(x, y);\n circles[i] = Circle(Point(x, y), r);\n }\n vector<array<Point, 2>> query(Q);\n for (int i = 0; i < Q; ++i)\n {\n int px, py, qx, qy; cin >> px >> py >> qx >> qy;\n query[i][0] = Point(px, py);\n query[i][1] = Point(qx, qy);\n }\n \n \n vector<vector<int>> graph(N);\n for (int i = 0; i < N; ++i)\n {\n for (int j = 0; j < N; ++j)\n {\n if (i == j) continue;\n if (intersect(circles[i], circles[j]) == 2) graph[i].emplace_back(j);\n }\n }\n vector<vector<int>> tmp = decompose_to_cycle(graph, centers);\n vector<Polygon> polygons(tmp.size());\n for (int i = 0; i < tmp.size(); ++i)\n {\n for (auto v : tmp[i])\n {\n polygons[i].emplace_back(centers[v]);\n }\n }\n \n for (int i = 0; i < Q; ++i)\n {\n auto [p, q] = query[i];\n \n vector<bool> isinp(N, false), isinq(N, false);\n int cntp = 0, cntq = 0;\n for (int j = 0; j < N; ++j)\n {\n Point center = circles[j].p;\n Real radius = circles[j].r;\n if (abs(center - p) < radius) isinp[j] = true, cntp++;\n if (abs(center - q) < radius) isinq[j] = true, cntq++;\n }\n \n bool flg = false;\n if (isinp != isinq) flg = false;\n else\n {\n flg = true;\n \n if (cntp == 0)\n {\n int siz = polygons.size();\n for (auto poly : polygons)\n {\n auto pp = contains(poly, p);\n auto qq = contains(poly, q);\n if (pp != qq) flg = false;\n }\n }\n }\n \n cout << (flg ? \"YES\" : \"NO\") << \" \\n\"[i+1 == Q];\n }\n \n return;\n}\n\nint main()\n{\n while (!is_end)\n {\n solve();\n }\n \n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3672,"score_of_the_acc":-0.0868,"final_rank":11},{"submission_id":"aoj_1198_9035480","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;\nvector<int> cycle_detection(const vector<vector<int>>& g) {\n int n = g.size();\n vector<int> r(n, -1), p(n, -1), d(n, 0);\n auto dfs = [&](auto& dfs, int r2, int cur) -> void {\n r[cur] = r2;\n for(int to : g[cur]) {\n if(r[to] == -1) {\n d[to] = d[cur] + 1;\n p[to] = cur;\n dfs(dfs, r2, to);\n }\n }\n };\n rep(i, 0, n) {\n if(p[i] == -1) {\n dfs(dfs, i, i);\n }\n }\n rep(i, 0, n) {\n for(int j : g[i]) {\n if(r[i] == r[j] and d[j] - d[i] > 1) {\n vector<int> cycle;\n for(int v = j; v != i; v = p[v]) {\n cycle.push_back(v);\n }\n cycle.push_back(i);\n return cycle;\n }\n }\n }\n return {};\n}\nusing Real = long double;\nconst Real EPS = 1e-6, 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}\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_intersect_ss(const Segment& s1, const Segment& s2) {\n if(ccw(s1.a, s1.b, s2.a) * ccw(s1.a, s1.b, s2.b) > 0) return false;\n return ccw(s2.a, s2.b, s1.a) * ccw(s2.a, s2.b, s1.b) <= 0;\n}\nbool in_polygon(const vector<Point>& ps, const Point& p) {\n int n = ps.size();\n Segment seg = Segment(p, Point(p.real() + 1000000, p.imag() + 58));\n int cnt = 0;\n rep(i, 0, n) {\n Point dir = ps[(i + 1) % n] - ps[i];\n if(is_intersect_ss(seg, Segment(ps[i], ps[(i + 1) % n] - EPS * dir))) {\n cnt++;\n }\n }\n return cnt % 2 == 1;\n}\nstruct Circle {\n Point p;\n Real r;\n Circle() = default;\n Circle(const Point& p, const Real& r)\n : p(p), r(r) {}\n};\nint is_intersect_cc(Circle c1, Circle c2) {\n if(c1.r < c2.r) swap(c1, c2);\n Real d = abs(c1.p - c2.p);\n int a = sign(d - c1.r - c2.r);\n if(a >= 0) return a + 3;\n return sign(d - c1.r + c2.r) + 1;\n}\nbool is_contain_cp(Circle c, Point p) {\n return abs(p - c.p) < c.r;\n}\nint main(void) {\n while(1) {\n int n, m;\n cin >> n >> m;\n if(n == 0 and m == 0) break;\n vector<Circle> c(n);\n rep(i, 0, n) {\n cin >> c[i].p >> c[i].r;\n }\n rep(tc, 0, m) {\n Point p, q;\n cin >> p >> q;\n set<int> st1, st2;\n rep(i, 0, n) {\n if(is_contain_cp(c[i], p)) {\n st1.insert(i);\n }\n if(is_contain_cp(c[i], q)) {\n st2.insert(i);\n }\n }\n if(!st1.empty() or !st2.empty()) {\n if(st1 == st2) {\n cout << \"YES\";\n } else {\n cout << \"NO\";\n }\n if(tc + 1 < m) cout << ' ';\n continue;\n }\n vector<vector<int>> g(n);\n rep(i, 0, n) {\n rep(j, 0, i) {\n if(is_intersect_cc(c[i], c[j]) == 2) {\n g[i].push_back(j);\n g[j].push_back(i);\n }\n }\n }\n bool ans = true;\n while(1) {\n vector<int> cycle = cycle_detection(g);\n if(cycle.empty()) break;\n vector<Point> ps;\n rep(i, 0, (int)cycle.size()) {\n ps.push_back(c[cycle[i]].p);\n }\n if(in_polygon(ps, p) != in_polygon(ps, q)) {\n ans = false;\n break;\n }\n rep(i, 0, (int)g[cycle[0]].size()) {\n if(g[cycle[0]][i] == cycle[1]) {\n g[cycle[0]].erase(g[cycle[0]].begin() + i);\n break;\n }\n }\n rep(i, 0, (int)g[cycle[1]].size()) {\n if(g[cycle[1]][i] == cycle[0]) {\n g[cycle[1]].erase(g[cycle[1]].begin() + i);\n break;\n }\n }\n }\n if(ans) {\n cout << \"YES\";\n } else {\n cout << \"NO\";\n }\n if(tc < m - 1) cout << ' ';\n }\n cout << '\\n';\n }\n}","accuracy":1,"time_ms":50,"memory_kb":3480,"score_of_the_acc":-0.0648,"final_rank":9},{"submission_id":"aoj_1198_8006463","code_snippet":"#line 1 \"test/geometry/aoj1198.test.cpp\"\n#define PROBLEM \"https://onlinejudge.u-aizu.ac.jp/problems/1198\"\n\n#line 2 \"template/template.hpp\"\n\n#include<bits/stdc++.h>\n\n#define rep(i,n) for (int i = 0; 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 ull = unsigned long long;\n\nusing namespace std;\n\nnamespace noya2{\n\n/* ~ (. _________ . /) */\n\n}\n\nusing namespace noya2;\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\ntemplate<class T>istream &operator>>(istream &is, vector<T> &v){\n for (auto &e : v) is >> e;\n return is;\n}\n\nvoid fast_io(){\n cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(15);\n}\n\nconst int iinf = 1'000'000'007;\nconst ll linf = 2e18;\n#line 4 \"test/geometry/aoj1198.test.cpp\"\n\n#line 2 \"geometry/partition_by_circle.hpp\"\n\n#line 2 \"geometry/base_ld.hpp\"\n\n#line 4 \"geometry/base_ld.hpp\"\n\nnamespace noya2 {\n\nusing vec = complex<ld>;\n\nconst ld PI = acos(-1);\n\nvoid ldout(int len = 20) {\n cout << fixed << setprecision(len);\n}\n\nint sgn(ld a, const ld eps = 1e-7) {\n return (a < -eps) ? -1 : (a > eps) ? 1 : 0;\n}\n\nbool same_vec(vec a, vec b) {\n a -= b;\n return sgn(a.real()) == 0 && sgn(a.imag()) == 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\n\n} // namespace lib\n#line 2 \"data_structure/dsu.hpp\"\n\n#line 4 \"data_structure/dsu.hpp\"\n\nnamespace noya2{\n\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 noya2\n#line 6 \"geometry/partition_by_circle.hpp\"\n\nnamespace noya2{\n\nusing vec = complex<ld>;\n\nstruct circle {\n vec c;\n ld r;\n};\n\n// c1 != c2\nvector<ld> cross_point_x(const circle &c1, const circle &c2){\n assert(sgn(abs(c1.r - c2.r)) != 0 || sgn(abs(c1.c - c2.c)) != 0);\n ld d = abs(c1.c - c2.c);\n // 円が離れすぎている\n if (sgn(d - c1.r - c2.r) > 0) return {};\n // 円が近すぎる\n if (sgn(abs(c1.r - c2.r) - d) > 0) return {};\n // 外接している\n if (sgn(d - c1.r - c2.r) == 0){\n return {(c1.r*c2.c.real() + c2.r*c1.c.real()) / (c1.r + c2.r)};\n }\n // 内接している\n if (sgn(abs(c1.r - c2.r) - d) == 0){\n return {(c1.r * c2.c.real() - c2.r * c1.c.real()) / (c1.r - c2.r)};\n }\n // 2 点を共有する\n ld e = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\n vec p = c1.c + (c2.c - c1.c) * e / d;\n vec v((c1.c - c2.c).imag(),(c2.c - c1.c).real());\n v *= sqrtl(max(c1.r * c1.r - e * e, ld(0))) / abs(v);\n return {(p+v).real(),(p-v).real()};\n}\n\nvector<ld> cross_point_y(const circle &c, const ld &x){\n int cond = sgn(abs(c.c.real() - x) - c.r); \n if (cond > 0) return {};\n if (cond == 0) return {c.c.imag()};\n ld ydiff = sqrtl(max(c.r*c.r - (x - c.c.real()) * (x - c.c.real()),ld(0)));\n return {c.c.imag()+ydiff,c.c.imag()-ydiff};\n}\n\nstruct Partition_by_Circles {\n vector<circle> a;\n // 同じ円は与えられない\n void add_circle(circle c){\n // x 座標で区切る場所が重ならないように 1 rad 回転しておく\n c.c = rot(c.c,1);\n a.emplace_back(c);\n }\n ld coordinate_width(){\n ld res = 0.0;\n for (auto &c : a){\n chmax(res,abs(c.c)+c.r);\n }\n return res;\n }\n vector<ld> x_coordinates(){\n vector<ld> xs;\n for (auto &c : a){\n xs.emplace_back(c.c.real()-c.r);\n xs.emplace_back(c.c.real()+c.r);\n }\n int siza = a.size();\n for (int i = 0; i < siza-1; i++) for (int j = i+1; j < siza; j++){\n for (auto x : cross_point_x(a[i],a[j])){\n bool yet = true;\n for (auto testx : xs){\n if (sgn(abs(x - testx)) == 0){\n yet = false;\n break;\n }\n }\n if (yet) xs.emplace_back(x);\n }\n }\n sort(all(xs));\n return xs;\n }\n using ylr = tuple<ld,int,int>;\n vector<ylr> y_coordinates(ld x){\n vector<ylr> ys;\n auto add = [&](ld y, int l, int r){\n bool yet = true;\n for (auto &[testy, testl, testr] : ys){\n if (sgn(abs(y - testy)) == 0){\n yet = false;\n testl += l;\n testr += r;\n break;\n }\n }\n if (yet) ys.push_back({y,l,r});\n };\n for (auto &c : a){\n auto vecy = cross_point_y(c,x);\n if (vecy.empty()) continue;\n if ((int)(vecy.size()) == 2){\n for (auto y : vecy) add(y,1,1);\n }\n else {\n if (c.c.real() < x){\n add(vecy[0],2,0);\n }\n else {\n add(vecy[0],0,2);\n }\n }\n }\n sort(all(ys),[&](ylr lhs, ylr rhs){\n return get<0>(lhs) < get<0>(rhs);\n });\n return ys;\n }\n dsu d;\n vector<ld> xs;\n vector<int> lower_idx;\n map<int,int> mp;\n vector<vector<int>> build_graph(ld max_width = 0){\n // 大きな円で全体を囲ってしまう\n if (sgn(max_width) == 0) max_width = coordinate_width()*2;\n a.push_back({vec(0,0),max_width});\n // x 座標の列挙\n xs = x_coordinates();\n // 各 x について y 座標の列挙\n vector<vector<ylr>> yss; yss.reserve(xs.size());\n for (auto &x : xs) yss.push_back(y_coordinates(x));\n // x で切って領域を舐める\n int idx = 0;\n vector<pair<int,int>> es, merge;\n vector<int> cur;\n for (int itr = 0; itr < (int)(xs.size())-1; itr++){\n lower_idx.emplace_back(idx);\n vector<int> lid, rid;\n for (int l = 0; l < (int)(yss[itr].size()); l++){\n for (int t = 0; t < get<2>(yss[itr][l]); t++){\n lid.emplace_back(l);\n }\n }\n for (int r = 0; r < (int)(yss[itr+1].size()); r++){\n for (int t = 0; t < get<1>(yss[itr+1][r]); t++){\n rid.emplace_back(r);\n }\n }\n assert(lid.size() == rid.size());\n int pre = 0;\n vector<int> nxt;\n for (int i = 0; i < (int)(lid.size())-1; i++){\n for (int t = 0; t < rid[i+1]-rid[i]; t++){\n nxt.emplace_back(idx);\n }\n if (i != 0){\n es.emplace_back(idx-1,idx);\n }\n if (lid[i+1] - lid[i] != 0){\n merge.emplace_back(cur[pre++],idx);\n }\n if (lid[i+1] - lid[i] == 2){\n merge.emplace_back(cur[pre++],idx);\n }\n idx++;\n }\n swap(cur,nxt);\n }\n // グラフを構築\n d = dsu(idx);\n for (auto &[u, v] : merge) d.merge(u,v);\n set<int> st;\n for (int i = 0; i < idx; i++) st.insert(d.leader(i));\n int vid = 0;\n for (auto v : st) mp[v] = vid++;\n vector<vector<int>> graph(vid);\n for (auto [u, v] : es){\n u = mp[d.leader(u)];\n v = mp[d.leader(v)];\n graph[u].emplace_back(v);\n graph[v].emplace_back(u);\n }\n return graph;\n }\n int get_area_idx(vec p){\n p = rot(p,1);\n int xid = int(lower_bound(all(xs),p.real()) - xs.begin()) - 1;\n vector<ld> ys;\n for (auto &[y, l, r] : y_coordinates(p.real())) ys.emplace_back(y);\n int yid = int(lower_bound(all(ys),p.imag()) - ys.begin()) - 1;\n return mp[d.leader(lower_idx[xid] + yid)];\n }\n};\n\n} //namespace noya2\n#line 6 \"test/geometry/aoj1198.test.cpp\"\n\nint main(){\n while (true){\n int n, m; cin >> n >> m;\n if (n == 0 && m == 0) break;\n Partition_by_Circles pc;\n while (n--){\n ld x, y, r; cin >> x >> y >> r;\n pc.add_circle(circle({vec(x,y),r}));\n }\n pc.build_graph(100000);\n string ans = \"\";\n while (m--){\n ld px, py, qx, qy; cin >> px >> py >> qx >> qy;\n int ip = pc.get_area_idx(vec(px,py));\n int iq = pc.get_area_idx(vec(qx,qy));\n ans += (ip == iq ? \"YES\" : \"NO\");\n ans += (m == 0 ? '\\n' : ' ');\n }\n cout << ans;\n }\n}","accuracy":1,"time_ms":80,"memory_kb":4640,"score_of_the_acc":-0.3014,"final_rank":16},{"submission_id":"aoj_1198_7993928","code_snippet":"#line 1 \"test/geometry/aoj1198.test.cpp\"\n#define PROBLEM \"https://onlinejudge.u-aizu.ac.jp/problems/1198\"\n\n#line 2 \"template/template.hpp\"\n\n#include<bits/stdc++.h>\n\n#define rep(i,n) for (int i = 0; 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 ull = unsigned long long;\n\nusing namespace std;\n\nnamespace noya2{\n\n/* ~ (. _________ . /) */\n\n}\n\nusing namespace noya2;\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\ntemplate<class T>istream &operator>>(istream &is, vector<T> &v){\n for (auto &e : v) is >> e;\n return is;\n}\n\nvoid fast_io(){\n cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(15);\n}\n\nconst int iinf = 1'000'000'007;\nconst ll linf = 2e18;\n#line 4 \"test/geometry/aoj1198.test.cpp\"\n\n#line 2 \"geometry/partition_by_circle.hpp\"\n\n#line 2 \"geometry/base_ld.hpp\"\n\n#line 4 \"geometry/base_ld.hpp\"\n\nnamespace noya2 {\n\nusing vec = complex<ld>;\n\nconst ld PI = acos(-1);\n\nvoid ldout(int len = 20) {\n cout << fixed << setprecision(len);\n}\n\nint sgn(ld a, const ld eps = 1e-7) {\n return (a < -eps) ? -1 : (a > eps) ? 1 : 0;\n}\n\nbool same_vec(vec a, vec b) {\n a -= b;\n return sgn(a.real()) == 0 && sgn(a.imag()) == 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#line 5 \"geometry/partition_by_circle.hpp\"\n\nnamespace noya2{\n\nstruct dsu {\n dsu(int n = 0) : _n(n), pos(n, -1) {}\n\n int merge(int a, int b) {\n int x = leader(a), y = leader(b);\n if (x == y) return x;\n if (-pos[x] < -pos[y]) swap(x, y);\n pos[x] += pos[y];\n pos[y] = x;\n return x;\n }\n\n bool same(int a, int b) {\n return leader(a) == leader(b);\n }\n\n int leader(int a) {\n if (pos[a] < 0) return a;\n return pos[a] = leader(pos[a]);\n }\n private:\n int _n;\n vector<int> pos;\n};\n\nusing vec = complex<ld>;\n\nstruct circle {\n vec c;\n ld r;\n};\n\n// c1 != c2\nvector<ld> cross_point_x(const circle &c1, const circle &c2){\n assert(sgn(abs(c1.r - c2.r)) != 0 || sgn(abs(c1.c - c2.c)) != 0);\n ld d = abs(c1.c - c2.c);\n // 円が離れすぎている\n if (sgn(d - c1.r - c2.r) > 0) return {};\n // 円が近すぎる\n if (sgn(abs(c1.r - c2.r) - d) > 0) return {};\n // 外接している\n if (sgn(d - c1.r - c2.r) == 0){\n return {(c1.r*c2.c.real() + c2.r*c1.c.real()) / (c1.r + c2.r)};\n }\n // 内接している\n if (sgn(abs(c1.r - c2.r) - d) == 0){\n return {(c1.r * c2.c.real() - c2.r * c1.c.real()) / (c1.r - c2.r)};\n }\n // 2 点を共有する\n ld e = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\n vec p = c1.c + (c2.c - c1.c) * e / d;\n vec v((c1.c - c2.c).imag(),(c2.c - c1.c).real());\n v *= sqrtl(max(c1.r * c1.r - e * e, ld(0))) / abs(v);\n return {(p+v).real(),(p-v).real()};\n}\n\nvector<ld> cross_point_y(const circle &c, const ld &x){\n int cond = sgn(abs(c.c.real() - x) - c.r); \n if (cond > 0) return {};\n if (cond == 0) return {c.c.imag()};\n ld ydiff = sqrtl(max(c.r*c.r - (x - c.c.real()) * (x - c.c.real()),ld(0)));\n return {c.c.imag()+ydiff,c.c.imag()-ydiff};\n}\n\nstruct Partition_by_Circles {\n vector<circle> a;\n // 同じ円は与えられない\n void add_circle(circle c){\n // x 座標で区切る場所が重ならないように 1 rad 回転しておく\n c.c = rot(c.c,1);\n a.emplace_back(c);\n }\n ld coordinate_width(){\n ld res = 0.0;\n for (auto &c : a){\n chmax(res,abs(c.c)+c.r);\n }\n return res;\n }\n vector<ld> x_coordinates(){\n vector<ld> xs;\n for (auto &c : a){\n xs.emplace_back(c.c.real()-c.r);\n xs.emplace_back(c.c.real()+c.r);\n }\n int siza = a.size();\n for (int i = 0; i < siza-1; i++) for (int j = i+1; j < siza; j++){\n for (auto x : cross_point_x(a[i],a[j])){\n bool yet = true;\n for (auto testx : xs){\n if (sgn(abs(x - testx)) == 0){\n yet = false;\n break;\n }\n }\n if (yet) xs.emplace_back(x);\n }\n }\n sort(all(xs));\n return xs;\n }\n using ylr = tuple<ld,int,int>;\n vector<ylr> y_coordinates(ld x){\n vector<ylr> ys;\n auto add = [&](ld y, int l, int r){\n bool yet = true;\n for (auto &[testy, testl, testr] : ys){\n if (sgn(abs(y - testy)) == 0){\n yet = false;\n testl += l;\n testr += r;\n break;\n }\n }\n if (yet) ys.push_back({y,l,r});\n };\n for (auto &c : a){\n auto vecy = cross_point_y(c,x);\n if (vecy.empty()) continue;\n if ((int)(vecy.size()) == 2){\n for (auto y : vecy) add(y,1,1);\n }\n else {\n if (c.c.real() < x){\n add(vecy[0],2,0);\n }\n else {\n add(vecy[0],0,2);\n }\n }\n }\n sort(all(ys),[&](ylr lhs, ylr rhs){\n return get<0>(lhs) < get<0>(rhs);\n });\n return ys;\n }\n dsu d;\n vector<ld> xs;\n vector<int> lower_idx;\n map<int,int> mp;\n vector<vector<int>> build_graph(){\n // 大きな円で全体を囲ってしまう\n a.push_back({vec(0,0),coordinate_width()*2});\n // x 座標の列挙\n xs = x_coordinates();\n // 各 x について y 座標の列挙\n vector<vector<ylr>> yss; yss.reserve(xs.size());\n for (auto &x : xs) yss.push_back(y_coordinates(x));\n // x で切って領域を舐める\n int idx = 0;\n vector<pair<int,int>> es, merge;\n vector<int> cur;\n for (int itr = 0; itr < (int)(xs.size())-1; itr++){\n lower_idx.emplace_back(idx);\n vector<int> lid, rid;\n for (int l = 0; l < (int)(yss[itr].size()); l++){\n for (int t = 0; t < get<2>(yss[itr][l]); t++){\n lid.emplace_back(l);\n }\n }\n for (int r = 0; r < (int)(yss[itr+1].size()); r++){\n for (int t = 0; t < get<1>(yss[itr+1][r]); t++){\n rid.emplace_back(r);\n }\n }\n assert(lid.size() == rid.size());\n int pre = 0;\n vector<int> nxt;\n for (int i = 0; i < (int)(lid.size())-1; i++){\n for (int t = 0; t < rid[i+1]-rid[i]; t++){\n nxt.emplace_back(idx);\n }\n if (i != 0){\n es.emplace_back(idx-1,idx);\n }\n if (lid[i+1] - lid[i] != 0){\n merge.emplace_back(cur[pre++],idx);\n }\n if (lid[i+1] - lid[i] == 2){\n merge.emplace_back(cur[pre++],idx);\n }\n idx++;\n }\n swap(cur,nxt);\n }\n // グラフを構築\n d = dsu(idx);\n for (auto &[u, v] : merge) d.merge(u,v);\n set<int> st;\n for (int i = 0; i < idx; i++) st.insert(d.leader(i));\n int vid = 0;\n for (auto v : st) mp[v] = vid++;\n vector<vector<int>> graph(vid);\n for (auto [u, v] : es){\n u = mp[d.leader(u)];\n v = mp[d.leader(v)];\n graph[u].emplace_back(v);\n graph[v].emplace_back(u);\n }\n return graph;\n }\n int get_area_idx(vec p){\n p = rot(p,1);\n int xid = int(lower_bound(all(xs),p.real()) - xs.begin()) - 1;\n vector<ld> ys;\n for (auto &[y, l, r] : y_coordinates(p.real())) ys.emplace_back(y);\n int yid = int(lower_bound(all(ys),p.imag()) - ys.begin()) - 1;\n return mp[d.leader(lower_idx[xid] + yid)];\n }\n};\n\n} //namespace noya2\n#line 6 \"test/geometry/aoj1198.test.cpp\"\n\nint main(){\n while (true){\n int n, m; cin >> n >> m;\n if (n == 0 && m == 0) break;\n Partition_by_Circles pc;\n while (n--){\n ld x, y, r; cin >> x >> y >> r;\n pc.add_circle(circle({vec(x,y),r}));\n }\n pc.build_graph();\n string ans = \"\";\n while (m--){\n ld px, py, qx, qy; cin >> px >> py >> qx >> qy;\n int ip = pc.get_area_idx(vec(px,py));\n int iq = pc.get_area_idx(vec(qx,qy));\n ans += (ip == iq ? \"YES\" : \"NO\");\n ans += (m == 0 ? '\\n' : ' ');\n }\n cout << ans;\n }\n}","accuracy":1,"time_ms":80,"memory_kb":4724,"score_of_the_acc":-0.3171,"final_rank":17},{"submission_id":"aoj_1198_7200612","code_snippet":"#include <cmath>\n#include <vector>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\n\nclass edge {\npublic:\n\tint to; bool vis;\n\tedge() : to(-1), vis(false) {}\n\tedge(int to_, bool vis_) : to(to_), vis(vis_) {}\n};\n\nint main() {\n\twhile (true) {\n\t\tint N, M;\n\t\tcin >> N >> M;\n\t\tif (N == 0 && M == 0) {\n\t\t\tbreak;\n\t\t}\n\t\tvector<int> IX(N), IY(N), IR(N);\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tcin >> IX[i] >> IY[i] >> IR[i];\n\t\t}\n\t\tauto sqr = [](int x) {\n\t\t\treturn x * x;\n\t\t};\n\t\tvector<bool> answers(M, true);\n\t\tfor (int id = 0; id < M; id++) {\n\t\t\tint PX, PY, QX, QY;\n\t\t\tcin >> PX >> PY >> QX >> QY;\n\t\t\tfor (int i = 0; i < N; i++) {\n\t\t\t\tif ((sqr(PX - IX[i]) + sqr(PY - IY[i]) < sqr(IR[i])) != (sqr(QX - IX[i]) + sqr(QY - IY[i]) < sqr(IR[i]))) {\n\t\t\t\t\tanswers[id] = false;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (answers[id]) {\n\t\t\t\t// step #1. find all necessary circles\n\t\t\t\tvector<int> X, Y, R;\n\t\t\t\tfor (int i = 0; i < N; i++) {\n\t\t\t\t\tif (sqr(PX - IX[i]) + sqr(PY - IY[i]) >= sqr(IR[i])) {\n\t\t\t\t\t\tX.push_back(IX[i]);\n\t\t\t\t\t\tY.push_back(IY[i]);\n\t\t\t\t\t\tR.push_back(IR[i]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tint K = X.size();\n\t\t\t\t\n\t\t\t\t// step #2. make graph\n\t\t\t\tvector<vector<edge> > G(K);\n\t\t\t\tfor (int i = 0; i < K; i++) {\n\t\t\t\t\tfor (int j = i + 1; j < K; j++) {\n\t\t\t\t\t\tint dist = sqr(X[j] - X[i]) + sqr(Y[j] - Y[i]);\n\t\t\t\t\t\tif (sqr(R[i] - R[j]) < dist && dist < sqr(R[i] + R[j])) {\n\t\t\t\t\t\t\tG[i].push_back(edge(j, false));\n\t\t\t\t\t\t\tG[j].push_back(edge(i, false));\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tfor (int i = 0; i < K; i++) {\n\t\t\t\t\tsort(G[i].begin(), G[i].end(), [&](const edge& ea, const edge& eb) {\n\t\t\t\t\t\treturn atan2(Y[ea.to] - Y[i], X[ea.to] - X[i]) < atan2(Y[eb.to] - Y[i], X[eb.to] - X[i]);\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// step #3. compute polygons\n\t\t\t\tvector<vector<int> > polygons;\n\t\t\t\tfor (int i = 0; i < K; i++) {\n\t\t\t\t\tfor (edge &e : G[i]) {\n\t\t\t\t\t\tif (e.vis == false) {\n\t\t\t\t\t\t\tvector<int> subpolygon;\n\t\t\t\t\t\t\tint pre = i, pos = e.to;\n\t\t\t\t\t\t\tdo {\n\t\t\t\t\t\t\t\tsubpolygon.push_back(pos);\n\t\t\t\t\t\t\t\tfor (int j = 0; j < int(G[pos].size()); j++) {\n\t\t\t\t\t\t\t\t\tif (G[pos][j].to == pre) {\n\t\t\t\t\t\t\t\t\t\tpre = pos;\n\t\t\t\t\t\t\t\t\t\tpos = G[pos][(j + 1) % G[pos].size()].to;\n\t\t\t\t\t\t\t\t\t\tG[pos][(j + 1) % G[pos].size()].vis = true;\n\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t} while(pos != e.to);\n\t\t\t\t\t\t\tpolygons.push_back(subpolygon);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// step #4. check if a point is inside polygon\n\t\t\t\tauto is_inside = [&](const vector<int>& poly, int x, int y) {\n\t\t\t\t\tint crosses = 0;\n\t\t\t\t\tfor (int i = 0; i < int(poly.size()); i++) {\n\t\t\t\t\t\tint xa = X[poly[i]], ya = Y[poly[i]];\n\t\t\t\t\t\tint xb = X[poly[(i + 1) % poly.size()]], yb = Y[poly[(i + 1) % poly.size()]];\n\t\t\t\t\t\tif (ya > yb) {\n\t\t\t\t\t\t\tswap(xa, xb);\n\t\t\t\t\t\t\tswap(ya, yb);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (ya <= y && y < yb && (xa - x) * (yb - y) - (xb - x) * (ya - y) >= 0) {\n\t\t\t\t\t\t\tcrosses += 1;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\treturn (crosses % 2 == 1);\n\t\t\t\t};\n\t\t\t\t\n\t\t\t\t// step #5. check for all polygons\n\t\t\t\tfor (vector<int> poly : polygons) {\n\t\t\t\t\tif (is_inside(poly, PX, PY) != is_inside(poly, QX, QY)) {\n\t\t\t\t\t\tanswers[id] = false;\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}\n\t\tfor (int i = 0; i < M; i++) {\n\t\t\tif (i != 0) cout << ' ';\n\t\t\tcout << (answers[i] ? \"YES\" : \"NO\");\n\t\t}\n\t\tcout << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3748,"score_of_the_acc":-0.094,"final_rank":12},{"submission_id":"aoj_1198_7127374","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ld = long double;\nusing point = complex<ld>;\nusing polygon = vector<point>;\n\nconst ld pi = acosl(-1);\n\nconstexpr ld eps = 1e-9;\n\nbool is_zero(ld x) {\n return abs(x) < eps;\n}\nint compare(ld x, ld y) {\n return is_zero(x - y) ? 0 : x < y ? -1 : +1;\n}\n\nstruct circle {\n point p;\n ld r;\n circle() : p(0), r(0) {}\n circle(point p, ld r) : p(p), r(r) {}\n\n bool contains(point q) {\n return compare(abs(p - q), r) <= 0;\n }\n};\n\nbool is_in_polygon(polygon poly, point p) {\n int n = poly.size();\n ld sum = 0;\n for (int i = 0; i < n; ++i) {\n point p1 = poly[i], p2 = poly[(i + 1) % n];\n sum += arg((p2 - p) / (p1 - p));\n }\n return abs(sum) >= pi / 2;\n}\n\nvoid solve(int n, int m, vector<circle> cs) {\n vector<vector<int>> g = [&] {\n vector<set<int>> g(n);\n for (int i = 0; i < n; ++i) for (int j = 0; j < i; ++j) {\n ld d = abs(cs[i].p - cs[j].p);\n ld dl = abs(cs[i].r - cs[j].r), dr = cs[i].r + cs[j].r;\n if (compare(dl, d) < 0 and compare(d, dr) < 0) {\n g[i].insert(j);\n g[j].insert(i);\n }\n }\n\n auto deg_comp = [&](int i, int j) { return g[i].size() == g[j].size() ? i < j : g[i].size() < g[j].size(); };\n set<int, decltype(deg_comp)> st{ deg_comp };\n\n for (int i = 0; i < n; ++i) st.insert(i);\n\n while (st.size()) {\n int u = *st.begin();\n st.erase(st.begin());\n if (g[u].size() == 0) continue;\n if (g[u].size() >= 2) break;\n int v = *g[u].begin();\n g[u].clear();\n st.erase(v);\n g[v].erase(u);\n st.insert(v);\n }\n\n vector<vector<int>> res(n);\n for (int i = 0; i < n; ++i) for (int j : g[i]) res[i].push_back(j);\n return res;\n }();\n\n vector<map<int, int>> idx(n);\n\n for (int i = 0; i < n; ++i) {\n sort(\n g[i].begin(), g[i].end(),\n [&](int x, int y) {\n point p = cs[x].p - cs[i].p;\n point q = cs[y].p - cs[i].p;\n return arg(p) < arg(q);\n }\n );\n int siz = g[i].size();\n for (int j = 0; j < siz; ++j) {\n idx[i][g[i][j]] = j;\n }\n }\n\n vector<vector<int8_t>> seen(n);\n for (int i = 0; i < n; ++i) {\n seen[i].resize(g[i].size(), false);\n }\n\n vector<polygon> polygons;\n\n for (int i = 0; i < n; ++i) for (int j = 0; j < int(g[i].size()); ++j) if (not seen[i][j]) {\n polygon poly;\n for (int u = i, k = j;;) {\n poly.push_back(cs[u].p);\n int v = g[u][k];\n int rev_k = idx[v][u];\n assert(not seen[u][k]);\n seen[u][k] = true;\n int nk = (rev_k + g[v].size() - 1) % g[v].size();\n u = v, k = nk;\n if (u == i and k == j) {\n break;\n }\n }\n polygons.push_back(poly);\n // for (auto p : poly) {\n // cerr << \"(\" << real(p) << \", \" << imag(p) << \"), \";\n // }\n // cerr << endl;\n }\n\n for (int i = 0; i < m; ++i) {\n point p, q;\n\n {\n ld x1, y1, x2, y2;\n cin >> x1 >> y1 >> x2 >> y2;\n p = { x1, y1 };\n q = { x2, y2 };\n }\n\n vector<int> cp, cq;\n for (int i = 0; i < n; ++i) {\n if (cs[i].contains(p)) {\n cp.push_back(i);\n }\n if (cs[i].contains(q)) {\n cq.push_back(i);\n }\n }\n\n string ans = \"YES\";\n\n if (cp.size() or cq.size()) {\n if (cp != cq) {\n ans = \"NO\";\n }\n } else {\n for (const auto& poly : polygons) {\n if (is_in_polygon(poly, p) xor is_in_polygon(poly, q)) {\n ans = \"NO\";\n break;\n }\n }\n }\n\n cout << ans << \" \\n\"[i == m - 1];\n }\n}\n\nint main() {\n while (true) {\n int n, m;\n cin >> n >> m;\n\n if (n == 0 and m == 0) break;\n\n vector<circle> cs(n);\n for (int i = 0; i < n; ++i) {\n ld x, y, r;\n cin >> x >> y >> r;\n cs[i] = { point(x, y), r };\n }\n\n solve(n, m, cs);\n }\n}","accuracy":1,"time_ms":20,"memory_kb":3512,"score_of_the_acc":-0.0501,"final_rank":7},{"submission_id":"aoj_1198_6028340","code_snippet":"/*\n正規版\nメモ\nnorm(P) Pの絶対値の2乗 abs(P)の2乗\nabs(P) Pの絶対値\narg(P)の戻り値の範囲は[-π, π]\npolar(長さ,角度(ラジアン))でPointができる\nint(-2.2+0.5)=-1\n*/\n\n#include <bits/stdc++.h>\nusing namespace std;\ntemplate<class T,class U>constexpr bool chmin(T&a,const U b){if(a<=b)return false;a=b;return true;}\ntemplate<class T,class U>constexpr bool chmax(T&a,const U b){if(a>=b)return false;a=b;return true;}\ntemplate<class T,class U>constexpr bool bitUP(const T n,const U k){return (n>>k)&1;}\n\n////////////////////////////\n// マクロや型\n////////////////////////////\n\nusing DD=long double;\n\nconst DD EPS=1e-9;\nconst DD INF=1e50;\nconst DD PI=acosl(-1.0);\n#define EQ(a,b) (abs( (a) - (b) )<EPS) //a==b\n#define LS(a,b) ( (a)+EPS<(b) ) //a<b\n#define GR(a,b) ( (a)>(b)+EPS ) //a>b\n#define LE(a,b) ( (a)<(b)+EPS ) //a<=b\n#define GE(a,b) ( (a)>(b)-EPS ) //a>=b\n\n#define X real()\n#define Y imag()\n\n\n//点\nusing Point=complex<DD>;\nistream &operator>>(istream &is, Point &p) {\n DD x,y;\n is>>x>>y;\n p=Point(x,y);\n return is;\n}\nvoid debug(Point p,string name=\"\"){\n cout<<p.X<<\" \"<<p.Y<<\" \"<<name<<endl;\n}\n\n//点a→点bの線分\n//aとbが等しい時、色々バグるから注意!\nstruct Segment{\n Point a,b;\n Segment()=default;\n Segment(Point a,Point b) :a(a),b(b){}\n Segment(DD ax,DD ay,DD bx,DD by):a(ax,ay),b(bx,by){}\n Segment(DD r,Point a) :a(a),b(a+polar((DD)1.0,r)){}\n void debug(bool isLine=false,string name=\"\"){\n string type=\"Segment \";\n if(isLine) type=\"Line \";\n cout<<type<<a.X<<\" \"<<a.Y<<\" \"<<b.X<<\" \"<<b.Y<<\" \"<<name<<endl;\n }\n};\nusing Line=Segment;\n\n//円\nstruct Circle{\n Point p;\n DD r;\n Circle()=default;\n Circle(Point p,DD r):p(p),r(r){}\n void debug(string name=\"\"){\n cout<<p.X<<\" \"<<p.Y<<\" \"<<\"circle\"<<\"_\"<<name<<endl;\n cout<<\"Circle \"<<p.X<<\" \"<<p.Y<<\" \"<<r<<endl;\n }\n};\n\nusing Polygon=vector<Point>;\nvoid debug(Polygon pol,string name=\"\"){\n cout<<\"Polygon\"<<\" \"<<name<<endl;\n for(auto p:pol){\n cout<<p.X<<\" \"<<p.Y<<endl;\n }\n cout<<\"...\"<<endl;\n}\n\n////////////////////////////\n// 基本計算\n////////////////////////////\n\n//度→ラジアン\ninline DD torad(const DD deg){return deg*PI/180;}\n//ラジアン→度\ninline DD todeg(const DD rad){return rad*180/PI;}\n//内積 |a||b|cosθ\ninline DD dot(const Point &a,const Point &b){return (conj(a)*b).X;}\n//外積 |a||b|sinθ\ninline DD cross(const Point &a,const Point &b){return (conj(a)*b).Y;}\n//ベクトルpを反時計回りにtheta(ラジアン)回転\nPoint rotate(const Point &p,const DD theta){return p*Point(cos(theta),sin(theta));}\n\n//余弦定理 cos(角度abc(ラジアン))を返す\n//長さの対応に注意 ab:辺abの長さ\n//verify:https://codeforces.com/gym/102056/problem/F\nDD cosine_formula(const DD ab,const DD bc,const DD ca){\n return (ab*ab+bc*bc-ca*ca)/(2*ab*bc);\n}\n\ninline bool xy_sort(const Point &a,const Point &b){\n if(a.X+EPS<b.X) return true;\n if(EQ(a.X,b.X) && a.Y+EPS<b.Y) return true;\n return false;\n}\ninline bool yx_sort(const Point &a,const Point &b){\n if(a.Y+EPS<b.Y) return true;\n if(EQ(a.Y,b.Y) && a.X+EPS<b.X) return true;\n return false;\n}\nnamespace std{\n inline bool operator<(const Point &a,const Point &b)noexcept{\n return xy_sort(a,b);\n }\n}\n//DDの比較関数\n//map<DD,vector<pii>,DDcom>\nstruct DDcom{\n bool operator()(const DD a, const DD b) const noexcept {\n return a+EPS<b;\n }\n};\n\n\n////////////////////////////\n// 平行や直交\n////////////////////////////\n\nbool isOrthogonal(const Point &a,const Point &b){\n return EQ(dot(a,b),0.0);\n}\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\nbool isOrthogonal(const Segment &s,const Segment &t){\n return EQ(dot(s.a-s.b,t.a-t.b),0.0);\n}\nbool isParallel(const Point &a,const Point &b){\n return EQ(cross(a,b),0.0);\n}\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\nbool isParallel(const Segment &s,const Segment &t){\n return EQ(cross(s.a-s.b,t.a-t.b),0);\n}\n//線分a→bに対して点cがどの位置にあるか\n//反時計回り:1 時計回り:-1 直線上(a,b,c:-2 a,c,b:0 c,a,b:2)\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\n//線分a→bの端点にcがあるなら0と判定されるはず\nint ccw(const Point &a,Point b,Point c){\n if(EQ(abs(b-c),0) or EQ(abs(a-c),0)) return 0;\n b-=a;c-=a;\n if(cross(b,c)>EPS) return 1;\n if(cross(b,c)<-EPS) return -1;\n if(dot(b,c)<-EPS) return 2;\n if(LS(norm(b),norm(c))) return -2;\n return 0;\n}\n\n////////////////////////////\n// 射影と反射\n////////////////////////////\n\n//射影\n//直線lに点pから垂線を引いたときの交点\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\nPoint project(const Point &p,const Line &l){\n Point base=l.b-l.a;\n DD r=dot(p-l.a,base)/norm(base);\n return l.a+base*r;\n}\n//反射\n//直線lに対して点pと対称な点\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\nPoint reflect(const Point &p,const Line &l){\n return p+(project(p,l)-p)*(DD)2.0;\n}\n//反射\n//直線lに対して線分sと対称な線分(直線でも使える)\n//verify:https://onlinejudge.u-aizu.ac.jp/solutions/problem/1171/review/6009447/bin101/C++17\nSegment reflect(const Segment &s,const Line &l){\n return Segment(reflect(s.a,l) , reflect(s.b,l));\n}\n\n////////////////////////////\n// 点との距離\n////////////////////////////\n\n//点と直線の距離\nDD DistPL(const Point &p,const Line &l){\n return abs(cross(l.b-l.a,p-l.a))/abs(l.b-l.a);\n}\n//点と線分の距離\nDD DistPS(const Point &p,const Segment &s){\n if( dot(s.b-s.a,p-s.a)<0.0 ) return abs(p-s.a);\n if( dot(s.a-s.b,p-s.b)<0.0 ) return abs(p-s.b);\n return DistPL(p,s);\n}\n\n////////////////////////////\n// 線分と直線\n////////////////////////////\n\n//線分a-b,c-dは交差するか?\n//接する場合も交差すると判定\n//接する場合は交差しないとするなら<=を<に変換\nbool intersect(const Point &a,const Point &b,const Point &c,const Point &d){\n return(ccw(a,b,c)*ccw(a,b,d)<=0 && ccw(c,d,a)*ccw(c,d,b)<=0);\n}\n//線分s,tは交差するか？\n//接する場合も交差すると判定\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B&lang=ja\n//接する場合は交差しないとするならintersectの<=を<に変換\nbool intersect(const Segment &s,const Segment &t){\n return intersect(s.a,s.b,t.a,t.b);\n}\n// 2直線の交点\n// 線分の場合はintersectをしてから使う\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_C&lang=ja\nPoint crossPoint(const Line &s,const Line &t){\n Point base=t.b-t.a;\n DD d1=cross(base,t.a-s.a);\n DD d2=cross(base,s.b-s.a);\n if(EQ(d1,0) and EQ(d2,0)) return s.a; //同じ直線\n if(EQ(d2,0)) assert(false); //交点がない\n return s.a+d1/d2*(s.b-s.a);\n}\n//線分と線分の距離\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_D&lang=ja\nDD Dist(const Segment &s,const Segment &t){\n if(intersect(s,t)) return 0.0;\n return min(min(DistPS(t.a,s),DistPS(t.b,s)),min(DistPS(s.a,t),DistPS(s.b,t)) );\n}\nbool issame(const Line &l,const Line &m){\n if (GR(abs(cross(m.a - l.a, l.b - l.a)),0) ) return false;\n if (GR(abs(cross(m.b - l.a, l.b - l.a)),0) ) return false;\n return true;\n}\n\n////////////////////////////\n// 円\n////////////////////////////\n//直線lと円Cの交点\n//l.aにより近い方がindexが小さい\n//veirfy:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\nvector<Point> crossPointLC(const Line &l,const Circle &c){\n vector<Point> ret;\n if(GR(DistPL(c.p,l),c.r)) return ret; //交点がないとき、空ベクトルを返す\n Point pr=project(c.p,l);\n Point e=(l.b-l.a)/(abs(l.b-l.a));\n DD base=sqrt(c.r*c.r-norm(pr-c.p));\n ret.push_back(pr-e*base);\n ret.push_back(pr+e*base);\n if(EQ(DistPL(c.p,l),c.r)) ret.pop_back(); //接するとき\n return ret;\n}\n//線分sと円cの交点\n//交点がないときは空ベクトルを返す\n//線分の端が交わる場合も交点とみなす\n//s.aにより近い方がindexが小さい\nvector<Point> crossPointSC(const Segment &s,const Circle &c){\n vector<Point> ret;\n if(DistPS(c.p,s)>c.r+EPS) return ret;\n auto koho=crossPointLC(s,c);\n for(auto p:koho){\n if(ccw(s.a,s.b,p)==0 or EQ(abs(p-s.a),0) or EQ(abs(p-s.b),0)) ret.push_back(p);\n }\n return ret;\n}\n\n//円aと円bの共通接線の数\n//離れている:4 外接:3 交わる:2 内接:1 内包:0\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A\nint intersect(const Circle &a,const Circle &b){\n DD d=abs(a.p-b.p);\n if(GR(d,a.r+b.r)) return 4;\n if(EQ(d,a.r+b.r)) return 3;\n if(EQ(d,abs(a.r-b.r))) return 1;\n if(LS(d,abs(a.r-b.r))) return 0;\n return 2;\n}\n\n//円aと円bの交点\n//交点がないときは空ベクトルを返す\n//事前にintersectをしたほうがいいかも\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\nvector<Point> crossPoint(const Circle &a,const Circle &b){\n vector<Point> ret;\n if(GR(abs(a.p-b.p),a.r+b.r)) return ret;\n DD d=abs(a.p-b.p);\n DD s=acosl((a.r*a.r+d*d-b.r*b.r)/(2*a.r*d)); //0~π\n DD t=arg(b.p-a.p);\n if(EQ(a.r+b.r,d)) ret.push_back(a.p+polar(a.r,t));\n else ret.push_back(a.p+polar(a.r,t+s)),ret.push_back(a.p+polar(a.r,t-s));\n return ret;\n}\n\n//点pから円cに接線を引いたときの接点\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F&lang=ja\nvector<Point> TanLine(const Point &p,const Circle &c){\n vector<Point> ret;\n DD d=abs(p-c.p);\n if(LS(d,c.r)) return ret; //pがcの内部にある場合\n if(EQ(d,c.r)){\n ret.push_back(p);\n return ret; //円の線上にある場合\n } \n return crossPoint(c,Circle(p,sqrt(d*d-c.r*c.r)));\n}\n\n//円a,bの共通接線\n//https://www.slideshare.net/kujira16/ss-35861169\n//Line.aは円aと接線の交点\n//(接線と円bの交点)と(接線と円aの交点)が違う場合はLine.bは(接線と円bの交点)\n//一致する場合は円aの中心からLine.aに向かうベクトルを反時計回りに90度回転したものを\n//Line.aに足したもの\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_G\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2201\nvector<Line> TanLine(const Circle &a,const Circle &b){\n DD d=abs(a.p-b.p);\n vector<Line> ret;\n //外接線\n if(intersect(a,b)>=2){\n if(EQ(a.r,b.r)){\n Point up=polar(a.r,arg(b.p-a.p)+PI/2);\n ret.emplace_back(a.p+up,b.p+up);\n ret.emplace_back(a.p-up,b.p-up);\n }else{\n Point q=(a.p*b.r-b.p*a.r)/(b.r-a.r);\n auto as=TanLine(q,a);\n auto bs=TanLine(q,b);\n assert(as.size()==2 and bs.size()==2);\n for(int i=0;i<2;i++){\n ret.emplace_back(as[i],bs[i]);\n }\n }\n }else if(intersect(a,b)==1){ //内接する場合\n Point dir;\n if(a.r>b.r) dir=polar(a.r,arg(b.p-a.p));\n else dir=polar(a.r,arg(a.p-b.p));\n ret.emplace_back(a.p+dir,a.p+dir+rotate(dir,PI/2));\n }\n //内接線\n if(GR(abs(a.p-b.p),a.r+b.r)){ //円が離れている場合\n Point q=a.p+(b.p-a.p)*a.r/(a.r+b.r);\n auto as=TanLine(q,a);\n auto bs=TanLine(q,b);\n assert(as.size()==2 and bs.size()==2);\n for(int i=0;i<2;i++){\n ret.emplace_back(as[i],bs[i]);\n }\n }else if(EQ(d,a.r+b.r)){ //円が接している場合\n Point dir=polar(a.r,arg(b.p-a.p));\n ret.emplace_back(a.p+dir,a.p+dir+rotate(dir,PI/2));\n }\n return ret;\n}\n//２つの円の共通部分の面積\n//参考: https://tjkendev.github.io/procon-library/python/geometry/circles_intersection_area.html\n//verify: https://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=6005736#1\nDD Area(const Circle &c1,const Circle &c2){\n DD cd=abs(c1.p-c2.p);\n if(LE(c1.r+c2.r,cd)) return 0; //円が離れている\n\n if(LE(cd,abs(c1.r-c2.r))) //片方の円が他方を包んでいる\n return min(c1.r,c2.r)*min(c1.r,c2.r)*PI;\n\n DD theta1=acosl(cosine_formula(c1.r,cd,c2.r));\n DD theta2=acosl(cosine_formula(c2.r,cd,c1.r));\n\n return c1.r*c1.r*theta1+c2.r*c2.r*theta2-c1.r*cd*sin(theta1);\n}\n\n\n////////////////////////////\n// 三角形\n////////////////////////////\n\n//ヘロンの公式 三角形の面積を返す\n//三角形が成立するか(平行ではないか)を忘れずに\nDD Heron(const DD ad,const DD bd,const DD cd){\n DD s=(ad+bd+cd)/2;\n return sqrt(s*(s-ad)*(s-bd)*(s-cd));\n}\n//三角形の外接円\n//isParallel()を使って三角形が成立するか(平行ではないか)を忘れずに\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_C\nCircle CircumscribedCircle(const Point &a,const Point &b,const Point &c){\n Point bc=(b+c)/(DD)2.0;\n Line aa(bc,bc+rotate(c-b,PI/2));\n Point ab=(a+b)/(DD)2.0;\n Line cc(ab,ab+rotate(b-a,PI/2));\n Point p=crossPoint(aa,cc);\n return Circle(p,abs(a-p));\n}\n//三角形の内接円\n//isParallel()を使って三角形が成立するか(平行ではないか)を忘れずに\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_B\nCircle InCircle(const Point &a,const Point &b,const Point &c){\n Line aa(a,a+polar((DD)1.0,(arg(b-a)+arg(c-a))/(DD)2.0));\n Line bb(b,b+polar((DD)1.0,(arg(a-b)+arg(c-b))/(DD)2.0));\n Point p=crossPoint(aa,bb);\n return Circle(p,DistPL(p,Line(a,b)));\n}\n\n////////////////////////////\n// 多角形\n////////////////////////////\n\n//点pが多角形gに対してどの位置にあるか\n//中:2 辺上:1 外:0\n//凸多角形である必要ない\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_C\nint contains(const Point &p,const vector<Point> &g){\n int n=(int)g.size();\n int x=false;\n for(int i=0;i<n;i++){\n Point a=g[i]-p,b=g[(i+1)%n]-p;\n if(EQ(cross(a,b),0) && dot(a,b)<EPS) return 1;\n if(a.Y>b.Y) swap(a,b);\n if(a.Y<EPS && EPS<b.Y && cross(a,b)>EPS) x=!x;\n }\n return (x?2:0);\n}\n//凸性判定\n//多角形gは凸か？\n//gは反時計回りでも時計回りでもいい\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_B\nbool isConvex(const vector<Point> &g){\n int n=(int)g.size();\n if(n<=3) return true;\n int flag=0;\n int t;\n for(int i=0;i<n;i++){\n Point a(g[(i+1)%n]-g[i]),b(g[(i+2)%n]-g[i]);\n if(cross(a,b)>EPS) t=1;\n else if(cross(a,b)<-EPS) t=-1;\n else continue;\n if(flag==-t) return false;\n flag=t;\n }\n return true;\n}\n\n//凸包 アンドリューのアルゴリズム\n//O(NlogN)\n//反時計回りの多角形を返す\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_A\nvector<Point> ConvexHull(vector<Point> s,const bool on_edge){\n int j;\n if(on_edge) j=-1;\n else j=1;\n int sz=(int)s.size();\n if(sz<3) return s;\n sort(s.begin(),s.end(),yx_sort);\n\n int n=0;\n vector<Point> res(2*sz);\n for(int i=0;i<sz;i++){\n while(n>=2 && cross(res[n-1]-res[n-2],s[i]-res[n-2])<EPS*j){\n n--;\n }\n res[n]=s[i];\n n++;\n }\n int t=n+1;\n for(int i=sz-2;i>=0;i--){\n while(n>=t && cross(res[n-1]-res[n-2],s[i]-res[n-2])<EPS*j){\n n--;\n }\n res[n]=s[i];\n n++;\n }\n res.resize(n-1);\n return res;\n}\n\n//多角形g(凸でなくてもいい)の符号付き面積\n//反時計回りの多角形なら正の値を返す 時計回りなら負\n//O(N)\n//https://imagingsolution.net/math/calc_n_point_area/\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_A\nDD Area(const vector<Point> &g){\n DD ret=0.0;\n int n=(int)g.size();\n for(int i=0;i<n;i++){\n ret+=cross(g[i],g[(i+1)%n]);\n }\n return ret/2.0;\n}\n\n//凸多角形gを直線lで切断\n//直線の左側(向きを考慮)にできる凸多角形を返す\n//多角形gが反時計回りならば、反時計回りで返す(時計回りなら時計回り)\n//直線上の頂点を含む線分の交点は含めてない\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_C\nvector<Point> ConvexCut(const vector<Point> &g,const Line &l){\n vector<Point> ret;\n int gz=(int)g.size();\n for(int i=0;i<gz;i++){\n Point now=g[i],next=g[(i+1)%gz];\n if(ccw(l.a,l.b,now)!=-1) ret.push_back(now);\n if(EQ(DistPL(now,l),0) or EQ(DistPL(next,l),0)) continue;\n if(ccw(l.a,l.b,now)*ccw(l.a,l.b,next)<0){\n ret.push_back(crossPoint(Line(now,next),l));\n }\n }\n return ret;\n}\n//部品\ninline DD calc(const Point &a,const Point &b,const DD &r,const bool triangle){\n if(triangle) return cross(a,b);\n else return r*r*arg(b/a);\n}\n//部品\nDD calcArea(const DD &r,const Point &a,const Point &b){\n if(EQ(abs(a-b),0)) return 0;\n bool ina=(abs(a)<r+EPS);\n bool inb=(abs(b)<r+EPS);\n if(ina && inb) return cross(a,b);\n auto cr=crossPointSC(Segment(a,b),Circle(Point(0,0),r));\n if(cr.empty()) return calc(a,b,r,false);\n auto s=cr[0],t=cr.back();\n return calc(s,t,r,true)+calc(a,s,r,ina)+calc(t,b,r,inb);\n}\n//円と多角形の共通部分の面積\n//多角形が反時計回りならば正の値を返す\n//凸多角形でなくても大丈夫\n//http://drken1215.hatenablog.com/entry/2020/02/02/091000\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_H&lang=ja\nDD Area(const Circle &c,const vector<Point> &g){\n DD ret=0.0;\n int gz=g.size();\n if(gz<=2) return ret;\n for(int i=0;i<gz;i++){\n Point a=g[i]-c.p,b=g[(i+1)%gz]-c.p;\n ret+=calcArea(c.r,g[i]-c.p,g[(i+1)%gz]-c.p);\n }\n return ret/2.0;\n}\n\n//点と多角形の距離\n//点が多角形の中にあるなら0\nDD Dist(const Point &a,const vector<Point> &b){\n\tif(b.size()==1) return abs(a-b[0]);\n\tif(contains(a,b)>=1) return 0.0L;\n\tDD ret=INF;\n\tfor(int i=0;i<b.size();i++){\n\t\tchmin(ret,DistPS(a,Segment(b[i],b[(i+1)%b.size()])));\n\t}\n\treturn ret;\n}\n\n//多角形と多角形の距離\n//どちらかが内側に入っていたら0\n//全ての線分の組み合わせの距離を求めて、その最小が答え\n//O(size(a)*size(b))\n//sizeが1の時は点との距離になる\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2827\nDD Dist(const vector<Point> &a,const vector<Point> &b){\n\tDD ret=INF;\n\tif(a.size()==1) return Dist(a[0],b);\n\tif(b.size()==1) return Dist(b[0],a);\n\n\tif(contains(a[0],b)>=1) return 0.0L;\n\tif(contains(b[0],a)>=1) return 0.0L;\n\n\tfor(int i=0;i<a.size();i++){\n\t\tfor(int j=0;j<b.size();j++){\n\t\t\tSegment sa(a[i],a[(i+1)%a.size()]);\n\t\t\tSegment sb(b[j],b[(j+1)%b.size()]);\n\t\t\tchmin(ret,Dist(sa,sb));\n\t\t}\n\t}\n\treturn ret;\n}\n\n////////////////////////////\n// 最近(遠)点間距離\n////////////////////////////\n//部品\nDD RecClosetPair(const vector<Point>::iterator it,const int n){\n if(n<=1) return INF;\n int m=n/2;\n DD x=it[m].X;\n DD d=min(RecClosetPair(it,m),RecClosetPair(it+m,n-m));\n inplace_merge(it,it+m,it+n,yx_sort);\n vector<Point> v;\n for(int i=0;i<n;i++){\n if(abs(it[i].X-x)>=d) continue;\n for(int j=0;j<v.size();j++){\n DD dy=it[i].Y-v[(int)v.size()-1-j].Y;\n if(dy>=d) break;\n DD dx=it[i].X-v[(int)v.size()-1-j].X;\n d=min(d,sqrt(dx*dx+dy*dy));\n }\n v.push_back(it[i]);\n }\n return d;\n}\n//最近点対の距離\n//点が1つのときINFを返す\n//O(NlogN)\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_5_A\nDD ClosetPair(vector<Point> g){\n sort(g.begin(),g.end(),xy_sort);\n return RecClosetPair(g.begin(),g.size());\n}\n\n//最遠頂点間\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_B\nDD Diameter(vector<Point> g){\n g=ConvexHull(g,1);\n int gz=g.size();\n int m=0,M=0;\n for(int i=1;i<gz;i++){\n if(g[i].Y<g[m].Y) m=i;\n if(g[i].Y>g[M].Y) M=i;\n }\n DD ret=0;\n int sm=m,sM=M;\n while(m!=sM || M!=sm){\n ret=max(ret,norm(g[m]-g[M]));\n if(cross(g[(m+1)%gz]-g[m],g[(M+1)%gz]-g[M])<0) m=(m+1)%gz;\n else M=(M+1)%gz;\n }\n return sqrt(ret);\n}\n//動的凸包\n//辺上にある点は含めない\n//verify:https://atcoder.jp/contests/geocon2013/tasks/geocon2013_c\nstruct DynamicConvex{\n\tset<Point> up,down;\n\tDynamicConvex(){}\n \n\tbool isContain(set<Point> &pol,Point p){\n\t\tif(pol.size()==0) return false;\n\t\tif(pol.size()==1){\n\t\t\tPoint q=*begin(pol);\n\t\t\treturn EQ(q.X,p.X) and GE(q.Y,p.Y);\n\t\t}\n\t\tassert(pol.size()>=2);\n auto left=begin(pol);\n auto right=(--end(pol));\n if(LS(p.X,left->X) or GR(p.X,right->X)) return false;\n \n \n auto q1=pol.upper_bound(Point(p.X,INF));\n if(q1==end(pol)){\n return GE(right->Y,p.Y);\n }\n auto q2=q1--; //q1が範囲外になるのは最初に弾いてる\n return GE(cross(p-*q1,*q2-*q1),0.0);\n\t}\n bool isContain(Point p){\n if(not isContain(up,p)) return false;\n if(not isContain(down,Point(p.X,-p.Y))) return false;\n return true;\n }\n \n\tvoid add(set<Point> &pol,Point p){\n\t\tif(pol.size()==0){\n\t\t\tpol.insert(p);\n\t\t\treturn;\n\t\t}\n\t\tif(pol.size()==1){\n Point q=*begin(pol);\n\t\t\tif(EQ(q.X,p.X)){\n pol.clear();\n pol.insert(max(p,q));\n\t\t\t}else{\n\t\t\t\tpol.insert(p);\n\t\t\t}\n return;\n\t\t}\n assert(pol.size()>=2);\n if(isContain(pol,p)) return;\n //left\n auto q1=pol.upper_bound(Point(p.X,INF));\n if(q1!=begin(pol)){\n q1--;\n while(pol.size()>=1 and q1!=begin(pol)){\n auto q2=q1--;\n if(GR(cross(*q2-p,*q1-p),0)) break;\n pol.erase(q2);\n }\n }\n //right\n q1=pol.lower_bound(Point(p.X,-INF));\n if(q1!=end(pol)){\n while(pol.size()>1 and q1!=--end(pol)){\n auto q2=q1++;\n if(GR(cross(*q1-p,*q2-p),0.0)) break;\n pol.erase(q2);\n }\n }\n pol.insert(p);\n\t}\n \n\tvoid add(Point p){\n\t\tadd(up,p);\n\t\tadd(down,Point(p.X,-p.Y)); //upと同じように処理をしたいから\n\t}\n};\n\n//垂直二等分線\n//p-↑-q こんなかんじ\n//voronoiで使う\nLine bisector(const Point &p, const Point &q) {\n Point c=(p+q)/DD(2.0);\n Point v=rotate(q-p,PI/2);\n v/=abs(v);\n return Line(c-v,c+v);\n}\n\n//ボロノイ図\n//pol:全体 ps:点の集合 id:中心となる点の添字 pp:中心となる点\n//計算量: pol.size()*ps.size()\n//verify: https://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=6005648#1\nvector<Point> voronoi(Polygon pol,const vector<Point> &ps,int id=-1,const Point pp=Point()){\n Point p;\n if(id!=-1) p=ps[id];\n else p=pp;\n for(size_t i=0;i<ps.size();i++){\n if(i==id) continue;\n Line l=bisector(p,ps[i]);\n pol=ConvexCut(pol,l);\n }\n return pol;\n}\n\nvector<Polygon> Pol;\nvector<int> vp;\nvector<Circle> C;\nusing Graph=vector<vector<int>>;\nGraph g;\nvector<bool> used;\n\nvoid dfs(int idx,int par){\n if(used[idx]) return;\n used[idx]=true;\n vp.push_back(idx);\n\n for(int to:g[idx]){\n if(to==par) continue;\n int start=-1;\n for(int i=0;i<vp.size();i++){\n if(vp[i]==to) start=i;\n }\n if(start==-1){\n dfs(to,idx);\n }else{\n Polygon pol;\n for(int i=start;i<vp.size();i++){\n pol.push_back(C[vp[i]].p);\n }\n Pol.push_back(pol);\n }\n }\n vp.pop_back();\n}\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout << fixed << setprecision(20);\n\nwhile(true){\n int N,M;\n cin>>N>>M;\n if(N==0 and M==0) return 0;\n C.clear();\n C.resize(N);\n for(int i=0;i<N;i++) cin>>C[i].p>>C[i].r/*,C[i].debug({char('a'+i)})*/;\n\n g.clear();\n g.resize(N);\n for(int i=0;i<N;i++){\n for(int j=i+1;j<N;j++){\n if(intersect(C[i],C[j])==2){\n g[i].push_back(j);\n g[j].push_back(i);\n }\n }\n }\n used.clear();\n used.resize(N);\n Pol.clear();\n\n dfs(0,-1);\n for(int i=0;i<N;i++){\n dfs(i,-1);\n }\n vector<bool> ans;\n for(int i=0;i<M;i++){\n Point p,q; cin>>p>>q;\n /*string s;\n s+='a'+i;\n debug(p,s); debug(q,s);*/\n vector<bool> cp(N),cq(N);\n bool ok=false;\n for(int j=0;j<N;j++){\n if(LE(abs(p-C[j].p),C[j].r)){\n ok=true;\n cp[j]=true;\n }\n if(LE(abs(q-C[j].p),C[j].r)){\n cq[j]=true;\n }\n }\n if(cp==cq and ok){\n ans.push_back(true);\n }else if(cp!=cq){\n ans.push_back(false);\n }else{\n cp.clear(); cq.clear();\n cp.resize(Pol.size()); cq.resize(Pol.size());\n for(int j=0;j<Pol.size();j++){\n cp[j]=contains(p,Pol[j]);\n cq[j]=contains(q,Pol[j]);\n }\n if(cp==cq) ans.push_back(true);\n else ans.push_back(false);\n }\n }\n for(int i=0;i<ans.size();i++){\n if(i) cout<<\" \";\n if(ans[i]) cout<<\"YES\";\n else cout<<\"NO\";\n }\n cout<<endl;\n}\n}","accuracy":1,"time_ms":10,"memory_kb":3664,"score_of_the_acc":-0.0715,"final_rank":10},{"submission_id":"aoj_1198_5981741","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nnamespace geometry{\n constexpr double eps = 1e-9;\n bool eq(double a, double b){ return fabs(a - b) < eps; }\n template<typename T> bool eq(T a, T b){ return a == b; }\n bool is_zero(double a){ return fabs(a) < eps; }\n template<typename T> bool is_zero(T a){ return a == 0; }\n bool le(double a, double b){ return a <= b + eps; }\n template<typename T> bool le(T a, T b){ return a <= b; }\n bool lt(double a, double b){ return a < b - eps; }\n template<typename T> bool lt(T a, T b){ return a < b; }\n};\n\n\ntemplate<class T> struct Point{\n T x,y;\n Point(){}\n Point(T x, T y) : x(x), y(y) {}\n Point(const pair<T,T> &p) : x(p.first), y(p.second) {}\n\n Point operator*(const T b) const { return Point(x * b, y * b); }\n Point operator/(const T b) const { return Point(x / b, y / b); }\n Point operator+(const Point &b) const { return Point(x + b.x, y + b.y); }\n Point operator-(const Point &b) const { return Point(x - b.x, y - b.y); }\n Point operator*(const Point &b) const { return Point(x*b.x - y*b.y, x*b.y + y*b.x); }\n Point operator/(const Point &b) const { return Point(x*b.x + y*b.y, y*b.x - x*b.y)/(b.x*b.x + b.y*b.y); }\n\n Point &operator*=(const T b){ return (*this) = (*this) * b; }\n Point &operator/=(const T b){ return (*this) = (*this) / b; }\n Point &operator+=(const Point &b){ return (*this) = (*this) + b; }\n Point &operator-=(const Point &b){ return (*this) = (*this) - b; }\n Point &operator*=(const Point &b){ return (*this) = (*this) * b; }\n Point &operator/=(const Point &b){ return (*this) = (*this) / b; }\n \n bool operator==(const Point &b) const {\n return geometry::eq(x, b.x) && geometry::eq(y, b.y);\n }\n bool operator<(const Point &b) const { \n if(geometry::eq(x, b.x)) return y < b.y;\n return x < b.x;\n }\n T Norm() const { return x * x + y * y; }\n double Abs() const { return hypot<double>(x, y); }\n double dist(const Point &b) const { return hypot<double>(x - b.x, y - b.y); }\n double arg() const { return atan2<double>(y, x); }\n \n Point ArgVec() const {\n if((*this) == Point(0, 0)) return (*this);\n if(geometry::is_zero(x)) return Point(0, -1);\n return (*this) / gcd(x, y) * (x < 0 ? -1 : 1);\n }\n\n int ort() const {\n if(geometry::is_zero(x) && geometry::is_zero(y)) return 0;\n if(geometry::is_zero(y)) return x > 0 ? 1 : 3;\n if(geometry::is_zero(x)) return y > 0 ? 2 : 4;\n if (y > 0) return x > 0 ? 1 : 2;\n else return x > 0 ? 4 : 3;\n }\n Point rotate90() const { return Point(-y, x);}\n Point rotate180() const { return Point(-x, -y);}\n Point rotate270() const { return Point(y, -x);}\n\n Point flip_x(T p = 0) const { return Point(p*2 - x, y);}\n Point flip_y(T p = 0) const { return Point(x, p*2 - y);}\n\n Point rotate(double theta) const {\n return Point(cos(theta)*x - sin(theta)*y, sin(theta)*x + cos(theta)*y);\n }\n\n Point flip(double theta) const {\n return (*this).rotate(-theta).flip_y().rotate(theta);\n }\n\n friend ostream &operator<<(ostream &os, const Point &p) {\n return os << p.x << \" \" << p.y;\n }\n friend istream &operator>>(istream &is, Point &p) {\n T a, b; is >> a >> b;\n p = Point<T>(a, b);\n return (is);\n }\n};\n\ntemplate<typename T> Point<T> Polar(const T& rho, const T& theta = 0){\n return Point<T>(rho * cos(theta), rho * sin(theta));\n}\n\n\ntemplate<typename T> using Polygon = vector<Point<T>>;\n\ntemplate<class T> T Cross(const Point<T> &a, const Point<T> &b) { return a.x * b.y - a.y * b.x; }\n\ntemplate<class T> T Dot(const Point<T> &a, const Point<T> &b) { return a.x * b.x + a.y * b.y; }\n\ntemplate<class T> bool Intersect(const Point<T> &a, const Point<T> &b, const Point<T> &c, const Point<T> &d) {\n return (iSP(a, b, c)*iSP(a, b, d) <= 0) && (iSP(c, d, a)*iSP(c, d, b) <= 0);\n}\n\ntemplate<class T> int iSP(const Point<T> &a, const Point<T> &b, const Point<T> &c){\n T fl = Cross(b-a, c-a);\n if(geometry::lt(T(0), fl)) return 1; // CCW\n if(geometry::lt(fl, T(0))) return -1; // CW\n if(geometry::lt(T(0), Dot(b-a, c-b))) return 2; //abc\n if(geometry::lt(T(0), Dot(a-b, c-a))) return -2; //bac\n return 0; // acb\n}\n\ntemplate<class T> int angletype(const Point<T> &a, const Point<T> &b, const Point<T> &c){\n T v = Dot(a-b, c-a);\n if(geometry::is_zero(v)) return 0; // right angle\n if(v > 0) return 1; // acute angle\n return -1; // obtuse angle\n}\n\ntemplate<typename T>\nbool cmp_y(const Point<T>& p1, const Point<T> &p2){\n if(p1.y == p2.y) return p1.x < p2.x;\n return p1.y < p2.y;\n}\n\ntemplate<typename T>\nbool cmp_arg(const Point<T>& p1, const Point<T> &p2){\n if(p1.ort() != p2.ort()) return p1.ort() < p2.ort();\n return iSP(Point<T>(0,0), p1, p2) > 0;\n}\n\ntemplate<typename T>\nvoid ArgSort(Polygon<T> &ps){\n sort(begin(ps), end(ps), cmp_arg<T>);\n}\n\ntemplate<class T> struct Line{\n Point<T> a, b;\n Line() {}\n Line(const Point<T> &a, const Point<T> &b): a(a), b(b) {}\n Line(T A, T B, T C){ // Ax + By = C\n if(A == 0){ a = Point<T>(0, C/B); b = Point<T>(1, C/B); }\n else if(B == 0){ a = Point<T>(C/A, 0); b = Point<T>(C/A, 1); }\n else{ a = Point<T>(0, C/B); b = Point<T>(C/A, 0); }\n }\n //Line(const Segment<T> &s): a(s.a), b(s.b) {}\n Point<T> projection(const Point<T> &p) const {\n return a + (b - a)*Dot(p - a, b - a)/(b - a).Norm();\n }\n Point<T> reflection(const Point<T> &p) const {\n return p + (projection(p) - p)*2;\n }\n int angletype(const Line &l) const {\n if(geometry::is_zero(Cross(b-a, l.b-l.a))) return 1;\n if(geometry::is_zero(Dot(a-b, l.b-l.a))) return -1;\n return 0;\n }\n bool Intersect(const Line &l) const {\n return angletype(l) != 1;\n }\n Point<T> Cross_Point(const Line &l) const {\n if(geometry::is_zero(Cross(b-a,l.b-l.a))) return l.a;\n return (b - a)*Cross(l.a - a, l.b - l.a)/Cross(b - a,l.b - l.a) + a;\n }\n double dist(const Point<T> &p) const {\n return abs(Cross(p - a, b - a)/(b - a).Abs());\n }\n double dist(const Line &l) const {\n if(Intersect(l)) return 0;\n return dist(l.a);\n }\n};\n\ntemplate<class T> struct Segment{\n Point<T> a, b;\n Segment() {}\n Segment(const Point<T> &a, const Point<T> &b): a(a), b(b) {}\n\n double length() const { return a.dist(b); }\n bool Intersect(const Segment &s) const {\n return iSP(a, b, s.a)*iSP(a, b, s.b) <= 0 && iSP(s.a, s.b, a)*iSP(s.a, s.b, b) <= 0;\n }\n Point<T> Center() const { return (a + b) / 2; }\n Line<T> PerpBisector() const {\n Point<T> center = this->Center();\n return Line<T>((a - center).rotate90() + center, center);\n }\n int angletype(const Segment &s) const {\n if(geometry::is_zero(Cross(b-a, s.b-s.a))) return 1;\n if(geometry::is_zero(Dot(a-b, s.b-s.a))) return -1;\n return 0;\n }\n Point<T> Cross_Point(const Segment &s) const {\n if(geometry::is_zero(Cross(b-a,s.b-s.a))) return s.a;\n return (b - a)*Cross(s.a - a, s.b - s.a)/Cross(b - a, s.b - s.a) + a;\n }\n double dist(const Point<T> &p) const {\n if(Dot(b-a, p-a) < 0) return p.dist(a);\n if(Dot(a-b, p-b) < 0) return p.dist(b);\n return abs(Cross(p-a, b-a)/ (b-a).Abs());\n }\n double dist(const Segment &s) const {\n if(Intersect(s)) return 0;\n return min({dist(s.a), dist(s.b), s.dist(a), s.dist(b)});\n }\n};\n\ntemplate<typename T>\nstruct Triangle{\n Point<T> a, b, c;\n Triangle() {}\n Triangle(const Point<T> &a, const Point<T> &b, const Point<T> &c): a(a), b(b), c(c){}\n\n double angle_a() const {\n double ab = a.dist(b), bc = b.dist(c), ca = c.dist(a);\n return acos((ca*ca + ab*ab - bc*bc)/(2*ca*ab));\n }\n double angle_b() const {\n double ab = a.dist(b), bc = b.dist(c), ca = c.dist(a);\n return acos((ab*ab + bc*bc - ca*ca)/(2*ab*bc));\n }\n double angle_c() const {\n double ab = a.dist(b), bc = b.dist(c), ca = c.dist(a);\n return acos((bc*bc + ca*ca - ab*ab)/(2*bc*ca));\n }\n Point<T> divpoint(double p, double q, double r) const {\n return (a*p + b*q + c*r)/(p + q + r);\n }\n\n Point<T> centerofgravity() const {\n return (a + b + c)/3;\n }\n Point<T> circumcenter() const {\n Segment<T> s1(a, b), s2(a, c);\n return s1.PerpBisector().Cross_Point(s2.PerpBisector());\n }\n Point<T> orthocenter() const {\n return centerofgravity()*3 - circumcenter()*2;\n }\n Point<T> innercenter() const {\n return divpoint(b.dist(c), c.dist(a), a.dist(b));\n }\n Point<T> excenterA() const {\n return divpoint(-b.dist(c), c.dist(a), a.dist(b));\n }\n Point<T> excenterB() const {\n return divpoint(b.dist(c), -c.dist(a), a.dist(b));\n }\n Point<T> excenterC() const {\n return divpoint(b.dist(c), c.dist(a), -a.dist(b));\n }\n};\n\ntemplate<class T> struct Circle{\n Point<T> o;\n T r;\n Circle() {}\n Circle(const Point<T> &o, const T &r): o(o), r(r) {}\n Circle(const Point<T> &a, const Point<T> &b): o((a + b)/2), r(a.dist(b)/2) {}\n Circle(const Point<T> &a, const Point<T> &b, const Point<T> &c)\n : o(Triangle(a,b,c).circumcenter()), r(o.dist(a)) {}\n\n int Intersect(const Circle&c) const {\n if(r < c.r) return c.Intersect(*this);\n auto od = (o - c.o).Norm();\n auto ra = (r + c.r)*(r + c.r), rs = (r - c.r)*(r - c.r);\n if(geometry::lt(ra, od)) return 4;\n if(geometry::eq(ra, od)) return 3;\n if(geometry::lt(rs, od)) return 2;\n if(geometry::eq(rs, od)) return 1;\n return 0;\n }\n\n int Intersect(const Line<T> &l) const {\n double d = l.dist(o);\n if(geometry::lt<double>(d, r)) return 2;\n return geometry::eq(d, r);\n }\n\n int Contains(const Point<T> &p) const {\n auto od = (o - p).Norm();\n if(geometry::eq(od, r*r)) return 1; // on\n return (od > r*r) ? 2 : 0; // out/in\n }\n\n Polygon<T> Cross_Points(const Line<T> &l) const {\n int k = this->Intersect(l);\n if(k == 0) return {};\n Point<T> p = l.projection(o);\n if(k == 1) return {p};\n Point<T> d = (l.b - l.a)/l.a.dist(l.b);\n double base = sqrt(r*r - (p - o).Norm());\n return {p + d*base, p - d*base};\n }\n\n Polygon<T> Cross_Points(const Circle &c) const {\n int k = this->Intersect(c);\n if(k == 0 || k == 4) return {};\n double t = (c.o - o).arg();\n if(k == 1 || k == 3) return {o + Polar<T>(r, t)};\n double d = o.dist(c.o), a = acos((r*r + d*d - c.r*c.r) / (r * d * 2));\n return {o + Polar<T>(r, t + a), o + Polar<T>(r, t - a)};\n }\n\n friend ostream &operator<<(ostream &os, const Circle &c) {\n return os << c.o << \" \" << c.r;\n }\n friend istream &operator>>(istream &is, Circle &c) {\n Point<T> p; T l; is >> p >> l;\n c = Circle<T>(p, l);\n return (is);\n }\n};\n\n\ntemplate<typename T>\nint Contains(const Polygon<T> &ps, const Point<T>& p){\n bool in = false;\n int n = ps.size();\n for(int i = 0; i < n; i++){\n Point<T> a = ps[i] - p, b = ps[(i+1)%n] - p;\n if(a.y > b.y) swap(a, b);\n if(a.y <= 0 && 0 < b.y && Cross(a,b) < 0) in = !in;\n if(geometry::is_zero(Cross(a, b)) && geometry::le(Dot(a, b), T(0))) return 1; // on\n }\n return in? 2 : 0; // out/in\n}\n\ntemplate<typename T = int>\nstruct Edge{\n int src, to; T cost; int idx;\n Edge(){}\n Edge(int src, int to, T cost = -1, int idx = -1): src(src), to(to), cost(cost), idx(idx) {}\n operator int() const { return to; }\n};\ntemplate<typename T>\nusing Edges = vector<Edge<T>>;\n\ntemplate<typename T = bool>\nstruct Graph {\n vector<vector<Edge<T>>> g;\n size_t es;\n Graph() {};\n Graph(size_t n): g(n), es(0) {}\n size_t size() const { return g.size(); }\n int deg(int v) const { return int(g[v].size()); }\n\n vector<Edge<T>> &operator[](int k) { return g.at(k); }\n const vector<Edge<T>> &operator[](int k) const { return g.at(k); }\n vector<Edge<T>> &at(int k) { return g.at(k); }\n const vector<Edge<T>> &at(int k) const { return g.at(k); }\n\n void add_edge(int src, int to, T cost = 1){\n g[src].emplace_back(src, to, cost, es);\n g[to].emplace_back(to, src, cost, es++);\n }\n void add_directed_edge(int src, int to, T cost = 1){\n g[src].emplace_back(src, to, cost, es++);\n }\n\n void read(int m, int base = 1, bool weighted = false, bool directed = false, const T &id = 1){\n for (int i = 0; i < m; i++){\n int u, v; cin >> u >> v; u -= base; v -= base;\n T c = id;\n if(weighted) cin >> c;\n if(directed) add_directed_edge(u, v, c);\n else add_edge(u, v, c);\n }\n }\n};\n\ntemplate<typename T>\nstruct CycleDetection{\n Graph<T> g;\n bool directed;\n vector<int> used;\n vector<Edge<T>> pre, cycle;\n CycleDetection(const Graph<T> &g, bool directed = true)\n : g(g), directed(directed), used(g.size()), pre(g.size()) {}\n\n vector<Edge<T>> find(){\n for(int i = 0; i < (int)g.size(); i++){\n if(used[i]==0 && dfs(i)){\n reverse(cycle.begin(), cycle.end());\n return cycle;\n }\n }\n return {};\n }\n\nprivate:\n bool dfs(int v, int q = -1){\n used[v] = 1;\n for(auto&&e : g[v]){\n if(e == q && !directed) continue;\n if(used[e] == 0){\n pre[e] = e;\n if(dfs(e, v)) return true;\n }else if(used[e] == 1){\n int p = v;\n while(p != e){\n cycle.emplace_back(pre[p]);\n p = pre[p].src;\n }\n cycle.emplace_back(e);\n return true;\n }\n }\n used[v] = 2;\n return false;\n }\n};\n\ntemplate<typename T> T Area(const Polygon<T> &ps, bool harf = true){\n if((int)ps.size() < 3) return 0;\n T res = Cross(ps.back(), ps.front());\n for(int i = 0; i < (int)ps.size()-1; i++){\n res += Cross(ps[i], ps[i+1]);\n }\n if(harf) res /= 2;\n return res;\n}\n\n\nstruct Solver{\n Solver(int n, int m): n(n), m(m) {}\n using ll = long long;\n\n int n, m;\n vector<Circle<ll>> cs;\n void solve(){\n cs.resize(n);\n for(auto&c : cs) cin >> c;\n\n Edges<int> es;\n int t = 0;\n for(int j = 0; j < n; ++j){\n for(int i = 0; i < j; ++i){\n if(cs[i].Intersect(cs[j]) < 4){\n es.emplace_back(i, j, 0, t++);\n }\n }\n }\n\n string ans;\n while(m--) ans += (check(es) ? \"YES \"s : \"NO \"s);\n ans.pop_back();\n cout << ans << \"\\n\";\n }\n\n void ci(int i){ //cout << i << \":\"; }\n }\n\n bool check(Edges<int> es){\n Point<ll> p, q; cin >> p >> q;\n bool fl = false;\n for(auto&c : cs){\n if((c.Contains(p) < 2) != (c.Contains(q) < 2)){\n ci(0);\n return false;\n }\n fl |= c.Contains(p) < 2;\n }\n if(fl){\n ci(1);\n return true;\n }\n\n while(true){\n Graph<int> g(n);\n for(auto&e : es) g.add_edge(e.src, e.to);\n\n CycleDetection cd(g, false);\n auto cy = cd.find();\n if(cy.empty()) break;\n\n int l = int(cy.size());\n Polygon<ll> ps(l);\n for(int i = 0; i < l; ++i) ps[i] = cs[cy[i].src].o;\n\n if(Area(ps, false) < 0) reverse(begin(ps), end(ps));\n\n if(Contains(ps, p) != Contains(ps, q)){\n ci(2);\n return false;\n }\n\n l = int(es.size());\n auto e = cy[0];\n fl = false;\n for(int i = 0; i < l; ++i){\n if((e.src == es[i].src && e.to == es[i].to) || (e.src == es[i].to && e.to == es[i].src)){\n es.erase(begin(es) + i);\n fl = true;\n break;\n }\n }\n assert(fl);\n }\n ci(3);\n return true;\n }\n};\n\nint main() {\n while(true){\n int n, m; cin >> n >> m;\n if(n == 0) return 0;\n Solver solver(n, m);\n solver.solve();\n }\n}","accuracy":1,"time_ms":30,"memory_kb":3400,"score_of_the_acc":-0.0361,"final_rank":2},{"submission_id":"aoj_1198_5949708","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;\nusing Real = double;\nusing Point = complex< Real >;\nusing Polygon = vector< Point >;\nconst Real EPS = 1e-6, PI = acos(-1);\nconstexpr int COUNTER_CLOCKWISE = +1;\nconstexpr int CLOCKWISE = -1;\nconstexpr int ONLINE_BACK = +2; // c-a-b\nconstexpr int ONLINE_FRONT = -2; // a-b-c\nconstexpr int ON_SEGMENT = 0; // a-c-b\n\nPoint operator*(const Point &p, const Real &d) {\n return Point(real(p) * d, imag(p) * d);\n}\n\nPoint operator/(const Point &p, const Real &d) {\n return Point(real(p) / d, imag(p) / d);\n}\n\nistream &operator>>(istream &is, Point &p) {\n Real a, b; is >> a >> b;\n p = Point(a, b);\n return is;\n}\n\nostream &operator<<(ostream &os, const Point &p) {\n return os << fixed << setprecision(10) << real(p) << \" \" << imag(p);\n}\n\nnamespace std {\n bool operator<(const Point &a, const Point &b) {\n return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag();\n }\n}\n\n// 符号\ninline int sign(const Real &r) {\n return r <= -EPS ? -1 : r >= EPS ? 1 : 0;\n}\n\n// a = b ? \ninline bool equals(const Real &a, const Real &b) {\n return sign(a - b) == 0;\n}\n\n\n// 単位ベクトル\nPoint unitVec(const Point &a){ return a / abs(a); }\n\n// 法線ベクトル 半時計周り\nPoint normVec(const Point &a){ return a * Point(0, 1); }\n//Point normVec(const Point &a){ return a * Point(0,-1); }\n\n// 内積\nReal dot(const Point &a, const Point &b) {\n return (a.real() * b.real() + a.imag() * b.imag());\n}\n\n// 外積\nReal cross(const Point &a, const Point &b) {\n return (a.real() * b.imag() - a.imag() * b.real());\n}\n\nPoint rotate(const Point &p, const Real &theta) {\n return Point(cos(theta) * p.real() - sin(theta) * p.imag(),\n sin(theta) * p.real() + cos(theta) * p.imag());\n}\n\nReal Radian_To_Degree(const Real &radian){ return radian * 180.0 / PI; }\nReal Degree_To_Radian(const Real °ree){ return degree * PI / 180.0; }\n\nstruct Line {\n Point a, b;\n Line() = default;\n Line(Point a, Point b) : a(a), b(b) {}\n\n // Ax + By = C\n Line(Real A, Real B, Real C) {\n if(equals(A, 0)) {\n a = Point(0, C / B), b = Point(1, C / B);\n }else if(equals(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 friend ostream &operator<<(ostream &os, Line &p) {\n return os << p.a << \" \" << p.b;\n }\n\n friend istream &operator>>(istream &is, Line &a) {\n return is >> a.a >> a.b;\n }\n};\n\nstruct Segment : Line {\n Segment() = default;\n Segment(Point a, Point b) : Line(a, b) {}\n};\n\nstruct Circle {\n Point p;\n Real r;\n Circle() = default;\n Circle(Point p, Real r) : p(p), r(r) {}\n\n friend ostream &operator<<(ostream &os, Circle &c) {\n return os << c.p << \" \" << c.r;\n }\n\n friend istream &operator>>(istream &is, Circle &c) {\n return is >> c.p >> c.r;\n }\n};\n\n// 直線lに点pから引いた垂線の足を求める\nPoint projection(const Line &l, const Point &p) {\n Real t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n return l.a + (l.a - l.b) * t;\n}\n\nPoint projection(const Segment &l, const Point &p) {\n Real 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// 直線lに関して点pと対称な点を求める\nPoint reflection(const Line &l, const Point &p) {\n return p + (projection(l, p) - p) * 2.0;\n}\n\n// 点の回転方向\n// 点aを基準に点b,cの位置関係\nint ccw(const Point &a, Point b, Point c) {\n b = b - a, c = c - a;\n if(sign(cross(b, c)) == +1) return COUNTER_CLOCKWISE; // 反時計回り\n if(sign(cross(b, c)) == -1) return CLOCKWISE; // 時計回り\n if(sign(dot(b, c)) == -1) return ONLINE_BACK; // c - a - b\n if(norm(b) < norm(c)) return ONLINE_FRONT; // a - b - c\n return ON_SEGMENT; // a - c - b\n}\n\n// 2直線の直交判定\nbool is_orthogonal(const Line &a, const Line &b) {\n return equals(dot(a.b - a.a, b.b - b.a), 0);\n}\n\n// 2直線の平行判定\nbool is_parallel(const Line &a, const Line &b) {\n return equals(cross(a.b - a.a, b.b - b.a), 0);\n}\n\n// 線分の交差判定\nbool is_intersect_ss(const Segment &s, const Segment &t) {\n return ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\n ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\n}\n\n// 直線の交差判定\nbool is_intersect_ll(const Line &l, const Line &m) {\n Real A = cross(l.b - l.a, m.b - m.a);\n Real B = cross(l.b - l.a, l.b - m.a);\n if(equals(abs(A), 0) && equals(abs(B), 0)) return true;\n return !is_parallel(l, m);\n}\n\n// 線分に点が乗っているか\nbool is_intersect_sp(const Segment &s, const Point &p) {\n return ccw(s.a, s.b, p) == ON_SEGMENT;\n}\n\n// 点と点の距離\nReal distance_pp(const Point &p1, const Point &p2) {\n return sqrt(pow(real(p1)-real(p2), 2) + pow(imag(p1)-imag(p2), 2));\n}\n\n// 点と直線の距離\nReal distance_lp(const Line &l, const Point &p) {\n return abs(p - projection(l, p));\n}\n\n// 直線と直線の距離\nReal distance_ll(const Line &l, const Line &m) {\n return is_intersect_ll(l, m) ? 0 : distance_lp(l, m.a);\n}\n\n// 点と線分の距離\nReal distance_sp(const Segment &s, const Point &p) {\n Point r = projection(s, p);\n if(is_intersect_sp(s, r)) return abs(r - p);\n return min(abs(s.a - p), abs(s.b - p));\n}\n\n// 線分と線分の距離\nReal distance_ss(const Segment &a, const Segment &b) {\n if(is_intersect_ss(a, b)) return 0;\n return min({distance_sp(a, b.a), distance_sp(a, b.b), distance_sp(b, a.a), distance_sp(b, a.b)});\n}\n\n// 交点\nPoint cross_point_ll(const Line &l, const Line &m) {\n Real A = cross(l.b - l.a, m.b - m.a);\n Real B = cross(l.b - l.a, l.b - m.a);\n if(equals(abs(A), 0) && equals(abs(B), 0)) return m.a;\n return m.a + (m.b - m.a) * B / A;\n}\n\n// 円と円の位置関係\nint intersect(Circle c1, Circle c2) {\n Real d = abs(c1.p - c2.p);\n return abs(c1.r - c2.r) - EPS < d && d < c1.r + c2.r + EPS;\n}\n\nReal area(const Polygon &p){\n Real A = 0;\n for(int i = 0; i < p.size(); i++){\n A += cross(p[i], p[(i + 1) % p.size()]);\n }\n return A * 0.5;\n}\n\nbool is_convex(const Polygon &p){\n for(int i = 0; i < p.size(); i++){\n if(ccw(p[(i + p.size() - 1) % p.size()], p[i], p[(i + 1) % p.size()]) == -1) return false;\n }\n return true;\n}\n\nenum { OUT, ON, IN };\nint contains(const Polygon &Q, const Point &p){\n bool in = false;\n for(int i = 0; i < Q.size(); i++){\n Point a = Q[i] - p, b = Q[(i + 1) % Q.size()] - p;\n if(a.imag() > b.imag()) swap(a, b);\n if(a.imag() <= 0 && 0 < b.imag() && cross(a, b) < 0) in = !in;\n if(cross(a, b) == 0 && dot(a, b) <= 0) return ON;\n }\n return in ? IN : OUT;\n}\n\nPolygon convex_hull(Polygon &p, bool strict = true){\n int n = (int)p.size(), k = 0;\n if(n <= 2) return p;\n sort(p.begin(), p.end());\n Polygon ch(2 * n);\n for(int i = 0; i < n; ch[k++] = p[i++]){\n while(k >= 2 && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < 0) --k;\n }\n for(int i = n - 2, t = k + 1; i >= 0; ch[k++] = p[i--]){\n while(k >= t && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < 0) --k;\n }\n ch.resize(k - 1);\n return ch;\n}\n\nReal convex_diameter(const Polygon &p){\n int n = (int)p.size();\n int is = 0, js = 0;\n for(int i = 1; i < n; i++){\n if(p[i].imag() > p[is].imag()) is = i;\n if(p[i].imag() < p[js].imag()) js = i;\n }\n Real maxdis = norm(p[is] - p[js]);\n int maxi, maxj, i, j;\n i = maxi = is;\n j = maxj = js;\n do {\n if(cross(p[(i + 1) % n] - p[i], p[(j + 1) % n] - p[j]) >= 0){\n j = (j + 1) % n;\n }else{\n i = (i + 1) % n;\n }\n\n if(norm(p[i] - p[j]) > maxdis){\n maxdis = norm(p[i] - p[j]);\n maxi = i;\n maxj = j;\n }\n\n }while(i != is || j != js);\n return sqrt(maxdis);\n}\n\nPolygon convex_cut(const Polygon &U, Line l){\n Polygon ret;\n for(int i = 0; i < U.size(); i++){\n Point now = U[i], nxt = U[(i + 1) % U.size()];\n if(ccw(l.a, l.b, now) != -1) ret.push_back(now);\n if(ccw(l.a, l.b, now) * ccw(l.a, l.b, nxt) < 0){\n ret.push_back(cross_point_ll(Line(now, nxt), l));\n }\n }\n return ret;\n}\n\nReal ClosetPair(Polygon& ps){\n if(ps.size() <= 1) throw (0);\n sort(begin(ps), end(ps));\n\n auto compare_y = [&](const Point &a, const Point &b) {\n return a.imag() < b.imag();\n };\n Polygon beet(ps.size());\n const double INF = 1e18;\n\n function< double(int, int) > rec = [&](int left, int right) {\n if(right - left <= 1) return INF;\n int mid = (left + right) >> 1;\n auto x = ps[mid].real();\n auto ret = min(rec(left, mid), rec(mid, right));\n inplace_merge(begin(ps) + left, begin(ps) + mid, begin(ps) + right, compare_y);\n int ptr = 0;\n for(int i = left; i < right; i++) {\n if(fabs((ps[i].real()) - x) >= ret) continue;\n for(int j = 0; j < ptr; j++) {\n auto luz = ps[i] - beet[ptr - j - 1];\n if(luz.imag() >= ret) break;\n ret = min(ret, abs(luz));\n }\n beet[ptr++] = ps[i];\n }\n return ret;\n };\n return rec(0, (int) ps.size());\n}\n\npair< Point, Point > cross_point_cc(const Circle &c1, const Circle &c2) {\n Real d = abs(c1.p - c2.p);\n Real a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));\n Real t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\n Point p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\n Point p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\n return {p1, p2};\n}\n\nconst int BOTTOM = 0;\nconst int LEFT = 1;\nconst int RIGHT = 2;\nconst int TOP = 3;\n\nclass endPoint {\n public:\n Point p;\n int seg; // id of Point\n int st; // kind of Point\n endPoint(){}\n endPoint(Point inp, int inseg, int inst):p(inp),seg(inseg),st(inst){}\n bool operator<(const endPoint &ep)const {\n if(p.imag() == ep.p.imag()) return st < ep.st;\n else return p.imag() < ep.p.imag();\n }\n};\n\nendPoint EP[220000];\nint Manhattan_Intersections(vector< Segment > s){\n int n = s.size();\n double hoge;\n\n for(int i = 0, k = 0; i < n; i++){\n if(s[i].a.imag() == s[i].b.imag()){\n if(s[i].a.real() > s[i].b.real()){\n hoge = s[i].a.real();\n s[i].a.real(s[i].b.real());\n s[i].b.real(hoge);\n }\n }else if(s[i].a.imag() > s[i].b.imag()){\n hoge = s[i].a.imag();\n s[i].a.imag(s[i].b.imag());\n s[i].b.imag(hoge);\n }\n\n if(s[i].a.imag() == s[i].b.imag()){\n EP[k++] = endPoint(s[i].a, i, LEFT);\n EP[k++] = endPoint(s[i].b, i, RIGHT);\n }else{\n EP[k++] = endPoint(s[i].a, i, BOTTOM);\n EP[k++] = endPoint(s[i].b, i, TOP);\n }\n }\n\n sort(EP, EP + 2 * n);\n set<int> BT;\n BT.insert(1000000001);\n int cnt = 0;\n for(int i = 0; i < 2 * n; i++){\n if(EP[i].st == TOP) BT.erase(EP[i].p.real());\n else if(EP[i].st == BOTTOM) BT.insert(EP[i].p.real());\n else if(EP[i].st == LEFT){\n set<int>::iterator b = lower_bound(BT.begin(), BT.end(), s[EP[i].seg].a.real());\n set<int>::iterator e = upper_bound(BT.begin(), BT.end(), s[EP[i].seg].b.real());\n cnt += distance(b, e);\n }\n }\n\n return cnt;\n}\n\n// 内接円\nCircle Inscribed_Circle(const Point& a, const Point& b, const Point& c){\n double A = abs(b - c), B = abs(c - a), C = abs(a - b);\n Point x = Point((a * A + b * B + c * C) / (A + B + C));\n double r = distance_sp(Segment(a,b),x);\n return Circle(x, r);\n}\n\n// 外接円\nCircle Circumscribed_Circle(const Point& a, const Point& b, const Point& c){\n Point m1((a+b)/2.0), m2((b+c)/2.0);\n Point v((b-a).imag(), (a-b).real()), w((b-c).imag(), (c-b).real());\n Line s(m1, Point(m1+v)), t(m2, Point(m2+w));\n const Point x = cross_point_ll(s, t);\n return Circle(x, abs(a-x));\n}\n\npair< Point, Point > cross_point_cl(const Circle &c, const Line &l) {\n Point pr = projection(l, c.p);\n if(equals(abs(pr - c.p), c.r)) return {pr, pr};\n Point e = (l.b - l.a) / abs(l.b - l.a);\n auto k = sqrt(norm(c.r) - norm(pr - c.p));\n return {pr - e * k, pr + e * k};\n}\n\n// 点pを通る円の接線\npair<Point,Point> tangent_cp(const Circle &c, const Point &p) {\n return cross_point_cc(c, Circle(p, sqrt(norm(c.p - p) - c.r * c.r)));\n}\n\n// 二つの円の共通接線\nvector< Line > tangent_cc(Circle c1, Circle c2){\n vector< Line > ret;\n if(c1.r < c2.r) swap(c1,c2);\n double g = norm(c1.p-c2.p);\n if(equals(g,0.0)) return ret;\n Point u = (c2.p-c1.p)/sqrt(g);\n Point v = rotate(u, PI * 0.5);\n for(int s:{-1,1}){\n double h = (c1.r+ s*c2.r)/sqrt(g);\n if(equals(1- h*h, 0)){\n ret.emplace_back(c1.p+u*c1.r, c1.p+(u+v)*c1.r);\n }else if(1-h*h > 0){\n Point uu = u*h, vv = v*sqrt(1-h*h);\n ret.emplace_back(c1.p+(uu+vv)*c1.r, c2.p-(uu+vv)*c2.r*s);\n ret.emplace_back(c1.p+(uu-vv)*c1.r, c2.p-(uu-vv)*c2.r*s);\n }\n }\n return ret;\n}\n\nReal area_poly_c(const Polygon &p, const Circle &c) {\n if(p.size() < 3) return 0.0;\n function< Real(Circle, Point, Point) > cross_area = [&](const Circle &c, const Point &a, const Point &b) {\n Point va = c.p - a, vb = c.p - b;\n Real f = cross(va, vb), ret = 0.0;\n if(equals(f, 0.0)) return ret;\n if(max(abs(va), abs(vb)) < c.r + EPS) return f;\n if(distance_sp(Segment(a, b), c.p) > c.r - EPS) return c.r * c.r * arg(vb * conj(va));\n auto u = cross_point_cl(c, Segment(a, b));\n vector< Point > tot{a, u.first, u.second, b};\n for(int i = 0; i + 1 < tot.size(); i++) {\n ret += cross_area(c, tot[i], tot[i + 1]);\n }\n return ret;\n };\n Real A = 0;\n for(int i = 0; i < p.size(); i++) {\n A += cross_area(c, p[i], p[(i + 1) % p.size()]);\n }\n return A;\n}\n\nReal area_cc(const Circle &c1, const Circle &c2) {\n Real d = abs(c1.p - c2.p);\n if(c1.r + c2.r <= d + EPS) return 0.0;\n if(d <= fabs(c1.r - c2.r) + EPS) {\n Real r = min(c1.r, c2.r);\n return r * r * PI;\n }\n Real rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\n Real theta = acos(rc / c1.r);\n Real phi = acos((d - rc) / c2.r);\n return (c1.r * c1.r*theta + c2.r*c2.r*phi - d*c1.r*sin(theta));\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n\n while(true) {\n int n,m; cin >> n >> m; if(n == 0 && m == 0) break;\n vector< Circle > Cs(n);\n rep(i,n) cin >> Cs[i];\n\n vector<string> ans;\n auto push = [&](string s){ ans.push_back(s); };\n\n rep(_,m) {\n Point p,q; cin >> p >> q;\n vector<int> id_p, id_q;\n rep(i,n) {\n if(abs(Cs[i].p - p) <= Cs[i].r) id_p.push_back(i);\n if(abs(Cs[i].p - q) <= Cs[i].r) id_q.push_back(i);\n }\n sort(id_p.begin(), id_p.end());\n sort(id_q.begin(), id_q.end());\n if(id_p.size() > 0 || id_q.size() > 0) {\n push(id_p == id_q ? \"YES\" : \"NO\"); continue;\n }\n vector<vector<int>> G(n);\n rep(i,n)rep(j,n)if(i < j) {\n if(intersect(Cs[i], Cs[j])) {\n G[i].push_back(j);\n G[j].push_back(i);\n }\n }\n\n bool ok = true;\n while(true) {\n vector<int> r(n, -1), f(n, -1), d(n, 0);\n auto search = [&](void) {\n function<void(int,int)> dfs = [&](int x, int v) -> void {\n r[v] = x;\n for(int to : G[v]) if(r[to] == -1) {\n d[to] = d[v] + 1;\n f[to] = v;\n dfs(x, to);\n } \n };\n\n rep(i,n) if(f[i] == -1) dfs(i, i);\n rep(i,n) {\n for(int to : G[i]) {\n if(r[i] == r[to] && d[to] - d[i] > 1) {\n vector<int> res;\n for(int v = to; v != i; v = f[v]) res.push_back(v);\n res.push_back(i);\n return res;\n }\n }\n }\n return vector<int>();\n };\n\n auto c = search();\n if(c.size() == 0) break;\n vector< Point > poly(c.size());\n rep(i,c.size()) poly[i] = Cs[c[i]].p;\n if(contains(poly, p) != contains(poly, q)) ok = false;\n\n rep(i,G[c[0]].size()) {\n if(G[c[0]][i] == c[1]) {\n G[c[0]].erase(G[c[0]].begin() + i); break;\n }\n }\n rep(i,G[c[1]].size()) {\n if(G[c[1]][i] == c[0]) {\n G[c[1]].erase(G[c[1]].begin() + i); break;\n }\n }\n }\n push(ok ? \"YES\" : \"NO\");\n }\n rep(i,m) { if(i) cout << \" \"; cout << ans[i]; } cout << endl;\n }\n}","accuracy":1,"time_ms":30,"memory_kb":8652,"score_of_the_acc":-1.0138,"final_rank":18},{"submission_id":"aoj_1198_5903181","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n//geometry library by maine\n\n//basic\nusing Real = double;\nusing Point = complex<Real>;\n#define x real()\n#define y imag()\nconst Real EPS = 1e-8, PI = acos(-1), INF = 1e10;\n\nistream& operator>>(istream& is, Point& p) {\n Real a, b;\n is >> a >> b;\n p = Point(a, b);\n return is;\n}\nostream& operator<<(ostream& os, Point p) {\n return os << fixed << setprecision(10) << p.x << \" \" << p.y;\n}\n\nPoint operator*(const Point& p, const Real& d) { return Point(p.x * d, p.y * d); }\n\nbool eq(const Real& r, const Real& s) { return abs(r - s) < EPS; }\nbool eq(const Point& p, const Point& q) { return abs(p - q) < EPS; }\n\nnamespace std {\nbool operator<(const Point& a, const Point& b) {\n return !eq(a.x, b.x) ? a.x < b.x : a.y < b.y;\n}\n} // namespace std\n\nReal get_angle(const Point& a, const Point& b, const Point& c) {\n return arg((c - a) / (b - a));\n}\n\ninline int inc(int i, int N) {\n return (i == N - 1 ? 0 : i + 1);\n}\ninline int dec(int i, int N) {\n return (i == 0 ? N - 1 : i - 1);\n}\n\n//unit vector\nPoint e(const Point& p) { return p / abs(p); }\n\n//angle transformation\nReal radian_to_degree(Real r) { return r * 180.0 / PI; }\nReal degree_to_radian(Real d) { return d * PI / 180.0; }\n\n//basic functions\nReal dot(const Point& p, const Point& q) { return p.x * q.x + p.y * q.y; }\nReal cross(const Point& p, const Point& q) { return p.x * q.y - p.y * q.x; }\nPoint rotate(const Real& theta, const Point& p) {\n return {cos(theta) * p.x - sin(theta) * p.y, sin(theta) * p.x + cos(theta) * p.y};\n}\nPoint rotate90(const Point& p) {\n return {-p.y, p.x};\n}\n\n//structs : Line, Segment, Circle\nstruct Line {\n Point a, b;\n Line() = default;\n Line(Point a, Point b) : a(a), b(b) {}\n Point d() const { return e(b - a); } //direction vector\n Point n() const {\n Point dd = d();\n return {dd.y, -dd.x};\n } //normal vector\n};\nstruct Segment : Line {\n Segment() = default;\n Segment(Point a, Point b) : Line(a, b) {}\n};\nstruct Circle {\n Point p;\n Real r;\n Circle() = default;\n Circle(Point p, Real r) : p(p), r(r){};\n};\nusing Points = vector<Point>;\nusing Polygon = vector<Point>;\nusing Polygons = vector<Polygon>;\nusing Lines = vector<Line>;\nusing Segments = vector<Segment>;\nusing Circles = vector<Circle>;\n\n//happy functions\n//https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\nint ccw(const Point& a, const Point& bb, const Point& cc) {\n Point b = bb - a, c = cc - a;\n if (cross(b, c) > EPS)\n return 1; //COUNTER_CLOCKWISE\n if (cross(b, c) < -EPS)\n return -1; //CLOCKWISE\n if (dot(b, c) < 0)\n return 2; //ONLINE_BACK c-a-b\n if (norm(b) < norm(c))\n return -2; //ONLINE_FRONT a-b-c\n return 0; //ON_SEGMENT a-c-b\n}\n\nbool parallel(const Line& l, const Line& m) { return eq(cross(l.d(), m.d()), 0.0); }\nbool orthogonal(const Line& l, const Line& m) { return eq(dot(l.d(), m.d()), 0.0); }\nPoint projection(const Line& l, const Point& p) { return l.a + (l.a - l.b) * (dot(p - l.a, l.a - l.b) / norm(l.a - l.b)); }\nPoint reflection(const Line& l, const Point& p) { return p + (projection(l, p) - p) * 2.0; }\n\n//intersect\nbool intersect(const Line& l, const Point& p) { return abs(ccw(l.a, l.b, p)) != 1; }\nbool intersect(const Line& l, const Line& m) { return !parallel(l, m) || (parallel(l, m) && intersect(l, m.a)); }\nbool intersect(const Segment& s, const Point& p) { return ccw(s.a, s.b, p) == 0; }\nbool intersect(const Line& l, const Segment& s) { return cross(l.d(), s.a - l.a) * cross(l.d(), s.b - l.a) < EPS; }\nbool intersect(const Segment& s, const Segment& t) {\n return ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 && ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\n}\nbool intersect_onsegment(const Segment& s, const Point& p) { return intersect(s, p) && !eq(s.a, p) && !eq(s.b, p); }\n\n//distance\nReal distance(const Point& p, const Point& q) { return abs(p - q); }\nReal distance(const Line& l, const Point& p) { return distance(p, projection(l, p)); }\nReal distance(const Line& l, const Line& m) { return intersect(l, m) ? 0 : distance(l, m.a); }\nReal distance(const Segment& s, const Point& p) {\n Point q = projection(s, p);\n return intersect(s, q) ? distance(p, q) : min(distance(s.a, p), distance(s.b, p));\n}\nReal distance(const Segment& s, const Segment& t) { return intersect(s, t) ? 0 : min({distance(s, t.a), distance(s, t.b), distance(t, s.a), distance(t, s.b)}); }\nReal distance(const Line& l, const Segment& s) { return intersect(l, s) ? 0 : min(distance(l, s.a), distance(l, s.b)); }\n\n//intersect circle\nbool intersect(const Circle& c, const Point& p) { return eq(distance(c.p, p), c.r); }\nbool intersect(const Circle& c, const Line& l) { return distance(l, c.p) <= c.r + EPS; }\nint intersect(const Circle& c, const Segment& s) {\n if (!intersect(c, Line(s)))\n return 0;\n Real da = distance(c.p, s.a), db = distance(c.p, s.b);\n if (da < c.r + EPS && db < c.r + EPS)\n return 0;\n if (da > db)\n swap(da, db);\n if (da < c.r - EPS && db > c.r + EPS)\n return 1;\n if (intersect(s, projection(s, c.p)))\n return 2;\n return 0;\n}\nint intersect(Circle c1, Circle c2) {\n if (c1.r < c2.r)\n swap(c1, c2);\n Real d = distance(c1.p, c2.p);\n if (c1.r + c2.r < d)\n return 4;\n if (eq(c1.r + c2.r, d))\n return 3;\n if (c1.r - c2.r < d)\n return 2;\n if (eq(c1.r - c2.r, d))\n return 1;\n return 0;\n}\n\n//crosspoint\nPoint crosspoint(const Line& l, const Line& m) {\n Real A = cross(l.b - l.a, m.b - m.a);\n Real B = cross(l.b - l.a, l.b - m.a);\n if (eq(abs(A), 0.0) && eq(abs(B), 0.0))\n return m.a;\n return m.a + (m.b - m.a) * B / A;\n}\nPoint crosspoint(const Segment& s, const Segment& t) { return crosspoint(Line(s), Line(t)); }\npair<Point, Point> crosspoint(const Circle& c, const Line& l) {\n Point p = projection(l, c.p);\n if (eq(distance(l, c.p), c.r))\n return {p, p};\n Real len = sqrt(c.r * c.r - norm(p - c.p));\n return {p - len * l.d(), p + len * l.d()};\n}\npair<Point, Point> crosspoint(const Circle& c, const Segment& s) {\n Line l(s);\n if (intersect(c, s) == 2)\n return crosspoint(c, l);\n auto ret = crosspoint(c, l);\n if (dot(s.a - ret.first, s.b - ret.first) < 0)\n ret.second = ret.first;\n else\n ret.first = ret.second;\n return ret;\n}\npair<Point, Point> crosspoint(const Circle& c1, const Circle& c2) {\n Real d = distance(c1.p, c2.p);\n Real a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));\n Real t = atan2(c2.p.y - c1.p.y, c2.p.x - c1.p.x);\n Point p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\n Point p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\n return {p1, p2};\n}\n\n//tangent\npair<Point, Point> tangent(const Circle& c, const Point& p) {\n return crosspoint(c, Circle(p, sqrt(norm(c.p - p) - c.r * c.r)));\n}\nLines tangent(Circle c1, Circle c2) {\n Lines ret;\n if (c1.r < c2.r)\n swap(c1, c2);\n if (eq(c1.p, c2.p))\n return ret;\n Real g = norm(c1.p - c2.p);\n Point u = (c2.p - c1.p) / sqrt(g);\n Point v = rotate(PI / 2, u);\n for (int s : {-1, 1}) {\n Real h = (c1.r + s * c2.r) / sqrt(g);\n if (eq(1 - h * h, 0)) {\n ret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\n } else if (1 - h * h > 0) {\n Point uu = u * h, vv = v * sqrt(1 - h * h);\n ret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\n ret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\n }\n }\n return ret;\n}\n\n//convex\n//https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/3/CGL_3_B\nbool is_convex(const Polygon& P) {\n int N = (int)P.size();\n for (int i = 0; i < N; i++) {\n if (ccw(P[i], P[(i + 1) % N], P[(i + 2) % N]) == -1)\n return false;\n }\n return true;\n}\n//https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/4/CGL_4_A\nPolygon convex_hull(Points P) {\n int N = (int)P.size(), k = 0;\n if (N <= 2)\n return P;\n sort(begin(P), end(P));\n Points ret(2 * N);\n for (int i = 0; i < N; ret[k++] = P[i++]) {\n while (k >= 2 && cross(ret[k - 1] - ret[k - 2], P[i] - ret[k - 1]) < EPS)\n --k;\n }\n for (int i = N - 2, t = k + 1; i >= 0; ret[k++] = P[i--]) {\n while (k >= t && cross(ret[k - 1] - ret[k - 2], P[i] - ret[k - 1]) < EPS)\n --k;\n }\n ret.resize(k - 1);\n return ret;\n}\n//https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/4/CGL_4_B\nReal convex_diameter(const Polygon& P) {\n int N = (int)P.size();\n int is = 0, js = 0;\n for (int i = 1; i < N; i++) {\n if (P[i].y < P[is].y)\n is = i;\n if (P[i].y > P[js].y)\n js = i;\n }\n Real maxdist = norm(P[is] - P[js]);\n int maxi, maxj, i, j;\n maxi = i = is;\n maxj = j = js;\n do {\n if (cross(P[inc(i, N)] - P[i], P[inc(j, N)] - P[j]) >= 0)\n j = inc(j, N);\n else\n i = inc(i, N);\n if (norm(P[i] - P[j]) > maxdist) {\n maxdist = norm(P[i] - P[j]);\n maxi = i;\n maxj = j;\n }\n } while (i != is || j != js);\n maxi = maxi;\n maxj = maxj;\n return sqrt(maxdist);\n}\n//https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/4/CGL_4_C\nPolygon convex_cut(const Polygon& P, const Line& l) {\n Polygon ret;\n int N = (int)P.size();\n for (int i = 0; i < N; i++) {\n Point now = P[i], nxt = P[(inc(i, N))];\n if (ccw(l.a, l.b, now) != -1)\n ret.emplace_back(now);\n if (ccw(l.a, l.b, now) * ccw(l.a, l.b, nxt) == -1)\n ret.emplace_back(crosspoint(Line(now, nxt), l));\n }\n return ret;\n}\n\n//other\nenum\n{\n OUT,\n ON,\n IN\n};\n\n//https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/3/CGL_3_C\nint contains(const Polygon& Q, const Point& p) {\n bool in = false;\n int N = (int)Q.size();\n for (int i = 0; i < N; i++) {\n Point a = Q[i] - p, b = Q[(i + 1) % N] - p;\n if (a.y > b.y)\n swap(a, b);\n if (a.y <= 0 && 0 < b.y && cross(a, b) < 0)\n in = !in;\n if (cross(a, b) == 0 && dot(a, b) <= 0)\n return ON;\n }\n return in ? IN : OUT;\n}\n\n//https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/3/CGL_3_A\nReal area(const Polygon& P) {\n Real A = 0;\n for (int i = 0; i < (int)P.size(); i++) {\n A += cross(P[i], P[(i + 1) % P.size()]);\n }\n return A * 0.5;\n}\n\n//https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/7/CGL_7_H\nReal cross_area(const Circle& c, const Point& a, const Point& b) {\n Point va = c.p - a, vb = c.p - b;\n Real f = cross(va, vb), ret = 0.0;\n if (eq(f, 0.0))\n return ret;\n if (max(abs(va), abs(vb)) < c.r + EPS)\n return f;\n if (distance(Segment(a, b), c.p) > c.r - EPS)\n return c.r * c.r * arg(vb * conj(va));\n auto u = crosspoint(c, Segment(a, b));\n vector<Point> V{a, u.first, u.second, b};\n for (int i = 0; i < (int)V.size() - 1; i++) {\n ret += cross_area(c, V[i], V[i + 1]);\n }\n return ret;\n}\nReal area(const Polygon& p, const Circle& c) {\n int N = (int)p.size();\n if (N < 3)\n return 0.0;\n Real ret = 0;\n for (int i = 0; i < N; i++) {\n ret += cross_area(c, p[i], p[inc(i, N)]);\n }\n return ret / 2.0;\n}\n\n//https://onlinejudge.u-aizu.ac.jp/problems/CGL_5_A\nReal closest_pair(Points& P, int left, int right) {\n if (right - left <= 1)\n return 1e18;\n int mid = (left + right) / 2;\n Real xx = P[mid].x;\n Real dist = min(closest_pair(P, left, mid), closest_pair(P, mid, right));\n inplace_merge(P.begin() + left, P.begin() + mid, P.begin() + right, [&](const Point& a, const Point& b) { return a.y < b.y; });\n Points memo;\n memo.reserve(right - left);\n for (int i = left; i < right; i++) {\n if (abs(P[i].x - xx) >= dist)\n continue;\n for (int j = (int)memo.size() - 1; j >= 0; j--) {\n if (P[i].y - memo[j].y >= dist)\n break;\n dist = min(dist, distance(P[i], memo[j]));\n }\n memo.emplace_back(P[i]);\n }\n return dist;\n}\nReal closest_pair(Points P) {\n sort(begin(P), end(P));\n return closest_pair(P, 0, (int)P.size());\n}\n\n//https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/7/CGL_7_B\nCircle incircle(Polygon P) {\n assert((int)P.size() == 3);\n Real l0 = distance(P[1], P[2]), l1 = distance(P[0], P[2]), l2 = distance(P[0], P[1]);\n Circle c;\n c.p = crosspoint(Line(P[0], (P[1] * l1 + P[2] * l2) / (l1 + l2)), Line(P[1], (P[0] * l0 + P[2] * l2) / (l0 + l2)));\n c.r = distance(Line(P[0], P[1]), c.p);\n return c;\n}\n\n//https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/7/CGL_7_C\nCircle circumcircle(Polygon P) {\n assert((int)P.size() == 3);\n Circle c;\n c.p = crosspoint(Line((P[0] + P[1]) / 2.0, (P[0] + P[1]) / 2.0 + rotate90(P[0] - P[1])),\n Line((P[0] + P[2]) / 2.0, (P[0] + P[2]) / 2.0 + rotate90(P[0] - P[2])));\n c.r = distance(c.p, P[0]);\n return c;\n}\n\n#undef x\n#undef y\n\nstruct UF {\n vector<int> data;\n UF(int n) : data(n, -1) {}\n int root(int k) {\n if (data[k] < 0)\n return k;\n return data[k] = root(data[k]);\n }\n bool unite(int x, int y) {\n x = root(x), y = root(y);\n if (x == y)\n return false;\n if (data[x] > data[y])\n swap(x, y);\n data[x] += data[y];\n data[y] = x;\n return true;\n }\n bool same(int x, int y) {\n return root(x) == root(y);\n }\n int size(int k) { return -data[root(k)]; }\n};\n\n\nint main() {\n int N, M;\n while (cin >> N >> M, N) {\n Circles C(N);\n for (auto&& c : C) {\n cin >> c.p >> c.r;\n }\n vector<vector<double>> ang(N);\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < i; j++) {\n auto &c1 = C[i], &c2 = C[j];\n if (intersect(c1, c2) == 2) {\n auto [p1, p2] = crosspoint(c1, c2);\n ang[i].emplace_back(arg(p1 - c1.p));\n ang[i].emplace_back(arg(p2 - c1.p));\n ang[j].emplace_back(arg(p1 - c2.p));\n ang[j].emplace_back(arg(p2 - c2.p));\n }\n }\n }\n int n = 0;\n vector<int> Vidx;\n for (auto&& V : ang) {\n for (auto&& x : V) {\n if (eq(-PI, x))\n x = PI;\n }\n if (V.size() == 0)\n V.emplace_back(0);\n sort(begin(V), end(V));\n Vidx.emplace_back(n);\n n += (int)V.size();\n }\n UF uf(n * 2);\n\n auto f = [&](int i, int j, bool outer) {\n j += (int)ang[i].size();\n if (j >= (int)ang[i].size())\n j %= (int)ang[i].size();\n return (Vidx[i] + j) * 2 + (int)outer;\n };\n\n vector<bool> canconnectin(n * 2, true);\n vector<bool> canconnectout(n * 2, true);\n\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (i == j)\n continue;\n auto c1 = C[i], c2 = C[j];\n if (intersect(c1, c2) == 2) {\n auto p = crosspoint(c1, c2).first;\n double a1 = arg(p - c1.p), a2 = arg(p - c2.p);\n if (eq(a1, -PI))\n a1 = PI;\n if (eq(a2, -PI))\n a2 = PI;\n int idx1 = lower_bound(cbegin(ang[i]), cend(ang[i]), a1 - EPS) - cbegin(ang[i]);\n int idx2 = lower_bound(cbegin(ang[j]), cend(ang[j]), a2 - EPS) - cbegin(ang[j]);\n uf.unite(f(i, idx1, true), f(j, idx2, false));\n uf.unite(f(i, idx1 + 1, true), f(j, idx2, true));\n uf.unite(f(i, idx1 + 1, false), f(j, idx2 + 1, true));\n uf.unite(f(i, idx1, false), f(j, idx2 + 1, false));\n canconnectin[f(i, idx1, false)] = false;\n canconnectout[f(i, idx1, true)] = false;\n canconnectin[f(j, idx2 + 1, false)] = false;\n canconnectin[f(j, idx2 + 1, true)] = false;\n }\n }\n }\n\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (i == j)\n continue;\n auto c1 = C[i], c2 = C[j];\n if (intersect(c1, c2) == 0 && c1.r > c2.r) {\n for (int idx1 = 0; idx1 < (int)ang[i].size(); idx1++) {\n for (int idx2 = 0; idx2 < (int)ang[j].size(); idx2++) {\n int f1 = f(i, idx1, false);\n int f2 = f(j, idx2, true);\n if (canconnectin[f1] && canconnectin[f2])\n uf.unite(f1, f2);\n }\n }\n }\n\n if (intersect(c1, c2) == 4) {\n Line L{c1.p, c2.p};\n Point p1 = crosspoint(c1, L).second;\n Point p2 = crosspoint(c2, L).first;\n Segment S{p1, p2};\n int cnt = 0;\n for (auto&& c : C) {\n cnt += intersect(c, S);\n }\n if (cnt == 0) {\n double a1 = arg(p1 - c1.p), a2 = arg(p2 - c2.p);\n if (eq(a1, -PI))\n a1 = PI;\n if (eq(a2, -PI))\n a2 = PI;\n int idx1 = lower_bound(cbegin(ang[i]), cend(ang[i]), a1 - EPS) - cbegin(ang[i]);\n int idx2 = lower_bound(cbegin(ang[j]), cend(ang[j]), a2 - EPS) - cbegin(ang[j]);\n uf.unite(f(i, idx1, true), f(j, idx2, true));\n }\n }\n }\n }\n\n vector<bool> ans;\n\n while (M--) {\n Point p, q;\n cin >> p >> q;\n\n auto find = [&](Point p) {\n vector<pair<double, int>> V;\n for (int i = 0; i < N; i++) {\n auto c = C[i];\n V.emplace_back(abs(distance(p, c.p) - c.r), i);\n }\n auto [d, i] = *min_element(cbegin(V), cend(V));\n auto c = C[i];\n bool outer = distance(p, c.p) >= c.r;\n double a = arg(p - c.p);\n if (eq(a, -PI))\n a = PI;\n int idx = lower_bound(cbegin(ang[i]), cend(ang[i]), a - EPS) - cbegin(ang[i]);\n return f(i, idx, outer);\n };\n\n ans.emplace_back(uf.same(find(p), find(q)));\n }\n\n for (int i = 0; i < ans.size(); i++) {\n cout << (ans[i] ? \"YES\" : \"NO\") << \" \\n\"[i == ans.size() - 1];\n }\n }\n}","accuracy":1,"time_ms":1460,"memory_kb":3900,"score_of_the_acc":-1.1154,"final_rank":19},{"submission_id":"aoj_1198_5633420","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nconst double EPS = 0.0001;\nstruct point{\n double x, y;\n point(){\n }\n point(double x, double y): x(x), y(y){\n }\n point operator -(point P){\n return point(x - P.x, y - P.y);\n }\n};\ndouble abs(point P){\n return sqrt(P.x * P.x + P.y * P.y);\n}\ndouble dist(point P, point Q){\n return abs(Q - P);\n}\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 segment_intersect(line L1, line L2){\n if (cross(L1.A - L2.A, vec(L2)) * cross(L1.B - L2.A, vec(L2)) > 0){\n return false;\n }\n if (cross(L2.A - L1.A, vec(L1)) * cross(L2.B - L1.A, vec(L1)) > 0){\n return false;\n }\n return true;\n}\nbool point_in_polygon(point P, vector<point> Q){\n int N = Q.size();\n point P2 = point(P.x + 100000, P.y + 123456);\n int cnt = 0;\n for (int i = 0; i < N; i++){\n line L1(Q[i], Q[(i + 1) % N]);\n line L2(P, P2);\n if (segment_intersect(L1, L2)){\n cnt++;\n }\n }\n if (cnt % 2 == 1){\n return true;\n } else {\n return false;\n }\n}\nstruct circle{\n point C;\n double r;\n circle(){\n }\n};\nbool point_in_circle(point P, circle C){\n return dist(P, C.C) < C.r;\n}\nbool circle_intersect(circle C1, circle C2){\n double d = dist(C1.C, C2.C);\n return abs(C1.r - C2.r) - EPS < d && d < C1.r + C2.r + EPS;\n}\nvoid dfs(vector<vector<int>> &E, vector<int> &r, vector<int> &p, vector<int> &d, int r2, int v){\n r[v] = r2;\n for (int w : E[v]){\n if (r[w] == -1){\n d[w] = d[v] + 1;\n p[w] = v;\n dfs(E, r, p, d, r2, w);\n }\n }\n}\nvector<int> detect_cycle(vector<vector<int>> E){\n int N = E.size();\n vector<int> r(N, -1);\n vector<int> p(N, -1);\n vector<int> d(N, 0);\n for (int i = 0; i < N; i++){\n if (p[i] == -1){\n dfs(E, r, p, d, i, i);\n }\n }\n for (int i = 0; i < N; i++){\n for (int j : E[i]){\n if (r[i] == r[j] && d[j] - d[i] > 1){\n vector<int> c;\n for (int v = j; v != i; v = p[v]){\n c.push_back(v);\n }\n c.push_back(i);\n return c;\n }\n }\n }\n return vector<int>();\n}\nint main(){\n while (true){\n int n, m;\n cin >> n >> m;\n if (n == 0 && m == 0){\n break;\n }\n vector<circle> C(n);\n for (int i = 0; i < n; i++){\n cin >> C[i].C.x >> C[i].C.y >> C[i].r;\n }\n for (int i = 0; i < m; i++){\n point P, Q;\n cin >> P.x >> P.y >> Q.x >> Q.y;\n set<int> st1, st2;\n for (int j = 0; j < n; j++){\n if (point_in_circle(P, C[j])){\n st1.insert(j);\n }\n if (point_in_circle(Q, C[j])){\n st2.insert(j);\n }\n }\n if (!st1.empty() || !st2.empty()){\n if (st1 == st2){\n cout << \"YES\";\n } else {\n cout << \"NO\";\n }\n } else {\n vector<vector<int>> E(n);\n for (int j = 0; j < n; j++){\n for (int k = j + 1; k < n; k++){\n if (circle_intersect(C[j], C[k])){\n E[j].push_back(k);\n E[k].push_back(j);\n }\n }\n }\n bool ok = true;\n while (true){\n vector<int> c = detect_cycle(E);\n if (c.empty()){\n break;\n }\n int cnt = c.size();\n vector<point> p(cnt);\n for (int j = 0; j < cnt; j++){\n p[j] = C[c[j]].C;\n }\n if (point_in_polygon(P, p) != point_in_polygon(Q, p)){\n ok = false;\n }\n for (int j = 0; j < E[c[0]].size(); j++){\n if (E[c[0]][j] == c[1]){\n E[c[0]].erase(E[c[0]].begin() + j);\n break;\n }\n }\n for (int j = 0; j < E[c[1]].size(); j++){\n if (E[c[1]][j] == c[0]){\n E[c[1]].erase(E[c[1]].begin() + j);\n break;\n }\n }\n }\n if (ok){\n cout << \"YES\";\n } else {\n cout << \"NO\";\n }\n }\n if (i < m - 1){\n cout << ' ';\n }\n }\n cout << endl;\n }\n}","accuracy":1,"time_ms":20,"memory_kb":3508,"score_of_the_acc":-0.0493,"final_rank":6},{"submission_id":"aoj_1198_5629175","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nconst double EPS = 0.0001;\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 dist(point P, point Q){\n return abs(Q - P);\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 segment_intersect(line L1, line L2){\n if (cross(L1.A - L2.A, vec(L2)) * cross(L1.B - L2.A, vec(L2)) > 0){\n return false;\n }\n if (cross(L2.A - L1.A, vec(L1)) * cross(L2.B - L1.A, vec(L1)) > 0){\n return false;\n }\n return true;\n}\nstruct circle{\n point C;\n double r;\n circle(){\n }\n};\nbool point_in_circle(point P, circle C){\n return dist(P, C.C) < C.r;\n}\nbool circle_intersects(circle C1, circle C2){\n double d = dist(C1.C, C2.C);\n return abs(C1.r - C2.r) - EPS < d && d < C1.r + C2.r + EPS;\n}\nbool point_in_polygon(point P, vector<point> Q){\n int N = Q.size();\n point P2 = point(P.x + 100000, P.y + 123456);\n int cnt = 0;\n for (int i = 0; i < N; i++){\n line L1(Q[i], Q[(i + 1) % N]);\n line L2(P, P2);\n if (segment_intersect(L1, L2)){\n cnt++;\n }\n }\n if (cnt % 2 == 1){\n return true;\n } else {\n return false;\n }\n}\nvoid dfs(vector<vector<int>> &E, vector<int> &r, vector<int> &p, vector<int> &d, int r2, int v){\n r[v] = r2;\n for (int w : E[v]){\n if (r[w] == -1){\n d[w] = d[v] + 1;\n p[w] = v;\n dfs(E, r, p, d, r2, w);\n }\n }\n}\nvector<int> detect_cycle(vector<vector<int>> E){\n int N = E.size();\n vector<int> r(N, -1);\n vector<int> p(N, -1);\n vector<int> d(N, 0);\n for (int i = 0; i < N; i++){\n if (p[i] == -1){\n dfs(E, r, p, d, i, i);\n }\n }\n for (int i = 0; i < N; i++){\n for (int j : E[i]){\n if (r[i] == r[j] && d[j] - d[i] > 1){\n vector<int> c;\n for (int v = j; v != i; v = p[v]){\n c.push_back(v);\n }\n c.push_back(i);\n return c;\n }\n }\n }\n return vector<int>();\n}\nint main(){\n while (true){\n int n, m;\n cin >> n >> m;\n if (n == 0 && m == 0){\n break;\n }\n vector<circle> C(n);\n for (int i = 0; i < n; i++){\n cin >> C[i].C.x >> C[i].C.y >> C[i].r;\n }\n for (int i = 0; i < m; i++){\n point P, Q;\n cin >> P.x >> P.y >> Q.x >> Q.y;\n set<int> st1, st2;\n for (int j = 0; j < n; j++){\n if (point_in_circle(P, C[j])){\n st1.insert(j);\n }\n if (point_in_circle(Q, C[j])){\n st2.insert(j);\n }\n }\n if (!st1.empty() || !st2.empty()){\n if (st1 == st2){\n cout << \"YES\";\n } else {\n cout << \"NO\";\n }\n } else {\n vector<vector<int>> E(n);\n for (int j = 0; j < n; j++){\n for (int k = j + 1; k < n; k++){\n if (circle_intersects(C[j], C[k])){\n E[j].push_back(k);\n E[k].push_back(j);\n }\n }\n }\n bool ok = true;\n while (true){\n vector<int> c = detect_cycle(E);\n if (c.empty()){\n break;\n }\n int cnt = c.size();\n vector<point> p(cnt);\n for (int j = 0; j < cnt; j++){\n p[j] = C[c[j]].C;\n }\n if (point_in_polygon(P, p) != point_in_polygon(Q, p)){\n ok = false;\n }\n for (int j = 0; j < E[c[0]].size(); j++){\n if (E[c[0]][j] == c[1]){\n E[c[0]].erase(E[c[0]].begin() + j);\n break;\n }\n }\n for (int j = 0; j < E[c[1]].size(); j++){\n if (E[c[1]][j] == c[0]){\n E[c[1]].erase(E[c[1]].begin() + j);\n break;\n }\n }\n }\n if (ok){\n cout << \"YES\";\n } else {\n cout << \"NO\";\n }\n }\n if (i < m - 1){\n cout << ' ';\n }\n }\n cout << endl;\n }\n}","accuracy":1,"time_ms":20,"memory_kb":3500,"score_of_the_acc":-0.0478,"final_rank":5},{"submission_id":"aoj_1198_5628739","code_snippet":"/*\tauthor: Kite_kuma\n\tcreated: 2021.06.29 20:45:02 */\n\n// #ifdef LOCAL\n// #define _GLIBCXX_DEBUG\n// #endif\n#include <bits/stdc++.h>\nusing namespace std;\n\n#pragma region macros\n\n#define foa(s, v) for(auto &s : v)\n#define all(v) (v).begin(), (v).end()\n#define rall(v) (v).rbegin(), (v).rend()\n#define popcnt(n) __builtin_popcountll((long long)n)\n\n#define REPname(a, b, c, d, e, ...) e\n#define rep(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\n#define REP0(x) for(int Counter_in_rep_macro = 0; Counter_in_rep_macro < (x); ++Counter_in_rep_macro)\n#define REP1(i, x) for(int i = 0; i < (x); ++i)\n#define REP2(i, l, r) for(int i = (l); i < (r); ++i)\n#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))\n\n#define DREPname(a, b, c, d, e, ...) e\n#define drep(...) DREPname(__VA_ARGS__, DREP3, DREP2, DREP1)(__VA_ARGS__)\n#define DREP1(i, x) for(int i = (x)-1; i >= 0; --i)\n#define DREP2(i, l, r) for(int i = (r)-1; i >= (l); --i)\n#define DREP3(i, l, r, c) for(int i = (r)-1; i >= (l); i -= (c))\n\n#pragma endregion\n\n#pragma region aliases\n\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing vi = std::vector<int>;\nusing vvi = std::vector<std::vector<int>>;\nusing vvvi = std::vector<std::vector<std::vector<int>>>;\nusing vll = std::vector<ll>;\nusing vvll = std::vector<vll>;\nusing vvvll = std::vector<vvll>;\nusing pii = std::pair<int, int>;\nusing pll = std::pair<long long, long long>;\ntemplate <class T = ll>\nusing V = std::vector<T>;\ntemplate <class T = ll>\nusing VV = V<V<T>>;\ntemplate <class T = ll>\nusing VVV = V<V<V<T>>>;\ntemplate <class T = ll>\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\ntemplate <class T = ll>\nusing pqdn = std::priority_queue<T>;\n\n#pragma endregion\n\n#pragma region constants\n\nconst int inf = 1e9;\nconst long long INF = 1e18;\nconst long double pi = acos(-1);\nconst char dl = '\\n';\nconst char sp = ' ';\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\n\nconst int mod_1000000007 = 1000000007;\nconst int mod_998244353 = 998244353;\n\n#pragma endregion\n\n#pragma region basic_operation\n\ntemplate <class T0, class T1, class T2>\ninline bool in_range(T0 x, T1 lef, T2 rig) {\n\treturn ((lef <= x) && (x < rig));\n}\n\ntemplate <class T>\ninline bool chmin(T &a, T b) {\n\tif(a > b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\ntemplate <class T>\ninline bool chmax(T &a, T b) {\n\tif(a < b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nvoid Yes(bool f = 1) { std::cout << (f ? \"Yes\" : \"No\") << '\\n'; }\nvoid No() { std::cout << \"No\\n\"; }\nvoid YES(bool f = 1) { std::cout << (f ? \"YES\" : \"NO\") << '\\n'; }\nvoid NO() { std::cout << \"NO\\n\"; }\n\ntemplate <class T>\nvoid drop(T answer) {\n\tstd::cout << answer << '\\n';\n\texit(0);\n}\n\nvoid err(bool flag = true) {\n\tif(!flag) return;\n\tstd::cout << -1 << '\\n';\n\texit(0);\n}\n\ntemplate <class T>\nvoid vout(std::vector<T> const &v, bool vertically = 0) {\n\tif(vertically) {\n\t\tfor(auto const &a : v) {\n\t\t\tstd::cout << a << '\\n';\n\t\t}\n\t\treturn;\n\t}\n\tfor(auto it = v.begin(); it != v.end(); it++) {\n\t\tstd::cout << (*it);\n\t\tif(it != v.end() - 1) {\n\t\t\tstd::cout << ' ';\n\t\t}\n\t}\n\tstd::cout << '\\n';\n\treturn;\n}\n\ninline void print() { std::cout << '\\n'; }\ntemplate <class T>\ninline void print(T x) {\n\tstd::cout << x << '\\n';\n\treturn;\n}\ntemplate <typename Head, typename... Tail>\nvoid print(Head H, Tail... T) {\n\tstd::cout << H << \" \";\n\tprint(T...);\n}\n\ntemplate <class T>\nvoid add(std::vector<T> &v, T val) {\n\tfor(auto &a : v) a += val;\n\treturn;\n}\n\ntemplate <class T>\nT dup(T a, T b) {\n\tassert(b != 0);\n\treturn (a + b - 1) / b;\n}\n\ntemplate <class T>\nT greatest_lower_multiple(T x, T d) {\n\tif(d == 0) return 0;\n\tif(d < 0) d *= -1;\n\tT y = x % d;\n\tif(y < 0) y += d;\n\treturn x - y;\n}\n\ntemplate <class T>\nT least_upper_multiple(T x, T d) {\n\treturn -greatest_lower_multiple(-x, d);\n}\n\nlong long POW(long long a, long long n) {\n\tlong long res = 1;\n\twhile(n > 0) {\n\t\tif(n & 1) res = res * a;\n\t\ta = a * a;\n\t\tn >>= 1;\n\t}\n\treturn res;\n}\n\nlong long modpow(long long a, long long n, long long mod) {\t // a^n mod\n\tassert(n >= 0 && mod);\n\tif(mod == 1) return 0LL;\n\tlong long res = 1;\n\twhile(n > 0) {\n\t\tif(n & 1) res = res * a % mod;\n\t\ta = a * a % mod;\n\t\tn >>= 1;\n\t}\n\treturn res < 0 ? res + mod : res;\n}\n\n// return x which satisfies a * x % mod == gcd(a, mod)\n// not (mod | a)\nlong long modinv(long long a, long long mod) {\n\tlong long b = mod, u = 1, v = 0;\n\twhile(b) {\n\t\tlong long t = a / b;\n\t\ta -= t * b;\n\t\tstd::swap(a, b);\n\t\tu -= t * v;\n\t\tstd::swap(u, v);\n\t}\n\tu %= mod;\n\tif(u < 0) u += mod;\n\treturn u;\n}\n\ntemplate <class T>\nint lb(const std::vector<T> &a, const T x) {\n\treturn std::distance(a.begin(), std::lower_bound(a.begin(), a.end(), x));\n}\ntemplate <class T>\nint ub(const std::vector<T> &a, const T x) {\n\treturn std::distance(a.begin(), std::upper_bound(a.begin(), a.end(), x));\n}\ntemplate <class T>\nvoid unq_sort(std::vector<T> &a) {\n\tstd::sort(a.begin(), a.end());\n\ta.erase(std::unique(a.begin(), a.end()), a.end());\n}\ntemplate <class T>\nstd::vector<int> press(std::vector<T> &a) {\n\tauto vec = a;\n\tunq_sort(vec);\n\tstd::vector<int> ret;\n\tfor(auto &v : a) ret.push_back(lb(vec, v));\n\treturn ret;\n}\n\n#pragma endregion\n\n#pragma region input\n#define VEC(type, name, size) \\\n\tvector<type> name(size); \\\n\tscanner::INPUT(name)\n#define VVEC(type, name, h, w) \\\n\tvector<vector<type>> name(h, vector<type>(w)); \\\n\tscanner::INPUT(name)\n#define INT(...) \\\n\tint __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LL(...) \\\n\tlong long __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define STR(...) \\\n\tstring __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define CHR(...) \\\n\tchar __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define DBL(...) \\\n\tdouble __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LD(...) \\\n\tlong double __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define TPL3(type0, type1, type2, name) \\\n\tstd::tuple<type0, type1, type2> name; \\\n\tscanner::INPUT(name);\n#define TPL4(type0, type1, type2, type3, name) \\\n\tstd::tuple<type0, type1, type2, type3> name; \\\n\tscanner::INPUT(name);\n\nnamespace scanner {\ntemplate <class T>\nvoid scan(T &a) {\n\tstd::cin >> a;\n}\n\ntemplate <class T, class L>\nvoid scan(std::pair<T, L> &p) {\n\tscan(p.first);\n\tscan(p.second);\n}\n\ntemplate <class T0, class T1, class T2>\nvoid scan(std::tuple<T0, T1, T2> &p) {\n\tT0 t0;\n\tT1 t1;\n\tT2 t2;\n\tscan(t0);\n\tscan(t1);\n\tscan(t2);\n\tp = std::make_tuple(t0, t1, t2);\n}\n\ntemplate <class T0, class T1, class T2, class T3>\nvoid scan(std::tuple<T0, T1, T2, T3> &p) {\n\tT0 t0;\n\tT1 t1;\n\tT2 t2;\n\tT3 t3;\n\tscan(t0);\n\tscan(t1);\n\tscan(t2);\n\tscan(t3);\n\tp = std::make_tuple(t0, t1, t2, t3);\n}\n\ntemplate <class T>\nvoid scan(std::vector<T> &a) {\n\tfor(auto &i : a) scan(i);\n}\n\nvoid INPUT() {}\ntemplate <class Head, class... Tail>\nvoid INPUT(Head &head, Tail &... tail) {\n\tscan(head);\n\tINPUT(tail...);\n}\n} // namespace scanner\n\ntemplate <typename T1, typename T2>\nstd::istream &operator>>(std::istream &is, std::pair<T1, T2> &p) {\n\tis >> p.first >> p.second;\n\treturn is;\n}\n#pragma endregion\n\n#pragma region debug\n\n#pragma region output\ntemplate <typename T1, typename T2>\nstd::ostream &std::operator<<(std::ostream &os, const std::pair<T1, T2> &p) {\n\tos << p.first << \" \" << p.second;\n\treturn os;\n}\ntemplate <class T>\nstd::ostream &std::operator<<(std::ostream &os, const std::vector<T> &v) {\n\tfor(int i = 0; i < (int)v.size(); i++) {\n\t\tif(i) os << \" \";\n\t\tos << v[i];\n\t}\n\treturn os;\n}\n#pragma endregion\n\n#pragma region view\n\nnamespace viewer {\nvoid view(const long long e) {\n\tif(e == INF)\n\t\tstd::cerr << \"INF\";\n\telse if(e == -INF)\n\t\tstd::cerr << \"-INF\";\n\telse\n\t\tstd::cerr << e;\n}\n\nvoid view(const int e) {\n\tif(e == inf)\n\t\tstd::cerr << \"inf\";\n\telse if(e == -inf)\n\t\tstd::cerr << \"-inf\";\n\telse\n\t\tstd::cerr << e;\n}\n\ntemplate <typename T>\nvoid view(const T e) {\n\tstd::cerr << e;\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::pair<T, U> &p) {\n\tstd::cerr << \"(\";\n\tview(p.first);\n\tstd::cerr << \", \";\n\tview(p.second);\n\tstd::cerr << \")\";\n}\n\ntemplate <class T0, class T1, class T2>\nvoid view(const std::tuple<T0, T1, T2> &p) {\n\tstd::cerr << \"(\";\n\tview(std::get<0>(p));\n\tstd::cerr << \", \";\n\tview(std::get<1>(p));\n\tstd::cerr << \", \";\n\tview(std::get<2>(p));\n\tstd::cerr << \")\";\n}\n\ntemplate <class T0, class T1, class T2, class T3>\nvoid view(const std::tuple<T0, T1, T2, T3> &p) {\n\tstd::cerr << \"(\";\n\tview(std::get<0>(p));\n\tstd::cerr << \", \";\n\tview(std::get<1>(p));\n\tstd::cerr << \", \";\n\tview(std::get<2>(p));\n\tstd::cerr << \", \";\n\tview(std::get<3>(p));\n\tstd::cerr << \")\";\n}\n\ntemplate <typename T>\nvoid view(const std::set<T> &s) {\n\tif(s.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << \"{ \";\n\tfor(auto &t : s) {\n\t\tview(t);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <typename T>\nvoid view(const std::unordered_set<T> &s) {\n\tif(s.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << \"{ \";\n\tfor(auto &t : s) {\n\t\tview(t);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <typename T>\nvoid view(const std::vector<T> &v) {\n\tif(v.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << \"{ \";\n\tfor(const auto &e : v) {\n\t\tview(e);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <typename T>\nvoid view(const std::vector<std::vector<T>> &vv) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &v : vv) {\n\t\tstd::cerr << \"\\t\";\n\t\tview(v);\n\t\tstd::cerr << '\\n';\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::vector<std::pair<T, U>> &v) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &c : v) {\n\t\tstd::cerr << \"\\t(\";\n\t\tview(c.first);\n\t\tstd::cerr << \", \";\n\t\tview(c.second);\n\t\tstd::cerr << \")\\n\";\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <class T0, class T1, class T2>\nvoid view(const std::vector<std::tuple<T0, T1, T2>> &v) {\n\tif(v.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << '{';\n\tfor(const auto &t : v) {\n\t\tstd::cerr << \"\\n\\t\";\n\t\tview(t);\n\t\tstd::cerr << \",\";\n\t}\n\tstd::cerr << \"\\n}\";\n}\n\ntemplate <class T0, class T1, class T2, class T3>\nvoid view(const std::vector<std::tuple<T0, T1, T2, T3>> &v) {\n\tif(v.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << '{';\n\tfor(const auto &t : v) {\n\t\tstd::cerr << \"\\n\\t\";\n\t\tview(t);\n\t\tstd::cerr << \",\";\n\t}\n\tstd::cerr << \"\\n}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::map<T, U> &m) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &t : m) {\n\t\tstd::cerr << \"\\t[\";\n\t\tview(t.first);\n\t\tstd::cerr << \"] : \";\n\t\tview(t.second);\n\t\tstd::cerr << '\\n';\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::unordered_map<T, U> &m) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &t : m) {\n\t\tstd::cerr << \"\\t[\";\n\t\tview(t.first);\n\t\tstd::cerr << \"] : \";\n\t\tview(t.second);\n\t\tstd::cerr << '\\n';\n\t}\n\tstd::cerr << \"}\";\n}\n} // namespace viewer\n\n#pragma endregion\n\n// when debugging : g++ foo.cpp -DLOCAL\n#ifdef LOCAL\nvoid debug_out() {}\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head H, Tail... T) {\n\tviewer::view(H);\n\tstd::cerr << \", \";\n\tdebug_out(T...);\n}\n#define debug(...) \\\n\tdo { \\\n\t\tstd::cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"] : [\"; \\\n\t\tdebug_out(__VA_ARGS__); \\\n\t\tstd::cerr << \"\\b\\b]\\n\"; \\\n\t} while(0)\n#define dump(x) \\\n\tdo { \\\n\t\tstd::cerr << __LINE__ << \" \" << #x << \" : \"; \\\n\t\tviewer::view(x); \\\n\t\tstd::cerr << '\\n'; \\\n\t} while(0)\n\n#else\n#define debug(...) (void(0))\n#define dump(x) (void(0))\n#endif\n\n#pragma endregion\n\n#pragma region geometry\n\nusing Real = long double; //時間がかかる割にdoubleと大差ない\nusing Point = complex<Real>;\nconst Real EPS = 1e-10, /*1e-8はたまに落ちる*/ PI = acos(-1);\n\ninline bool eq(Real a, Real b) { return fabs(b - a) < EPS; } //誤差無視の等式\n\n//実スカラー倍\nPoint operator*(const Point &p, const Real &d) { return Point(real(p) * d, imag(p) * d); }\n\n// point入力受け取り\nistream &operator>>(istream &is, Point &p) {\n\tReal a, b;\n\tis >> a >> b;\n\tp = Point(a, b);\n\treturn is;\n}\n// point出力\nostream &operator<<(ostream &os, Point &p) { return os << fixed << setprecision(10) << p.real() << \" \" << p.imag(); }\n\n// 点 p を反時計回りに theta 回転\nPoint rotate(Real theta, const Point &p) {\n\treturn Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\n}\n\nReal radian_to_degree(Real r) { return (r * 180.0 / PI); }\n\nReal degree_to_radian(Real d) { return (d * PI / 180.0); }\n\n// a-b-c の角度のうち小さい方を返す\nReal get_angle(const Point &a, const Point &b, const Point &c) {\n\tconst Point v(a - b), /* もとはv(b-a)になってたので修正 */ w(c - b);\n\tReal alpha = atan2(v.imag(), v.real()), beta = atan2(w.imag(), w.real());\n\tif(alpha > beta) swap(alpha, beta);\n\tReal theta = (beta - alpha);\n\treturn min(theta, 2 * acos(-1) - theta);\n}\n\nnamespace std {\nbool operator<(const Point &a, const Point &b) { return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag(); }\n} // namespace std\n\nstruct Line {\n\tPoint a, b;\n\n\tLine() = default;\n\n\tLine(Point a, Point b) : a(a), b(b) {}\n\n\tLine(Real A, Real B, Real C) // Ax + By = C\n\t{\n\t\tif(eq(A, 0))\n\t\t\ta = Point(0, C / B), b = Point(1, C / B);\n\t\telse if(eq(B, 0))\n\t\t\tb = Point(C / A, 0), b = Point(C / A, 1);\n\t\telse\n\t\t\ta = Point(0, C / B), b = Point(C / A, 0);\n\t}\n\n\tfriend ostream &operator<<(ostream &os, Line &p) { return os << p.a << \" to \" << p.b; }\n\n\tfriend istream &operator>>(istream &is, Line &a) { return is >> a.a >> a.b; }\n};\n\nstruct Segment : Line {\n\tSegment() = default;\n\n\tSegment(Point a, Point b) : Line(a, b) {}\n};\n\nstruct Circle {\n\tPoint p;\n\tReal r;\n\n\tCircle() = default;\n\n\tCircle(Point p, Real r) : p(p), r(r) {}\n};\n\nusing Points = vector<Point>;\nusing Polygon = vector<Point>;\nusing Segments = vector<Segment>;\nusing Lines = vector<Line>;\nusing Circles = vector<Circle>;\n\n//外積\nReal cross(const Point &a, const Point &b) { return real(a) * imag(b) - imag(a) * real(b); }\n//内積\nReal dot(const Point &a, const Point &b) { return real(a) * real(b) + imag(a) * imag(b); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\n// 点の回転方向\nint ccw(const Point &a, Point b, Point c) {\n\tb = b - a, c = c - a;\n\tif(cross(b, c) > EPS) return +1; // \"COUNTER_CLOCKWISE\"\n\tif(cross(b, c) < -EPS) return -1; // \"CLOCKWISE\"\n\tif(dot(b, c) < 0) return +2;\t // \"ONLINE_BACK\"\n\tif(norm(b) < norm(c)) return -2; // \"ONLINE_FRONT\"\n\treturn 0;\t\t\t\t\t\t // \"ON_SEGMENT\"\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\n// 平行判定\nbool parallel(const Line &a, const Line &b) { return eq(cross(a.b - a.a, b.b - b.a), 0.0); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\n// 垂直判定\nbool orthogonal(const Line &a, const Line &b) { return eq(dot(a.a - a.b, b.a - b.b), 0.0); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\n// 射影\n// 直線 l に p から垂線を引いた交点を求める\nPoint projection(const Line &l, const Point &p) {\n\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + (l.a - l.b) * t;\n}\n\nPoint projection(const Segment &l, const Point &p) {\n\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + (l.a - l.b) * t;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\n// 反射\n// 直線 l を対称軸として点 p と線対称にある点を求める\nPoint reflection(const Line &l, const Point &p) { return p + (projection(l, p) - p) * 2.0; }\n\nbool intersect(const Line &l, const Point &p) { return abs(ccw(l.a, l.b, p)) != 1; }\n\nbool intersect(const Line &l, const Line &m) { return abs(cross(l.b - l.a, m.b - m.a)) > EPS || abs(cross(l.b - l.a, m.b - l.a)) < EPS; }\n\nbool intersect(const Segment &s, const Point &p) { return ccw(s.a, s.b, p) == 0; }\n\nbool intersect(const Line &l, const Segment &s) { return cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < EPS; }\n\nReal distance(const Line &l, const Point &p);\n\nbool intersect(const Circle &c, const Line &l) { return distance(l, c.p) <= c.r + EPS; }\n\nbool intersect(const Circle &c, const Point &p) { return abs(abs(p - c.p) - c.r) < EPS; }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\n// 線分同士の交差判定 (端点が他方の線分上にあるならば交差とみなす)\nbool intersect(const Segment &s, const Segment &t) {\n\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 && ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\n}\n\nint intersect(const Circle &c, const Segment &l) {\n\tif(norm(projection(l, c.p) - c.p) - c.r * c.r > EPS) return 0;\n\tauto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\n\tif(d1 < c.r + EPS && d2 < c.r + EPS) return 0;\n\tif(d1 < c.r - EPS && d2 > c.r + EPS || d1 > c.r + EPS && d2 < c.r - EPS) return 1;\n\tconst Point h = projection(l, c.p);\n\tif(dot(l.a - h, l.b - h) < 0) return 2;\n\treturn 0;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A&lang=jp\nint intersect(Circle c1, Circle c2) {\n\tif(c1.r < c2.r) swap(c1, c2);\n\tReal d = abs(c1.p - c2.p);\n\tif(c1.r + c2.r < d) return 4;\t // 外に離れている\n\tif(eq(c1.r + c2.r, d)) return 3; // 外接\n\tif(c1.r - c2.r < d) return 2;\t // 交差\n\tif(eq(c1.r - c2.r, d)) return 1; // 内接\n\treturn 0;\t\t\t\t\t\t // 内包\n}\n\nReal distance(const Point &a, const Point &b) { return abs(a - b); }\n\nReal distance(const Line &l, const Point &p) { return abs(p - projection(l, p)); }\n\nReal distance(const Line &l, const Line &m) { return intersect(l, m) ? 0 : distance(l, m.a); }\n\nReal distance(const Segment &s, const Point &p) {\n\tPoint r = projection(s, p);\n\tif(intersect(s, r)) return abs(r - p);\n\treturn min(abs(s.a - p), abs(s.b - p));\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_D\nReal distance(const Segment &a, const Segment &b) {\n\tif(intersect(a, b)) return 0;\n\treturn min({distance(a, b.a), distance(a, b.b), distance(b, a.a), distance(b, a.b)});\n}\n\nReal distance(const Line &l, const Segment &s) {\n\tif(intersect(l, s)) return 0;\n\treturn min(distance(l, s.a), distance(l, s.b));\n}\n\nPoint crosspoint(const Line &l, const Line &m) {\n\tReal A = cross(l.b - l.a, m.b - m.a);\n\tReal B = cross(l.b - l.a, l.b - m.a);\n\tif(eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\n\treturn m.a + (m.b - m.a) * B / A;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_C\nPoint crosspoint(const Segment &l, const Segment &m) { return crosspoint(Line(l), Line(m)); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\npair<Point, Point> crosspoint(const Circle &c, const Line l) {\n\tPoint pr = projection(l, c.p);\n\tPoint e = (l.b - l.a) / abs(l.b - l.a);\n\tif(eq(distance(l, c.p), c.r)) return {pr, pr};\n\tdouble base = sqrt(c.r * c.r - norm(pr - c.p));\n\treturn {pr - e * base, pr + e * base};\n}\n\npair<Point, Point> crosspoint(const Circle &c, const Segment &l) {\n\tLine aa = Line(l.a, l.b);\n\tif(intersect(c, l) == 2) return crosspoint(c, aa);\n\tauto ret = crosspoint(c, aa);\n\tif(dot(l.a - ret.first, l.b - ret.first) < 0)\n\t\tret.second = ret.first;\n\telse\n\t\tret.first = ret.second;\n\treturn ret;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\npair<Point, Point> crosspoint(const Circle &c1, const Circle &c2) {\n\tReal d = abs(c1.p - c2.p);\n\tReal a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d)); // 余弦定理\n\tReal t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\n\tPoint p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\n\tPoint p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\n\treturn {p1, p2};\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F\n// \"点 p を通る円 c の接線\"の接点2つ\npair<Point, Point> tangent(const Circle &c1, const Point &p2) { return crosspoint(c1, Circle(p2, sqrt(norm(c1.p - p2) - c1.r * c1.r))); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_G\n// 円 c1, c2 の共通接線\nLines tangent(Circle c1, Circle c2) {\n\tLines ret;\n\tif(c1.r < c2.r) swap(c1, c2);\n\tReal g = norm(c1.p - c2.p);\n\tif(eq(g, 0)) return ret;\n\tPoint u = (c2.p - c1.p) / sqrt(g);\n\tPoint v = rotate(PI * 0.5, u);\n\tfor(int s : {-1, 1}) {\n\t\tReal h = (c1.r + s * c2.r) / sqrt(g);\n\t\tif(eq(1 - h * h, 0)) {\n\t\t\tret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\n\t\t} else if(1 - h * h > 0) {\n\t\t\tPoint uu = u * h, vv = v * sqrt(1 - h * h);\n\t\t\tret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\n\t\t\tret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\n\t\t}\n\t}\n\treturn ret;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_B\n// 凸性判定 (反時計回り)\nbool is_convex(const Polygon &p) {\n\tint n = (int)p.size();\n\tfor(int i = 0; i < n; i++) {\n\t\tif(ccw(p[(i + n - 1) % n], p[i], p[(i + 1) % n]) == -1) return false;\n\t}\n\treturn true;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_A\n// 凸包\nPolygon convex_hull(Polygon &p) {\n\tint n = (int)p.size(), k = 0;\n\tif(n <= 2) return p;\n\tsort(p.begin(), p.end()); // x -> yの順にソート\n\tvector<Point> ch(2 * n);\n\tfor(int i = 0; i < n; ch[k++] = p[i++]) { //下半分を構成\n\t\twhile(k >= 2 && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < EPS) --k;\n\t}\n\tfor(int i = n - 2, t = k + 1; i >= 0; ch[k++] = p[i--]) { //上半分を構成\n\t\twhile(k >= t && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < EPS) --k;\n\t}\n\tch.resize(k - 1);\n\treturn ch;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_C\n// 多角形と点の包含判定\nenum { OUT, ON, IN };\n\nint contains(const Polygon &Q, const Point &p) {\n\tbool in = false;\n\tfor(int i = 0; i < Q.size(); i++) {\n\t\tPoint a = Q[i] - p, b = Q[(i + 1) % Q.size()] - p;\n\t\tif(a.imag() > b.imag()) swap(a, b);\n\t\tif(a.imag() <= 0 && 0 < b.imag() && cross(a, b) < 0) in = !in;\n\t\tif(cross(a, b) == 0 && dot(a, b) <= 0) return ON;\n\t}\n\treturn in ? IN : OUT;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_H\n// 円と多角形の共通部分の面積\nReal area(const Polygon &p, const Circle &c) {\n\tif(p.size() < 3) return 0.0;\n\tfunction<Real(Circle, Point, Point)> cross_area = [&](const Circle &c, const Point &a, const Point &b) {\n\t\tPoint va = c.p - a, vb = c.p - b;\n\t\tReal f = cross(va, vb), ret = 0.0;\n\t\tif(eq(f, 0.0)) return ret;\n\t\tif(max(abs(va), abs(vb)) < c.r + EPS) return f;\n\t\tif(distance(Segment(a, b), c.p) > c.r - EPS) return c.r * c.r * arg(vb * conj(va));\t // 0.5倍してなくない？\n\t\tauto u = crosspoint(c, Segment(a, b));\n\t\tvector<Point> tot{a, u.first, u.second, b};\n\t\tfor(int i = 0; i + 1 < tot.size(); i++) {\n\t\t\tret += cross_area(c, tot[i], tot[i + 1]);\n\t\t}\n\t\treturn ret;\n\t};\n\tReal A = 0;\n\tfor(int i = 0; i < p.size(); i++) {\n\t\tA += cross_area(c, p[i], p[(i + 1) % p.size()]);\n\t}\n\treturn A * 0.5;\t // 0.5倍が抜けていたので修正;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_B\n// 凸多角形の直径(最遠頂点対間距離)\nReal convex_diameter(const Polygon &p) {\n\tint N = (int)p.size();\n\tint is = 0, js = 0;\n\tfor(int i = 1; i < N; i++) {\n\t\tif(p[i].imag() > p[is].imag()) is = i;\n\t\tif(p[i].imag() < p[js].imag()) js = i;\n\t}\n\tReal maxdis = norm(p[is] - p[js]);\n\n\tint maxi, maxj, i, j;\n\ti = maxi = is;\n\tj = maxj = js;\n\tdo {\n\t\tif(cross(p[(i + 1) % N] - p[i], p[(j + 1) % N] - p[j]) >= 0) {\n\t\t\tj = (j + 1) % N;\n\t\t} else {\n\t\t\ti = (i + 1) % N;\n\t\t}\n\t\tif(norm(p[i] - p[j]) > maxdis) {\n\t\t\tmaxdis = norm(p[i] - p[j]);\n\t\t\tmaxi = i;\n\t\t\tmaxj = j;\n\t\t}\n\t} while(i != is || j != js);\n\treturn sqrt(maxdis);\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_5_A\n// 最近点対\nReal closest_pair(Points ps) {\n\tif(ps.size() <= 1) throw(0);\n\tsort(begin(ps), end(ps)); // xでソート\n\n\tauto compare_y = [&](const Point &a, const Point &b) { return imag(a) < imag(b); };\n\tvector<Point> beet(ps.size());\n\tconst Real INF = 1e18;\n\n\tfunction<Real(int, int)> rec = [&](int left, int right) {\n\t\tif(right - left <= 1) return INF;\n\t\tint mid = (left + right) >> 1;\n\t\tauto x = real(ps[mid]);\t // 領域内でx座標真中の点\n\t\tauto ret = min(rec(left, mid), rec(mid, right));\n\t\t// y座標でソートされた2つの区間をマージ\n\t\tinplace_merge(begin(ps) + left, begin(ps) + mid, begin(ps) + right, compare_y);\n\t\tint ptr = 0;\n\t\tfor(int i = left; i < right; i++) {\n\t\t\tif(abs(real(ps[i]) - x) >= ret) continue;\n\t\t\tfor(int j = 0; j < ptr; j++) {\n\t\t\t\tauto luz = ps[i] - beet[ptr - j - 1];\n\t\t\t\tif(imag(luz) >= ret) break;\n\t\t\t\tret = min(ret, abs(luz));\n\t\t\t}\n\t\t\tbeet[ptr++] = ps[i];\n\t\t}\n\t\treturn ret;\n\t};\n\treturn rec(0, (int)ps.size());\n}\n\n// (aからの距離):(bからの距離) = dist_a : dist_b となる点の集合(円)を返す\nCircle Apollonius_Circle(Point a, Point b, Real dist_a, Real dist_b) {\n\tassert(!eq(dist_a, dist_b)); //同じ場合はbisectionで\n\tReal asq = dist_a * dist_a, bsq = dist_b * dist_b;\n\tPoint p = (a * bsq - b * asq) * (1 / (bsq - asq));\n\tReal r = abs(a - b) * dist_a * dist_b / abs(asq - bsq);\n\treturn Circle(p, r);\n}\n\n// 二等分線\nLine bisection(Point a, Point b) {\n\ta = (a + b) * 0.5;\n\tb = rotate(PI / 2, b - a) + a;\n\treturn Line(a, b);\n}\n\n#pragma endregion\n\nvoid solve() {\n\tINT(n, m);\n\tif(n + m == 0) exit(0);\n\n\tCircles c;\n\trep(n) {\n\t\tReal x, y, r;\n\t\tcin >> x >> y >> r;\n\t\tc.emplace_back(Point(x, y), r);\n\t}\n\n\tVV<pair<Real, int>> g(n, V<pair<Real, int>>(n, pair(-1., 0)));\n\n\trep(i, n) rep(j, n) {\n\t\tif(i == j) continue;\n\t\tif(intersect(c[i], c[j]) == 2) {\n\t\t\t// g[i].emplace_back(arg(c[j].p - c[i].p), j);\n\t\t\tg[i][j] = pair(arg(c[j].p - c[i].p), 1);\n\t\t}\n\t}\n\n\n\tvector<vector<int>> convexes;\n\tvi visited(n);\n\trep(first, n) {\n\t\twhile(1) {\n\t\t\tbool b = true;\n\t\t\tvi cycle;\n\t\t\tReal direction = 0.;\n\t\t\tint now = first;\n\n\t\t\tdo {\n\t\t\t\tint nxt = -1;\n\t\t\t\tReal angle = -INF;\n\t\t\t\tauto nxt_dir = direction;\n\t\t\t\trep(j, n) {\n\t\t\t\t\tif(g[now][j].second == 0) continue;\n\t\t\t\t\tReal diff = g[now][j].first - direction;\n\t\t\t\t\twhile(diff < -pi + EPS * 2) diff += pi * 2;\n\t\t\t\t\twhile(diff >= pi - EPS) diff -= pi * 2;\n\n\t\t\t\t\tif(chmax(angle, diff)) {\n\t\t\t\t\t\tnxt = j;\n\t\t\t\t\t\tnxt_dir = g[now][j].first;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif(nxt == -1) {\n\t\t\t\t\tb = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tg[now][nxt].second = 0;\n\t\t\t\tdirection = nxt_dir;\n\t\t\t\tnow = nxt;\n\t\t\t\tcycle.push_back(nxt);\n\t\t\t} while(now != first);\n\t\t\tif(!b) break;\n\t\t\tconvexes.push_back(cycle);\n\t\t}\n\t}\n\t// int cs = convexes.size();\n\n\tV<Polygon> plgns;\n\n\tfoa(cvx, convexes) {\n\t\tPolygon plgn;\n\t\tfoa(ver, cvx) plgn.push_back(c[ver].p);\n\t\tplgns.push_back(plgn);\n\t}\n\n\trep(loop, m) {\n\t\tPoint pee, kyu;\t // P, Q\n\t\t// Real x, y;\n\t\t// cin >> x >> y;\n\t\t// pee.emplace_back(x, y);\n\t\t// cin >> x >> y;\n\t\t// kyu.emplace_back(x, y);\n\t\tcin >> pee >> kyu;\n\n\t\tvector<int> pee_in;\n\t\tvector<int> kyu_in;\n\n\t\trep(i, n) {\n\t\t\tif(distance(c[i].p, pee) < c[i].r) {\n\t\t\t\tpee_in.push_back(i);\n\t\t\t}\n\t\t}\n\n\t\trep(i, n) {\n\t\t\tif(distance(c[i].p, kyu) < c[i].r) {\n\t\t\t\tkyu_in.push_back(i);\n\t\t\t}\n\t\t}\n\n\t\tif(!pee_in.empty()) {\n\t\t\tcout << (pee_in == kyu_in ? \"YES\" : \"NO\") << (loop == m - 1 ? '\\n' : ' ');\n\t\t\tcontinue;\n\t\t}\n\n\t\trep(i, plgns.size()) {\n\t\t\t// foa(plgn, plgns) {\n\t\t\tauto plgn = plgns[i];\n\t\t\tif(contains(plgn, pee) == IN) {\n\t\t\t\tpee_in.push_back(i);\n\t\t\t}\n\t\t}\n\n\t\trep(i, plgns.size()) {\n\t\t\t// foa(plgn, plgns) {\n\t\t\tauto plgn = plgns[i];\n\t\t\tif(contains(plgn, kyu) == IN) {\n\t\t\t\tkyu_in.push_back(i);\n\t\t\t}\n\t\t}\n\n\t\tcout << (pee_in == kyu_in ? \"YES\" : \"NO\") << (loop == m - 1 ? '\\n' : ' ');\n\t}\n\n\tdebug(convexes);\n\treturn;\n}\nint main() {\n\tstd::ios::sync_with_stdio(false);\n\tstd::cin.tie(nullptr);\n\tstd::cout << std::fixed << std::setprecision(15);\n\tsrand((unsigned)time(NULL));\n\n\twhile(1) solve();\n\n\treturn 0;\n}","accuracy":1,"time_ms":30,"memory_kb":4008,"score_of_the_acc":-0.1493,"final_rank":15},{"submission_id":"aoj_1198_4326322","code_snippet":"#include\"bits/stdc++.h\"\nusing namespace std;\n\n#define REP(i,n) for(int i=0;i<(n);i++)\n#define FOR(i,m,n) for(int i=(m);i<(n);i++)\n#define REPR(i,n) for(int i=(n)-1;i>=0;i--)\nconst bool DEBUG = false;\nconst double EPS = 1e-8;\ntypedef complex<double>point;\npoint operator*(const point &p, const double &d) {\n\treturn point(real(p)*d, imag(p)*d);\n}\nnamespace std {\n\tbool operator<(const point &a, const point &b) {\n\t\treturn real(a) != real(b) ? real(a)<real(b) : imag(a)<imag(b);\n\t}\n}\ndouble dist(const point &a, const point &b) {\n\treturn abs(a - b);\n}\nstruct Line :public vector<point> {\n\tLine(const point &a, const point &b) {\n\t\tpush_back(a); push_back(b);\n\t}\n};\ntypedef vector<Line> Lines;\ndouble cross(const point &a, const point &b) {\n\treturn real(a)*imag(b) - imag(a)*real(b);\n}\ndouble dot(const point &a, const point &b) {\n\treturn real(a)*real(b) + imag(a)*imag(b);\n}\nint ccw(point a, point b, point c) {\n\tb = b - a, c = c - a;\n\tif (cross(b, c)>EPS)return +1;\n\tif (cross(b, c)<-EPS)return -1;\n\tif (dot(b, c)<-EPS)return +2;\n\tif (norm(b)<norm(c))return -2;\n\treturn 0;\n}\n\nbool intersectSP(const Line &s, const point &p) {\n\treturn abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0])<EPS;\n}\nbool isSamePoint(const point &p1, const point &p2) {\n\treturn p1==p2||abs(p1 - p2)<=EPS;\n}\nbool intersectSS(const Line &s, const Line &t) {\n\treturn ccw(s[0], s[1], t[0])*ccw(s[0], s[1], t[1]) <= 0 &&\n\t\tccw(t[0], t[1], s[0])*ccw(t[0], t[1], s[1]) <= 0;\n}\nbool connectSS(const Line &s, const Line &t) {\n\tREP(i, 2)REP(j, 2) {\n\t\tif (isSamePoint(s[i], t[j]))return true;\n\t\t//if (s[i] == t[j])return true;\n\t}\n\treturn false;\n}\npoint crosspoint(const Line &l, const Line &m) {\n\tdouble A = cross(l[1] - l[0], m[1] - m[0]);\n\tdouble B = cross(l[1] - l[0], l[1] - m[0]);\n\tif (abs(A)<EPS&&abs(B)<EPS)return m[0];\n\tif (abs(A)<EPS)assert(false);\n\treturn m[0] + B / A * (m[1] - m[0]);\n}\nstruct Circle {\n\tpoint c; double r;\n\tint id;\n\tCircle(const point &c_, double r_, int id_) :c(c_), r(r_), id(id_) {}\n\tbool contains(const point &p) {\n\t\tif (dist(c, p)<r + EPS)return true;\n\t\telse return false;\n\t}\n};\n\nstruct Polygon :public vector<point> {\n\t//0->OUT,1->ON,2->IN\n\tint contains(const point &p) {\n\t\tbool in = false;\n\t\tint N = this->size();\n\t\tfor (int i = 0; i<N; i++) {\n\t\t\tpoint a = this->at(i) - p;\n\t\t\tpoint b = this->at((i + 1) % N) - p;\n\t\t\tif (imag(a)>imag(b))std::swap(a, b);\n\t\t\tif (imag(a) <= 0 && 0<imag(b))if (cross(a, b)<0)in = !in;\n\t\t\tif (cross(a, b) == 0 && dot(a, b) <= 0)return 1;\n\t\t}\n\t\treturn in ? 2 : 0;\n\t}\n\tvoid print() {\n\t\tif (DEBUG) {\n\t\t\tcerr << \"number of points:\" << this->size() << endl;\n for(int i=0;i<(int)this->size();i++){\n\t\t\t\tcerr << i + 1 << \":\" << this->at(i) << endl;\n\t\t\t}\n\t\t}\n\n\t}\n};\ntypedef vector<Circle> Circles;\nset<int> get_enclosing_circle(const point &p, const Circles &Cs) {\n\tset<int> ret;\n\tfor (auto c : Cs) {\n\t\tif (c.contains(p))ret.insert(c.id);\n\t}\n\treturn ret;\n}\n\nstruct Equiv {\n\tvector<int>links;\n\tEquiv(int n) :links(n) {\n\t\tREP(i, n)links[i] = i;\n\t}\n\tint find(int x) {\n\t\tint xx = links[x];\n\t\tif (xx == x)return x;\n\t\treturn links[x] = find(xx);\n\t}\n\tvoid unify(int x, int y) {\n\t\tint xx = find(x), yy = find(y);\n\t\tif (xx <= yy)links[yy] = xx;\n\t\telse links[xx] = yy;\n\t}\n};\ntypedef vector<Lines> vLines;\nvLines connectedComponent(const Lines &ls) {\n\tvLines ret;\n\tEquiv equiv(ls.size());\n\tREP(i, (int)ls.size()) {\n\t\tREP(j, i) {\n\t\t\tif (connectSS(ls[i], ls[j])) {\n\t\t\t\tequiv.unify(i, j);\n\t\t\t}\n\t\t}\n\t}\n\tREP(i, (int)ls.size()) {\n\t\tif (equiv.find(i) == i) {\n\t\t\tLines newLs;\n\t\t\tnewLs.push_back(ls[i]);\n\t\t\tFOR(j, i + 1, (int)ls.size()) {\n\t\t\t\tif (equiv.find(j) == i)newLs.push_back(ls[j]);\n\t\t\t}\n\t\t\tret.push_back(newLs);\n\t\t}\n\t}\n\treturn ret;\n}\ntypedef pair<double, point>doublePoint;\ntypedef vector<doublePoint>vDoublePoint;\ntypedef map<point, vDoublePoint>adjPoint;\ntypedef vector<point>Points;\n\npoint findNext(const vDoublePoint &vdp, const point &p) {\n\t//隣接点のリスト(偏角ソート済み)から移動前の点を探してその次\n\tint n = vdp.size();\n\tREP(i, n) {\n\t\tif (p == vdp[i].second) {\n\t\t\treturn vdp[(i + 1) % n].second;\n\t\t}\n\t}\n\treturn vdp[0].second;\n}\nbool used[101][101];\nvoid make_polys(point minPoint, vector<Polygon>&polys,adjPoint &aPoint,map<point, int>&p2id,\nmap<int, point>&id2p,int id) {\n\tPolygon ret;\n\tREP(i, id)REP(j, id)used[i][j] = false;\n\tret.push_back(minPoint);\n\tpoint curP = aPoint[minPoint][0].second;\n\tused[p2id[minPoint]][p2id[curP]] = true;\n\tpoint lastP = minPoint;\n\twhile (curP != minPoint) {\n\t\tret.push_back(curP);\n\t\tpoint nextP = findNext(aPoint[curP], lastP);\n\t\tused[p2id[curP]][p2id[nextP]] = true;\n\t\tlastP = curP;\n\t\tcurP = nextP;\n\t}\n\n\t\n\tpolys.push_back(ret);\n\n bool all_used=false;\n\twhile (!all_used) {\n all_used=true;\n\t\tbool found = false;\n\t\tpoint st, nx;\n st={1e9,1e9};\n\t\tREP(i, id) {\n if(found)break;\n\t\t\tfor (auto nxt : aPoint[id2p[i]]) {\n\t\t\t\tif (!used[i][p2id[nxt.second]]) {\n all_used=false;\n\t\t\t\t\tfound = true;\n if(id2p[i]<st){\n st=id2p[i];\n nx=nxt.second;\n }\n\t\t\t\t}\n\t\t\t}\n\t\t}\n if(all_used)break;\n\t\tPolygon res;\n\t\tres.push_back(st);\n\t\tres.push_back(nx);\n\t\tused[p2id[st]][p2id[nx]] = true;\n\t\tpoint cur = nx;\n\t\tpoint las = st;\n\t\twhile (cur != st) {\n\t\t\tvDoublePoint v = aPoint[cur];\n\t\t\tint n = v.size();\n\t\t\tint s_idx = -1;\n\t\t\tbool found = false;\n\t\t\tREP(i, n) {\n\t\t\t\tif (isSamePoint(v[i].second,las)) {\n\t\t\t\t\ts_idx = i; break;\n\t\t\t\t}\n\t\t\t}\n if(s_idx<0){\n cerr<<cur<<endl;\n cerr<<las<<endl;\n }\n assert(s_idx>=0);\n\t\t\tfor (int i = s_idx + 1; i < s_idx + n + 1; i++) {\n\t\t\t\tint idx = i % n;\n\t\t\t\tif (v[idx].second == cur)continue;\n\t\t\t\tint cur_id = p2id[cur];\n\t\t\t\tint nxt_id = p2id[v[idx].second];\n\t\t\t\tif (!used[cur_id][nxt_id]) {\n\t\t\t\t\tfound = true;\n\t\t\t\t\tlas = cur;\n\t\t\t\t\tcur = v[idx].second;\n\t\t\t\t\tused[cur_id][nxt_id] = true;\n\t\t\t\t\tres.push_back(cur);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t//if(!found)break;\n\t\t\tif (cur == st)break;\n\t\t\tif (!found)goto END2;\n\t\t}\n\t\tpolys.push_back(res);\n\tEND2:;\n\t}\n\n}\nvector<Polygon> trace(const Lines &ls) {\n\t//隣接点(偏角付き)のリストを作成\n\tmap<point, vDoublePoint> aPoint;\n\t//頂点に番号を付けて辺の使用を記録\n\tmap<point, int>p2id;\n\tmap<int, point>id2p;\n\tint id = 0;\n\n\tREP(i, (int)ls.size()) {\n\t\tif (!p2id.count(ls[i][0])) {\n\t\t\tp2id[ls[i][0]] = id;\n\t\t\tid2p[id] = ls[i][0];\n\t\t\tid++;\n\t\t}\n\t\tif (!p2id.count(ls[i][1])) {\n\t\t\tp2id[ls[i][1]] = id;\n\t\t\tid2p[id] = ls[i][1];\n\t\t\tid++;\n\t\t}\n\t\taPoint[ls[i][0]].push_back(doublePoint(arg(ls[i][1] - ls[i][0]), ls[i][1]));\n\t\taPoint[ls[i][1]].push_back(doublePoint(arg(ls[i][0] - ls[i][1]), ls[i][0]));\n\t}\n\tvector<point>minPoints;\n REP(i,id)REP(j,id)used[i][j]=false;\n\t//x座標最小の点の計算と隣接点リストのソート\n\tpoint minPoint(INT_MAX, INT_MAX);\n\tadjPoint::iterator it;\n\tfor (it = aPoint.begin(); it != aPoint.end(); ++it) {\n\t\tpoint p = it->first;\n\t\tminPoints.push_back(p);\n\t\tminPoint = min(minPoint, p);\n\t\tvDoublePoint &vdp = it->second;\n\t\tsort(vdp.begin(), vdp.end());\n\t}\n\tvector<Polygon>polys;\n\tmake_polys(minPoint, polys, aPoint, p2id, id2p, id);\n\treturn polys;\n}\nbool intersectCC(const Circle &a, const Circle &b) {\n\tdouble d = dist(a.c, b.c);\n\treturn abs(a.r - b.r)<d + EPS && d - EPS<a.r + b.r;\n}\nbool unuse[101];\nbool canConnect(point p, point q, const Circles &circles) {\n\tset<int> p_enclose = get_enclosing_circle(p, circles);\n\tset<int> q_enclose = get_enclosing_circle(q, circles);\n\tif (p_enclose.size()>2) {\n\t\tcout << p << endl;\n\t\tfor (auto id : p_enclose) {\n\t\t\tcout << circles[id].c << \" \" << circles[id].r << endl;\n\t\t}\n\t}\n\tassert(p_enclose.size() <= 2);\n\tassert(q_enclose.size() <= 2);\n\tif (p_enclose != q_enclose) {\n\t\treturn false;\n\t}\n REP(i,100)unuse[i]=false;\n\tfor (auto id : p_enclose) {\n\t\tunuse[id] = true;\n\t}\n\tint n = circles.size();\n\tvector<Line>segments;\n\tREP(i, n) {\n\t\tif (unuse[i])continue;\n\t\tFOR(j, i, n) {\n\t\t\tif (i == j)continue;\n\t\t\tif (unuse[j])continue;\n\t\t\tif (intersectCC(circles[i], circles[j])) {\n\t\t\t\tsegments.push_back(Line(circles[i].c, circles[j].c));\n\t\t\t}\n\t\t}\n\t}\n\tvLines cc = connectedComponent(segments);\n\tfor (auto ls : cc) {\n\t\tif (ls.size() <= 2)continue;\n\t\tvector<Polygon>polys = trace(ls);\n\t\tfor (auto poly : polys) {\n\t\t\tif (poly.contains(p) != poly.contains(q))return false;\n\t\t}\n\t}\n\n\treturn true;\n}\n\nvoid solve() {\n\tint N, M; cin >> N >> M;\n\t//cerr << N << \" \" << M << endl;\n\tif (N == 0)exit(0);\n\tCircles circles;\n\tREP(i, N) {\n\t\tunuse[i] = false;\n\t\tdouble x, y, r; cin >> x >> y >> r;\n\t\tpoint c(x, y);\n\t\tcircles.push_back({ c,r ,i });\n\t}\n\twhile (M--) {\n\t\tdouble x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2;\n\t\tpoint p(x1, y1), q(x2, y2);\n\t\tif (canConnect(p, q, circles))cout << \"YES\";\n\t\telse cout << \"NO\";\n\t\tif (M)cout << \" \";\n\t\telse cout << endl;\n\t}\n}\nsigned main() {\n\twhile (true)solve();\n}","accuracy":1,"time_ms":110,"memory_kb":3580,"score_of_the_acc":-0.1248,"final_rank":13},{"submission_id":"aoj_1198_4326321","code_snippet":"#include\"bits/stdc++.h\"\nusing namespace std;\n\n#define REP(i,n) for(int i=0;i<(n);i++)\n#define FOR(i,m,n) for(int i=(m);i<(n);i++)\n#define REPR(i,n) for(int i=(n)-1;i>=0;i--)\nconst bool DEBUG = false;\nconst double EPS = 1e-8;\ntypedef complex<double>point;\npoint operator*(const point &p, const double &d) {\n\treturn point(real(p)*d, imag(p)*d);\n}\nnamespace std {\n\tbool operator<(const point &a, const point &b) {\n\t\treturn real(a) != real(b) ? real(a)<real(b) : imag(a)<imag(b);\n\t}\n}\ndouble dist(const point &a, const point &b) {\n\treturn abs(a - b);\n}\nstruct Line :public vector<point> {\n\tLine(const point &a, const point &b) {\n\t\tpush_back(a); push_back(b);\n\t}\n};\ntypedef vector<Line> Lines;\ndouble cross(const point &a, const point &b) {\n\treturn real(a)*imag(b) - imag(a)*real(b);\n}\ndouble dot(const point &a, const point &b) {\n\treturn real(a)*real(b) + imag(a)*imag(b);\n}\nint ccw(point a, point b, point c) {\n\tb = b - a, c = c - a;\n\tif (cross(b, c)>EPS)return +1;\n\tif (cross(b, c)<-EPS)return -1;\n\tif (dot(b, c)<-EPS)return +2;\n\tif (norm(b)<norm(c))return -2;\n\treturn 0;\n}\n\nbool intersectSP(const Line &s, const point &p) {\n\treturn abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0])<EPS;\n}\nbool isSamePoint(const point &p1, const point &p2) {\n\treturn p1==p2||abs(p1 - p2)<=EPS;\n}\nbool intersectSS(const Line &s, const Line &t) {\n\treturn ccw(s[0], s[1], t[0])*ccw(s[0], s[1], t[1]) <= 0 &&\n\t\tccw(t[0], t[1], s[0])*ccw(t[0], t[1], s[1]) <= 0;\n}\nbool connectSS(const Line &s, const Line &t) {\n\tREP(i, 2)REP(j, 2) {\n\t\tif (isSamePoint(s[i], t[j]))return true;\n\t\t//if (s[i] == t[j])return true;\n\t}\n\treturn false;\n}\npoint crosspoint(const Line &l, const Line &m) {\n\tdouble A = cross(l[1] - l[0], m[1] - m[0]);\n\tdouble B = cross(l[1] - l[0], l[1] - m[0]);\n\tif (abs(A)<EPS&&abs(B)<EPS)return m[0];\n\tif (abs(A)<EPS)assert(false);\n\treturn m[0] + B / A * (m[1] - m[0]);\n}\nstruct Circle {\n\tpoint c; double r;\n\tint id;\n\tCircle(const point &c_, double r_, int id_) :c(c_), r(r_), id(id_) {}\n\tbool contains(const point &p) {\n\t\tif (dist(c, p)<r + EPS)return true;\n\t\telse return false;\n\t}\n};\n\nstruct Polygon :public vector<point> {\n\t//0->OUT,1->ON,2->IN\n\tint contains(const point &p) {\n\t\tbool in = false;\n\t\tint N = this->size();\n\t\tfor (int i = 0; i<N; i++) {\n\t\t\tpoint a = this->at(i) - p;\n\t\t\tpoint b = this->at((i + 1) % N) - p;\n\t\t\tif (imag(a)>imag(b))std::swap(a, b);\n\t\t\tif (imag(a) <= 0 && 0<imag(b))if (cross(a, b)<0)in = !in;\n\t\t\tif (cross(a, b) == 0 && dot(a, b) <= 0)return 1;\n\t\t}\n\t\treturn in ? 2 : 0;\n\t}\n\tvoid print() {\n\t\tif (DEBUG) {\n\t\t\tcerr << \"number of points:\" << this->size() << endl;\n for(int i=0;i<(int)this->size();i++){\n\t\t\t\tcerr << i + 1 << \":\" << this->at(i) << endl;\n\t\t\t}\n\t\t}\n\n\t}\n};\ntypedef vector<Circle> Circles;\nset<int> get_enclosing_circle(const point &p, const Circles &Cs) {\n\tset<int> ret;\n\tfor (auto c : Cs) {\n\t\tif (c.contains(p))ret.insert(c.id);\n\t}\n\treturn ret;\n}\n\nstruct Equiv {\n\tvector<int>links;\n\tEquiv(int n) :links(n) {\n\t\tREP(i, n)links[i] = i;\n\t}\n\tint find(int x) {\n\t\tint xx = links[x];\n\t\tif (xx == x)return x;\n\t\treturn links[x] = find(xx);\n\t}\n\tvoid unify(int x, int y) {\n\t\tint xx = find(x), yy = find(y);\n\t\tif (xx <= yy)links[yy] = xx;\n\t\telse links[xx] = yy;\n\t}\n};\ntypedef vector<Lines> vLines;\nvLines connectedComponent(const Lines &ls) {\n\tvLines ret;\n\tEquiv equiv(ls.size());\n\tREP(i, (int)ls.size()) {\n\t\tREP(j, i) {\n\t\t\tif (connectSS(ls[i], ls[j])) {\n\t\t\t\tequiv.unify(i, j);\n\t\t\t}\n\t\t}\n\t}\n\tREP(i, (int)ls.size()) {\n\t\tif (equiv.find(i) == i) {\n\t\t\tLines newLs;\n\t\t\tnewLs.push_back(ls[i]);\n\t\t\tFOR(j, i + 1, (int)ls.size()) {\n\t\t\t\tif (equiv.find(j) == i)newLs.push_back(ls[j]);\n\t\t\t}\n\t\t\tret.push_back(newLs);\n\t\t}\n\t}\n\treturn ret;\n}\ntypedef pair<double, point>doublePoint;\ntypedef vector<doublePoint>vDoublePoint;\ntypedef map<point, vDoublePoint>adjPoint;\ntypedef vector<point>Points;\n\npoint findNext(const vDoublePoint &vdp, const point &p) {\n\t//隣接点のリスト(偏角ソート済み)から移動前の点を探してその次\n\tint n = vdp.size();\n\tREP(i, n) {\n\t\tif (p == vdp[i].second) {\n\t\t\treturn vdp[(i + 1) % n].second;\n\t\t}\n\t}\n\treturn vdp[0].second;\n}\nbool used[101][101];\nvoid make_polys(point minPoint, vector<Polygon>&polys,adjPoint &aPoint,map<point, int>&p2id,\nmap<int, point>&id2p,int id) {\n\tPolygon ret;\n\tREP(i, id)REP(j, id)used[i][j] = false;\n\tret.push_back(minPoint);\n\tpoint curP = aPoint[minPoint][0].second;\n\tused[p2id[minPoint]][p2id[curP]] = true;\n\tpoint lastP = minPoint;\n\twhile (curP != minPoint) {\n\t\tret.push_back(curP);\n\t\tpoint nextP = findNext(aPoint[curP], lastP);\n\t\tused[p2id[curP]][p2id[nextP]] = true;\n\t\tlastP = curP;\n\t\tcurP = nextP;\n\t}\n\t//ret.push_back(minPoint);\n\n\t\n\tpolys.push_back(ret);\n\n bool all_used=false;\n\twhile (!all_used) {\n all_used=true;\n\t\tbool found = false;\n\t\tpoint st, nx;\n st={1e9,1e9};\n\t\tREP(i, id) {\n if(found)break;\n\t\t\tfor (auto nxt : aPoint[id2p[i]]) {\n\t\t\t\tif (!used[i][p2id[nxt.second]]) {\n all_used=false;\n\t\t\t\t\tfound = true;\n if(id2p[i]<st){\n st=id2p[i];\n nx=nxt.second;\n }\n\t\t\t\t}\n\t\t\t}\n\t\t}\n if(all_used)break;\n\t\t//if (!found)break;\n\t\tPolygon res;\n\t\tres.push_back(st);\n\t\tres.push_back(nx);\n\t\tused[p2id[st]][p2id[nx]] = true;\n\t\tpoint cur = nx;\n\t\tpoint las = st;\n\t\twhile (cur != st) {\n\t\t\tvDoublePoint v = aPoint[cur];\n\t\t\tint n = v.size();\n\t\t\tint s_idx = -1;\n\t\t\tbool found = false;\n\t\t\tREP(i, n) {\n\t\t\t\tif (isSamePoint(v[i].second,las)) {\n\t\t\t\t\ts_idx = i; break;\n\t\t\t\t}\n\t\t\t}\n if(s_idx<0){\n cerr<<cur<<endl;\n cerr<<las<<endl;\n }\n assert(s_idx>=0);\n\t\t\tfor (int i = s_idx + 1; i < s_idx + n + 1; i++) {\n\t\t\t\tint idx = i % n;\n\t\t\t\tif (v[idx].second == cur)continue;\n\t\t\t\tint cur_id = p2id[cur];\n\t\t\t\tint nxt_id = p2id[v[idx].second];\n\t\t\t\tif (!used[cur_id][nxt_id]) {\n\t\t\t\t\tfound = true;\n\t\t\t\t\tlas = cur;\n\t\t\t\t\tcur = v[idx].second;\n\t\t\t\t\tused[cur_id][nxt_id] = true;\n\t\t\t\t\tres.push_back(cur);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t//if(!found)break;\n\t\t\tif (cur == st)break;\n\t\t\tif (!found)goto END2;\n\t\t}\n\t\tpolys.push_back(res);\n\tEND2:;\n\t}\n\n}\nvector<Polygon> trace(const Lines &ls) {\n\t//隣接点(偏角付き)のリストを作成\n\tmap<point, vDoublePoint> aPoint;\n\t//頂点に番号を付けて辺の使用を記録\n\tmap<point, int>p2id;\n\tmap<int, point>id2p;\n\tint id = 0;\n\n\tREP(i, (int)ls.size()) {\n\t\tif (!p2id.count(ls[i][0])) {\n\t\t\tp2id[ls[i][0]] = id;\n\t\t\tid2p[id] = ls[i][0];\n\t\t\tid++;\n\t\t}\n\t\tif (!p2id.count(ls[i][1])) {\n\t\t\tp2id[ls[i][1]] = id;\n\t\t\tid2p[id] = ls[i][1];\n\t\t\tid++;\n\t\t}\n\t\taPoint[ls[i][0]].push_back(doublePoint(arg(ls[i][1] - ls[i][0]), ls[i][1]));\n\t\taPoint[ls[i][1]].push_back(doublePoint(arg(ls[i][0] - ls[i][1]), ls[i][0]));\n\t}\n\tvector<point>minPoints;\n REP(i,id)REP(j,id)used[i][j]=false;\n\t//vector<vector<bool>>used(id, vector<bool>(id));\n\t//REP(i,id)used[i][i]=true;\n\t//x座標最小の点の計算と隣接点リストのソート\n\tpoint minPoint(INT_MAX, INT_MAX);\n\tadjPoint::iterator it;\n\tfor (it = aPoint.begin(); it != aPoint.end(); ++it) {\n\t\tpoint p = it->first;\n\t\tminPoints.push_back(p);\n\t\tminPoint = min(minPoint, p);\n\t\tvDoublePoint &vdp = it->second;\n\t\tsort(vdp.begin(), vdp.end());\n\t}\n\tvector<Polygon>polys;\n\t//for (auto minpoint : minPoints) {\n\t//\tmake_polys(minpoint, polys, aPoint, p2id, id2p, id);\n\t//}\n\tmake_polys(minPoint, polys, aPoint, p2id, id2p, id);\n\treturn polys;\n}\nbool intersectCC(const Circle &a, const Circle &b) {\n\tdouble d = dist(a.c, b.c);\n\treturn abs(a.r - b.r)<d + EPS && d - EPS<a.r + b.r;\n}\nbool unuse[101];\nbool canConnect(point p, point q, const Circles &circles) {\n\tset<int> p_enclose = get_enclosing_circle(p, circles);\n\tset<int> q_enclose = get_enclosing_circle(q, circles);\n\tif (p_enclose.size()>2) {\n\t\tcout << p << endl;\n\t\tfor (auto id : p_enclose) {\n\t\t\tcout << circles[id].c << \" \" << circles[id].r << endl;\n\t\t}\n\t}\n\tassert(p_enclose.size() <= 2);\n\tassert(q_enclose.size() <= 2);\n\tif (p_enclose != q_enclose) {\n\t\treturn false;\n\t}\n REP(i,100)unuse[i]=false;\n\tfor (auto id : p_enclose) {\n\t\tunuse[id] = true;\n\t}\n\tint n = circles.size();\n\tvector<Line>segments;\n\tREP(i, n) {\n\t\tif (unuse[i])continue;\n\t\tFOR(j, i, n) {\n\t\t\tif (i == j)continue;\n\t\t\tif (unuse[j])continue;\n\t\t\tif (intersectCC(circles[i], circles[j])) {\n\t\t\t\tsegments.push_back(Line(circles[i].c, circles[j].c));\n\t\t\t}\n\t\t}\n\t}\n\tvLines cc = connectedComponent(segments);\n\tfor (auto ls : cc) {\n\t\tif (ls.size() <= 2)continue;\n\t\tvector<Polygon>polys = trace(ls);\n\t\tfor (auto poly : polys) {\n\t\t\t// for (auto pp : poly) {\n\t\t\t// \tcout << pp << endl;\n\t\t\t// }cout << endl;\n\t\t\tif (poly.contains(p) != poly.contains(q))return false;\n\t\t}\n\t}\n\n\treturn true;\n}\n\nvoid solve() {\n\tint N, M; cin >> N >> M;\n\t//cerr << N << \" \" << M << endl;\n\tif (N == 0)exit(0);\n\tCircles circles;\n\tREP(i, N) {\n\t\tunuse[i] = false;\n\t\tdouble x, y, r; cin >> x >> y >> r;\n\t\tpoint c(x, y);\n\t\tcircles.push_back({ c,r ,i });\n\t}\n\twhile (M--) {\n\t\tdouble x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2;\n\t\tpoint p(x1, y1), q(x2, y2);\n\t\tif (canConnect(p, q, circles))cout << \"YES\";\n\t\telse cout << \"NO\";\n\t\tif (M)cout << \" \";\n\t\telse cout << endl;\n\t}\n}\nsigned main() {\n\twhile (true)solve();\n}","accuracy":1,"time_ms":110,"memory_kb":3584,"score_of_the_acc":-0.1256,"final_rank":14},{"submission_id":"aoj_1198_3616346","code_snippet":"#include<iostream>\n#include<string>\n#include<algorithm>\n#include<vector>\n#include<iomanip>\n#include<math.h>\n#include<complex>\n#include<queue>\n#include<deque>\n#include<stack>\n#include<map>\n#include<set>\n#include<bitset>\n#include<functional>\n#include<assert.h>\n#include<numeric>\nusing namespace std;\n#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )\n#define rep(i,n) REP(i,0,n)\nusing ll = long long;\nconst int inf=1e9+7;\nconst ll longinf=1LL<<60 ;\nconst ll mod=1e9+7 ;\n\nusing ld = double;\nusing Point = complex<ld>;\nconst ld eps = 1e-9;\nconst ld pi = acos(-1.0);\n\nbool eq(ld a, ld b) {\n\treturn (abs(a - b) < eps);\n}\n\nbool cmp(Point x,Point y){\n\tif(eq(x.real(),y.real()))return x.imag()<y.imag();\n\treturn x.real()<y.real();\n}\n\nbool eqq(Point x,Point y){\n\treturn eq(x.real(),y.real())&&eq(x.imag(),y.imag());\n}\n//内積\nld dot(Point a, Point b) {\n\treturn real(conj(a)*b);\n}\n//外積\nld cross(Point a, Point b) {\n\treturn imag(conj(a)*b);\n}\n\n\n//線分\n//直線にするなら十分通い２点を端点とすればよい\nclass Line {\npublic:\n\tPoint a, b;\n};\n//円\nclass Circle {\npublic:\n\tPoint p;\n\tld r;\n};\n//3点の位置関係\nint ccw(Point a, Point b, Point c) {\n\tb -= a; c -= a;\n\tif (cross(b, c) > eps)return 1;//a,b,cが反時計回り\n\tif (cross(b, c) < -eps)return -1;//a,b,cが時計回り\n\tif (dot(b, c) < 0)return 2;//c,a,bの順に一直線\n\tif (norm(b) < norm(c))return -2;//a,b,cの順に一直線\n\treturn 0;//a,c,bの順に一直線\n}\n//2直線の交差判定\nbool isis_ll(Line l, Line m) {\n\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\n}\n//直線と線分の交差判定\nbool isis_ls(Line l, Line s) {\n\treturn (cross(l.b - l.a, s.a - l.a)*cross(l.b - l.a, s.b - l.a) < eps);\n}\n//点が直線上に存在するか\nbool isis_lp(Line l, Point p) {\n\treturn (abs(cross(l.b - p, l.a - p)) < eps);\n}\n//点が線分上に存在するか\nbool isis_sp(Line s, Point p) {\n\treturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\n}\n//線分と線分の交差判定\nbool isis_ss(Line s, Line t) {\n\tif (isis_sp(s, t.a) || isis_sp(s, t.b) || isis_sp(t, s.a) || isis_sp(t, s.b))return true;\n\treturn(cross(s.b - s.a, t.a - s.a)*cross(s.b - s.a, t.b - s.a) < -eps && cross(t.b - t.a, s.a - t.a)*cross(t.b - t.a, s.b - t.a) < -eps);\n}\n//点から直線への垂線の足\nPoint proj(Line l, Point p) {\n\tld t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + t * (l.a - l.b);\n}\n//直線と直線の交点\n//平行な２直線に対しては使うな！！！！\nPoint is_ll(Line s, Line t) {\n\tPoint sv = s.b - s.a; Point tv = t.b - t.a;\n\treturn s.a + sv * cross(tv, t.a - s.a) / cross(tv, sv);\n}\n//直線と点の距離\nld dist_lp(Line l, Point p) {\n\treturn abs(p - proj(l, p));\n}\n//直線と直線の距離\nld dist_ll(Line l, Line m) {\n\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\n}\n//線分と直線の距離\nld dist_ls(Line l, Line s) {\n\treturn isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));\n}\n//線分と点の距離\nld dist_sp(Line s, Point p) {\n\tPoint r = proj(s, p);\n\treturn isis_sp(s, r) ? abs(p - r) : min(abs(p - s.a), abs(p - s.b));\n}\n//線分と線分の距離\nld dist_ss(Line s, Line t) {\n\tif (isis_ss(s, t))return 0;\n\treturn min({ dist_sp(s,t.a),dist_sp(s,t.b),dist_sp(t,s.a),dist_sp(t,s.b) });\n}\n\nbool included(Point p,vector<Point>& pol){\n int n=pol.size();\n ld area=0;\n rep(i,n){\n area+=arg((pol[i]-p)/(pol[(i+1)%n]-p));\n }\n return abs(area) > eps;\n}\n\nvoid solve(int n,int Q){\n Circle c[n];\n Point p[n];\n rep(i,n){\n double x,y,r;\n cin>>x>>y>>r;\n p[i]=Point(x,y);\n c[i]={p[i],r};\n }\n\n vector<int> in(n);\n rep(i,n)rep(j,n){\n if(i==j)continue;\n if(c[i].r>c[j].r+abs(c[i].p-c[j].p))in[j]=true;\n }\n vector<vector<int>> v(n);\n vector<vector<int>> used(n);\n rep(i,n){\n if(in[i])continue;\n rep(j,n){\n if(i==j||in[j])continue;\n if(c[i].r+c[j].r>abs(c[i].p-c[j].p)){\n v[i].push_back(j);\n }\n }\n used[i].resize(v[i].size());\n sort(v[i].begin(),v[i].end(),[&](int x,int y){\n return arg(c[x].p-c[i].p)<arg(c[y].p-c[i].p);\n });\n }\n vector<vector<Point>> pols;\n rep(i,n){\n rep(j,v[i].size()){\n if(used[i][j])continue;\n used[i][j]=true;\n vector<Point> pol;\n int pre=i, cur=v[i][j];\n pol.push_back(p[pre]);\n ld area=cross(p[cur],p[pre]);\n while(cur!=i){\n int nxt;\n rep(k,v[cur].size()){\n if(v[cur][k]==pre){\n used[cur][(k+1)%v[cur].size()]=true;\n nxt=v[cur][(k+1)%v[cur].size()];\n break;\n }\n }\n pre=cur;cur=nxt;\n area+=cross(p[cur],p[pre]);\n pol.push_back(p[pre]);\n }\n if(area>eps)pols.push_back(pol);\n }\n }\n rep(aaa,Q){\n Point q[2];\n rep(i,2){\n int x,y;\n cin>>x>>y;\n q[i]=Point(x,y);\n }\n vector<int> inc[2];\n rep(i,2){\n rep(j,n){\n if(abs(q[i]-p[j])<c[j].r)inc[i].push_back(j);\n }\n }\n if(inc[0]!=inc[1]){\n cout<<\"NO\";\n if(aaa!=Q-1)cout<<\" \";\n continue;\n }\n if(inc[0].size()&&inc[0]==inc[1]){\n cout<<\"YES\";\n if(aaa!=Q-1)cout<<\" \";\n continue;\n }\n rep(i,2){\n rep(j,pols.size()){\n if(included(q[i],pols[j]))inc[i].push_back(j);\n }\n }\n if(inc[0]==inc[1])cout<<\"YES\";\n else cout<<\"NO\";\n if(aaa!=Q-1)cout<<\" \";\n }\n cout<<endl;\n\n}\nint main(){\n int n,q;\n while(cin>>n>>q,n!=0)solve(n,q);\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3564,"score_of_the_acc":-0.0598,"final_rank":8},{"submission_id":"aoj_1198_3219839","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n#define dbg(x) cout<<#x\" = \"<<((x))<<endl\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\"(\"<<p.fi<<\",\"<<p.se<<\")\";return o;}\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\"[\";for(T t:v){o<<t<<\",\";}o<<\"]\";return o;}\n\n/* 基本要素 */\ntypedef complex<double> Point;\ntypedef pair<Point, Point> Line;\ntypedef vector<Point> VP;\nconst double PI = acos(-1);\nconst double EPS = 1e-8; // 許容誤差^2\nconst double INF = 1e9;\n#define X real()\n#define Y imag()\n// #define LE(n,m) ((n) < (m) + EPS)\n#define LE(n,m) ((n) - (m) < EPS)\n// #define GE(n,m) ((n) + EPS > (m))\n#define GE(n,m) (EPS > (m) - (n))\n#define EQ(n,m) (abs((n)-(m)) < EPS)\n\n// 頂点の順序（sortやmax_elementに必要）\nnamespace std {\n bool operator<(const Point a, const Point b) {\n return a.X != b.X ? a.X < b.X : a.Y < b.Y;\n }\n}\n\n// 内積 dot(a,b) = |a||b|cosθ\ndouble dot(Point a, Point b) {\n return a.X*b.X + a.Y*b.Y;\n}\n\n// 外積 cross(a,b) = |a||b|sinθ\ndouble cross(Point a, Point b) {\n return a.X*b.Y - a.Y*b.X;\n}\n\n// 点の進行方向\n// !!! 誤差に注意 !!! (掛け算したものとかなり小さいものを比べているので)\nint ccw(Point a, Point b, Point c) {\n b -= a; c -= a;\n if (cross(b,c) > EPS) return +1; // counter clockwise\n if (cross(b,c) < -EPS) return -1; // clockwise\n if (dot(b,c) < -EPS) return +2; // c--a--b on line\n if (norm(b) < norm(c)) return -2; // a--b--c on line or a==b\n return 0; // a--c--b on line or a==c or b==c\n}\n\n// 多角形の内部判定\n// 点が領域内部なら1、境界上なら2、外部なら0を返す\nint inPolygon(const VP& ps, Point p) {\n int n = ps.size();\n bool in = false;\n rep (i, n) {\n Point a = ps[i] - p;\n Point b = ps[(i + 1) % n] - p;\n if (EQ(cross(a,b), 0) && LE(dot(a,b), 0)) return 2;\n if (a.Y > b.Y) swap(a,b);\n if ((a.Y*b.Y < 0 || (a.Y*b.Y < EPS && b.Y > EPS)) && LE(cross(a, b), 0)) in = !in;\n }\n return in;\n}\n\n\nPoint READ(){\n int x,y;\n cin >>x >>y;\n return Point(x,y);\n}\n\nint main(){\n int n,m;\n while(cin >>n >>m,n){\n VP c(n);\n vector<double> r(n);\n rep(i,n){\n c[i] = READ();\n cin >>r[i];\n }\n\n auto isecCC = [&](int a, int b){\n if(r[a] > r[b]) swap(a,b);\n double d = abs(c[a] - c[b]);\n\n if( r[a]+r[b] < d+EPS ) return false;\n if( d+r[a] < r[b]+EPS ) return false;\n return true;\n };\n\n using D = pair<double,int>;\n vector<vector<D>> g(n);\n rep(i,n){\n rep(j,n)if(j!=i && isecCC(i,j)){\n Point pp = c[j] - c[i];\n double theta = atan2(pp.Y,pp.X);\n g[i].pb({theta,j});\n }\n sort(all(g[i]));\n // dbg(g[i]);\n }\n\n // 領域\n vector<VP> pls;\n\n // (円i, 次に向かう方向)\n vector<vector<bool>> vis(n);\n rep(i,n) vis[i] = vector<bool>(g[i].size());\n\n using pi = pair<int,int>;\n rep(i,n){\n int GG = g[i].size();\n if(GG==0) continue;\n rep(ii,GG){\n if(vis[i][ii]) continue;\n\n queue<pi> que;\n stack<int> c_idx;\n vector<bool> in(n);\n\n in[i] = true;\n c_idx.push(i);\n vis[i][ii] = true;\n que.push({i,ii});\n while(!que.empty()){\n pi cur = que.front();\n que.pop();\n\n // dbg(cur);\n\n int idx = cur.fi;\n int dir = cur.se;\n\n int nidx = g[idx][dir].se;\n int ndir = -1;\n int sz = g[nidx].size();\n rep(j,sz){\n if(g[nidx][j].se == idx){\n ndir = (j+1)%sz;\n break;\n }\n }\n\n assert(ndir >= 0);\n if(!vis[nidx][ndir]){\n if(in[nidx]){\n VP poly;\n while(in[nidx]){\n assert(!c_idx.empty());\n int st_idx = c_idx.top();\n c_idx.pop();\n\n in[st_idx] = false;\n poly.pb(c[st_idx]);\n }\n\n pls.pb(poly);\n }\n\n in[nidx] = true;\n c_idx.push(nidx);\n vis[nidx][ndir] = true;\n que.push({nidx,ndir});\n }\n }\n\n VP poly;\n while(!c_idx.empty()){\n int st_idx = c_idx.top();\n c_idx.pop();\n\n in[st_idx] = false;\n poly.pb(c[st_idx]);\n }\n pls.pb(poly);\n }\n }\n\n // for(VP poly:pls) dbg(poly);\n\n auto IN = [&](int idx, Point p){\n double d = abs(p - c[idx]);\n return d < r[idx];\n };\n\n vector<bool> ans(m,true);\n rep(i,m){\n Point start = READ(), goal = READ();\n bool flg = false;\n rep(j,n){\n if(IN(j,start) || IN(j,goal)) flg = true;\n if( IN(j,start) != IN(j,goal) ) ans[i] = false;\n }\n\n if(!flg){\n for(VP poly:pls)if(poly.size()>=3){\n int vs = inPolygon(poly, start);\n int vg = inPolygon(poly, goal);\n if( vs != vg ) ans[i] = false;\n }\n }\n }\n\n rep(i,m){\n if(i) cout << \" \";\n cout << (ans[i]?\"YES\":\"NO\");\n }\n cout << \"\\n\";\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3492,"score_of_the_acc":-0.0395,"final_rank":4},{"submission_id":"aoj_1198_3001798","code_snippet":"#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\nusing ld = long double;\nconst ld eps = 1e-9;\n\n\n/* 幾何の基本 */\n\n#include <complex>\n\ntypedef complex<ld> Point;\n\n\nconst ld pi = acos(-1.0);\nconst ld dtop = pi / 180.;\nconst ld ptod = 1. / dtop;\n\nnamespace std {\n\tbool operator<(const Point &lhs, const Point &rhs) {\n\t\tif (lhs.real() < rhs.real() - eps) return true;\n\t\tif (lhs.real() > rhs.real() + eps) return false;\n\t\treturn lhs.imag() < rhs.imag();\n\t}\n}\n\n// 点の入力\nPoint input_Point() {\n\tld x, y;\n\tcin >> x >> y;\n\treturn Point(x, y);\n}\n\n// 誤差つき等号判定\nbool eq(const ld a, const ld b) {\n\treturn (abs(a - b) < eps);\n}\n\n// 内積\nld dot(const Point& a, const Point& b) {\n\treturn real(conj(a) * b);\n}\n\n// 外積\nld cross(const Point& a, const Point& b) {\n\treturn imag(conj(a) * b);\n}\n\n// 直線の定義\nclass Line {\npublic:\n\tPoint a, b;\n\tLine() : a(Point(0, 0)), b(Point(0, 0)) {}\n\tLine(Point a, Point b) : a(a), b(b) {}\n\tPoint operator[](const int _num)const {\n\t\tif (_num == 0)return a;\n\t\telse if (_num == 1)return b;\n\t\telse {\n\t\t\tassert(false);\n\t\t\treturn Point();\n\t\t}\n\t}\n};\n\n// 円の定義\nclass Circle {\npublic:\n\tPoint p;\n\tld r;\n\tCircle() : p(Point(0, 0)), r(0) {}\n\tCircle(Point p, ld r) : p(p), r(r) {}\n};\n\n// ccw\n// 1: a,b,cが反時計周りの順に並ぶ\n//-1: a,b,cが時計周りの順に並ぶ\n// 2: c,a,bの順に直線に並ぶ\n//-2: a,b,cの順に直線に並ぶ\n// 0: a,c,bの順に直線に並ぶ\nint ccw(const Point& a, const Point &b, const Point &c) {\n\tconst Point nb(b - a);\n\tconst Point nc(c - a);\n\tif (cross(nb, nc) > eps) return 1; // a,b,cが反時計周りの順に並ぶ\n\tif (cross(nb, nc) < -eps) return -1; // a,b,cが時計周りの順に並ぶ\n\tif (dot(nb, nc) < 0) return 2; // c,a,bの順に直線に並ぶ\n\tif (norm(nb) < norm(nc)) return -2; // a,b,cの順に直線に並ぶ\n\treturn 0; // a,c,bの順に直線に並ぶ\n}\n\n\n/* 交差判定 */\n\n// 直線と直線の交差判定\nbool isis_ll(const Line& l, const Line& m) {\n\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\n}\n\n// 直線と線分の交差判定\nbool isis_ls(const Line& l, const Line& s) {\n\treturn isis_ll(l, s) &&\n\t\t(cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < eps);\n}\n\n// 線分と線分の交差判定\nbool isis_ss(const Line& s, const Line& t) {\n\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\n\t\tccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\n}\n\n// 点の直線上判定\nbool isis_lp(const Line& l, const Point& p) {\n\treturn (abs(cross(l.b - p, l.a - p)) < eps);\n}\n\n// 点の線分上判定\nbool isis_sp(const Line& s, const Point& p) {\n\treturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\n}\n\n// 垂線の足\nPoint proj(const Line &l, const Point& p) {\n\tld t = dot(p - l.a, l.b - l.a) / norm(l.a - l.b);\n\treturn l.a + t * (l.b - l.a);\n}\n\n//線対象の位置にある点\nPoint reflect(const Line &l, const Point &p) {\n\tPoint pr = proj(l, p);\n\treturn pr * 2.l - p;\n}\n\n// 直線と直線の交点\nPoint is_ll(const Line &s, const Line& t) {\n\tPoint sv = s.b - s.a, tv = t.b - t.a;\n\tassert(cross(sv, tv) != 0);\n\treturn s.a + sv * cross(tv, t.a - s.a) / cross(tv, sv);\n}\n// 直線と直線の交点\nvector<Point> is_ll2(const Line &s, const Line& t) {\n\tPoint sv = s.b - s.a, tv = t.b - t.a;\n\tif (cross(sv, tv) != 0)return vector<Point>(1, is_ll(s, t));\n\telse {\n\t\tvector<Point>ans;\n\t\tfor (int k = 0; k < 2; ++k) {\n\t\t\tif (isis_sp(s, t[k]) && find(ans.begin(), ans.end(), t[k]) == ans.end())ans.push_back(t[k]);\n\t\t\tif (isis_sp(t, s[k]) && find(ans.begin(), ans.end(), s[k]) == ans.end())ans.push_back(s[k]);\n\t\t}\n\t\treturn ans;\n\t}\n}\n// 線分と線分の交点\n// 重なってる部分あるとassert(false)\nPoint is_ss(const Line &s, const Line& t) {\n\tif (isis_ss(s, t)) {\n\t\tfor (int k = 0; k < 2; ++k) {\n\t\t\tfor (int l = 0; l < 2; ++l) {\n\t\t\t\tif (s[k] == t[l])return s[k];\n\t\t\t}\n\t\t}\n\t\treturn is_ll(s, t);\n\t}\n\telse {\n\t\t//先にisis_ssしてね\n\t\tassert(false);\n\t\treturn Point(0, 0);\n\t}\n}\n// 線分と線分の交点\nvector<Point> is_ss2(const Line &s, const Line& t) {\n\tvector<Point> kouho(is_ll2(s, t));\n\tvector<Point>ans;\n\tfor (auto p : kouho) {\n\t\tif (isis_sp(s, p) && isis_sp(t, p))ans.emplace_back(p);\n\t}\n\treturn ans;\n}\n// 直線と点の距離\nld dist_lp(const Line& l, const Point& p) {\n\treturn abs(p - proj(l, p));\n}\n\n//直線と直線の距離\nld dist_ll(const Line& l, const Line& m) {\n\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\n}\n\n// 直線と線分の距離\nld dist_ls(const Line& l, const Line& s) {\n\treturn isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));\n}\n\n// 線分と点の距離\nld dist_sp(const Line& s, const Point& p) {\n\tPoint r = proj(s, p);\n\treturn isis_sp(s, r) ? abs(r - p) : min(abs(s.a - p), abs(s.b - p));\n}\n\n// 線分と線分の距離\nld dist_ss(const Line& s, const Line& t) {\n\tif (isis_ss(s, t)) return 0;\n\treturn min({ dist_sp(s, t.a), dist_sp(s, t.b), dist_sp(t, s.a), dist_sp(t, s.b) });\n}\n\n\n//直線と直線の二等分線のベクトル\nLine line_bisection(const Line &s, const Line &t) {\n\tconst Point laglanju(is_ll(s, t));\n\tconst Point avec = !(abs(laglanju - s[0])<eps) ? s[0] - laglanju : s[1] - laglanju;\n\tconst Point bvec = !(abs(laglanju - t[0])<eps) ? t[0] - laglanju : t[1] - laglanju;\n\n\treturn Line(laglanju, laglanju + (abs(bvec)*avec + abs(avec)*bvec) / (abs(avec) + abs(bvec)));\n}\n//点と点の垂直二等分線 aを左に見ながら\nLine point_bisection(const Point&a, const Point&b) {\n\tconst Point cen((a + b) / 2.l);\n\tconst Point vec = (b - a)*Point(0, 1);\n\treturn Line(cen, cen + vec);\n}\n\n//三つの点からなる外心\nPoint outer_center(const vector<Point>&ps) {\n\tassert(ps.size() == 3);\n\tLine l1 = point_bisection(ps[0], ps[1]);\n\tLine l2 = point_bisection(ps[1], ps[2]);\n\treturn is_ll(l1, l2);\n}\n\n\n//三つの直線からなる内心\n//三つの直線が並行でないことは確かめといてね\nPoint inner_center(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tfor (int i = 0; i <static_cast<int>(ls.size()); ++i) {\n\t\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\n\t}\n\tif (vertics[0] == vertics[1] || vertics[1] == vertics[2] || vertics[2] == vertics[0])return vertics[0];\n\tLine bi1(line_bisection(Line(vertics[0], vertics[1]), Line(vertics[0], vertics[2])));\n\tLine bi2(line_bisection(Line(vertics[1], vertics[2]), Line(vertics[1], vertics[0])));\n\tif (bi1[0] == bi2[0])return bi1[0];\n\telse {\n\t\treturn is_ll(bi1, bi2);\n\t}\n}\n\n//三つの直線からなる傍心\n//三つの直線が並行でないことは確かめといてね\nvector<Point> ex_center(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tfor (int i = 0; i < static_cast<int>(ls.size()); ++i) {\n\t\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\n\t}\n\tif (abs(vertics[0] - vertics[1])<eps || abs(vertics[1] - vertics[2])<eps || (abs(vertics[2] - vertics[0])<eps))return vector<Point>();\n\tvector<Point>ecs;\n\tfor (int i = 0; i < 3; ++i) {\n\t\tLine bi1(line_bisection(Line(vertics[i], vertics[i] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[i], vertics[(i + 1) % 3])));\n\t\tLine bi2(line_bisection(Line(vertics[(i + 1) % 3], vertics[(i + 1) % 3] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[(i + 1) % 3], vertics[i])));\n\t\tecs.push_back(is_ll(bi1, bi2));\n\t}\n\treturn ecs;\n}\n\n\n//a,b:並行\n//c:並行でない\n//三つの直線から同距離の位置を求める。\nvector<Point> same_dis(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tvertics.push_back(is_ll(ls[0], ls[2]));\n\tvertics.push_back(is_ll(ls[1], ls[2]));\n\n\tif (abs(vertics[0] - vertics[1]) < eps)return vector<Point>{vertics[0]};\n\tLine bis(line_bisection(ls[0], ls[1]));\n\tvector<Point>ecs;\n\n\tLine abi(line_bisection(Line(vertics[0], vertics[1]), ls[0]));\n\tecs.push_back(is_ll(bis, abi));\n\n\n\tLine bbi(line_bisection(Line(vertics[0], 2.l*vertics[0] - vertics[1]), ls[0]));\n\tecs.push_back(is_ll(bis, bbi));\n\n\treturn ecs;\n}\n/* 円 */\n\n// 円と円の交点\nvector<Point> is_cc(const Circle& c1, const Circle& c2) {\n\tvector<Point> res;\n\tld d = abs(c1.p - c2.p);\n\tld rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\n\tld dfr = c1.r * c1.r - rc * rc;\n\tif (abs(dfr) < eps) dfr = 0.0;\n\telse if (dfr < 0.0) return res; // no intersection\n\tld rs = sqrt(dfr);\n\tPoint diff = (c2.p - c1.p) / d;\n\tres.push_back(c1.p + diff * Point(rc, rs));\n\tif (dfr != 0.0) res.push_back(c1.p + diff * Point(rc, -rs));\n\treturn res;\n}\n\n/*\n点が円の中にいるか\n0 => out\n1 => on\n2 => in*/\nint is_in_Circle(const Point& p, const Circle &cir) {\n\tld dis = abs(cir.p - p);\n\tif (dis > cir.r + eps)return 0;\n\telse if (dis < cir.r - eps)return 2;\n\telse return 1;\n}\nint is_in_Circle(const Circle &cir, const Point& p) {\n\tld dis = abs(cir.p - p);\n\tif (dis > cir.r + eps)return 0;\n\telse if (dis < cir.r - eps)return 2;\n\telse return 1;\n}\n/*\n円lcが円rcの中にいるか\n0 => out\n1 => on\n2 => in*/\nint Circle_in_Circle(const Circle &lc, const Circle&rc) {\n\tld dis = abs(lc.p - rc.p);\n\tif (dis < rc.r - lc.r - eps)return 2;\n\telse if (dis>rc.r - lc.r + eps)return 0;\n\telse return 1;\n}\n\n// 円と直線の交点\nvector<Point> is_lc(const Circle& c, const Line& l) {\n\tvector<Point> res;\n\tld d = dist_lp(l, c.p);\n\tif (d < c.r + eps) {\n\t\tld len = (d > c.r) ? 0.0 : sqrt(c.r * c.r - d * d); //safety;\n\t\tPoint nor = (l.a - l.b) / abs(l.a - l.b);\n\t\tres.push_back(proj(l, c.p) + len * nor);\n\t\tres.push_back(proj(l, c.p) - len * nor);\n\t}\n\treturn res;\n}\n\n// 円と線分の距離\nvector<Point> is_sc(const Circle& c, const Line& l) {\n\tvector<Point> v = is_lc(c, l), res;\n\tfor (Point p : v)\n\t\tif (isis_sp(l, p)) res.push_back(p);\n\treturn res;\n}\n\n// 円と点の接線\nvector<Line> tangent_cp(const Circle& c, const Point& p) {\n\tvector<Line> ret;\n\tPoint v = c.p - p;\n\tld d = abs(v);\n\tld l = sqrt(norm(v) - c.r * c.r);\n\tif (isnan(l)) { return ret; }\n\tPoint v1 = v * Point(l / d, c.r / d);\n\tPoint v2 = v * Point(l / d, -c.r / d);\n\tret.push_back(Line(p, p + v1));\n\tif (l < eps) return ret;\n\tret.push_back(Line(p, p + v2));\n\treturn ret;\n}\n\n// 円と円の接線\nvector<Line> tangent_cc(const Circle& c1, const Circle& c2) {\n\tvector<Line> ret;\n\tif (abs(c1.p - c2.p) - (c1.r + c2.r) > -eps) {\n\t\tPoint center = (c1.p * c2.r + c2.p * c1.r) / (c1.r + c2.r);\n\t\tret = tangent_cp(c1, center);\n\t}\n\tif (abs(c1.r - c2.r) > eps) {\n\t\tPoint out = (-c1.p * c2.r + c2.p * c1.r) / (c1.r - c2.r);\n\t\tvector<Line> nret = tangent_cp(c1, out);\n\t\tret.insert(ret.end(), nret.begin(), nret.end());\n\t}\n\telse {\n\t\tPoint v = c2.p - c1.p;\n\t\tv /= abs(v);\n\t\tPoint q1 = c1.p + v * Point(0, 1) * c1.r;\n\t\tPoint q2 = c1.p + v * Point(0, -1) * c1.r;\n\t\tret.push_back(Line(q1, q1 + v));\n\t\tret.push_back(Line(q2, q2 + v));\n\t}\n\treturn ret;\n}\n//二つの円の重なり面積\nld two_Circle_area(const Circle&l, const Circle&r) {\n\tld dis = abs(l.p - r.p);\n\tif (dis > l.r + r.r)return 0;\n\telse if (dis + r.r < l.r) {\n\t\treturn r.r*r.r*pi;\n\t}\n\telse if (dis + l.r < r.r) {\n\t\treturn l.r*l.r*pi;\n\t}\n\telse {\n\t\tld ans = (l.r)*(l.r)*acos((dis*dis + l.r*l.r - r.r*r.r) / (2 * dis*l.r)) +\n\t\t\t(r.r)*(r.r)*acos((dis*dis + r.r*r.r - l.r*l.r) / (2 * dis*r.r)) -\n\t\t\tsqrt(4 * dis*dis*l.r*l.r - (dis*dis + l.r*l.r - r.r*r.r)*(dis*dis + l.r*l.r - r.r*r.r)) / 2;\n\t\treturn ans;\n\t}\n\n}\n\n/* 多角形 */\n\ntypedef vector<Point> Polygon;\n\n\n// 面積\nld get_area(const Polygon &p) {\n\tld res = 0;\n\tint n = p.size();\n\tfor (int j = 0; j<n; ++j) res += cross(p[j], p[(j + 1) % n]);\n\treturn res / 2;\n}\n\n// 円の内外判定\n/*0 => out\n1 => on\n2 => in*/\nint convex_contains(const Polygon &poly, const Point& p) {\n\tld angle = 0;\n\tint n = poly.size();\n\tfor(int i=0;i<n;++i) {\n\t\tPoint a = poly[i], b = poly[(i + 1) % n];\n\t\tif (isis_sp(Line(a, b), p)) return 1;\n\t\tangle += arg((b - p) / (a - p));\n\t}\n\treturn eq(angle, 0) ? 0 : 2;\n}\n\n\nstruct Edge {\n\tint src;\n\tint dest;\n};\nusing Graph=vector<vector<Edge>>;\n\n//線分アレンジメント後に、\n//閉路の面積の和を求める。\nvoid dfs(set<pair<int,int>>&real_set,set<pair<int ,int>>&aset,const int now, const int from, vector<int>&prevs, vector<Polygon>&ans_polys, const vector<Point>&ps, const Graph&g) {\n\tvector<pair<ld, int>>next_points;\n\n\tPoint from_p = from == -1 ? ps[now] + Point(-3e6, 1) : ps[from];\n\tPoint now_p = ps[now];\n\tfor (auto e : g[now]) {\n\t\tif (e.dest == from)continue;\n\t\tPoint next_p = ps[e.dest];\n\n\t\tld costheta = dot(from_p - now_p, next_p - now_p) / (abs(from_p - now_p)*abs(next_p - now_p));\n\t\tcostheta *= 0.3;\n\t\tld d = acos(costheta);\n\t\tif (ccw(from_p, now_p, next_p) != 1) {\n\t\t\td = 2 * pi - d;\n\t\t}\n\t\tnext_points.push_back(make_pair(d, e.dest));\n\t}\n\tsort(next_points.begin(), next_points.end());\n\n\tfor (auto n_p : next_points) {\n\t\tif (aset.find(make_pair(now, n_p.second))!=aset.end()) {\n\t\t\tcontinue;\n\t\t}\n\t\telse {\n\t\t\tif (real_set.find(make_pair(now, n_p.second)) != real_set.end()) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\taset.emplace(now,n_p.second);\n\t\t}\n\n\t\tif (prevs[n_p.second] != -1) {\n\t\t\tint k=now;\n\t\t\tPolygon poly(1,ps[k]);\n\t\t\treal_set.emplace(k,n_p.second);\n\t\t\twhile (k != n_p.second) {\n\t\t\t\tint a = k;\n\t\t\t\tk=prevs[k];\n\t\t\t\treal_set.emplace(k,a);\n\t\t\t\tpoly.push_back(ps[k]);\n\t\t\t}\n\t\t\t\n\t\t\tld plus = get_area(poly);\n\t\t\tif (plus<eps) {\n\t\t\t\treverse(poly.begin(),poly.end());\n\t\t\t\tans_polys.push_back(poly);\n\t\t\t}\n\t\t\tthrow(false);\n\t\t}\n\t\telse {\n\n\t\t\tprevs[n_p.second] = now;\n\t\t\tdfs(real_set,aset, n_p.second, now, prevs, ans_polys, ps, g);\n\t\t\tprevs[n_p.second] = -1;\n\t\t}\n\n\t}\n\treturn ;\n}\n\nint main() {\n\tint t=0;\n\twhile (true) {\n\t\tint N,M;cin>>N>>M;\n\t\tt++;\n\n\t\tif(!N)break;\n\t\tvector<Circle>cs;\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tint x,y,r;cin>>x>>y>>r;\n\t\t\tcs.push_back(Circle(Point(x,y),r));\n\t\t}\n\t\tvector<vector<Edge>>edges(N);\n\t\tGraph g(N);\n\t\tint sum=0;\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tfor (int j = i + 1; j < N; ++j) {\n\t\t\t\t\n\t\t\t\tld dis=abs(cs[i].p-cs[j].p);\n\t\t\t\tif (Circle_in_Circle(cs[i], cs[j])<=1&&Circle_in_Circle(cs[j],cs[i])<=1&&dis<cs[i].r+cs[j].r) {\n\t\t\t\t\tedges[i].push_back(Edge{ i,j });\n\t\t\t\t\tedges[j].push_back(Edge{ j,i });\n\t\t\t\t\tsum++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tvector<Point>ps(N);\n\t\tfor(int i=0;i<N;++i)ps[i]=cs[i].p;\n\n\t\tvector<Polygon>polys;\n\t\tset<pair<int,int>>aset;\n\n\t\tfor(int i=0;i<N;++i) {\n\t\t\tfor (int j = 0; j < edges[i].size();++j) {\n\t\t\t\tif (aset.find(make_pair(i, j)) == aset.end()) {\n\t\t\t\t\ttry {\n\t\t\t\t\t\tvector<int>prevs(N, -1);\n\t\t\t\t\t\tprevs[i] = -2;\n\t\t\t\t\t\tset<pair<int,int>>nset;\n\t\t\t\t\t\tdfs(aset,nset, i, -1, prevs, polys, ps, edges);\n\t\t\t\t\t}\n\t\t\t\t\tcatch (...) {\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor (int i = 0; i < M; ++i) {\n\t\t\tvector<Point>query_points;\n\t\t\t{\n\t\t\t\tint a,b,c,d;cin>>a>>b>>c>>d;\n\t\t\t\tPoint p,q;\n\t\t\t\tp=Point(a,b);\n\t\t\t\tq=Point(c,d);\n\t\t\t\tquery_points = vector<Point>{ p,q };\n\t\t\t}\n\t\t\tvector<vector<int>>in_circles(2);\n\t\t\tfor (int j = 0; j < 2; ++j) {\n\t\t\t\tfor (int k = 0; k < N; ++k) {\n\t\t\t\t\tif (is_in_Circle(cs[k], query_points[j])) {\n\t\t\t\t\t\tin_circles[j].push_back(true);\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tin_circles[j].push_back(false);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tbool ok;\n\t\t\tif (in_circles[0] != in_circles[1]) {\n\t\t\t\tok=false;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (all_of(in_circles[0].begin(), in_circles[0].end(), [](const int a) {return a == 0; })) {\n\t\t\t\t\tvector<vector<int>>in_polygons(2,vector<int>(polys.size()));\n\t\t\t\t\tfor (int j = 0; j < 2; ++j) {\n\t\t\t\t\t\tfor (int k = 0; k < polys.size(); ++k) {\n\t\t\t\t\t\t\tif (convex_contains(polys[k], query_points[j])) {\n\t\t\t\t\t\t\t\tin_polygons[j][k] = true;\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\tif (in_polygons[0] == in_polygons[1]) {\n\t\t\t\t\t\tok=true;\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tok=false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tok=true;\n\t\t\t\t}\n\n\t\t\t}\n\t\t\tif(ok)cout<<\"YES\";\n\t\t\telse cout<<\"NO\";\n\t\t\tif(i==M-1)cout<<endl;\n\t\t\telse cout<<\" \";\n\t\t\t\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":60,"memory_kb":3280,"score_of_the_acc":-0.0345,"final_rank":1},{"submission_id":"aoj_1198_3001762","code_snippet":"#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\nusing ld = long double;\nconst ld eps = 1e-9;\n\n\n/* 幾何の基本 */\n\n#include <complex>\n\ntypedef complex<ld> Point;\n\n\nconst ld pi = acos(-1.0);\nconst ld dtop = pi / 180.;\nconst ld ptod = 1. / dtop;\n\nnamespace std {\n\tbool operator<(const Point &lhs, const Point &rhs) {\n\t\tif (lhs.real() < rhs.real() - eps) return true;\n\t\tif (lhs.real() > rhs.real() + eps) return false;\n\t\treturn lhs.imag() < rhs.imag();\n\t}\n}\n\n// 点の入力\nPoint input_Point() {\n\tld x, y;\n\tcin >> x >> y;\n\treturn Point(x, y);\n}\n\n// 誤差つき等号判定\nbool eq(const ld a, const ld b) {\n\treturn (abs(a - b) < eps);\n}\n\n// 内積\nld dot(const Point& a, const Point& b) {\n\treturn real(conj(a) * b);\n}\n\n// 外積\nld cross(const Point& a, const Point& b) {\n\treturn imag(conj(a) * b);\n}\n\n// 直線の定義\nclass Line {\npublic:\n\tPoint a, b;\n\tLine() : a(Point(0, 0)), b(Point(0, 0)) {}\n\tLine(Point a, Point b) : a(a), b(b) {}\n\tPoint operator[](const int _num)const {\n\t\tif (_num == 0)return a;\n\t\telse if (_num == 1)return b;\n\t\telse {\n\t\t\tassert(false);\n\t\t\treturn Point();\n\t\t}\n\t}\n};\n\n// 円の定義\nclass Circle {\npublic:\n\tPoint p;\n\tld r;\n\tCircle() : p(Point(0, 0)), r(0) {}\n\tCircle(Point p, ld r) : p(p), r(r) {}\n};\n\n// ccw\n// 1: a,b,cが反時計周りの順に並ぶ\n//-1: a,b,cが時計周りの順に並ぶ\n// 2: c,a,bの順に直線に並ぶ\n//-2: a,b,cの順に直線に並ぶ\n// 0: a,c,bの順に直線に並ぶ\nint ccw(const Point& a, const Point &b, const Point &c) {\n\tconst Point nb(b - a);\n\tconst Point nc(c - a);\n\tif (cross(nb, nc) > eps) return 1; // a,b,cが反時計周りの順に並ぶ\n\tif (cross(nb, nc) < -eps) return -1; // a,b,cが時計周りの順に並ぶ\n\tif (dot(nb, nc) < 0) return 2; // c,a,bの順に直線に並ぶ\n\tif (norm(nb) < norm(nc)) return -2; // a,b,cの順に直線に並ぶ\n\treturn 0; // a,c,bの順に直線に並ぶ\n}\n\n\n/* 交差判定 */\n\n// 直線と直線の交差判定\nbool isis_ll(const Line& l, const Line& m) {\n\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\n}\n\n// 直線と線分の交差判定\nbool isis_ls(const Line& l, const Line& s) {\n\treturn isis_ll(l, s) &&\n\t\t(cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < eps);\n}\n\n// 線分と線分の交差判定\nbool isis_ss(const Line& s, const Line& t) {\n\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\n\t\tccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\n}\n\n// 点の直線上判定\nbool isis_lp(const Line& l, const Point& p) {\n\treturn (abs(cross(l.b - p, l.a - p)) < eps);\n}\n\n// 点の線分上判定\nbool isis_sp(const Line& s, const Point& p) {\n\treturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\n}\n\n// 垂線の足\nPoint proj(const Line &l, const Point& p) {\n\tld t = dot(p - l.a, l.b - l.a) / norm(l.a - l.b);\n\treturn l.a + t * (l.b - l.a);\n}\n\n//線対象の位置にある点\nPoint reflect(const Line &l, const Point &p) {\n\tPoint pr = proj(l, p);\n\treturn pr * 2.l - p;\n}\n\n// 直線と直線の交点\nPoint is_ll(const Line &s, const Line& t) {\n\tPoint sv = s.b - s.a, tv = t.b - t.a;\n\tassert(cross(sv, tv) != 0);\n\treturn s.a + sv * cross(tv, t.a - s.a) / cross(tv, sv);\n}\n// 直線と直線の交点\nvector<Point> is_ll2(const Line &s, const Line& t) {\n\tPoint sv = s.b - s.a, tv = t.b - t.a;\n\tif (cross(sv, tv) != 0)return vector<Point>(1, is_ll(s, t));\n\telse {\n\t\tvector<Point>ans;\n\t\tfor (int k = 0; k < 2; ++k) {\n\t\t\tif (isis_sp(s, t[k]) && find(ans.begin(), ans.end(), t[k]) == ans.end())ans.push_back(t[k]);\n\t\t\tif (isis_sp(t, s[k]) && find(ans.begin(), ans.end(), s[k]) == ans.end())ans.push_back(s[k]);\n\t\t}\n\t\treturn ans;\n\t}\n}\n// 線分と線分の交点\n// 重なってる部分あるとassert(false)\nPoint is_ss(const Line &s, const Line& t) {\n\tif (isis_ss(s, t)) {\n\t\tfor (int k = 0; k < 2; ++k) {\n\t\t\tfor (int l = 0; l < 2; ++l) {\n\t\t\t\tif (s[k] == t[l])return s[k];\n\t\t\t}\n\t\t}\n\t\treturn is_ll(s, t);\n\t}\n\telse {\n\t\t//先にisis_ssしてね\n\t\tassert(false);\n\t\treturn Point(0, 0);\n\t}\n}\n// 線分と線分の交点\nvector<Point> is_ss2(const Line &s, const Line& t) {\n\tvector<Point> kouho(is_ll2(s, t));\n\tvector<Point>ans;\n\tfor (auto p : kouho) {\n\t\tif (isis_sp(s, p) && isis_sp(t, p))ans.emplace_back(p);\n\t}\n\treturn ans;\n}\n// 直線と点の距離\nld dist_lp(const Line& l, const Point& p) {\n\treturn abs(p - proj(l, p));\n}\n\n//直線と直線の距離\nld dist_ll(const Line& l, const Line& m) {\n\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\n}\n\n// 直線と線分の距離\nld dist_ls(const Line& l, const Line& s) {\n\treturn isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));\n}\n\n// 線分と点の距離\nld dist_sp(const Line& s, const Point& p) {\n\tPoint r = proj(s, p);\n\treturn isis_sp(s, r) ? abs(r - p) : min(abs(s.a - p), abs(s.b - p));\n}\n\n// 線分と線分の距離\nld dist_ss(const Line& s, const Line& t) {\n\tif (isis_ss(s, t)) return 0;\n\treturn min({ dist_sp(s, t.a), dist_sp(s, t.b), dist_sp(t, s.a), dist_sp(t, s.b) });\n}\n\n\n//直線と直線の二等分線のベクトル\nLine line_bisection(const Line &s, const Line &t) {\n\tconst Point laglanju(is_ll(s, t));\n\tconst Point avec = !(abs(laglanju - s[0])<eps) ? s[0] - laglanju : s[1] - laglanju;\n\tconst Point bvec = !(abs(laglanju - t[0])<eps) ? t[0] - laglanju : t[1] - laglanju;\n\n\treturn Line(laglanju, laglanju + (abs(bvec)*avec + abs(avec)*bvec) / (abs(avec) + abs(bvec)));\n}\n//点と点の垂直二等分線 aを左に見ながら\nLine point_bisection(const Point&a, const Point&b) {\n\tconst Point cen((a + b) / 2.l);\n\tconst Point vec = (b - a)*Point(0, 1);\n\treturn Line(cen, cen + vec);\n}\n\n//三つの点からなる外心\nPoint outer_center(const vector<Point>&ps) {\n\tassert(ps.size() == 3);\n\tLine l1 = point_bisection(ps[0], ps[1]);\n\tLine l2 = point_bisection(ps[1], ps[2]);\n\treturn is_ll(l1, l2);\n}\n\n\n//三つの直線からなる内心\n//三つの直線が並行でないことは確かめといてね\nPoint inner_center(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tfor (int i = 0; i <static_cast<int>(ls.size()); ++i) {\n\t\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\n\t}\n\tif (vertics[0] == vertics[1] || vertics[1] == vertics[2] || vertics[2] == vertics[0])return vertics[0];\n\tLine bi1(line_bisection(Line(vertics[0], vertics[1]), Line(vertics[0], vertics[2])));\n\tLine bi2(line_bisection(Line(vertics[1], vertics[2]), Line(vertics[1], vertics[0])));\n\tif (bi1[0] == bi2[0])return bi1[0];\n\telse {\n\t\treturn is_ll(bi1, bi2);\n\t}\n}\n\n//三つの直線からなる傍心\n//三つの直線が並行でないことは確かめといてね\nvector<Point> ex_center(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tfor (int i = 0; i < static_cast<int>(ls.size()); ++i) {\n\t\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\n\t}\n\tif (abs(vertics[0] - vertics[1])<eps || abs(vertics[1] - vertics[2])<eps || (abs(vertics[2] - vertics[0])<eps))return vector<Point>();\n\tvector<Point>ecs;\n\tfor (int i = 0; i < 3; ++i) {\n\t\tLine bi1(line_bisection(Line(vertics[i], vertics[i] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[i], vertics[(i + 1) % 3])));\n\t\tLine bi2(line_bisection(Line(vertics[(i + 1) % 3], vertics[(i + 1) % 3] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[(i + 1) % 3], vertics[i])));\n\t\tecs.push_back(is_ll(bi1, bi2));\n\t}\n\treturn ecs;\n}\n\n\n//a,b:並行\n//c:並行でない\n//三つの直線から同距離の位置を求める。\nvector<Point> same_dis(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tvertics.push_back(is_ll(ls[0], ls[2]));\n\tvertics.push_back(is_ll(ls[1], ls[2]));\n\n\tif (abs(vertics[0] - vertics[1]) < eps)return vector<Point>{vertics[0]};\n\tLine bis(line_bisection(ls[0], ls[1]));\n\tvector<Point>ecs;\n\n\tLine abi(line_bisection(Line(vertics[0], vertics[1]), ls[0]));\n\tecs.push_back(is_ll(bis, abi));\n\n\n\tLine bbi(line_bisection(Line(vertics[0], 2.l*vertics[0] - vertics[1]), ls[0]));\n\tecs.push_back(is_ll(bis, bbi));\n\n\treturn ecs;\n}\n/* 円 */\n\n// 円と円の交点\nvector<Point> is_cc(const Circle& c1, const Circle& c2) {\n\tvector<Point> res;\n\tld d = abs(c1.p - c2.p);\n\tld rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\n\tld dfr = c1.r * c1.r - rc * rc;\n\tif (abs(dfr) < eps) dfr = 0.0;\n\telse if (dfr < 0.0) return res; // no intersection\n\tld rs = sqrt(dfr);\n\tPoint diff = (c2.p - c1.p) / d;\n\tres.push_back(c1.p + diff * Point(rc, rs));\n\tif (dfr != 0.0) res.push_back(c1.p + diff * Point(rc, -rs));\n\treturn res;\n}\n\n/*\n点が円の中にいるか\n0 => out\n1 => on\n2 => in*/\nint is_in_Circle(const Point& p, const Circle &cir) {\n\tld dis = abs(cir.p - p);\n\tif (dis > cir.r + eps)return 0;\n\telse if (dis < cir.r - eps)return 2;\n\telse return 1;\n}\nint is_in_Circle(const Circle &cir, const Point& p) {\n\tld dis = abs(cir.p - p);\n\tif (dis > cir.r + eps)return 0;\n\telse if (dis < cir.r - eps)return 2;\n\telse return 1;\n}\n/*\n円lcが円rcの中にいるか\n0 => out\n1 => on\n2 => in*/\nint Circle_in_Circle(const Circle &lc, const Circle&rc) {\n\tld dis = abs(lc.p - rc.p);\n\tif (dis < rc.r - lc.r - eps)return 2;\n\telse if (dis>rc.r - lc.r + eps)return 0;\n\telse return 1;\n}\n\n// 円と直線の交点\nvector<Point> is_lc(const Circle& c, const Line& l) {\n\tvector<Point> res;\n\tld d = dist_lp(l, c.p);\n\tif (d < c.r + eps) {\n\t\tld len = (d > c.r) ? 0.0 : sqrt(c.r * c.r - d * d); //safety;\n\t\tPoint nor = (l.a - l.b) / abs(l.a - l.b);\n\t\tres.push_back(proj(l, c.p) + len * nor);\n\t\tres.push_back(proj(l, c.p) - len * nor);\n\t}\n\treturn res;\n}\n\n// 円と線分の距離\nvector<Point> is_sc(const Circle& c, const Line& l) {\n\tvector<Point> v = is_lc(c, l), res;\n\tfor (Point p : v)\n\t\tif (isis_sp(l, p)) res.push_back(p);\n\treturn res;\n}\n\n// 円と点の接線\nvector<Line> tangent_cp(const Circle& c, const Point& p) {\n\tvector<Line> ret;\n\tPoint v = c.p - p;\n\tld d = abs(v);\n\tld l = sqrt(norm(v) - c.r * c.r);\n\tif (isnan(l)) { return ret; }\n\tPoint v1 = v * Point(l / d, c.r / d);\n\tPoint v2 = v * Point(l / d, -c.r / d);\n\tret.push_back(Line(p, p + v1));\n\tif (l < eps) return ret;\n\tret.push_back(Line(p, p + v2));\n\treturn ret;\n}\n\n// 円と円の接線\nvector<Line> tangent_cc(const Circle& c1, const Circle& c2) {\n\tvector<Line> ret;\n\tif (abs(c1.p - c2.p) - (c1.r + c2.r) > -eps) {\n\t\tPoint center = (c1.p * c2.r + c2.p * c1.r) / (c1.r + c2.r);\n\t\tret = tangent_cp(c1, center);\n\t}\n\tif (abs(c1.r - c2.r) > eps) {\n\t\tPoint out = (-c1.p * c2.r + c2.p * c1.r) / (c1.r - c2.r);\n\t\tvector<Line> nret = tangent_cp(c1, out);\n\t\tret.insert(ret.end(), nret.begin(), nret.end());\n\t}\n\telse {\n\t\tPoint v = c2.p - c1.p;\n\t\tv /= abs(v);\n\t\tPoint q1 = c1.p + v * Point(0, 1) * c1.r;\n\t\tPoint q2 = c1.p + v * Point(0, -1) * c1.r;\n\t\tret.push_back(Line(q1, q1 + v));\n\t\tret.push_back(Line(q2, q2 + v));\n\t}\n\treturn ret;\n}\n//二つの円の重なり面積\nld two_Circle_area(const Circle&l, const Circle&r) {\n\tld dis = abs(l.p - r.p);\n\tif (dis > l.r + r.r)return 0;\n\telse if (dis + r.r < l.r) {\n\t\treturn r.r*r.r*pi;\n\t}\n\telse if (dis + l.r < r.r) {\n\t\treturn l.r*l.r*pi;\n\t}\n\telse {\n\t\tld ans = (l.r)*(l.r)*acos((dis*dis + l.r*l.r - r.r*r.r) / (2 * dis*l.r)) +\n\t\t\t(r.r)*(r.r)*acos((dis*dis + r.r*r.r - l.r*l.r) / (2 * dis*r.r)) -\n\t\t\tsqrt(4 * dis*dis*l.r*l.r - (dis*dis + l.r*l.r - r.r*r.r)*(dis*dis + l.r*l.r - r.r*r.r)) / 2;\n\t\treturn ans;\n\t}\n\n}\n\n/* 多角形 */\n\ntypedef vector<Point> Polygon;\n\n\n// 面積\nld get_area(const Polygon &p) {\n\tld res = 0;\n\tint n = p.size();\n\tfor (int j = 0; j<n; ++j) res += cross(p[j], p[(j + 1) % n]);\n\treturn res / 2;\n}\n\n// 円の内外判定\n/*0 => out\n1 => on\n2 => in*/\nint convex_contains(const Polygon &poly, const Point& p) {\n\tld angle = 0;\n\tint n = poly.size();\n\tfor(int i=0;i<n;++i) {\n\t\tPoint a = poly[i], b = poly[(i + 1) % n];\n\t\tif (isis_sp(Line(a, b), p)) return 1;\n\t\tangle += arg((b - p) / (a - p));\n\t}\n\treturn eq(angle, 0) ? 0 : 2;\n}\n\n\nstruct Edge {\n\tint src;\n\tint dest;\n};\nusing Graph=vector<vector<Edge>>;\n\n//線分アレンジメント後に、\n//閉路の面積の和を求める。\nvoid dfs(set<pair<int ,int>>&aset,const int now, const int from, vector<int>&prevs, vector<Polygon>&ans_polys, const vector<Point>&ps, const Graph&g) {\n\tvector<pair<ld, int>>next_points;\n\n\tPoint from_p = from == -1 ? ps[now] + Point(-3e6, 0) : ps[from];\n\tPoint now_p = ps[now];\n\tfor (auto e : g[now]) {\n\t\tif (e.dest == from)continue;\n\t\tPoint next_p = ps[e.dest];\n\n\t\tld costheta = dot(from_p - now_p, next_p - now_p) / (abs(from_p - now_p)*abs(next_p - now_p));\n\t\tcostheta *= 0.3;\n\t\tld d = acos(costheta);\n\t\tif (ccw(from_p, now_p, next_p) != 1) {\n\t\t\td = 2 * pi - d;\n\t\t}\n\t\tnext_points.push_back(make_pair(d, e.dest));\n\t}\n\tsort(next_points.begin(), next_points.end());\n\n\tfor (auto n_p : next_points) {\n\t\tif (aset.find(make_pair(now, n_p.second))!=aset.end()) {\n\t\t\tcontinue;\n\t\t}\n\t\telse {\n\t\t\taset.emplace(now,n_p.second);\n\t\t}\n\n\t\tif (prevs[n_p.second] != -1) {\n\t\t\tint k=now;\n\t\t\tPolygon poly(1,ps[k]);\n\t\t\twhile (k != n_p.second) {\n\t\t\t\tk=prevs[k];\n\t\t\t\tpoly.push_back(ps[k]);\n\t\t\t}\n\t\t\t\n\t\t\tld plus = get_area(poly);\n\t\t\tif (plus<eps) {\n\t\t\t\treverse(poly.begin(),poly.end());\n\t\t\t\tans_polys.push_back(poly);\n\t\t\t}\n\t\t\tthrow(false);\n\t\t}\n\t\telse {\n\n\t\t\tprevs[n_p.second] = now;\n\t\t\tdfs(aset, n_p.second, now, prevs, ans_polys, ps, g);\n\t\t\tprevs[n_p.second] = -1;\n\t\t}\n\n\t}\n\treturn ;\n}\n\nint main() {\n\twhile (true) {\n\t\tint N,M;cin>>N>>M;\n\t\tif(!N)break;\n\t\tvector<Circle>cs;\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tint x,y,r;cin>>x>>y>>r;\n\t\t\tcs.push_back(Circle(Point(x,y),r));\n\t\t}\n\t\tvector<vector<Edge>>edges(N);\n\t\tGraph g(N);\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tfor (int j = i + 1; j < N; ++j) {\n\t\t\t\t\n\t\t\t\tld dis=abs(cs[i].p-cs[j].p);\n\t\t\t\tif (Circle_in_Circle(cs[i], cs[j])==0&&Circle_in_Circle(cs[j],cs[i])==0&&dis<cs[i].r+cs[j].r) {\n\t\t\t\t\tedges[i].push_back(Edge{ i,j });\n\t\t\t\t\tedges[j].push_back(Edge{ j,i });\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tvector<Point>ps(N);\n\t\tfor(int i=0;i<N;++i)ps[i]=cs[i].p;\n\n\t\tvector<Polygon>polys;\n\t\tset<pair<int,int>>aset;\n\n\t\tfor(int i=0;i<N;++i) {\n\t\t\tfor (int j = 0; j < edges[i].size();++j) {\n\t\t\t\tif (aset.find(make_pair(i, j)) == aset.end()) {\n\t\t\t\t\ttry {\n\t\t\t\t\t\tvector<int>prevs(N, -1);\n\t\t\t\t\t\tprevs[i] = -2;\n\t\t\t\t\t\tdfs(aset, i, -1, prevs, polys, ps, edges);\n\t\t\t\t\t}\n\t\t\t\t\tcatch (...) {\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor (int i = 0; i < M; ++i) {\n\t\t\tvector<Point>query_points;\n\t\t\t{\n\t\t\t\tint a,b,c,d;cin>>a>>b>>c>>d;\n\t\t\t\tPoint p,q;\n\t\t\t\tp=Point(a,b);\n\t\t\t\tq=Point(c,d);\n\t\t\t\tquery_points = vector<Point>{ p,q };\n\t\t\t}\n\t\t\tvector<vector<int>>in_circles(2);\n\t\t\tfor (int j = 0; j < 2; ++j) {\n\t\t\t\tfor (int k = 0; k < N; ++k) {\n\t\t\t\t\tif (is_in_Circle(cs[k], query_points[j])) {\n\t\t\t\t\t\tin_circles[j].push_back(true);\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tin_circles[j].push_back(false);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tbool ok;\n\t\t\tif (in_circles[0] != in_circles[1]) {\n\t\t\t\tok=false;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (all_of(in_circles[0].begin(), in_circles[0].end(), [](const int a) {return a == 0; })) {\n\t\t\t\t\tvector<vector<int>>in_polygons(2,vector<int>(polys.size()));\n\t\t\t\t\tfor (int j = 0; j < 2; ++j) {\n\t\t\t\t\t\tfor (int k = 0; k < polys.size(); ++k) {\n\t\t\t\t\t\t\tif (convex_contains(polys[k], query_points[j])) {\n\t\t\t\t\t\t\t\tin_polygons[j][k] = true;\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\tif (in_polygons[0] == in_polygons[1]) {\n\t\t\t\t\t\tok=true;\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tok=false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tok=true;\n\t\t\t\t}\n\n\t\t\t}\n\t\t\tif(ok)cout<<\"YES\";\n\t\t\telse cout<<\"NO\";\n\t\t\tif(i==M-1)cout<<endl;\n\t\t\telse cout<<\" \";\n\t\t\t\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":0.5,"time_ms":70,"memory_kb":3360,"score_of_the_acc":-0.0563,"final_rank":20},{"submission_id":"aoj_1198_2999426","code_snippet":"#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <string>\n#include <cmath>\n#include <bitset>\n#include <vector>\n#include <map>\n#include <set>\n#include <queue>\n#include <deque>\n#include <algorithm>\n#include <fstream>\n#define EPS 1e-10\n \nusing namespace std;\ntypedef long long int ll;\n \nconst double PI=acos(-1.0);\n \ndouble add(double a, double b){\n if(abs(a+b)<EPS*(abs(a)+abs(b))) return 0;\n return a+b;\n}\n \nstruct P{\n double x, y;\n P() {}\n P(double x, double y): x(x), y(y){\n }\n P operator+ (P p){\n return P(add(x, p.x), add(y, p.y));\n }\n P operator- (P p){\n return P(add(x, -p.x), add(y, -p.y));\n }\n P operator* (double d){\n return P(x*d, y*d);\n }\n double dot(P p){\n return add(x*p.x, y*p.y);\n }\n double det(P p){\n return add(x*p.y, -y*p.x);\n }\n bool operator< (const P& p) const{\n if(abs(x-p.x)>EPS){\n return x<p.x;\n }else{\n return y<p.y-EPS;\n }\n }\n};\n \nbool on_seg(P p1, P p2, P q){\n return (p1-q).det(p2-q)==0 && (p1-q).dot(p2-q)<=0;\n}\n \nP intersection(P p1, P p2, P q1, P q2){\n return p1+(p2-p1)*((q2-q1).det(q1-p1) / (q2-q1).det(p2-p1));\n}\n \ndouble dist(P p1, P p2){\n return sqrt((p1-p2).dot(p1-p2));\n}\n \nbool in_polygon(vector<P> poly, P p){ //内ならtrue、多角形は反時計回り\n int ct=0;\n P inf=P(cos(1.0)*20000.0, sin(1.0)*20000.0);\n int N=poly.size();\n for(int i=0; i<N-1; i++){\n P q=intersection(poly[i], poly[i+1], p, inf);\n if(on_seg(poly[i], poly[i+1], q) && on_seg(p, inf, q)) ct++;\n }\n P q=intersection(poly[N-1], poly[0], p, inf);\n if(on_seg(poly[N-1], poly[0], q) && on_seg(p, inf, q)) ct++;\n if(ct%2==0){\n return false;\n }else{\n return true;\n }\n}\n \nint n;\nP c[102];\nbool nn[102][102];\nvector<int> v[102];\n \nvector<int> min_polygon0(P p, int j, int i){\n bool vec=0;\n if((c[i]-c[j]).det(p-c[j])>0) vec=1;\n vector<int> ppoly;\n ppoly.push_back(i);\n int i1=i, j1=j;\n int ct=1;\n while(ct<=n+3){\n int i2;\n double ang0;\n ang0=3.0*PI;\n for(int l=0; l<v[i1].size(); l++){\n int x=v[i1][l];\n if(x==j1) continue;\n if(nn[i1][x]==1) continue;\n double cs=((c[j1]-c[i1]).dot(c[x]-c[i1]))/(dist(c[j1], c[i1])*dist(c[x], c[i1]));\n double ang;\n if(abs(cs+1.0)<EPS){\n ang=PI;\n }else if(abs(cs-1.0)<EPS){\n ang=0;\n }else{\n ang=acos(cs);\n\t }\n if((c[j1]-c[i1]).det(c[x]-c[i1])<0){\n ang=2.0*PI-ang;\n }\n\t if(vec==1){\n\t\t ang=2.0*PI-ang;\n\t }\n if(ang0>ang){\n ang0=ang;\n i2=x;\n }\n }\n j1=i1;\n i1=i2;\n ppoly.push_back(i2);\n ct++;\n if(i1==j){\n break;\n }\n }\n vector<P> ppoly1;\n for(int i=0; i<ppoly.size(); i++){\n ppoly1.push_back(c[ppoly[i]]);\n }\n if(ct>=n+3 || in_polygon(ppoly1, p)==false){\n vector<int> emp;\n return emp;\n }else{\n return ppoly;\n }\n}\n \nvector<int> min_polygon(P p){\n for(int i=0; i<n; i++){\n for(int j=0; j<v[i].size(); j++){\n int x=v[i][j];\n if(nn[i][x]==1) continue;\n P mid=(c[i]+c[x])*0.5;\n bool e0=0;\n for(int k=0; k<n; k++){\n for(int l=0; l<v[k].size(); l++){\n int y=v[k][l];\n if(nn[k][y]==1) continue;\n if((k==i && y==x) || (k==x && y==i)) continue;\n if((mid-p).det(c[k]-c[y])==0){\n if(on_seg(mid, p, c[k]) || on_seg(mid, p, c[y]) || on_seg(c[k], c[y], mid) || on_seg(c[k], c[y], p)){\n e0=1;\n break;\n }\n }else{\n P r=intersection(mid, p, c[k], c[y]);\n if(on_seg(mid, p, r) && on_seg(c[k], c[y], r)){\n e0=1;\n break;\n }\n }\n }\n if(e0==1) break;\n }\n if(e0==0){\n vector<int> ppoly=min_polygon0(p, i, x);\n if(!ppoly.empty()){\n return ppoly;\n }\n }\n }\n }\n vector<int> emp;\n return emp;\n}\n \nint main()\n{\n while(1){\n int m;\n cin>>n>>m;\n if(n==0 && m==0) return 0;\n double r[100];\n for(int i=0; i<n; i++){\n double cx, cy;\n cin>>cx>>cy>>r[i];\n c[i]=P(cx, cy);\n }\n for(int i=0; i<100; i++){\n v[i].clear();\n }\n for(int i=0; i<n; i++){\n for(int j=i+1; j<n; j++){\n double d=dist(c[i], c[j]);\n if(abs(r[i]-r[j])<d && d<(r[i]+r[j])){\n v[i].push_back(j);\n v[j].push_back(i);\n }\n }\n }\n\n\t for(int i=0; i<n; i++){\n for(int j=0; j<n; j++){\n nn[i][j]=0;\n\t\t }\n }\n\t for(int t=0; t<3*n; t++){\n for(int i=0; i<n; i++){\n\t\t\tint ct=0;\n\t\t\t for(int j=0; j<v[i].size(); j++){\n\t\t\t\tif(nn[i][v[i][j]]==1) continue;\n\t\t\t\tct++;\n\t\t\t }\n if(ct==1){\n int j2;\n for(int j=0; j<v[i].size(); j++){\n\t\t\t\tif(nn[i][v[i][j]]==1) continue;\n\t\t\t\tj2=v[i][j];\n\t\t\t}\n nn[i][j2]=1;\n nn[j2][i]=1;\n \n }\n }\n\t }\n for(int k=0; k<m; k++){\n P p, q;\n double px, py, qx, qy;\n cin>>px>>py>>qx>>qy;\n p=P(px, py), q=P(qx, qy);\n bool ep[100], eq[100];\n bool e=0, e0=0;\n for(int i=0; i<n; i++){\n if(dist(p, c[i])<r[i]){\n ep[i]=1;\n e0=1;\n }else{\n ep[i]=0;\n }\n if(dist(q, c[i])<r[i]){\n eq[i]=1;\n e0=1;\n }else{\n eq[i]=0;\n }\n if(ep[i]!=eq[i]){\n if(k==m-1){\n cout<<\"NO\";\n }else{\n cout<<\"NO \";\n }\n e=1;\n break;\n }\n }\n if(e==1) continue;\n if(e0==1){\n if(k==m-1){\n cout<<\"YES\";\n }else{\n cout<<\"YES \";\n }\n continue;\n }\n \n vector<int> ppoly, qpoly;\n ppoly=min_polygon(p);\n qpoly=min_polygon(q);\n if(ppoly.empty() && qpoly.empty()){\n if(k==m-1){\n cout<<\"YES\";\n }else{\n cout<<\"YES \";\n }\n continue;\n }\n if(ppoly.empty() || qpoly.empty()){\n if(k==m-1){\n cout<<\"NO\";\n }else{\n cout<<\"NO \";\n }\n continue;\n }\n if(ppoly.size()!=qpoly.size()){\n if(k==m-1){\n cout<<\"NO\";\n }else{\n cout<<\"NO \";\n }\n continue;\n }\n sort(ppoly.begin(), ppoly.end());\n sort(qpoly.begin(), qpoly.end());\n bool ok=0;\n for(int i=0; i<ppoly.size(); i++){\n if(ppoly[i]!=qpoly[i]){\n ok=1;\n break;\n }\n }\n if(ok==0){\n if(k==m-1){\n cout<<\"YES\";\n }else{\n cout<<\"YES \";\n }\n }else{\n if(k==m-1){\n cout<<\"NO\";\n }else{\n cout<<\"NO \";\n }\n }\n }\n cout<<\"\\n\";\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3372,"score_of_the_acc":-0.0378,"final_rank":3}],"string":"[\n {\n \"submission_id\": \"aoj_1198_9340740\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing Real = long double;\\nusing Point = complex<Real>;\\nconst Real EPS = 1e-9, PI = acos(-1);\\n\\ninline bool eq(Real a, Real b) {\\n return fabs(b - a) < EPS;\\n}\\n\\nPoint operator*(const Point &p, const Real &d) {\\n return Point(real(p) * d, imag(p) * d);\\n}\\n\\nistream &operator>>(istream &is, Point &p) {\\n Real a, b;\\n is >> a >> b;\\n p = Point(a, b);\\n return is;\\n}\\n\\nostream &operator<<(ostream &os, Point &p) {\\n return os << fixed << setprecision(10) << p.real() << \\\" \\\" << p.imag();\\n}\\n\\n// 点 p を反時計回りに theta 回転\\nPoint rotate(Real theta, const Point &p) {\\n return Point(\\n cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\\n}\\n\\nReal radian_to_degree(Real r) {\\n return (r * 180.0 / PI);\\n}\\n\\nReal degree_to_radian(Real d) {\\n return (d * PI / 180.0);\\n}\\n\\n// a-b-c の角度のうち小さい方を返す\\nReal get_angle(const Point &a, const Point &b, const Point &c) {\\n const Point v(b - a), w(c - b);\\n Real alpha = atan2(v.imag(), v.real()), beta = atan2(w.imag(), w.real());\\n if (alpha > beta) swap(alpha, beta);\\n Real theta = (beta - alpha);\\n return min(theta, 2 * acos(-1) - theta);\\n}\\n\\nnamespace std {\\nbool operator<(const Point &a, const Point &b) {\\n return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag();\\n}\\n} // namespace std\\n\\nstruct Line {\\n Point a, b;\\n\\n Line() = default;\\n\\n Line(Point a, Point b) : a(a), b(b) {}\\n\\n Line(Real A, Real B, Real C) // Ax + By = C\\n {\\n if (eq(A, 0)) a = Point(0, C / B), b = Point(1, C / B);\\n else if (eq(B, 0)) b = Point(C / A, 0), b = Point(C / A, 1);\\n else a = Point(0, C / B), b = Point(C / A, 0);\\n }\\n\\n friend ostream &operator<<(ostream &os, Line &p) { return os << p.a << \\\" to \\\" << p.b; }\\n\\n friend istream &operator>>(istream &is, Line &a) { return is >> a.a >> a.b; }\\n};\\n\\nstruct Segment : Line {\\n Segment() = default;\\n\\n Segment(Point a, Point b) : Line(a, b) {}\\n};\\n\\nstruct Circle {\\n Point p;\\n Real r;\\n\\n Circle() = default;\\n\\n Circle(Point p, Real r) : p(p), r(r) {}\\n};\\n\\nusing Points = vector<Point>;\\nusing Polygon = vector<Point>;\\nusing Segments = vector<Segment>;\\nusing Lines = vector<Line>;\\nusing Circles = vector<Circle>;\\n\\nReal cross(const Point &a, const Point &b) {\\n return real(a) * imag(b) - imag(a) * real(b);\\n}\\n\\nReal dot(const Point &a, const Point &b) {\\n return real(a) * real(b) + imag(a) * imag(b);\\n}\\n\\n// 点の回転方向\\nint ccw(const Point &a, Point b, Point c) {\\n b = b - a, c = c - a;\\n if (cross(b, c) > EPS) return +1; // \\\"COUNTER_CLOCKWISE\\\"\\n if (cross(b, c) < -EPS) return -1; // \\\"CLOCKWISE\\\"\\n if (dot(b, c) < 0) return +2; // \\\"ONLINE_BACK\\\"\\n if (norm(b) < norm(c)) return -2; // \\\"ONLINE_FRONT\\\"\\n return 0; // \\\"ON_SEGMENT\\\"\\n}\\n\\n// 平行判定\\nbool parallel(const Line &a, const Line &b) {\\n return eq(cross(a.b - a.a, b.b - b.a), 0.0);\\n}\\n\\n// 垂直判定\\nbool orthogonal(const Line &a, const Line &b) {\\n return eq(dot(a.a - a.b, b.a - b.b), 0.0);\\n}\\n\\n// 射影\\n// 直線 l に p から垂線を引いた交点を求める\\nPoint projection(const Line &l, const Point &p) {\\n double t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n return l.a + (l.a - l.b) * t;\\n}\\nPoint projection(const Segment &l, const Point &p) {\\n double t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n return l.a + (l.a - l.b) * t;\\n}\\n\\n// 反射\\n// 直線 l を対称軸として点 p と線対称にある点を求める\\nPoint reflection(const Line &l, const Point &p) {\\n return p + (projection(l, p) - p) * 2.0;\\n}\\n\\nbool intersect(const Line &l, const Point &p) {\\n return abs(ccw(l.a, l.b, p)) != 1;\\n}\\nbool intersect(const Line &l, const Line &m) {\\n return abs(cross(l.b - l.a, m.b - m.a)) > EPS || abs(cross(l.b - l.a, m.b - l.a)) < EPS;\\n}\\nbool intersect(const Segment &s, const Point &p) {\\n return ccw(s.a, s.b, p) == 0;\\n}\\nbool intersect(const Line &l, const Segment &s) {\\n return cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < EPS;\\n}\\n\\nReal distance(const Line &l, const Point &p);\\n\\nbool intersect(const Circle &c, const Line &l) {\\n return distance(l, c.p) <= c.r + EPS;\\n}\\nbool intersect(const Circle &c, const Point &p) {\\n return abs(abs(p - c.p) - c.r) < EPS;\\n}\\nbool intersect(const Segment &s, const Segment &t) {\\n return ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\\n ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\\n}\\n\\nint intersect(const Circle &c, const Segment &l) {\\n if (norm(projection(l, c.p) - c.p) - c.r * c.r > EPS) return 0;\\n auto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\\n if (d1 < c.r + EPS && d2 < c.r + EPS) return 0;\\n if (d1 < c.r - EPS && d2 > c.r + EPS || d1 > c.r + EPS && d2 < c.r - EPS) return 1;\\n const Point h = projection(l, c.p);\\n if (dot(l.a - h, l.b - h) < 0) return 2;\\n return 0;\\n}\\n// 0 -> 包含, 1 -> 内接, 2 -> 交差, 3 -> 外接, 4 -> 分離\\nint intersect(Circle c1, Circle c2) {\\n if (c1.r < c2.r) swap(c1, c2);\\n Real d = abs(c1.p - c2.p);\\n if (c1.r + c2.r < d) return 4;\\n if (eq(c1.r + c2.r, d)) return 3;\\n if (c1.r - c2.r < d) return 2;\\n if (eq(c1.r - c2.r, d)) return 1;\\n return 0;\\n}\\n\\nReal distance(const Point &a, const Point &b) {\\n return abs(a - b);\\n}\\nReal distance(const Line &l, const Point &p) {\\n return abs(p - projection(l, p));\\n}\\nReal distance(const Line &l, const Line &m) {\\n return intersect(l, m) ? 0 : distance(l, m.a);\\n}\\nReal distance(const Segment &s, const Point &p) {\\n Point r = projection(s, p);\\n if (intersect(s, r)) return abs(r - p);\\n return min(abs(s.a - p), abs(s.b - p));\\n}\\nReal distance(const Segment &a, const Segment &b) {\\n if (intersect(a, b)) return 0;\\n return min({distance(a, b.a), distance(a, b.b), distance(b, a.a), distance(b, a.b)});\\n}\\nReal distance(const Line &l, const Segment &s) {\\n if (intersect(l, s)) return 0;\\n return min(distance(l, s.a), distance(l, s.b));\\n}\\n\\nPoint crosspoint(const Line &l, const Line &m) {\\n Real A = cross(l.b - l.a, m.b - m.a);\\n Real B = cross(l.b - l.a, l.b - m.a);\\n if (eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\\n return m.a + (m.b - m.a) * B / A;\\n}\\nPoint crosspoint(const Segment &l, const Segment &m) {\\n return crosspoint(Line(l), Line(m));\\n}\\npair<Point, Point> crosspoint(const Circle &c, const Line l) {\\n Point pr = projection(l, c.p);\\n Point e = (l.b - l.a) / abs(l.b - l.a);\\n if (eq(distance(l, c.p), c.r)) return {pr, pr};\\n double base = sqrt(c.r * c.r - norm(pr - c.p));\\n return {pr - e * base, pr + e * base};\\n}\\npair<Point, Point> crosspoint(const Circle &c, const Segment &l) {\\n Line aa = Line(l.a, l.b);\\n if (intersect(c, l) == 2) return crosspoint(c, aa);\\n auto ret = crosspoint(c, aa);\\n if (dot(l.a - ret.first, l.b - ret.first) < 0) ret.second = ret.first;\\n else ret.first = ret.second;\\n return ret;\\n}\\npair<Point, Point> crosspoint(const Circle &c1, const Circle &c2) {\\n Real d = abs(c1.p - c2.p);\\n Real a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));\\n Real t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\\n Point p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\\n Point p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\\n return {p1, p2};\\n}\\n\\n// 点 p を通る円 c の接線\\npair<Point, Point> tangent(const Circle &c1, const Point &p2) {\\n return crosspoint(c1, Circle(p2, sqrt(norm(c1.p - p2) - c1.r * c1.r)));\\n}\\n\\n// 円 c1, c2 の共通接線\\nLines tangent(Circle c1, Circle c2) {\\n Lines ret;\\n if (c1.r < c2.r) swap(c1, c2);\\n Real g = norm(c1.p - c2.p);\\n if (eq(g, 0)) return ret;\\n Point u = (c2.p - c1.p) / sqrt(g);\\n Point v = rotate(PI * 0.5, u);\\n for (int s : {-1, 1}) {\\n Real h = (c1.r + s * c2.r) / sqrt(g);\\n if (eq(1 - h * h, 0)) {\\n ret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\\n } else if (1 - h * h > 0) {\\n Point uu = u * h, vv = v * sqrt(1 - h * h);\\n ret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\\n ret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\\n }\\n }\\n return ret;\\n}\\n\\n// 凸性判定\\nbool is_convex(const Polygon &p) {\\n int n = (int)p.size();\\n for (int i = 0; i < n; i++) {\\n if (ccw(p[(i + n - 1) % n], p[i], p[(i + 1) % n]) == -1) return false;\\n }\\n return true;\\n}\\n\\n// 凸包\\nPolygon convex_hull(Polygon &p) {\\n int n = (int)p.size(), k = 0;\\n if (n <= 2) return p;\\n sort(p.begin(), p.end());\\n vector<Point> ch(2 * n);\\n for (int i = 0; i < n; ch[k++] = p[i++]) {\\n while (k >= 2 && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < EPS) --k;\\n }\\n for (int i = n - 2, t = k + 1; i >= 0; ch[k++] = p[i--]) {\\n while (k >= t && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < EPS) --k;\\n }\\n ch.resize(k - 1);\\n return ch;\\n}\\n\\n// 多角形と点の包含判定\\nenum { OUT, ON, IN };\\n\\nint contains(const Polygon &Q, const Point &p) {\\n bool in = false;\\n for (int i = 0; i < Q.size(); i++) {\\n Point a = Q[i] - p, b = Q[(i + 1) % Q.size()] - p;\\n if (a.imag() > b.imag()) swap(a, b);\\n if (a.imag() <= 0 && 0 < b.imag() && cross(a, b) < 0) in = !in;\\n if (cross(a, b) == 0 && dot(a, b) <= 0) return ON;\\n }\\n return in ? IN : OUT;\\n}\\n\\n// 線分の重複除去\\nvoid merge_segments(vector<Segment> &segs) {\\n auto merge_if_able = [](Segment &s1, const Segment &s2) {\\n if (abs(cross(s1.b - s1.a, s2.b - s2.a)) > EPS) return false;\\n if (ccw(s1.a, s2.a, s1.b) == 1 || ccw(s1.a, s2.a, s1.b) == -1) return false;\\n if (ccw(s1.a, s1.b, s2.a) == -2 || ccw(s2.a, s2.b, s1.a) == -2) return false;\\n s1 = Segment(min(s1.a, s2.a), max(s1.b, s2.b));\\n return true;\\n };\\n\\n for (int i = 0; i < segs.size(); i++) {\\n if (segs[i].b < segs[i].a) swap(segs[i].a, segs[i].b);\\n }\\n for (int i = 0; i < segs.size(); i++) {\\n for (int j = i + 1; j < segs.size(); j++) {\\n if (merge_if_able(segs[i], segs[j])) {\\n segs[j--] = segs.back(), segs.pop_back();\\n }\\n }\\n }\\n}\\n\\n// 線分アレンジメント\\n// 任意の2線分の交点を頂点としたグラフを構築する\\nvector<vector<int>> segment_arrangement(vector<Segment> &segs, vector<Point> &ps) {\\n vector<vector<int>> g;\\n int N = (int)segs.size();\\n for (int i = 0; i < N; i++) {\\n ps.emplace_back(segs[i].a);\\n ps.emplace_back(segs[i].b);\\n for (int j = i + 1; j < N; j++) {\\n const Point p1 = segs[i].b - segs[i].a;\\n const Point p2 = segs[j].b - segs[j].a;\\n if (cross(p1, p2) == 0) continue;\\n if (intersect(segs[i], segs[j])) {\\n ps.emplace_back(crosspoint(segs[i], segs[j]));\\n }\\n }\\n }\\n sort(begin(ps), end(ps));\\n ps.erase(unique(begin(ps), end(ps)), end(ps));\\n\\n int M = (int)ps.size();\\n g.resize(M);\\n for (int i = 0; i < N; i++) {\\n vector<int> vec;\\n for (int j = 0; j < M; j++) {\\n if (intersect(segs[i], ps[j])) {\\n vec.emplace_back(j);\\n }\\n }\\n for (int j = 1; j < vec.size(); j++) {\\n g[vec[j - 1]].push_back(vec[j]);\\n g[vec[j]].push_back(vec[j - 1]);\\n }\\n }\\n return (g);\\n}\\n\\n// 凸多角形の切断\\n// 直線 l.a-l.b で切断しその左側にできる凸多角形を返す\\nPolygon convex_cut(const Polygon &U, Line l) {\\n Polygon ret;\\n for (int i = 0; i < U.size(); i++) {\\n Point now = U[i], nxt = U[(i + 1) % U.size()];\\n if (ccw(l.a, l.b, now) != -1) ret.push_back(now);\\n if (ccw(l.a, l.b, now) * ccw(l.a, l.b, nxt) < 0) {\\n ret.push_back(crosspoint(Line(now, nxt), l));\\n }\\n }\\n return (ret);\\n}\\n\\n// 多角形の面積\\nReal area(const Polygon &p) {\\n Real A = 0;\\n for (int i = 0; i < p.size(); ++i) {\\n A += cross(p[i], p[(i + 1) % p.size()]);\\n }\\n return A * 0.5;\\n}\\n\\n// 円と多角形の共通部分の面積\\nReal area(const Polygon &p, const Circle &c) {\\n if (p.size() < 3) return 0.0;\\n function<Real(Circle, Point, Point)> cross_area = [&](const Circle &c, const Point &a,\\n const Point &b) {\\n Point va = c.p - a, vb = c.p - b;\\n Real f = cross(va, vb), ret = 0.0;\\n if (eq(f, 0.0)) return ret;\\n if (max(abs(va), abs(vb)) < c.r + EPS) return f;\\n if (distance(Segment(a, b), c.p) > c.r - EPS) return c.r * c.r * arg(vb * conj(va));\\n auto u = crosspoint(c, Segment(a, b));\\n vector<Point> tot{a, u.first, u.second, b};\\n for (int i = 0; i + 1 < tot.size(); i++) {\\n ret += cross_area(c, tot[i], tot[i + 1]);\\n }\\n return ret;\\n };\\n Real A = 0;\\n for (int i = 0; i < p.size(); i++) {\\n A += cross_area(c, p[i], p[(i + 1) % p.size()]);\\n }\\n return A;\\n}\\n\\n// 凸多角形の直径(最遠頂点対間距離)\\nReal convex_diameter(const Polygon &p) {\\n int N = (int)p.size();\\n int is = 0, js = 0;\\n for (int i = 1; i < N; i++) {\\n if (p[i].imag() > p[is].imag()) is = i;\\n if (p[i].imag() < p[js].imag()) js = i;\\n }\\n Real maxdis = norm(p[is] - p[js]);\\n\\n int maxi, maxj, i, j;\\n i = maxi = is;\\n j = maxj = js;\\n do {\\n if (cross(p[(i + 1) % N] - p[i], p[(j + 1) % N] - p[j]) >= 0) {\\n j = (j + 1) % N;\\n } else {\\n i = (i + 1) % N;\\n }\\n if (norm(p[i] - p[j]) > maxdis) {\\n maxdis = norm(p[i] - p[j]);\\n maxi = i;\\n maxj = j;\\n }\\n } while (i != is || j != js);\\n return sqrt(maxdis);\\n}\\n\\n// 最近点対\\nReal closest_pair(Points ps) {\\n if (ps.size() <= 1) throw(0);\\n sort(begin(ps), end(ps));\\n\\n auto compare_y = [&](const Point &a, const Point &b) { return imag(a) < imag(b); };\\n vector<Point> beet(ps.size());\\n const Real INF = 1e18;\\n\\n function<Real(int, int)> rec = [&](int left, int right) {\\n if (right - left <= 1) return INF;\\n int mid = (left + right) >> 1;\\n auto x = real(ps[mid]);\\n auto ret = min(rec(left, mid), rec(mid, right));\\n inplace_merge(begin(ps) + left, begin(ps) + mid, begin(ps) + right, compare_y);\\n int ptr = 0;\\n for (int i = left; i < right; i++) {\\n if (abs(real(ps[i]) - x) >= ret) continue;\\n for (int j = 0; j < ptr; j++) {\\n auto luz = ps[i] - beet[ptr - j - 1];\\n if (imag(luz) >= ret) break;\\n ret = min(ret, abs(luz));\\n }\\n beet[ptr++] = ps[i];\\n }\\n return ret;\\n };\\n return rec(0, (int)ps.size());\\n}\\n\\n// 平面グラフを多角形に分割する (基本的に反時計回り、外平面のみ時計回り)\\n// graph は無向グラフを想定 (u-v <=> v-u)。変なグラフを入れると壊れるはず\\nvector<vector<int>> decompose_to_cycle(const vector<vector<int>> &graph, const vector<Point> &pos) {\\n assert(graph.size() == pos.size());\\n int n = graph.size();\\n int m = 0;\\n map<array<int, 2>, int> mp;\\n vector<array<int, 2>> edge;\\n for (int i = 0; i < n; ++i) {\\n for (auto ni : graph[i]) {\\n mp[{i, ni}] = m++;\\n edge.push_back({i, ni});\\n }\\n }\\n \\n vector<int> nex(m, -1);\\n for (int i = 0; i < n; ++i) {\\n if (graph[i].empty()) continue;\\n \\n vector<pair<long double, int>> adj;\\n for (int ni : graph[i]) {\\n Point diff = pos[ni] - pos[i];\\n assert(pos[ni] != pos[i]);\\n adj.push_back({arg(diff), ni});\\n }\\n \\n sort(adj.begin(), adj.end());\\n int siz = adj.size();\\n adj.emplace_back(adj[0]);\\n adj[siz].first += 2 * PI;\\n \\n for (int j = 0; j < siz; ++j) {\\n auto [arg0, to] = adj[j];\\n auto [arg1, from] = adj[j + 1];\\n int ein = mp[{from, i}];\\n int eout = mp[{i, to}];\\n \\n nex[ein] = eout;\\n }\\n }\\n \\n vector<vector<int>> ret;\\n vector<bool> used(m, false);\\n for (int i = 0; i < m; ++i) {\\n if (used[i]) continue;\\n \\n vector<int> tmp;\\n int now = i;\\n while (!used[now]) {\\n used[now] = true;\\n tmp.emplace_back(edge[now][0]);\\n now = nex[now];\\n }\\n ret.emplace_back(tmp);\\n }\\n \\n return ret;\\n}\\n\\n/*-- main --*/\\n\\nbool is_end = false;\\n\\nvoid solve()\\n{\\n int N, Q; cin >> N >> Q;\\n if (N == 0 && Q == 0)\\n {\\n is_end = true;\\n return;\\n }\\n vector<Circle> circles(N);\\n vector<Point> centers(N);\\n for (int i = 0; i < N; ++i)\\n {\\n Real x, y, r; cin >> x >> y >> r;\\n centers[i] = Point(x, y);\\n circles[i] = Circle(Point(x, y), r);\\n }\\n vector<array<Point, 2>> query(Q);\\n for (int i = 0; i < Q; ++i)\\n {\\n int px, py, qx, qy; cin >> px >> py >> qx >> qy;\\n query[i][0] = Point(px, py);\\n query[i][1] = Point(qx, qy);\\n }\\n \\n \\n vector<vector<int>> graph(N);\\n for (int i = 0; i < N; ++i)\\n {\\n for (int j = 0; j < N; ++j)\\n {\\n if (i == j) continue;\\n if (intersect(circles[i], circles[j]) == 2) graph[i].emplace_back(j);\\n }\\n }\\n vector<vector<int>> tmp = decompose_to_cycle(graph, centers);\\n vector<Polygon> polygons(tmp.size());\\n for (int i = 0; i < tmp.size(); ++i)\\n {\\n for (auto v : tmp[i])\\n {\\n polygons[i].emplace_back(centers[v]);\\n }\\n }\\n \\n for (int i = 0; i < Q; ++i)\\n {\\n auto [p, q] = query[i];\\n \\n vector<bool> isinp(N, false), isinq(N, false);\\n int cntp = 0, cntq = 0;\\n for (int j = 0; j < N; ++j)\\n {\\n Point center = circles[j].p;\\n Real radius = circles[j].r;\\n if (abs(center - p) < radius) isinp[j] = true, cntp++;\\n if (abs(center - q) < radius) isinq[j] = true, cntq++;\\n }\\n \\n bool flg = false;\\n if (isinp != isinq) flg = false;\\n else\\n {\\n flg = true;\\n \\n if (cntp == 0)\\n {\\n int siz = polygons.size();\\n for (auto poly : polygons)\\n {\\n auto pp = contains(poly, p);\\n auto qq = contains(poly, q);\\n if (pp != qq) flg = false;\\n }\\n }\\n }\\n \\n cout << (flg ? \\\"YES\\\" : \\\"NO\\\") << \\\" \\\\n\\\"[i+1 == Q];\\n }\\n \\n return;\\n}\\n\\nint main()\\n{\\n while (!is_end)\\n {\\n solve();\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3672,\n \"score_of_the_acc\": -0.0868,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1198_9035480\",\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;\\nvector<int> cycle_detection(const vector<vector<int>>& g) {\\n int n = g.size();\\n vector<int> r(n, -1), p(n, -1), d(n, 0);\\n auto dfs = [&](auto& dfs, int r2, int cur) -> void {\\n r[cur] = r2;\\n for(int to : g[cur]) {\\n if(r[to] == -1) {\\n d[to] = d[cur] + 1;\\n p[to] = cur;\\n dfs(dfs, r2, to);\\n }\\n }\\n };\\n rep(i, 0, n) {\\n if(p[i] == -1) {\\n dfs(dfs, i, i);\\n }\\n }\\n rep(i, 0, n) {\\n for(int j : g[i]) {\\n if(r[i] == r[j] and d[j] - d[i] > 1) {\\n vector<int> cycle;\\n for(int v = j; v != i; v = p[v]) {\\n cycle.push_back(v);\\n }\\n cycle.push_back(i);\\n return cycle;\\n }\\n }\\n }\\n return {};\\n}\\nusing Real = long double;\\nconst Real EPS = 1e-6, 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}\\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_intersect_ss(const Segment& s1, const Segment& s2) {\\n if(ccw(s1.a, s1.b, s2.a) * ccw(s1.a, s1.b, s2.b) > 0) return false;\\n return ccw(s2.a, s2.b, s1.a) * ccw(s2.a, s2.b, s1.b) <= 0;\\n}\\nbool in_polygon(const vector<Point>& ps, const Point& p) {\\n int n = ps.size();\\n Segment seg = Segment(p, Point(p.real() + 1000000, p.imag() + 58));\\n int cnt = 0;\\n rep(i, 0, n) {\\n Point dir = ps[(i + 1) % n] - ps[i];\\n if(is_intersect_ss(seg, Segment(ps[i], ps[(i + 1) % n] - EPS * dir))) {\\n cnt++;\\n }\\n }\\n return cnt % 2 == 1;\\n}\\nstruct Circle {\\n Point p;\\n Real r;\\n Circle() = default;\\n Circle(const Point& p, const Real& r)\\n : p(p), r(r) {}\\n};\\nint is_intersect_cc(Circle c1, Circle c2) {\\n if(c1.r < c2.r) swap(c1, c2);\\n Real d = abs(c1.p - c2.p);\\n int a = sign(d - c1.r - c2.r);\\n if(a >= 0) return a + 3;\\n return sign(d - c1.r + c2.r) + 1;\\n}\\nbool is_contain_cp(Circle c, Point p) {\\n return abs(p - c.p) < c.r;\\n}\\nint main(void) {\\n while(1) {\\n int n, m;\\n cin >> n >> m;\\n if(n == 0 and m == 0) break;\\n vector<Circle> c(n);\\n rep(i, 0, n) {\\n cin >> c[i].p >> c[i].r;\\n }\\n rep(tc, 0, m) {\\n Point p, q;\\n cin >> p >> q;\\n set<int> st1, st2;\\n rep(i, 0, n) {\\n if(is_contain_cp(c[i], p)) {\\n st1.insert(i);\\n }\\n if(is_contain_cp(c[i], q)) {\\n st2.insert(i);\\n }\\n }\\n if(!st1.empty() or !st2.empty()) {\\n if(st1 == st2) {\\n cout << \\\"YES\\\";\\n } else {\\n cout << \\\"NO\\\";\\n }\\n if(tc + 1 < m) cout << ' ';\\n continue;\\n }\\n vector<vector<int>> g(n);\\n rep(i, 0, n) {\\n rep(j, 0, i) {\\n if(is_intersect_cc(c[i], c[j]) == 2) {\\n g[i].push_back(j);\\n g[j].push_back(i);\\n }\\n }\\n }\\n bool ans = true;\\n while(1) {\\n vector<int> cycle = cycle_detection(g);\\n if(cycle.empty()) break;\\n vector<Point> ps;\\n rep(i, 0, (int)cycle.size()) {\\n ps.push_back(c[cycle[i]].p);\\n }\\n if(in_polygon(ps, p) != in_polygon(ps, q)) {\\n ans = false;\\n break;\\n }\\n rep(i, 0, (int)g[cycle[0]].size()) {\\n if(g[cycle[0]][i] == cycle[1]) {\\n g[cycle[0]].erase(g[cycle[0]].begin() + i);\\n break;\\n }\\n }\\n rep(i, 0, (int)g[cycle[1]].size()) {\\n if(g[cycle[1]][i] == cycle[0]) {\\n g[cycle[1]].erase(g[cycle[1]].begin() + i);\\n break;\\n }\\n }\\n }\\n if(ans) {\\n cout << \\\"YES\\\";\\n } else {\\n cout << \\\"NO\\\";\\n }\\n if(tc < m - 1) cout << ' ';\\n }\\n cout << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3480,\n \"score_of_the_acc\": -0.0648,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1198_8006463\",\n \"code_snippet\": \"#line 1 \\\"test/geometry/aoj1198.test.cpp\\\"\\n#define PROBLEM \\\"https://onlinejudge.u-aizu.ac.jp/problems/1198\\\"\\n\\n#line 2 \\\"template/template.hpp\\\"\\n\\n#include<bits/stdc++.h>\\n\\n#define rep(i,n) for (int i = 0; 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 ull = unsigned long long;\\n\\nusing namespace std;\\n\\nnamespace noya2{\\n\\n/* ~ (. _________ . /) */\\n\\n}\\n\\nusing namespace noya2;\\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\\ntemplate<class T>istream &operator>>(istream &is, vector<T> &v){\\n for (auto &e : v) is >> e;\\n return is;\\n}\\n\\nvoid fast_io(){\\n cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(15);\\n}\\n\\nconst int iinf = 1'000'000'007;\\nconst ll linf = 2e18;\\n#line 4 \\\"test/geometry/aoj1198.test.cpp\\\"\\n\\n#line 2 \\\"geometry/partition_by_circle.hpp\\\"\\n\\n#line 2 \\\"geometry/base_ld.hpp\\\"\\n\\n#line 4 \\\"geometry/base_ld.hpp\\\"\\n\\nnamespace noya2 {\\n\\nusing vec = complex<ld>;\\n\\nconst ld PI = acos(-1);\\n\\nvoid ldout(int len = 20) {\\n cout << fixed << setprecision(len);\\n}\\n\\nint sgn(ld a, const ld eps = 1e-7) {\\n return (a < -eps) ? -1 : (a > eps) ? 1 : 0;\\n}\\n\\nbool same_vec(vec a, vec b) {\\n a -= b;\\n return sgn(a.real()) == 0 && sgn(a.imag()) == 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\\n\\n} // namespace lib\\n#line 2 \\\"data_structure/dsu.hpp\\\"\\n\\n#line 4 \\\"data_structure/dsu.hpp\\\"\\n\\nnamespace noya2{\\n\\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 noya2\\n#line 6 \\\"geometry/partition_by_circle.hpp\\\"\\n\\nnamespace noya2{\\n\\nusing vec = complex<ld>;\\n\\nstruct circle {\\n vec c;\\n ld r;\\n};\\n\\n// c1 != c2\\nvector<ld> cross_point_x(const circle &c1, const circle &c2){\\n assert(sgn(abs(c1.r - c2.r)) != 0 || sgn(abs(c1.c - c2.c)) != 0);\\n ld d = abs(c1.c - c2.c);\\n // 円が離れすぎている\\n if (sgn(d - c1.r - c2.r) > 0) return {};\\n // 円が近すぎる\\n if (sgn(abs(c1.r - c2.r) - d) > 0) return {};\\n // 外接している\\n if (sgn(d - c1.r - c2.r) == 0){\\n return {(c1.r*c2.c.real() + c2.r*c1.c.real()) / (c1.r + c2.r)};\\n }\\n // 内接している\\n if (sgn(abs(c1.r - c2.r) - d) == 0){\\n return {(c1.r * c2.c.real() - c2.r * c1.c.real()) / (c1.r - c2.r)};\\n }\\n // 2 点を共有する\\n ld e = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\\n vec p = c1.c + (c2.c - c1.c) * e / d;\\n vec v((c1.c - c2.c).imag(),(c2.c - c1.c).real());\\n v *= sqrtl(max(c1.r * c1.r - e * e, ld(0))) / abs(v);\\n return {(p+v).real(),(p-v).real()};\\n}\\n\\nvector<ld> cross_point_y(const circle &c, const ld &x){\\n int cond = sgn(abs(c.c.real() - x) - c.r); \\n if (cond > 0) return {};\\n if (cond == 0) return {c.c.imag()};\\n ld ydiff = sqrtl(max(c.r*c.r - (x - c.c.real()) * (x - c.c.real()),ld(0)));\\n return {c.c.imag()+ydiff,c.c.imag()-ydiff};\\n}\\n\\nstruct Partition_by_Circles {\\n vector<circle> a;\\n // 同じ円は与えられない\\n void add_circle(circle c){\\n // x 座標で区切る場所が重ならないように 1 rad 回転しておく\\n c.c = rot(c.c,1);\\n a.emplace_back(c);\\n }\\n ld coordinate_width(){\\n ld res = 0.0;\\n for (auto &c : a){\\n chmax(res,abs(c.c)+c.r);\\n }\\n return res;\\n }\\n vector<ld> x_coordinates(){\\n vector<ld> xs;\\n for (auto &c : a){\\n xs.emplace_back(c.c.real()-c.r);\\n xs.emplace_back(c.c.real()+c.r);\\n }\\n int siza = a.size();\\n for (int i = 0; i < siza-1; i++) for (int j = i+1; j < siza; j++){\\n for (auto x : cross_point_x(a[i],a[j])){\\n bool yet = true;\\n for (auto testx : xs){\\n if (sgn(abs(x - testx)) == 0){\\n yet = false;\\n break;\\n }\\n }\\n if (yet) xs.emplace_back(x);\\n }\\n }\\n sort(all(xs));\\n return xs;\\n }\\n using ylr = tuple<ld,int,int>;\\n vector<ylr> y_coordinates(ld x){\\n vector<ylr> ys;\\n auto add = [&](ld y, int l, int r){\\n bool yet = true;\\n for (auto &[testy, testl, testr] : ys){\\n if (sgn(abs(y - testy)) == 0){\\n yet = false;\\n testl += l;\\n testr += r;\\n break;\\n }\\n }\\n if (yet) ys.push_back({y,l,r});\\n };\\n for (auto &c : a){\\n auto vecy = cross_point_y(c,x);\\n if (vecy.empty()) continue;\\n if ((int)(vecy.size()) == 2){\\n for (auto y : vecy) add(y,1,1);\\n }\\n else {\\n if (c.c.real() < x){\\n add(vecy[0],2,0);\\n }\\n else {\\n add(vecy[0],0,2);\\n }\\n }\\n }\\n sort(all(ys),[&](ylr lhs, ylr rhs){\\n return get<0>(lhs) < get<0>(rhs);\\n });\\n return ys;\\n }\\n dsu d;\\n vector<ld> xs;\\n vector<int> lower_idx;\\n map<int,int> mp;\\n vector<vector<int>> build_graph(ld max_width = 0){\\n // 大きな円で全体を囲ってしまう\\n if (sgn(max_width) == 0) max_width = coordinate_width()*2;\\n a.push_back({vec(0,0),max_width});\\n // x 座標の列挙\\n xs = x_coordinates();\\n // 各 x について y 座標の列挙\\n vector<vector<ylr>> yss; yss.reserve(xs.size());\\n for (auto &x : xs) yss.push_back(y_coordinates(x));\\n // x で切って領域を舐める\\n int idx = 0;\\n vector<pair<int,int>> es, merge;\\n vector<int> cur;\\n for (int itr = 0; itr < (int)(xs.size())-1; itr++){\\n lower_idx.emplace_back(idx);\\n vector<int> lid, rid;\\n for (int l = 0; l < (int)(yss[itr].size()); l++){\\n for (int t = 0; t < get<2>(yss[itr][l]); t++){\\n lid.emplace_back(l);\\n }\\n }\\n for (int r = 0; r < (int)(yss[itr+1].size()); r++){\\n for (int t = 0; t < get<1>(yss[itr+1][r]); t++){\\n rid.emplace_back(r);\\n }\\n }\\n assert(lid.size() == rid.size());\\n int pre = 0;\\n vector<int> nxt;\\n for (int i = 0; i < (int)(lid.size())-1; i++){\\n for (int t = 0; t < rid[i+1]-rid[i]; t++){\\n nxt.emplace_back(idx);\\n }\\n if (i != 0){\\n es.emplace_back(idx-1,idx);\\n }\\n if (lid[i+1] - lid[i] != 0){\\n merge.emplace_back(cur[pre++],idx);\\n }\\n if (lid[i+1] - lid[i] == 2){\\n merge.emplace_back(cur[pre++],idx);\\n }\\n idx++;\\n }\\n swap(cur,nxt);\\n }\\n // グラフを構築\\n d = dsu(idx);\\n for (auto &[u, v] : merge) d.merge(u,v);\\n set<int> st;\\n for (int i = 0; i < idx; i++) st.insert(d.leader(i));\\n int vid = 0;\\n for (auto v : st) mp[v] = vid++;\\n vector<vector<int>> graph(vid);\\n for (auto [u, v] : es){\\n u = mp[d.leader(u)];\\n v = mp[d.leader(v)];\\n graph[u].emplace_back(v);\\n graph[v].emplace_back(u);\\n }\\n return graph;\\n }\\n int get_area_idx(vec p){\\n p = rot(p,1);\\n int xid = int(lower_bound(all(xs),p.real()) - xs.begin()) - 1;\\n vector<ld> ys;\\n for (auto &[y, l, r] : y_coordinates(p.real())) ys.emplace_back(y);\\n int yid = int(lower_bound(all(ys),p.imag()) - ys.begin()) - 1;\\n return mp[d.leader(lower_idx[xid] + yid)];\\n }\\n};\\n\\n} //namespace noya2\\n#line 6 \\\"test/geometry/aoj1198.test.cpp\\\"\\n\\nint main(){\\n while (true){\\n int n, m; cin >> n >> m;\\n if (n == 0 && m == 0) break;\\n Partition_by_Circles pc;\\n while (n--){\\n ld x, y, r; cin >> x >> y >> r;\\n pc.add_circle(circle({vec(x,y),r}));\\n }\\n pc.build_graph(100000);\\n string ans = \\\"\\\";\\n while (m--){\\n ld px, py, qx, qy; cin >> px >> py >> qx >> qy;\\n int ip = pc.get_area_idx(vec(px,py));\\n int iq = pc.get_area_idx(vec(qx,qy));\\n ans += (ip == iq ? \\\"YES\\\" : \\\"NO\\\");\\n ans += (m == 0 ? '\\\\n' : ' ');\\n }\\n cout << ans;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 4640,\n \"score_of_the_acc\": -0.3014,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1198_7993928\",\n \"code_snippet\": \"#line 1 \\\"test/geometry/aoj1198.test.cpp\\\"\\n#define PROBLEM \\\"https://onlinejudge.u-aizu.ac.jp/problems/1198\\\"\\n\\n#line 2 \\\"template/template.hpp\\\"\\n\\n#include<bits/stdc++.h>\\n\\n#define rep(i,n) for (int i = 0; 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 ull = unsigned long long;\\n\\nusing namespace std;\\n\\nnamespace noya2{\\n\\n/* ~ (. _________ . /) */\\n\\n}\\n\\nusing namespace noya2;\\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\\ntemplate<class T>istream &operator>>(istream &is, vector<T> &v){\\n for (auto &e : v) is >> e;\\n return is;\\n}\\n\\nvoid fast_io(){\\n cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(15);\\n}\\n\\nconst int iinf = 1'000'000'007;\\nconst ll linf = 2e18;\\n#line 4 \\\"test/geometry/aoj1198.test.cpp\\\"\\n\\n#line 2 \\\"geometry/partition_by_circle.hpp\\\"\\n\\n#line 2 \\\"geometry/base_ld.hpp\\\"\\n\\n#line 4 \\\"geometry/base_ld.hpp\\\"\\n\\nnamespace noya2 {\\n\\nusing vec = complex<ld>;\\n\\nconst ld PI = acos(-1);\\n\\nvoid ldout(int len = 20) {\\n cout << fixed << setprecision(len);\\n}\\n\\nint sgn(ld a, const ld eps = 1e-7) {\\n return (a < -eps) ? -1 : (a > eps) ? 1 : 0;\\n}\\n\\nbool same_vec(vec a, vec b) {\\n a -= b;\\n return sgn(a.real()) == 0 && sgn(a.imag()) == 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#line 5 \\\"geometry/partition_by_circle.hpp\\\"\\n\\nnamespace noya2{\\n\\nstruct dsu {\\n dsu(int n = 0) : _n(n), pos(n, -1) {}\\n\\n int merge(int a, int b) {\\n int x = leader(a), y = leader(b);\\n if (x == y) return x;\\n if (-pos[x] < -pos[y]) swap(x, y);\\n pos[x] += pos[y];\\n pos[y] = x;\\n return x;\\n }\\n\\n bool same(int a, int b) {\\n return leader(a) == leader(b);\\n }\\n\\n int leader(int a) {\\n if (pos[a] < 0) return a;\\n return pos[a] = leader(pos[a]);\\n }\\n private:\\n int _n;\\n vector<int> pos;\\n};\\n\\nusing vec = complex<ld>;\\n\\nstruct circle {\\n vec c;\\n ld r;\\n};\\n\\n// c1 != c2\\nvector<ld> cross_point_x(const circle &c1, const circle &c2){\\n assert(sgn(abs(c1.r - c2.r)) != 0 || sgn(abs(c1.c - c2.c)) != 0);\\n ld d = abs(c1.c - c2.c);\\n // 円が離れすぎている\\n if (sgn(d - c1.r - c2.r) > 0) return {};\\n // 円が近すぎる\\n if (sgn(abs(c1.r - c2.r) - d) > 0) return {};\\n // 外接している\\n if (sgn(d - c1.r - c2.r) == 0){\\n return {(c1.r*c2.c.real() + c2.r*c1.c.real()) / (c1.r + c2.r)};\\n }\\n // 内接している\\n if (sgn(abs(c1.r - c2.r) - d) == 0){\\n return {(c1.r * c2.c.real() - c2.r * c1.c.real()) / (c1.r - c2.r)};\\n }\\n // 2 点を共有する\\n ld e = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\\n vec p = c1.c + (c2.c - c1.c) * e / d;\\n vec v((c1.c - c2.c).imag(),(c2.c - c1.c).real());\\n v *= sqrtl(max(c1.r * c1.r - e * e, ld(0))) / abs(v);\\n return {(p+v).real(),(p-v).real()};\\n}\\n\\nvector<ld> cross_point_y(const circle &c, const ld &x){\\n int cond = sgn(abs(c.c.real() - x) - c.r); \\n if (cond > 0) return {};\\n if (cond == 0) return {c.c.imag()};\\n ld ydiff = sqrtl(max(c.r*c.r - (x - c.c.real()) * (x - c.c.real()),ld(0)));\\n return {c.c.imag()+ydiff,c.c.imag()-ydiff};\\n}\\n\\nstruct Partition_by_Circles {\\n vector<circle> a;\\n // 同じ円は与えられない\\n void add_circle(circle c){\\n // x 座標で区切る場所が重ならないように 1 rad 回転しておく\\n c.c = rot(c.c,1);\\n a.emplace_back(c);\\n }\\n ld coordinate_width(){\\n ld res = 0.0;\\n for (auto &c : a){\\n chmax(res,abs(c.c)+c.r);\\n }\\n return res;\\n }\\n vector<ld> x_coordinates(){\\n vector<ld> xs;\\n for (auto &c : a){\\n xs.emplace_back(c.c.real()-c.r);\\n xs.emplace_back(c.c.real()+c.r);\\n }\\n int siza = a.size();\\n for (int i = 0; i < siza-1; i++) for (int j = i+1; j < siza; j++){\\n for (auto x : cross_point_x(a[i],a[j])){\\n bool yet = true;\\n for (auto testx : xs){\\n if (sgn(abs(x - testx)) == 0){\\n yet = false;\\n break;\\n }\\n }\\n if (yet) xs.emplace_back(x);\\n }\\n }\\n sort(all(xs));\\n return xs;\\n }\\n using ylr = tuple<ld,int,int>;\\n vector<ylr> y_coordinates(ld x){\\n vector<ylr> ys;\\n auto add = [&](ld y, int l, int r){\\n bool yet = true;\\n for (auto &[testy, testl, testr] : ys){\\n if (sgn(abs(y - testy)) == 0){\\n yet = false;\\n testl += l;\\n testr += r;\\n break;\\n }\\n }\\n if (yet) ys.push_back({y,l,r});\\n };\\n for (auto &c : a){\\n auto vecy = cross_point_y(c,x);\\n if (vecy.empty()) continue;\\n if ((int)(vecy.size()) == 2){\\n for (auto y : vecy) add(y,1,1);\\n }\\n else {\\n if (c.c.real() < x){\\n add(vecy[0],2,0);\\n }\\n else {\\n add(vecy[0],0,2);\\n }\\n }\\n }\\n sort(all(ys),[&](ylr lhs, ylr rhs){\\n return get<0>(lhs) < get<0>(rhs);\\n });\\n return ys;\\n }\\n dsu d;\\n vector<ld> xs;\\n vector<int> lower_idx;\\n map<int,int> mp;\\n vector<vector<int>> build_graph(){\\n // 大きな円で全体を囲ってしまう\\n a.push_back({vec(0,0),coordinate_width()*2});\\n // x 座標の列挙\\n xs = x_coordinates();\\n // 各 x について y 座標の列挙\\n vector<vector<ylr>> yss; yss.reserve(xs.size());\\n for (auto &x : xs) yss.push_back(y_coordinates(x));\\n // x で切って領域を舐める\\n int idx = 0;\\n vector<pair<int,int>> es, merge;\\n vector<int> cur;\\n for (int itr = 0; itr < (int)(xs.size())-1; itr++){\\n lower_idx.emplace_back(idx);\\n vector<int> lid, rid;\\n for (int l = 0; l < (int)(yss[itr].size()); l++){\\n for (int t = 0; t < get<2>(yss[itr][l]); t++){\\n lid.emplace_back(l);\\n }\\n }\\n for (int r = 0; r < (int)(yss[itr+1].size()); r++){\\n for (int t = 0; t < get<1>(yss[itr+1][r]); t++){\\n rid.emplace_back(r);\\n }\\n }\\n assert(lid.size() == rid.size());\\n int pre = 0;\\n vector<int> nxt;\\n for (int i = 0; i < (int)(lid.size())-1; i++){\\n for (int t = 0; t < rid[i+1]-rid[i]; t++){\\n nxt.emplace_back(idx);\\n }\\n if (i != 0){\\n es.emplace_back(idx-1,idx);\\n }\\n if (lid[i+1] - lid[i] != 0){\\n merge.emplace_back(cur[pre++],idx);\\n }\\n if (lid[i+1] - lid[i] == 2){\\n merge.emplace_back(cur[pre++],idx);\\n }\\n idx++;\\n }\\n swap(cur,nxt);\\n }\\n // グラフを構築\\n d = dsu(idx);\\n for (auto &[u, v] : merge) d.merge(u,v);\\n set<int> st;\\n for (int i = 0; i < idx; i++) st.insert(d.leader(i));\\n int vid = 0;\\n for (auto v : st) mp[v] = vid++;\\n vector<vector<int>> graph(vid);\\n for (auto [u, v] : es){\\n u = mp[d.leader(u)];\\n v = mp[d.leader(v)];\\n graph[u].emplace_back(v);\\n graph[v].emplace_back(u);\\n }\\n return graph;\\n }\\n int get_area_idx(vec p){\\n p = rot(p,1);\\n int xid = int(lower_bound(all(xs),p.real()) - xs.begin()) - 1;\\n vector<ld> ys;\\n for (auto &[y, l, r] : y_coordinates(p.real())) ys.emplace_back(y);\\n int yid = int(lower_bound(all(ys),p.imag()) - ys.begin()) - 1;\\n return mp[d.leader(lower_idx[xid] + yid)];\\n }\\n};\\n\\n} //namespace noya2\\n#line 6 \\\"test/geometry/aoj1198.test.cpp\\\"\\n\\nint main(){\\n while (true){\\n int n, m; cin >> n >> m;\\n if (n == 0 && m == 0) break;\\n Partition_by_Circles pc;\\n while (n--){\\n ld x, y, r; cin >> x >> y >> r;\\n pc.add_circle(circle({vec(x,y),r}));\\n }\\n pc.build_graph();\\n string ans = \\\"\\\";\\n while (m--){\\n ld px, py, qx, qy; cin >> px >> py >> qx >> qy;\\n int ip = pc.get_area_idx(vec(px,py));\\n int iq = pc.get_area_idx(vec(qx,qy));\\n ans += (ip == iq ? \\\"YES\\\" : \\\"NO\\\");\\n ans += (m == 0 ? '\\\\n' : ' ');\\n }\\n cout << ans;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 4724,\n \"score_of_the_acc\": -0.3171,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1198_7200612\",\n \"code_snippet\": \"#include <cmath>\\n#include <vector>\\n#include <iostream>\\n#include <algorithm>\\nusing namespace std;\\n\\nclass edge {\\npublic:\\n\\tint to; bool vis;\\n\\tedge() : to(-1), vis(false) {}\\n\\tedge(int to_, bool vis_) : to(to_), vis(vis_) {}\\n};\\n\\nint main() {\\n\\twhile (true) {\\n\\t\\tint N, M;\\n\\t\\tcin >> N >> M;\\n\\t\\tif (N == 0 && M == 0) {\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tvector<int> IX(N), IY(N), IR(N);\\n\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\tcin >> IX[i] >> IY[i] >> IR[i];\\n\\t\\t}\\n\\t\\tauto sqr = [](int x) {\\n\\t\\t\\treturn x * x;\\n\\t\\t};\\n\\t\\tvector<bool> answers(M, true);\\n\\t\\tfor (int id = 0; id < M; id++) {\\n\\t\\t\\tint PX, PY, QX, QY;\\n\\t\\t\\tcin >> PX >> PY >> QX >> QY;\\n\\t\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\t\\tif ((sqr(PX - IX[i]) + sqr(PY - IY[i]) < sqr(IR[i])) != (sqr(QX - IX[i]) + sqr(QY - IY[i]) < sqr(IR[i]))) {\\n\\t\\t\\t\\t\\tanswers[id] = false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (answers[id]) {\\n\\t\\t\\t\\t// step #1. find all necessary circles\\n\\t\\t\\t\\tvector<int> X, Y, R;\\n\\t\\t\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\t\\t\\tif (sqr(PX - IX[i]) + sqr(PY - IY[i]) >= sqr(IR[i])) {\\n\\t\\t\\t\\t\\t\\tX.push_back(IX[i]);\\n\\t\\t\\t\\t\\t\\tY.push_back(IY[i]);\\n\\t\\t\\t\\t\\t\\tR.push_back(IR[i]);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tint K = X.size();\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// step #2. make graph\\n\\t\\t\\t\\tvector<vector<edge> > G(K);\\n\\t\\t\\t\\tfor (int i = 0; i < K; i++) {\\n\\t\\t\\t\\t\\tfor (int j = i + 1; j < K; j++) {\\n\\t\\t\\t\\t\\t\\tint dist = sqr(X[j] - X[i]) + sqr(Y[j] - Y[i]);\\n\\t\\t\\t\\t\\t\\tif (sqr(R[i] - R[j]) < dist && dist < sqr(R[i] + R[j])) {\\n\\t\\t\\t\\t\\t\\t\\tG[i].push_back(edge(j, false));\\n\\t\\t\\t\\t\\t\\t\\tG[j].push_back(edge(i, false));\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tfor (int i = 0; i < K; i++) {\\n\\t\\t\\t\\t\\tsort(G[i].begin(), G[i].end(), [&](const edge& ea, const edge& eb) {\\n\\t\\t\\t\\t\\t\\treturn atan2(Y[ea.to] - Y[i], X[ea.to] - X[i]) < atan2(Y[eb.to] - Y[i], X[eb.to] - X[i]);\\n\\t\\t\\t\\t\\t});\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// step #3. compute polygons\\n\\t\\t\\t\\tvector<vector<int> > polygons;\\n\\t\\t\\t\\tfor (int i = 0; i < K; i++) {\\n\\t\\t\\t\\t\\tfor (edge &e : G[i]) {\\n\\t\\t\\t\\t\\t\\tif (e.vis == false) {\\n\\t\\t\\t\\t\\t\\t\\tvector<int> subpolygon;\\n\\t\\t\\t\\t\\t\\t\\tint pre = i, pos = e.to;\\n\\t\\t\\t\\t\\t\\t\\tdo {\\n\\t\\t\\t\\t\\t\\t\\t\\tsubpolygon.push_back(pos);\\n\\t\\t\\t\\t\\t\\t\\t\\tfor (int j = 0; j < int(G[pos].size()); j++) {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tif (G[pos][j].to == pre) {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tpre = pos;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tpos = G[pos][(j + 1) % G[pos].size()].to;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tG[pos][(j + 1) % G[pos].size()].vis = true;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t} while(pos != e.to);\\n\\t\\t\\t\\t\\t\\t\\tpolygons.push_back(subpolygon);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// step #4. check if a point is inside polygon\\n\\t\\t\\t\\tauto is_inside = [&](const vector<int>& poly, int x, int y) {\\n\\t\\t\\t\\t\\tint crosses = 0;\\n\\t\\t\\t\\t\\tfor (int i = 0; i < int(poly.size()); i++) {\\n\\t\\t\\t\\t\\t\\tint xa = X[poly[i]], ya = Y[poly[i]];\\n\\t\\t\\t\\t\\t\\tint xb = X[poly[(i + 1) % poly.size()]], yb = Y[poly[(i + 1) % poly.size()]];\\n\\t\\t\\t\\t\\t\\tif (ya > yb) {\\n\\t\\t\\t\\t\\t\\t\\tswap(xa, xb);\\n\\t\\t\\t\\t\\t\\t\\tswap(ya, yb);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tif (ya <= y && y < yb && (xa - x) * (yb - y) - (xb - x) * (ya - y) >= 0) {\\n\\t\\t\\t\\t\\t\\t\\tcrosses += 1;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\treturn (crosses % 2 == 1);\\n\\t\\t\\t\\t};\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// step #5. check for all polygons\\n\\t\\t\\t\\tfor (vector<int> poly : polygons) {\\n\\t\\t\\t\\t\\tif (is_inside(poly, PX, PY) != is_inside(poly, QX, QY)) {\\n\\t\\t\\t\\t\\t\\tanswers[id] = false;\\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}\\n\\t\\tfor (int i = 0; i < M; i++) {\\n\\t\\t\\tif (i != 0) cout << ' ';\\n\\t\\t\\tcout << (answers[i] ? \\\"YES\\\" : \\\"NO\\\");\\n\\t\\t}\\n\\t\\tcout << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3748,\n \"score_of_the_acc\": -0.094,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1198_7127374\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nusing ld = long double;\\nusing point = complex<ld>;\\nusing polygon = vector<point>;\\n\\nconst ld pi = acosl(-1);\\n\\nconstexpr ld eps = 1e-9;\\n\\nbool is_zero(ld x) {\\n return abs(x) < eps;\\n}\\nint compare(ld x, ld y) {\\n return is_zero(x - y) ? 0 : x < y ? -1 : +1;\\n}\\n\\nstruct circle {\\n point p;\\n ld r;\\n circle() : p(0), r(0) {}\\n circle(point p, ld r) : p(p), r(r) {}\\n\\n bool contains(point q) {\\n return compare(abs(p - q), r) <= 0;\\n }\\n};\\n\\nbool is_in_polygon(polygon poly, point p) {\\n int n = poly.size();\\n ld sum = 0;\\n for (int i = 0; i < n; ++i) {\\n point p1 = poly[i], p2 = poly[(i + 1) % n];\\n sum += arg((p2 - p) / (p1 - p));\\n }\\n return abs(sum) >= pi / 2;\\n}\\n\\nvoid solve(int n, int m, vector<circle> cs) {\\n vector<vector<int>> g = [&] {\\n vector<set<int>> g(n);\\n for (int i = 0; i < n; ++i) for (int j = 0; j < i; ++j) {\\n ld d = abs(cs[i].p - cs[j].p);\\n ld dl = abs(cs[i].r - cs[j].r), dr = cs[i].r + cs[j].r;\\n if (compare(dl, d) < 0 and compare(d, dr) < 0) {\\n g[i].insert(j);\\n g[j].insert(i);\\n }\\n }\\n\\n auto deg_comp = [&](int i, int j) { return g[i].size() == g[j].size() ? i < j : g[i].size() < g[j].size(); };\\n set<int, decltype(deg_comp)> st{ deg_comp };\\n\\n for (int i = 0; i < n; ++i) st.insert(i);\\n\\n while (st.size()) {\\n int u = *st.begin();\\n st.erase(st.begin());\\n if (g[u].size() == 0) continue;\\n if (g[u].size() >= 2) break;\\n int v = *g[u].begin();\\n g[u].clear();\\n st.erase(v);\\n g[v].erase(u);\\n st.insert(v);\\n }\\n\\n vector<vector<int>> res(n);\\n for (int i = 0; i < n; ++i) for (int j : g[i]) res[i].push_back(j);\\n return res;\\n }();\\n\\n vector<map<int, int>> idx(n);\\n\\n for (int i = 0; i < n; ++i) {\\n sort(\\n g[i].begin(), g[i].end(),\\n [&](int x, int y) {\\n point p = cs[x].p - cs[i].p;\\n point q = cs[y].p - cs[i].p;\\n return arg(p) < arg(q);\\n }\\n );\\n int siz = g[i].size();\\n for (int j = 0; j < siz; ++j) {\\n idx[i][g[i][j]] = j;\\n }\\n }\\n\\n vector<vector<int8_t>> seen(n);\\n for (int i = 0; i < n; ++i) {\\n seen[i].resize(g[i].size(), false);\\n }\\n\\n vector<polygon> polygons;\\n\\n for (int i = 0; i < n; ++i) for (int j = 0; j < int(g[i].size()); ++j) if (not seen[i][j]) {\\n polygon poly;\\n for (int u = i, k = j;;) {\\n poly.push_back(cs[u].p);\\n int v = g[u][k];\\n int rev_k = idx[v][u];\\n assert(not seen[u][k]);\\n seen[u][k] = true;\\n int nk = (rev_k + g[v].size() - 1) % g[v].size();\\n u = v, k = nk;\\n if (u == i and k == j) {\\n break;\\n }\\n }\\n polygons.push_back(poly);\\n // for (auto p : poly) {\\n // cerr << \\\"(\\\" << real(p) << \\\", \\\" << imag(p) << \\\"), \\\";\\n // }\\n // cerr << endl;\\n }\\n\\n for (int i = 0; i < m; ++i) {\\n point p, q;\\n\\n {\\n ld x1, y1, x2, y2;\\n cin >> x1 >> y1 >> x2 >> y2;\\n p = { x1, y1 };\\n q = { x2, y2 };\\n }\\n\\n vector<int> cp, cq;\\n for (int i = 0; i < n; ++i) {\\n if (cs[i].contains(p)) {\\n cp.push_back(i);\\n }\\n if (cs[i].contains(q)) {\\n cq.push_back(i);\\n }\\n }\\n\\n string ans = \\\"YES\\\";\\n\\n if (cp.size() or cq.size()) {\\n if (cp != cq) {\\n ans = \\\"NO\\\";\\n }\\n } else {\\n for (const auto& poly : polygons) {\\n if (is_in_polygon(poly, p) xor is_in_polygon(poly, q)) {\\n ans = \\\"NO\\\";\\n break;\\n }\\n }\\n }\\n\\n cout << ans << \\\" \\\\n\\\"[i == m - 1];\\n }\\n}\\n\\nint main() {\\n while (true) {\\n int n, m;\\n cin >> n >> m;\\n\\n if (n == 0 and m == 0) break;\\n\\n vector<circle> cs(n);\\n for (int i = 0; i < n; ++i) {\\n ld x, y, r;\\n cin >> x >> y >> r;\\n cs[i] = { point(x, y), r };\\n }\\n\\n solve(n, m, cs);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3512,\n \"score_of_the_acc\": -0.0501,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1198_6028340\",\n \"code_snippet\": \"/*\\n正規版\\nメモ\\nnorm(P) Pの絶対値の2乗 abs(P)の2乗\\nabs(P) Pの絶対値\\narg(P)の戻り値の範囲は[-π, π]\\npolar(長さ,角度(ラジアン))でPointができる\\nint(-2.2+0.5)=-1\\n*/\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\ntemplate<class T,class U>constexpr bool chmin(T&a,const U b){if(a<=b)return false;a=b;return true;}\\ntemplate<class T,class U>constexpr bool chmax(T&a,const U b){if(a>=b)return false;a=b;return true;}\\ntemplate<class T,class U>constexpr bool bitUP(const T n,const U k){return (n>>k)&1;}\\n\\n////////////////////////////\\n// マクロや型\\n////////////////////////////\\n\\nusing DD=long double;\\n\\nconst DD EPS=1e-9;\\nconst DD INF=1e50;\\nconst DD PI=acosl(-1.0);\\n#define EQ(a,b) (abs( (a) - (b) )<EPS) //a==b\\n#define LS(a,b) ( (a)+EPS<(b) ) //a<b\\n#define GR(a,b) ( (a)>(b)+EPS ) //a>b\\n#define LE(a,b) ( (a)<(b)+EPS ) //a<=b\\n#define GE(a,b) ( (a)>(b)-EPS ) //a>=b\\n\\n#define X real()\\n#define Y imag()\\n\\n\\n//点\\nusing Point=complex<DD>;\\nistream &operator>>(istream &is, Point &p) {\\n DD x,y;\\n is>>x>>y;\\n p=Point(x,y);\\n return is;\\n}\\nvoid debug(Point p,string name=\\\"\\\"){\\n cout<<p.X<<\\\" \\\"<<p.Y<<\\\" \\\"<<name<<endl;\\n}\\n\\n//点a→点bの線分\\n//aとbが等しい時、色々バグるから注意!\\nstruct Segment{\\n Point a,b;\\n Segment()=default;\\n Segment(Point a,Point b) :a(a),b(b){}\\n Segment(DD ax,DD ay,DD bx,DD by):a(ax,ay),b(bx,by){}\\n Segment(DD r,Point a) :a(a),b(a+polar((DD)1.0,r)){}\\n void debug(bool isLine=false,string name=\\\"\\\"){\\n string type=\\\"Segment \\\";\\n if(isLine) type=\\\"Line \\\";\\n cout<<type<<a.X<<\\\" \\\"<<a.Y<<\\\" \\\"<<b.X<<\\\" \\\"<<b.Y<<\\\" \\\"<<name<<endl;\\n }\\n};\\nusing Line=Segment;\\n\\n//円\\nstruct Circle{\\n Point p;\\n DD r;\\n Circle()=default;\\n Circle(Point p,DD r):p(p),r(r){}\\n void debug(string name=\\\"\\\"){\\n cout<<p.X<<\\\" \\\"<<p.Y<<\\\" \\\"<<\\\"circle\\\"<<\\\"_\\\"<<name<<endl;\\n cout<<\\\"Circle \\\"<<p.X<<\\\" \\\"<<p.Y<<\\\" \\\"<<r<<endl;\\n }\\n};\\n\\nusing Polygon=vector<Point>;\\nvoid debug(Polygon pol,string name=\\\"\\\"){\\n cout<<\\\"Polygon\\\"<<\\\" \\\"<<name<<endl;\\n for(auto p:pol){\\n cout<<p.X<<\\\" \\\"<<p.Y<<endl;\\n }\\n cout<<\\\"...\\\"<<endl;\\n}\\n\\n////////////////////////////\\n// 基本計算\\n////////////////////////////\\n\\n//度→ラジアン\\ninline DD torad(const DD deg){return deg*PI/180;}\\n//ラジアン→度\\ninline DD todeg(const DD rad){return rad*180/PI;}\\n//内積 |a||b|cosθ\\ninline DD dot(const Point &a,const Point &b){return (conj(a)*b).X;}\\n//外積 |a||b|sinθ\\ninline DD cross(const Point &a,const Point &b){return (conj(a)*b).Y;}\\n//ベクトルpを反時計回りにtheta(ラジアン)回転\\nPoint rotate(const Point &p,const DD theta){return p*Point(cos(theta),sin(theta));}\\n\\n//余弦定理 cos(角度abc(ラジアン))を返す\\n//長さの対応に注意 ab:辺abの長さ\\n//verify:https://codeforces.com/gym/102056/problem/F\\nDD cosine_formula(const DD ab,const DD bc,const DD ca){\\n return (ab*ab+bc*bc-ca*ca)/(2*ab*bc);\\n}\\n\\ninline bool xy_sort(const Point &a,const Point &b){\\n if(a.X+EPS<b.X) return true;\\n if(EQ(a.X,b.X) && a.Y+EPS<b.Y) return true;\\n return false;\\n}\\ninline bool yx_sort(const Point &a,const Point &b){\\n if(a.Y+EPS<b.Y) return true;\\n if(EQ(a.Y,b.Y) && a.X+EPS<b.X) return true;\\n return false;\\n}\\nnamespace std{\\n inline bool operator<(const Point &a,const Point &b)noexcept{\\n return xy_sort(a,b);\\n }\\n}\\n//DDの比較関数\\n//map<DD,vector<pii>,DDcom>\\nstruct DDcom{\\n bool operator()(const DD a, const DD b) const noexcept {\\n return a+EPS<b;\\n }\\n};\\n\\n\\n////////////////////////////\\n// 平行や直交\\n////////////////////////////\\n\\nbool isOrthogonal(const Point &a,const Point &b){\\n return EQ(dot(a,b),0.0);\\n}\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\nbool isOrthogonal(const Segment &s,const Segment &t){\\n return EQ(dot(s.a-s.b,t.a-t.b),0.0);\\n}\\nbool isParallel(const Point &a,const Point &b){\\n return EQ(cross(a,b),0.0);\\n}\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\nbool isParallel(const Segment &s,const Segment &t){\\n return EQ(cross(s.a-s.b,t.a-t.b),0);\\n}\\n//線分a→bに対して点cがどの位置にあるか\\n//反時計回り:1 時計回り:-1 直線上(a,b,c:-2 a,c,b:0 c,a,b:2)\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\\n//線分a→bの端点にcがあるなら0と判定されるはず\\nint ccw(const Point &a,Point b,Point c){\\n if(EQ(abs(b-c),0) or EQ(abs(a-c),0)) return 0;\\n b-=a;c-=a;\\n if(cross(b,c)>EPS) return 1;\\n if(cross(b,c)<-EPS) return -1;\\n if(dot(b,c)<-EPS) return 2;\\n if(LS(norm(b),norm(c))) return -2;\\n return 0;\\n}\\n\\n////////////////////////////\\n// 射影と反射\\n////////////////////////////\\n\\n//射影\\n//直線lに点pから垂線を引いたときの交点\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\\nPoint project(const Point &p,const Line &l){\\n Point base=l.b-l.a;\\n DD r=dot(p-l.a,base)/norm(base);\\n return l.a+base*r;\\n}\\n//反射\\n//直線lに対して点pと対称な点\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\\nPoint reflect(const Point &p,const Line &l){\\n return p+(project(p,l)-p)*(DD)2.0;\\n}\\n//反射\\n//直線lに対して線分sと対称な線分(直線でも使える)\\n//verify:https://onlinejudge.u-aizu.ac.jp/solutions/problem/1171/review/6009447/bin101/C++17\\nSegment reflect(const Segment &s,const Line &l){\\n return Segment(reflect(s.a,l) , reflect(s.b,l));\\n}\\n\\n////////////////////////////\\n// 点との距離\\n////////////////////////////\\n\\n//点と直線の距離\\nDD DistPL(const Point &p,const Line &l){\\n return abs(cross(l.b-l.a,p-l.a))/abs(l.b-l.a);\\n}\\n//点と線分の距離\\nDD DistPS(const Point &p,const Segment &s){\\n if( dot(s.b-s.a,p-s.a)<0.0 ) return abs(p-s.a);\\n if( dot(s.a-s.b,p-s.b)<0.0 ) return abs(p-s.b);\\n return DistPL(p,s);\\n}\\n\\n////////////////////////////\\n// 線分と直線\\n////////////////////////////\\n\\n//線分a-b,c-dは交差するか?\\n//接する場合も交差すると判定\\n//接する場合は交差しないとするなら<=を<に変換\\nbool intersect(const Point &a,const Point &b,const Point &c,const Point &d){\\n return(ccw(a,b,c)*ccw(a,b,d)<=0 && ccw(c,d,a)*ccw(c,d,b)<=0);\\n}\\n//線分s,tは交差するか？\\n//接する場合も交差すると判定\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B&lang=ja\\n//接する場合は交差しないとするならintersectの<=を<に変換\\nbool intersect(const Segment &s,const Segment &t){\\n return intersect(s.a,s.b,t.a,t.b);\\n}\\n// 2直線の交点\\n// 線分の場合はintersectをしてから使う\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_C&lang=ja\\nPoint crossPoint(const Line &s,const Line &t){\\n Point base=t.b-t.a;\\n DD d1=cross(base,t.a-s.a);\\n DD d2=cross(base,s.b-s.a);\\n if(EQ(d1,0) and EQ(d2,0)) return s.a; //同じ直線\\n if(EQ(d2,0)) assert(false); //交点がない\\n return s.a+d1/d2*(s.b-s.a);\\n}\\n//線分と線分の距離\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_D&lang=ja\\nDD Dist(const Segment &s,const Segment &t){\\n if(intersect(s,t)) return 0.0;\\n return min(min(DistPS(t.a,s),DistPS(t.b,s)),min(DistPS(s.a,t),DistPS(s.b,t)) );\\n}\\nbool issame(const Line &l,const Line &m){\\n if (GR(abs(cross(m.a - l.a, l.b - l.a)),0) ) return false;\\n if (GR(abs(cross(m.b - l.a, l.b - l.a)),0) ) return false;\\n return true;\\n}\\n\\n////////////////////////////\\n// 円\\n////////////////////////////\\n//直線lと円Cの交点\\n//l.aにより近い方がindexが小さい\\n//veirfy:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\\nvector<Point> crossPointLC(const Line &l,const Circle &c){\\n vector<Point> ret;\\n if(GR(DistPL(c.p,l),c.r)) return ret; //交点がないとき、空ベクトルを返す\\n Point pr=project(c.p,l);\\n Point e=(l.b-l.a)/(abs(l.b-l.a));\\n DD base=sqrt(c.r*c.r-norm(pr-c.p));\\n ret.push_back(pr-e*base);\\n ret.push_back(pr+e*base);\\n if(EQ(DistPL(c.p,l),c.r)) ret.pop_back(); //接するとき\\n return ret;\\n}\\n//線分sと円cの交点\\n//交点がないときは空ベクトルを返す\\n//線分の端が交わる場合も交点とみなす\\n//s.aにより近い方がindexが小さい\\nvector<Point> crossPointSC(const Segment &s,const Circle &c){\\n vector<Point> ret;\\n if(DistPS(c.p,s)>c.r+EPS) return ret;\\n auto koho=crossPointLC(s,c);\\n for(auto p:koho){\\n if(ccw(s.a,s.b,p)==0 or EQ(abs(p-s.a),0) or EQ(abs(p-s.b),0)) ret.push_back(p);\\n }\\n return ret;\\n}\\n\\n//円aと円bの共通接線の数\\n//離れている:4 外接:3 交わる:2 内接:1 内包:0\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A\\nint intersect(const Circle &a,const Circle &b){\\n DD d=abs(a.p-b.p);\\n if(GR(d,a.r+b.r)) return 4;\\n if(EQ(d,a.r+b.r)) return 3;\\n if(EQ(d,abs(a.r-b.r))) return 1;\\n if(LS(d,abs(a.r-b.r))) return 0;\\n return 2;\\n}\\n\\n//円aと円bの交点\\n//交点がないときは空ベクトルを返す\\n//事前にintersectをしたほうがいいかも\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\\nvector<Point> crossPoint(const Circle &a,const Circle &b){\\n vector<Point> ret;\\n if(GR(abs(a.p-b.p),a.r+b.r)) return ret;\\n DD d=abs(a.p-b.p);\\n DD s=acosl((a.r*a.r+d*d-b.r*b.r)/(2*a.r*d)); //0~π\\n DD t=arg(b.p-a.p);\\n if(EQ(a.r+b.r,d)) ret.push_back(a.p+polar(a.r,t));\\n else ret.push_back(a.p+polar(a.r,t+s)),ret.push_back(a.p+polar(a.r,t-s));\\n return ret;\\n}\\n\\n//点pから円cに接線を引いたときの接点\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F&lang=ja\\nvector<Point> TanLine(const Point &p,const Circle &c){\\n vector<Point> ret;\\n DD d=abs(p-c.p);\\n if(LS(d,c.r)) return ret; //pがcの内部にある場合\\n if(EQ(d,c.r)){\\n ret.push_back(p);\\n return ret; //円の線上にある場合\\n } \\n return crossPoint(c,Circle(p,sqrt(d*d-c.r*c.r)));\\n}\\n\\n//円a,bの共通接線\\n//https://www.slideshare.net/kujira16/ss-35861169\\n//Line.aは円aと接線の交点\\n//(接線と円bの交点)と(接線と円aの交点)が違う場合はLine.bは(接線と円bの交点)\\n//一致する場合は円aの中心からLine.aに向かうベクトルを反時計回りに90度回転したものを\\n//Line.aに足したもの\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_G\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2201\\nvector<Line> TanLine(const Circle &a,const Circle &b){\\n DD d=abs(a.p-b.p);\\n vector<Line> ret;\\n //外接線\\n if(intersect(a,b)>=2){\\n if(EQ(a.r,b.r)){\\n Point up=polar(a.r,arg(b.p-a.p)+PI/2);\\n ret.emplace_back(a.p+up,b.p+up);\\n ret.emplace_back(a.p-up,b.p-up);\\n }else{\\n Point q=(a.p*b.r-b.p*a.r)/(b.r-a.r);\\n auto as=TanLine(q,a);\\n auto bs=TanLine(q,b);\\n assert(as.size()==2 and bs.size()==2);\\n for(int i=0;i<2;i++){\\n ret.emplace_back(as[i],bs[i]);\\n }\\n }\\n }else if(intersect(a,b)==1){ //内接する場合\\n Point dir;\\n if(a.r>b.r) dir=polar(a.r,arg(b.p-a.p));\\n else dir=polar(a.r,arg(a.p-b.p));\\n ret.emplace_back(a.p+dir,a.p+dir+rotate(dir,PI/2));\\n }\\n //内接線\\n if(GR(abs(a.p-b.p),a.r+b.r)){ //円が離れている場合\\n Point q=a.p+(b.p-a.p)*a.r/(a.r+b.r);\\n auto as=TanLine(q,a);\\n auto bs=TanLine(q,b);\\n assert(as.size()==2 and bs.size()==2);\\n for(int i=0;i<2;i++){\\n ret.emplace_back(as[i],bs[i]);\\n }\\n }else if(EQ(d,a.r+b.r)){ //円が接している場合\\n Point dir=polar(a.r,arg(b.p-a.p));\\n ret.emplace_back(a.p+dir,a.p+dir+rotate(dir,PI/2));\\n }\\n return ret;\\n}\\n//２つの円の共通部分の面積\\n//参考: https://tjkendev.github.io/procon-library/python/geometry/circles_intersection_area.html\\n//verify: https://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=6005736#1\\nDD Area(const Circle &c1,const Circle &c2){\\n DD cd=abs(c1.p-c2.p);\\n if(LE(c1.r+c2.r,cd)) return 0; //円が離れている\\n\\n if(LE(cd,abs(c1.r-c2.r))) //片方の円が他方を包んでいる\\n return min(c1.r,c2.r)*min(c1.r,c2.r)*PI;\\n\\n DD theta1=acosl(cosine_formula(c1.r,cd,c2.r));\\n DD theta2=acosl(cosine_formula(c2.r,cd,c1.r));\\n\\n return c1.r*c1.r*theta1+c2.r*c2.r*theta2-c1.r*cd*sin(theta1);\\n}\\n\\n\\n////////////////////////////\\n// 三角形\\n////////////////////////////\\n\\n//ヘロンの公式 三角形の面積を返す\\n//三角形が成立するか(平行ではないか)を忘れずに\\nDD Heron(const DD ad,const DD bd,const DD cd){\\n DD s=(ad+bd+cd)/2;\\n return sqrt(s*(s-ad)*(s-bd)*(s-cd));\\n}\\n//三角形の外接円\\n//isParallel()を使って三角形が成立するか(平行ではないか)を忘れずに\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_C\\nCircle CircumscribedCircle(const Point &a,const Point &b,const Point &c){\\n Point bc=(b+c)/(DD)2.0;\\n Line aa(bc,bc+rotate(c-b,PI/2));\\n Point ab=(a+b)/(DD)2.0;\\n Line cc(ab,ab+rotate(b-a,PI/2));\\n Point p=crossPoint(aa,cc);\\n return Circle(p,abs(a-p));\\n}\\n//三角形の内接円\\n//isParallel()を使って三角形が成立するか(平行ではないか)を忘れずに\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_B\\nCircle InCircle(const Point &a,const Point &b,const Point &c){\\n Line aa(a,a+polar((DD)1.0,(arg(b-a)+arg(c-a))/(DD)2.0));\\n Line bb(b,b+polar((DD)1.0,(arg(a-b)+arg(c-b))/(DD)2.0));\\n Point p=crossPoint(aa,bb);\\n return Circle(p,DistPL(p,Line(a,b)));\\n}\\n\\n////////////////////////////\\n// 多角形\\n////////////////////////////\\n\\n//点pが多角形gに対してどの位置にあるか\\n//中:2 辺上:1 外:0\\n//凸多角形である必要ない\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_C\\nint contains(const Point &p,const vector<Point> &g){\\n int n=(int)g.size();\\n int x=false;\\n for(int i=0;i<n;i++){\\n Point a=g[i]-p,b=g[(i+1)%n]-p;\\n if(EQ(cross(a,b),0) && dot(a,b)<EPS) return 1;\\n if(a.Y>b.Y) swap(a,b);\\n if(a.Y<EPS && EPS<b.Y && cross(a,b)>EPS) x=!x;\\n }\\n return (x?2:0);\\n}\\n//凸性判定\\n//多角形gは凸か？\\n//gは反時計回りでも時計回りでもいい\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_B\\nbool isConvex(const vector<Point> &g){\\n int n=(int)g.size();\\n if(n<=3) return true;\\n int flag=0;\\n int t;\\n for(int i=0;i<n;i++){\\n Point a(g[(i+1)%n]-g[i]),b(g[(i+2)%n]-g[i]);\\n if(cross(a,b)>EPS) t=1;\\n else if(cross(a,b)<-EPS) t=-1;\\n else continue;\\n if(flag==-t) return false;\\n flag=t;\\n }\\n return true;\\n}\\n\\n//凸包 アンドリューのアルゴリズム\\n//O(NlogN)\\n//反時計回りの多角形を返す\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_A\\nvector<Point> ConvexHull(vector<Point> s,const bool on_edge){\\n int j;\\n if(on_edge) j=-1;\\n else j=1;\\n int sz=(int)s.size();\\n if(sz<3) return s;\\n sort(s.begin(),s.end(),yx_sort);\\n\\n int n=0;\\n vector<Point> res(2*sz);\\n for(int i=0;i<sz;i++){\\n while(n>=2 && cross(res[n-1]-res[n-2],s[i]-res[n-2])<EPS*j){\\n n--;\\n }\\n res[n]=s[i];\\n n++;\\n }\\n int t=n+1;\\n for(int i=sz-2;i>=0;i--){\\n while(n>=t && cross(res[n-1]-res[n-2],s[i]-res[n-2])<EPS*j){\\n n--;\\n }\\n res[n]=s[i];\\n n++;\\n }\\n res.resize(n-1);\\n return res;\\n}\\n\\n//多角形g(凸でなくてもいい)の符号付き面積\\n//反時計回りの多角形なら正の値を返す 時計回りなら負\\n//O(N)\\n//https://imagingsolution.net/math/calc_n_point_area/\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_A\\nDD Area(const vector<Point> &g){\\n DD ret=0.0;\\n int n=(int)g.size();\\n for(int i=0;i<n;i++){\\n ret+=cross(g[i],g[(i+1)%n]);\\n }\\n return ret/2.0;\\n}\\n\\n//凸多角形gを直線lで切断\\n//直線の左側(向きを考慮)にできる凸多角形を返す\\n//多角形gが反時計回りならば、反時計回りで返す(時計回りなら時計回り)\\n//直線上の頂点を含む線分の交点は含めてない\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_C\\nvector<Point> ConvexCut(const vector<Point> &g,const Line &l){\\n vector<Point> ret;\\n int gz=(int)g.size();\\n for(int i=0;i<gz;i++){\\n Point now=g[i],next=g[(i+1)%gz];\\n if(ccw(l.a,l.b,now)!=-1) ret.push_back(now);\\n if(EQ(DistPL(now,l),0) or EQ(DistPL(next,l),0)) continue;\\n if(ccw(l.a,l.b,now)*ccw(l.a,l.b,next)<0){\\n ret.push_back(crossPoint(Line(now,next),l));\\n }\\n }\\n return ret;\\n}\\n//部品\\ninline DD calc(const Point &a,const Point &b,const DD &r,const bool triangle){\\n if(triangle) return cross(a,b);\\n else return r*r*arg(b/a);\\n}\\n//部品\\nDD calcArea(const DD &r,const Point &a,const Point &b){\\n if(EQ(abs(a-b),0)) return 0;\\n bool ina=(abs(a)<r+EPS);\\n bool inb=(abs(b)<r+EPS);\\n if(ina && inb) return cross(a,b);\\n auto cr=crossPointSC(Segment(a,b),Circle(Point(0,0),r));\\n if(cr.empty()) return calc(a,b,r,false);\\n auto s=cr[0],t=cr.back();\\n return calc(s,t,r,true)+calc(a,s,r,ina)+calc(t,b,r,inb);\\n}\\n//円と多角形の共通部分の面積\\n//多角形が反時計回りならば正の値を返す\\n//凸多角形でなくても大丈夫\\n//http://drken1215.hatenablog.com/entry/2020/02/02/091000\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_H&lang=ja\\nDD Area(const Circle &c,const vector<Point> &g){\\n DD ret=0.0;\\n int gz=g.size();\\n if(gz<=2) return ret;\\n for(int i=0;i<gz;i++){\\n Point a=g[i]-c.p,b=g[(i+1)%gz]-c.p;\\n ret+=calcArea(c.r,g[i]-c.p,g[(i+1)%gz]-c.p);\\n }\\n return ret/2.0;\\n}\\n\\n//点と多角形の距離\\n//点が多角形の中にあるなら0\\nDD Dist(const Point &a,const vector<Point> &b){\\n\\tif(b.size()==1) return abs(a-b[0]);\\n\\tif(contains(a,b)>=1) return 0.0L;\\n\\tDD ret=INF;\\n\\tfor(int i=0;i<b.size();i++){\\n\\t\\tchmin(ret,DistPS(a,Segment(b[i],b[(i+1)%b.size()])));\\n\\t}\\n\\treturn ret;\\n}\\n\\n//多角形と多角形の距離\\n//どちらかが内側に入っていたら0\\n//全ての線分の組み合わせの距離を求めて、その最小が答え\\n//O(size(a)*size(b))\\n//sizeが1の時は点との距離になる\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2827\\nDD Dist(const vector<Point> &a,const vector<Point> &b){\\n\\tDD ret=INF;\\n\\tif(a.size()==1) return Dist(a[0],b);\\n\\tif(b.size()==1) return Dist(b[0],a);\\n\\n\\tif(contains(a[0],b)>=1) return 0.0L;\\n\\tif(contains(b[0],a)>=1) return 0.0L;\\n\\n\\tfor(int i=0;i<a.size();i++){\\n\\t\\tfor(int j=0;j<b.size();j++){\\n\\t\\t\\tSegment sa(a[i],a[(i+1)%a.size()]);\\n\\t\\t\\tSegment sb(b[j],b[(j+1)%b.size()]);\\n\\t\\t\\tchmin(ret,Dist(sa,sb));\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\n\\n////////////////////////////\\n// 最近(遠)点間距離\\n////////////////////////////\\n//部品\\nDD RecClosetPair(const vector<Point>::iterator it,const int n){\\n if(n<=1) return INF;\\n int m=n/2;\\n DD x=it[m].X;\\n DD d=min(RecClosetPair(it,m),RecClosetPair(it+m,n-m));\\n inplace_merge(it,it+m,it+n,yx_sort);\\n vector<Point> v;\\n for(int i=0;i<n;i++){\\n if(abs(it[i].X-x)>=d) continue;\\n for(int j=0;j<v.size();j++){\\n DD dy=it[i].Y-v[(int)v.size()-1-j].Y;\\n if(dy>=d) break;\\n DD dx=it[i].X-v[(int)v.size()-1-j].X;\\n d=min(d,sqrt(dx*dx+dy*dy));\\n }\\n v.push_back(it[i]);\\n }\\n return d;\\n}\\n//最近点対の距離\\n//点が1つのときINFを返す\\n//O(NlogN)\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_5_A\\nDD ClosetPair(vector<Point> g){\\n sort(g.begin(),g.end(),xy_sort);\\n return RecClosetPair(g.begin(),g.size());\\n}\\n\\n//最遠頂点間\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_B\\nDD Diameter(vector<Point> g){\\n g=ConvexHull(g,1);\\n int gz=g.size();\\n int m=0,M=0;\\n for(int i=1;i<gz;i++){\\n if(g[i].Y<g[m].Y) m=i;\\n if(g[i].Y>g[M].Y) M=i;\\n }\\n DD ret=0;\\n int sm=m,sM=M;\\n while(m!=sM || M!=sm){\\n ret=max(ret,norm(g[m]-g[M]));\\n if(cross(g[(m+1)%gz]-g[m],g[(M+1)%gz]-g[M])<0) m=(m+1)%gz;\\n else M=(M+1)%gz;\\n }\\n return sqrt(ret);\\n}\\n//動的凸包\\n//辺上にある点は含めない\\n//verify:https://atcoder.jp/contests/geocon2013/tasks/geocon2013_c\\nstruct DynamicConvex{\\n\\tset<Point> up,down;\\n\\tDynamicConvex(){}\\n \\n\\tbool isContain(set<Point> &pol,Point p){\\n\\t\\tif(pol.size()==0) return false;\\n\\t\\tif(pol.size()==1){\\n\\t\\t\\tPoint q=*begin(pol);\\n\\t\\t\\treturn EQ(q.X,p.X) and GE(q.Y,p.Y);\\n\\t\\t}\\n\\t\\tassert(pol.size()>=2);\\n auto left=begin(pol);\\n auto right=(--end(pol));\\n if(LS(p.X,left->X) or GR(p.X,right->X)) return false;\\n \\n \\n auto q1=pol.upper_bound(Point(p.X,INF));\\n if(q1==end(pol)){\\n return GE(right->Y,p.Y);\\n }\\n auto q2=q1--; //q1が範囲外になるのは最初に弾いてる\\n return GE(cross(p-*q1,*q2-*q1),0.0);\\n\\t}\\n bool isContain(Point p){\\n if(not isContain(up,p)) return false;\\n if(not isContain(down,Point(p.X,-p.Y))) return false;\\n return true;\\n }\\n \\n\\tvoid add(set<Point> &pol,Point p){\\n\\t\\tif(pol.size()==0){\\n\\t\\t\\tpol.insert(p);\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tif(pol.size()==1){\\n Point q=*begin(pol);\\n\\t\\t\\tif(EQ(q.X,p.X)){\\n pol.clear();\\n pol.insert(max(p,q));\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tpol.insert(p);\\n\\t\\t\\t}\\n return;\\n\\t\\t}\\n assert(pol.size()>=2);\\n if(isContain(pol,p)) return;\\n //left\\n auto q1=pol.upper_bound(Point(p.X,INF));\\n if(q1!=begin(pol)){\\n q1--;\\n while(pol.size()>=1 and q1!=begin(pol)){\\n auto q2=q1--;\\n if(GR(cross(*q2-p,*q1-p),0)) break;\\n pol.erase(q2);\\n }\\n }\\n //right\\n q1=pol.lower_bound(Point(p.X,-INF));\\n if(q1!=end(pol)){\\n while(pol.size()>1 and q1!=--end(pol)){\\n auto q2=q1++;\\n if(GR(cross(*q1-p,*q2-p),0.0)) break;\\n pol.erase(q2);\\n }\\n }\\n pol.insert(p);\\n\\t}\\n \\n\\tvoid add(Point p){\\n\\t\\tadd(up,p);\\n\\t\\tadd(down,Point(p.X,-p.Y)); //upと同じように処理をしたいから\\n\\t}\\n};\\n\\n//垂直二等分線\\n//p-↑-q こんなかんじ\\n//voronoiで使う\\nLine bisector(const Point &p, const Point &q) {\\n Point c=(p+q)/DD(2.0);\\n Point v=rotate(q-p,PI/2);\\n v/=abs(v);\\n return Line(c-v,c+v);\\n}\\n\\n//ボロノイ図\\n//pol:全体 ps:点の集合 id:中心となる点の添字 pp:中心となる点\\n//計算量: pol.size()*ps.size()\\n//verify: https://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=6005648#1\\nvector<Point> voronoi(Polygon pol,const vector<Point> &ps,int id=-1,const Point pp=Point()){\\n Point p;\\n if(id!=-1) p=ps[id];\\n else p=pp;\\n for(size_t i=0;i<ps.size();i++){\\n if(i==id) continue;\\n Line l=bisector(p,ps[i]);\\n pol=ConvexCut(pol,l);\\n }\\n return pol;\\n}\\n\\nvector<Polygon> Pol;\\nvector<int> vp;\\nvector<Circle> C;\\nusing Graph=vector<vector<int>>;\\nGraph g;\\nvector<bool> used;\\n\\nvoid dfs(int idx,int par){\\n if(used[idx]) return;\\n used[idx]=true;\\n vp.push_back(idx);\\n\\n for(int to:g[idx]){\\n if(to==par) continue;\\n int start=-1;\\n for(int i=0;i<vp.size();i++){\\n if(vp[i]==to) start=i;\\n }\\n if(start==-1){\\n dfs(to,idx);\\n }else{\\n Polygon pol;\\n for(int i=start;i<vp.size();i++){\\n pol.push_back(C[vp[i]].p);\\n }\\n Pol.push_back(pol);\\n }\\n }\\n vp.pop_back();\\n}\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n cout << fixed << setprecision(20);\\n\\nwhile(true){\\n int N,M;\\n cin>>N>>M;\\n if(N==0 and M==0) return 0;\\n C.clear();\\n C.resize(N);\\n for(int i=0;i<N;i++) cin>>C[i].p>>C[i].r/*,C[i].debug({char('a'+i)})*/;\\n\\n g.clear();\\n g.resize(N);\\n for(int i=0;i<N;i++){\\n for(int j=i+1;j<N;j++){\\n if(intersect(C[i],C[j])==2){\\n g[i].push_back(j);\\n g[j].push_back(i);\\n }\\n }\\n }\\n used.clear();\\n used.resize(N);\\n Pol.clear();\\n\\n dfs(0,-1);\\n for(int i=0;i<N;i++){\\n dfs(i,-1);\\n }\\n vector<bool> ans;\\n for(int i=0;i<M;i++){\\n Point p,q; cin>>p>>q;\\n /*string s;\\n s+='a'+i;\\n debug(p,s); debug(q,s);*/\\n vector<bool> cp(N),cq(N);\\n bool ok=false;\\n for(int j=0;j<N;j++){\\n if(LE(abs(p-C[j].p),C[j].r)){\\n ok=true;\\n cp[j]=true;\\n }\\n if(LE(abs(q-C[j].p),C[j].r)){\\n cq[j]=true;\\n }\\n }\\n if(cp==cq and ok){\\n ans.push_back(true);\\n }else if(cp!=cq){\\n ans.push_back(false);\\n }else{\\n cp.clear(); cq.clear();\\n cp.resize(Pol.size()); cq.resize(Pol.size());\\n for(int j=0;j<Pol.size();j++){\\n cp[j]=contains(p,Pol[j]);\\n cq[j]=contains(q,Pol[j]);\\n }\\n if(cp==cq) ans.push_back(true);\\n else ans.push_back(false);\\n }\\n }\\n for(int i=0;i<ans.size();i++){\\n if(i) cout<<\\\" \\\";\\n if(ans[i]) cout<<\\\"YES\\\";\\n else cout<<\\\"NO\\\";\\n }\\n cout<<endl;\\n}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3664,\n \"score_of_the_acc\": -0.0715,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1198_5981741\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nnamespace geometry{\\n constexpr double eps = 1e-9;\\n bool eq(double a, double b){ return fabs(a - b) < eps; }\\n template<typename T> bool eq(T a, T b){ return a == b; }\\n bool is_zero(double a){ return fabs(a) < eps; }\\n template<typename T> bool is_zero(T a){ return a == 0; }\\n bool le(double a, double b){ return a <= b + eps; }\\n template<typename T> bool le(T a, T b){ return a <= b; }\\n bool lt(double a, double b){ return a < b - eps; }\\n template<typename T> bool lt(T a, T b){ return a < b; }\\n};\\n\\n\\ntemplate<class T> struct Point{\\n T x,y;\\n Point(){}\\n Point(T x, T y) : x(x), y(y) {}\\n Point(const pair<T,T> &p) : x(p.first), y(p.second) {}\\n\\n Point operator*(const T b) const { return Point(x * b, y * b); }\\n Point operator/(const T b) const { return Point(x / b, y / b); }\\n Point operator+(const Point &b) const { return Point(x + b.x, y + b.y); }\\n Point operator-(const Point &b) const { return Point(x - b.x, y - b.y); }\\n Point operator*(const Point &b) const { return Point(x*b.x - y*b.y, x*b.y + y*b.x); }\\n Point operator/(const Point &b) const { return Point(x*b.x + y*b.y, y*b.x - x*b.y)/(b.x*b.x + b.y*b.y); }\\n\\n Point &operator*=(const T b){ return (*this) = (*this) * b; }\\n Point &operator/=(const T b){ return (*this) = (*this) / b; }\\n Point &operator+=(const Point &b){ return (*this) = (*this) + b; }\\n Point &operator-=(const Point &b){ return (*this) = (*this) - b; }\\n Point &operator*=(const Point &b){ return (*this) = (*this) * b; }\\n Point &operator/=(const Point &b){ return (*this) = (*this) / b; }\\n \\n bool operator==(const Point &b) const {\\n return geometry::eq(x, b.x) && geometry::eq(y, b.y);\\n }\\n bool operator<(const Point &b) const { \\n if(geometry::eq(x, b.x)) return y < b.y;\\n return x < b.x;\\n }\\n T Norm() const { return x * x + y * y; }\\n double Abs() const { return hypot<double>(x, y); }\\n double dist(const Point &b) const { return hypot<double>(x - b.x, y - b.y); }\\n double arg() const { return atan2<double>(y, x); }\\n \\n Point ArgVec() const {\\n if((*this) == Point(0, 0)) return (*this);\\n if(geometry::is_zero(x)) return Point(0, -1);\\n return (*this) / gcd(x, y) * (x < 0 ? -1 : 1);\\n }\\n\\n int ort() const {\\n if(geometry::is_zero(x) && geometry::is_zero(y)) return 0;\\n if(geometry::is_zero(y)) return x > 0 ? 1 : 3;\\n if(geometry::is_zero(x)) return y > 0 ? 2 : 4;\\n if (y > 0) return x > 0 ? 1 : 2;\\n else return x > 0 ? 4 : 3;\\n }\\n Point rotate90() const { return Point(-y, x);}\\n Point rotate180() const { return Point(-x, -y);}\\n Point rotate270() const { return Point(y, -x);}\\n\\n Point flip_x(T p = 0) const { return Point(p*2 - x, y);}\\n Point flip_y(T p = 0) const { return Point(x, p*2 - y);}\\n\\n Point rotate(double theta) const {\\n return Point(cos(theta)*x - sin(theta)*y, sin(theta)*x + cos(theta)*y);\\n }\\n\\n Point flip(double theta) const {\\n return (*this).rotate(-theta).flip_y().rotate(theta);\\n }\\n\\n friend ostream &operator<<(ostream &os, const Point &p) {\\n return os << p.x << \\\" \\\" << p.y;\\n }\\n friend istream &operator>>(istream &is, Point &p) {\\n T a, b; is >> a >> b;\\n p = Point<T>(a, b);\\n return (is);\\n }\\n};\\n\\ntemplate<typename T> Point<T> Polar(const T& rho, const T& theta = 0){\\n return Point<T>(rho * cos(theta), rho * sin(theta));\\n}\\n\\n\\ntemplate<typename T> using Polygon = vector<Point<T>>;\\n\\ntemplate<class T> T Cross(const Point<T> &a, const Point<T> &b) { return a.x * b.y - a.y * b.x; }\\n\\ntemplate<class T> T Dot(const Point<T> &a, const Point<T> &b) { return a.x * b.x + a.y * b.y; }\\n\\ntemplate<class T> bool Intersect(const Point<T> &a, const Point<T> &b, const Point<T> &c, const Point<T> &d) {\\n return (iSP(a, b, c)*iSP(a, b, d) <= 0) && (iSP(c, d, a)*iSP(c, d, b) <= 0);\\n}\\n\\ntemplate<class T> int iSP(const Point<T> &a, const Point<T> &b, const Point<T> &c){\\n T fl = Cross(b-a, c-a);\\n if(geometry::lt(T(0), fl)) return 1; // CCW\\n if(geometry::lt(fl, T(0))) return -1; // CW\\n if(geometry::lt(T(0), Dot(b-a, c-b))) return 2; //abc\\n if(geometry::lt(T(0), Dot(a-b, c-a))) return -2; //bac\\n return 0; // acb\\n}\\n\\ntemplate<class T> int angletype(const Point<T> &a, const Point<T> &b, const Point<T> &c){\\n T v = Dot(a-b, c-a);\\n if(geometry::is_zero(v)) return 0; // right angle\\n if(v > 0) return 1; // acute angle\\n return -1; // obtuse angle\\n}\\n\\ntemplate<typename T>\\nbool cmp_y(const Point<T>& p1, const Point<T> &p2){\\n if(p1.y == p2.y) return p1.x < p2.x;\\n return p1.y < p2.y;\\n}\\n\\ntemplate<typename T>\\nbool cmp_arg(const Point<T>& p1, const Point<T> &p2){\\n if(p1.ort() != p2.ort()) return p1.ort() < p2.ort();\\n return iSP(Point<T>(0,0), p1, p2) > 0;\\n}\\n\\ntemplate<typename T>\\nvoid ArgSort(Polygon<T> &ps){\\n sort(begin(ps), end(ps), cmp_arg<T>);\\n}\\n\\ntemplate<class T> struct Line{\\n Point<T> a, b;\\n Line() {}\\n Line(const Point<T> &a, const Point<T> &b): a(a), b(b) {}\\n Line(T A, T B, T C){ // Ax + By = C\\n if(A == 0){ a = Point<T>(0, C/B); b = Point<T>(1, C/B); }\\n else if(B == 0){ a = Point<T>(C/A, 0); b = Point<T>(C/A, 1); }\\n else{ a = Point<T>(0, C/B); b = Point<T>(C/A, 0); }\\n }\\n //Line(const Segment<T> &s): a(s.a), b(s.b) {}\\n Point<T> projection(const Point<T> &p) const {\\n return a + (b - a)*Dot(p - a, b - a)/(b - a).Norm();\\n }\\n Point<T> reflection(const Point<T> &p) const {\\n return p + (projection(p) - p)*2;\\n }\\n int angletype(const Line &l) const {\\n if(geometry::is_zero(Cross(b-a, l.b-l.a))) return 1;\\n if(geometry::is_zero(Dot(a-b, l.b-l.a))) return -1;\\n return 0;\\n }\\n bool Intersect(const Line &l) const {\\n return angletype(l) != 1;\\n }\\n Point<T> Cross_Point(const Line &l) const {\\n if(geometry::is_zero(Cross(b-a,l.b-l.a))) return l.a;\\n return (b - a)*Cross(l.a - a, l.b - l.a)/Cross(b - a,l.b - l.a) + a;\\n }\\n double dist(const Point<T> &p) const {\\n return abs(Cross(p - a, b - a)/(b - a).Abs());\\n }\\n double dist(const Line &l) const {\\n if(Intersect(l)) return 0;\\n return dist(l.a);\\n }\\n};\\n\\ntemplate<class T> struct Segment{\\n Point<T> a, b;\\n Segment() {}\\n Segment(const Point<T> &a, const Point<T> &b): a(a), b(b) {}\\n\\n double length() const { return a.dist(b); }\\n bool Intersect(const Segment &s) const {\\n return iSP(a, b, s.a)*iSP(a, b, s.b) <= 0 && iSP(s.a, s.b, a)*iSP(s.a, s.b, b) <= 0;\\n }\\n Point<T> Center() const { return (a + b) / 2; }\\n Line<T> PerpBisector() const {\\n Point<T> center = this->Center();\\n return Line<T>((a - center).rotate90() + center, center);\\n }\\n int angletype(const Segment &s) const {\\n if(geometry::is_zero(Cross(b-a, s.b-s.a))) return 1;\\n if(geometry::is_zero(Dot(a-b, s.b-s.a))) return -1;\\n return 0;\\n }\\n Point<T> Cross_Point(const Segment &s) const {\\n if(geometry::is_zero(Cross(b-a,s.b-s.a))) return s.a;\\n return (b - a)*Cross(s.a - a, s.b - s.a)/Cross(b - a, s.b - s.a) + a;\\n }\\n double dist(const Point<T> &p) const {\\n if(Dot(b-a, p-a) < 0) return p.dist(a);\\n if(Dot(a-b, p-b) < 0) return p.dist(b);\\n return abs(Cross(p-a, b-a)/ (b-a).Abs());\\n }\\n double dist(const Segment &s) const {\\n if(Intersect(s)) return 0;\\n return min({dist(s.a), dist(s.b), s.dist(a), s.dist(b)});\\n }\\n};\\n\\ntemplate<typename T>\\nstruct Triangle{\\n Point<T> a, b, c;\\n Triangle() {}\\n Triangle(const Point<T> &a, const Point<T> &b, const Point<T> &c): a(a), b(b), c(c){}\\n\\n double angle_a() const {\\n double ab = a.dist(b), bc = b.dist(c), ca = c.dist(a);\\n return acos((ca*ca + ab*ab - bc*bc)/(2*ca*ab));\\n }\\n double angle_b() const {\\n double ab = a.dist(b), bc = b.dist(c), ca = c.dist(a);\\n return acos((ab*ab + bc*bc - ca*ca)/(2*ab*bc));\\n }\\n double angle_c() const {\\n double ab = a.dist(b), bc = b.dist(c), ca = c.dist(a);\\n return acos((bc*bc + ca*ca - ab*ab)/(2*bc*ca));\\n }\\n Point<T> divpoint(double p, double q, double r) const {\\n return (a*p + b*q + c*r)/(p + q + r);\\n }\\n\\n Point<T> centerofgravity() const {\\n return (a + b + c)/3;\\n }\\n Point<T> circumcenter() const {\\n Segment<T> s1(a, b), s2(a, c);\\n return s1.PerpBisector().Cross_Point(s2.PerpBisector());\\n }\\n Point<T> orthocenter() const {\\n return centerofgravity()*3 - circumcenter()*2;\\n }\\n Point<T> innercenter() const {\\n return divpoint(b.dist(c), c.dist(a), a.dist(b));\\n }\\n Point<T> excenterA() const {\\n return divpoint(-b.dist(c), c.dist(a), a.dist(b));\\n }\\n Point<T> excenterB() const {\\n return divpoint(b.dist(c), -c.dist(a), a.dist(b));\\n }\\n Point<T> excenterC() const {\\n return divpoint(b.dist(c), c.dist(a), -a.dist(b));\\n }\\n};\\n\\ntemplate<class T> struct Circle{\\n Point<T> o;\\n T r;\\n Circle() {}\\n Circle(const Point<T> &o, const T &r): o(o), r(r) {}\\n Circle(const Point<T> &a, const Point<T> &b): o((a + b)/2), r(a.dist(b)/2) {}\\n Circle(const Point<T> &a, const Point<T> &b, const Point<T> &c)\\n : o(Triangle(a,b,c).circumcenter()), r(o.dist(a)) {}\\n\\n int Intersect(const Circle&c) const {\\n if(r < c.r) return c.Intersect(*this);\\n auto od = (o - c.o).Norm();\\n auto ra = (r + c.r)*(r + c.r), rs = (r - c.r)*(r - c.r);\\n if(geometry::lt(ra, od)) return 4;\\n if(geometry::eq(ra, od)) return 3;\\n if(geometry::lt(rs, od)) return 2;\\n if(geometry::eq(rs, od)) return 1;\\n return 0;\\n }\\n\\n int Intersect(const Line<T> &l) const {\\n double d = l.dist(o);\\n if(geometry::lt<double>(d, r)) return 2;\\n return geometry::eq(d, r);\\n }\\n\\n int Contains(const Point<T> &p) const {\\n auto od = (o - p).Norm();\\n if(geometry::eq(od, r*r)) return 1; // on\\n return (od > r*r) ? 2 : 0; // out/in\\n }\\n\\n Polygon<T> Cross_Points(const Line<T> &l) const {\\n int k = this->Intersect(l);\\n if(k == 0) return {};\\n Point<T> p = l.projection(o);\\n if(k == 1) return {p};\\n Point<T> d = (l.b - l.a)/l.a.dist(l.b);\\n double base = sqrt(r*r - (p - o).Norm());\\n return {p + d*base, p - d*base};\\n }\\n\\n Polygon<T> Cross_Points(const Circle &c) const {\\n int k = this->Intersect(c);\\n if(k == 0 || k == 4) return {};\\n double t = (c.o - o).arg();\\n if(k == 1 || k == 3) return {o + Polar<T>(r, t)};\\n double d = o.dist(c.o), a = acos((r*r + d*d - c.r*c.r) / (r * d * 2));\\n return {o + Polar<T>(r, t + a), o + Polar<T>(r, t - a)};\\n }\\n\\n friend ostream &operator<<(ostream &os, const Circle &c) {\\n return os << c.o << \\\" \\\" << c.r;\\n }\\n friend istream &operator>>(istream &is, Circle &c) {\\n Point<T> p; T l; is >> p >> l;\\n c = Circle<T>(p, l);\\n return (is);\\n }\\n};\\n\\n\\ntemplate<typename T>\\nint Contains(const Polygon<T> &ps, const Point<T>& p){\\n bool in = false;\\n int n = ps.size();\\n for(int i = 0; i < n; i++){\\n Point<T> a = ps[i] - p, b = ps[(i+1)%n] - p;\\n if(a.y > b.y) swap(a, b);\\n if(a.y <= 0 && 0 < b.y && Cross(a,b) < 0) in = !in;\\n if(geometry::is_zero(Cross(a, b)) && geometry::le(Dot(a, b), T(0))) return 1; // on\\n }\\n return in? 2 : 0; // out/in\\n}\\n\\ntemplate<typename T = int>\\nstruct Edge{\\n int src, to; T cost; int idx;\\n Edge(){}\\n Edge(int src, int to, T cost = -1, int idx = -1): src(src), to(to), cost(cost), idx(idx) {}\\n operator int() const { return to; }\\n};\\ntemplate<typename T>\\nusing Edges = vector<Edge<T>>;\\n\\ntemplate<typename T = bool>\\nstruct Graph {\\n vector<vector<Edge<T>>> g;\\n size_t es;\\n Graph() {};\\n Graph(size_t n): g(n), es(0) {}\\n size_t size() const { return g.size(); }\\n int deg(int v) const { return int(g[v].size()); }\\n\\n vector<Edge<T>> &operator[](int k) { return g.at(k); }\\n const vector<Edge<T>> &operator[](int k) const { return g.at(k); }\\n vector<Edge<T>> &at(int k) { return g.at(k); }\\n const vector<Edge<T>> &at(int k) const { return g.at(k); }\\n\\n void add_edge(int src, int to, T cost = 1){\\n g[src].emplace_back(src, to, cost, es);\\n g[to].emplace_back(to, src, cost, es++);\\n }\\n void add_directed_edge(int src, int to, T cost = 1){\\n g[src].emplace_back(src, to, cost, es++);\\n }\\n\\n void read(int m, int base = 1, bool weighted = false, bool directed = false, const T &id = 1){\\n for (int i = 0; i < m; i++){\\n int u, v; cin >> u >> v; u -= base; v -= base;\\n T c = id;\\n if(weighted) cin >> c;\\n if(directed) add_directed_edge(u, v, c);\\n else add_edge(u, v, c);\\n }\\n }\\n};\\n\\ntemplate<typename T>\\nstruct CycleDetection{\\n Graph<T> g;\\n bool directed;\\n vector<int> used;\\n vector<Edge<T>> pre, cycle;\\n CycleDetection(const Graph<T> &g, bool directed = true)\\n : g(g), directed(directed), used(g.size()), pre(g.size()) {}\\n\\n vector<Edge<T>> find(){\\n for(int i = 0; i < (int)g.size(); i++){\\n if(used[i]==0 && dfs(i)){\\n reverse(cycle.begin(), cycle.end());\\n return cycle;\\n }\\n }\\n return {};\\n }\\n\\nprivate:\\n bool dfs(int v, int q = -1){\\n used[v] = 1;\\n for(auto&&e : g[v]){\\n if(e == q && !directed) continue;\\n if(used[e] == 0){\\n pre[e] = e;\\n if(dfs(e, v)) return true;\\n }else if(used[e] == 1){\\n int p = v;\\n while(p != e){\\n cycle.emplace_back(pre[p]);\\n p = pre[p].src;\\n }\\n cycle.emplace_back(e);\\n return true;\\n }\\n }\\n used[v] = 2;\\n return false;\\n }\\n};\\n\\ntemplate<typename T> T Area(const Polygon<T> &ps, bool harf = true){\\n if((int)ps.size() < 3) return 0;\\n T res = Cross(ps.back(), ps.front());\\n for(int i = 0; i < (int)ps.size()-1; i++){\\n res += Cross(ps[i], ps[i+1]);\\n }\\n if(harf) res /= 2;\\n return res;\\n}\\n\\n\\nstruct Solver{\\n Solver(int n, int m): n(n), m(m) {}\\n using ll = long long;\\n\\n int n, m;\\n vector<Circle<ll>> cs;\\n void solve(){\\n cs.resize(n);\\n for(auto&c : cs) cin >> c;\\n\\n Edges<int> es;\\n int t = 0;\\n for(int j = 0; j < n; ++j){\\n for(int i = 0; i < j; ++i){\\n if(cs[i].Intersect(cs[j]) < 4){\\n es.emplace_back(i, j, 0, t++);\\n }\\n }\\n }\\n\\n string ans;\\n while(m--) ans += (check(es) ? \\\"YES \\\"s : \\\"NO \\\"s);\\n ans.pop_back();\\n cout << ans << \\\"\\\\n\\\";\\n }\\n\\n void ci(int i){ //cout << i << \\\":\\\"; }\\n }\\n\\n bool check(Edges<int> es){\\n Point<ll> p, q; cin >> p >> q;\\n bool fl = false;\\n for(auto&c : cs){\\n if((c.Contains(p) < 2) != (c.Contains(q) < 2)){\\n ci(0);\\n return false;\\n }\\n fl |= c.Contains(p) < 2;\\n }\\n if(fl){\\n ci(1);\\n return true;\\n }\\n\\n while(true){\\n Graph<int> g(n);\\n for(auto&e : es) g.add_edge(e.src, e.to);\\n\\n CycleDetection cd(g, false);\\n auto cy = cd.find();\\n if(cy.empty()) break;\\n\\n int l = int(cy.size());\\n Polygon<ll> ps(l);\\n for(int i = 0; i < l; ++i) ps[i] = cs[cy[i].src].o;\\n\\n if(Area(ps, false) < 0) reverse(begin(ps), end(ps));\\n\\n if(Contains(ps, p) != Contains(ps, q)){\\n ci(2);\\n return false;\\n }\\n\\n l = int(es.size());\\n auto e = cy[0];\\n fl = false;\\n for(int i = 0; i < l; ++i){\\n if((e.src == es[i].src && e.to == es[i].to) || (e.src == es[i].to && e.to == es[i].src)){\\n es.erase(begin(es) + i);\\n fl = true;\\n break;\\n }\\n }\\n assert(fl);\\n }\\n ci(3);\\n return true;\\n }\\n};\\n\\nint main() {\\n while(true){\\n int n, m; cin >> n >> m;\\n if(n == 0) return 0;\\n Solver solver(n, m);\\n solver.solve();\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3400,\n \"score_of_the_acc\": -0.0361,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1198_5949708\",\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;\\nusing Real = double;\\nusing Point = complex< Real >;\\nusing Polygon = vector< Point >;\\nconst Real EPS = 1e-6, PI = acos(-1);\\nconstexpr int COUNTER_CLOCKWISE = +1;\\nconstexpr int CLOCKWISE = -1;\\nconstexpr int ONLINE_BACK = +2; // c-a-b\\nconstexpr int ONLINE_FRONT = -2; // a-b-c\\nconstexpr int ON_SEGMENT = 0; // a-c-b\\n\\nPoint operator*(const Point &p, const Real &d) {\\n return Point(real(p) * d, imag(p) * d);\\n}\\n\\nPoint operator/(const Point &p, const Real &d) {\\n return Point(real(p) / d, imag(p) / d);\\n}\\n\\nistream &operator>>(istream &is, Point &p) {\\n Real a, b; is >> a >> b;\\n p = Point(a, b);\\n return is;\\n}\\n\\nostream &operator<<(ostream &os, const Point &p) {\\n return os << fixed << setprecision(10) << real(p) << \\\" \\\" << imag(p);\\n}\\n\\nnamespace std {\\n bool operator<(const Point &a, const Point &b) {\\n return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag();\\n }\\n}\\n\\n// 符号\\ninline int sign(const Real &r) {\\n return r <= -EPS ? -1 : r >= EPS ? 1 : 0;\\n}\\n\\n// a = b ? \\ninline bool equals(const Real &a, const Real &b) {\\n return sign(a - b) == 0;\\n}\\n\\n\\n// 単位ベクトル\\nPoint unitVec(const Point &a){ return a / abs(a); }\\n\\n// 法線ベクトル 半時計周り\\nPoint normVec(const Point &a){ return a * Point(0, 1); }\\n//Point normVec(const Point &a){ return a * Point(0,-1); }\\n\\n// 内積\\nReal dot(const Point &a, const Point &b) {\\n return (a.real() * b.real() + a.imag() * b.imag());\\n}\\n\\n// 外積\\nReal cross(const Point &a, const Point &b) {\\n return (a.real() * b.imag() - a.imag() * b.real());\\n}\\n\\nPoint rotate(const Point &p, const Real &theta) {\\n return Point(cos(theta) * p.real() - sin(theta) * p.imag(),\\n sin(theta) * p.real() + cos(theta) * p.imag());\\n}\\n\\nReal Radian_To_Degree(const Real &radian){ return radian * 180.0 / PI; }\\nReal Degree_To_Radian(const Real °ree){ return degree * PI / 180.0; }\\n\\nstruct Line {\\n Point a, b;\\n Line() = default;\\n Line(Point a, Point b) : a(a), b(b) {}\\n\\n // Ax + By = C\\n Line(Real A, Real B, Real C) {\\n if(equals(A, 0)) {\\n a = Point(0, C / B), b = Point(1, C / B);\\n }else if(equals(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 friend ostream &operator<<(ostream &os, Line &p) {\\n return os << p.a << \\\" \\\" << p.b;\\n }\\n\\n friend istream &operator>>(istream &is, Line &a) {\\n return is >> a.a >> a.b;\\n }\\n};\\n\\nstruct Segment : Line {\\n Segment() = default;\\n Segment(Point a, Point b) : Line(a, b) {}\\n};\\n\\nstruct Circle {\\n Point p;\\n Real r;\\n Circle() = default;\\n Circle(Point p, Real r) : p(p), r(r) {}\\n\\n friend ostream &operator<<(ostream &os, Circle &c) {\\n return os << c.p << \\\" \\\" << c.r;\\n }\\n\\n friend istream &operator>>(istream &is, Circle &c) {\\n return is >> c.p >> c.r;\\n }\\n};\\n\\n// 直線lに点pから引いた垂線の足を求める\\nPoint projection(const Line &l, const Point &p) {\\n Real t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n return l.a + (l.a - l.b) * t;\\n}\\n\\nPoint projection(const Segment &l, const Point &p) {\\n Real 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// 直線lに関して点pと対称な点を求める\\nPoint reflection(const Line &l, const Point &p) {\\n return p + (projection(l, p) - p) * 2.0;\\n}\\n\\n// 点の回転方向\\n// 点aを基準に点b,cの位置関係\\nint ccw(const Point &a, Point b, Point c) {\\n b = b - a, c = c - a;\\n if(sign(cross(b, c)) == +1) return COUNTER_CLOCKWISE; // 反時計回り\\n if(sign(cross(b, c)) == -1) return CLOCKWISE; // 時計回り\\n if(sign(dot(b, c)) == -1) return ONLINE_BACK; // c - a - b\\n if(norm(b) < norm(c)) return ONLINE_FRONT; // a - b - c\\n return ON_SEGMENT; // a - c - b\\n}\\n\\n// 2直線の直交判定\\nbool is_orthogonal(const Line &a, const Line &b) {\\n return equals(dot(a.b - a.a, b.b - b.a), 0);\\n}\\n\\n// 2直線の平行判定\\nbool is_parallel(const Line &a, const Line &b) {\\n return equals(cross(a.b - a.a, b.b - b.a), 0);\\n}\\n\\n// 線分の交差判定\\nbool is_intersect_ss(const Segment &s, const Segment &t) {\\n return ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\\n ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\\n}\\n\\n// 直線の交差判定\\nbool is_intersect_ll(const Line &l, const Line &m) {\\n Real A = cross(l.b - l.a, m.b - m.a);\\n Real B = cross(l.b - l.a, l.b - m.a);\\n if(equals(abs(A), 0) && equals(abs(B), 0)) return true;\\n return !is_parallel(l, m);\\n}\\n\\n// 線分に点が乗っているか\\nbool is_intersect_sp(const Segment &s, const Point &p) {\\n return ccw(s.a, s.b, p) == ON_SEGMENT;\\n}\\n\\n// 点と点の距離\\nReal distance_pp(const Point &p1, const Point &p2) {\\n return sqrt(pow(real(p1)-real(p2), 2) + pow(imag(p1)-imag(p2), 2));\\n}\\n\\n// 点と直線の距離\\nReal distance_lp(const Line &l, const Point &p) {\\n return abs(p - projection(l, p));\\n}\\n\\n// 直線と直線の距離\\nReal distance_ll(const Line &l, const Line &m) {\\n return is_intersect_ll(l, m) ? 0 : distance_lp(l, m.a);\\n}\\n\\n// 点と線分の距離\\nReal distance_sp(const Segment &s, const Point &p) {\\n Point r = projection(s, p);\\n if(is_intersect_sp(s, r)) return abs(r - p);\\n return min(abs(s.a - p), abs(s.b - p));\\n}\\n\\n// 線分と線分の距離\\nReal distance_ss(const Segment &a, const Segment &b) {\\n if(is_intersect_ss(a, b)) return 0;\\n return min({distance_sp(a, b.a), distance_sp(a, b.b), distance_sp(b, a.a), distance_sp(b, a.b)});\\n}\\n\\n// 交点\\nPoint cross_point_ll(const Line &l, const Line &m) {\\n Real A = cross(l.b - l.a, m.b - m.a);\\n Real B = cross(l.b - l.a, l.b - m.a);\\n if(equals(abs(A), 0) && equals(abs(B), 0)) return m.a;\\n return m.a + (m.b - m.a) * B / A;\\n}\\n\\n// 円と円の位置関係\\nint intersect(Circle c1, Circle c2) {\\n Real d = abs(c1.p - c2.p);\\n return abs(c1.r - c2.r) - EPS < d && d < c1.r + c2.r + EPS;\\n}\\n\\nReal area(const Polygon &p){\\n Real A = 0;\\n for(int i = 0; i < p.size(); i++){\\n A += cross(p[i], p[(i + 1) % p.size()]);\\n }\\n return A * 0.5;\\n}\\n\\nbool is_convex(const Polygon &p){\\n for(int i = 0; i < p.size(); i++){\\n if(ccw(p[(i + p.size() - 1) % p.size()], p[i], p[(i + 1) % p.size()]) == -1) return false;\\n }\\n return true;\\n}\\n\\nenum { OUT, ON, IN };\\nint contains(const Polygon &Q, const Point &p){\\n bool in = false;\\n for(int i = 0; i < Q.size(); i++){\\n Point a = Q[i] - p, b = Q[(i + 1) % Q.size()] - p;\\n if(a.imag() > b.imag()) swap(a, b);\\n if(a.imag() <= 0 && 0 < b.imag() && cross(a, b) < 0) in = !in;\\n if(cross(a, b) == 0 && dot(a, b) <= 0) return ON;\\n }\\n return in ? IN : OUT;\\n}\\n\\nPolygon convex_hull(Polygon &p, bool strict = true){\\n int n = (int)p.size(), k = 0;\\n if(n <= 2) return p;\\n sort(p.begin(), p.end());\\n Polygon ch(2 * n);\\n for(int i = 0; i < n; ch[k++] = p[i++]){\\n while(k >= 2 && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < 0) --k;\\n }\\n for(int i = n - 2, t = k + 1; i >= 0; ch[k++] = p[i--]){\\n while(k >= t && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < 0) --k;\\n }\\n ch.resize(k - 1);\\n return ch;\\n}\\n\\nReal convex_diameter(const Polygon &p){\\n int n = (int)p.size();\\n int is = 0, js = 0;\\n for(int i = 1; i < n; i++){\\n if(p[i].imag() > p[is].imag()) is = i;\\n if(p[i].imag() < p[js].imag()) js = i;\\n }\\n Real maxdis = norm(p[is] - p[js]);\\n int maxi, maxj, i, j;\\n i = maxi = is;\\n j = maxj = js;\\n do {\\n if(cross(p[(i + 1) % n] - p[i], p[(j + 1) % n] - p[j]) >= 0){\\n j = (j + 1) % n;\\n }else{\\n i = (i + 1) % n;\\n }\\n\\n if(norm(p[i] - p[j]) > maxdis){\\n maxdis = norm(p[i] - p[j]);\\n maxi = i;\\n maxj = j;\\n }\\n\\n }while(i != is || j != js);\\n return sqrt(maxdis);\\n}\\n\\nPolygon convex_cut(const Polygon &U, Line l){\\n Polygon ret;\\n for(int i = 0; i < U.size(); i++){\\n Point now = U[i], nxt = U[(i + 1) % U.size()];\\n if(ccw(l.a, l.b, now) != -1) ret.push_back(now);\\n if(ccw(l.a, l.b, now) * ccw(l.a, l.b, nxt) < 0){\\n ret.push_back(cross_point_ll(Line(now, nxt), l));\\n }\\n }\\n return ret;\\n}\\n\\nReal ClosetPair(Polygon& ps){\\n if(ps.size() <= 1) throw (0);\\n sort(begin(ps), end(ps));\\n\\n auto compare_y = [&](const Point &a, const Point &b) {\\n return a.imag() < b.imag();\\n };\\n Polygon beet(ps.size());\\n const double INF = 1e18;\\n\\n function< double(int, int) > rec = [&](int left, int right) {\\n if(right - left <= 1) return INF;\\n int mid = (left + right) >> 1;\\n auto x = ps[mid].real();\\n auto ret = min(rec(left, mid), rec(mid, right));\\n inplace_merge(begin(ps) + left, begin(ps) + mid, begin(ps) + right, compare_y);\\n int ptr = 0;\\n for(int i = left; i < right; i++) {\\n if(fabs((ps[i].real()) - x) >= ret) continue;\\n for(int j = 0; j < ptr; j++) {\\n auto luz = ps[i] - beet[ptr - j - 1];\\n if(luz.imag() >= ret) break;\\n ret = min(ret, abs(luz));\\n }\\n beet[ptr++] = ps[i];\\n }\\n return ret;\\n };\\n return rec(0, (int) ps.size());\\n}\\n\\npair< Point, Point > cross_point_cc(const Circle &c1, const Circle &c2) {\\n Real d = abs(c1.p - c2.p);\\n Real a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));\\n Real t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\\n Point p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\\n Point p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\\n return {p1, p2};\\n}\\n\\nconst int BOTTOM = 0;\\nconst int LEFT = 1;\\nconst int RIGHT = 2;\\nconst int TOP = 3;\\n\\nclass endPoint {\\n public:\\n Point p;\\n int seg; // id of Point\\n int st; // kind of Point\\n endPoint(){}\\n endPoint(Point inp, int inseg, int inst):p(inp),seg(inseg),st(inst){}\\n bool operator<(const endPoint &ep)const {\\n if(p.imag() == ep.p.imag()) return st < ep.st;\\n else return p.imag() < ep.p.imag();\\n }\\n};\\n\\nendPoint EP[220000];\\nint Manhattan_Intersections(vector< Segment > s){\\n int n = s.size();\\n double hoge;\\n\\n for(int i = 0, k = 0; i < n; i++){\\n if(s[i].a.imag() == s[i].b.imag()){\\n if(s[i].a.real() > s[i].b.real()){\\n hoge = s[i].a.real();\\n s[i].a.real(s[i].b.real());\\n s[i].b.real(hoge);\\n }\\n }else if(s[i].a.imag() > s[i].b.imag()){\\n hoge = s[i].a.imag();\\n s[i].a.imag(s[i].b.imag());\\n s[i].b.imag(hoge);\\n }\\n\\n if(s[i].a.imag() == s[i].b.imag()){\\n EP[k++] = endPoint(s[i].a, i, LEFT);\\n EP[k++] = endPoint(s[i].b, i, RIGHT);\\n }else{\\n EP[k++] = endPoint(s[i].a, i, BOTTOM);\\n EP[k++] = endPoint(s[i].b, i, TOP);\\n }\\n }\\n\\n sort(EP, EP + 2 * n);\\n set<int> BT;\\n BT.insert(1000000001);\\n int cnt = 0;\\n for(int i = 0; i < 2 * n; i++){\\n if(EP[i].st == TOP) BT.erase(EP[i].p.real());\\n else if(EP[i].st == BOTTOM) BT.insert(EP[i].p.real());\\n else if(EP[i].st == LEFT){\\n set<int>::iterator b = lower_bound(BT.begin(), BT.end(), s[EP[i].seg].a.real());\\n set<int>::iterator e = upper_bound(BT.begin(), BT.end(), s[EP[i].seg].b.real());\\n cnt += distance(b, e);\\n }\\n }\\n\\n return cnt;\\n}\\n\\n// 内接円\\nCircle Inscribed_Circle(const Point& a, const Point& b, const Point& c){\\n double A = abs(b - c), B = abs(c - a), C = abs(a - b);\\n Point x = Point((a * A + b * B + c * C) / (A + B + C));\\n double r = distance_sp(Segment(a,b),x);\\n return Circle(x, r);\\n}\\n\\n// 外接円\\nCircle Circumscribed_Circle(const Point& a, const Point& b, const Point& c){\\n Point m1((a+b)/2.0), m2((b+c)/2.0);\\n Point v((b-a).imag(), (a-b).real()), w((b-c).imag(), (c-b).real());\\n Line s(m1, Point(m1+v)), t(m2, Point(m2+w));\\n const Point x = cross_point_ll(s, t);\\n return Circle(x, abs(a-x));\\n}\\n\\npair< Point, Point > cross_point_cl(const Circle &c, const Line &l) {\\n Point pr = projection(l, c.p);\\n if(equals(abs(pr - c.p), c.r)) return {pr, pr};\\n Point e = (l.b - l.a) / abs(l.b - l.a);\\n auto k = sqrt(norm(c.r) - norm(pr - c.p));\\n return {pr - e * k, pr + e * k};\\n}\\n\\n// 点pを通る円の接線\\npair<Point,Point> tangent_cp(const Circle &c, const Point &p) {\\n return cross_point_cc(c, Circle(p, sqrt(norm(c.p - p) - c.r * c.r)));\\n}\\n\\n// 二つの円の共通接線\\nvector< Line > tangent_cc(Circle c1, Circle c2){\\n vector< Line > ret;\\n if(c1.r < c2.r) swap(c1,c2);\\n double g = norm(c1.p-c2.p);\\n if(equals(g,0.0)) return ret;\\n Point u = (c2.p-c1.p)/sqrt(g);\\n Point v = rotate(u, PI * 0.5);\\n for(int s:{-1,1}){\\n double h = (c1.r+ s*c2.r)/sqrt(g);\\n if(equals(1- h*h, 0)){\\n ret.emplace_back(c1.p+u*c1.r, c1.p+(u+v)*c1.r);\\n }else if(1-h*h > 0){\\n Point uu = u*h, vv = v*sqrt(1-h*h);\\n ret.emplace_back(c1.p+(uu+vv)*c1.r, c2.p-(uu+vv)*c2.r*s);\\n ret.emplace_back(c1.p+(uu-vv)*c1.r, c2.p-(uu-vv)*c2.r*s);\\n }\\n }\\n return ret;\\n}\\n\\nReal area_poly_c(const Polygon &p, const Circle &c) {\\n if(p.size() < 3) return 0.0;\\n function< Real(Circle, Point, Point) > cross_area = [&](const Circle &c, const Point &a, const Point &b) {\\n Point va = c.p - a, vb = c.p - b;\\n Real f = cross(va, vb), ret = 0.0;\\n if(equals(f, 0.0)) return ret;\\n if(max(abs(va), abs(vb)) < c.r + EPS) return f;\\n if(distance_sp(Segment(a, b), c.p) > c.r - EPS) return c.r * c.r * arg(vb * conj(va));\\n auto u = cross_point_cl(c, Segment(a, b));\\n vector< Point > tot{a, u.first, u.second, b};\\n for(int i = 0; i + 1 < tot.size(); i++) {\\n ret += cross_area(c, tot[i], tot[i + 1]);\\n }\\n return ret;\\n };\\n Real A = 0;\\n for(int i = 0; i < p.size(); i++) {\\n A += cross_area(c, p[i], p[(i + 1) % p.size()]);\\n }\\n return A;\\n}\\n\\nReal area_cc(const Circle &c1, const Circle &c2) {\\n Real d = abs(c1.p - c2.p);\\n if(c1.r + c2.r <= d + EPS) return 0.0;\\n if(d <= fabs(c1.r - c2.r) + EPS) {\\n Real r = min(c1.r, c2.r);\\n return r * r * PI;\\n }\\n Real rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\\n Real theta = acos(rc / c1.r);\\n Real phi = acos((d - rc) / c2.r);\\n return (c1.r * c1.r*theta + c2.r*c2.r*phi - d*c1.r*sin(theta));\\n}\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n\\n while(true) {\\n int n,m; cin >> n >> m; if(n == 0 && m == 0) break;\\n vector< Circle > Cs(n);\\n rep(i,n) cin >> Cs[i];\\n\\n vector<string> ans;\\n auto push = [&](string s){ ans.push_back(s); };\\n\\n rep(_,m) {\\n Point p,q; cin >> p >> q;\\n vector<int> id_p, id_q;\\n rep(i,n) {\\n if(abs(Cs[i].p - p) <= Cs[i].r) id_p.push_back(i);\\n if(abs(Cs[i].p - q) <= Cs[i].r) id_q.push_back(i);\\n }\\n sort(id_p.begin(), id_p.end());\\n sort(id_q.begin(), id_q.end());\\n if(id_p.size() > 0 || id_q.size() > 0) {\\n push(id_p == id_q ? \\\"YES\\\" : \\\"NO\\\"); continue;\\n }\\n vector<vector<int>> G(n);\\n rep(i,n)rep(j,n)if(i < j) {\\n if(intersect(Cs[i], Cs[j])) {\\n G[i].push_back(j);\\n G[j].push_back(i);\\n }\\n }\\n\\n bool ok = true;\\n while(true) {\\n vector<int> r(n, -1), f(n, -1), d(n, 0);\\n auto search = [&](void) {\\n function<void(int,int)> dfs = [&](int x, int v) -> void {\\n r[v] = x;\\n for(int to : G[v]) if(r[to] == -1) {\\n d[to] = d[v] + 1;\\n f[to] = v;\\n dfs(x, to);\\n } \\n };\\n\\n rep(i,n) if(f[i] == -1) dfs(i, i);\\n rep(i,n) {\\n for(int to : G[i]) {\\n if(r[i] == r[to] && d[to] - d[i] > 1) {\\n vector<int> res;\\n for(int v = to; v != i; v = f[v]) res.push_back(v);\\n res.push_back(i);\\n return res;\\n }\\n }\\n }\\n return vector<int>();\\n };\\n\\n auto c = search();\\n if(c.size() == 0) break;\\n vector< Point > poly(c.size());\\n rep(i,c.size()) poly[i] = Cs[c[i]].p;\\n if(contains(poly, p) != contains(poly, q)) ok = false;\\n\\n rep(i,G[c[0]].size()) {\\n if(G[c[0]][i] == c[1]) {\\n G[c[0]].erase(G[c[0]].begin() + i); break;\\n }\\n }\\n rep(i,G[c[1]].size()) {\\n if(G[c[1]][i] == c[0]) {\\n G[c[1]].erase(G[c[1]].begin() + i); break;\\n }\\n }\\n }\\n push(ok ? \\\"YES\\\" : \\\"NO\\\");\\n }\\n rep(i,m) { if(i) cout << \\\" \\\"; cout << ans[i]; } cout << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 8652,\n \"score_of_the_acc\": -1.0138,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1198_5903181\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n//geometry library by maine\\n\\n//basic\\nusing Real = double;\\nusing Point = complex<Real>;\\n#define x real()\\n#define y imag()\\nconst Real EPS = 1e-8, PI = acos(-1), INF = 1e10;\\n\\nistream& operator>>(istream& is, Point& p) {\\n Real a, b;\\n is >> a >> b;\\n p = Point(a, b);\\n return is;\\n}\\nostream& operator<<(ostream& os, Point p) {\\n return os << fixed << setprecision(10) << p.x << \\\" \\\" << p.y;\\n}\\n\\nPoint operator*(const Point& p, const Real& d) { return Point(p.x * d, p.y * d); }\\n\\nbool eq(const Real& r, const Real& s) { return abs(r - s) < EPS; }\\nbool eq(const Point& p, const Point& q) { return abs(p - q) < EPS; }\\n\\nnamespace std {\\nbool operator<(const Point& a, const Point& b) {\\n return !eq(a.x, b.x) ? a.x < b.x : a.y < b.y;\\n}\\n} // namespace std\\n\\nReal get_angle(const Point& a, const Point& b, const Point& c) {\\n return arg((c - a) / (b - a));\\n}\\n\\ninline int inc(int i, int N) {\\n return (i == N - 1 ? 0 : i + 1);\\n}\\ninline int dec(int i, int N) {\\n return (i == 0 ? N - 1 : i - 1);\\n}\\n\\n//unit vector\\nPoint e(const Point& p) { return p / abs(p); }\\n\\n//angle transformation\\nReal radian_to_degree(Real r) { return r * 180.0 / PI; }\\nReal degree_to_radian(Real d) { return d * PI / 180.0; }\\n\\n//basic functions\\nReal dot(const Point& p, const Point& q) { return p.x * q.x + p.y * q.y; }\\nReal cross(const Point& p, const Point& q) { return p.x * q.y - p.y * q.x; }\\nPoint rotate(const Real& theta, const Point& p) {\\n return {cos(theta) * p.x - sin(theta) * p.y, sin(theta) * p.x + cos(theta) * p.y};\\n}\\nPoint rotate90(const Point& p) {\\n return {-p.y, p.x};\\n}\\n\\n//structs : Line, Segment, Circle\\nstruct Line {\\n Point a, b;\\n Line() = default;\\n Line(Point a, Point b) : a(a), b(b) {}\\n Point d() const { return e(b - a); } //direction vector\\n Point n() const {\\n Point dd = d();\\n return {dd.y, -dd.x};\\n } //normal vector\\n};\\nstruct Segment : Line {\\n Segment() = default;\\n Segment(Point a, Point b) : Line(a, b) {}\\n};\\nstruct Circle {\\n Point p;\\n Real r;\\n Circle() = default;\\n Circle(Point p, Real r) : p(p), r(r){};\\n};\\nusing Points = vector<Point>;\\nusing Polygon = vector<Point>;\\nusing Polygons = vector<Polygon>;\\nusing Lines = vector<Line>;\\nusing Segments = vector<Segment>;\\nusing Circles = vector<Circle>;\\n\\n//happy functions\\n//https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\\nint ccw(const Point& a, const Point& bb, const Point& cc) {\\n Point b = bb - a, c = cc - a;\\n if (cross(b, c) > EPS)\\n return 1; //COUNTER_CLOCKWISE\\n if (cross(b, c) < -EPS)\\n return -1; //CLOCKWISE\\n if (dot(b, c) < 0)\\n return 2; //ONLINE_BACK c-a-b\\n if (norm(b) < norm(c))\\n return -2; //ONLINE_FRONT a-b-c\\n return 0; //ON_SEGMENT a-c-b\\n}\\n\\nbool parallel(const Line& l, const Line& m) { return eq(cross(l.d(), m.d()), 0.0); }\\nbool orthogonal(const Line& l, const Line& m) { return eq(dot(l.d(), m.d()), 0.0); }\\nPoint projection(const Line& l, const Point& p) { return l.a + (l.a - l.b) * (dot(p - l.a, l.a - l.b) / norm(l.a - l.b)); }\\nPoint reflection(const Line& l, const Point& p) { return p + (projection(l, p) - p) * 2.0; }\\n\\n//intersect\\nbool intersect(const Line& l, const Point& p) { return abs(ccw(l.a, l.b, p)) != 1; }\\nbool intersect(const Line& l, const Line& m) { return !parallel(l, m) || (parallel(l, m) && intersect(l, m.a)); }\\nbool intersect(const Segment& s, const Point& p) { return ccw(s.a, s.b, p) == 0; }\\nbool intersect(const Line& l, const Segment& s) { return cross(l.d(), s.a - l.a) * cross(l.d(), s.b - l.a) < EPS; }\\nbool intersect(const Segment& s, const Segment& t) {\\n return ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 && ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\\n}\\nbool intersect_onsegment(const Segment& s, const Point& p) { return intersect(s, p) && !eq(s.a, p) && !eq(s.b, p); }\\n\\n//distance\\nReal distance(const Point& p, const Point& q) { return abs(p - q); }\\nReal distance(const Line& l, const Point& p) { return distance(p, projection(l, p)); }\\nReal distance(const Line& l, const Line& m) { return intersect(l, m) ? 0 : distance(l, m.a); }\\nReal distance(const Segment& s, const Point& p) {\\n Point q = projection(s, p);\\n return intersect(s, q) ? distance(p, q) : min(distance(s.a, p), distance(s.b, p));\\n}\\nReal distance(const Segment& s, const Segment& t) { return intersect(s, t) ? 0 : min({distance(s, t.a), distance(s, t.b), distance(t, s.a), distance(t, s.b)}); }\\nReal distance(const Line& l, const Segment& s) { return intersect(l, s) ? 0 : min(distance(l, s.a), distance(l, s.b)); }\\n\\n//intersect circle\\nbool intersect(const Circle& c, const Point& p) { return eq(distance(c.p, p), c.r); }\\nbool intersect(const Circle& c, const Line& l) { return distance(l, c.p) <= c.r + EPS; }\\nint intersect(const Circle& c, const Segment& s) {\\n if (!intersect(c, Line(s)))\\n return 0;\\n Real da = distance(c.p, s.a), db = distance(c.p, s.b);\\n if (da < c.r + EPS && db < c.r + EPS)\\n return 0;\\n if (da > db)\\n swap(da, db);\\n if (da < c.r - EPS && db > c.r + EPS)\\n return 1;\\n if (intersect(s, projection(s, c.p)))\\n return 2;\\n return 0;\\n}\\nint intersect(Circle c1, Circle c2) {\\n if (c1.r < c2.r)\\n swap(c1, c2);\\n Real d = distance(c1.p, c2.p);\\n if (c1.r + c2.r < d)\\n return 4;\\n if (eq(c1.r + c2.r, d))\\n return 3;\\n if (c1.r - c2.r < d)\\n return 2;\\n if (eq(c1.r - c2.r, d))\\n return 1;\\n return 0;\\n}\\n\\n//crosspoint\\nPoint crosspoint(const Line& l, const Line& m) {\\n Real A = cross(l.b - l.a, m.b - m.a);\\n Real B = cross(l.b - l.a, l.b - m.a);\\n if (eq(abs(A), 0.0) && eq(abs(B), 0.0))\\n return m.a;\\n return m.a + (m.b - m.a) * B / A;\\n}\\nPoint crosspoint(const Segment& s, const Segment& t) { return crosspoint(Line(s), Line(t)); }\\npair<Point, Point> crosspoint(const Circle& c, const Line& l) {\\n Point p = projection(l, c.p);\\n if (eq(distance(l, c.p), c.r))\\n return {p, p};\\n Real len = sqrt(c.r * c.r - norm(p - c.p));\\n return {p - len * l.d(), p + len * l.d()};\\n}\\npair<Point, Point> crosspoint(const Circle& c, const Segment& s) {\\n Line l(s);\\n if (intersect(c, s) == 2)\\n return crosspoint(c, l);\\n auto ret = crosspoint(c, l);\\n if (dot(s.a - ret.first, s.b - ret.first) < 0)\\n ret.second = ret.first;\\n else\\n ret.first = ret.second;\\n return ret;\\n}\\npair<Point, Point> crosspoint(const Circle& c1, const Circle& c2) {\\n Real d = distance(c1.p, c2.p);\\n Real a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));\\n Real t = atan2(c2.p.y - c1.p.y, c2.p.x - c1.p.x);\\n Point p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\\n Point p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\\n return {p1, p2};\\n}\\n\\n//tangent\\npair<Point, Point> tangent(const Circle& c, const Point& p) {\\n return crosspoint(c, Circle(p, sqrt(norm(c.p - p) - c.r * c.r)));\\n}\\nLines tangent(Circle c1, Circle c2) {\\n Lines ret;\\n if (c1.r < c2.r)\\n swap(c1, c2);\\n if (eq(c1.p, c2.p))\\n return ret;\\n Real g = norm(c1.p - c2.p);\\n Point u = (c2.p - c1.p) / sqrt(g);\\n Point v = rotate(PI / 2, u);\\n for (int s : {-1, 1}) {\\n Real h = (c1.r + s * c2.r) / sqrt(g);\\n if (eq(1 - h * h, 0)) {\\n ret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\\n } else if (1 - h * h > 0) {\\n Point uu = u * h, vv = v * sqrt(1 - h * h);\\n ret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\\n ret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\\n }\\n }\\n return ret;\\n}\\n\\n//convex\\n//https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/3/CGL_3_B\\nbool is_convex(const Polygon& P) {\\n int N = (int)P.size();\\n for (int i = 0; i < N; i++) {\\n if (ccw(P[i], P[(i + 1) % N], P[(i + 2) % N]) == -1)\\n return false;\\n }\\n return true;\\n}\\n//https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/4/CGL_4_A\\nPolygon convex_hull(Points P) {\\n int N = (int)P.size(), k = 0;\\n if (N <= 2)\\n return P;\\n sort(begin(P), end(P));\\n Points ret(2 * N);\\n for (int i = 0; i < N; ret[k++] = P[i++]) {\\n while (k >= 2 && cross(ret[k - 1] - ret[k - 2], P[i] - ret[k - 1]) < EPS)\\n --k;\\n }\\n for (int i = N - 2, t = k + 1; i >= 0; ret[k++] = P[i--]) {\\n while (k >= t && cross(ret[k - 1] - ret[k - 2], P[i] - ret[k - 1]) < EPS)\\n --k;\\n }\\n ret.resize(k - 1);\\n return ret;\\n}\\n//https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/4/CGL_4_B\\nReal convex_diameter(const Polygon& P) {\\n int N = (int)P.size();\\n int is = 0, js = 0;\\n for (int i = 1; i < N; i++) {\\n if (P[i].y < P[is].y)\\n is = i;\\n if (P[i].y > P[js].y)\\n js = i;\\n }\\n Real maxdist = norm(P[is] - P[js]);\\n int maxi, maxj, i, j;\\n maxi = i = is;\\n maxj = j = js;\\n do {\\n if (cross(P[inc(i, N)] - P[i], P[inc(j, N)] - P[j]) >= 0)\\n j = inc(j, N);\\n else\\n i = inc(i, N);\\n if (norm(P[i] - P[j]) > maxdist) {\\n maxdist = norm(P[i] - P[j]);\\n maxi = i;\\n maxj = j;\\n }\\n } while (i != is || j != js);\\n maxi = maxi;\\n maxj = maxj;\\n return sqrt(maxdist);\\n}\\n//https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/4/CGL_4_C\\nPolygon convex_cut(const Polygon& P, const Line& l) {\\n Polygon ret;\\n int N = (int)P.size();\\n for (int i = 0; i < N; i++) {\\n Point now = P[i], nxt = P[(inc(i, N))];\\n if (ccw(l.a, l.b, now) != -1)\\n ret.emplace_back(now);\\n if (ccw(l.a, l.b, now) * ccw(l.a, l.b, nxt) == -1)\\n ret.emplace_back(crosspoint(Line(now, nxt), l));\\n }\\n return ret;\\n}\\n\\n//other\\nenum\\n{\\n OUT,\\n ON,\\n IN\\n};\\n\\n//https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/3/CGL_3_C\\nint contains(const Polygon& Q, const Point& p) {\\n bool in = false;\\n int N = (int)Q.size();\\n for (int i = 0; i < N; i++) {\\n Point a = Q[i] - p, b = Q[(i + 1) % N] - p;\\n if (a.y > b.y)\\n swap(a, b);\\n if (a.y <= 0 && 0 < b.y && cross(a, b) < 0)\\n in = !in;\\n if (cross(a, b) == 0 && dot(a, b) <= 0)\\n return ON;\\n }\\n return in ? IN : OUT;\\n}\\n\\n//https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/3/CGL_3_A\\nReal area(const Polygon& P) {\\n Real A = 0;\\n for (int i = 0; i < (int)P.size(); i++) {\\n A += cross(P[i], P[(i + 1) % P.size()]);\\n }\\n return A * 0.5;\\n}\\n\\n//https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/7/CGL_7_H\\nReal cross_area(const Circle& c, const Point& a, const Point& b) {\\n Point va = c.p - a, vb = c.p - b;\\n Real f = cross(va, vb), ret = 0.0;\\n if (eq(f, 0.0))\\n return ret;\\n if (max(abs(va), abs(vb)) < c.r + EPS)\\n return f;\\n if (distance(Segment(a, b), c.p) > c.r - EPS)\\n return c.r * c.r * arg(vb * conj(va));\\n auto u = crosspoint(c, Segment(a, b));\\n vector<Point> V{a, u.first, u.second, b};\\n for (int i = 0; i < (int)V.size() - 1; i++) {\\n ret += cross_area(c, V[i], V[i + 1]);\\n }\\n return ret;\\n}\\nReal area(const Polygon& p, const Circle& c) {\\n int N = (int)p.size();\\n if (N < 3)\\n return 0.0;\\n Real ret = 0;\\n for (int i = 0; i < N; i++) {\\n ret += cross_area(c, p[i], p[inc(i, N)]);\\n }\\n return ret / 2.0;\\n}\\n\\n//https://onlinejudge.u-aizu.ac.jp/problems/CGL_5_A\\nReal closest_pair(Points& P, int left, int right) {\\n if (right - left <= 1)\\n return 1e18;\\n int mid = (left + right) / 2;\\n Real xx = P[mid].x;\\n Real dist = min(closest_pair(P, left, mid), closest_pair(P, mid, right));\\n inplace_merge(P.begin() + left, P.begin() + mid, P.begin() + right, [&](const Point& a, const Point& b) { return a.y < b.y; });\\n Points memo;\\n memo.reserve(right - left);\\n for (int i = left; i < right; i++) {\\n if (abs(P[i].x - xx) >= dist)\\n continue;\\n for (int j = (int)memo.size() - 1; j >= 0; j--) {\\n if (P[i].y - memo[j].y >= dist)\\n break;\\n dist = min(dist, distance(P[i], memo[j]));\\n }\\n memo.emplace_back(P[i]);\\n }\\n return dist;\\n}\\nReal closest_pair(Points P) {\\n sort(begin(P), end(P));\\n return closest_pair(P, 0, (int)P.size());\\n}\\n\\n//https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/7/CGL_7_B\\nCircle incircle(Polygon P) {\\n assert((int)P.size() == 3);\\n Real l0 = distance(P[1], P[2]), l1 = distance(P[0], P[2]), l2 = distance(P[0], P[1]);\\n Circle c;\\n c.p = crosspoint(Line(P[0], (P[1] * l1 + P[2] * l2) / (l1 + l2)), Line(P[1], (P[0] * l0 + P[2] * l2) / (l0 + l2)));\\n c.r = distance(Line(P[0], P[1]), c.p);\\n return c;\\n}\\n\\n//https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/7/CGL_7_C\\nCircle circumcircle(Polygon P) {\\n assert((int)P.size() == 3);\\n Circle c;\\n c.p = crosspoint(Line((P[0] + P[1]) / 2.0, (P[0] + P[1]) / 2.0 + rotate90(P[0] - P[1])),\\n Line((P[0] + P[2]) / 2.0, (P[0] + P[2]) / 2.0 + rotate90(P[0] - P[2])));\\n c.r = distance(c.p, P[0]);\\n return c;\\n}\\n\\n#undef x\\n#undef y\\n\\nstruct UF {\\n vector<int> data;\\n UF(int n) : data(n, -1) {}\\n int root(int k) {\\n if (data[k] < 0)\\n return k;\\n return data[k] = root(data[k]);\\n }\\n bool unite(int x, int y) {\\n x = root(x), y = root(y);\\n if (x == y)\\n return false;\\n if (data[x] > data[y])\\n swap(x, y);\\n data[x] += data[y];\\n data[y] = x;\\n return true;\\n }\\n bool same(int x, int y) {\\n return root(x) == root(y);\\n }\\n int size(int k) { return -data[root(k)]; }\\n};\\n\\n\\nint main() {\\n int N, M;\\n while (cin >> N >> M, N) {\\n Circles C(N);\\n for (auto&& c : C) {\\n cin >> c.p >> c.r;\\n }\\n vector<vector<double>> ang(N);\\n for (int i = 0; i < N; i++) {\\n for (int j = 0; j < i; j++) {\\n auto &c1 = C[i], &c2 = C[j];\\n if (intersect(c1, c2) == 2) {\\n auto [p1, p2] = crosspoint(c1, c2);\\n ang[i].emplace_back(arg(p1 - c1.p));\\n ang[i].emplace_back(arg(p2 - c1.p));\\n ang[j].emplace_back(arg(p1 - c2.p));\\n ang[j].emplace_back(arg(p2 - c2.p));\\n }\\n }\\n }\\n int n = 0;\\n vector<int> Vidx;\\n for (auto&& V : ang) {\\n for (auto&& x : V) {\\n if (eq(-PI, x))\\n x = PI;\\n }\\n if (V.size() == 0)\\n V.emplace_back(0);\\n sort(begin(V), end(V));\\n Vidx.emplace_back(n);\\n n += (int)V.size();\\n }\\n UF uf(n * 2);\\n\\n auto f = [&](int i, int j, bool outer) {\\n j += (int)ang[i].size();\\n if (j >= (int)ang[i].size())\\n j %= (int)ang[i].size();\\n return (Vidx[i] + j) * 2 + (int)outer;\\n };\\n\\n vector<bool> canconnectin(n * 2, true);\\n vector<bool> canconnectout(n * 2, true);\\n\\n for (int i = 0; i < N; i++) {\\n for (int j = 0; j < N; j++) {\\n if (i == j)\\n continue;\\n auto c1 = C[i], c2 = C[j];\\n if (intersect(c1, c2) == 2) {\\n auto p = crosspoint(c1, c2).first;\\n double a1 = arg(p - c1.p), a2 = arg(p - c2.p);\\n if (eq(a1, -PI))\\n a1 = PI;\\n if (eq(a2, -PI))\\n a2 = PI;\\n int idx1 = lower_bound(cbegin(ang[i]), cend(ang[i]), a1 - EPS) - cbegin(ang[i]);\\n int idx2 = lower_bound(cbegin(ang[j]), cend(ang[j]), a2 - EPS) - cbegin(ang[j]);\\n uf.unite(f(i, idx1, true), f(j, idx2, false));\\n uf.unite(f(i, idx1 + 1, true), f(j, idx2, true));\\n uf.unite(f(i, idx1 + 1, false), f(j, idx2 + 1, true));\\n uf.unite(f(i, idx1, false), f(j, idx2 + 1, false));\\n canconnectin[f(i, idx1, false)] = false;\\n canconnectout[f(i, idx1, true)] = false;\\n canconnectin[f(j, idx2 + 1, false)] = false;\\n canconnectin[f(j, idx2 + 1, true)] = false;\\n }\\n }\\n }\\n\\n for (int i = 0; i < N; i++) {\\n for (int j = 0; j < N; j++) {\\n if (i == j)\\n continue;\\n auto c1 = C[i], c2 = C[j];\\n if (intersect(c1, c2) == 0 && c1.r > c2.r) {\\n for (int idx1 = 0; idx1 < (int)ang[i].size(); idx1++) {\\n for (int idx2 = 0; idx2 < (int)ang[j].size(); idx2++) {\\n int f1 = f(i, idx1, false);\\n int f2 = f(j, idx2, true);\\n if (canconnectin[f1] && canconnectin[f2])\\n uf.unite(f1, f2);\\n }\\n }\\n }\\n\\n if (intersect(c1, c2) == 4) {\\n Line L{c1.p, c2.p};\\n Point p1 = crosspoint(c1, L).second;\\n Point p2 = crosspoint(c2, L).first;\\n Segment S{p1, p2};\\n int cnt = 0;\\n for (auto&& c : C) {\\n cnt += intersect(c, S);\\n }\\n if (cnt == 0) {\\n double a1 = arg(p1 - c1.p), a2 = arg(p2 - c2.p);\\n if (eq(a1, -PI))\\n a1 = PI;\\n if (eq(a2, -PI))\\n a2 = PI;\\n int idx1 = lower_bound(cbegin(ang[i]), cend(ang[i]), a1 - EPS) - cbegin(ang[i]);\\n int idx2 = lower_bound(cbegin(ang[j]), cend(ang[j]), a2 - EPS) - cbegin(ang[j]);\\n uf.unite(f(i, idx1, true), f(j, idx2, true));\\n }\\n }\\n }\\n }\\n\\n vector<bool> ans;\\n\\n while (M--) {\\n Point p, q;\\n cin >> p >> q;\\n\\n auto find = [&](Point p) {\\n vector<pair<double, int>> V;\\n for (int i = 0; i < N; i++) {\\n auto c = C[i];\\n V.emplace_back(abs(distance(p, c.p) - c.r), i);\\n }\\n auto [d, i] = *min_element(cbegin(V), cend(V));\\n auto c = C[i];\\n bool outer = distance(p, c.p) >= c.r;\\n double a = arg(p - c.p);\\n if (eq(a, -PI))\\n a = PI;\\n int idx = lower_bound(cbegin(ang[i]), cend(ang[i]), a - EPS) - cbegin(ang[i]);\\n return f(i, idx, outer);\\n };\\n\\n ans.emplace_back(uf.same(find(p), find(q)));\\n }\\n\\n for (int i = 0; i < ans.size(); i++) {\\n cout << (ans[i] ? \\\"YES\\\" : \\\"NO\\\") << \\\" \\\\n\\\"[i == ans.size() - 1];\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1460,\n \"memory_kb\": 3900,\n \"score_of_the_acc\": -1.1154,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1198_5633420\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nconst double EPS = 0.0001;\\nstruct point{\\n double x, y;\\n point(){\\n }\\n point(double x, double y): x(x), y(y){\\n }\\n point operator -(point P){\\n return point(x - P.x, y - P.y);\\n }\\n};\\ndouble abs(point P){\\n return sqrt(P.x * P.x + P.y * P.y);\\n}\\ndouble dist(point P, point Q){\\n return abs(Q - P);\\n}\\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 segment_intersect(line L1, line L2){\\n if (cross(L1.A - L2.A, vec(L2)) * cross(L1.B - L2.A, vec(L2)) > 0){\\n return false;\\n }\\n if (cross(L2.A - L1.A, vec(L1)) * cross(L2.B - L1.A, vec(L1)) > 0){\\n return false;\\n }\\n return true;\\n}\\nbool point_in_polygon(point P, vector<point> Q){\\n int N = Q.size();\\n point P2 = point(P.x + 100000, P.y + 123456);\\n int cnt = 0;\\n for (int i = 0; i < N; i++){\\n line L1(Q[i], Q[(i + 1) % N]);\\n line L2(P, P2);\\n if (segment_intersect(L1, L2)){\\n cnt++;\\n }\\n }\\n if (cnt % 2 == 1){\\n return true;\\n } else {\\n return false;\\n }\\n}\\nstruct circle{\\n point C;\\n double r;\\n circle(){\\n }\\n};\\nbool point_in_circle(point P, circle C){\\n return dist(P, C.C) < C.r;\\n}\\nbool circle_intersect(circle C1, circle C2){\\n double d = dist(C1.C, C2.C);\\n return abs(C1.r - C2.r) - EPS < d && d < C1.r + C2.r + EPS;\\n}\\nvoid dfs(vector<vector<int>> &E, vector<int> &r, vector<int> &p, vector<int> &d, int r2, int v){\\n r[v] = r2;\\n for (int w : E[v]){\\n if (r[w] == -1){\\n d[w] = d[v] + 1;\\n p[w] = v;\\n dfs(E, r, p, d, r2, w);\\n }\\n }\\n}\\nvector<int> detect_cycle(vector<vector<int>> E){\\n int N = E.size();\\n vector<int> r(N, -1);\\n vector<int> p(N, -1);\\n vector<int> d(N, 0);\\n for (int i = 0; i < N; i++){\\n if (p[i] == -1){\\n dfs(E, r, p, d, i, i);\\n }\\n }\\n for (int i = 0; i < N; i++){\\n for (int j : E[i]){\\n if (r[i] == r[j] && d[j] - d[i] > 1){\\n vector<int> c;\\n for (int v = j; v != i; v = p[v]){\\n c.push_back(v);\\n }\\n c.push_back(i);\\n return c;\\n }\\n }\\n }\\n return vector<int>();\\n}\\nint main(){\\n while (true){\\n int n, m;\\n cin >> n >> m;\\n if (n == 0 && m == 0){\\n break;\\n }\\n vector<circle> C(n);\\n for (int i = 0; i < n; i++){\\n cin >> C[i].C.x >> C[i].C.y >> C[i].r;\\n }\\n for (int i = 0; i < m; i++){\\n point P, Q;\\n cin >> P.x >> P.y >> Q.x >> Q.y;\\n set<int> st1, st2;\\n for (int j = 0; j < n; j++){\\n if (point_in_circle(P, C[j])){\\n st1.insert(j);\\n }\\n if (point_in_circle(Q, C[j])){\\n st2.insert(j);\\n }\\n }\\n if (!st1.empty() || !st2.empty()){\\n if (st1 == st2){\\n cout << \\\"YES\\\";\\n } else {\\n cout << \\\"NO\\\";\\n }\\n } else {\\n vector<vector<int>> E(n);\\n for (int j = 0; j < n; j++){\\n for (int k = j + 1; k < n; k++){\\n if (circle_intersect(C[j], C[k])){\\n E[j].push_back(k);\\n E[k].push_back(j);\\n }\\n }\\n }\\n bool ok = true;\\n while (true){\\n vector<int> c = detect_cycle(E);\\n if (c.empty()){\\n break;\\n }\\n int cnt = c.size();\\n vector<point> p(cnt);\\n for (int j = 0; j < cnt; j++){\\n p[j] = C[c[j]].C;\\n }\\n if (point_in_polygon(P, p) != point_in_polygon(Q, p)){\\n ok = false;\\n }\\n for (int j = 0; j < E[c[0]].size(); j++){\\n if (E[c[0]][j] == c[1]){\\n E[c[0]].erase(E[c[0]].begin() + j);\\n break;\\n }\\n }\\n for (int j = 0; j < E[c[1]].size(); j++){\\n if (E[c[1]][j] == c[0]){\\n E[c[1]].erase(E[c[1]].begin() + j);\\n break;\\n }\\n }\\n }\\n if (ok){\\n cout << \\\"YES\\\";\\n } else {\\n cout << \\\"NO\\\";\\n }\\n }\\n if (i < m - 1){\\n cout << ' ';\\n }\\n }\\n cout << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3508,\n \"score_of_the_acc\": -0.0493,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1198_5629175\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nconst double EPS = 0.0001;\\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 dist(point P, point Q){\\n return abs(Q - P);\\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 segment_intersect(line L1, line L2){\\n if (cross(L1.A - L2.A, vec(L2)) * cross(L1.B - L2.A, vec(L2)) > 0){\\n return false;\\n }\\n if (cross(L2.A - L1.A, vec(L1)) * cross(L2.B - L1.A, vec(L1)) > 0){\\n return false;\\n }\\n return true;\\n}\\nstruct circle{\\n point C;\\n double r;\\n circle(){\\n }\\n};\\nbool point_in_circle(point P, circle C){\\n return dist(P, C.C) < C.r;\\n}\\nbool circle_intersects(circle C1, circle C2){\\n double d = dist(C1.C, C2.C);\\n return abs(C1.r - C2.r) - EPS < d && d < C1.r + C2.r + EPS;\\n}\\nbool point_in_polygon(point P, vector<point> Q){\\n int N = Q.size();\\n point P2 = point(P.x + 100000, P.y + 123456);\\n int cnt = 0;\\n for (int i = 0; i < N; i++){\\n line L1(Q[i], Q[(i + 1) % N]);\\n line L2(P, P2);\\n if (segment_intersect(L1, L2)){\\n cnt++;\\n }\\n }\\n if (cnt % 2 == 1){\\n return true;\\n } else {\\n return false;\\n }\\n}\\nvoid dfs(vector<vector<int>> &E, vector<int> &r, vector<int> &p, vector<int> &d, int r2, int v){\\n r[v] = r2;\\n for (int w : E[v]){\\n if (r[w] == -1){\\n d[w] = d[v] + 1;\\n p[w] = v;\\n dfs(E, r, p, d, r2, w);\\n }\\n }\\n}\\nvector<int> detect_cycle(vector<vector<int>> E){\\n int N = E.size();\\n vector<int> r(N, -1);\\n vector<int> p(N, -1);\\n vector<int> d(N, 0);\\n for (int i = 0; i < N; i++){\\n if (p[i] == -1){\\n dfs(E, r, p, d, i, i);\\n }\\n }\\n for (int i = 0; i < N; i++){\\n for (int j : E[i]){\\n if (r[i] == r[j] && d[j] - d[i] > 1){\\n vector<int> c;\\n for (int v = j; v != i; v = p[v]){\\n c.push_back(v);\\n }\\n c.push_back(i);\\n return c;\\n }\\n }\\n }\\n return vector<int>();\\n}\\nint main(){\\n while (true){\\n int n, m;\\n cin >> n >> m;\\n if (n == 0 && m == 0){\\n break;\\n }\\n vector<circle> C(n);\\n for (int i = 0; i < n; i++){\\n cin >> C[i].C.x >> C[i].C.y >> C[i].r;\\n }\\n for (int i = 0; i < m; i++){\\n point P, Q;\\n cin >> P.x >> P.y >> Q.x >> Q.y;\\n set<int> st1, st2;\\n for (int j = 0; j < n; j++){\\n if (point_in_circle(P, C[j])){\\n st1.insert(j);\\n }\\n if (point_in_circle(Q, C[j])){\\n st2.insert(j);\\n }\\n }\\n if (!st1.empty() || !st2.empty()){\\n if (st1 == st2){\\n cout << \\\"YES\\\";\\n } else {\\n cout << \\\"NO\\\";\\n }\\n } else {\\n vector<vector<int>> E(n);\\n for (int j = 0; j < n; j++){\\n for (int k = j + 1; k < n; k++){\\n if (circle_intersects(C[j], C[k])){\\n E[j].push_back(k);\\n E[k].push_back(j);\\n }\\n }\\n }\\n bool ok = true;\\n while (true){\\n vector<int> c = detect_cycle(E);\\n if (c.empty()){\\n break;\\n }\\n int cnt = c.size();\\n vector<point> p(cnt);\\n for (int j = 0; j < cnt; j++){\\n p[j] = C[c[j]].C;\\n }\\n if (point_in_polygon(P, p) != point_in_polygon(Q, p)){\\n ok = false;\\n }\\n for (int j = 0; j < E[c[0]].size(); j++){\\n if (E[c[0]][j] == c[1]){\\n E[c[0]].erase(E[c[0]].begin() + j);\\n break;\\n }\\n }\\n for (int j = 0; j < E[c[1]].size(); j++){\\n if (E[c[1]][j] == c[0]){\\n E[c[1]].erase(E[c[1]].begin() + j);\\n break;\\n }\\n }\\n }\\n if (ok){\\n cout << \\\"YES\\\";\\n } else {\\n cout << \\\"NO\\\";\\n }\\n }\\n if (i < m - 1){\\n cout << ' ';\\n }\\n }\\n cout << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3500,\n \"score_of_the_acc\": -0.0478,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1198_5628739\",\n \"code_snippet\": \"/*\\tauthor: Kite_kuma\\n\\tcreated: 2021.06.29 20:45:02 */\\n\\n// #ifdef LOCAL\\n// #define _GLIBCXX_DEBUG\\n// #endif\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#pragma region macros\\n\\n#define foa(s, v) for(auto &s : v)\\n#define all(v) (v).begin(), (v).end()\\n#define rall(v) (v).rbegin(), (v).rend()\\n#define popcnt(n) __builtin_popcountll((long long)n)\\n\\n#define REPname(a, b, c, d, e, ...) e\\n#define rep(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\\n#define REP0(x) for(int Counter_in_rep_macro = 0; Counter_in_rep_macro < (x); ++Counter_in_rep_macro)\\n#define REP1(i, x) for(int i = 0; i < (x); ++i)\\n#define REP2(i, l, r) for(int i = (l); i < (r); ++i)\\n#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))\\n\\n#define DREPname(a, b, c, d, e, ...) e\\n#define drep(...) DREPname(__VA_ARGS__, DREP3, DREP2, DREP1)(__VA_ARGS__)\\n#define DREP1(i, x) for(int i = (x)-1; i >= 0; --i)\\n#define DREP2(i, l, r) for(int i = (r)-1; i >= (l); --i)\\n#define DREP3(i, l, r, c) for(int i = (r)-1; i >= (l); i -= (c))\\n\\n#pragma endregion\\n\\n#pragma region aliases\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\nusing vi = std::vector<int>;\\nusing vvi = std::vector<std::vector<int>>;\\nusing vvvi = std::vector<std::vector<std::vector<int>>>;\\nusing vll = std::vector<ll>;\\nusing vvll = std::vector<vll>;\\nusing vvvll = std::vector<vvll>;\\nusing pii = std::pair<int, int>;\\nusing pll = std::pair<long long, long long>;\\ntemplate <class T = ll>\\nusing V = std::vector<T>;\\ntemplate <class T = ll>\\nusing VV = V<V<T>>;\\ntemplate <class T = ll>\\nusing VVV = V<V<V<T>>>;\\ntemplate <class T = ll>\\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\\ntemplate <class T = ll>\\nusing pqdn = std::priority_queue<T>;\\n\\n#pragma endregion\\n\\n#pragma region constants\\n\\nconst int inf = 1e9;\\nconst long long INF = 1e18;\\nconst long double pi = acos(-1);\\nconst char dl = '\\\\n';\\nconst char sp = ' ';\\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\\n\\nconst int mod_1000000007 = 1000000007;\\nconst int mod_998244353 = 998244353;\\n\\n#pragma endregion\\n\\n#pragma region basic_operation\\n\\ntemplate <class T0, class T1, class T2>\\ninline bool in_range(T0 x, T1 lef, T2 rig) {\\n\\treturn ((lef <= x) && (x < rig));\\n}\\n\\ntemplate <class T>\\ninline bool chmin(T &a, T b) {\\n\\tif(a > b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\ntemplate <class T>\\ninline bool chmax(T &a, T b) {\\n\\tif(a < b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\n\\nvoid Yes(bool f = 1) { std::cout << (f ? \\\"Yes\\\" : \\\"No\\\") << '\\\\n'; }\\nvoid No() { std::cout << \\\"No\\\\n\\\"; }\\nvoid YES(bool f = 1) { std::cout << (f ? \\\"YES\\\" : \\\"NO\\\") << '\\\\n'; }\\nvoid NO() { std::cout << \\\"NO\\\\n\\\"; }\\n\\ntemplate <class T>\\nvoid drop(T answer) {\\n\\tstd::cout << answer << '\\\\n';\\n\\texit(0);\\n}\\n\\nvoid err(bool flag = true) {\\n\\tif(!flag) return;\\n\\tstd::cout << -1 << '\\\\n';\\n\\texit(0);\\n}\\n\\ntemplate <class T>\\nvoid vout(std::vector<T> const &v, bool vertically = 0) {\\n\\tif(vertically) {\\n\\t\\tfor(auto const &a : v) {\\n\\t\\t\\tstd::cout << a << '\\\\n';\\n\\t\\t}\\n\\t\\treturn;\\n\\t}\\n\\tfor(auto it = v.begin(); it != v.end(); it++) {\\n\\t\\tstd::cout << (*it);\\n\\t\\tif(it != v.end() - 1) {\\n\\t\\t\\tstd::cout << ' ';\\n\\t\\t}\\n\\t}\\n\\tstd::cout << '\\\\n';\\n\\treturn;\\n}\\n\\ninline void print() { std::cout << '\\\\n'; }\\ntemplate <class T>\\ninline void print(T x) {\\n\\tstd::cout << x << '\\\\n';\\n\\treturn;\\n}\\ntemplate <typename Head, typename... Tail>\\nvoid print(Head H, Tail... T) {\\n\\tstd::cout << H << \\\" \\\";\\n\\tprint(T...);\\n}\\n\\ntemplate <class T>\\nvoid add(std::vector<T> &v, T val) {\\n\\tfor(auto &a : v) a += val;\\n\\treturn;\\n}\\n\\ntemplate <class T>\\nT dup(T a, T b) {\\n\\tassert(b != 0);\\n\\treturn (a + b - 1) / b;\\n}\\n\\ntemplate <class T>\\nT greatest_lower_multiple(T x, T d) {\\n\\tif(d == 0) return 0;\\n\\tif(d < 0) d *= -1;\\n\\tT y = x % d;\\n\\tif(y < 0) y += d;\\n\\treturn x - y;\\n}\\n\\ntemplate <class T>\\nT least_upper_multiple(T x, T d) {\\n\\treturn -greatest_lower_multiple(-x, d);\\n}\\n\\nlong long POW(long long a, long long n) {\\n\\tlong long res = 1;\\n\\twhile(n > 0) {\\n\\t\\tif(n & 1) res = res * a;\\n\\t\\ta = a * a;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn res;\\n}\\n\\nlong long modpow(long long a, long long n, long long mod) {\\t // a^n mod\\n\\tassert(n >= 0 && mod);\\n\\tif(mod == 1) return 0LL;\\n\\tlong long res = 1;\\n\\twhile(n > 0) {\\n\\t\\tif(n & 1) res = res * a % mod;\\n\\t\\ta = a * a % mod;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn res < 0 ? res + mod : res;\\n}\\n\\n// return x which satisfies a * x % mod == gcd(a, mod)\\n// not (mod | a)\\nlong long modinv(long long a, long long mod) {\\n\\tlong long b = mod, u = 1, v = 0;\\n\\twhile(b) {\\n\\t\\tlong long t = a / b;\\n\\t\\ta -= t * b;\\n\\t\\tstd::swap(a, b);\\n\\t\\tu -= t * v;\\n\\t\\tstd::swap(u, v);\\n\\t}\\n\\tu %= mod;\\n\\tif(u < 0) u += mod;\\n\\treturn u;\\n}\\n\\ntemplate <class T>\\nint lb(const std::vector<T> &a, const T x) {\\n\\treturn std::distance(a.begin(), std::lower_bound(a.begin(), a.end(), x));\\n}\\ntemplate <class T>\\nint ub(const std::vector<T> &a, const T x) {\\n\\treturn std::distance(a.begin(), std::upper_bound(a.begin(), a.end(), x));\\n}\\ntemplate <class T>\\nvoid unq_sort(std::vector<T> &a) {\\n\\tstd::sort(a.begin(), a.end());\\n\\ta.erase(std::unique(a.begin(), a.end()), a.end());\\n}\\ntemplate <class T>\\nstd::vector<int> press(std::vector<T> &a) {\\n\\tauto vec = a;\\n\\tunq_sort(vec);\\n\\tstd::vector<int> ret;\\n\\tfor(auto &v : a) ret.push_back(lb(vec, v));\\n\\treturn ret;\\n}\\n\\n#pragma endregion\\n\\n#pragma region input\\n#define VEC(type, name, size) \\\\\\n\\tvector<type> name(size); \\\\\\n\\tscanner::INPUT(name)\\n#define VVEC(type, name, h, w) \\\\\\n\\tvector<vector<type>> name(h, vector<type>(w)); \\\\\\n\\tscanner::INPUT(name)\\n#define INT(...) \\\\\\n\\tint __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define LL(...) \\\\\\n\\tlong long __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define STR(...) \\\\\\n\\tstring __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define CHR(...) \\\\\\n\\tchar __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define DBL(...) \\\\\\n\\tdouble __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define LD(...) \\\\\\n\\tlong double __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define TPL3(type0, type1, type2, name) \\\\\\n\\tstd::tuple<type0, type1, type2> name; \\\\\\n\\tscanner::INPUT(name);\\n#define TPL4(type0, type1, type2, type3, name) \\\\\\n\\tstd::tuple<type0, type1, type2, type3> name; \\\\\\n\\tscanner::INPUT(name);\\n\\nnamespace scanner {\\ntemplate <class T>\\nvoid scan(T &a) {\\n\\tstd::cin >> a;\\n}\\n\\ntemplate <class T, class L>\\nvoid scan(std::pair<T, L> &p) {\\n\\tscan(p.first);\\n\\tscan(p.second);\\n}\\n\\ntemplate <class T0, class T1, class T2>\\nvoid scan(std::tuple<T0, T1, T2> &p) {\\n\\tT0 t0;\\n\\tT1 t1;\\n\\tT2 t2;\\n\\tscan(t0);\\n\\tscan(t1);\\n\\tscan(t2);\\n\\tp = std::make_tuple(t0, t1, t2);\\n}\\n\\ntemplate <class T0, class T1, class T2, class T3>\\nvoid scan(std::tuple<T0, T1, T2, T3> &p) {\\n\\tT0 t0;\\n\\tT1 t1;\\n\\tT2 t2;\\n\\tT3 t3;\\n\\tscan(t0);\\n\\tscan(t1);\\n\\tscan(t2);\\n\\tscan(t3);\\n\\tp = std::make_tuple(t0, t1, t2, t3);\\n}\\n\\ntemplate <class T>\\nvoid scan(std::vector<T> &a) {\\n\\tfor(auto &i : a) scan(i);\\n}\\n\\nvoid INPUT() {}\\ntemplate <class Head, class... Tail>\\nvoid INPUT(Head &head, Tail &... tail) {\\n\\tscan(head);\\n\\tINPUT(tail...);\\n}\\n} // namespace scanner\\n\\ntemplate <typename T1, typename T2>\\nstd::istream &operator>>(std::istream &is, std::pair<T1, T2> &p) {\\n\\tis >> p.first >> p.second;\\n\\treturn is;\\n}\\n#pragma endregion\\n\\n#pragma region debug\\n\\n#pragma region output\\ntemplate <typename T1, typename T2>\\nstd::ostream &std::operator<<(std::ostream &os, const std::pair<T1, T2> &p) {\\n\\tos << p.first << \\\" \\\" << p.second;\\n\\treturn os;\\n}\\ntemplate <class T>\\nstd::ostream &std::operator<<(std::ostream &os, const std::vector<T> &v) {\\n\\tfor(int i = 0; i < (int)v.size(); i++) {\\n\\t\\tif(i) os << \\\" \\\";\\n\\t\\tos << v[i];\\n\\t}\\n\\treturn os;\\n}\\n#pragma endregion\\n\\n#pragma region view\\n\\nnamespace viewer {\\nvoid view(const long long e) {\\n\\tif(e == INF)\\n\\t\\tstd::cerr << \\\"INF\\\";\\n\\telse if(e == -INF)\\n\\t\\tstd::cerr << \\\"-INF\\\";\\n\\telse\\n\\t\\tstd::cerr << e;\\n}\\n\\nvoid view(const int e) {\\n\\tif(e == inf)\\n\\t\\tstd::cerr << \\\"inf\\\";\\n\\telse if(e == -inf)\\n\\t\\tstd::cerr << \\\"-inf\\\";\\n\\telse\\n\\t\\tstd::cerr << e;\\n}\\n\\ntemplate <typename T>\\nvoid view(const T e) {\\n\\tstd::cerr << e;\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::pair<T, U> &p) {\\n\\tstd::cerr << \\\"(\\\";\\n\\tview(p.first);\\n\\tstd::cerr << \\\", \\\";\\n\\tview(p.second);\\n\\tstd::cerr << \\\")\\\";\\n}\\n\\ntemplate <class T0, class T1, class T2>\\nvoid view(const std::tuple<T0, T1, T2> &p) {\\n\\tstd::cerr << \\\"(\\\";\\n\\tview(std::get<0>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<1>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<2>(p));\\n\\tstd::cerr << \\\")\\\";\\n}\\n\\ntemplate <class T0, class T1, class T2, class T3>\\nvoid view(const std::tuple<T0, T1, T2, T3> &p) {\\n\\tstd::cerr << \\\"(\\\";\\n\\tview(std::get<0>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<1>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<2>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<3>(p));\\n\\tstd::cerr << \\\")\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::set<T> &s) {\\n\\tif(s.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(auto &t : s) {\\n\\t\\tview(t);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::unordered_set<T> &s) {\\n\\tif(s.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(auto &t : s) {\\n\\t\\tview(t);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::vector<T> &v) {\\n\\tif(v.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(const auto &e : v) {\\n\\t\\tview(e);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::vector<std::vector<T>> &vv) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &v : vv) {\\n\\t\\tstd::cerr << \\\"\\\\t\\\";\\n\\t\\tview(v);\\n\\t\\tstd::cerr << '\\\\n';\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::vector<std::pair<T, U>> &v) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &c : v) {\\n\\t\\tstd::cerr << \\\"\\\\t(\\\";\\n\\t\\tview(c.first);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t\\tview(c.second);\\n\\t\\tstd::cerr << \\\")\\\\n\\\";\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <class T0, class T1, class T2>\\nvoid view(const std::vector<std::tuple<T0, T1, T2>> &v) {\\n\\tif(v.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << '{';\\n\\tfor(const auto &t : v) {\\n\\t\\tstd::cerr << \\\"\\\\n\\\\t\\\";\\n\\t\\tview(t);\\n\\t\\tstd::cerr << \\\",\\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\n}\\\";\\n}\\n\\ntemplate <class T0, class T1, class T2, class T3>\\nvoid view(const std::vector<std::tuple<T0, T1, T2, T3>> &v) {\\n\\tif(v.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << '{';\\n\\tfor(const auto &t : v) {\\n\\t\\tstd::cerr << \\\"\\\\n\\\\t\\\";\\n\\t\\tview(t);\\n\\t\\tstd::cerr << \\\",\\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\n}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::map<T, U> &m) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &t : m) {\\n\\t\\tstd::cerr << \\\"\\\\t[\\\";\\n\\t\\tview(t.first);\\n\\t\\tstd::cerr << \\\"] : \\\";\\n\\t\\tview(t.second);\\n\\t\\tstd::cerr << '\\\\n';\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::unordered_map<T, U> &m) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &t : m) {\\n\\t\\tstd::cerr << \\\"\\\\t[\\\";\\n\\t\\tview(t.first);\\n\\t\\tstd::cerr << \\\"] : \\\";\\n\\t\\tview(t.second);\\n\\t\\tstd::cerr << '\\\\n';\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n} // namespace viewer\\n\\n#pragma endregion\\n\\n// when debugging : g++ foo.cpp -DLOCAL\\n#ifdef LOCAL\\nvoid debug_out() {}\\ntemplate <typename Head, typename... Tail>\\nvoid debug_out(Head H, Tail... T) {\\n\\tviewer::view(H);\\n\\tstd::cerr << \\\", \\\";\\n\\tdebug_out(T...);\\n}\\n#define debug(...) \\\\\\n\\tdo { \\\\\\n\\t\\tstd::cerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"] : [\\\"; \\\\\\n\\t\\tdebug_out(__VA_ARGS__); \\\\\\n\\t\\tstd::cerr << \\\"\\\\b\\\\b]\\\\n\\\"; \\\\\\n\\t} while(0)\\n#define dump(x) \\\\\\n\\tdo { \\\\\\n\\t\\tstd::cerr << __LINE__ << \\\" \\\" << #x << \\\" : \\\"; \\\\\\n\\t\\tviewer::view(x); \\\\\\n\\t\\tstd::cerr << '\\\\n'; \\\\\\n\\t} while(0)\\n\\n#else\\n#define debug(...) (void(0))\\n#define dump(x) (void(0))\\n#endif\\n\\n#pragma endregion\\n\\n#pragma region geometry\\n\\nusing Real = long double; //時間がかかる割にdoubleと大差ない\\nusing Point = complex<Real>;\\nconst Real EPS = 1e-10, /*1e-8はたまに落ちる*/ PI = acos(-1);\\n\\ninline bool eq(Real a, Real b) { return fabs(b - a) < EPS; } //誤差無視の等式\\n\\n//実スカラー倍\\nPoint operator*(const Point &p, const Real &d) { return Point(real(p) * d, imag(p) * d); }\\n\\n// point入力受け取り\\nistream &operator>>(istream &is, Point &p) {\\n\\tReal a, b;\\n\\tis >> a >> b;\\n\\tp = Point(a, b);\\n\\treturn is;\\n}\\n// point出力\\nostream &operator<<(ostream &os, Point &p) { return os << fixed << setprecision(10) << p.real() << \\\" \\\" << p.imag(); }\\n\\n// 点 p を反時計回りに theta 回転\\nPoint rotate(Real theta, const Point &p) {\\n\\treturn Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\\n}\\n\\nReal radian_to_degree(Real r) { return (r * 180.0 / PI); }\\n\\nReal degree_to_radian(Real d) { return (d * PI / 180.0); }\\n\\n// a-b-c の角度のうち小さい方を返す\\nReal get_angle(const Point &a, const Point &b, const Point &c) {\\n\\tconst Point v(a - b), /* もとはv(b-a)になってたので修正 */ w(c - b);\\n\\tReal alpha = atan2(v.imag(), v.real()), beta = atan2(w.imag(), w.real());\\n\\tif(alpha > beta) swap(alpha, beta);\\n\\tReal theta = (beta - alpha);\\n\\treturn min(theta, 2 * acos(-1) - theta);\\n}\\n\\nnamespace std {\\nbool operator<(const Point &a, const Point &b) { return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag(); }\\n} // namespace std\\n\\nstruct Line {\\n\\tPoint a, b;\\n\\n\\tLine() = default;\\n\\n\\tLine(Point a, Point b) : a(a), b(b) {}\\n\\n\\tLine(Real A, Real B, Real C) // Ax + By = C\\n\\t{\\n\\t\\tif(eq(A, 0))\\n\\t\\t\\ta = Point(0, C / B), b = Point(1, C / B);\\n\\t\\telse if(eq(B, 0))\\n\\t\\t\\tb = Point(C / A, 0), b = Point(C / A, 1);\\n\\t\\telse\\n\\t\\t\\ta = Point(0, C / B), b = Point(C / A, 0);\\n\\t}\\n\\n\\tfriend ostream &operator<<(ostream &os, Line &p) { return os << p.a << \\\" to \\\" << p.b; }\\n\\n\\tfriend istream &operator>>(istream &is, Line &a) { return is >> a.a >> a.b; }\\n};\\n\\nstruct Segment : Line {\\n\\tSegment() = default;\\n\\n\\tSegment(Point a, Point b) : Line(a, b) {}\\n};\\n\\nstruct Circle {\\n\\tPoint p;\\n\\tReal r;\\n\\n\\tCircle() = default;\\n\\n\\tCircle(Point p, Real r) : p(p), r(r) {}\\n};\\n\\nusing Points = vector<Point>;\\nusing Polygon = vector<Point>;\\nusing Segments = vector<Segment>;\\nusing Lines = vector<Line>;\\nusing Circles = vector<Circle>;\\n\\n//外積\\nReal cross(const Point &a, const Point &b) { return real(a) * imag(b) - imag(a) * real(b); }\\n//内積\\nReal dot(const Point &a, const Point &b) { return real(a) * real(b) + imag(a) * imag(b); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\\n// 点の回転方向\\nint ccw(const Point &a, Point b, Point c) {\\n\\tb = b - a, c = c - a;\\n\\tif(cross(b, c) > EPS) return +1; // \\\"COUNTER_CLOCKWISE\\\"\\n\\tif(cross(b, c) < -EPS) return -1; // \\\"CLOCKWISE\\\"\\n\\tif(dot(b, c) < 0) return +2;\\t // \\\"ONLINE_BACK\\\"\\n\\tif(norm(b) < norm(c)) return -2; // \\\"ONLINE_FRONT\\\"\\n\\treturn 0;\\t\\t\\t\\t\\t\\t // \\\"ON_SEGMENT\\\"\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\n// 平行判定\\nbool parallel(const Line &a, const Line &b) { return eq(cross(a.b - a.a, b.b - b.a), 0.0); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\n// 垂直判定\\nbool orthogonal(const Line &a, const Line &b) { return eq(dot(a.a - a.b, b.a - b.b), 0.0); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\\n// 射影\\n// 直線 l に p から垂線を引いた交点を求める\\nPoint projection(const Line &l, const Point &p) {\\n\\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + (l.a - l.b) * t;\\n}\\n\\nPoint projection(const Segment &l, const Point &p) {\\n\\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + (l.a - l.b) * t;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\\n// 反射\\n// 直線 l を対称軸として点 p と線対称にある点を求める\\nPoint reflection(const Line &l, const Point &p) { return p + (projection(l, p) - p) * 2.0; }\\n\\nbool intersect(const Line &l, const Point &p) { return abs(ccw(l.a, l.b, p)) != 1; }\\n\\nbool intersect(const Line &l, const Line &m) { return abs(cross(l.b - l.a, m.b - m.a)) > EPS || abs(cross(l.b - l.a, m.b - l.a)) < EPS; }\\n\\nbool intersect(const Segment &s, const Point &p) { return ccw(s.a, s.b, p) == 0; }\\n\\nbool intersect(const Line &l, const Segment &s) { return cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < EPS; }\\n\\nReal distance(const Line &l, const Point &p);\\n\\nbool intersect(const Circle &c, const Line &l) { return distance(l, c.p) <= c.r + EPS; }\\n\\nbool intersect(const Circle &c, const Point &p) { return abs(abs(p - c.p) - c.r) < EPS; }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\\n// 線分同士の交差判定 (端点が他方の線分上にあるならば交差とみなす)\\nbool intersect(const Segment &s, const Segment &t) {\\n\\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 && ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\\n}\\n\\nint intersect(const Circle &c, const Segment &l) {\\n\\tif(norm(projection(l, c.p) - c.p) - c.r * c.r > EPS) return 0;\\n\\tauto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\\n\\tif(d1 < c.r + EPS && d2 < c.r + EPS) return 0;\\n\\tif(d1 < c.r - EPS && d2 > c.r + EPS || d1 > c.r + EPS && d2 < c.r - EPS) return 1;\\n\\tconst Point h = projection(l, c.p);\\n\\tif(dot(l.a - h, l.b - h) < 0) return 2;\\n\\treturn 0;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A&lang=jp\\nint intersect(Circle c1, Circle c2) {\\n\\tif(c1.r < c2.r) swap(c1, c2);\\n\\tReal d = abs(c1.p - c2.p);\\n\\tif(c1.r + c2.r < d) return 4;\\t // 外に離れている\\n\\tif(eq(c1.r + c2.r, d)) return 3; // 外接\\n\\tif(c1.r - c2.r < d) return 2;\\t // 交差\\n\\tif(eq(c1.r - c2.r, d)) return 1; // 内接\\n\\treturn 0;\\t\\t\\t\\t\\t\\t // 内包\\n}\\n\\nReal distance(const Point &a, const Point &b) { return abs(a - b); }\\n\\nReal distance(const Line &l, const Point &p) { return abs(p - projection(l, p)); }\\n\\nReal distance(const Line &l, const Line &m) { return intersect(l, m) ? 0 : distance(l, m.a); }\\n\\nReal distance(const Segment &s, const Point &p) {\\n\\tPoint r = projection(s, p);\\n\\tif(intersect(s, r)) return abs(r - p);\\n\\treturn min(abs(s.a - p), abs(s.b - p));\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_D\\nReal distance(const Segment &a, const Segment &b) {\\n\\tif(intersect(a, b)) return 0;\\n\\treturn min({distance(a, b.a), distance(a, b.b), distance(b, a.a), distance(b, a.b)});\\n}\\n\\nReal distance(const Line &l, const Segment &s) {\\n\\tif(intersect(l, s)) return 0;\\n\\treturn min(distance(l, s.a), distance(l, s.b));\\n}\\n\\nPoint crosspoint(const Line &l, const Line &m) {\\n\\tReal A = cross(l.b - l.a, m.b - m.a);\\n\\tReal B = cross(l.b - l.a, l.b - m.a);\\n\\tif(eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\\n\\treturn m.a + (m.b - m.a) * B / A;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_C\\nPoint crosspoint(const Segment &l, const Segment &m) { return crosspoint(Line(l), Line(m)); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\\npair<Point, Point> crosspoint(const Circle &c, const Line l) {\\n\\tPoint pr = projection(l, c.p);\\n\\tPoint e = (l.b - l.a) / abs(l.b - l.a);\\n\\tif(eq(distance(l, c.p), c.r)) return {pr, pr};\\n\\tdouble base = sqrt(c.r * c.r - norm(pr - c.p));\\n\\treturn {pr - e * base, pr + e * base};\\n}\\n\\npair<Point, Point> crosspoint(const Circle &c, const Segment &l) {\\n\\tLine aa = Line(l.a, l.b);\\n\\tif(intersect(c, l) == 2) return crosspoint(c, aa);\\n\\tauto ret = crosspoint(c, aa);\\n\\tif(dot(l.a - ret.first, l.b - ret.first) < 0)\\n\\t\\tret.second = ret.first;\\n\\telse\\n\\t\\tret.first = ret.second;\\n\\treturn ret;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\\npair<Point, Point> crosspoint(const Circle &c1, const Circle &c2) {\\n\\tReal d = abs(c1.p - c2.p);\\n\\tReal a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d)); // 余弦定理\\n\\tReal t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\\n\\tPoint p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\\n\\tPoint p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\\n\\treturn {p1, p2};\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F\\n// \\\"点 p を通る円 c の接線\\\"の接点2つ\\npair<Point, Point> tangent(const Circle &c1, const Point &p2) { return crosspoint(c1, Circle(p2, sqrt(norm(c1.p - p2) - c1.r * c1.r))); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_G\\n// 円 c1, c2 の共通接線\\nLines tangent(Circle c1, Circle c2) {\\n\\tLines ret;\\n\\tif(c1.r < c2.r) swap(c1, c2);\\n\\tReal g = norm(c1.p - c2.p);\\n\\tif(eq(g, 0)) return ret;\\n\\tPoint u = (c2.p - c1.p) / sqrt(g);\\n\\tPoint v = rotate(PI * 0.5, u);\\n\\tfor(int s : {-1, 1}) {\\n\\t\\tReal h = (c1.r + s * c2.r) / sqrt(g);\\n\\t\\tif(eq(1 - h * h, 0)) {\\n\\t\\t\\tret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\\n\\t\\t} else if(1 - h * h > 0) {\\n\\t\\t\\tPoint uu = u * h, vv = v * sqrt(1 - h * h);\\n\\t\\t\\tret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\\n\\t\\t\\tret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_B\\n// 凸性判定 (反時計回り)\\nbool is_convex(const Polygon &p) {\\n\\tint n = (int)p.size();\\n\\tfor(int i = 0; i < n; i++) {\\n\\t\\tif(ccw(p[(i + n - 1) % n], p[i], p[(i + 1) % n]) == -1) return false;\\n\\t}\\n\\treturn true;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_A\\n// 凸包\\nPolygon convex_hull(Polygon &p) {\\n\\tint n = (int)p.size(), k = 0;\\n\\tif(n <= 2) return p;\\n\\tsort(p.begin(), p.end()); // x -> yの順にソート\\n\\tvector<Point> ch(2 * n);\\n\\tfor(int i = 0; i < n; ch[k++] = p[i++]) { //下半分を構成\\n\\t\\twhile(k >= 2 && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < EPS) --k;\\n\\t}\\n\\tfor(int i = n - 2, t = k + 1; i >= 0; ch[k++] = p[i--]) { //上半分を構成\\n\\t\\twhile(k >= t && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < EPS) --k;\\n\\t}\\n\\tch.resize(k - 1);\\n\\treturn ch;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_C\\n// 多角形と点の包含判定\\nenum { OUT, ON, IN };\\n\\nint contains(const Polygon &Q, const Point &p) {\\n\\tbool in = false;\\n\\tfor(int i = 0; i < Q.size(); i++) {\\n\\t\\tPoint a = Q[i] - p, b = Q[(i + 1) % Q.size()] - p;\\n\\t\\tif(a.imag() > b.imag()) swap(a, b);\\n\\t\\tif(a.imag() <= 0 && 0 < b.imag() && cross(a, b) < 0) in = !in;\\n\\t\\tif(cross(a, b) == 0 && dot(a, b) <= 0) return ON;\\n\\t}\\n\\treturn in ? IN : OUT;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_H\\n// 円と多角形の共通部分の面積\\nReal area(const Polygon &p, const Circle &c) {\\n\\tif(p.size() < 3) return 0.0;\\n\\tfunction<Real(Circle, Point, Point)> cross_area = [&](const Circle &c, const Point &a, const Point &b) {\\n\\t\\tPoint va = c.p - a, vb = c.p - b;\\n\\t\\tReal f = cross(va, vb), ret = 0.0;\\n\\t\\tif(eq(f, 0.0)) return ret;\\n\\t\\tif(max(abs(va), abs(vb)) < c.r + EPS) return f;\\n\\t\\tif(distance(Segment(a, b), c.p) > c.r - EPS) return c.r * c.r * arg(vb * conj(va));\\t // 0.5倍してなくない？\\n\\t\\tauto u = crosspoint(c, Segment(a, b));\\n\\t\\tvector<Point> tot{a, u.first, u.second, b};\\n\\t\\tfor(int i = 0; i + 1 < tot.size(); i++) {\\n\\t\\t\\tret += cross_area(c, tot[i], tot[i + 1]);\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t};\\n\\tReal A = 0;\\n\\tfor(int i = 0; i < p.size(); i++) {\\n\\t\\tA += cross_area(c, p[i], p[(i + 1) % p.size()]);\\n\\t}\\n\\treturn A * 0.5;\\t // 0.5倍が抜けていたので修正;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_B\\n// 凸多角形の直径(最遠頂点対間距離)\\nReal convex_diameter(const Polygon &p) {\\n\\tint N = (int)p.size();\\n\\tint is = 0, js = 0;\\n\\tfor(int i = 1; i < N; i++) {\\n\\t\\tif(p[i].imag() > p[is].imag()) is = i;\\n\\t\\tif(p[i].imag() < p[js].imag()) js = i;\\n\\t}\\n\\tReal maxdis = norm(p[is] - p[js]);\\n\\n\\tint maxi, maxj, i, j;\\n\\ti = maxi = is;\\n\\tj = maxj = js;\\n\\tdo {\\n\\t\\tif(cross(p[(i + 1) % N] - p[i], p[(j + 1) % N] - p[j]) >= 0) {\\n\\t\\t\\tj = (j + 1) % N;\\n\\t\\t} else {\\n\\t\\t\\ti = (i + 1) % N;\\n\\t\\t}\\n\\t\\tif(norm(p[i] - p[j]) > maxdis) {\\n\\t\\t\\tmaxdis = norm(p[i] - p[j]);\\n\\t\\t\\tmaxi = i;\\n\\t\\t\\tmaxj = j;\\n\\t\\t}\\n\\t} while(i != is || j != js);\\n\\treturn sqrt(maxdis);\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_5_A\\n// 最近点対\\nReal closest_pair(Points ps) {\\n\\tif(ps.size() <= 1) throw(0);\\n\\tsort(begin(ps), end(ps)); // xでソート\\n\\n\\tauto compare_y = [&](const Point &a, const Point &b) { return imag(a) < imag(b); };\\n\\tvector<Point> beet(ps.size());\\n\\tconst Real INF = 1e18;\\n\\n\\tfunction<Real(int, int)> rec = [&](int left, int right) {\\n\\t\\tif(right - left <= 1) return INF;\\n\\t\\tint mid = (left + right) >> 1;\\n\\t\\tauto x = real(ps[mid]);\\t // 領域内でx座標真中の点\\n\\t\\tauto ret = min(rec(left, mid), rec(mid, right));\\n\\t\\t// y座標でソートされた2つの区間をマージ\\n\\t\\tinplace_merge(begin(ps) + left, begin(ps) + mid, begin(ps) + right, compare_y);\\n\\t\\tint ptr = 0;\\n\\t\\tfor(int i = left; i < right; i++) {\\n\\t\\t\\tif(abs(real(ps[i]) - x) >= ret) continue;\\n\\t\\t\\tfor(int j = 0; j < ptr; j++) {\\n\\t\\t\\t\\tauto luz = ps[i] - beet[ptr - j - 1];\\n\\t\\t\\t\\tif(imag(luz) >= ret) break;\\n\\t\\t\\t\\tret = min(ret, abs(luz));\\n\\t\\t\\t}\\n\\t\\t\\tbeet[ptr++] = ps[i];\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t};\\n\\treturn rec(0, (int)ps.size());\\n}\\n\\n// (aからの距離):(bからの距離) = dist_a : dist_b となる点の集合(円)を返す\\nCircle Apollonius_Circle(Point a, Point b, Real dist_a, Real dist_b) {\\n\\tassert(!eq(dist_a, dist_b)); //同じ場合はbisectionで\\n\\tReal asq = dist_a * dist_a, bsq = dist_b * dist_b;\\n\\tPoint p = (a * bsq - b * asq) * (1 / (bsq - asq));\\n\\tReal r = abs(a - b) * dist_a * dist_b / abs(asq - bsq);\\n\\treturn Circle(p, r);\\n}\\n\\n// 二等分線\\nLine bisection(Point a, Point b) {\\n\\ta = (a + b) * 0.5;\\n\\tb = rotate(PI / 2, b - a) + a;\\n\\treturn Line(a, b);\\n}\\n\\n#pragma endregion\\n\\nvoid solve() {\\n\\tINT(n, m);\\n\\tif(n + m == 0) exit(0);\\n\\n\\tCircles c;\\n\\trep(n) {\\n\\t\\tReal x, y, r;\\n\\t\\tcin >> x >> y >> r;\\n\\t\\tc.emplace_back(Point(x, y), r);\\n\\t}\\n\\n\\tVV<pair<Real, int>> g(n, V<pair<Real, int>>(n, pair(-1., 0)));\\n\\n\\trep(i, n) rep(j, n) {\\n\\t\\tif(i == j) continue;\\n\\t\\tif(intersect(c[i], c[j]) == 2) {\\n\\t\\t\\t// g[i].emplace_back(arg(c[j].p - c[i].p), j);\\n\\t\\t\\tg[i][j] = pair(arg(c[j].p - c[i].p), 1);\\n\\t\\t}\\n\\t}\\n\\n\\n\\tvector<vector<int>> convexes;\\n\\tvi visited(n);\\n\\trep(first, n) {\\n\\t\\twhile(1) {\\n\\t\\t\\tbool b = true;\\n\\t\\t\\tvi cycle;\\n\\t\\t\\tReal direction = 0.;\\n\\t\\t\\tint now = first;\\n\\n\\t\\t\\tdo {\\n\\t\\t\\t\\tint nxt = -1;\\n\\t\\t\\t\\tReal angle = -INF;\\n\\t\\t\\t\\tauto nxt_dir = direction;\\n\\t\\t\\t\\trep(j, n) {\\n\\t\\t\\t\\t\\tif(g[now][j].second == 0) continue;\\n\\t\\t\\t\\t\\tReal diff = g[now][j].first - direction;\\n\\t\\t\\t\\t\\twhile(diff < -pi + EPS * 2) diff += pi * 2;\\n\\t\\t\\t\\t\\twhile(diff >= pi - EPS) diff -= pi * 2;\\n\\n\\t\\t\\t\\t\\tif(chmax(angle, diff)) {\\n\\t\\t\\t\\t\\t\\tnxt = j;\\n\\t\\t\\t\\t\\t\\tnxt_dir = g[now][j].first;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(nxt == -1) {\\n\\t\\t\\t\\t\\tb = false;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tg[now][nxt].second = 0;\\n\\t\\t\\t\\tdirection = nxt_dir;\\n\\t\\t\\t\\tnow = nxt;\\n\\t\\t\\t\\tcycle.push_back(nxt);\\n\\t\\t\\t} while(now != first);\\n\\t\\t\\tif(!b) break;\\n\\t\\t\\tconvexes.push_back(cycle);\\n\\t\\t}\\n\\t}\\n\\t// int cs = convexes.size();\\n\\n\\tV<Polygon> plgns;\\n\\n\\tfoa(cvx, convexes) {\\n\\t\\tPolygon plgn;\\n\\t\\tfoa(ver, cvx) plgn.push_back(c[ver].p);\\n\\t\\tplgns.push_back(plgn);\\n\\t}\\n\\n\\trep(loop, m) {\\n\\t\\tPoint pee, kyu;\\t // P, Q\\n\\t\\t// Real x, y;\\n\\t\\t// cin >> x >> y;\\n\\t\\t// pee.emplace_back(x, y);\\n\\t\\t// cin >> x >> y;\\n\\t\\t// kyu.emplace_back(x, y);\\n\\t\\tcin >> pee >> kyu;\\n\\n\\t\\tvector<int> pee_in;\\n\\t\\tvector<int> kyu_in;\\n\\n\\t\\trep(i, n) {\\n\\t\\t\\tif(distance(c[i].p, pee) < c[i].r) {\\n\\t\\t\\t\\tpee_in.push_back(i);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\trep(i, n) {\\n\\t\\t\\tif(distance(c[i].p, kyu) < c[i].r) {\\n\\t\\t\\t\\tkyu_in.push_back(i);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(!pee_in.empty()) {\\n\\t\\t\\tcout << (pee_in == kyu_in ? \\\"YES\\\" : \\\"NO\\\") << (loop == m - 1 ? '\\\\n' : ' ');\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\n\\t\\trep(i, plgns.size()) {\\n\\t\\t\\t// foa(plgn, plgns) {\\n\\t\\t\\tauto plgn = plgns[i];\\n\\t\\t\\tif(contains(plgn, pee) == IN) {\\n\\t\\t\\t\\tpee_in.push_back(i);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\trep(i, plgns.size()) {\\n\\t\\t\\t// foa(plgn, plgns) {\\n\\t\\t\\tauto plgn = plgns[i];\\n\\t\\t\\tif(contains(plgn, kyu) == IN) {\\n\\t\\t\\t\\tkyu_in.push_back(i);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tcout << (pee_in == kyu_in ? \\\"YES\\\" : \\\"NO\\\") << (loop == m - 1 ? '\\\\n' : ' ');\\n\\t}\\n\\n\\tdebug(convexes);\\n\\treturn;\\n}\\nint main() {\\n\\tstd::ios::sync_with_stdio(false);\\n\\tstd::cin.tie(nullptr);\\n\\tstd::cout << std::fixed << std::setprecision(15);\\n\\tsrand((unsigned)time(NULL));\\n\\n\\twhile(1) solve();\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 4008,\n \"score_of_the_acc\": -0.1493,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1198_4326322\",\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 FOR(i,m,n) for(int i=(m);i<(n);i++)\\n#define REPR(i,n) for(int i=(n)-1;i>=0;i--)\\nconst bool DEBUG = false;\\nconst double EPS = 1e-8;\\ntypedef complex<double>point;\\npoint operator*(const point &p, const double &d) {\\n\\treturn point(real(p)*d, imag(p)*d);\\n}\\nnamespace std {\\n\\tbool operator<(const point &a, const point &b) {\\n\\t\\treturn real(a) != real(b) ? real(a)<real(b) : imag(a)<imag(b);\\n\\t}\\n}\\ndouble dist(const point &a, const point &b) {\\n\\treturn abs(a - b);\\n}\\nstruct Line :public vector<point> {\\n\\tLine(const point &a, const point &b) {\\n\\t\\tpush_back(a); push_back(b);\\n\\t}\\n};\\ntypedef vector<Line> Lines;\\ndouble cross(const point &a, const point &b) {\\n\\treturn real(a)*imag(b) - imag(a)*real(b);\\n}\\ndouble dot(const point &a, const point &b) {\\n\\treturn real(a)*real(b) + imag(a)*imag(b);\\n}\\nint ccw(point a, point b, point c) {\\n\\tb = b - a, c = c - a;\\n\\tif (cross(b, c)>EPS)return +1;\\n\\tif (cross(b, c)<-EPS)return -1;\\n\\tif (dot(b, c)<-EPS)return +2;\\n\\tif (norm(b)<norm(c))return -2;\\n\\treturn 0;\\n}\\n\\nbool intersectSP(const Line &s, const point &p) {\\n\\treturn abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0])<EPS;\\n}\\nbool isSamePoint(const point &p1, const point &p2) {\\n\\treturn p1==p2||abs(p1 - p2)<=EPS;\\n}\\nbool intersectSS(const Line &s, const Line &t) {\\n\\treturn ccw(s[0], s[1], t[0])*ccw(s[0], s[1], t[1]) <= 0 &&\\n\\t\\tccw(t[0], t[1], s[0])*ccw(t[0], t[1], s[1]) <= 0;\\n}\\nbool connectSS(const Line &s, const Line &t) {\\n\\tREP(i, 2)REP(j, 2) {\\n\\t\\tif (isSamePoint(s[i], t[j]))return true;\\n\\t\\t//if (s[i] == t[j])return true;\\n\\t}\\n\\treturn false;\\n}\\npoint crosspoint(const Line &l, const Line &m) {\\n\\tdouble A = cross(l[1] - l[0], m[1] - m[0]);\\n\\tdouble B = cross(l[1] - l[0], l[1] - m[0]);\\n\\tif (abs(A)<EPS&&abs(B)<EPS)return m[0];\\n\\tif (abs(A)<EPS)assert(false);\\n\\treturn m[0] + B / A * (m[1] - m[0]);\\n}\\nstruct Circle {\\n\\tpoint c; double r;\\n\\tint id;\\n\\tCircle(const point &c_, double r_, int id_) :c(c_), r(r_), id(id_) {}\\n\\tbool contains(const point &p) {\\n\\t\\tif (dist(c, p)<r + EPS)return true;\\n\\t\\telse return false;\\n\\t}\\n};\\n\\nstruct Polygon :public vector<point> {\\n\\t//0->OUT,1->ON,2->IN\\n\\tint contains(const point &p) {\\n\\t\\tbool in = false;\\n\\t\\tint N = this->size();\\n\\t\\tfor (int i = 0; i<N; i++) {\\n\\t\\t\\tpoint a = this->at(i) - p;\\n\\t\\t\\tpoint b = this->at((i + 1) % N) - p;\\n\\t\\t\\tif (imag(a)>imag(b))std::swap(a, b);\\n\\t\\t\\tif (imag(a) <= 0 && 0<imag(b))if (cross(a, b)<0)in = !in;\\n\\t\\t\\tif (cross(a, b) == 0 && dot(a, b) <= 0)return 1;\\n\\t\\t}\\n\\t\\treturn in ? 2 : 0;\\n\\t}\\n\\tvoid print() {\\n\\t\\tif (DEBUG) {\\n\\t\\t\\tcerr << \\\"number of points:\\\" << this->size() << endl;\\n for(int i=0;i<(int)this->size();i++){\\n\\t\\t\\t\\tcerr << i + 1 << \\\":\\\" << this->at(i) << endl;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t}\\n};\\ntypedef vector<Circle> Circles;\\nset<int> get_enclosing_circle(const point &p, const Circles &Cs) {\\n\\tset<int> ret;\\n\\tfor (auto c : Cs) {\\n\\t\\tif (c.contains(p))ret.insert(c.id);\\n\\t}\\n\\treturn ret;\\n}\\n\\nstruct Equiv {\\n\\tvector<int>links;\\n\\tEquiv(int n) :links(n) {\\n\\t\\tREP(i, n)links[i] = i;\\n\\t}\\n\\tint find(int x) {\\n\\t\\tint xx = links[x];\\n\\t\\tif (xx == x)return x;\\n\\t\\treturn links[x] = find(xx);\\n\\t}\\n\\tvoid unify(int x, int y) {\\n\\t\\tint xx = find(x), yy = find(y);\\n\\t\\tif (xx <= yy)links[yy] = xx;\\n\\t\\telse links[xx] = yy;\\n\\t}\\n};\\ntypedef vector<Lines> vLines;\\nvLines connectedComponent(const Lines &ls) {\\n\\tvLines ret;\\n\\tEquiv equiv(ls.size());\\n\\tREP(i, (int)ls.size()) {\\n\\t\\tREP(j, i) {\\n\\t\\t\\tif (connectSS(ls[i], ls[j])) {\\n\\t\\t\\t\\tequiv.unify(i, j);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tREP(i, (int)ls.size()) {\\n\\t\\tif (equiv.find(i) == i) {\\n\\t\\t\\tLines newLs;\\n\\t\\t\\tnewLs.push_back(ls[i]);\\n\\t\\t\\tFOR(j, i + 1, (int)ls.size()) {\\n\\t\\t\\t\\tif (equiv.find(j) == i)newLs.push_back(ls[j]);\\n\\t\\t\\t}\\n\\t\\t\\tret.push_back(newLs);\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\ntypedef pair<double, point>doublePoint;\\ntypedef vector<doublePoint>vDoublePoint;\\ntypedef map<point, vDoublePoint>adjPoint;\\ntypedef vector<point>Points;\\n\\npoint findNext(const vDoublePoint &vdp, const point &p) {\\n\\t//隣接点のリスト(偏角ソート済み)から移動前の点を探してその次\\n\\tint n = vdp.size();\\n\\tREP(i, n) {\\n\\t\\tif (p == vdp[i].second) {\\n\\t\\t\\treturn vdp[(i + 1) % n].second;\\n\\t\\t}\\n\\t}\\n\\treturn vdp[0].second;\\n}\\nbool used[101][101];\\nvoid make_polys(point minPoint, vector<Polygon>&polys,adjPoint &aPoint,map<point, int>&p2id,\\nmap<int, point>&id2p,int id) {\\n\\tPolygon ret;\\n\\tREP(i, id)REP(j, id)used[i][j] = false;\\n\\tret.push_back(minPoint);\\n\\tpoint curP = aPoint[minPoint][0].second;\\n\\tused[p2id[minPoint]][p2id[curP]] = true;\\n\\tpoint lastP = minPoint;\\n\\twhile (curP != minPoint) {\\n\\t\\tret.push_back(curP);\\n\\t\\tpoint nextP = findNext(aPoint[curP], lastP);\\n\\t\\tused[p2id[curP]][p2id[nextP]] = true;\\n\\t\\tlastP = curP;\\n\\t\\tcurP = nextP;\\n\\t}\\n\\n\\t\\n\\tpolys.push_back(ret);\\n\\n bool all_used=false;\\n\\twhile (!all_used) {\\n all_used=true;\\n\\t\\tbool found = false;\\n\\t\\tpoint st, nx;\\n st={1e9,1e9};\\n\\t\\tREP(i, id) {\\n if(found)break;\\n\\t\\t\\tfor (auto nxt : aPoint[id2p[i]]) {\\n\\t\\t\\t\\tif (!used[i][p2id[nxt.second]]) {\\n all_used=false;\\n\\t\\t\\t\\t\\tfound = true;\\n if(id2p[i]<st){\\n st=id2p[i];\\n nx=nxt.second;\\n }\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n if(all_used)break;\\n\\t\\tPolygon res;\\n\\t\\tres.push_back(st);\\n\\t\\tres.push_back(nx);\\n\\t\\tused[p2id[st]][p2id[nx]] = true;\\n\\t\\tpoint cur = nx;\\n\\t\\tpoint las = st;\\n\\t\\twhile (cur != st) {\\n\\t\\t\\tvDoublePoint v = aPoint[cur];\\n\\t\\t\\tint n = v.size();\\n\\t\\t\\tint s_idx = -1;\\n\\t\\t\\tbool found = false;\\n\\t\\t\\tREP(i, n) {\\n\\t\\t\\t\\tif (isSamePoint(v[i].second,las)) {\\n\\t\\t\\t\\t\\ts_idx = i; break;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n if(s_idx<0){\\n cerr<<cur<<endl;\\n cerr<<las<<endl;\\n }\\n assert(s_idx>=0);\\n\\t\\t\\tfor (int i = s_idx + 1; i < s_idx + n + 1; i++) {\\n\\t\\t\\t\\tint idx = i % n;\\n\\t\\t\\t\\tif (v[idx].second == cur)continue;\\n\\t\\t\\t\\tint cur_id = p2id[cur];\\n\\t\\t\\t\\tint nxt_id = p2id[v[idx].second];\\n\\t\\t\\t\\tif (!used[cur_id][nxt_id]) {\\n\\t\\t\\t\\t\\tfound = true;\\n\\t\\t\\t\\t\\tlas = cur;\\n\\t\\t\\t\\t\\tcur = v[idx].second;\\n\\t\\t\\t\\t\\tused[cur_id][nxt_id] = true;\\n\\t\\t\\t\\t\\tres.push_back(cur);\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t//if(!found)break;\\n\\t\\t\\tif (cur == st)break;\\n\\t\\t\\tif (!found)goto END2;\\n\\t\\t}\\n\\t\\tpolys.push_back(res);\\n\\tEND2:;\\n\\t}\\n\\n}\\nvector<Polygon> trace(const Lines &ls) {\\n\\t//隣接点(偏角付き)のリストを作成\\n\\tmap<point, vDoublePoint> aPoint;\\n\\t//頂点に番号を付けて辺の使用を記録\\n\\tmap<point, int>p2id;\\n\\tmap<int, point>id2p;\\n\\tint id = 0;\\n\\n\\tREP(i, (int)ls.size()) {\\n\\t\\tif (!p2id.count(ls[i][0])) {\\n\\t\\t\\tp2id[ls[i][0]] = id;\\n\\t\\t\\tid2p[id] = ls[i][0];\\n\\t\\t\\tid++;\\n\\t\\t}\\n\\t\\tif (!p2id.count(ls[i][1])) {\\n\\t\\t\\tp2id[ls[i][1]] = id;\\n\\t\\t\\tid2p[id] = ls[i][1];\\n\\t\\t\\tid++;\\n\\t\\t}\\n\\t\\taPoint[ls[i][0]].push_back(doublePoint(arg(ls[i][1] - ls[i][0]), ls[i][1]));\\n\\t\\taPoint[ls[i][1]].push_back(doublePoint(arg(ls[i][0] - ls[i][1]), ls[i][0]));\\n\\t}\\n\\tvector<point>minPoints;\\n REP(i,id)REP(j,id)used[i][j]=false;\\n\\t//x座標最小の点の計算と隣接点リストのソート\\n\\tpoint minPoint(INT_MAX, INT_MAX);\\n\\tadjPoint::iterator it;\\n\\tfor (it = aPoint.begin(); it != aPoint.end(); ++it) {\\n\\t\\tpoint p = it->first;\\n\\t\\tminPoints.push_back(p);\\n\\t\\tminPoint = min(minPoint, p);\\n\\t\\tvDoublePoint &vdp = it->second;\\n\\t\\tsort(vdp.begin(), vdp.end());\\n\\t}\\n\\tvector<Polygon>polys;\\n\\tmake_polys(minPoint, polys, aPoint, p2id, id2p, id);\\n\\treturn polys;\\n}\\nbool intersectCC(const Circle &a, const Circle &b) {\\n\\tdouble d = dist(a.c, b.c);\\n\\treturn abs(a.r - b.r)<d + EPS && d - EPS<a.r + b.r;\\n}\\nbool unuse[101];\\nbool canConnect(point p, point q, const Circles &circles) {\\n\\tset<int> p_enclose = get_enclosing_circle(p, circles);\\n\\tset<int> q_enclose = get_enclosing_circle(q, circles);\\n\\tif (p_enclose.size()>2) {\\n\\t\\tcout << p << endl;\\n\\t\\tfor (auto id : p_enclose) {\\n\\t\\t\\tcout << circles[id].c << \\\" \\\" << circles[id].r << endl;\\n\\t\\t}\\n\\t}\\n\\tassert(p_enclose.size() <= 2);\\n\\tassert(q_enclose.size() <= 2);\\n\\tif (p_enclose != q_enclose) {\\n\\t\\treturn false;\\n\\t}\\n REP(i,100)unuse[i]=false;\\n\\tfor (auto id : p_enclose) {\\n\\t\\tunuse[id] = true;\\n\\t}\\n\\tint n = circles.size();\\n\\tvector<Line>segments;\\n\\tREP(i, n) {\\n\\t\\tif (unuse[i])continue;\\n\\t\\tFOR(j, i, n) {\\n\\t\\t\\tif (i == j)continue;\\n\\t\\t\\tif (unuse[j])continue;\\n\\t\\t\\tif (intersectCC(circles[i], circles[j])) {\\n\\t\\t\\t\\tsegments.push_back(Line(circles[i].c, circles[j].c));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tvLines cc = connectedComponent(segments);\\n\\tfor (auto ls : cc) {\\n\\t\\tif (ls.size() <= 2)continue;\\n\\t\\tvector<Polygon>polys = trace(ls);\\n\\t\\tfor (auto poly : polys) {\\n\\t\\t\\tif (poly.contains(p) != poly.contains(q))return false;\\n\\t\\t}\\n\\t}\\n\\n\\treturn true;\\n}\\n\\nvoid solve() {\\n\\tint N, M; cin >> N >> M;\\n\\t//cerr << N << \\\" \\\" << M << endl;\\n\\tif (N == 0)exit(0);\\n\\tCircles circles;\\n\\tREP(i, N) {\\n\\t\\tunuse[i] = false;\\n\\t\\tdouble x, y, r; cin >> x >> y >> r;\\n\\t\\tpoint c(x, y);\\n\\t\\tcircles.push_back({ c,r ,i });\\n\\t}\\n\\twhile (M--) {\\n\\t\\tdouble x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2;\\n\\t\\tpoint p(x1, y1), q(x2, y2);\\n\\t\\tif (canConnect(p, q, circles))cout << \\\"YES\\\";\\n\\t\\telse cout << \\\"NO\\\";\\n\\t\\tif (M)cout << \\\" \\\";\\n\\t\\telse cout << endl;\\n\\t}\\n}\\nsigned main() {\\n\\twhile (true)solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 3580,\n \"score_of_the_acc\": -0.1248,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1198_4326321\",\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 FOR(i,m,n) for(int i=(m);i<(n);i++)\\n#define REPR(i,n) for(int i=(n)-1;i>=0;i--)\\nconst bool DEBUG = false;\\nconst double EPS = 1e-8;\\ntypedef complex<double>point;\\npoint operator*(const point &p, const double &d) {\\n\\treturn point(real(p)*d, imag(p)*d);\\n}\\nnamespace std {\\n\\tbool operator<(const point &a, const point &b) {\\n\\t\\treturn real(a) != real(b) ? real(a)<real(b) : imag(a)<imag(b);\\n\\t}\\n}\\ndouble dist(const point &a, const point &b) {\\n\\treturn abs(a - b);\\n}\\nstruct Line :public vector<point> {\\n\\tLine(const point &a, const point &b) {\\n\\t\\tpush_back(a); push_back(b);\\n\\t}\\n};\\ntypedef vector<Line> Lines;\\ndouble cross(const point &a, const point &b) {\\n\\treturn real(a)*imag(b) - imag(a)*real(b);\\n}\\ndouble dot(const point &a, const point &b) {\\n\\treturn real(a)*real(b) + imag(a)*imag(b);\\n}\\nint ccw(point a, point b, point c) {\\n\\tb = b - a, c = c - a;\\n\\tif (cross(b, c)>EPS)return +1;\\n\\tif (cross(b, c)<-EPS)return -1;\\n\\tif (dot(b, c)<-EPS)return +2;\\n\\tif (norm(b)<norm(c))return -2;\\n\\treturn 0;\\n}\\n\\nbool intersectSP(const Line &s, const point &p) {\\n\\treturn abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0])<EPS;\\n}\\nbool isSamePoint(const point &p1, const point &p2) {\\n\\treturn p1==p2||abs(p1 - p2)<=EPS;\\n}\\nbool intersectSS(const Line &s, const Line &t) {\\n\\treturn ccw(s[0], s[1], t[0])*ccw(s[0], s[1], t[1]) <= 0 &&\\n\\t\\tccw(t[0], t[1], s[0])*ccw(t[0], t[1], s[1]) <= 0;\\n}\\nbool connectSS(const Line &s, const Line &t) {\\n\\tREP(i, 2)REP(j, 2) {\\n\\t\\tif (isSamePoint(s[i], t[j]))return true;\\n\\t\\t//if (s[i] == t[j])return true;\\n\\t}\\n\\treturn false;\\n}\\npoint crosspoint(const Line &l, const Line &m) {\\n\\tdouble A = cross(l[1] - l[0], m[1] - m[0]);\\n\\tdouble B = cross(l[1] - l[0], l[1] - m[0]);\\n\\tif (abs(A)<EPS&&abs(B)<EPS)return m[0];\\n\\tif (abs(A)<EPS)assert(false);\\n\\treturn m[0] + B / A * (m[1] - m[0]);\\n}\\nstruct Circle {\\n\\tpoint c; double r;\\n\\tint id;\\n\\tCircle(const point &c_, double r_, int id_) :c(c_), r(r_), id(id_) {}\\n\\tbool contains(const point &p) {\\n\\t\\tif (dist(c, p)<r + EPS)return true;\\n\\t\\telse return false;\\n\\t}\\n};\\n\\nstruct Polygon :public vector<point> {\\n\\t//0->OUT,1->ON,2->IN\\n\\tint contains(const point &p) {\\n\\t\\tbool in = false;\\n\\t\\tint N = this->size();\\n\\t\\tfor (int i = 0; i<N; i++) {\\n\\t\\t\\tpoint a = this->at(i) - p;\\n\\t\\t\\tpoint b = this->at((i + 1) % N) - p;\\n\\t\\t\\tif (imag(a)>imag(b))std::swap(a, b);\\n\\t\\t\\tif (imag(a) <= 0 && 0<imag(b))if (cross(a, b)<0)in = !in;\\n\\t\\t\\tif (cross(a, b) == 0 && dot(a, b) <= 0)return 1;\\n\\t\\t}\\n\\t\\treturn in ? 2 : 0;\\n\\t}\\n\\tvoid print() {\\n\\t\\tif (DEBUG) {\\n\\t\\t\\tcerr << \\\"number of points:\\\" << this->size() << endl;\\n for(int i=0;i<(int)this->size();i++){\\n\\t\\t\\t\\tcerr << i + 1 << \\\":\\\" << this->at(i) << endl;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t}\\n};\\ntypedef vector<Circle> Circles;\\nset<int> get_enclosing_circle(const point &p, const Circles &Cs) {\\n\\tset<int> ret;\\n\\tfor (auto c : Cs) {\\n\\t\\tif (c.contains(p))ret.insert(c.id);\\n\\t}\\n\\treturn ret;\\n}\\n\\nstruct Equiv {\\n\\tvector<int>links;\\n\\tEquiv(int n) :links(n) {\\n\\t\\tREP(i, n)links[i] = i;\\n\\t}\\n\\tint find(int x) {\\n\\t\\tint xx = links[x];\\n\\t\\tif (xx == x)return x;\\n\\t\\treturn links[x] = find(xx);\\n\\t}\\n\\tvoid unify(int x, int y) {\\n\\t\\tint xx = find(x), yy = find(y);\\n\\t\\tif (xx <= yy)links[yy] = xx;\\n\\t\\telse links[xx] = yy;\\n\\t}\\n};\\ntypedef vector<Lines> vLines;\\nvLines connectedComponent(const Lines &ls) {\\n\\tvLines ret;\\n\\tEquiv equiv(ls.size());\\n\\tREP(i, (int)ls.size()) {\\n\\t\\tREP(j, i) {\\n\\t\\t\\tif (connectSS(ls[i], ls[j])) {\\n\\t\\t\\t\\tequiv.unify(i, j);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tREP(i, (int)ls.size()) {\\n\\t\\tif (equiv.find(i) == i) {\\n\\t\\t\\tLines newLs;\\n\\t\\t\\tnewLs.push_back(ls[i]);\\n\\t\\t\\tFOR(j, i + 1, (int)ls.size()) {\\n\\t\\t\\t\\tif (equiv.find(j) == i)newLs.push_back(ls[j]);\\n\\t\\t\\t}\\n\\t\\t\\tret.push_back(newLs);\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\ntypedef pair<double, point>doublePoint;\\ntypedef vector<doublePoint>vDoublePoint;\\ntypedef map<point, vDoublePoint>adjPoint;\\ntypedef vector<point>Points;\\n\\npoint findNext(const vDoublePoint &vdp, const point &p) {\\n\\t//隣接点のリスト(偏角ソート済み)から移動前の点を探してその次\\n\\tint n = vdp.size();\\n\\tREP(i, n) {\\n\\t\\tif (p == vdp[i].second) {\\n\\t\\t\\treturn vdp[(i + 1) % n].second;\\n\\t\\t}\\n\\t}\\n\\treturn vdp[0].second;\\n}\\nbool used[101][101];\\nvoid make_polys(point minPoint, vector<Polygon>&polys,adjPoint &aPoint,map<point, int>&p2id,\\nmap<int, point>&id2p,int id) {\\n\\tPolygon ret;\\n\\tREP(i, id)REP(j, id)used[i][j] = false;\\n\\tret.push_back(minPoint);\\n\\tpoint curP = aPoint[minPoint][0].second;\\n\\tused[p2id[minPoint]][p2id[curP]] = true;\\n\\tpoint lastP = minPoint;\\n\\twhile (curP != minPoint) {\\n\\t\\tret.push_back(curP);\\n\\t\\tpoint nextP = findNext(aPoint[curP], lastP);\\n\\t\\tused[p2id[curP]][p2id[nextP]] = true;\\n\\t\\tlastP = curP;\\n\\t\\tcurP = nextP;\\n\\t}\\n\\t//ret.push_back(minPoint);\\n\\n\\t\\n\\tpolys.push_back(ret);\\n\\n bool all_used=false;\\n\\twhile (!all_used) {\\n all_used=true;\\n\\t\\tbool found = false;\\n\\t\\tpoint st, nx;\\n st={1e9,1e9};\\n\\t\\tREP(i, id) {\\n if(found)break;\\n\\t\\t\\tfor (auto nxt : aPoint[id2p[i]]) {\\n\\t\\t\\t\\tif (!used[i][p2id[nxt.second]]) {\\n all_used=false;\\n\\t\\t\\t\\t\\tfound = true;\\n if(id2p[i]<st){\\n st=id2p[i];\\n nx=nxt.second;\\n }\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n if(all_used)break;\\n\\t\\t//if (!found)break;\\n\\t\\tPolygon res;\\n\\t\\tres.push_back(st);\\n\\t\\tres.push_back(nx);\\n\\t\\tused[p2id[st]][p2id[nx]] = true;\\n\\t\\tpoint cur = nx;\\n\\t\\tpoint las = st;\\n\\t\\twhile (cur != st) {\\n\\t\\t\\tvDoublePoint v = aPoint[cur];\\n\\t\\t\\tint n = v.size();\\n\\t\\t\\tint s_idx = -1;\\n\\t\\t\\tbool found = false;\\n\\t\\t\\tREP(i, n) {\\n\\t\\t\\t\\tif (isSamePoint(v[i].second,las)) {\\n\\t\\t\\t\\t\\ts_idx = i; break;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n if(s_idx<0){\\n cerr<<cur<<endl;\\n cerr<<las<<endl;\\n }\\n assert(s_idx>=0);\\n\\t\\t\\tfor (int i = s_idx + 1; i < s_idx + n + 1; i++) {\\n\\t\\t\\t\\tint idx = i % n;\\n\\t\\t\\t\\tif (v[idx].second == cur)continue;\\n\\t\\t\\t\\tint cur_id = p2id[cur];\\n\\t\\t\\t\\tint nxt_id = p2id[v[idx].second];\\n\\t\\t\\t\\tif (!used[cur_id][nxt_id]) {\\n\\t\\t\\t\\t\\tfound = true;\\n\\t\\t\\t\\t\\tlas = cur;\\n\\t\\t\\t\\t\\tcur = v[idx].second;\\n\\t\\t\\t\\t\\tused[cur_id][nxt_id] = true;\\n\\t\\t\\t\\t\\tres.push_back(cur);\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t//if(!found)break;\\n\\t\\t\\tif (cur == st)break;\\n\\t\\t\\tif (!found)goto END2;\\n\\t\\t}\\n\\t\\tpolys.push_back(res);\\n\\tEND2:;\\n\\t}\\n\\n}\\nvector<Polygon> trace(const Lines &ls) {\\n\\t//隣接点(偏角付き)のリストを作成\\n\\tmap<point, vDoublePoint> aPoint;\\n\\t//頂点に番号を付けて辺の使用を記録\\n\\tmap<point, int>p2id;\\n\\tmap<int, point>id2p;\\n\\tint id = 0;\\n\\n\\tREP(i, (int)ls.size()) {\\n\\t\\tif (!p2id.count(ls[i][0])) {\\n\\t\\t\\tp2id[ls[i][0]] = id;\\n\\t\\t\\tid2p[id] = ls[i][0];\\n\\t\\t\\tid++;\\n\\t\\t}\\n\\t\\tif (!p2id.count(ls[i][1])) {\\n\\t\\t\\tp2id[ls[i][1]] = id;\\n\\t\\t\\tid2p[id] = ls[i][1];\\n\\t\\t\\tid++;\\n\\t\\t}\\n\\t\\taPoint[ls[i][0]].push_back(doublePoint(arg(ls[i][1] - ls[i][0]), ls[i][1]));\\n\\t\\taPoint[ls[i][1]].push_back(doublePoint(arg(ls[i][0] - ls[i][1]), ls[i][0]));\\n\\t}\\n\\tvector<point>minPoints;\\n REP(i,id)REP(j,id)used[i][j]=false;\\n\\t//vector<vector<bool>>used(id, vector<bool>(id));\\n\\t//REP(i,id)used[i][i]=true;\\n\\t//x座標最小の点の計算と隣接点リストのソート\\n\\tpoint minPoint(INT_MAX, INT_MAX);\\n\\tadjPoint::iterator it;\\n\\tfor (it = aPoint.begin(); it != aPoint.end(); ++it) {\\n\\t\\tpoint p = it->first;\\n\\t\\tminPoints.push_back(p);\\n\\t\\tminPoint = min(minPoint, p);\\n\\t\\tvDoublePoint &vdp = it->second;\\n\\t\\tsort(vdp.begin(), vdp.end());\\n\\t}\\n\\tvector<Polygon>polys;\\n\\t//for (auto minpoint : minPoints) {\\n\\t//\\tmake_polys(minpoint, polys, aPoint, p2id, id2p, id);\\n\\t//}\\n\\tmake_polys(minPoint, polys, aPoint, p2id, id2p, id);\\n\\treturn polys;\\n}\\nbool intersectCC(const Circle &a, const Circle &b) {\\n\\tdouble d = dist(a.c, b.c);\\n\\treturn abs(a.r - b.r)<d + EPS && d - EPS<a.r + b.r;\\n}\\nbool unuse[101];\\nbool canConnect(point p, point q, const Circles &circles) {\\n\\tset<int> p_enclose = get_enclosing_circle(p, circles);\\n\\tset<int> q_enclose = get_enclosing_circle(q, circles);\\n\\tif (p_enclose.size()>2) {\\n\\t\\tcout << p << endl;\\n\\t\\tfor (auto id : p_enclose) {\\n\\t\\t\\tcout << circles[id].c << \\\" \\\" << circles[id].r << endl;\\n\\t\\t}\\n\\t}\\n\\tassert(p_enclose.size() <= 2);\\n\\tassert(q_enclose.size() <= 2);\\n\\tif (p_enclose != q_enclose) {\\n\\t\\treturn false;\\n\\t}\\n REP(i,100)unuse[i]=false;\\n\\tfor (auto id : p_enclose) {\\n\\t\\tunuse[id] = true;\\n\\t}\\n\\tint n = circles.size();\\n\\tvector<Line>segments;\\n\\tREP(i, n) {\\n\\t\\tif (unuse[i])continue;\\n\\t\\tFOR(j, i, n) {\\n\\t\\t\\tif (i == j)continue;\\n\\t\\t\\tif (unuse[j])continue;\\n\\t\\t\\tif (intersectCC(circles[i], circles[j])) {\\n\\t\\t\\t\\tsegments.push_back(Line(circles[i].c, circles[j].c));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tvLines cc = connectedComponent(segments);\\n\\tfor (auto ls : cc) {\\n\\t\\tif (ls.size() <= 2)continue;\\n\\t\\tvector<Polygon>polys = trace(ls);\\n\\t\\tfor (auto poly : polys) {\\n\\t\\t\\t// for (auto pp : poly) {\\n\\t\\t\\t// \\tcout << pp << endl;\\n\\t\\t\\t// }cout << endl;\\n\\t\\t\\tif (poly.contains(p) != poly.contains(q))return false;\\n\\t\\t}\\n\\t}\\n\\n\\treturn true;\\n}\\n\\nvoid solve() {\\n\\tint N, M; cin >> N >> M;\\n\\t//cerr << N << \\\" \\\" << M << endl;\\n\\tif (N == 0)exit(0);\\n\\tCircles circles;\\n\\tREP(i, N) {\\n\\t\\tunuse[i] = false;\\n\\t\\tdouble x, y, r; cin >> x >> y >> r;\\n\\t\\tpoint c(x, y);\\n\\t\\tcircles.push_back({ c,r ,i });\\n\\t}\\n\\twhile (M--) {\\n\\t\\tdouble x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2;\\n\\t\\tpoint p(x1, y1), q(x2, y2);\\n\\t\\tif (canConnect(p, q, circles))cout << \\\"YES\\\";\\n\\t\\telse cout << \\\"NO\\\";\\n\\t\\tif (M)cout << \\\" \\\";\\n\\t\\telse cout << endl;\\n\\t}\\n}\\nsigned main() {\\n\\twhile (true)solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 3584,\n \"score_of_the_acc\": -0.1256,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1198_3616346\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<algorithm>\\n#include<vector>\\n#include<iomanip>\\n#include<math.h>\\n#include<complex>\\n#include<queue>\\n#include<deque>\\n#include<stack>\\n#include<map>\\n#include<set>\\n#include<bitset>\\n#include<functional>\\n#include<assert.h>\\n#include<numeric>\\nusing namespace std;\\n#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )\\n#define rep(i,n) REP(i,0,n)\\nusing ll = long long;\\nconst int inf=1e9+7;\\nconst ll longinf=1LL<<60 ;\\nconst ll mod=1e9+7 ;\\n\\nusing ld = double;\\nusing Point = complex<ld>;\\nconst ld eps = 1e-9;\\nconst ld pi = acos(-1.0);\\n\\nbool eq(ld a, ld b) {\\n\\treturn (abs(a - b) < eps);\\n}\\n\\nbool cmp(Point x,Point y){\\n\\tif(eq(x.real(),y.real()))return x.imag()<y.imag();\\n\\treturn x.real()<y.real();\\n}\\n\\nbool eqq(Point x,Point y){\\n\\treturn eq(x.real(),y.real())&&eq(x.imag(),y.imag());\\n}\\n//内積\\nld dot(Point a, Point b) {\\n\\treturn real(conj(a)*b);\\n}\\n//外積\\nld cross(Point a, Point b) {\\n\\treturn imag(conj(a)*b);\\n}\\n\\n\\n//線分\\n//直線にするなら十分通い２点を端点とすればよい\\nclass Line {\\npublic:\\n\\tPoint a, b;\\n};\\n//円\\nclass Circle {\\npublic:\\n\\tPoint p;\\n\\tld r;\\n};\\n//3点の位置関係\\nint ccw(Point a, Point b, Point c) {\\n\\tb -= a; c -= a;\\n\\tif (cross(b, c) > eps)return 1;//a,b,cが反時計回り\\n\\tif (cross(b, c) < -eps)return -1;//a,b,cが時計回り\\n\\tif (dot(b, c) < 0)return 2;//c,a,bの順に一直線\\n\\tif (norm(b) < norm(c))return -2;//a,b,cの順に一直線\\n\\treturn 0;//a,c,bの順に一直線\\n}\\n//2直線の交差判定\\nbool isis_ll(Line l, Line m) {\\n\\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\\n}\\n//直線と線分の交差判定\\nbool isis_ls(Line l, Line s) {\\n\\treturn (cross(l.b - l.a, s.a - l.a)*cross(l.b - l.a, s.b - l.a) < eps);\\n}\\n//点が直線上に存在するか\\nbool isis_lp(Line l, Point p) {\\n\\treturn (abs(cross(l.b - p, l.a - p)) < eps);\\n}\\n//点が線分上に存在するか\\nbool isis_sp(Line s, Point p) {\\n\\treturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\\n}\\n//線分と線分の交差判定\\nbool isis_ss(Line s, Line t) {\\n\\tif (isis_sp(s, t.a) || isis_sp(s, t.b) || isis_sp(t, s.a) || isis_sp(t, s.b))return true;\\n\\treturn(cross(s.b - s.a, t.a - s.a)*cross(s.b - s.a, t.b - s.a) < -eps && cross(t.b - t.a, s.a - t.a)*cross(t.b - t.a, s.b - t.a) < -eps);\\n}\\n//点から直線への垂線の足\\nPoint proj(Line l, Point p) {\\n\\tld t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + t * (l.a - l.b);\\n}\\n//直線と直線の交点\\n//平行な２直線に対しては使うな！！！！\\nPoint is_ll(Line s, Line t) {\\n\\tPoint sv = s.b - s.a; Point tv = t.b - t.a;\\n\\treturn s.a + sv * cross(tv, t.a - s.a) / cross(tv, sv);\\n}\\n//直線と点の距離\\nld dist_lp(Line l, Point p) {\\n\\treturn abs(p - proj(l, p));\\n}\\n//直線と直線の距離\\nld dist_ll(Line l, Line m) {\\n\\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\\n}\\n//線分と直線の距離\\nld dist_ls(Line l, Line s) {\\n\\treturn isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));\\n}\\n//線分と点の距離\\nld dist_sp(Line s, Point p) {\\n\\tPoint r = proj(s, p);\\n\\treturn isis_sp(s, r) ? abs(p - r) : min(abs(p - s.a), abs(p - s.b));\\n}\\n//線分と線分の距離\\nld dist_ss(Line s, Line t) {\\n\\tif (isis_ss(s, t))return 0;\\n\\treturn min({ dist_sp(s,t.a),dist_sp(s,t.b),dist_sp(t,s.a),dist_sp(t,s.b) });\\n}\\n\\nbool included(Point p,vector<Point>& pol){\\n int n=pol.size();\\n ld area=0;\\n rep(i,n){\\n area+=arg((pol[i]-p)/(pol[(i+1)%n]-p));\\n }\\n return abs(area) > eps;\\n}\\n\\nvoid solve(int n,int Q){\\n Circle c[n];\\n Point p[n];\\n rep(i,n){\\n double x,y,r;\\n cin>>x>>y>>r;\\n p[i]=Point(x,y);\\n c[i]={p[i],r};\\n }\\n\\n vector<int> in(n);\\n rep(i,n)rep(j,n){\\n if(i==j)continue;\\n if(c[i].r>c[j].r+abs(c[i].p-c[j].p))in[j]=true;\\n }\\n vector<vector<int>> v(n);\\n vector<vector<int>> used(n);\\n rep(i,n){\\n if(in[i])continue;\\n rep(j,n){\\n if(i==j||in[j])continue;\\n if(c[i].r+c[j].r>abs(c[i].p-c[j].p)){\\n v[i].push_back(j);\\n }\\n }\\n used[i].resize(v[i].size());\\n sort(v[i].begin(),v[i].end(),[&](int x,int y){\\n return arg(c[x].p-c[i].p)<arg(c[y].p-c[i].p);\\n });\\n }\\n vector<vector<Point>> pols;\\n rep(i,n){\\n rep(j,v[i].size()){\\n if(used[i][j])continue;\\n used[i][j]=true;\\n vector<Point> pol;\\n int pre=i, cur=v[i][j];\\n pol.push_back(p[pre]);\\n ld area=cross(p[cur],p[pre]);\\n while(cur!=i){\\n int nxt;\\n rep(k,v[cur].size()){\\n if(v[cur][k]==pre){\\n used[cur][(k+1)%v[cur].size()]=true;\\n nxt=v[cur][(k+1)%v[cur].size()];\\n break;\\n }\\n }\\n pre=cur;cur=nxt;\\n area+=cross(p[cur],p[pre]);\\n pol.push_back(p[pre]);\\n }\\n if(area>eps)pols.push_back(pol);\\n }\\n }\\n rep(aaa,Q){\\n Point q[2];\\n rep(i,2){\\n int x,y;\\n cin>>x>>y;\\n q[i]=Point(x,y);\\n }\\n vector<int> inc[2];\\n rep(i,2){\\n rep(j,n){\\n if(abs(q[i]-p[j])<c[j].r)inc[i].push_back(j);\\n }\\n }\\n if(inc[0]!=inc[1]){\\n cout<<\\\"NO\\\";\\n if(aaa!=Q-1)cout<<\\\" \\\";\\n continue;\\n }\\n if(inc[0].size()&&inc[0]==inc[1]){\\n cout<<\\\"YES\\\";\\n if(aaa!=Q-1)cout<<\\\" \\\";\\n continue;\\n }\\n rep(i,2){\\n rep(j,pols.size()){\\n if(included(q[i],pols[j]))inc[i].push_back(j);\\n }\\n }\\n if(inc[0]==inc[1])cout<<\\\"YES\\\";\\n else cout<<\\\"NO\\\";\\n if(aaa!=Q-1)cout<<\\\" \\\";\\n }\\n cout<<endl;\\n\\n}\\nint main(){\\n int n,q;\\n while(cin>>n>>q,n!=0)solve(n,q);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3564,\n \"score_of_the_acc\": -0.0598,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1198_3219839\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\\n#define all(x) (x).begin(),(x).end()\\n#define pb push_back\\n#define fi first\\n#define se second\\n#define dbg(x) cout<<#x\\\" = \\\"<<((x))<<endl\\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\\\"(\\\"<<p.fi<<\\\",\\\"<<p.se<<\\\")\\\";return o;}\\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\\\"[\\\";for(T t:v){o<<t<<\\\",\\\";}o<<\\\"]\\\";return o;}\\n\\n/* 基本要素 */\\ntypedef complex<double> Point;\\ntypedef pair<Point, Point> Line;\\ntypedef vector<Point> VP;\\nconst double PI = acos(-1);\\nconst double EPS = 1e-8; // 許容誤差^2\\nconst double INF = 1e9;\\n#define X real()\\n#define Y imag()\\n// #define LE(n,m) ((n) < (m) + EPS)\\n#define LE(n,m) ((n) - (m) < EPS)\\n// #define GE(n,m) ((n) + EPS > (m))\\n#define GE(n,m) (EPS > (m) - (n))\\n#define EQ(n,m) (abs((n)-(m)) < EPS)\\n\\n// 頂点の順序（sortやmax_elementに必要）\\nnamespace std {\\n bool operator<(const Point a, const Point b) {\\n return a.X != b.X ? a.X < b.X : a.Y < b.Y;\\n }\\n}\\n\\n// 内積 dot(a,b) = |a||b|cosθ\\ndouble dot(Point a, Point b) {\\n return a.X*b.X + a.Y*b.Y;\\n}\\n\\n// 外積 cross(a,b) = |a||b|sinθ\\ndouble cross(Point a, Point b) {\\n return a.X*b.Y - a.Y*b.X;\\n}\\n\\n// 点の進行方向\\n// !!! 誤差に注意 !!! (掛け算したものとかなり小さいものを比べているので)\\nint ccw(Point a, Point b, Point c) {\\n b -= a; c -= a;\\n if (cross(b,c) > EPS) return +1; // counter clockwise\\n if (cross(b,c) < -EPS) return -1; // clockwise\\n if (dot(b,c) < -EPS) return +2; // c--a--b on line\\n if (norm(b) < norm(c)) return -2; // a--b--c on line or a==b\\n return 0; // a--c--b on line or a==c or b==c\\n}\\n\\n// 多角形の内部判定\\n// 点が領域内部なら1、境界上なら2、外部なら0を返す\\nint inPolygon(const VP& ps, Point p) {\\n int n = ps.size();\\n bool in = false;\\n rep (i, n) {\\n Point a = ps[i] - p;\\n Point b = ps[(i + 1) % n] - p;\\n if (EQ(cross(a,b), 0) && LE(dot(a,b), 0)) return 2;\\n if (a.Y > b.Y) swap(a,b);\\n if ((a.Y*b.Y < 0 || (a.Y*b.Y < EPS && b.Y > EPS)) && LE(cross(a, b), 0)) in = !in;\\n }\\n return in;\\n}\\n\\n\\nPoint READ(){\\n int x,y;\\n cin >>x >>y;\\n return Point(x,y);\\n}\\n\\nint main(){\\n int n,m;\\n while(cin >>n >>m,n){\\n VP c(n);\\n vector<double> r(n);\\n rep(i,n){\\n c[i] = READ();\\n cin >>r[i];\\n }\\n\\n auto isecCC = [&](int a, int b){\\n if(r[a] > r[b]) swap(a,b);\\n double d = abs(c[a] - c[b]);\\n\\n if( r[a]+r[b] < d+EPS ) return false;\\n if( d+r[a] < r[b]+EPS ) return false;\\n return true;\\n };\\n\\n using D = pair<double,int>;\\n vector<vector<D>> g(n);\\n rep(i,n){\\n rep(j,n)if(j!=i && isecCC(i,j)){\\n Point pp = c[j] - c[i];\\n double theta = atan2(pp.Y,pp.X);\\n g[i].pb({theta,j});\\n }\\n sort(all(g[i]));\\n // dbg(g[i]);\\n }\\n\\n // 領域\\n vector<VP> pls;\\n\\n // (円i, 次に向かう方向)\\n vector<vector<bool>> vis(n);\\n rep(i,n) vis[i] = vector<bool>(g[i].size());\\n\\n using pi = pair<int,int>;\\n rep(i,n){\\n int GG = g[i].size();\\n if(GG==0) continue;\\n rep(ii,GG){\\n if(vis[i][ii]) continue;\\n\\n queue<pi> que;\\n stack<int> c_idx;\\n vector<bool> in(n);\\n\\n in[i] = true;\\n c_idx.push(i);\\n vis[i][ii] = true;\\n que.push({i,ii});\\n while(!que.empty()){\\n pi cur = que.front();\\n que.pop();\\n\\n // dbg(cur);\\n\\n int idx = cur.fi;\\n int dir = cur.se;\\n\\n int nidx = g[idx][dir].se;\\n int ndir = -1;\\n int sz = g[nidx].size();\\n rep(j,sz){\\n if(g[nidx][j].se == idx){\\n ndir = (j+1)%sz;\\n break;\\n }\\n }\\n\\n assert(ndir >= 0);\\n if(!vis[nidx][ndir]){\\n if(in[nidx]){\\n VP poly;\\n while(in[nidx]){\\n assert(!c_idx.empty());\\n int st_idx = c_idx.top();\\n c_idx.pop();\\n\\n in[st_idx] = false;\\n poly.pb(c[st_idx]);\\n }\\n\\n pls.pb(poly);\\n }\\n\\n in[nidx] = true;\\n c_idx.push(nidx);\\n vis[nidx][ndir] = true;\\n que.push({nidx,ndir});\\n }\\n }\\n\\n VP poly;\\n while(!c_idx.empty()){\\n int st_idx = c_idx.top();\\n c_idx.pop();\\n\\n in[st_idx] = false;\\n poly.pb(c[st_idx]);\\n }\\n pls.pb(poly);\\n }\\n }\\n\\n // for(VP poly:pls) dbg(poly);\\n\\n auto IN = [&](int idx, Point p){\\n double d = abs(p - c[idx]);\\n return d < r[idx];\\n };\\n\\n vector<bool> ans(m,true);\\n rep(i,m){\\n Point start = READ(), goal = READ();\\n bool flg = false;\\n rep(j,n){\\n if(IN(j,start) || IN(j,goal)) flg = true;\\n if( IN(j,start) != IN(j,goal) ) ans[i] = false;\\n }\\n\\n if(!flg){\\n for(VP poly:pls)if(poly.size()>=3){\\n int vs = inPolygon(poly, start);\\n int vg = inPolygon(poly, goal);\\n if( vs != vg ) ans[i] = false;\\n }\\n }\\n }\\n\\n rep(i,m){\\n if(i) cout << \\\" \\\";\\n cout << (ans[i]?\\\"YES\\\":\\\"NO\\\");\\n }\\n cout << \\\"\\\\n\\\";\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3492,\n \"score_of_the_acc\": -0.0395,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1198_3001798\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\nusing ld = long double;\\nconst ld eps = 1e-9;\\n\\n\\n/* 幾何の基本 */\\n\\n#include <complex>\\n\\ntypedef complex<ld> Point;\\n\\n\\nconst ld pi = acos(-1.0);\\nconst ld dtop = pi / 180.;\\nconst ld ptod = 1. / dtop;\\n\\nnamespace std {\\n\\tbool operator<(const Point &lhs, const Point &rhs) {\\n\\t\\tif (lhs.real() < rhs.real() - eps) return true;\\n\\t\\tif (lhs.real() > rhs.real() + eps) return false;\\n\\t\\treturn lhs.imag() < rhs.imag();\\n\\t}\\n}\\n\\n// 点の入力\\nPoint input_Point() {\\n\\tld x, y;\\n\\tcin >> x >> y;\\n\\treturn Point(x, y);\\n}\\n\\n// 誤差つき等号判定\\nbool eq(const ld a, const ld b) {\\n\\treturn (abs(a - b) < eps);\\n}\\n\\n// 内積\\nld dot(const Point& a, const Point& b) {\\n\\treturn real(conj(a) * b);\\n}\\n\\n// 外積\\nld cross(const Point& a, const Point& b) {\\n\\treturn imag(conj(a) * b);\\n}\\n\\n// 直線の定義\\nclass Line {\\npublic:\\n\\tPoint a, b;\\n\\tLine() : a(Point(0, 0)), b(Point(0, 0)) {}\\n\\tLine(Point a, Point b) : a(a), b(b) {}\\n\\tPoint operator[](const int _num)const {\\n\\t\\tif (_num == 0)return a;\\n\\t\\telse if (_num == 1)return b;\\n\\t\\telse {\\n\\t\\t\\tassert(false);\\n\\t\\t\\treturn Point();\\n\\t\\t}\\n\\t}\\n};\\n\\n// 円の定義\\nclass Circle {\\npublic:\\n\\tPoint p;\\n\\tld r;\\n\\tCircle() : p(Point(0, 0)), r(0) {}\\n\\tCircle(Point p, ld r) : p(p), r(r) {}\\n};\\n\\n// ccw\\n// 1: a,b,cが反時計周りの順に並ぶ\\n//-1: a,b,cが時計周りの順に並ぶ\\n// 2: c,a,bの順に直線に並ぶ\\n//-2: a,b,cの順に直線に並ぶ\\n// 0: a,c,bの順に直線に並ぶ\\nint ccw(const Point& a, const Point &b, const Point &c) {\\n\\tconst Point nb(b - a);\\n\\tconst Point nc(c - a);\\n\\tif (cross(nb, nc) > eps) return 1; // a,b,cが反時計周りの順に並ぶ\\n\\tif (cross(nb, nc) < -eps) return -1; // a,b,cが時計周りの順に並ぶ\\n\\tif (dot(nb, nc) < 0) return 2; // c,a,bの順に直線に並ぶ\\n\\tif (norm(nb) < norm(nc)) return -2; // a,b,cの順に直線に並ぶ\\n\\treturn 0; // a,c,bの順に直線に並ぶ\\n}\\n\\n\\n/* 交差判定 */\\n\\n// 直線と直線の交差判定\\nbool isis_ll(const Line& l, const Line& m) {\\n\\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\\n}\\n\\n// 直線と線分の交差判定\\nbool isis_ls(const Line& l, const Line& s) {\\n\\treturn isis_ll(l, s) &&\\n\\t\\t(cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < eps);\\n}\\n\\n// 線分と線分の交差判定\\nbool isis_ss(const Line& s, const Line& t) {\\n\\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\\n\\t\\tccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\\n}\\n\\n// 点の直線上判定\\nbool isis_lp(const Line& l, const Point& p) {\\n\\treturn (abs(cross(l.b - p, l.a - p)) < eps);\\n}\\n\\n// 点の線分上判定\\nbool isis_sp(const Line& s, const Point& p) {\\n\\treturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\\n}\\n\\n// 垂線の足\\nPoint proj(const Line &l, const Point& p) {\\n\\tld t = dot(p - l.a, l.b - l.a) / norm(l.a - l.b);\\n\\treturn l.a + t * (l.b - l.a);\\n}\\n\\n//線対象の位置にある点\\nPoint reflect(const Line &l, const Point &p) {\\n\\tPoint pr = proj(l, p);\\n\\treturn pr * 2.l - p;\\n}\\n\\n// 直線と直線の交点\\nPoint is_ll(const Line &s, const Line& t) {\\n\\tPoint sv = s.b - s.a, tv = t.b - t.a;\\n\\tassert(cross(sv, tv) != 0);\\n\\treturn s.a + sv * cross(tv, t.a - s.a) / cross(tv, sv);\\n}\\n// 直線と直線の交点\\nvector<Point> is_ll2(const Line &s, const Line& t) {\\n\\tPoint sv = s.b - s.a, tv = t.b - t.a;\\n\\tif (cross(sv, tv) != 0)return vector<Point>(1, is_ll(s, t));\\n\\telse {\\n\\t\\tvector<Point>ans;\\n\\t\\tfor (int k = 0; k < 2; ++k) {\\n\\t\\t\\tif (isis_sp(s, t[k]) && find(ans.begin(), ans.end(), t[k]) == ans.end())ans.push_back(t[k]);\\n\\t\\t\\tif (isis_sp(t, s[k]) && find(ans.begin(), ans.end(), s[k]) == ans.end())ans.push_back(s[k]);\\n\\t\\t}\\n\\t\\treturn ans;\\n\\t}\\n}\\n// 線分と線分の交点\\n// 重なってる部分あるとassert(false)\\nPoint is_ss(const Line &s, const Line& t) {\\n\\tif (isis_ss(s, t)) {\\n\\t\\tfor (int k = 0; k < 2; ++k) {\\n\\t\\t\\tfor (int l = 0; l < 2; ++l) {\\n\\t\\t\\t\\tif (s[k] == t[l])return s[k];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn is_ll(s, t);\\n\\t}\\n\\telse {\\n\\t\\t//先にisis_ssしてね\\n\\t\\tassert(false);\\n\\t\\treturn Point(0, 0);\\n\\t}\\n}\\n// 線分と線分の交点\\nvector<Point> is_ss2(const Line &s, const Line& t) {\\n\\tvector<Point> kouho(is_ll2(s, t));\\n\\tvector<Point>ans;\\n\\tfor (auto p : kouho) {\\n\\t\\tif (isis_sp(s, p) && isis_sp(t, p))ans.emplace_back(p);\\n\\t}\\n\\treturn ans;\\n}\\n// 直線と点の距離\\nld dist_lp(const Line& l, const Point& p) {\\n\\treturn abs(p - proj(l, p));\\n}\\n\\n//直線と直線の距離\\nld dist_ll(const Line& l, const Line& m) {\\n\\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\\n}\\n\\n// 直線と線分の距離\\nld dist_ls(const Line& l, const Line& s) {\\n\\treturn isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));\\n}\\n\\n// 線分と点の距離\\nld dist_sp(const Line& s, const Point& p) {\\n\\tPoint r = proj(s, p);\\n\\treturn isis_sp(s, r) ? abs(r - p) : min(abs(s.a - p), abs(s.b - p));\\n}\\n\\n// 線分と線分の距離\\nld dist_ss(const Line& s, const Line& t) {\\n\\tif (isis_ss(s, t)) return 0;\\n\\treturn min({ dist_sp(s, t.a), dist_sp(s, t.b), dist_sp(t, s.a), dist_sp(t, s.b) });\\n}\\n\\n\\n//直線と直線の二等分線のベクトル\\nLine line_bisection(const Line &s, const Line &t) {\\n\\tconst Point laglanju(is_ll(s, t));\\n\\tconst Point avec = !(abs(laglanju - s[0])<eps) ? s[0] - laglanju : s[1] - laglanju;\\n\\tconst Point bvec = !(abs(laglanju - t[0])<eps) ? t[0] - laglanju : t[1] - laglanju;\\n\\n\\treturn Line(laglanju, laglanju + (abs(bvec)*avec + abs(avec)*bvec) / (abs(avec) + abs(bvec)));\\n}\\n//点と点の垂直二等分線 aを左に見ながら\\nLine point_bisection(const Point&a, const Point&b) {\\n\\tconst Point cen((a + b) / 2.l);\\n\\tconst Point vec = (b - a)*Point(0, 1);\\n\\treturn Line(cen, cen + vec);\\n}\\n\\n//三つの点からなる外心\\nPoint outer_center(const vector<Point>&ps) {\\n\\tassert(ps.size() == 3);\\n\\tLine l1 = point_bisection(ps[0], ps[1]);\\n\\tLine l2 = point_bisection(ps[1], ps[2]);\\n\\treturn is_ll(l1, l2);\\n}\\n\\n\\n//三つの直線からなる内心\\n//三つの直線が並行でないことは確かめといてね\\nPoint inner_center(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tfor (int i = 0; i <static_cast<int>(ls.size()); ++i) {\\n\\t\\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\\n\\t}\\n\\tif (vertics[0] == vertics[1] || vertics[1] == vertics[2] || vertics[2] == vertics[0])return vertics[0];\\n\\tLine bi1(line_bisection(Line(vertics[0], vertics[1]), Line(vertics[0], vertics[2])));\\n\\tLine bi2(line_bisection(Line(vertics[1], vertics[2]), Line(vertics[1], vertics[0])));\\n\\tif (bi1[0] == bi2[0])return bi1[0];\\n\\telse {\\n\\t\\treturn is_ll(bi1, bi2);\\n\\t}\\n}\\n\\n//三つの直線からなる傍心\\n//三つの直線が並行でないことは確かめといてね\\nvector<Point> ex_center(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tfor (int i = 0; i < static_cast<int>(ls.size()); ++i) {\\n\\t\\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\\n\\t}\\n\\tif (abs(vertics[0] - vertics[1])<eps || abs(vertics[1] - vertics[2])<eps || (abs(vertics[2] - vertics[0])<eps))return vector<Point>();\\n\\tvector<Point>ecs;\\n\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\tLine bi1(line_bisection(Line(vertics[i], vertics[i] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[i], vertics[(i + 1) % 3])));\\n\\t\\tLine bi2(line_bisection(Line(vertics[(i + 1) % 3], vertics[(i + 1) % 3] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[(i + 1) % 3], vertics[i])));\\n\\t\\tecs.push_back(is_ll(bi1, bi2));\\n\\t}\\n\\treturn ecs;\\n}\\n\\n\\n//a,b:並行\\n//c:並行でない\\n//三つの直線から同距離の位置を求める。\\nvector<Point> same_dis(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tvertics.push_back(is_ll(ls[0], ls[2]));\\n\\tvertics.push_back(is_ll(ls[1], ls[2]));\\n\\n\\tif (abs(vertics[0] - vertics[1]) < eps)return vector<Point>{vertics[0]};\\n\\tLine bis(line_bisection(ls[0], ls[1]));\\n\\tvector<Point>ecs;\\n\\n\\tLine abi(line_bisection(Line(vertics[0], vertics[1]), ls[0]));\\n\\tecs.push_back(is_ll(bis, abi));\\n\\n\\n\\tLine bbi(line_bisection(Line(vertics[0], 2.l*vertics[0] - vertics[1]), ls[0]));\\n\\tecs.push_back(is_ll(bis, bbi));\\n\\n\\treturn ecs;\\n}\\n/* 円 */\\n\\n// 円と円の交点\\nvector<Point> is_cc(const Circle& c1, const Circle& c2) {\\n\\tvector<Point> res;\\n\\tld d = abs(c1.p - c2.p);\\n\\tld rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\\n\\tld dfr = c1.r * c1.r - rc * rc;\\n\\tif (abs(dfr) < eps) dfr = 0.0;\\n\\telse if (dfr < 0.0) return res; // no intersection\\n\\tld rs = sqrt(dfr);\\n\\tPoint diff = (c2.p - c1.p) / d;\\n\\tres.push_back(c1.p + diff * Point(rc, rs));\\n\\tif (dfr != 0.0) res.push_back(c1.p + diff * Point(rc, -rs));\\n\\treturn res;\\n}\\n\\n/*\\n点が円の中にいるか\\n0 => out\\n1 => on\\n2 => in*/\\nint is_in_Circle(const Point& p, const Circle &cir) {\\n\\tld dis = abs(cir.p - p);\\n\\tif (dis > cir.r + eps)return 0;\\n\\telse if (dis < cir.r - eps)return 2;\\n\\telse return 1;\\n}\\nint is_in_Circle(const Circle &cir, const Point& p) {\\n\\tld dis = abs(cir.p - p);\\n\\tif (dis > cir.r + eps)return 0;\\n\\telse if (dis < cir.r - eps)return 2;\\n\\telse return 1;\\n}\\n/*\\n円lcが円rcの中にいるか\\n0 => out\\n1 => on\\n2 => in*/\\nint Circle_in_Circle(const Circle &lc, const Circle&rc) {\\n\\tld dis = abs(lc.p - rc.p);\\n\\tif (dis < rc.r - lc.r - eps)return 2;\\n\\telse if (dis>rc.r - lc.r + eps)return 0;\\n\\telse return 1;\\n}\\n\\n// 円と直線の交点\\nvector<Point> is_lc(const Circle& c, const Line& l) {\\n\\tvector<Point> res;\\n\\tld d = dist_lp(l, c.p);\\n\\tif (d < c.r + eps) {\\n\\t\\tld len = (d > c.r) ? 0.0 : sqrt(c.r * c.r - d * d); //safety;\\n\\t\\tPoint nor = (l.a - l.b) / abs(l.a - l.b);\\n\\t\\tres.push_back(proj(l, c.p) + len * nor);\\n\\t\\tres.push_back(proj(l, c.p) - len * nor);\\n\\t}\\n\\treturn res;\\n}\\n\\n// 円と線分の距離\\nvector<Point> is_sc(const Circle& c, const Line& l) {\\n\\tvector<Point> v = is_lc(c, l), res;\\n\\tfor (Point p : v)\\n\\t\\tif (isis_sp(l, p)) res.push_back(p);\\n\\treturn res;\\n}\\n\\n// 円と点の接線\\nvector<Line> tangent_cp(const Circle& c, const Point& p) {\\n\\tvector<Line> ret;\\n\\tPoint v = c.p - p;\\n\\tld d = abs(v);\\n\\tld l = sqrt(norm(v) - c.r * c.r);\\n\\tif (isnan(l)) { return ret; }\\n\\tPoint v1 = v * Point(l / d, c.r / d);\\n\\tPoint v2 = v * Point(l / d, -c.r / d);\\n\\tret.push_back(Line(p, p + v1));\\n\\tif (l < eps) return ret;\\n\\tret.push_back(Line(p, p + v2));\\n\\treturn ret;\\n}\\n\\n// 円と円の接線\\nvector<Line> tangent_cc(const Circle& c1, const Circle& c2) {\\n\\tvector<Line> ret;\\n\\tif (abs(c1.p - c2.p) - (c1.r + c2.r) > -eps) {\\n\\t\\tPoint center = (c1.p * c2.r + c2.p * c1.r) / (c1.r + c2.r);\\n\\t\\tret = tangent_cp(c1, center);\\n\\t}\\n\\tif (abs(c1.r - c2.r) > eps) {\\n\\t\\tPoint out = (-c1.p * c2.r + c2.p * c1.r) / (c1.r - c2.r);\\n\\t\\tvector<Line> nret = tangent_cp(c1, out);\\n\\t\\tret.insert(ret.end(), nret.begin(), nret.end());\\n\\t}\\n\\telse {\\n\\t\\tPoint v = c2.p - c1.p;\\n\\t\\tv /= abs(v);\\n\\t\\tPoint q1 = c1.p + v * Point(0, 1) * c1.r;\\n\\t\\tPoint q2 = c1.p + v * Point(0, -1) * c1.r;\\n\\t\\tret.push_back(Line(q1, q1 + v));\\n\\t\\tret.push_back(Line(q2, q2 + v));\\n\\t}\\n\\treturn ret;\\n}\\n//二つの円の重なり面積\\nld two_Circle_area(const Circle&l, const Circle&r) {\\n\\tld dis = abs(l.p - r.p);\\n\\tif (dis > l.r + r.r)return 0;\\n\\telse if (dis + r.r < l.r) {\\n\\t\\treturn r.r*r.r*pi;\\n\\t}\\n\\telse if (dis + l.r < r.r) {\\n\\t\\treturn l.r*l.r*pi;\\n\\t}\\n\\telse {\\n\\t\\tld ans = (l.r)*(l.r)*acos((dis*dis + l.r*l.r - r.r*r.r) / (2 * dis*l.r)) +\\n\\t\\t\\t(r.r)*(r.r)*acos((dis*dis + r.r*r.r - l.r*l.r) / (2 * dis*r.r)) -\\n\\t\\t\\tsqrt(4 * dis*dis*l.r*l.r - (dis*dis + l.r*l.r - r.r*r.r)*(dis*dis + l.r*l.r - r.r*r.r)) / 2;\\n\\t\\treturn ans;\\n\\t}\\n\\n}\\n\\n/* 多角形 */\\n\\ntypedef vector<Point> Polygon;\\n\\n\\n// 面積\\nld get_area(const Polygon &p) {\\n\\tld res = 0;\\n\\tint n = p.size();\\n\\tfor (int j = 0; j<n; ++j) res += cross(p[j], p[(j + 1) % n]);\\n\\treturn res / 2;\\n}\\n\\n// 円の内外判定\\n/*0 => out\\n1 => on\\n2 => in*/\\nint convex_contains(const Polygon &poly, const Point& p) {\\n\\tld angle = 0;\\n\\tint n = poly.size();\\n\\tfor(int i=0;i<n;++i) {\\n\\t\\tPoint a = poly[i], b = poly[(i + 1) % n];\\n\\t\\tif (isis_sp(Line(a, b), p)) return 1;\\n\\t\\tangle += arg((b - p) / (a - p));\\n\\t}\\n\\treturn eq(angle, 0) ? 0 : 2;\\n}\\n\\n\\nstruct Edge {\\n\\tint src;\\n\\tint dest;\\n};\\nusing Graph=vector<vector<Edge>>;\\n\\n//線分アレンジメント後に、\\n//閉路の面積の和を求める。\\nvoid dfs(set<pair<int,int>>&real_set,set<pair<int ,int>>&aset,const int now, const int from, vector<int>&prevs, vector<Polygon>&ans_polys, const vector<Point>&ps, const Graph&g) {\\n\\tvector<pair<ld, int>>next_points;\\n\\n\\tPoint from_p = from == -1 ? ps[now] + Point(-3e6, 1) : ps[from];\\n\\tPoint now_p = ps[now];\\n\\tfor (auto e : g[now]) {\\n\\t\\tif (e.dest == from)continue;\\n\\t\\tPoint next_p = ps[e.dest];\\n\\n\\t\\tld costheta = dot(from_p - now_p, next_p - now_p) / (abs(from_p - now_p)*abs(next_p - now_p));\\n\\t\\tcostheta *= 0.3;\\n\\t\\tld d = acos(costheta);\\n\\t\\tif (ccw(from_p, now_p, next_p) != 1) {\\n\\t\\t\\td = 2 * pi - d;\\n\\t\\t}\\n\\t\\tnext_points.push_back(make_pair(d, e.dest));\\n\\t}\\n\\tsort(next_points.begin(), next_points.end());\\n\\n\\tfor (auto n_p : next_points) {\\n\\t\\tif (aset.find(make_pair(now, n_p.second))!=aset.end()) {\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tif (real_set.find(make_pair(now, n_p.second)) != real_set.end()) {\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\taset.emplace(now,n_p.second);\\n\\t\\t}\\n\\n\\t\\tif (prevs[n_p.second] != -1) {\\n\\t\\t\\tint k=now;\\n\\t\\t\\tPolygon poly(1,ps[k]);\\n\\t\\t\\treal_set.emplace(k,n_p.second);\\n\\t\\t\\twhile (k != n_p.second) {\\n\\t\\t\\t\\tint a = k;\\n\\t\\t\\t\\tk=prevs[k];\\n\\t\\t\\t\\treal_set.emplace(k,a);\\n\\t\\t\\t\\tpoly.push_back(ps[k]);\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tld plus = get_area(poly);\\n\\t\\t\\tif (plus<eps) {\\n\\t\\t\\t\\treverse(poly.begin(),poly.end());\\n\\t\\t\\t\\tans_polys.push_back(poly);\\n\\t\\t\\t}\\n\\t\\t\\tthrow(false);\\n\\t\\t}\\n\\t\\telse {\\n\\n\\t\\t\\tprevs[n_p.second] = now;\\n\\t\\t\\tdfs(real_set,aset, n_p.second, now, prevs, ans_polys, ps, g);\\n\\t\\t\\tprevs[n_p.second] = -1;\\n\\t\\t}\\n\\n\\t}\\n\\treturn ;\\n}\\n\\nint main() {\\n\\tint t=0;\\n\\twhile (true) {\\n\\t\\tint N,M;cin>>N>>M;\\n\\t\\tt++;\\n\\n\\t\\tif(!N)break;\\n\\t\\tvector<Circle>cs;\\n\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\tint x,y,r;cin>>x>>y>>r;\\n\\t\\t\\tcs.push_back(Circle(Point(x,y),r));\\n\\t\\t}\\n\\t\\tvector<vector<Edge>>edges(N);\\n\\t\\tGraph g(N);\\n\\t\\tint sum=0;\\n\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\tfor (int j = i + 1; j < N; ++j) {\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tld dis=abs(cs[i].p-cs[j].p);\\n\\t\\t\\t\\tif (Circle_in_Circle(cs[i], cs[j])<=1&&Circle_in_Circle(cs[j],cs[i])<=1&&dis<cs[i].r+cs[j].r) {\\n\\t\\t\\t\\t\\tedges[i].push_back(Edge{ i,j });\\n\\t\\t\\t\\t\\tedges[j].push_back(Edge{ j,i });\\n\\t\\t\\t\\t\\tsum++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvector<Point>ps(N);\\n\\t\\tfor(int i=0;i<N;++i)ps[i]=cs[i].p;\\n\\n\\t\\tvector<Polygon>polys;\\n\\t\\tset<pair<int,int>>aset;\\n\\n\\t\\tfor(int i=0;i<N;++i) {\\n\\t\\t\\tfor (int j = 0; j < edges[i].size();++j) {\\n\\t\\t\\t\\tif (aset.find(make_pair(i, j)) == aset.end()) {\\n\\t\\t\\t\\t\\ttry {\\n\\t\\t\\t\\t\\t\\tvector<int>prevs(N, -1);\\n\\t\\t\\t\\t\\t\\tprevs[i] = -2;\\n\\t\\t\\t\\t\\t\\tset<pair<int,int>>nset;\\n\\t\\t\\t\\t\\t\\tdfs(aset,nset, i, -1, prevs, polys, ps, edges);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tcatch (...) {\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tfor (int i = 0; i < M; ++i) {\\n\\t\\t\\tvector<Point>query_points;\\n\\t\\t\\t{\\n\\t\\t\\t\\tint a,b,c,d;cin>>a>>b>>c>>d;\\n\\t\\t\\t\\tPoint p,q;\\n\\t\\t\\t\\tp=Point(a,b);\\n\\t\\t\\t\\tq=Point(c,d);\\n\\t\\t\\t\\tquery_points = vector<Point>{ p,q };\\n\\t\\t\\t}\\n\\t\\t\\tvector<vector<int>>in_circles(2);\\n\\t\\t\\tfor (int j = 0; j < 2; ++j) {\\n\\t\\t\\t\\tfor (int k = 0; k < N; ++k) {\\n\\t\\t\\t\\t\\tif (is_in_Circle(cs[k], query_points[j])) {\\n\\t\\t\\t\\t\\t\\tin_circles[j].push_back(true);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tin_circles[j].push_back(false);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tbool ok;\\n\\t\\t\\tif (in_circles[0] != in_circles[1]) {\\n\\t\\t\\t\\tok=false;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tif (all_of(in_circles[0].begin(), in_circles[0].end(), [](const int a) {return a == 0; })) {\\n\\t\\t\\t\\t\\tvector<vector<int>>in_polygons(2,vector<int>(polys.size()));\\n\\t\\t\\t\\t\\tfor (int j = 0; j < 2; ++j) {\\n\\t\\t\\t\\t\\t\\tfor (int k = 0; k < polys.size(); ++k) {\\n\\t\\t\\t\\t\\t\\t\\tif (convex_contains(polys[k], query_points[j])) {\\n\\t\\t\\t\\t\\t\\t\\t\\tin_polygons[j][k] = true;\\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\\tif (in_polygons[0] == in_polygons[1]) {\\n\\t\\t\\t\\t\\t\\tok=true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tok=false;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tok=true;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\t\\t\\tif(ok)cout<<\\\"YES\\\";\\n\\t\\t\\telse cout<<\\\"NO\\\";\\n\\t\\t\\tif(i==M-1)cout<<endl;\\n\\t\\t\\telse cout<<\\\" \\\";\\n\\t\\t\\t\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3280,\n \"score_of_the_acc\": -0.0345,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1198_3001762\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\nusing ld = long double;\\nconst ld eps = 1e-9;\\n\\n\\n/* 幾何の基本 */\\n\\n#include <complex>\\n\\ntypedef complex<ld> Point;\\n\\n\\nconst ld pi = acos(-1.0);\\nconst ld dtop = pi / 180.;\\nconst ld ptod = 1. / dtop;\\n\\nnamespace std {\\n\\tbool operator<(const Point &lhs, const Point &rhs) {\\n\\t\\tif (lhs.real() < rhs.real() - eps) return true;\\n\\t\\tif (lhs.real() > rhs.real() + eps) return false;\\n\\t\\treturn lhs.imag() < rhs.imag();\\n\\t}\\n}\\n\\n// 点の入力\\nPoint input_Point() {\\n\\tld x, y;\\n\\tcin >> x >> y;\\n\\treturn Point(x, y);\\n}\\n\\n// 誤差つき等号判定\\nbool eq(const ld a, const ld b) {\\n\\treturn (abs(a - b) < eps);\\n}\\n\\n// 内積\\nld dot(const Point& a, const Point& b) {\\n\\treturn real(conj(a) * b);\\n}\\n\\n// 外積\\nld cross(const Point& a, const Point& b) {\\n\\treturn imag(conj(a) * b);\\n}\\n\\n// 直線の定義\\nclass Line {\\npublic:\\n\\tPoint a, b;\\n\\tLine() : a(Point(0, 0)), b(Point(0, 0)) {}\\n\\tLine(Point a, Point b) : a(a), b(b) {}\\n\\tPoint operator[](const int _num)const {\\n\\t\\tif (_num == 0)return a;\\n\\t\\telse if (_num == 1)return b;\\n\\t\\telse {\\n\\t\\t\\tassert(false);\\n\\t\\t\\treturn Point();\\n\\t\\t}\\n\\t}\\n};\\n\\n// 円の定義\\nclass Circle {\\npublic:\\n\\tPoint p;\\n\\tld r;\\n\\tCircle() : p(Point(0, 0)), r(0) {}\\n\\tCircle(Point p, ld r) : p(p), r(r) {}\\n};\\n\\n// ccw\\n// 1: a,b,cが反時計周りの順に並ぶ\\n//-1: a,b,cが時計周りの順に並ぶ\\n// 2: c,a,bの順に直線に並ぶ\\n//-2: a,b,cの順に直線に並ぶ\\n// 0: a,c,bの順に直線に並ぶ\\nint ccw(const Point& a, const Point &b, const Point &c) {\\n\\tconst Point nb(b - a);\\n\\tconst Point nc(c - a);\\n\\tif (cross(nb, nc) > eps) return 1; // a,b,cが反時計周りの順に並ぶ\\n\\tif (cross(nb, nc) < -eps) return -1; // a,b,cが時計周りの順に並ぶ\\n\\tif (dot(nb, nc) < 0) return 2; // c,a,bの順に直線に並ぶ\\n\\tif (norm(nb) < norm(nc)) return -2; // a,b,cの順に直線に並ぶ\\n\\treturn 0; // a,c,bの順に直線に並ぶ\\n}\\n\\n\\n/* 交差判定 */\\n\\n// 直線と直線の交差判定\\nbool isis_ll(const Line& l, const Line& m) {\\n\\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\\n}\\n\\n// 直線と線分の交差判定\\nbool isis_ls(const Line& l, const Line& s) {\\n\\treturn isis_ll(l, s) &&\\n\\t\\t(cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < eps);\\n}\\n\\n// 線分と線分の交差判定\\nbool isis_ss(const Line& s, const Line& t) {\\n\\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\\n\\t\\tccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\\n}\\n\\n// 点の直線上判定\\nbool isis_lp(const Line& l, const Point& p) {\\n\\treturn (abs(cross(l.b - p, l.a - p)) < eps);\\n}\\n\\n// 点の線分上判定\\nbool isis_sp(const Line& s, const Point& p) {\\n\\treturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\\n}\\n\\n// 垂線の足\\nPoint proj(const Line &l, const Point& p) {\\n\\tld t = dot(p - l.a, l.b - l.a) / norm(l.a - l.b);\\n\\treturn l.a + t * (l.b - l.a);\\n}\\n\\n//線対象の位置にある点\\nPoint reflect(const Line &l, const Point &p) {\\n\\tPoint pr = proj(l, p);\\n\\treturn pr * 2.l - p;\\n}\\n\\n// 直線と直線の交点\\nPoint is_ll(const Line &s, const Line& t) {\\n\\tPoint sv = s.b - s.a, tv = t.b - t.a;\\n\\tassert(cross(sv, tv) != 0);\\n\\treturn s.a + sv * cross(tv, t.a - s.a) / cross(tv, sv);\\n}\\n// 直線と直線の交点\\nvector<Point> is_ll2(const Line &s, const Line& t) {\\n\\tPoint sv = s.b - s.a, tv = t.b - t.a;\\n\\tif (cross(sv, tv) != 0)return vector<Point>(1, is_ll(s, t));\\n\\telse {\\n\\t\\tvector<Point>ans;\\n\\t\\tfor (int k = 0; k < 2; ++k) {\\n\\t\\t\\tif (isis_sp(s, t[k]) && find(ans.begin(), ans.end(), t[k]) == ans.end())ans.push_back(t[k]);\\n\\t\\t\\tif (isis_sp(t, s[k]) && find(ans.begin(), ans.end(), s[k]) == ans.end())ans.push_back(s[k]);\\n\\t\\t}\\n\\t\\treturn ans;\\n\\t}\\n}\\n// 線分と線分の交点\\n// 重なってる部分あるとassert(false)\\nPoint is_ss(const Line &s, const Line& t) {\\n\\tif (isis_ss(s, t)) {\\n\\t\\tfor (int k = 0; k < 2; ++k) {\\n\\t\\t\\tfor (int l = 0; l < 2; ++l) {\\n\\t\\t\\t\\tif (s[k] == t[l])return s[k];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn is_ll(s, t);\\n\\t}\\n\\telse {\\n\\t\\t//先にisis_ssしてね\\n\\t\\tassert(false);\\n\\t\\treturn Point(0, 0);\\n\\t}\\n}\\n// 線分と線分の交点\\nvector<Point> is_ss2(const Line &s, const Line& t) {\\n\\tvector<Point> kouho(is_ll2(s, t));\\n\\tvector<Point>ans;\\n\\tfor (auto p : kouho) {\\n\\t\\tif (isis_sp(s, p) && isis_sp(t, p))ans.emplace_back(p);\\n\\t}\\n\\treturn ans;\\n}\\n// 直線と点の距離\\nld dist_lp(const Line& l, const Point& p) {\\n\\treturn abs(p - proj(l, p));\\n}\\n\\n//直線と直線の距離\\nld dist_ll(const Line& l, const Line& m) {\\n\\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\\n}\\n\\n// 直線と線分の距離\\nld dist_ls(const Line& l, const Line& s) {\\n\\treturn isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));\\n}\\n\\n// 線分と点の距離\\nld dist_sp(const Line& s, const Point& p) {\\n\\tPoint r = proj(s, p);\\n\\treturn isis_sp(s, r) ? abs(r - p) : min(abs(s.a - p), abs(s.b - p));\\n}\\n\\n// 線分と線分の距離\\nld dist_ss(const Line& s, const Line& t) {\\n\\tif (isis_ss(s, t)) return 0;\\n\\treturn min({ dist_sp(s, t.a), dist_sp(s, t.b), dist_sp(t, s.a), dist_sp(t, s.b) });\\n}\\n\\n\\n//直線と直線の二等分線のベクトル\\nLine line_bisection(const Line &s, const Line &t) {\\n\\tconst Point laglanju(is_ll(s, t));\\n\\tconst Point avec = !(abs(laglanju - s[0])<eps) ? s[0] - laglanju : s[1] - laglanju;\\n\\tconst Point bvec = !(abs(laglanju - t[0])<eps) ? t[0] - laglanju : t[1] - laglanju;\\n\\n\\treturn Line(laglanju, laglanju + (abs(bvec)*avec + abs(avec)*bvec) / (abs(avec) + abs(bvec)));\\n}\\n//点と点の垂直二等分線 aを左に見ながら\\nLine point_bisection(const Point&a, const Point&b) {\\n\\tconst Point cen((a + b) / 2.l);\\n\\tconst Point vec = (b - a)*Point(0, 1);\\n\\treturn Line(cen, cen + vec);\\n}\\n\\n//三つの点からなる外心\\nPoint outer_center(const vector<Point>&ps) {\\n\\tassert(ps.size() == 3);\\n\\tLine l1 = point_bisection(ps[0], ps[1]);\\n\\tLine l2 = point_bisection(ps[1], ps[2]);\\n\\treturn is_ll(l1, l2);\\n}\\n\\n\\n//三つの直線からなる内心\\n//三つの直線が並行でないことは確かめといてね\\nPoint inner_center(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tfor (int i = 0; i <static_cast<int>(ls.size()); ++i) {\\n\\t\\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\\n\\t}\\n\\tif (vertics[0] == vertics[1] || vertics[1] == vertics[2] || vertics[2] == vertics[0])return vertics[0];\\n\\tLine bi1(line_bisection(Line(vertics[0], vertics[1]), Line(vertics[0], vertics[2])));\\n\\tLine bi2(line_bisection(Line(vertics[1], vertics[2]), Line(vertics[1], vertics[0])));\\n\\tif (bi1[0] == bi2[0])return bi1[0];\\n\\telse {\\n\\t\\treturn is_ll(bi1, bi2);\\n\\t}\\n}\\n\\n//三つの直線からなる傍心\\n//三つの直線が並行でないことは確かめといてね\\nvector<Point> ex_center(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tfor (int i = 0; i < static_cast<int>(ls.size()); ++i) {\\n\\t\\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\\n\\t}\\n\\tif (abs(vertics[0] - vertics[1])<eps || abs(vertics[1] - vertics[2])<eps || (abs(vertics[2] - vertics[0])<eps))return vector<Point>();\\n\\tvector<Point>ecs;\\n\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\tLine bi1(line_bisection(Line(vertics[i], vertics[i] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[i], vertics[(i + 1) % 3])));\\n\\t\\tLine bi2(line_bisection(Line(vertics[(i + 1) % 3], vertics[(i + 1) % 3] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[(i + 1) % 3], vertics[i])));\\n\\t\\tecs.push_back(is_ll(bi1, bi2));\\n\\t}\\n\\treturn ecs;\\n}\\n\\n\\n//a,b:並行\\n//c:並行でない\\n//三つの直線から同距離の位置を求める。\\nvector<Point> same_dis(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tvertics.push_back(is_ll(ls[0], ls[2]));\\n\\tvertics.push_back(is_ll(ls[1], ls[2]));\\n\\n\\tif (abs(vertics[0] - vertics[1]) < eps)return vector<Point>{vertics[0]};\\n\\tLine bis(line_bisection(ls[0], ls[1]));\\n\\tvector<Point>ecs;\\n\\n\\tLine abi(line_bisection(Line(vertics[0], vertics[1]), ls[0]));\\n\\tecs.push_back(is_ll(bis, abi));\\n\\n\\n\\tLine bbi(line_bisection(Line(vertics[0], 2.l*vertics[0] - vertics[1]), ls[0]));\\n\\tecs.push_back(is_ll(bis, bbi));\\n\\n\\treturn ecs;\\n}\\n/* 円 */\\n\\n// 円と円の交点\\nvector<Point> is_cc(const Circle& c1, const Circle& c2) {\\n\\tvector<Point> res;\\n\\tld d = abs(c1.p - c2.p);\\n\\tld rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\\n\\tld dfr = c1.r * c1.r - rc * rc;\\n\\tif (abs(dfr) < eps) dfr = 0.0;\\n\\telse if (dfr < 0.0) return res; // no intersection\\n\\tld rs = sqrt(dfr);\\n\\tPoint diff = (c2.p - c1.p) / d;\\n\\tres.push_back(c1.p + diff * Point(rc, rs));\\n\\tif (dfr != 0.0) res.push_back(c1.p + diff * Point(rc, -rs));\\n\\treturn res;\\n}\\n\\n/*\\n点が円の中にいるか\\n0 => out\\n1 => on\\n2 => in*/\\nint is_in_Circle(const Point& p, const Circle &cir) {\\n\\tld dis = abs(cir.p - p);\\n\\tif (dis > cir.r + eps)return 0;\\n\\telse if (dis < cir.r - eps)return 2;\\n\\telse return 1;\\n}\\nint is_in_Circle(const Circle &cir, const Point& p) {\\n\\tld dis = abs(cir.p - p);\\n\\tif (dis > cir.r + eps)return 0;\\n\\telse if (dis < cir.r - eps)return 2;\\n\\telse return 1;\\n}\\n/*\\n円lcが円rcの中にいるか\\n0 => out\\n1 => on\\n2 => in*/\\nint Circle_in_Circle(const Circle &lc, const Circle&rc) {\\n\\tld dis = abs(lc.p - rc.p);\\n\\tif (dis < rc.r - lc.r - eps)return 2;\\n\\telse if (dis>rc.r - lc.r + eps)return 0;\\n\\telse return 1;\\n}\\n\\n// 円と直線の交点\\nvector<Point> is_lc(const Circle& c, const Line& l) {\\n\\tvector<Point> res;\\n\\tld d = dist_lp(l, c.p);\\n\\tif (d < c.r + eps) {\\n\\t\\tld len = (d > c.r) ? 0.0 : sqrt(c.r * c.r - d * d); //safety;\\n\\t\\tPoint nor = (l.a - l.b) / abs(l.a - l.b);\\n\\t\\tres.push_back(proj(l, c.p) + len * nor);\\n\\t\\tres.push_back(proj(l, c.p) - len * nor);\\n\\t}\\n\\treturn res;\\n}\\n\\n// 円と線分の距離\\nvector<Point> is_sc(const Circle& c, const Line& l) {\\n\\tvector<Point> v = is_lc(c, l), res;\\n\\tfor (Point p : v)\\n\\t\\tif (isis_sp(l, p)) res.push_back(p);\\n\\treturn res;\\n}\\n\\n// 円と点の接線\\nvector<Line> tangent_cp(const Circle& c, const Point& p) {\\n\\tvector<Line> ret;\\n\\tPoint v = c.p - p;\\n\\tld d = abs(v);\\n\\tld l = sqrt(norm(v) - c.r * c.r);\\n\\tif (isnan(l)) { return ret; }\\n\\tPoint v1 = v * Point(l / d, c.r / d);\\n\\tPoint v2 = v * Point(l / d, -c.r / d);\\n\\tret.push_back(Line(p, p + v1));\\n\\tif (l < eps) return ret;\\n\\tret.push_back(Line(p, p + v2));\\n\\treturn ret;\\n}\\n\\n// 円と円の接線\\nvector<Line> tangent_cc(const Circle& c1, const Circle& c2) {\\n\\tvector<Line> ret;\\n\\tif (abs(c1.p - c2.p) - (c1.r + c2.r) > -eps) {\\n\\t\\tPoint center = (c1.p * c2.r + c2.p * c1.r) / (c1.r + c2.r);\\n\\t\\tret = tangent_cp(c1, center);\\n\\t}\\n\\tif (abs(c1.r - c2.r) > eps) {\\n\\t\\tPoint out = (-c1.p * c2.r + c2.p * c1.r) / (c1.r - c2.r);\\n\\t\\tvector<Line> nret = tangent_cp(c1, out);\\n\\t\\tret.insert(ret.end(), nret.begin(), nret.end());\\n\\t}\\n\\telse {\\n\\t\\tPoint v = c2.p - c1.p;\\n\\t\\tv /= abs(v);\\n\\t\\tPoint q1 = c1.p + v * Point(0, 1) * c1.r;\\n\\t\\tPoint q2 = c1.p + v * Point(0, -1) * c1.r;\\n\\t\\tret.push_back(Line(q1, q1 + v));\\n\\t\\tret.push_back(Line(q2, q2 + v));\\n\\t}\\n\\treturn ret;\\n}\\n//二つの円の重なり面積\\nld two_Circle_area(const Circle&l, const Circle&r) {\\n\\tld dis = abs(l.p - r.p);\\n\\tif (dis > l.r + r.r)return 0;\\n\\telse if (dis + r.r < l.r) {\\n\\t\\treturn r.r*r.r*pi;\\n\\t}\\n\\telse if (dis + l.r < r.r) {\\n\\t\\treturn l.r*l.r*pi;\\n\\t}\\n\\telse {\\n\\t\\tld ans = (l.r)*(l.r)*acos((dis*dis + l.r*l.r - r.r*r.r) / (2 * dis*l.r)) +\\n\\t\\t\\t(r.r)*(r.r)*acos((dis*dis + r.r*r.r - l.r*l.r) / (2 * dis*r.r)) -\\n\\t\\t\\tsqrt(4 * dis*dis*l.r*l.r - (dis*dis + l.r*l.r - r.r*r.r)*(dis*dis + l.r*l.r - r.r*r.r)) / 2;\\n\\t\\treturn ans;\\n\\t}\\n\\n}\\n\\n/* 多角形 */\\n\\ntypedef vector<Point> Polygon;\\n\\n\\n// 面積\\nld get_area(const Polygon &p) {\\n\\tld res = 0;\\n\\tint n = p.size();\\n\\tfor (int j = 0; j<n; ++j) res += cross(p[j], p[(j + 1) % n]);\\n\\treturn res / 2;\\n}\\n\\n// 円の内外判定\\n/*0 => out\\n1 => on\\n2 => in*/\\nint convex_contains(const Polygon &poly, const Point& p) {\\n\\tld angle = 0;\\n\\tint n = poly.size();\\n\\tfor(int i=0;i<n;++i) {\\n\\t\\tPoint a = poly[i], b = poly[(i + 1) % n];\\n\\t\\tif (isis_sp(Line(a, b), p)) return 1;\\n\\t\\tangle += arg((b - p) / (a - p));\\n\\t}\\n\\treturn eq(angle, 0) ? 0 : 2;\\n}\\n\\n\\nstruct Edge {\\n\\tint src;\\n\\tint dest;\\n};\\nusing Graph=vector<vector<Edge>>;\\n\\n//線分アレンジメント後に、\\n//閉路の面積の和を求める。\\nvoid dfs(set<pair<int ,int>>&aset,const int now, const int from, vector<int>&prevs, vector<Polygon>&ans_polys, const vector<Point>&ps, const Graph&g) {\\n\\tvector<pair<ld, int>>next_points;\\n\\n\\tPoint from_p = from == -1 ? ps[now] + Point(-3e6, 0) : ps[from];\\n\\tPoint now_p = ps[now];\\n\\tfor (auto e : g[now]) {\\n\\t\\tif (e.dest == from)continue;\\n\\t\\tPoint next_p = ps[e.dest];\\n\\n\\t\\tld costheta = dot(from_p - now_p, next_p - now_p) / (abs(from_p - now_p)*abs(next_p - now_p));\\n\\t\\tcostheta *= 0.3;\\n\\t\\tld d = acos(costheta);\\n\\t\\tif (ccw(from_p, now_p, next_p) != 1) {\\n\\t\\t\\td = 2 * pi - d;\\n\\t\\t}\\n\\t\\tnext_points.push_back(make_pair(d, e.dest));\\n\\t}\\n\\tsort(next_points.begin(), next_points.end());\\n\\n\\tfor (auto n_p : next_points) {\\n\\t\\tif (aset.find(make_pair(now, n_p.second))!=aset.end()) {\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\taset.emplace(now,n_p.second);\\n\\t\\t}\\n\\n\\t\\tif (prevs[n_p.second] != -1) {\\n\\t\\t\\tint k=now;\\n\\t\\t\\tPolygon poly(1,ps[k]);\\n\\t\\t\\twhile (k != n_p.second) {\\n\\t\\t\\t\\tk=prevs[k];\\n\\t\\t\\t\\tpoly.push_back(ps[k]);\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tld plus = get_area(poly);\\n\\t\\t\\tif (plus<eps) {\\n\\t\\t\\t\\treverse(poly.begin(),poly.end());\\n\\t\\t\\t\\tans_polys.push_back(poly);\\n\\t\\t\\t}\\n\\t\\t\\tthrow(false);\\n\\t\\t}\\n\\t\\telse {\\n\\n\\t\\t\\tprevs[n_p.second] = now;\\n\\t\\t\\tdfs(aset, n_p.second, now, prevs, ans_polys, ps, g);\\n\\t\\t\\tprevs[n_p.second] = -1;\\n\\t\\t}\\n\\n\\t}\\n\\treturn ;\\n}\\n\\nint main() {\\n\\twhile (true) {\\n\\t\\tint N,M;cin>>N>>M;\\n\\t\\tif(!N)break;\\n\\t\\tvector<Circle>cs;\\n\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\tint x,y,r;cin>>x>>y>>r;\\n\\t\\t\\tcs.push_back(Circle(Point(x,y),r));\\n\\t\\t}\\n\\t\\tvector<vector<Edge>>edges(N);\\n\\t\\tGraph g(N);\\n\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\tfor (int j = i + 1; j < N; ++j) {\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tld dis=abs(cs[i].p-cs[j].p);\\n\\t\\t\\t\\tif (Circle_in_Circle(cs[i], cs[j])==0&&Circle_in_Circle(cs[j],cs[i])==0&&dis<cs[i].r+cs[j].r) {\\n\\t\\t\\t\\t\\tedges[i].push_back(Edge{ i,j });\\n\\t\\t\\t\\t\\tedges[j].push_back(Edge{ j,i });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvector<Point>ps(N);\\n\\t\\tfor(int i=0;i<N;++i)ps[i]=cs[i].p;\\n\\n\\t\\tvector<Polygon>polys;\\n\\t\\tset<pair<int,int>>aset;\\n\\n\\t\\tfor(int i=0;i<N;++i) {\\n\\t\\t\\tfor (int j = 0; j < edges[i].size();++j) {\\n\\t\\t\\t\\tif (aset.find(make_pair(i, j)) == aset.end()) {\\n\\t\\t\\t\\t\\ttry {\\n\\t\\t\\t\\t\\t\\tvector<int>prevs(N, -1);\\n\\t\\t\\t\\t\\t\\tprevs[i] = -2;\\n\\t\\t\\t\\t\\t\\tdfs(aset, i, -1, prevs, polys, ps, edges);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tcatch (...) {\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tfor (int i = 0; i < M; ++i) {\\n\\t\\t\\tvector<Point>query_points;\\n\\t\\t\\t{\\n\\t\\t\\t\\tint a,b,c,d;cin>>a>>b>>c>>d;\\n\\t\\t\\t\\tPoint p,q;\\n\\t\\t\\t\\tp=Point(a,b);\\n\\t\\t\\t\\tq=Point(c,d);\\n\\t\\t\\t\\tquery_points = vector<Point>{ p,q };\\n\\t\\t\\t}\\n\\t\\t\\tvector<vector<int>>in_circles(2);\\n\\t\\t\\tfor (int j = 0; j < 2; ++j) {\\n\\t\\t\\t\\tfor (int k = 0; k < N; ++k) {\\n\\t\\t\\t\\t\\tif (is_in_Circle(cs[k], query_points[j])) {\\n\\t\\t\\t\\t\\t\\tin_circles[j].push_back(true);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tin_circles[j].push_back(false);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tbool ok;\\n\\t\\t\\tif (in_circles[0] != in_circles[1]) {\\n\\t\\t\\t\\tok=false;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tif (all_of(in_circles[0].begin(), in_circles[0].end(), [](const int a) {return a == 0; })) {\\n\\t\\t\\t\\t\\tvector<vector<int>>in_polygons(2,vector<int>(polys.size()));\\n\\t\\t\\t\\t\\tfor (int j = 0; j < 2; ++j) {\\n\\t\\t\\t\\t\\t\\tfor (int k = 0; k < polys.size(); ++k) {\\n\\t\\t\\t\\t\\t\\t\\tif (convex_contains(polys[k], query_points[j])) {\\n\\t\\t\\t\\t\\t\\t\\t\\tin_polygons[j][k] = true;\\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\\tif (in_polygons[0] == in_polygons[1]) {\\n\\t\\t\\t\\t\\t\\tok=true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tok=false;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tok=true;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\t\\t\\tif(ok)cout<<\\\"YES\\\";\\n\\t\\t\\telse cout<<\\\"NO\\\";\\n\\t\\t\\tif(i==M-1)cout<<endl;\\n\\t\\t\\telse cout<<\\\" \\\";\\n\\t\\t\\t\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.5,\n \"time_ms\": 70,\n \"memory_kb\": 3360,\n \"score_of_the_acc\": -0.0563,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1198_2999426\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstring>\\n#include <iostream>\\n#include <string>\\n#include <cmath>\\n#include <bitset>\\n#include <vector>\\n#include <map>\\n#include <set>\\n#include <queue>\\n#include <deque>\\n#include <algorithm>\\n#include <fstream>\\n#define EPS 1e-10\\n \\nusing namespace std;\\ntypedef long long int ll;\\n \\nconst double PI=acos(-1.0);\\n \\ndouble add(double a, double b){\\n if(abs(a+b)<EPS*(abs(a)+abs(b))) return 0;\\n return a+b;\\n}\\n \\nstruct P{\\n double x, y;\\n P() {}\\n P(double x, double y): x(x), y(y){\\n }\\n P operator+ (P p){\\n return P(add(x, p.x), add(y, p.y));\\n }\\n P operator- (P p){\\n return P(add(x, -p.x), add(y, -p.y));\\n }\\n P operator* (double d){\\n return P(x*d, y*d);\\n }\\n double dot(P p){\\n return add(x*p.x, y*p.y);\\n }\\n double det(P p){\\n return add(x*p.y, -y*p.x);\\n }\\n bool operator< (const P& p) const{\\n if(abs(x-p.x)>EPS){\\n return x<p.x;\\n }else{\\n return y<p.y-EPS;\\n }\\n }\\n};\\n \\nbool on_seg(P p1, P p2, P q){\\n return (p1-q).det(p2-q)==0 && (p1-q).dot(p2-q)<=0;\\n}\\n \\nP intersection(P p1, P p2, P q1, P q2){\\n return p1+(p2-p1)*((q2-q1).det(q1-p1) / (q2-q1).det(p2-p1));\\n}\\n \\ndouble dist(P p1, P p2){\\n return sqrt((p1-p2).dot(p1-p2));\\n}\\n \\nbool in_polygon(vector<P> poly, P p){ //内ならtrue、多角形は反時計回り\\n int ct=0;\\n P inf=P(cos(1.0)*20000.0, sin(1.0)*20000.0);\\n int N=poly.size();\\n for(int i=0; i<N-1; i++){\\n P q=intersection(poly[i], poly[i+1], p, inf);\\n if(on_seg(poly[i], poly[i+1], q) && on_seg(p, inf, q)) ct++;\\n }\\n P q=intersection(poly[N-1], poly[0], p, inf);\\n if(on_seg(poly[N-1], poly[0], q) && on_seg(p, inf, q)) ct++;\\n if(ct%2==0){\\n return false;\\n }else{\\n return true;\\n }\\n}\\n \\nint n;\\nP c[102];\\nbool nn[102][102];\\nvector<int> v[102];\\n \\nvector<int> min_polygon0(P p, int j, int i){\\n bool vec=0;\\n if((c[i]-c[j]).det(p-c[j])>0) vec=1;\\n vector<int> ppoly;\\n ppoly.push_back(i);\\n int i1=i, j1=j;\\n int ct=1;\\n while(ct<=n+3){\\n int i2;\\n double ang0;\\n ang0=3.0*PI;\\n for(int l=0; l<v[i1].size(); l++){\\n int x=v[i1][l];\\n if(x==j1) continue;\\n if(nn[i1][x]==1) continue;\\n double cs=((c[j1]-c[i1]).dot(c[x]-c[i1]))/(dist(c[j1], c[i1])*dist(c[x], c[i1]));\\n double ang;\\n if(abs(cs+1.0)<EPS){\\n ang=PI;\\n }else if(abs(cs-1.0)<EPS){\\n ang=0;\\n }else{\\n ang=acos(cs);\\n\\t }\\n if((c[j1]-c[i1]).det(c[x]-c[i1])<0){\\n ang=2.0*PI-ang;\\n }\\n\\t if(vec==1){\\n\\t\\t ang=2.0*PI-ang;\\n\\t }\\n if(ang0>ang){\\n ang0=ang;\\n i2=x;\\n }\\n }\\n j1=i1;\\n i1=i2;\\n ppoly.push_back(i2);\\n ct++;\\n if(i1==j){\\n break;\\n }\\n }\\n vector<P> ppoly1;\\n for(int i=0; i<ppoly.size(); i++){\\n ppoly1.push_back(c[ppoly[i]]);\\n }\\n if(ct>=n+3 || in_polygon(ppoly1, p)==false){\\n vector<int> emp;\\n return emp;\\n }else{\\n return ppoly;\\n }\\n}\\n \\nvector<int> min_polygon(P p){\\n for(int i=0; i<n; i++){\\n for(int j=0; j<v[i].size(); j++){\\n int x=v[i][j];\\n if(nn[i][x]==1) continue;\\n P mid=(c[i]+c[x])*0.5;\\n bool e0=0;\\n for(int k=0; k<n; k++){\\n for(int l=0; l<v[k].size(); l++){\\n int y=v[k][l];\\n if(nn[k][y]==1) continue;\\n if((k==i && y==x) || (k==x && y==i)) continue;\\n if((mid-p).det(c[k]-c[y])==0){\\n if(on_seg(mid, p, c[k]) || on_seg(mid, p, c[y]) || on_seg(c[k], c[y], mid) || on_seg(c[k], c[y], p)){\\n e0=1;\\n break;\\n }\\n }else{\\n P r=intersection(mid, p, c[k], c[y]);\\n if(on_seg(mid, p, r) && on_seg(c[k], c[y], r)){\\n e0=1;\\n break;\\n }\\n }\\n }\\n if(e0==1) break;\\n }\\n if(e0==0){\\n vector<int> ppoly=min_polygon0(p, i, x);\\n if(!ppoly.empty()){\\n return ppoly;\\n }\\n }\\n }\\n }\\n vector<int> emp;\\n return emp;\\n}\\n \\nint main()\\n{\\n while(1){\\n int m;\\n cin>>n>>m;\\n if(n==0 && m==0) return 0;\\n double r[100];\\n for(int i=0; i<n; i++){\\n double cx, cy;\\n cin>>cx>>cy>>r[i];\\n c[i]=P(cx, cy);\\n }\\n for(int i=0; i<100; i++){\\n v[i].clear();\\n }\\n for(int i=0; i<n; i++){\\n for(int j=i+1; j<n; j++){\\n double d=dist(c[i], c[j]);\\n if(abs(r[i]-r[j])<d && d<(r[i]+r[j])){\\n v[i].push_back(j);\\n v[j].push_back(i);\\n }\\n }\\n }\\n\\n\\t for(int i=0; i<n; i++){\\n for(int j=0; j<n; j++){\\n nn[i][j]=0;\\n\\t\\t }\\n }\\n\\t for(int t=0; t<3*n; t++){\\n for(int i=0; i<n; i++){\\n\\t\\t\\tint ct=0;\\n\\t\\t\\t for(int j=0; j<v[i].size(); j++){\\n\\t\\t\\t\\tif(nn[i][v[i][j]]==1) continue;\\n\\t\\t\\t\\tct++;\\n\\t\\t\\t }\\n if(ct==1){\\n int j2;\\n for(int j=0; j<v[i].size(); j++){\\n\\t\\t\\t\\tif(nn[i][v[i][j]]==1) continue;\\n\\t\\t\\t\\tj2=v[i][j];\\n\\t\\t\\t}\\n nn[i][j2]=1;\\n nn[j2][i]=1;\\n \\n }\\n }\\n\\t }\\n for(int k=0; k<m; k++){\\n P p, q;\\n double px, py, qx, qy;\\n cin>>px>>py>>qx>>qy;\\n p=P(px, py), q=P(qx, qy);\\n bool ep[100], eq[100];\\n bool e=0, e0=0;\\n for(int i=0; i<n; i++){\\n if(dist(p, c[i])<r[i]){\\n ep[i]=1;\\n e0=1;\\n }else{\\n ep[i]=0;\\n }\\n if(dist(q, c[i])<r[i]){\\n eq[i]=1;\\n e0=1;\\n }else{\\n eq[i]=0;\\n }\\n if(ep[i]!=eq[i]){\\n if(k==m-1){\\n cout<<\\\"NO\\\";\\n }else{\\n cout<<\\\"NO \\\";\\n }\\n e=1;\\n break;\\n }\\n }\\n if(e==1) continue;\\n if(e0==1){\\n if(k==m-1){\\n cout<<\\\"YES\\\";\\n }else{\\n cout<<\\\"YES \\\";\\n }\\n continue;\\n }\\n \\n vector<int> ppoly, qpoly;\\n ppoly=min_polygon(p);\\n qpoly=min_polygon(q);\\n if(ppoly.empty() && qpoly.empty()){\\n if(k==m-1){\\n cout<<\\\"YES\\\";\\n }else{\\n cout<<\\\"YES \\\";\\n }\\n continue;\\n }\\n if(ppoly.empty() || qpoly.empty()){\\n if(k==m-1){\\n cout<<\\\"NO\\\";\\n }else{\\n cout<<\\\"NO \\\";\\n }\\n continue;\\n }\\n if(ppoly.size()!=qpoly.size()){\\n if(k==m-1){\\n cout<<\\\"NO\\\";\\n }else{\\n cout<<\\\"NO \\\";\\n }\\n continue;\\n }\\n sort(ppoly.begin(), ppoly.end());\\n sort(qpoly.begin(), qpoly.end());\\n bool ok=0;\\n for(int i=0; i<ppoly.size(); i++){\\n if(ppoly[i]!=qpoly[i]){\\n ok=1;\\n break;\\n }\\n }\\n if(ok==0){\\n if(k==m-1){\\n cout<<\\\"YES\\\";\\n }else{\\n cout<<\\\"YES \\\";\\n }\\n }else{\\n if(k==m-1){\\n cout<<\\\"NO\\\";\\n }else{\\n cout<<\\\"NO \\\";\\n }\\n }\\n }\\n cout<<\\\"\\\\n\\\";\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3372,\n \"score_of_the_acc\": -0.0378,\n \"final_rank\": 3\n }\n]","isConversational":false}}},{"rowIdx":669,"cells":{"group_id":{"kind":"string","value":"aoj_1200_cpp"},"problem_description":{"kind":"string","value":"Problem A:\nGoldbach's Conjecture\nGoldbach's Conjecture:\nFor any even number\nn\ngreater than or equal to 4, there exists at least one pair of prime numbers\np\n1\nand\np\n2\nsuch that\nn\n=\np\n1\n+\np\n2\n.\nThis conjecture has not been proved nor refused yet. No one is sure whether this conjecture actually holds. However, one can find such a pair of prime numbers, if any, for a given even number. The problem here is to write a program that reports the number of all the pairs of prime numbers satisfying the condition in the conjecture for a given even number.\nA sequence of even numbers is given as input. Corresponding to each number, the program should output the number of pairs mentioned above. Notice that we are intereseted in the number of essentially different pairs and therefore you should not count (\np\n1\n,\np\n2\n) and (\np\n2\n,\np\n1\n) separately as two different pairs.\nInput\nAn integer is given in each input line. You may assume that each integer is even, and is greater than or equal to 4 and less than 2\n15\n. The end of the input is indicated by a number 0.\nOutput\nEach output line should contain an integer number. No other characters should appear in the output.\nSample Input\n6\n10\n12\n0\nOutput for the Sample Input\n1\n2\n1"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1200_11059833","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,a,b) for(int i=(a);i<(b);i++)\n\nvector<int> ans_table(const int LIM=(1<<16)){\n vector<int>res(LIM);\n vector<int> isP(LIM,1);\n vector<int>primes;\n isP[0]=isP[1]=0;\n rep(i,2,LIM){\n if(!isP[i])continue;\n for(int j=2*i;j<LIM;j+=i)isP[j]=0;\n primes.push_back(i);\n }\n for(int p:primes)for(int q:primes)if(p<=q&&p+q<LIM)res[p+q]++;\n return res;\n}\n\nint main(){\n auto ans = ans_table();\n int N;\n while(cin>>N,N){\n cout<<ans[N]<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3840,"score_of_the_acc":-0.1389,"final_rank":12},{"submission_id":"aoj_1200_10849396","code_snippet":"#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nbool isPrime(int n)\n{\n\tfor(int i = 2; i < n; i++)\n\t\tif((n%i)==0)\n\t\t\treturn false;\n\treturn true;\t\n}\n\nint main()\n{\n\tint n = 0;\n\t\n\t\n\twhile(true)\n\t{\n\t\tcin>>n;\n\n\t\tif(n == 0)\n\t\t\tbreak;\n\n\t\tvector <int> myArray;\n\t\tint c = 0;\n\n\t\tfor (int i = 2; i < n; i++)\n\t\t\tif(isPrime(i) == true)\n\t\t\t\tmyArray.push_back(i);\n\n\t\tfor(int j = 0; j < myArray.size(); j++)\n\t\t\tfor(int k = j; k < myArray.size(); k++)\n\t\t\t\tif((myArray[j] + myArray[k]) == n)\n\t\t\t\t\tc++;\n\n\t\tcout<<c<<endl;\n\t}\n\t\n\treturn 0;\n}","accuracy":1,"time_ms":1020,"memory_kb":3160,"score_of_the_acc":-0.258,"final_rank":16},{"submission_id":"aoj_1200_5004710","code_snippet":"#include <iostream>\n#include <vector>\n\nstd::vector<int> prime_list;\n\nbool prime(int n){\n for(int i=0;i<prime_list.size();i++){\n int p = prime_list[i];\n if(p == n){\n return true;\n }else if(n%p == 0){\n return false;\n }\n }\n int lastp = prime_list[prime_list.size()-1];\n for(int p=lastp;p<n;p+=2){\n if(prime(p) && (n%p==0)){\n return false;\n }\n }\n prime_list.push_back(n);\n return true;\n}\n\nint main(int argc, char**argv){\n int n;\n prime_list.push_back(3);\n while(true){\n std::cin >> n;\n if(n==0){\n break;\n }else if(n == 4){\n std::cout << 1 << std::endl;\n continue;\n }\n int c=0;\n for(int i=3;i<=(n/2);i+=2){\n if(prime(i) && prime(n-i)){\n c++;\n }\n }\n std::cout << c << std::endl;\n }\n return 0;\n}","accuracy":1,"time_ms":110,"memory_kb":3044,"score_of_the_acc":-0.1124,"final_rank":8},{"submission_id":"aoj_1200_3901420","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define P pair<int,int>\n#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)\n#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)\n#define TO(x,t,f) ((x)?(t):(f))\n#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9\n#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin()) //xi>=v x is sorted\n#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin()) //xi>v x is sorted\n#define NUM(x,v) (POSU(x,v)-POSL(x,v)) //x is sorted\n#define REV(x) (reverse(x.begin(),x.end())) //reverse\nll gcd(ll a,ll b){if(a%b==0)return b;return gcd(b,a%b);}\nll lcm(ll a,ll b){ll c=gcd(a,b);return ((a/c)*(b/c)*c);}\n#define NEXTP(x) next_permutation(x.begin(),x.end())\nconst ll INF=ll(1e18)+ll(7);\nconst ll MOD=1000000007LL;\n#define out(a) cout<<fixed<<setprecision((a))\n#define YesNo(a) cout<<((a)?\"Yes\":\"No\")<<endl;\n#define YESNO(a) cout<<((a)?\"YES\":\"NO\")<<endl;\n\nnamespace FastFourierTransform {\n\tusing real=double;\n \n\tstruct C {\n\treal x, y;\n \n\tC() : x(0), y(0) {}\n \n\tC(real x, real y) : x(x), y(y) {}\n \n\tinline C operator+(const C &c) const { return C(x + c.x, y + c.y); }\n \n\tinline C operator-(const C &c) const { return C(x - c.x, y - c.y); }\n \n\tinline C operator*(const C &c) const { return C(x * c.x - y * c.y, x * c.y + y * c.x); }\n \n\tinline C conj() const { return C(x, -y); }\n\t};\n \n\tconst real PI = acosl(-1);\n\tint base = 1;\n\tvector< C > rts = {{0, 0},\n\t\t\t\t\t {1, 0}};\n\tvector< int > rev = {0, 1};\n \n \n\tvoid ensure_base(int nbase) {\n\tif(nbase <= base) return;\n\trev.resize(1 << nbase);\n\trts.resize(1 << nbase);\n\tfor(int i = 0; i < (1 << nbase); i++) {\n\t\trev[i] = (rev[i >> 1] >> 1) + ((i & 1) << (nbase - 1));\n\t}\n\twhile(base < nbase) {\n\t\treal angle = PI * 2.0 / (1 << (base + 1));\n\t\tfor(int i = 1 << (base - 1); i < (1 << base); i++) {\n\t\trts[i << 1] = rts[i];\n\t\treal angle_i = angle * (2 * i + 1 - (1 << base));\n\t\trts[(i << 1) + 1] = C(cos(angle_i), sin(angle_i));\n\t\t}\n\t\t++base;\n\t}\n\t}\n \n\tvoid fft(vector< C > &a, int n) {\n\tassert((n & (n - 1)) == 0);\n\tint zeros = __builtin_ctz(n);\n\tensure_base(zeros);\n\tint shift = base - zeros;\n\tfor(int i = 0; i < n; i++) {\n\t\tif(i < (rev[i] >> shift)) {\n\t\tswap(a[i], a[rev[i] >> shift]);\n\t\t}\n\t}\n\tfor(int k = 1; k < n; k <<= 1) {\n\t\tfor(int i = 0; i < n; i += 2 * k) {\n\t\tfor(int j = 0; j < k; j++) {\n\t\t\tC z = a[i + j + k] * rts[j + k];\n\t\t\ta[i + j + k] = a[i + j] - z;\n\t\t\ta[i + j] = a[i + j] + z;\n\t\t}\n\t\t}\n\t}\n\t}\n \n\tvector< int64_t > multiply(const vector< int > &a, const vector< int > &b) {\n\tint need = (int) a.size() + (int) b.size() - 1;\n\tint nbase = 1;\n\twhile((1 << nbase) < need) nbase++;\n\tensure_base(nbase);\n\tint sz = 1 << nbase;\n\tvector< C > fa(sz);\n\tfor(int i = 0; i < sz; i++) {\n\t\tint x = (i < (int) a.size() ? a[i] : 0);\n\t\tint y = (i < (int) b.size() ? b[i] : 0);\n\t\tfa[i] = C(x, y);\n\t}\n\tfft(fa, sz);\n\tC r(0, -0.25 / (sz >> 1)), s(0, 1), t(0.5, 0);\n\tfor(int i = 0; i <= (sz >> 1); i++) {\n\t\tint j = (sz - i) & (sz - 1);\n\t\tC z = (fa[j] * fa[j] - (fa[i] * fa[i]).conj()) * r;\n\t\tfa[j] = (fa[i] * fa[i] - (fa[j] * fa[j]).conj()) * r;\n\t\tfa[i] = z;\n\t}\n\tfor(int i = 0; i < (sz >> 1); i++) {\n\t\tC A0 = (fa[i] + fa[i + (sz >> 1)]) * t;\n\t\tC A1 = (fa[i] - fa[i + (sz >> 1)]) * t * rts[(sz >> 1) + i];\n\t\tfa[i] = A0 + A1 * s;\n\t}\n\tfft(fa, sz >> 1);\n\tvector< int64_t > ret(need);\n\tfor(int i = 0; i < need; i++) {\n\t\tret[i] = llround(i & 1 ? fa[i >> 1].y : fa[i >> 1].x);\n\t}\n\treturn ret;\n\t}\n};\n\n\nint main(){\n\tvector<int> isp((1<<15)+1,1);\n\tisp[0]=isp[1]=0;\n\tFOR(i,2,(1<<15)+1){\n\t\tif(isp[i]){\n\t\t\tfor(int j=i*2;j<((1<<15)+1);j+=i){\n\t\t\t\tisp[j] = 0;\n\t\t\t}\n\t\t}\n\t}\n\tauto s = FastFourierTransform::multiply(isp, isp);\n\tint n;\n\twhile(cin>>n,n){\n\t\tint x=0;\n\t\tif((n/2)*2==n)x=n/2;\n\t\tcout << int(s[n]+isp[x])/2 << endl;\n\t}\n}","accuracy":1,"time_ms":10,"memory_kb":8216,"score_of_the_acc":-0.3692,"final_rank":18},{"submission_id":"aoj_1200_3337344","code_snippet":"#include<iostream>\n#include<cmath>\nusing namespace std;\n\nbool judgePrimeNumber( int a )\n{\n for( int i = 2; i <= sqrt(a); i++ )\n if( a % i == 0 )\n return false;\n return true;\n}\n\nint main()\n{\n int n;\n\n while( cin >> n )\n {\n if( n == 0 )\n break;\n\n int cnt = 0;\n for( int i = 2; i <= n / 2; i++ )\n if( judgePrimeNumber(i) && judgePrimeNumber(n-i) )\n cnt++;\n cout << cnt << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3084,"score_of_the_acc":-0.0991,"final_rank":5},{"submission_id":"aoj_1200_2827435","code_snippet":"#include <iostream>\n using namespace std;\nbool primes[1000000];\n\nvoid Sieve(){\n for(int i= 2; i < 1000000; i++){\n primes[i] = true;\n } \n primes[1] = false;\n \n for(int i = 2; i <= 1000; i++){\n if(primes[i] == true)\n for(int j=i; j*i <= 1000000;j++){\n primes[j*i] = false;\n }\n }\n}\n\nbool IsPrime(int x){\n return primes[x];\n}\n\nint main(void){\n int k;\nfor(k = 1; k > 0; k++){\n Sieve();\n int n, c = 0;\n cin >> n;\n if(n == 0) break;\n else{\n for(int i = 0; i <= n/2; i++){\n if(IsPrime(i)==true){\n if(IsPrime(n - i)==true) c++;\n }\n }\n cout << c << endl;\n }\n}\n \n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":4072,"score_of_the_acc":-0.1603,"final_rank":14},{"submission_id":"aoj_1200_2733896","code_snippet":"#include <iostream>\n#include <map>\n\nusing namespace std;\n\nmap<int, int> memo;\n\nbool is_prim(int n) {\n if (n == 1) return false;\n if (n == 2) return true;\n if ((n % 2) == 0) return false;\n\n // NOTE: Return cached result\n if (memo.find(n) != memo.end()) {\n return memo[n];\n }\n\n bool isPrime = true;\n\n for (int i = 3; i * i <= n; ++i) {\n // Check dividability\n if ((n % i) == 0) {\n isPrime = false;\n break;\n }\n }\n\n // NOTE: Cache result\n memo[n] = isPrime;\n\n return isPrime;\n}\n\nint count_prim(int n) {\n map<int, int> p;\n int r = 0;\n\n for(int i = 2; i <= n / 2; ++i) {\n // NOTE: only for debug\n // cout << i << \": \" << is_prim(i) << endl;\n // cout << n - i << \": \" << is_prim(n - i) << endl;\n if (is_prim(i) && is_prim(n - i)) {\n ++r;\n }\n }\n\n return r;\n}\n\nint main(int argc, char** argv) {\n int n;\n // NOTE: only for debug\n // cout << \"is_prim(1): \" << is_prim(1) << endl;\n // cout << \"is_prim(2): \" << is_prim(2) << endl;\n // cout << \"is_prim(3): \" << is_prim(3) << endl;\n // cout << \"is_prim(4): \" << is_prim(4) << endl;\n // cout << \"is_prim(5): \" << is_prim(5) << endl;\n // cout << \"is_prim(6): \" << is_prim(6) << endl;\n // cout << \"is_prim(7): \" << is_prim(7) << endl;\n // cout << \"is_prim(8): \" << is_prim(8) << endl;\n // cout << \"is_prim(9): \" << is_prim(9) << endl;\n // cout << \"is_prim(10): \" << is_prim(10) << endl;\n // cout << \"is_prim(11): \" << is_prim(11) << endl;\n // cout << \"is_prim(12): \" << is_prim(12) << endl;\n // cout << \"is_prim(13): \" << is_prim(13) << endl;\n // cout << \"is_prim(14): \" << is_prim(14) << endl;\n // cout << \"is_prim(15): \" << is_prim(15) << endl;\n // cout << \"is_prim(16): \" << is_prim(16) << endl;\n // cout << \"is_prim(17): \" << is_prim(17) << endl;\n // cout << \"is_prim(18): \" << is_prim(18) << endl;\n // cout << \"is_prim(19): \" << is_prim(19) << endl;\n // cout << \"is_prim(20): \" << is_prim(20) << endl;\n cin >> n;\n while (n != 0) {\n // Do here\n // cout << n << endl;\n int r = count_prim(n);\n cout << r << endl;\n\n cin >> n;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3720,"score_of_the_acc":-0.1326,"final_rank":11},{"submission_id":"aoj_1200_2300213","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing db = double;\nusing ll = long long;\nusing vi = vector <int>;\nusing vl = vector <ll>;\n//#define op operator\n#define pb push_back\n\nconst int N = 1e5L + 11;\nint p[N];\n\nusing comp = complex<db>; //??????comp????????¶??´: d /= 1.5, ld /= 3\nusing vc = vector<comp>; const db PI = atan(1.0L) * 4;\nvoid dft(vc &a, int op = 1) {\n\tint n = a.size();\n\tfor (int i = 1, j = 0; i < n - 1; ++i) {\n\t\tfor (int s = n; j ^= s >>= 1, ~j & s;) {}\n\t\tif (i < j) swap(a[i], a[j]);\n\t}\n\tfor (int i = 1; i < n; i *= 2) {\n\t\tcomp u = {cos(PI / i), op * sin(PI / i)};\n\t\tfor (int j = 0; j < n; j += i * 2) {\n\t\t\tcomp w = 1;\n\t\t\tfor (int k = 0; k < i; ++k, w = w * u) {\n\t\t\t\tcomp x = a[j + k], y = w * a[j + k + i];\n\t\t\t\ta[j + k] = x + y, a[j + k + i] = x - y;\n\t}}}\n\tif (op == -1) for (int i = 0; i < n; ++i) a[i] /= n;\n}\nvl multi(vl a, vl b) { // ????????????: d <= 1e12, ld <= 1e14\n\tint n = 1; while (n < a.size() + b.size() - 1) n *= 2;\n\tvc fa(n), fb(n), fc(n);\n\tcopy(a.begin(), a.end(), fa.begin()); dft(fa);\n\tcopy(b.begin(), b.end(), fb.begin()); dft(fb);\n\tfor (int i = 0; i < n; ++i) fc[i] = fa[i] * fb[i];\n\tdft(fc, -1); vl c(n);\n\tfor (int i = 0; i < n; ++i) c[i] = round(fc[i].real());\n\treturn c;\n}\n\nint main() {\n\tfor(int i = 2; i < N; i ++) if(!p[i])\n\t\tfor(int j = i; j < N; j += i) if(!p[j]) p[j] = i;\n\n\tcout << fixed << setprecision(9);\n\tios :: sync_with_stdio(0);\n\n\tvector <ll> v(N, 0);\n\tfor(int i = 2; i < N; i ++)\n\t\tv[i] = p[i] == i;\n\tv = multi(v, v);\n\n\tfor(int n; cin >> n && n; ) {\n\t\tcout << v[n] / 2 + (p[n / 2] == n / 2) << '\\n';\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":60,"memory_kb":20204,"score_of_the_acc":-1.0077,"final_rank":20},{"submission_id":"aoj_1200_2277789","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<cstdio>\n#include<cmath>\n#include<math.h>\n#include<string>\n#include<string.h>\n#include<stack>\n#include<queue>\n#include<vector>\n#include<utility>\n#include<set>\n#include<map>\n#include<stdlib.h>\n#include<iomanip>\n\nusing namespace std;\n\n#define ll long long\n#define ld long double\n#define EPS 0.0000000001\n#define INF 1e9\n#define MOD 1000000007\n#define rep(i,n) for(i=0;i<n;i++)\n#define loop(i,a,n) for(i=a;i<n;i++)\n#define all(in) in.begin(),in.end()\n#define shosu(x) fixed<<setprecision(x)\n\ntypedef vector<int> vi;\ntypedef pair<int,int> pii;\n\nint main(void) {\n int i,j;\n int n;\n vector<bool> prime(40000,true);\n\n for(i=2;i<40000;i++)\n if(prime[i])\n for(j=2;i*j<40000;j++)\n prime[i*j]=false;\n\n vi ans(40000,0);\n\n for(i=2;i<40000;i++)\n if(prime[i])\n for(j=i;j<40000;j++)\n if(prime[j] && i+j<40000)\n ans[i+j]++;\n\n while(1){\n cin>>n;\n if(n==0)break;\n cout<<ans[n]<<endl;\n }\n}","accuracy":1,"time_ms":150,"memory_kb":2988,"score_of_the_acc":-0.1156,"final_rank":9},{"submission_id":"aoj_1200_2246713","code_snippet":"#include <vector>\n#include <iostream>\n#include <utility>\n#include <algorithm>\n#include <string>\n#include <deque>\n#include <queue>\n#include <tuple>\n#include <queue>\n#include <functional>\n#include <cmath>\n#include <iomanip>\n#include <map>\n#include <set>\n#include <numeric>\n#include <unordered_map>\n#include <unordered_set>\n#include <complex>\n#include <iterator>\n#include <array>\n#include <memory>\n#include <stack>\n#define vi vector<int>\n#define vvi vector<vector<int> >\n#define ll long long int\n#define vl vector<ll>\n#define vvl vector<vector<ll>>\n#define vb vector<bool>\n#define vc vector<char>\n#define vs vector<string>\n#define ld long double\n#define INF 1e9\n#define EPS 0.0000000001\n#define rep(i,n) for(int i=0;i<n;i++)\n#define loop(i,s,n) for(int i=s;i<n;i++)\n#define all(in) in.begin(), in.end()\ntemplate<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }\ntemplate<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; }\n#define MAX 32768+10000\nusing namespace std;\ntypedef pair<int, int> pii;\ntypedef pair<double,double>pdd;\ntypedef pair<ll,ll>pll;\nint main(){\n int n;\n vector<bool>Primecheck(MAX+1,true);\n vector<int>Primenumber(MAX+1,0); //Primearray\n int Primecounter =0; //Primearray counter;\n for(int i = 2; i<MAX+1;i++){\n if(Primecheck[i]){\n for(int j = 2;i*j<MAX;j++)\n Primecheck[i*j] = false;//?´???°??????Primearray???????´??????????????????°?????¨???false???\n Primenumber[Primecounter] = i;\n Primecounter++;\n }\n }\n while(cin>>n,n){\n int ans=0;\n for(int i=0; i<Primecounter;i++){\n if(Primenumber[i]>n)break;\n for(int j=i; j<Primecounter;j++){\n if(Primenumber[j]>n)break;\n if(Primenumber[i]+Primenumber[j]==n)\n ans++;\n }\n }\n cout<<ans<<endl;\n ans=0;\n }\n}","accuracy":1,"time_ms":40,"memory_kb":2992,"score_of_the_acc":-0.0989,"final_rank":4},{"submission_id":"aoj_1200_2123551","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n int n,a[33000]={0,0,1,1},c,i,j;\n for(i=4;i<33000;i++){\n for(j=2,c=1;j*j<=i;j++){\n if(i%j==0)c--;\n }\n if(c>0)a[i]=1;\n else a[i]=0;\n }\n while(cin>>n,n){\n for(i=3,c=0;i<n;){\n for(j=n-1;j>2;){\n\tif(i+j==n)c++;\n\twhile(!a[--j]);\n }\n while(!a[++i]);\n }\n cout<<(c-1)/2+1<<endl;\n }\n}","accuracy":1,"time_ms":1550,"memory_kb":3132,"score_of_the_acc":-0.3379,"final_rank":17},{"submission_id":"aoj_1200_2123359","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nvector<int> pn;\nvector<bool> is_p;\n\nvoid enum_prime()\n{\n is_p.resize(1<<15, true);\n is_p[0] = is_p[1] = false;\n for(int i = 2; i < 1<<15; i++) {\n if(!is_p[i]) continue;\n pn.push_back(i);\n for(int j = i+i; j < 1<<15; j+=i) is_p[j] = false;\n }\n}\n\nint main()\n{\n int n;\n enum_prime();\n while(cin >> n, n) {\n int cnt = 0;\n for(int i = 0; i < pn.size() && pn[i] < n; i++) {\n for(int j= i; j < pn.size() && pn[i] + pn[j] <= n; j++) {\n\tif(pn[i] + pn[j] == n) cnt++;\n }\n }\n cout << cnt << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3100,"score_of_the_acc":-0.1015,"final_rank":7},{"submission_id":"aoj_1200_2123205","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nbool check(int n){\n if(n==1||n==0)return 0;\n for(int i=2;i*i<=n;i++) if(n%i==0)return 0;\n return 1;\n}\n\nint main(){\n int n;\n \n while(cin>>n,n){\n int cnt=0;\n for(int i=0;i<n;i++)\n if(check(i)&&check(n-i)&&i<=n-i)cnt++;\n cout <<cnt<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3096,"score_of_the_acc":-0.1013,"final_rank":6},{"submission_id":"aoj_1200_1953590","code_snippet":"#include <iostream>\n#include <string>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <map>\n#include <algorithm>\n#include <sstream>\n#include <cmath>\n#include <set>\n#include <cstdio>\n#include <iomanip>\n\nusing namespace std;\n\n#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)\n#define RREP(i,n) for(int (i)=(int)(n)-1;(i)>=0;(i)--)\n#define REMOVE(Itr,n) (Itr).erase(remove((Itr).begin(),(Itr).end(),n),(Itr).end())\n#define PB_VEC(Itr1,Itr2) (Itr1).insert((Itr1).end(),(Itr2).begin(),(Itr2).end())\n#define UNIQUE(Itr) sort((Itr).begin(),(Itr).end()); (Itr).erase(unique((Itr).begin(),(Itr).end()),(Itr).end())\n\ntypedef long long ll;\n\nbool isPrime(int n){\n if(n==1)return false;\n if(n==2)return true;\n for(int i=2;i<sqrt(n)+1;i++){\n if((n%i)==0)return false;\n }\n return true;\n}\n\n\nint main(){\n \n while(true)\n {\n int n;\n cin>>n;\n if(n==0)\n {\n break;\n }\n \n int ans=0;\n for(int i=2;i<=n/2;i++)\n {\n if(isPrime(i)&&isPrime(n-i))ans++;\n }\n \n cout<<ans<<endl;\n \n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":2984,"score_of_the_acc":-0.0939,"final_rank":3},{"submission_id":"aoj_1200_1946089","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <string>\n#include <vector>\n#include <deque>\n#include <list>\n#include <algorithm>\n#include <numeric>\n#include <functional>\n#include <cmath>\n#include <cstring>\n#include <cctype>\n#include <sstream>\n#include <set>\n#include <map>\n#include <stack>\n#include <queue>\n#include <complex>\nusing namespace std;\n#define REP(i,n) for(int i = 0; i < (int)n; i++)\n#define FOR(i,a,b) for(int i = a; i < (int)b; i++)\n#define pb push_back\n#define mp make_pair\ntypedef vector<int> vi;\ntypedef pair<int, int> pi;\ntypedef long long ll;\nconst int INF = 1<<28;\nconst ll MOD = 1000000007;\n\nint main() {\n\tvector<bool> prime(1<<15, true);\n\tprime[0] = prime[1] = false;\n\tFOR(i, 2, 1<<15) {\n\t\tif(prime[i]) {\n\t\t\tfor(int j=i*2; j < 1<<15; j += i)\n\t\t\t\tprime[j] = false;\n\t\t}\n\t}\n\tint n;\n\twhile(cin >> n, n) {\n\t\tint cnt = 0;\n\t\tREP(i, n) {\n\t\t\tif(prime[i] > n)\n\t\t\t\tbreak;\n\t\t\tFOR(j, i, n) {\n\t\t\t\tif(prime[j] > n)\n\t\t\t\t\tbreak;\n\t\t\t\tif(prime[i] && prime[j] && i + j == n) {\n\t\t\t\t\tcnt++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << cnt << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":6530,"memory_kb":1200,"score_of_the_acc":-1,"final_rank":19},{"submission_id":"aoj_1200_1895811","code_snippet":"#include<bits/stdc++.h>\n#define range(i,a,b) for(int i = (a); i < (b); i++)\n#define rep(i,b) range(i,0,b)\n#define pb(a) push_back(a)\n#define all(a) (a).begin(), (a).end()\n#define debug(x) cout << \"debug \" << x << endl;\nusing namespace std;\n\n#define N (1 << 15) \n\nint main(){\n bool prime[N] = {1,1,0};\n vector<int> v;\n rep(i,N){\n if(!prime[i]){\n v.pb(i);\n for(int j = i + i; j < N; j+=i){\n prime[j] = 1;\n }\n }\n }\n map<int, int> cnt;\n rep(i,v.size()){\n range(j,i,v.size()){\n cnt[v[i] + v[j]]++;\n }\n }\n int n;\n while(cin >> n,n){\n cout << cnt[n] << endl;\n }\n}","accuracy":1,"time_ms":390,"memory_kb":2964,"score_of_the_acc":-0.1511,"final_rank":13},{"submission_id":"aoj_1200_1892174","code_snippet":"#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <functional>\n#include <numeric>\n#include <stack>\n#include <queue>\n#include <map>\n#include <set>\n#include <utility>\n#include <sstream>\n#include <complex>\n#include <fstream>\n\nusing namespace std;\n\n#define FOR(i,a,b) for(long long i=(a);i<(b);i++)\n#define REP(i,N) for(long long i=0;i<(N);i++)\n#define ALL(s) (s).begin(),(s).end()\n#define fi first\n#define se second\n\n#define PI acos(-1.0)\n#define INF 10e7+9\n#define EPS 1e-10\n#define MAX_N 100100\n#define MAX_M 100100\n\ntypedef long long ll;\ntypedef pair<ll, ll> P;\ntypedef pair<double, double> PD;\ntypedef pair<string, ll> PS;\ntypedef vector<ll> V;\ntypedef pair<P, char> PC;\n\nint n;\nbool is_prime[100100];\nint prime[100100];\nint p = 0;\n\nint main(){\n\tfill(is_prime, is_prime + 100100, 1);\n\tis_prime[0] = is_prime[1] = 0;\n\tfor (int i = 2; i < 100100; i++){\n\t\tif (is_prime[i]){\n\t\t\tprime[p] = i;\n\t\t\tp++;\n\t\t\tfor (int j = i * 2; j < 100100; j += i){\n\t\t\t\tis_prime[j] = 0;\n\t\t\t}\n\t\t}\n\t}\n\twhile (cin >> n&&n){\n\t\tint ans = 0;\n\t\tREP(i, p){\n\t\t\tfor (int j = i; j < p; j++){\n\t\t\t\tif (prime[i] + prime[j] == n)ans++;\n\t\t\t}\n\t\t}\n\t\tcout << ans << endl;\n\t}\n}","accuracy":1,"time_ms":1320,"memory_kb":1296,"score_of_the_acc":-0.206,"final_rank":15},{"submission_id":"aoj_1200_1887188","code_snippet":"#include <bits/stdc++.h>\nusing namespace std ;\n\n#define pb(n) push_back(n)\n#define fi first\n#define se second\n#define all(r) (r).begin(),(r).end()\n#define gsort(st,en) sort((st),(en),greater<int>())\n#define vmax(ary) *max_element(all(ary))\n#define vmin(ary) *min_element(all(ary))\n#define debug(x) cout<<#x<<\": \"<<x<<endl\n#define fcout(n) cout<<fixed<<setprecision((n))\n#define scout(n) cout<<setw(n)\n#define vary(type,name,size,init) vector< type> name(size,init)\n\n#define rep(i,n) for(int i = 0; i < (int)(n);++i)\n#define REP(i,a,b) for(int i = (a);i < (int)(b);++i)\n#define repi(it,array) for(auto it = array.begin(),end = array.end(); it != end;++it)\n#define repa(n,array) for(auto &n :(array))\n\nusing ll = long long;\nusing vi = vector<int>;\nusing vl = vector<ll>;\nusing dict = map<string,int>;\nusing pii = pair<int,int> ;\n\nconstexpr int imax = ((1<<30)-1)*2+1 ;\nconstexpr int inf = 100000000;\nconstexpr double PI = acos(-1.0) ;\ndouble eps = 1e-10 ;\nconst int dy[] = {-1,0,1,0};\nconst int dx[] = {0,-1,0,1};\n\ninline bool value(int x,int y,int w,int h){\n return (x >= 0 && x < w && y >= 0 && y < h);\n}\n\ntemplate<typename T>\nvoid Unique(vector<T> &v){\n sort(all(v));\n v.erase(unique(all(v)),v.end());\n}\n\ntemplate<typename T>\nT ston(string& str, T n){\n istringstream sin(str) ;\n T num ;\n sin >> num ;\n return num ;\n}\n\nvoid Ans(bool f){\n if(f) cout << \"YES\"<<endl;\n else cout << \"NO\"<<endl;\n}\nconst int PrimeMax = 50001;\nint is_prime[PrimeMax];\nvoid Eratosthenes(int N){\n for(int i = 0; i < N; i++){\n is_prime[i] = 1;\n }\n is_prime[1] = 0;\n for(int i = 2; i < N ; i++){\n if(is_prime[i]){\n for(int j = 0; i * (j + 2) < N; j++){\n is_prime[i *(j + 2)] = 0;\n }\n }\n }\n}\nint ans[50001];\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n Eratosthenes(PrimeMax);\n vary(int,v,0,0);\n v.clear();\n rep(i,PrimeMax){\n if(is_prime[i] != 0){\n v.pb(i);\n }\n }\n REP(i,1,v.size()){\n REP(j,i,v.size()){\n if(v[i] + v[j] < PrimeMax){\n ans[v[i]+v[j]]++;\n }\n }\n }\n int n;\n while(cin >> n&&n){\n cout << ans[n] << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3532,"score_of_the_acc":-0.1227,"final_rank":10},{"submission_id":"aoj_1200_1885090","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define all(c) (c).begin(),(c).end()\n#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)\n#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)\n#define rep(i,n) REP(i,0,n)\n#define iter(c) __typeof((c).begin())\n#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)\n#define mem(a) memset(a,0,sizeof(a))\n#define pd(a) printf(\"%.10f\\n\",a)\n#define pb(a) push_back(a)\n#define in(a) insert(a)\n#define pi M_PI\n#define R cin>>\n#define F first\n#define S second\n#define C class\n#define ll long long\n#define ln cout<<'\\n'\ntemplate<C T>void pr(T a){cout<<a;ln;}\ntemplate<C T,C T2>void pr(T a,T2 b){cout<<a<<' '<<b;ln;}\ntemplate<C T,C T2,C T3>void pr(T a,T2 b,T3 c){cout<<a<<' '<<b<<' '<<c;ln;}\ntemplate<C T>void PR(T a,int n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}\nbool check(int n,int m,int x,int y){return x>=0&&x<n&&y>=0&&y<m;}\nconst ll MAX=1000000007,MAXL=1LL<<60,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};\ntypedef pair<int,int> P;\n\nvector<int> sieve(int n) {\n vector<int> p(n);\n REP(i,2,n) p[i]=i;\n for(int i=2; i*i<n; i++) {\n if(p[i]) {\n for(int j=i*i; j<n; j+=i) p[j]=0;\n }\n }\n p.erase(remove(all(p),0),p.end());\n return p;\n}\n\nvoid Main() {\n vector<int> p=sieve(33000);\n int n;\n while(R n && n) {\n int ans=0;\n rep(i,p.size()) {\n REP(j,i,p.size()) {\n if(p[i]+p[j]>n) break;\n if(n==p[i]+p[j]) ans++;\n }\n }\n pr(ans);\n }\n}\n\nint main() {\n ios::sync_with_stdio(0);cin.tie(0);\n Main();return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":1268,"score_of_the_acc":-0.0082,"final_rank":1},{"submission_id":"aoj_1200_1885088","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define all(c) (c).begin(),(c).end()\n#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)\n#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)\n#define rep(i,n) REP(i,0,n)\n#define iter(c) __typeof((c).begin())\n#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)\n#define mem(a) memset(a,0,sizeof(a))\n#define pd(a) printf(\"%.10f\\n\",a)\n#define pb(a) push_back(a)\n#define in(a) insert(a)\n#define pi M_PI\n#define R cin>>\n#define F first\n#define S second\n#define C class\n#define ll long long\n#define ln cout<<'\\n'\ntemplate<C T>void pr(T a){cout<<a;ln;}\ntemplate<C T,C T2>void pr(T a,T2 b){cout<<a<<' '<<b;ln;}\ntemplate<C T,C T2,C T3>void pr(T a,T2 b,T3 c){cout<<a<<' '<<b<<' '<<c;ln;}\ntemplate<C T>void PR(T a,int n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}\nbool check(int n,int m,int x,int y){return x>=0&&x<n&&y>=0&&y<m;}\nconst ll MAX=1000000007,MAXL=1LL<<60,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};\ntypedef pair<int,int> P;\n\nvector<int> sieve(int n) {\n vector<int> p(n);\n REP(i,2,n) p[i]=i;\n for(int i=2; i*i<n; i++) {\n if(p[i]) {\n for(int j=i*i; j<n; j+=i) p[j]=0;\n }\n }\n p.erase(remove(all(p),0),p.end());\n return p;\n}\n\nvoid Main() {\n vector<int> p=sieve(33000);\n int n;\n while(R n && n) {\n int ans=0;\n rep(i,p.size()) {\n REP(j,i,p.size()) {\n if(n==p[i]+p[j]) ans++;\n }\n }\n pr(ans);\n }\n}\n\nint main() {\n ios::sync_with_stdio(0);cin.tie(0);\n Main();return 0;\n}","accuracy":1,"time_ms":160,"memory_kb":1268,"score_of_the_acc":-0.0266,"final_rank":2}],"string":"[\n {\n \"submission_id\": \"aoj_1200_11059833\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i,a,b) for(int i=(a);i<(b);i++)\\n\\nvector<int> ans_table(const int LIM=(1<<16)){\\n vector<int>res(LIM);\\n vector<int> isP(LIM,1);\\n vector<int>primes;\\n isP[0]=isP[1]=0;\\n rep(i,2,LIM){\\n if(!isP[i])continue;\\n for(int j=2*i;j<LIM;j+=i)isP[j]=0;\\n primes.push_back(i);\\n }\\n for(int p:primes)for(int q:primes)if(p<=q&&p+q<LIM)res[p+q]++;\\n return res;\\n}\\n\\nint main(){\\n auto ans = ans_table();\\n int N;\\n while(cin>>N,N){\\n cout<<ans[N]<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3840,\n \"score_of_the_acc\": -0.1389,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1200_10849396\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n\\nusing namespace std;\\n\\nbool isPrime(int n)\\n{\\n\\tfor(int i = 2; i < n; i++)\\n\\t\\tif((n%i)==0)\\n\\t\\t\\treturn false;\\n\\treturn true;\\t\\n}\\n\\nint main()\\n{\\n\\tint n = 0;\\n\\t\\n\\t\\n\\twhile(true)\\n\\t{\\n\\t\\tcin>>n;\\n\\n\\t\\tif(n == 0)\\n\\t\\t\\tbreak;\\n\\n\\t\\tvector <int> myArray;\\n\\t\\tint c = 0;\\n\\n\\t\\tfor (int i = 2; i < n; i++)\\n\\t\\t\\tif(isPrime(i) == true)\\n\\t\\t\\t\\tmyArray.push_back(i);\\n\\n\\t\\tfor(int j = 0; j < myArray.size(); j++)\\n\\t\\t\\tfor(int k = j; k < myArray.size(); k++)\\n\\t\\t\\t\\tif((myArray[j] + myArray[k]) == n)\\n\\t\\t\\t\\t\\tc++;\\n\\n\\t\\tcout<<c<<endl;\\n\\t}\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1020,\n \"memory_kb\": 3160,\n \"score_of_the_acc\": -0.258,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1200_5004710\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n\\nstd::vector<int> prime_list;\\n\\nbool prime(int n){\\n for(int i=0;i<prime_list.size();i++){\\n int p = prime_list[i];\\n if(p == n){\\n return true;\\n }else if(n%p == 0){\\n return false;\\n }\\n }\\n int lastp = prime_list[prime_list.size()-1];\\n for(int p=lastp;p<n;p+=2){\\n if(prime(p) && (n%p==0)){\\n return false;\\n }\\n }\\n prime_list.push_back(n);\\n return true;\\n}\\n\\nint main(int argc, char**argv){\\n int n;\\n prime_list.push_back(3);\\n while(true){\\n std::cin >> n;\\n if(n==0){\\n break;\\n }else if(n == 4){\\n std::cout << 1 << std::endl;\\n continue;\\n }\\n int c=0;\\n for(int i=3;i<=(n/2);i+=2){\\n if(prime(i) && prime(n-i)){\\n c++;\\n }\\n }\\n std::cout << c << std::endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 3044,\n \"score_of_the_acc\": -0.1124,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1200_3901420\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\n#define P pair<int,int>\\n#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)\\n#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)\\n#define TO(x,t,f) ((x)?(t):(f))\\n#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9\\n#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin()) //xi>=v x is sorted\\n#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin()) //xi>v x is sorted\\n#define NUM(x,v) (POSU(x,v)-POSL(x,v)) //x is sorted\\n#define REV(x) (reverse(x.begin(),x.end())) //reverse\\nll gcd(ll a,ll b){if(a%b==0)return b;return gcd(b,a%b);}\\nll lcm(ll a,ll b){ll c=gcd(a,b);return ((a/c)*(b/c)*c);}\\n#define NEXTP(x) next_permutation(x.begin(),x.end())\\nconst ll INF=ll(1e18)+ll(7);\\nconst ll MOD=1000000007LL;\\n#define out(a) cout<<fixed<<setprecision((a))\\n#define YesNo(a) cout<<((a)?\\\"Yes\\\":\\\"No\\\")<<endl;\\n#define YESNO(a) cout<<((a)?\\\"YES\\\":\\\"NO\\\")<<endl;\\n\\nnamespace FastFourierTransform {\\n\\tusing real=double;\\n \\n\\tstruct C {\\n\\treal x, y;\\n \\n\\tC() : x(0), y(0) {}\\n \\n\\tC(real x, real y) : x(x), y(y) {}\\n \\n\\tinline C operator+(const C &c) const { return C(x + c.x, y + c.y); }\\n \\n\\tinline C operator-(const C &c) const { return C(x - c.x, y - c.y); }\\n \\n\\tinline C operator*(const C &c) const { return C(x * c.x - y * c.y, x * c.y + y * c.x); }\\n \\n\\tinline C conj() const { return C(x, -y); }\\n\\t};\\n \\n\\tconst real PI = acosl(-1);\\n\\tint base = 1;\\n\\tvector< C > rts = {{0, 0},\\n\\t\\t\\t\\t\\t {1, 0}};\\n\\tvector< int > rev = {0, 1};\\n \\n \\n\\tvoid ensure_base(int nbase) {\\n\\tif(nbase <= base) return;\\n\\trev.resize(1 << nbase);\\n\\trts.resize(1 << nbase);\\n\\tfor(int i = 0; i < (1 << nbase); i++) {\\n\\t\\trev[i] = (rev[i >> 1] >> 1) + ((i & 1) << (nbase - 1));\\n\\t}\\n\\twhile(base < nbase) {\\n\\t\\treal angle = PI * 2.0 / (1 << (base + 1));\\n\\t\\tfor(int i = 1 << (base - 1); i < (1 << base); i++) {\\n\\t\\trts[i << 1] = rts[i];\\n\\t\\treal angle_i = angle * (2 * i + 1 - (1 << base));\\n\\t\\trts[(i << 1) + 1] = C(cos(angle_i), sin(angle_i));\\n\\t\\t}\\n\\t\\t++base;\\n\\t}\\n\\t}\\n \\n\\tvoid fft(vector< C > &a, int n) {\\n\\tassert((n & (n - 1)) == 0);\\n\\tint zeros = __builtin_ctz(n);\\n\\tensure_base(zeros);\\n\\tint shift = base - zeros;\\n\\tfor(int i = 0; i < n; i++) {\\n\\t\\tif(i < (rev[i] >> shift)) {\\n\\t\\tswap(a[i], a[rev[i] >> shift]);\\n\\t\\t}\\n\\t}\\n\\tfor(int k = 1; k < n; k <<= 1) {\\n\\t\\tfor(int i = 0; i < n; i += 2 * k) {\\n\\t\\tfor(int j = 0; j < k; j++) {\\n\\t\\t\\tC z = a[i + j + k] * rts[j + k];\\n\\t\\t\\ta[i + j + k] = a[i + j] - z;\\n\\t\\t\\ta[i + j] = a[i + j] + z;\\n\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t}\\n \\n\\tvector< int64_t > multiply(const vector< int > &a, const vector< int > &b) {\\n\\tint need = (int) a.size() + (int) b.size() - 1;\\n\\tint nbase = 1;\\n\\twhile((1 << nbase) < need) nbase++;\\n\\tensure_base(nbase);\\n\\tint sz = 1 << nbase;\\n\\tvector< C > fa(sz);\\n\\tfor(int i = 0; i < sz; i++) {\\n\\t\\tint x = (i < (int) a.size() ? a[i] : 0);\\n\\t\\tint y = (i < (int) b.size() ? b[i] : 0);\\n\\t\\tfa[i] = C(x, y);\\n\\t}\\n\\tfft(fa, sz);\\n\\tC r(0, -0.25 / (sz >> 1)), s(0, 1), t(0.5, 0);\\n\\tfor(int i = 0; i <= (sz >> 1); i++) {\\n\\t\\tint j = (sz - i) & (sz - 1);\\n\\t\\tC z = (fa[j] * fa[j] - (fa[i] * fa[i]).conj()) * r;\\n\\t\\tfa[j] = (fa[i] * fa[i] - (fa[j] * fa[j]).conj()) * r;\\n\\t\\tfa[i] = z;\\n\\t}\\n\\tfor(int i = 0; i < (sz >> 1); i++) {\\n\\t\\tC A0 = (fa[i] + fa[i + (sz >> 1)]) * t;\\n\\t\\tC A1 = (fa[i] - fa[i + (sz >> 1)]) * t * rts[(sz >> 1) + i];\\n\\t\\tfa[i] = A0 + A1 * s;\\n\\t}\\n\\tfft(fa, sz >> 1);\\n\\tvector< int64_t > ret(need);\\n\\tfor(int i = 0; i < need; i++) {\\n\\t\\tret[i] = llround(i & 1 ? fa[i >> 1].y : fa[i >> 1].x);\\n\\t}\\n\\treturn ret;\\n\\t}\\n};\\n\\n\\nint main(){\\n\\tvector<int> isp((1<<15)+1,1);\\n\\tisp[0]=isp[1]=0;\\n\\tFOR(i,2,(1<<15)+1){\\n\\t\\tif(isp[i]){\\n\\t\\t\\tfor(int j=i*2;j<((1<<15)+1);j+=i){\\n\\t\\t\\t\\tisp[j] = 0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tauto s = FastFourierTransform::multiply(isp, isp);\\n\\tint n;\\n\\twhile(cin>>n,n){\\n\\t\\tint x=0;\\n\\t\\tif((n/2)*2==n)x=n/2;\\n\\t\\tcout << int(s[n]+isp[x])/2 << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 8216,\n \"score_of_the_acc\": -0.3692,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1200_3337344\",\n \"code_snippet\": \"#include<iostream>\\n#include<cmath>\\nusing namespace std;\\n\\nbool judgePrimeNumber( int a )\\n{\\n for( int i = 2; i <= sqrt(a); i++ )\\n if( a % i == 0 )\\n return false;\\n return true;\\n}\\n\\nint main()\\n{\\n int n;\\n\\n while( cin >> n )\\n {\\n if( n == 0 )\\n break;\\n\\n int cnt = 0;\\n for( int i = 2; i <= n / 2; i++ )\\n if( judgePrimeNumber(i) && judgePrimeNumber(n-i) )\\n cnt++;\\n cout << cnt << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3084,\n \"score_of_the_acc\": -0.0991,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1200_2827435\",\n \"code_snippet\": \"#include <iostream>\\n using namespace std;\\nbool primes[1000000];\\n\\nvoid Sieve(){\\n for(int i= 2; i < 1000000; i++){\\n primes[i] = true;\\n } \\n primes[1] = false;\\n \\n for(int i = 2; i <= 1000; i++){\\n if(primes[i] == true)\\n for(int j=i; j*i <= 1000000;j++){\\n primes[j*i] = false;\\n }\\n }\\n}\\n\\nbool IsPrime(int x){\\n return primes[x];\\n}\\n\\nint main(void){\\n int k;\\nfor(k = 1; k > 0; k++){\\n Sieve();\\n int n, c = 0;\\n cin >> n;\\n if(n == 0) break;\\n else{\\n for(int i = 0; i <= n/2; i++){\\n if(IsPrime(i)==true){\\n if(IsPrime(n - i)==true) c++;\\n }\\n }\\n cout << c << endl;\\n }\\n}\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 4072,\n \"score_of_the_acc\": -0.1603,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1200_2733896\",\n \"code_snippet\": \"#include <iostream>\\n#include <map>\\n\\nusing namespace std;\\n\\nmap<int, int> memo;\\n\\nbool is_prim(int n) {\\n if (n == 1) return false;\\n if (n == 2) return true;\\n if ((n % 2) == 0) return false;\\n\\n // NOTE: Return cached result\\n if (memo.find(n) != memo.end()) {\\n return memo[n];\\n }\\n\\n bool isPrime = true;\\n\\n for (int i = 3; i * i <= n; ++i) {\\n // Check dividability\\n if ((n % i) == 0) {\\n isPrime = false;\\n break;\\n }\\n }\\n\\n // NOTE: Cache result\\n memo[n] = isPrime;\\n\\n return isPrime;\\n}\\n\\nint count_prim(int n) {\\n map<int, int> p;\\n int r = 0;\\n\\n for(int i = 2; i <= n / 2; ++i) {\\n // NOTE: only for debug\\n // cout << i << \\\": \\\" << is_prim(i) << endl;\\n // cout << n - i << \\\": \\\" << is_prim(n - i) << endl;\\n if (is_prim(i) && is_prim(n - i)) {\\n ++r;\\n }\\n }\\n\\n return r;\\n}\\n\\nint main(int argc, char** argv) {\\n int n;\\n // NOTE: only for debug\\n // cout << \\\"is_prim(1): \\\" << is_prim(1) << endl;\\n // cout << \\\"is_prim(2): \\\" << is_prim(2) << endl;\\n // cout << \\\"is_prim(3): \\\" << is_prim(3) << endl;\\n // cout << \\\"is_prim(4): \\\" << is_prim(4) << endl;\\n // cout << \\\"is_prim(5): \\\" << is_prim(5) << endl;\\n // cout << \\\"is_prim(6): \\\" << is_prim(6) << endl;\\n // cout << \\\"is_prim(7): \\\" << is_prim(7) << endl;\\n // cout << \\\"is_prim(8): \\\" << is_prim(8) << endl;\\n // cout << \\\"is_prim(9): \\\" << is_prim(9) << endl;\\n // cout << \\\"is_prim(10): \\\" << is_prim(10) << endl;\\n // cout << \\\"is_prim(11): \\\" << is_prim(11) << endl;\\n // cout << \\\"is_prim(12): \\\" << is_prim(12) << endl;\\n // cout << \\\"is_prim(13): \\\" << is_prim(13) << endl;\\n // cout << \\\"is_prim(14): \\\" << is_prim(14) << endl;\\n // cout << \\\"is_prim(15): \\\" << is_prim(15) << endl;\\n // cout << \\\"is_prim(16): \\\" << is_prim(16) << endl;\\n // cout << \\\"is_prim(17): \\\" << is_prim(17) << endl;\\n // cout << \\\"is_prim(18): \\\" << is_prim(18) << endl;\\n // cout << \\\"is_prim(19): \\\" << is_prim(19) << endl;\\n // cout << \\\"is_prim(20): \\\" << is_prim(20) << endl;\\n cin >> n;\\n while (n != 0) {\\n // Do here\\n // cout << n << endl;\\n int r = count_prim(n);\\n cout << r << endl;\\n\\n cin >> n;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3720,\n \"score_of_the_acc\": -0.1326,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1200_2300213\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing db = double;\\nusing ll = long long;\\nusing vi = vector <int>;\\nusing vl = vector <ll>;\\n//#define op operator\\n#define pb push_back\\n\\nconst int N = 1e5L + 11;\\nint p[N];\\n\\nusing comp = complex<db>; //??????comp????????¶??´: d /= 1.5, ld /= 3\\nusing vc = vector<comp>; const db PI = atan(1.0L) * 4;\\nvoid dft(vc &a, int op = 1) {\\n\\tint n = a.size();\\n\\tfor (int i = 1, j = 0; i < n - 1; ++i) {\\n\\t\\tfor (int s = n; j ^= s >>= 1, ~j & s;) {}\\n\\t\\tif (i < j) swap(a[i], a[j]);\\n\\t}\\n\\tfor (int i = 1; i < n; i *= 2) {\\n\\t\\tcomp u = {cos(PI / i), op * sin(PI / i)};\\n\\t\\tfor (int j = 0; j < n; j += i * 2) {\\n\\t\\t\\tcomp w = 1;\\n\\t\\t\\tfor (int k = 0; k < i; ++k, w = w * u) {\\n\\t\\t\\t\\tcomp x = a[j + k], y = w * a[j + k + i];\\n\\t\\t\\t\\ta[j + k] = x + y, a[j + k + i] = x - y;\\n\\t}}}\\n\\tif (op == -1) for (int i = 0; i < n; ++i) a[i] /= n;\\n}\\nvl multi(vl a, vl b) { // ????????????: d <= 1e12, ld <= 1e14\\n\\tint n = 1; while (n < a.size() + b.size() - 1) n *= 2;\\n\\tvc fa(n), fb(n), fc(n);\\n\\tcopy(a.begin(), a.end(), fa.begin()); dft(fa);\\n\\tcopy(b.begin(), b.end(), fb.begin()); dft(fb);\\n\\tfor (int i = 0; i < n; ++i) fc[i] = fa[i] * fb[i];\\n\\tdft(fc, -1); vl c(n);\\n\\tfor (int i = 0; i < n; ++i) c[i] = round(fc[i].real());\\n\\treturn c;\\n}\\n\\nint main() {\\n\\tfor(int i = 2; i < N; i ++) if(!p[i])\\n\\t\\tfor(int j = i; j < N; j += i) if(!p[j]) p[j] = i;\\n\\n\\tcout << fixed << setprecision(9);\\n\\tios :: sync_with_stdio(0);\\n\\n\\tvector <ll> v(N, 0);\\n\\tfor(int i = 2; i < N; i ++)\\n\\t\\tv[i] = p[i] == i;\\n\\tv = multi(v, v);\\n\\n\\tfor(int n; cin >> n && n; ) {\\n\\t\\tcout << v[n] / 2 + (p[n / 2] == n / 2) << '\\\\n';\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 20204,\n \"score_of_the_acc\": -1.0077,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1200_2277789\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<cstdio>\\n#include<cmath>\\n#include<math.h>\\n#include<string>\\n#include<string.h>\\n#include<stack>\\n#include<queue>\\n#include<vector>\\n#include<utility>\\n#include<set>\\n#include<map>\\n#include<stdlib.h>\\n#include<iomanip>\\n\\nusing namespace std;\\n\\n#define ll long long\\n#define ld long double\\n#define EPS 0.0000000001\\n#define INF 1e9\\n#define MOD 1000000007\\n#define rep(i,n) for(i=0;i<n;i++)\\n#define loop(i,a,n) for(i=a;i<n;i++)\\n#define all(in) in.begin(),in.end()\\n#define shosu(x) fixed<<setprecision(x)\\n\\ntypedef vector<int> vi;\\ntypedef pair<int,int> pii;\\n\\nint main(void) {\\n int i,j;\\n int n;\\n vector<bool> prime(40000,true);\\n\\n for(i=2;i<40000;i++)\\n if(prime[i])\\n for(j=2;i*j<40000;j++)\\n prime[i*j]=false;\\n\\n vi ans(40000,0);\\n\\n for(i=2;i<40000;i++)\\n if(prime[i])\\n for(j=i;j<40000;j++)\\n if(prime[j] && i+j<40000)\\n ans[i+j]++;\\n\\n while(1){\\n cin>>n;\\n if(n==0)break;\\n cout<<ans[n]<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 2988,\n \"score_of_the_acc\": -0.1156,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1200_2246713\",\n \"code_snippet\": \"#include <vector>\\n#include <iostream>\\n#include <utility>\\n#include <algorithm>\\n#include <string>\\n#include <deque>\\n#include <queue>\\n#include <tuple>\\n#include <queue>\\n#include <functional>\\n#include <cmath>\\n#include <iomanip>\\n#include <map>\\n#include <set>\\n#include <numeric>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <complex>\\n#include <iterator>\\n#include <array>\\n#include <memory>\\n#include <stack>\\n#define vi vector<int>\\n#define vvi vector<vector<int> >\\n#define ll long long int\\n#define vl vector<ll>\\n#define vvl vector<vector<ll>>\\n#define vb vector<bool>\\n#define vc vector<char>\\n#define vs vector<string>\\n#define ld long double\\n#define INF 1e9\\n#define EPS 0.0000000001\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define loop(i,s,n) for(int i=s;i<n;i++)\\n#define all(in) in.begin(), in.end()\\ntemplate<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }\\ntemplate<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; }\\n#define MAX 32768+10000\\nusing namespace std;\\ntypedef pair<int, int> pii;\\ntypedef pair<double,double>pdd;\\ntypedef pair<ll,ll>pll;\\nint main(){\\n int n;\\n vector<bool>Primecheck(MAX+1,true);\\n vector<int>Primenumber(MAX+1,0); //Primearray\\n int Primecounter =0; //Primearray counter;\\n for(int i = 2; i<MAX+1;i++){\\n if(Primecheck[i]){\\n for(int j = 2;i*j<MAX;j++)\\n Primecheck[i*j] = false;//?´???°??????Primearray???????´??????????????????°?????¨???false???\\n Primenumber[Primecounter] = i;\\n Primecounter++;\\n }\\n }\\n while(cin>>n,n){\\n int ans=0;\\n for(int i=0; i<Primecounter;i++){\\n if(Primenumber[i]>n)break;\\n for(int j=i; j<Primecounter;j++){\\n if(Primenumber[j]>n)break;\\n if(Primenumber[i]+Primenumber[j]==n)\\n ans++;\\n }\\n }\\n cout<<ans<<endl;\\n ans=0;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 2992,\n \"score_of_the_acc\": -0.0989,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1200_2123551\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint main(){\\n int n,a[33000]={0,0,1,1},c,i,j;\\n for(i=4;i<33000;i++){\\n for(j=2,c=1;j*j<=i;j++){\\n if(i%j==0)c--;\\n }\\n if(c>0)a[i]=1;\\n else a[i]=0;\\n }\\n while(cin>>n,n){\\n for(i=3,c=0;i<n;){\\n for(j=n-1;j>2;){\\n\\tif(i+j==n)c++;\\n\\twhile(!a[--j]);\\n }\\n while(!a[++i]);\\n }\\n cout<<(c-1)/2+1<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1550,\n \"memory_kb\": 3132,\n \"score_of_the_acc\": -0.3379,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1200_2123359\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nvector<int> pn;\\nvector<bool> is_p;\\n\\nvoid enum_prime()\\n{\\n is_p.resize(1<<15, true);\\n is_p[0] = is_p[1] = false;\\n for(int i = 2; i < 1<<15; i++) {\\n if(!is_p[i]) continue;\\n pn.push_back(i);\\n for(int j = i+i; j < 1<<15; j+=i) is_p[j] = false;\\n }\\n}\\n\\nint main()\\n{\\n int n;\\n enum_prime();\\n while(cin >> n, n) {\\n int cnt = 0;\\n for(int i = 0; i < pn.size() && pn[i] < n; i++) {\\n for(int j= i; j < pn.size() && pn[i] + pn[j] <= n; j++) {\\n\\tif(pn[i] + pn[j] == n) cnt++;\\n }\\n }\\n cout << cnt << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3100,\n \"score_of_the_acc\": -0.1015,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1200_2123205\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nbool check(int n){\\n if(n==1||n==0)return 0;\\n for(int i=2;i*i<=n;i++) if(n%i==0)return 0;\\n return 1;\\n}\\n\\nint main(){\\n int n;\\n \\n while(cin>>n,n){\\n int cnt=0;\\n for(int i=0;i<n;i++)\\n if(check(i)&&check(n-i)&&i<=n-i)cnt++;\\n cout <<cnt<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3096,\n \"score_of_the_acc\": -0.1013,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1200_1953590\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <vector>\\n#include <queue>\\n#include <stack>\\n#include <map>\\n#include <algorithm>\\n#include <sstream>\\n#include <cmath>\\n#include <set>\\n#include <cstdio>\\n#include <iomanip>\\n\\nusing namespace std;\\n\\n#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)\\n#define RREP(i,n) for(int (i)=(int)(n)-1;(i)>=0;(i)--)\\n#define REMOVE(Itr,n) (Itr).erase(remove((Itr).begin(),(Itr).end(),n),(Itr).end())\\n#define PB_VEC(Itr1,Itr2) (Itr1).insert((Itr1).end(),(Itr2).begin(),(Itr2).end())\\n#define UNIQUE(Itr) sort((Itr).begin(),(Itr).end()); (Itr).erase(unique((Itr).begin(),(Itr).end()),(Itr).end())\\n\\ntypedef long long ll;\\n\\nbool isPrime(int n){\\n if(n==1)return false;\\n if(n==2)return true;\\n for(int i=2;i<sqrt(n)+1;i++){\\n if((n%i)==0)return false;\\n }\\n return true;\\n}\\n\\n\\nint main(){\\n \\n while(true)\\n {\\n int n;\\n cin>>n;\\n if(n==0)\\n {\\n break;\\n }\\n \\n int ans=0;\\n for(int i=2;i<=n/2;i++)\\n {\\n if(isPrime(i)&&isPrime(n-i))ans++;\\n }\\n \\n cout<<ans<<endl;\\n \\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 2984,\n \"score_of_the_acc\": -0.0939,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1200_1946089\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <string>\\n#include <vector>\\n#include <deque>\\n#include <list>\\n#include <algorithm>\\n#include <numeric>\\n#include <functional>\\n#include <cmath>\\n#include <cstring>\\n#include <cctype>\\n#include <sstream>\\n#include <set>\\n#include <map>\\n#include <stack>\\n#include <queue>\\n#include <complex>\\nusing namespace std;\\n#define REP(i,n) for(int i = 0; i < (int)n; i++)\\n#define FOR(i,a,b) for(int i = a; i < (int)b; i++)\\n#define pb push_back\\n#define mp make_pair\\ntypedef vector<int> vi;\\ntypedef pair<int, int> pi;\\ntypedef long long ll;\\nconst int INF = 1<<28;\\nconst ll MOD = 1000000007;\\n\\nint main() {\\n\\tvector<bool> prime(1<<15, true);\\n\\tprime[0] = prime[1] = false;\\n\\tFOR(i, 2, 1<<15) {\\n\\t\\tif(prime[i]) {\\n\\t\\t\\tfor(int j=i*2; j < 1<<15; j += i)\\n\\t\\t\\t\\tprime[j] = false;\\n\\t\\t}\\n\\t}\\n\\tint n;\\n\\twhile(cin >> n, n) {\\n\\t\\tint cnt = 0;\\n\\t\\tREP(i, n) {\\n\\t\\t\\tif(prime[i] > n)\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tFOR(j, i, n) {\\n\\t\\t\\t\\tif(prime[j] > n)\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\tif(prime[i] && prime[j] && i + j == n) {\\n\\t\\t\\t\\t\\tcnt++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << cnt << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6530,\n \"memory_kb\": 1200,\n \"score_of_the_acc\": -1,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1200_1895811\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define range(i,a,b) for(int i = (a); i < (b); i++)\\n#define rep(i,b) range(i,0,b)\\n#define pb(a) push_back(a)\\n#define all(a) (a).begin(), (a).end()\\n#define debug(x) cout << \\\"debug \\\" << x << endl;\\nusing namespace std;\\n\\n#define N (1 << 15) \\n\\nint main(){\\n bool prime[N] = {1,1,0};\\n vector<int> v;\\n rep(i,N){\\n if(!prime[i]){\\n v.pb(i);\\n for(int j = i + i; j < N; j+=i){\\n prime[j] = 1;\\n }\\n }\\n }\\n map<int, int> cnt;\\n rep(i,v.size()){\\n range(j,i,v.size()){\\n cnt[v[i] + v[j]]++;\\n }\\n }\\n int n;\\n while(cin >> n,n){\\n cout << cnt[n] << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 390,\n \"memory_kb\": 2964,\n \"score_of_the_acc\": -0.1511,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1200_1892174\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <vector>\\n#include <algorithm>\\n#include <cmath>\\n#include <cstdio>\\n#include <functional>\\n#include <numeric>\\n#include <stack>\\n#include <queue>\\n#include <map>\\n#include <set>\\n#include <utility>\\n#include <sstream>\\n#include <complex>\\n#include <fstream>\\n\\nusing namespace std;\\n\\n#define FOR(i,a,b) for(long long i=(a);i<(b);i++)\\n#define REP(i,N) for(long long i=0;i<(N);i++)\\n#define ALL(s) (s).begin(),(s).end()\\n#define fi first\\n#define se second\\n\\n#define PI acos(-1.0)\\n#define INF 10e7+9\\n#define EPS 1e-10\\n#define MAX_N 100100\\n#define MAX_M 100100\\n\\ntypedef long long ll;\\ntypedef pair<ll, ll> P;\\ntypedef pair<double, double> PD;\\ntypedef pair<string, ll> PS;\\ntypedef vector<ll> V;\\ntypedef pair<P, char> PC;\\n\\nint n;\\nbool is_prime[100100];\\nint prime[100100];\\nint p = 0;\\n\\nint main(){\\n\\tfill(is_prime, is_prime + 100100, 1);\\n\\tis_prime[0] = is_prime[1] = 0;\\n\\tfor (int i = 2; i < 100100; i++){\\n\\t\\tif (is_prime[i]){\\n\\t\\t\\tprime[p] = i;\\n\\t\\t\\tp++;\\n\\t\\t\\tfor (int j = i * 2; j < 100100; j += i){\\n\\t\\t\\t\\tis_prime[j] = 0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\twhile (cin >> n&&n){\\n\\t\\tint ans = 0;\\n\\t\\tREP(i, p){\\n\\t\\t\\tfor (int j = i; j < p; j++){\\n\\t\\t\\t\\tif (prime[i] + prime[j] == n)ans++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << ans << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1320,\n \"memory_kb\": 1296,\n \"score_of_the_acc\": -0.206,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1200_1887188\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std ;\\n\\n#define pb(n) push_back(n)\\n#define fi first\\n#define se second\\n#define all(r) (r).begin(),(r).end()\\n#define gsort(st,en) sort((st),(en),greater<int>())\\n#define vmax(ary) *max_element(all(ary))\\n#define vmin(ary) *min_element(all(ary))\\n#define debug(x) cout<<#x<<\\\": \\\"<<x<<endl\\n#define fcout(n) cout<<fixed<<setprecision((n))\\n#define scout(n) cout<<setw(n)\\n#define vary(type,name,size,init) vector< type> name(size,init)\\n\\n#define rep(i,n) for(int i = 0; i < (int)(n);++i)\\n#define REP(i,a,b) for(int i = (a);i < (int)(b);++i)\\n#define repi(it,array) for(auto it = array.begin(),end = array.end(); it != end;++it)\\n#define repa(n,array) for(auto &n :(array))\\n\\nusing ll = long long;\\nusing vi = vector<int>;\\nusing vl = vector<ll>;\\nusing dict = map<string,int>;\\nusing pii = pair<int,int> ;\\n\\nconstexpr int imax = ((1<<30)-1)*2+1 ;\\nconstexpr int inf = 100000000;\\nconstexpr double PI = acos(-1.0) ;\\ndouble eps = 1e-10 ;\\nconst int dy[] = {-1,0,1,0};\\nconst int dx[] = {0,-1,0,1};\\n\\ninline bool value(int x,int y,int w,int h){\\n return (x >= 0 && x < w && y >= 0 && y < h);\\n}\\n\\ntemplate<typename T>\\nvoid Unique(vector<T> &v){\\n sort(all(v));\\n v.erase(unique(all(v)),v.end());\\n}\\n\\ntemplate<typename T>\\nT ston(string& str, T n){\\n istringstream sin(str) ;\\n T num ;\\n sin >> num ;\\n return num ;\\n}\\n\\nvoid Ans(bool f){\\n if(f) cout << \\\"YES\\\"<<endl;\\n else cout << \\\"NO\\\"<<endl;\\n}\\nconst int PrimeMax = 50001;\\nint is_prime[PrimeMax];\\nvoid Eratosthenes(int N){\\n for(int i = 0; i < N; i++){\\n is_prime[i] = 1;\\n }\\n is_prime[1] = 0;\\n for(int i = 2; i < N ; i++){\\n if(is_prime[i]){\\n for(int j = 0; i * (j + 2) < N; j++){\\n is_prime[i *(j + 2)] = 0;\\n }\\n }\\n }\\n}\\nint ans[50001];\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n Eratosthenes(PrimeMax);\\n vary(int,v,0,0);\\n v.clear();\\n rep(i,PrimeMax){\\n if(is_prime[i] != 0){\\n v.pb(i);\\n }\\n }\\n REP(i,1,v.size()){\\n REP(j,i,v.size()){\\n if(v[i] + v[j] < PrimeMax){\\n ans[v[i]+v[j]]++;\\n }\\n }\\n }\\n int n;\\n while(cin >> n&&n){\\n cout << ans[n] << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3532,\n \"score_of_the_acc\": -0.1227,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1200_1885090\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define all(c) (c).begin(),(c).end()\\n#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)\\n#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)\\n#define rep(i,n) REP(i,0,n)\\n#define iter(c) __typeof((c).begin())\\n#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)\\n#define mem(a) memset(a,0,sizeof(a))\\n#define pd(a) printf(\\\"%.10f\\\\n\\\",a)\\n#define pb(a) push_back(a)\\n#define in(a) insert(a)\\n#define pi M_PI\\n#define R cin>>\\n#define F first\\n#define S second\\n#define C class\\n#define ll long long\\n#define ln cout<<'\\\\n'\\ntemplate<C T>void pr(T a){cout<<a;ln;}\\ntemplate<C T,C T2>void pr(T a,T2 b){cout<<a<<' '<<b;ln;}\\ntemplate<C T,C T2,C T3>void pr(T a,T2 b,T3 c){cout<<a<<' '<<b<<' '<<c;ln;}\\ntemplate<C T>void PR(T a,int n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}\\nbool check(int n,int m,int x,int y){return x>=0&&x<n&&y>=0&&y<m;}\\nconst ll MAX=1000000007,MAXL=1LL<<60,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};\\ntypedef pair<int,int> P;\\n\\nvector<int> sieve(int n) {\\n vector<int> p(n);\\n REP(i,2,n) p[i]=i;\\n for(int i=2; i*i<n; i++) {\\n if(p[i]) {\\n for(int j=i*i; j<n; j+=i) p[j]=0;\\n }\\n }\\n p.erase(remove(all(p),0),p.end());\\n return p;\\n}\\n\\nvoid Main() {\\n vector<int> p=sieve(33000);\\n int n;\\n while(R n && n) {\\n int ans=0;\\n rep(i,p.size()) {\\n REP(j,i,p.size()) {\\n if(p[i]+p[j]>n) break;\\n if(n==p[i]+p[j]) ans++;\\n }\\n }\\n pr(ans);\\n }\\n}\\n\\nint main() {\\n ios::sync_with_stdio(0);cin.tie(0);\\n Main();return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 1268,\n \"score_of_the_acc\": -0.0082,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1200_1885088\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define all(c) (c).begin(),(c).end()\\n#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)\\n#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)\\n#define rep(i,n) REP(i,0,n)\\n#define iter(c) __typeof((c).begin())\\n#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)\\n#define mem(a) memset(a,0,sizeof(a))\\n#define pd(a) printf(\\\"%.10f\\\\n\\\",a)\\n#define pb(a) push_back(a)\\n#define in(a) insert(a)\\n#define pi M_PI\\n#define R cin>>\\n#define F first\\n#define S second\\n#define C class\\n#define ll long long\\n#define ln cout<<'\\\\n'\\ntemplate<C T>void pr(T a){cout<<a;ln;}\\ntemplate<C T,C T2>void pr(T a,T2 b){cout<<a<<' '<<b;ln;}\\ntemplate<C T,C T2,C T3>void pr(T a,T2 b,T3 c){cout<<a<<' '<<b<<' '<<c;ln;}\\ntemplate<C T>void PR(T a,int n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}\\nbool check(int n,int m,int x,int y){return x>=0&&x<n&&y>=0&&y<m;}\\nconst ll MAX=1000000007,MAXL=1LL<<60,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};\\ntypedef pair<int,int> P;\\n\\nvector<int> sieve(int n) {\\n vector<int> p(n);\\n REP(i,2,n) p[i]=i;\\n for(int i=2; i*i<n; i++) {\\n if(p[i]) {\\n for(int j=i*i; j<n; j+=i) p[j]=0;\\n }\\n }\\n p.erase(remove(all(p),0),p.end());\\n return p;\\n}\\n\\nvoid Main() {\\n vector<int> p=sieve(33000);\\n int n;\\n while(R n && n) {\\n int ans=0;\\n rep(i,p.size()) {\\n REP(j,i,p.size()) {\\n if(n==p[i]+p[j]) ans++;\\n }\\n }\\n pr(ans);\\n }\\n}\\n\\nint main() {\\n ios::sync_with_stdio(0);cin.tie(0);\\n Main();return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 1268,\n \"score_of_the_acc\": -0.0266,\n \"final_rank\": 2\n }\n]","isConversational":false}}},{"rowIdx":670,"cells":{"group_id":{"kind":"string","value":"aoj_1202_cpp"},"problem_description":{"kind":"string","value":"Problem C:\nMobile Phone Coverage\nA mobile phone company ACMICPC (Advanced Cellular, Mobile, and Internet-Connected Phone Corporation) is planning to set up a collection of antennas for mobile phones in a city called Maxnorm. The company ACMICPC has several collections for locations of antennas as their candidate plans, and now they want to know which collection is the best choice.\nfor this purpose, they want to develop a computer program to find the coverage of a collection of antenna locations. Each antenna\nA\ni\nhas power\nr\ni\n, corresponding to \"radius\". Usually, the coverage region of the antenna may be modeled as a disk centered at the location of the antenna (\nx\ni\n, y\ni\n) with radius\nr\ni\n. However, in this city Maxnorm such a coverage region becomes the square [\nx\ni\n−\nr\ni\n,\nx\ni\n+\nr\ni\n] × [\ny\ni\n−\nr\ni\n,\ny\ni\n+\nr\ni\n]. In other words, the distance between two points (\nx\np\n,\ny\np\n) and (\nx\nq\n,\ny\nq\n) is measured by the max norm max{ |\nx\np\n−\nx\nq\n|, |\ny\np\n−\ny\nq\n|}, or, the\nL\n∞\nnorm, in this city Maxnorm instead of the ordinary Euclidean norm √ {(\nx\np\n−\nx\nq\n)\n2\n+ (\ny\np\n−\ny\nq\n)\n2\n}.\nAs an example, consider the following collection of 3 antennas\n4.0 4.0 3.0\n5.0 6.0 3.0\n5.5 4.5 1.0\ndepicted in the following figure\nwhere the\ni\n-th row represents\nx\ni\n, y\ni\nr\ni\nsuch that (\nx\ni\n, y\ni\n) is the position of the\ni\n-th antenna and\nr\ni\nis its power. The area of regions of points covered by at least one antenna is 52.00 in this case.\nWrite a program that finds the area of coverage by a given collection of antenna locations.\nInput\nThe input contains multiple data sets, each representing a collection of antenna locations. A data set is given in the following format.\nn\nx\n1\ny\n1\nr\n1\nx\n2\ny\n2\nr\n2\n. . .\nx\nn\ny\nn\nr\nn\nThe first integer\nn\nis the number of antennas, such that 2 ≤\nn\n≤ 100. The coordinate of the\ni\n-th antenna is given by (\nx\ni\n, y\ni\n), and its power is\nr\ni\n.\nx\ni\n, y\ni\nand\nr\ni\nare fractional numbers between 0 and 200 inclusive.\nThe end of the input is indicated by a data set with 0 as the value of\nn\n.\nOutput\nFor each data set, your program should output its sequence number (1 for the first data set, 2 for the second, etc.) and the area of the coverage region. The area should be printed with two digits to the right of the decimal point, after rounding it to two decimal places.\nThe sequence number and the area should be printed on the same line with no spaces at the beginning and end of the line. The two numbers should be separated by a space.\nSample Input\n3\n4.0 4.0 3.0\n5.0 6.0 3.0\n5.5 4.5 1.0\n2\n3.0 3.0 3.0\n1.5 1.5 1.0\n0\nOutput for the Sample Input\n1 52.00\n2 36.00"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1202_3709040","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\n// #define int ll\nusing PII = pair<ll, ll>;\n\n#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define ALL(x) x.begin(), x.end()\n\ntemplate<typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }\ntemplate<typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }\ntemplate<typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }\ntemplate<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }\n\ntemplate<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }\ntemplate<typename T,typename... Ts>\nauto make_v(size_t a,Ts... ts) {\n return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));\n}\ntemplate<typename T,typename V> typename enable_if<is_class<T>::value==0>::type\nfill_v(T &t, const V &v) { t=v; }\ntemplate<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type\nfill_v(T &t, const V &v ) { for(auto &e:t) fill_v(e,v); }\n\ntemplate<class S,class T>\nostream &operator <<(ostream& out,const pair<S,T>& a) {\n out<<'('<<a.first<<','<<a.second<<')'; return out;\n}\ntemplate<class T>\nostream &operator <<(ostream& out,const vector<T>& a){\n out<<'[';\n for(const T &i: a) out<<i<<',';\n out<<']';\n return out;\n}\ntemplate<class T>\nostream &operator <<(ostream& out, const set<T>& a) {\n out<<'{';\n for(const T &i: a) out<<i<<',';\n out<<'}';\n return out;\n}\ntemplate<class T, class S>\nostream &operator <<(ostream& out, const map<T,S>& a) {\n out<<'{';\n for(auto &i: a) out<<i<<',';\n out<<'}';\n return out;\n}\n\nint dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; // DRUL\nconst int INF = 1<<30;\nconst ll LLINF = 1LL<<60;\nconst ll MOD = 1000000007;\n\nstruct node {\n ll y, l, r;\n bool isadd;\n\n bool operator<(const node& a) {\n return y < a.y;\n }\n};\n\nsigned main(void)\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n ll tc = 1;\n while(1) {\n ll n;\n cin >> n;\n if(!n) break;\n vector<node> v;\n REP(i, n) {\n double x, y, r;\n cin >> x >> y >> r;\n ll xx = x*100, yy = y*100, rr = r*100;\n v.push_back({yy-rr+20000, xx-rr+20000, xx+rr+20000, true});\n v.push_back({yy+rr+20000, xx-rr+20000, xx+rr+20000, false});\n }\n sort(ALL(v));\n\n vector<int> now(40001);\n ll prev = 0, width = 0, ans = 0;\n REP(i, v.size()) {\n // (y座標のdiff) * width\n ans += (v[i].y - prev) * width;\n // cout << \"y:\" << v[i].y << \" prev:\" << prev << \" width:\" << width << \" ans:\" << ans << endl;\n prev = v[i].y;\n // widthの計算\n // cout << \"l:\" << v[i].l << \" r:\" << v[i].r << \" isadd:\" << v[i].isadd << endl;\n if(v[i].isadd) FOR(x, v[i].l, v[i].r) now[x]++;\n else FOR(x, v[i].l, v[i].r) now[x]--;\n // cout << now << endl;\n width = 0;\n REP(x, 40001) width += (now[x]>0);\n }\n\n cout << tc << \" \" << fixed << setprecision(2) << ans/10000.0 << endl;\n tc++;\n }\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3424,"score_of_the_acc":-1,"final_rank":11},{"submission_id":"aoj_1202_2052054","code_snippet":"#include <bits/stdc++.h>\n#define rep( i, begin, end) for( int i = begin; i < end; i++ )\nusing namespace std;\n \nstruct coverage {\n double x1, x2, y1, y2;\n coverage( double x1, double x2, double y1, double y2 ) : x1( x1 ), x2( x2 ), y1( y1 ), y2( y2 ) { }\n};\n\nbool confirm( const coverage ®ion1, const coverage ®ion2 )\n{\n return( region1.x1 < region2.x2 && region2.x1 < region1.x2 && region1.y1 < region2.y2 && region2.y1 < region1.y2 );\n}\n \nint main() {\n int n, order = 0;\n double x, y, r, area;\n while( cin >> n ) {\n if( n == 0 )\n break;\n vector<coverage> square;\n vector<double> sx, sy;\n rep ( i, 0, n ) {\n cin >> x >> y >> r;\n square.push_back( coverage( x - r, x + r, y - r, y + r) );\n sx.push_back( x - r );\n sx.push_back( x + r );\n sy.push_back( y - r );\n sy.push_back( y + r );\n }\n area = 0;\n sort( sx.begin(), sx.end() );\n sort( sy.begin(), sy.end() );\n \n int a, b, c, flag;\n for( a = 0; a < sx.size() - 1; a++ )\n for( b = 0; b < sy.size() - 1; b++ )\n for( c = flag = 0; c < square.size(); c++) {\n if( confirm( square[c], coverage( sx[ a ], sx[ a + 1 ], sy[ b ], sy[ b + 1 ] ) ) )\n if( flag == 0 ) {\n area += ( sx[ a + 1 ] - sx[ a ] ) * ( sy[ b + 1 ] - sy[ b ] );\n\t\t\t\t\t\t\tflag++;\n\t\t\t\t\t\t}\n }\n cout << ++order << \" \" << fixed << setprecision(2) << area << endl;\n }\n \n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3208,"score_of_the_acc":-0.9369,"final_rank":9},{"submission_id":"aoj_1202_895720","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <string>\n#include <sstream>\n#include <cstring>\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <numeric>\n#include <cctype>\n#include <tuple>\n\n#ifdef _MSC_VER\n#include <agents.h>\n#endif\n\n#define FOR(i, a, b) for(int i = (a); i < (int)(b); ++i)\n#define rep(i, n) FOR(i, 0, n)\n#define ALL(v) v.begin(), v.end()\n#define REV(v) v.rbegin(), v.rend()\n#define MEMSET(v, s) memset(v, s, sizeof(v))\n#define X first\n#define Y second\n\nusing namespace std;\n\nconst double EPS = 1e-9;\n\nstruct Rect{\n\tdouble l, t, r, b;\n\tbool contain(const Rect &rc){\n\t\treturn l - EPS < rc.l &&\n\t\t\tt - EPS < rc.t &&\n\t\t\tr + EPS > rc.r &&\n\t\t\tb + EPS > rc.b;\n\t}\n\tdouble S(){\n\t\treturn (r - l)*(b - t);\n\t}\n};\n\nint n;\nRect rect[500];\ndouble x[500], y[500];\n\nint main(){\n\tcout.setf(ios::fixed);\n\tcout.precision(2);\n\tint t = 1;\n\twhile (cin >> n, n){\n\t\trep(i, n){\n\t\t\tdouble xx, yy, rr;\n\t\t\tcin >> xx >> yy >> rr;\n\t\t\trect[i] = Rect{ xx - rr, yy - rr, xx + rr, yy + rr };\n\t\t\tx[i * 2] = xx - rr, x[i * 2 + 1] = xx + rr;\n\t\t\ty[i * 2] = yy - rr, y[i * 2 + 1] = yy + rr;\n\t\t}\n\t\tsort(x, x + 2 * n);\n\t\tsort(y, y + 2 * n);\n\n\t\tdouble ans = 0;\n\t\trep(i, 2 * n - 1) rep(j, 2 * n - 1) {\n\t\t\tRect r = {x[i], y[j], x[i+1], y[j+1]};\n\t\t\tint cnt = 0;\n\t\t\trep(k, n){\n\t\t\t\tif (rect[k].contain(r)) ++cnt;\n\t\t\t}\n\t\t\tif (cnt > 0) ans += r.S();\n\t\t}\n\t\tcout << t++ << \" \" << ans << endl;\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":30,"memory_kb":1320,"score_of_the_acc":-0.407,"final_rank":7},{"submission_id":"aoj_1202_489488","code_snippet":"//24\n#include<iostream>\n#include<algorithm>\n#include<iomanip>\n\nusing namespace std;\n\nstruct L{\n int y,l,r,f;\n bool operator<(L a)const{\n return y<a.y;\n }\n};\n\nint main(){\n int cs=0;\n for(int n;cin>>n,n;){\n L l[200];\n for(int i=0;i<n;i++){\n double x,y,r;\n cin>>x>>y>>r;\n L &a=l[2*i],&b=l[2*i+1];\n a.l=b.l=(x-r)*100+.5+20000;\n a.r=b.r=(x+r)*100+.5+20000;\n a.y=(y-r)*100+.5+20000;\n b.y=(y+r)*100+.5+20000;\n a.f=1;\n b.f=-1;\n }\n sort(l,l+n*2);\n int c[60001]={};\n unsigned sum=0;\n for(int i=0;i<2*n-1;i++){\n for(int j=l[i].l;j<l[i].r;j++){\n\tc[j]+=l[i].f;\n }\n int h=l[i+1].y-l[i].y;\n sum+=(60001-count(c,c+60001,0U))*h;\n }\n cout.precision(2);\n cout<<++cs<<' '<<fixed<<sum/10000.<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1548,"score_of_the_acc":-0.4629,"final_rank":8},{"submission_id":"aoj_1202_466459","code_snippet":"#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n#include <cstdio>\n#include <iostream>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cctype>\n#include <utility>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair <int,int> P;\ntypedef pair <int,P > PP;\n\nint tx[] = {0,1,0,-1};\nint ty[] = {-1,0,1,0};\n\nstatic const double EPS = 1e-8;\n\nclass Data{\npublic:\n\tdouble x;\n\tdouble y;\n\tdouble r;\n\tData(double _x,double _y,double _r){\n\t\tx = _x;\n\t\ty = _y;\n\t\tr = _r;\n\t}\n};\n\nbitset<10000> found; \nbool filled[400][400];\nint main(){\n\tint n;\n\tint idx = 1;\n\twhile(~scanf(\"%d\",&n)){\n\t\tif(n==0) break;\n\n\t\tvector<Data> Points;\n\t\tmemset(filled,0,sizeof(filled));\n\n\t\tfor(int i=0;i<n;i++){\n\t\t\tdouble x,y,r;\n\t\t\tscanf(\"%lf %lf %lf\",&x,&y,&r);\n\t\t\tPoints.push_back(Data(x,y,r));\n\n\t\t\t//x=200; cx=20000;\n\t\t\t//x=0 cx=0;\n\t\t\t//r=200 ra=20000;\n\t\t\t//-20000<square<20000\n\n\t\t\tint cx = x*100.0;\n\t\t\tint cy = y*100.0;\n\t\t\tint ra = r*100.0; \n\t\t\t\n\t\t\tfor(int y=0;y<40000;y+=100){\n\t\t\t\tfor(int x=0;x<40000;x+=100){\n\t\t\t\t\tif(cx - ra + 20000 <= x && x+100 < cx+ra + 20000\n\t\t\t\t\t&& cy - ra + 20000 <= y && y+100 < cy+ra + 20000){\n\t\t\t\t\t\tfilled[y/100][x/100] = true;\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\n\t\tint res=0;\n\n\n\t\tfor(int y=0;y<40000;y+=100){\n\t\t\tfor(int x=0;x<40000;x+=100){\n\t\t\t\tif(filled[y/100][x/100]){\n\t\t\t\t\tres+= 10000;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\telse{\n\n\t\t\t\t\tfound.reset();\n\t\t\t\t\tfor(int i=0;i<Points.size();i++){\n\t\t\t\t\t\tint cx = Points[i].x*100.0 + 20000;\n\t\t\t\t\t\tint cy = Points[i].y*100.0 + 20000;\n\t\t\t\t\t\tint ra = Points[i].r*100.0;\n\n\n\t\t\t\t\t\tif(cx+ra < x || x+100 <= cx - ra) continue;\n\t\t\t\t\t\tif(cy+ra < y || y+100 <= cy - ra) continue;\n\t\t\t\t\t\tfor(int dy= max(cy-ra,y);dy<min(cy+ra,y+100);dy++){\n\t\t\t\t\t\t\tfor(int dx = max(cx-ra,x);dx < min(cx+ra,x+100); dx++){\n\t\t\t\t\t\t\t\tfound[(dy-y)*100+(dx-x)] = true;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\t\t\t\t\tres += found.count();\n\n\t\t\t\t}\n\n\t\t\t}\n\t\t}\n\n\t\tprintf(\"%d %.2lf\\n\",idx++,res/(double)10000);\t\t\n\t}\n}","accuracy":1,"time_ms":940,"memory_kb":1420,"score_of_the_acc":-1.4147,"final_rank":12},{"submission_id":"aoj_1202_374538","code_snippet":"#include <cstdio>\n#include <iostream>\n#include <vector>\n#include <list>\n#include <cmath>\n#include <fstream>\n#include <algorithm>\n#include <string>\n#include <queue>\n#include <set>\n#include <map>\n#include <complex>\n#include <iterator>\n#include <cstdlib>\n#include <cstring>\n#include <sstream>\n#include <stack>\n\nusing namespace std;\n\nconst double EPS=(1e-10);\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef complex<double> P;\ntypedef pair<P,P> Rect;\n\nbool EQ(double a,double b){\n return abs((a)-(b))<EPS;\n}\nvoid fast_stream(){\n std::ios_base::sync_with_stdio(0);\n}\n\nconst int INF=1000000000;\nint N;\n\nclass Event{\npublic:\n double y;\n bool isIn;\n int id;\n Event(){}\n Event(double y_,bool isIn_,int id_){\n y=y_;\n isIn=isIn_;\n id=id_;\n }\n bool operator<(const Event& e)const{\n return e.y>this->y; \n }\n};\nEvent evs[1001];\nRect recs[1001];\n\nclass UnionFindTree{\npublic:\n // indexÌÌem[h( éWÌeð©Â¯½¢Æ«Í±±ð¼ÚQƹ¸Afindðg¤)\n vector<int> par;\n // indexðªÆ·éØÌN\n vector<int> rank;\n vector<double> ls,rs;\n // ØÌÅål\n int treeSize;\npublic:\n UnionFindTree(int initTreeSize = 1000){\n // øÅ^¦çê½lðÅåi[Æ·éUnionFindTreeÌì¬\n treeSize = initTreeSize;\n init();\n }\n void init(){\n for(int i = 0; i < treeSize; i++){\n par.push_back(i);\n rank.push_back(0);\n ls.push_back(0);\n rs.push_back(0);\n }\n }\n // ^¦ç꽪i[³êÄ¢éØÌ[gðTõ\n int find(int x){ \n if(par[x] == x)return x;\n else return par[x] = find(par[x]);\n }\n // aWðÆéB½¾µ±±ÅÍeWÌeÌt¯Ö¦ÍN±çÈ¢\n void unite(int x,int y,double l,double r){\n x = find(x);\n y = find(y);\n if(x == y)return;\n if(rank[x] < rank[y])par[x] = y;\n else{\n par[y] = x;\n if(rank[y] == rank[x])rank[x]++;\n }\n int p=find(x);\n ls[p]=l;\n rs[p]=r;\n }\n bool same(int x,int y){\n return find(x) == find(y);\n }\n};\n\nint main(){\n int cnt=0;\n while(cin>>N&&N){\n int NN=0;\n for(int i=0;i<N;i++){\n double x,y,r;\n cin>>x>>y>>r;\n recs[i].first=P(x-r,y-r);\n recs[i].second=P(x+r,y+r);\n if(EQ(r,0))continue;\n evs[2*NN]=Event(y-r,true,i);\n evs[2*NN+1]=Event(y+r,false,i);\n NN++;\n }\n sort(evs,evs+2*NN);\n double prvy=-INF;\n double sumLen=0;\n double res=0;\n vector<int> v;\n // y̬³¢ÔÉCxgð\n for(int k=0;k<2*NN;k++){\n Event &e=evs[k];\n if(!EQ(prvy,-INF))res+=sumLen*(e.y-prvy);\n prvy=e.y;\n // _ÌÇÁAí\n if(e.isIn)v.push_back(e.id);\n else v.erase(find(v.begin(),v.end(),e.id));\n // ¡ñÌ¡ðvZ\n UnionFindTree uft(v.size());\n for(int i=0;i<v.size();i++){\n\tuft.ls[i]=recs[v[i]].first.real();\n\tuft.rs[i]=recs[v[i]].second.real();\n }\n for(int i=0;i<v.size();i++){\n\tfor(int j=i+1;j<v.size();j++){\n\t // Íͪ©Ôéæ¤ÈçÎAunite\n\t if((EQ(uft.rs[uft.find(i)]\n\t\t ,uft.ls[uft.find(j)])\n\t ||(uft.rs[uft.find(i)]\n\t\t >uft.ls[uft.find(j)]))\n\t &&(EQ(uft.ls[uft.find(i)]\n\t\t ,uft.rs[uft.find(j)])\n\t\t||(uft.ls[uft.find(i)]\n\t\t <uft.rs[uft.find(j)]))){\n\t double minx=min(uft.ls[uft.find(i)]\n\t\t\t ,uft.ls[uft.find(j)]);\n\t double maxx=max(uft.rs[uft.find(i)]\n\t\t\t ,uft.rs[uft.find(j)]);\n\t uft.unite(i,j,minx,maxx);\n\t }\n\t}\n }\n set<int> s;\n for(int i=0;i<v.size();i++)\n\ts.insert(uft.find(i));\n sumLen=0;\n for(set<int>::iterator it\n\t =s.begin();it!=s.end();it++){\n\tsumLen+=(uft.rs[*it]-uft.ls[*it]);\n }\n }\n cnt++;\n printf(\"%d %.2f\\n\",cnt,res);\n }\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":0,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_1202_366524","code_snippet":"#include<stdio.h>\n#include<vector>\n#include<algorithm>\nusing namespace std;\n\nstruct R\n{\n\tdouble x1,x2,y1,y2;\n\tR(double x1,double x2,double y1,double y2):x1(x1),x2(x2),y1(y1),y2(y2){}\n};\nbool F(const R &a,const R &b)\n{\n\treturn(a.x1<b.x2&&b.x1<a.x2&&a.y1<b.y2&&b.y1<a.y2);\n}\nint main()\n{\n\tint n,i,j,k,T=0;\n\tdouble x,y,p,res;\n\twhile(scanf(\"%d\",&n),n)\n\t{\n\t\tvector<R>v;\n\t\tvector<double>vx,vy;\n\t\twhile(n--)\n\t\t{\n\t\t\tscanf(\"%lf%lf%lf\",&x,&y,&p);\n\t\t\tv.push_back(R(x-p,x+p,y-p,y+p));\n\t\t\tvx.push_back(x-p);\n\t\t\tvx.push_back(x+p);\n\t\t\tvy.push_back(y-p);\n\t\t\tvy.push_back(y+p);\n\t\t}\n\t\tint f;\n\t\tres=0;\n\t\tsort(vx.begin(),vx.end());\n\t\tsort(vy.begin(),vy.end());\n\n\t\tfor(i=0;i+1<vx.size();++i)\n\t\t\tfor(j=0;j+1<vy.size();++j)\n\t\t\t\tfor(f=k=0;k<v.size();++k)\n\t\t\t\t\tif(F(v[k],R(vx[i],vx[i+1],vy[j],vy[j+1])))\n\t\t\t\t\t\tif(f++==0)\n\t\t\t\t\t\t\tres+=(vx[i+1]-vx[i])*(vy[j+1]-vy[j]);\n\t\tprintf(\"%d %.2f\\n\",++T,res);\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":90,"memory_kb":0,"score_of_the_acc":-0.086,"final_rank":4},{"submission_id":"aoj_1202_236739","code_snippet":"#include <iostream>\n#include <sstream>\n#include <iomanip>\n#include <algorithm>\n#include <cmath>\n#include <string>\n#include <vector>\n#include <list>\n#include <queue>\n#include <stack>\n#include <set>\n#include <map>\n#include <bitset>\n#include <numeric>\n#include <climits>\n#include <cfloat>\nusing namespace std;\n\nint main()\n{\n int sequenceNum = 0;\n for(;;){\n int n;\n cin >> n;\n if(n == 0)\n return 0;\n\n vector<double> x(2*n), y(2*n), x1(n), y1(n), x2(n), y2(n);\n for(int i=0; i<n; ++i){\n double x0, y0, r;\n cin >> x0 >> y0 >> r;\n x[2*i] = x1[i] = x0 - r;\n x[2*i+1] = x2[i] = x0 + r;\n y[2*i] = y1[i] = y0 - r;\n y[2*i+1] = y2[i] = y0 + r;\n }\n sort(x.begin(), x.end());\n sort(y.begin(), y.end());\n\n double ret = 0.0;\n for(int i=0; i<2*n-1; ++i){\n for(int j=0; j<2*n-1; ++j){\n for(int k=0; k<n; ++k){\n if(x1[k] <= x[i] && x[i+1] <= x2[k] && y1[k] <= y[j] && y[j+1] <= y2[k]){\n ret += (y[j+1] - y[j]) * (x[i+1] - x[i]);\n break;\n }\n }\n }\n }\n printf(\"%d %.02f\\n\", ++sequenceNum, ret);\n }\n}","accuracy":1,"time_ms":40,"memory_kb":988,"score_of_the_acc":-0.3208,"final_rank":5},{"submission_id":"aoj_1202_236737","code_snippet":"#include <iostream>\n#include <sstream>\n#include <iomanip>\n#include <algorithm>\n#include <cmath>\n#include <string>\n#include <vector>\n#include <list>\n#include <queue>\n#include <stack>\n#include <set>\n#include <map>\n#include <bitset>\n#include <numeric>\n#include <climits>\n#include <cfloat>\nusing namespace std;\n\nconst double EPS = 1.0e-10;\n\nclass Point\n{\npublic:\n double y, x;\n Point(){\n y = x = 0.0;\n }\n Point(double y0, double x0){\n y = y0;\n x = x0;\n }\n};\n\nint main()\n{\n int sequenceNum = 0;\n for(;;){\n int n;\n cin >> n;\n if(n == 0)\n return 0;\n\n vector<double> x(2*n), y(2*n);\n vector<Point> p1(n), p2(n);\n for(int i=0; i<n; ++i){\n double x0, y0, r;\n cin >> x0 >> y0 >> r;\n x[2*i] = p1[i].x = x0 - r;\n x[2*i+1] = p2[i].x = x0 + r;\n y[2*i] = p1[i].y = y0 - r;\n y[2*i+1] = p2[i].y = y0 + r;\n }\n sort(x.begin(), x.end());\n sort(y.begin(), y.end());\n\n double ret = 0.0;\n for(int i=0; i<2*n-1; ++i){\n for(int j=0; j<2*n-1; ++j){\n for(int k=0; k<n; ++k){\n if(p1[k].x <= x[i] && x[i+1] <= p2[k].x && p1[k].y <= y[j] && y[j+1] <= p2[k].y){\n ret += (y[j+1] - y[j]) * (x[i+1] - x[i]);\n break;\n }\n }\n }\n }\n printf(\"%d %.02f\\n\", ++sequenceNum, ret);\n }\n}","accuracy":1,"time_ms":40,"memory_kb":988,"score_of_the_acc":-0.3208,"final_rank":5},{"submission_id":"aoj_1202_183990","code_snippet":"#include <iostream>\n#include <vector>\n#include <cstdio>\n#include <complex>\n#include <algorithm>\nusing namespace std;\ndouble unit = 0.001;\ntypedef complex<double> P;\n#define rep(i,n) for(int i=0;i<n;i++)\n\nbool cmp(const pair<P,P>&a,const pair<P,P>&b){\n\treturn a.first.imag() < b.first.imag();\n}\nint main(){\n\tint n,N=0;\n\twhile(cin >> n ,n){\n\t\tvector< pair<P,P> > data;\n\t\tdouble ans = 0;\n\t\trep(i,n){\n\t\t\tdouble a,b,r;\n\t\t\tcin >> a >> b >> r;\n\t\t\tdata.push_back(make_pair(P(a-r,b-r),P(a+r,b+r)));\n\t\t}\n\t\tsort(data.begin(),data.end(),cmp);\n\t\tfor(double x=-200;x<=400;x += unit){\n\t\t\tvector< pair<double,double> > L;\n\t\t\trep(i,n){\n\t\t\t\tif(data[i].first.real() <= x && x <= data[i].second.real()){\n\t\t\t\t\tL.push_back(make_pair(data[i].first.imag(),data[i].second.imag()));\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(L.size() == 0)continue;\n\t\t\tdouble sz = 0;\n\t\t\tdouble cs = L[0].first, ce = L[0].second;\t\t\n\t\t\tfor(int i=1;i<L.size();i++){\n\t\t\t\tif(L[i].first <= ce)ce = max(ce,L[i].second);\n\t\t\t\telse sz += ce-cs , cs = L[i].first , ce = L[i].second;\n\t\t\t}\n\t\t\tsz += ce-cs;\n\t\t\tans += sz * unit;\n\t\t}\n\t\tprintf(\"%d %.2lf\\n\",++N,ans);\n\t}\n \n}","accuracy":1,"time_ms":660,"memory_kb":988,"score_of_the_acc":-0.9875,"final_rank":10},{"submission_id":"aoj_1202_170882","code_snippet":"#include<iostream>\n#include<cmath>\n#include<vector>\n#include<set>\n#include<map>\n#include<complex>\n\n#define START 0\n#define END 1\nusing namespace std;\n\ntypedef complex<double> point;\n\nconst double infty = 1e40;\nconst double eps = 1e-10;\n\nbool eq(double a, double b){\n return abs(b-a) < eps;\n}\n\nstruct anntena{\n point ul, rd;\n anntena(point a, point b):ul(a),rd(b){}\n bool isinside(const point &t){\n if( ul.real()<=t.real()&&t.real()<=rd.real()&&\n\tul.imag()>=t.imag()&&t.imag()>=rd.imag())return true;\n return false;\n }\n};\n\nint main()\n{\n int n;\n int tc=1;\n while(cin>>n && n>0){\n double res = 0;\n set<double> X;\n set<double> Y;\n vector<anntena> va;\n\n for(int i = 0; i < n; ++i){\n double x,y,r;\n scanf(\"%lf%lf%lf\", &x, &y, &r);\n X.insert(x-r);\n X.insert(x+r);\n Y.insert(y-r);\n Y.insert(y+r);\n va.push_back( anntena(point(x-r,y+r), point(x+r,y-r) ) );\n }\n for(set<double>::iterator itx = X.begin(); itx != X.end(); ++itx){\n\n double x = *itx;\n ++itx;\n if(itx==X.end())break;\n double nx = *itx;\n --itx;\n double span_x = nx - x;\n for(set<double>::iterator ity = Y.begin(); ity != Y.end(); ++ity){\n\tdouble y = *ity;\n\t++ity;\n\tif(ity==Y.end())break;\n\tdouble ny = *ity;\n\t--ity;\n\tdouble span_y = ny - y;\n\tpoint cent = point((x+nx)/2,(y+ny)/2);\n\tbool cent_cont = false;\n\tfor(int i = 0; i < (int)va.size(); ++i){\n\t if( va[i].isinside( cent ) ) cent_cont = true;\n\t}\n\tif( cent_cont ){\n\t res += span_x * span_y;\n\t}\n } \n }\n printf(\"%d %.2lf\\n\", tc, res);\n ++tc;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":0,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_1202_170881","code_snippet":"#include<iostream>\n#include<cmath>\n#include<vector>\n#include<set>\n#include<map>\n#include<complex>\n\n#define START 0\n#define END 1\nusing namespace std;\n\ntypedef complex<double> point;\n\nconst double infty = 1e40;\nconst double eps = 1e-10;\n\nbool eq(double a, double b){\n return abs(b-a) < eps;\n}\n\nstruct anntena{\n point ul, rd;\n anntena(point a, point b):ul(a),rd(b){}\n bool isinside(const point &t){\n if( ul.real()<=t.real()&&t.real()<=rd.real()&&\n\tul.imag()>=t.imag()&&t.imag()>=rd.imag())return true;\n return false;\n }\n};\n\nint main()\n{\n int n;\n int tc=1;\n while(cin>>n && n>0){\n double res = 0;\n set<double> X;\n set<double> Y;\n vector<anntena> va;\n\n for(int i = 0; i < n; ++i){\n double x,y,r;\n scanf(\"%lf%lf%lf\", &x, &y, &r);\n //cin >> x >> y >> r;\n X.insert(x-r);\n X.insert(x+r);\n Y.insert(y-r);\n Y.insert(y+r);\n va.push_back( anntena(point(x-r,y+r), point(x+r,y-r) ) );\n }\n for(set<double>::iterator itx = X.begin(); itx != X.end(); ++itx){\n\n double x = *itx;\n ++itx;\n if(itx==X.end())break;\n double nx = *itx;\n --itx;\n double span_x = nx - x;\n for(set<double>::iterator ity = Y.begin(); ity != Y.end(); ++ity){\n\tdouble y = *ity;\n\t++ity;\n\tif(ity==Y.end())break;\n\tdouble ny = *ity;\n\t--ity;\n\tdouble span_y = ny - y;\n\t/*\n\tpoint lu = point(x,ny);\n\tpoint ru = point(nx,ny);\n\tpoint ld = point(x,y);\n\tpoint rd = point(nx,y);\n\t*/\n\tpoint cent = point((x+nx)/2,(y+ny)/2);\n\t//bool lu_cont = false;\n\t//bool rd_cont = false;\n\tbool cent_cont = false;\n\tfor(int i = 0; i < (int)va.size(); ++i){\n\t if( va[i].isinside( cent ) ) cent_cont = true;\n\t //if( va[i].isinside( rd ) ) rd_cont = true;\n\t}\n\tif( cent_cont ){//&& rd_cont ){\n\t res += span_x * span_y;\n\t}\n } \n }\n printf(\"%d %.2lf\\n\", tc, res);\n ++tc;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":0,"score_of_the_acc":0,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_1202_3709040\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\nusing ll = long long;\\n// #define int ll\\nusing PII = pair<ll, ll>;\\n\\n#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)\\n#define REP(i, n) FOR(i, 0, n)\\n#define ALL(x) x.begin(), x.end()\\n\\ntemplate<typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }\\ntemplate<typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }\\ntemplate<typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }\\ntemplate<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }\\n\\ntemplate<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }\\ntemplate<typename T,typename... Ts>\\nauto make_v(size_t a,Ts... ts) {\\n return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));\\n}\\ntemplate<typename T,typename V> typename enable_if<is_class<T>::value==0>::type\\nfill_v(T &t, const V &v) { t=v; }\\ntemplate<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type\\nfill_v(T &t, const V &v ) { for(auto &e:t) fill_v(e,v); }\\n\\ntemplate<class S,class T>\\nostream &operator <<(ostream& out,const pair<S,T>& a) {\\n out<<'('<<a.first<<','<<a.second<<')'; return out;\\n}\\ntemplate<class T>\\nostream &operator <<(ostream& out,const vector<T>& a){\\n out<<'[';\\n for(const T &i: a) out<<i<<',';\\n out<<']';\\n return out;\\n}\\ntemplate<class T>\\nostream &operator <<(ostream& out, const set<T>& a) {\\n out<<'{';\\n for(const T &i: a) out<<i<<',';\\n out<<'}';\\n return out;\\n}\\ntemplate<class T, class S>\\nostream &operator <<(ostream& out, const map<T,S>& a) {\\n out<<'{';\\n for(auto &i: a) out<<i<<',';\\n out<<'}';\\n return out;\\n}\\n\\nint dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; // DRUL\\nconst int INF = 1<<30;\\nconst ll LLINF = 1LL<<60;\\nconst ll MOD = 1000000007;\\n\\nstruct node {\\n ll y, l, r;\\n bool isadd;\\n\\n bool operator<(const node& a) {\\n return y < a.y;\\n }\\n};\\n\\nsigned main(void)\\n{\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n ll tc = 1;\\n while(1) {\\n ll n;\\n cin >> n;\\n if(!n) break;\\n vector<node> v;\\n REP(i, n) {\\n double x, y, r;\\n cin >> x >> y >> r;\\n ll xx = x*100, yy = y*100, rr = r*100;\\n v.push_back({yy-rr+20000, xx-rr+20000, xx+rr+20000, true});\\n v.push_back({yy+rr+20000, xx-rr+20000, xx+rr+20000, false});\\n }\\n sort(ALL(v));\\n\\n vector<int> now(40001);\\n ll prev = 0, width = 0, ans = 0;\\n REP(i, v.size()) {\\n // (y座標のdiff) * width\\n ans += (v[i].y - prev) * width;\\n // cout << \\\"y:\\\" << v[i].y << \\\" prev:\\\" << prev << \\\" width:\\\" << width << \\\" ans:\\\" << ans << endl;\\n prev = v[i].y;\\n // widthの計算\\n // cout << \\\"l:\\\" << v[i].l << \\\" r:\\\" << v[i].r << \\\" isadd:\\\" << v[i].isadd << endl;\\n if(v[i].isadd) FOR(x, v[i].l, v[i].r) now[x]++;\\n else FOR(x, v[i].l, v[i].r) now[x]--;\\n // cout << now << endl;\\n width = 0;\\n REP(x, 40001) width += (now[x]>0);\\n }\\n\\n cout << tc << \\\" \\\" << fixed << setprecision(2) << ans/10000.0 << endl;\\n tc++;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3424,\n \"score_of_the_acc\": -1,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1202_2052054\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define rep( i, begin, end) for( int i = begin; i < end; i++ )\\nusing namespace std;\\n \\nstruct coverage {\\n double x1, x2, y1, y2;\\n coverage( double x1, double x2, double y1, double y2 ) : x1( x1 ), x2( x2 ), y1( y1 ), y2( y2 ) { }\\n};\\n\\nbool confirm( const coverage ®ion1, const coverage ®ion2 )\\n{\\n return( region1.x1 < region2.x2 && region2.x1 < region1.x2 && region1.y1 < region2.y2 && region2.y1 < region1.y2 );\\n}\\n \\nint main() {\\n int n, order = 0;\\n double x, y, r, area;\\n while( cin >> n ) {\\n if( n == 0 )\\n break;\\n vector<coverage> square;\\n vector<double> sx, sy;\\n rep ( i, 0, n ) {\\n cin >> x >> y >> r;\\n square.push_back( coverage( x - r, x + r, y - r, y + r) );\\n sx.push_back( x - r );\\n sx.push_back( x + r );\\n sy.push_back( y - r );\\n sy.push_back( y + r );\\n }\\n area = 0;\\n sort( sx.begin(), sx.end() );\\n sort( sy.begin(), sy.end() );\\n \\n int a, b, c, flag;\\n for( a = 0; a < sx.size() - 1; a++ )\\n for( b = 0; b < sy.size() - 1; b++ )\\n for( c = flag = 0; c < square.size(); c++) {\\n if( confirm( square[c], coverage( sx[ a ], sx[ a + 1 ], sy[ b ], sy[ b + 1 ] ) ) )\\n if( flag == 0 ) {\\n area += ( sx[ a + 1 ] - sx[ a ] ) * ( sy[ b + 1 ] - sy[ b ] );\\n\\t\\t\\t\\t\\t\\t\\tflag++;\\n\\t\\t\\t\\t\\t\\t}\\n }\\n cout << ++order << \\\" \\\" << fixed << setprecision(2) << area << endl;\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3208,\n \"score_of_the_acc\": -0.9369,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1202_895720\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <string>\\n#include <sstream>\\n#include <cstring>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cmath>\\n#include <queue>\\n#include <stack>\\n#include <map>\\n#include <set>\\n#include <numeric>\\n#include <cctype>\\n#include <tuple>\\n\\n#ifdef _MSC_VER\\n#include <agents.h>\\n#endif\\n\\n#define FOR(i, a, b) for(int i = (a); i < (int)(b); ++i)\\n#define rep(i, n) FOR(i, 0, n)\\n#define ALL(v) v.begin(), v.end()\\n#define REV(v) v.rbegin(), v.rend()\\n#define MEMSET(v, s) memset(v, s, sizeof(v))\\n#define X first\\n#define Y second\\n\\nusing namespace std;\\n\\nconst double EPS = 1e-9;\\n\\nstruct Rect{\\n\\tdouble l, t, r, b;\\n\\tbool contain(const Rect &rc){\\n\\t\\treturn l - EPS < rc.l &&\\n\\t\\t\\tt - EPS < rc.t &&\\n\\t\\t\\tr + EPS > rc.r &&\\n\\t\\t\\tb + EPS > rc.b;\\n\\t}\\n\\tdouble S(){\\n\\t\\treturn (r - l)*(b - t);\\n\\t}\\n};\\n\\nint n;\\nRect rect[500];\\ndouble x[500], y[500];\\n\\nint main(){\\n\\tcout.setf(ios::fixed);\\n\\tcout.precision(2);\\n\\tint t = 1;\\n\\twhile (cin >> n, n){\\n\\t\\trep(i, n){\\n\\t\\t\\tdouble xx, yy, rr;\\n\\t\\t\\tcin >> xx >> yy >> rr;\\n\\t\\t\\trect[i] = Rect{ xx - rr, yy - rr, xx + rr, yy + rr };\\n\\t\\t\\tx[i * 2] = xx - rr, x[i * 2 + 1] = xx + rr;\\n\\t\\t\\ty[i * 2] = yy - rr, y[i * 2 + 1] = yy + rr;\\n\\t\\t}\\n\\t\\tsort(x, x + 2 * n);\\n\\t\\tsort(y, y + 2 * n);\\n\\n\\t\\tdouble ans = 0;\\n\\t\\trep(i, 2 * n - 1) rep(j, 2 * n - 1) {\\n\\t\\t\\tRect r = {x[i], y[j], x[i+1], y[j+1]};\\n\\t\\t\\tint cnt = 0;\\n\\t\\t\\trep(k, n){\\n\\t\\t\\t\\tif (rect[k].contain(r)) ++cnt;\\n\\t\\t\\t}\\n\\t\\t\\tif (cnt > 0) ans += r.S();\\n\\t\\t}\\n\\t\\tcout << t++ << \\\" \\\" << ans << endl;\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 1320,\n \"score_of_the_acc\": -0.407,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1202_489488\",\n \"code_snippet\": \"//24\\n#include<iostream>\\n#include<algorithm>\\n#include<iomanip>\\n\\nusing namespace std;\\n\\nstruct L{\\n int y,l,r,f;\\n bool operator<(L a)const{\\n return y<a.y;\\n }\\n};\\n\\nint main(){\\n int cs=0;\\n for(int n;cin>>n,n;){\\n L l[200];\\n for(int i=0;i<n;i++){\\n double x,y,r;\\n cin>>x>>y>>r;\\n L &a=l[2*i],&b=l[2*i+1];\\n a.l=b.l=(x-r)*100+.5+20000;\\n a.r=b.r=(x+r)*100+.5+20000;\\n a.y=(y-r)*100+.5+20000;\\n b.y=(y+r)*100+.5+20000;\\n a.f=1;\\n b.f=-1;\\n }\\n sort(l,l+n*2);\\n int c[60001]={};\\n unsigned sum=0;\\n for(int i=0;i<2*n-1;i++){\\n for(int j=l[i].l;j<l[i].r;j++){\\n\\tc[j]+=l[i].f;\\n }\\n int h=l[i+1].y-l[i].y;\\n sum+=(60001-count(c,c+60001,0U))*h;\\n }\\n cout.precision(2);\\n cout<<++cs<<' '<<fixed<<sum/10000.<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1548,\n \"score_of_the_acc\": -0.4629,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1202_466459\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#define INF 0x3f3f3f3f\\n#include <cstdio>\\n#include <iostream>\\n#include <sstream>\\n#include <cmath>\\n#include <cstdlib>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <limits>\\n#include <map>\\n#include <string>\\n#include <cstring>\\n#include <set>\\n#include <deque>\\n#include <bitset>\\n#include <list>\\n#include <cctype>\\n#include <utility>\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef pair <int,int> P;\\ntypedef pair <int,P > PP;\\n\\nint tx[] = {0,1,0,-1};\\nint ty[] = {-1,0,1,0};\\n\\nstatic const double EPS = 1e-8;\\n\\nclass Data{\\npublic:\\n\\tdouble x;\\n\\tdouble y;\\n\\tdouble r;\\n\\tData(double _x,double _y,double _r){\\n\\t\\tx = _x;\\n\\t\\ty = _y;\\n\\t\\tr = _r;\\n\\t}\\n};\\n\\nbitset<10000> found; \\nbool filled[400][400];\\nint main(){\\n\\tint n;\\n\\tint idx = 1;\\n\\twhile(~scanf(\\\"%d\\\",&n)){\\n\\t\\tif(n==0) break;\\n\\n\\t\\tvector<Data> Points;\\n\\t\\tmemset(filled,0,sizeof(filled));\\n\\n\\t\\tfor(int i=0;i<n;i++){\\n\\t\\t\\tdouble x,y,r;\\n\\t\\t\\tscanf(\\\"%lf %lf %lf\\\",&x,&y,&r);\\n\\t\\t\\tPoints.push_back(Data(x,y,r));\\n\\n\\t\\t\\t//x=200; cx=20000;\\n\\t\\t\\t//x=0 cx=0;\\n\\t\\t\\t//r=200 ra=20000;\\n\\t\\t\\t//-20000<square<20000\\n\\n\\t\\t\\tint cx = x*100.0;\\n\\t\\t\\tint cy = y*100.0;\\n\\t\\t\\tint ra = r*100.0; \\n\\t\\t\\t\\n\\t\\t\\tfor(int y=0;y<40000;y+=100){\\n\\t\\t\\t\\tfor(int x=0;x<40000;x+=100){\\n\\t\\t\\t\\t\\tif(cx - ra + 20000 <= x && x+100 < cx+ra + 20000\\n\\t\\t\\t\\t\\t&& cy - ra + 20000 <= y && y+100 < cy+ra + 20000){\\n\\t\\t\\t\\t\\t\\tfilled[y/100][x/100] = true;\\n\\t\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\n\\t\\tint res=0;\\n\\n\\n\\t\\tfor(int y=0;y<40000;y+=100){\\n\\t\\t\\tfor(int x=0;x<40000;x+=100){\\n\\t\\t\\t\\tif(filled[y/100][x/100]){\\n\\t\\t\\t\\t\\tres+= 10000;\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse{\\n\\n\\t\\t\\t\\t\\tfound.reset();\\n\\t\\t\\t\\t\\tfor(int i=0;i<Points.size();i++){\\n\\t\\t\\t\\t\\t\\tint cx = Points[i].x*100.0 + 20000;\\n\\t\\t\\t\\t\\t\\tint cy = Points[i].y*100.0 + 20000;\\n\\t\\t\\t\\t\\t\\tint ra = Points[i].r*100.0;\\n\\n\\n\\t\\t\\t\\t\\t\\tif(cx+ra < x || x+100 <= cx - ra) continue;\\n\\t\\t\\t\\t\\t\\tif(cy+ra < y || y+100 <= cy - ra) continue;\\n\\t\\t\\t\\t\\t\\tfor(int dy= max(cy-ra,y);dy<min(cy+ra,y+100);dy++){\\n\\t\\t\\t\\t\\t\\t\\tfor(int dx = max(cx-ra,x);dx < min(cx+ra,x+100); dx++){\\n\\t\\t\\t\\t\\t\\t\\t\\tfound[(dy-y)*100+(dx-x)] = true;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tres += found.count();\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tprintf(\\\"%d %.2lf\\\\n\\\",idx++,res/(double)10000);\\t\\t\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 940,\n \"memory_kb\": 1420,\n \"score_of_the_acc\": -1.4147,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1202_374538\",\n \"code_snippet\": \"#include <cstdio>\\n#include <iostream>\\n#include <vector>\\n#include <list>\\n#include <cmath>\\n#include <fstream>\\n#include <algorithm>\\n#include <string>\\n#include <queue>\\n#include <set>\\n#include <map>\\n#include <complex>\\n#include <iterator>\\n#include <cstdlib>\\n#include <cstring>\\n#include <sstream>\\n#include <stack>\\n\\nusing namespace std;\\n\\nconst double EPS=(1e-10);\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\ntypedef complex<double> P;\\ntypedef pair<P,P> Rect;\\n\\nbool EQ(double a,double b){\\n return abs((a)-(b))<EPS;\\n}\\nvoid fast_stream(){\\n std::ios_base::sync_with_stdio(0);\\n}\\n\\nconst int INF=1000000000;\\nint N;\\n\\nclass Event{\\npublic:\\n double y;\\n bool isIn;\\n int id;\\n Event(){}\\n Event(double y_,bool isIn_,int id_){\\n y=y_;\\n isIn=isIn_;\\n id=id_;\\n }\\n bool operator<(const Event& e)const{\\n return e.y>this->y; \\n }\\n};\\nEvent evs[1001];\\nRect recs[1001];\\n\\nclass UnionFindTree{\\npublic:\\n // indexÌÌem[h( éWÌeð©Â¯½¢Æ«Í±±ð¼ÚQƹ¸Afindðg¤)\\n vector<int> par;\\n // indexðªÆ·éØÌN\\n vector<int> rank;\\n vector<double> ls,rs;\\n // ØÌÅål\\n int treeSize;\\npublic:\\n UnionFindTree(int initTreeSize = 1000){\\n // øÅ^¦çê½lðÅåi[Æ·éUnionFindTreeÌì¬\\n treeSize = initTreeSize;\\n init();\\n }\\n void init(){\\n for(int i = 0; i < treeSize; i++){\\n par.push_back(i);\\n rank.push_back(0);\\n ls.push_back(0);\\n rs.push_back(0);\\n }\\n }\\n // ^¦ç꽪i[³êÄ¢éØÌ[gðTõ\\n int find(int x){ \\n if(par[x] == x)return x;\\n else return par[x] = find(par[x]);\\n }\\n // aWðÆéB½¾µ±±ÅÍeWÌeÌt¯Ö¦ÍN±çÈ¢\\n void unite(int x,int y,double l,double r){\\n x = find(x);\\n y = find(y);\\n if(x == y)return;\\n if(rank[x] < rank[y])par[x] = y;\\n else{\\n par[y] = x;\\n if(rank[y] == rank[x])rank[x]++;\\n }\\n int p=find(x);\\n ls[p]=l;\\n rs[p]=r;\\n }\\n bool same(int x,int y){\\n return find(x) == find(y);\\n }\\n};\\n\\nint main(){\\n int cnt=0;\\n while(cin>>N&&N){\\n int NN=0;\\n for(int i=0;i<N;i++){\\n double x,y,r;\\n cin>>x>>y>>r;\\n recs[i].first=P(x-r,y-r);\\n recs[i].second=P(x+r,y+r);\\n if(EQ(r,0))continue;\\n evs[2*NN]=Event(y-r,true,i);\\n evs[2*NN+1]=Event(y+r,false,i);\\n NN++;\\n }\\n sort(evs,evs+2*NN);\\n double prvy=-INF;\\n double sumLen=0;\\n double res=0;\\n vector<int> v;\\n // y̬³¢ÔÉCxgð\\n for(int k=0;k<2*NN;k++){\\n Event &e=evs[k];\\n if(!EQ(prvy,-INF))res+=sumLen*(e.y-prvy);\\n prvy=e.y;\\n // _ÌÇÁAí\\n if(e.isIn)v.push_back(e.id);\\n else v.erase(find(v.begin(),v.end(),e.id));\\n // ¡ñÌ¡ðvZ\\n UnionFindTree uft(v.size());\\n for(int i=0;i<v.size();i++){\\n\\tuft.ls[i]=recs[v[i]].first.real();\\n\\tuft.rs[i]=recs[v[i]].second.real();\\n }\\n for(int i=0;i<v.size();i++){\\n\\tfor(int j=i+1;j<v.size();j++){\\n\\t // Íͪ©Ôéæ¤ÈçÎAunite\\n\\t if((EQ(uft.rs[uft.find(i)]\\n\\t\\t ,uft.ls[uft.find(j)])\\n\\t ||(uft.rs[uft.find(i)]\\n\\t\\t >uft.ls[uft.find(j)]))\\n\\t &&(EQ(uft.ls[uft.find(i)]\\n\\t\\t ,uft.rs[uft.find(j)])\\n\\t\\t||(uft.ls[uft.find(i)]\\n\\t\\t <uft.rs[uft.find(j)]))){\\n\\t double minx=min(uft.ls[uft.find(i)]\\n\\t\\t\\t ,uft.ls[uft.find(j)]);\\n\\t double maxx=max(uft.rs[uft.find(i)]\\n\\t\\t\\t ,uft.rs[uft.find(j)]);\\n\\t uft.unite(i,j,minx,maxx);\\n\\t }\\n\\t}\\n }\\n set<int> s;\\n for(int i=0;i<v.size();i++)\\n\\ts.insert(uft.find(i));\\n sumLen=0;\\n for(set<int>::iterator it\\n\\t =s.begin();it!=s.end();it++){\\n\\tsumLen+=(uft.rs[*it]-uft.ls[*it]);\\n }\\n }\\n cnt++;\\n printf(\\\"%d %.2f\\\\n\\\",cnt,res);\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 0,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1202_366524\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<vector>\\n#include<algorithm>\\nusing namespace std;\\n\\nstruct R\\n{\\n\\tdouble x1,x2,y1,y2;\\n\\tR(double x1,double x2,double y1,double y2):x1(x1),x2(x2),y1(y1),y2(y2){}\\n};\\nbool F(const R &a,const R &b)\\n{\\n\\treturn(a.x1<b.x2&&b.x1<a.x2&&a.y1<b.y2&&b.y1<a.y2);\\n}\\nint main()\\n{\\n\\tint n,i,j,k,T=0;\\n\\tdouble x,y,p,res;\\n\\twhile(scanf(\\\"%d\\\",&n),n)\\n\\t{\\n\\t\\tvector<R>v;\\n\\t\\tvector<double>vx,vy;\\n\\t\\twhile(n--)\\n\\t\\t{\\n\\t\\t\\tscanf(\\\"%lf%lf%lf\\\",&x,&y,&p);\\n\\t\\t\\tv.push_back(R(x-p,x+p,y-p,y+p));\\n\\t\\t\\tvx.push_back(x-p);\\n\\t\\t\\tvx.push_back(x+p);\\n\\t\\t\\tvy.push_back(y-p);\\n\\t\\t\\tvy.push_back(y+p);\\n\\t\\t}\\n\\t\\tint f;\\n\\t\\tres=0;\\n\\t\\tsort(vx.begin(),vx.end());\\n\\t\\tsort(vy.begin(),vy.end());\\n\\n\\t\\tfor(i=0;i+1<vx.size();++i)\\n\\t\\t\\tfor(j=0;j+1<vy.size();++j)\\n\\t\\t\\t\\tfor(f=k=0;k<v.size();++k)\\n\\t\\t\\t\\t\\tif(F(v[k],R(vx[i],vx[i+1],vy[j],vy[j+1])))\\n\\t\\t\\t\\t\\t\\tif(f++==0)\\n\\t\\t\\t\\t\\t\\t\\tres+=(vx[i+1]-vx[i])*(vy[j+1]-vy[j]);\\n\\t\\tprintf(\\\"%d %.2f\\\\n\\\",++T,res);\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 0,\n \"score_of_the_acc\": -0.086,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1202_236739\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n#include <iomanip>\\n#include <algorithm>\\n#include <cmath>\\n#include <string>\\n#include <vector>\\n#include <list>\\n#include <queue>\\n#include <stack>\\n#include <set>\\n#include <map>\\n#include <bitset>\\n#include <numeric>\\n#include <climits>\\n#include <cfloat>\\nusing namespace std;\\n\\nint main()\\n{\\n int sequenceNum = 0;\\n for(;;){\\n int n;\\n cin >> n;\\n if(n == 0)\\n return 0;\\n\\n vector<double> x(2*n), y(2*n), x1(n), y1(n), x2(n), y2(n);\\n for(int i=0; i<n; ++i){\\n double x0, y0, r;\\n cin >> x0 >> y0 >> r;\\n x[2*i] = x1[i] = x0 - r;\\n x[2*i+1] = x2[i] = x0 + r;\\n y[2*i] = y1[i] = y0 - r;\\n y[2*i+1] = y2[i] = y0 + r;\\n }\\n sort(x.begin(), x.end());\\n sort(y.begin(), y.end());\\n\\n double ret = 0.0;\\n for(int i=0; i<2*n-1; ++i){\\n for(int j=0; j<2*n-1; ++j){\\n for(int k=0; k<n; ++k){\\n if(x1[k] <= x[i] && x[i+1] <= x2[k] && y1[k] <= y[j] && y[j+1] <= y2[k]){\\n ret += (y[j+1] - y[j]) * (x[i+1] - x[i]);\\n break;\\n }\\n }\\n }\\n }\\n printf(\\\"%d %.02f\\\\n\\\", ++sequenceNum, ret);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 988,\n \"score_of_the_acc\": -0.3208,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1202_236737\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n#include <iomanip>\\n#include <algorithm>\\n#include <cmath>\\n#include <string>\\n#include <vector>\\n#include <list>\\n#include <queue>\\n#include <stack>\\n#include <set>\\n#include <map>\\n#include <bitset>\\n#include <numeric>\\n#include <climits>\\n#include <cfloat>\\nusing namespace std;\\n\\nconst double EPS = 1.0e-10;\\n\\nclass Point\\n{\\npublic:\\n double y, x;\\n Point(){\\n y = x = 0.0;\\n }\\n Point(double y0, double x0){\\n y = y0;\\n x = x0;\\n }\\n};\\n\\nint main()\\n{\\n int sequenceNum = 0;\\n for(;;){\\n int n;\\n cin >> n;\\n if(n == 0)\\n return 0;\\n\\n vector<double> x(2*n), y(2*n);\\n vector<Point> p1(n), p2(n);\\n for(int i=0; i<n; ++i){\\n double x0, y0, r;\\n cin >> x0 >> y0 >> r;\\n x[2*i] = p1[i].x = x0 - r;\\n x[2*i+1] = p2[i].x = x0 + r;\\n y[2*i] = p1[i].y = y0 - r;\\n y[2*i+1] = p2[i].y = y0 + r;\\n }\\n sort(x.begin(), x.end());\\n sort(y.begin(), y.end());\\n\\n double ret = 0.0;\\n for(int i=0; i<2*n-1; ++i){\\n for(int j=0; j<2*n-1; ++j){\\n for(int k=0; k<n; ++k){\\n if(p1[k].x <= x[i] && x[i+1] <= p2[k].x && p1[k].y <= y[j] && y[j+1] <= p2[k].y){\\n ret += (y[j+1] - y[j]) * (x[i+1] - x[i]);\\n break;\\n }\\n }\\n }\\n }\\n printf(\\\"%d %.02f\\\\n\\\", ++sequenceNum, ret);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 988,\n \"score_of_the_acc\": -0.3208,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1202_183990\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <cstdio>\\n#include <complex>\\n#include <algorithm>\\nusing namespace std;\\ndouble unit = 0.001;\\ntypedef complex<double> P;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n\\nbool cmp(const pair<P,P>&a,const pair<P,P>&b){\\n\\treturn a.first.imag() < b.first.imag();\\n}\\nint main(){\\n\\tint n,N=0;\\n\\twhile(cin >> n ,n){\\n\\t\\tvector< pair<P,P> > data;\\n\\t\\tdouble ans = 0;\\n\\t\\trep(i,n){\\n\\t\\t\\tdouble a,b,r;\\n\\t\\t\\tcin >> a >> b >> r;\\n\\t\\t\\tdata.push_back(make_pair(P(a-r,b-r),P(a+r,b+r)));\\n\\t\\t}\\n\\t\\tsort(data.begin(),data.end(),cmp);\\n\\t\\tfor(double x=-200;x<=400;x += unit){\\n\\t\\t\\tvector< pair<double,double> > L;\\n\\t\\t\\trep(i,n){\\n\\t\\t\\t\\tif(data[i].first.real() <= x && x <= data[i].second.real()){\\n\\t\\t\\t\\t\\tL.push_back(make_pair(data[i].first.imag(),data[i].second.imag()));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(L.size() == 0)continue;\\n\\t\\t\\tdouble sz = 0;\\n\\t\\t\\tdouble cs = L[0].first, ce = L[0].second;\\t\\t\\n\\t\\t\\tfor(int i=1;i<L.size();i++){\\n\\t\\t\\t\\tif(L[i].first <= ce)ce = max(ce,L[i].second);\\n\\t\\t\\t\\telse sz += ce-cs , cs = L[i].first , ce = L[i].second;\\n\\t\\t\\t}\\n\\t\\t\\tsz += ce-cs;\\n\\t\\t\\tans += sz * unit;\\n\\t\\t}\\n\\t\\tprintf(\\\"%d %.2lf\\\\n\\\",++N,ans);\\n\\t}\\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 660,\n \"memory_kb\": 988,\n \"score_of_the_acc\": -0.9875,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1202_170882\",\n \"code_snippet\": \"#include<iostream>\\n#include<cmath>\\n#include<vector>\\n#include<set>\\n#include<map>\\n#include<complex>\\n\\n#define START 0\\n#define END 1\\nusing namespace std;\\n\\ntypedef complex<double> point;\\n\\nconst double infty = 1e40;\\nconst double eps = 1e-10;\\n\\nbool eq(double a, double b){\\n return abs(b-a) < eps;\\n}\\n\\nstruct anntena{\\n point ul, rd;\\n anntena(point a, point b):ul(a),rd(b){}\\n bool isinside(const point &t){\\n if( ul.real()<=t.real()&&t.real()<=rd.real()&&\\n\\tul.imag()>=t.imag()&&t.imag()>=rd.imag())return true;\\n return false;\\n }\\n};\\n\\nint main()\\n{\\n int n;\\n int tc=1;\\n while(cin>>n && n>0){\\n double res = 0;\\n set<double> X;\\n set<double> Y;\\n vector<anntena> va;\\n\\n for(int i = 0; i < n; ++i){\\n double x,y,r;\\n scanf(\\\"%lf%lf%lf\\\", &x, &y, &r);\\n X.insert(x-r);\\n X.insert(x+r);\\n Y.insert(y-r);\\n Y.insert(y+r);\\n va.push_back( anntena(point(x-r,y+r), point(x+r,y-r) ) );\\n }\\n for(set<double>::iterator itx = X.begin(); itx != X.end(); ++itx){\\n\\n double x = *itx;\\n ++itx;\\n if(itx==X.end())break;\\n double nx = *itx;\\n --itx;\\n double span_x = nx - x;\\n for(set<double>::iterator ity = Y.begin(); ity != Y.end(); ++ity){\\n\\tdouble y = *ity;\\n\\t++ity;\\n\\tif(ity==Y.end())break;\\n\\tdouble ny = *ity;\\n\\t--ity;\\n\\tdouble span_y = ny - y;\\n\\tpoint cent = point((x+nx)/2,(y+ny)/2);\\n\\tbool cent_cont = false;\\n\\tfor(int i = 0; i < (int)va.size(); ++i){\\n\\t if( va[i].isinside( cent ) ) cent_cont = true;\\n\\t}\\n\\tif( cent_cont ){\\n\\t res += span_x * span_y;\\n\\t}\\n } \\n }\\n printf(\\\"%d %.2lf\\\\n\\\", tc, res);\\n ++tc;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 0,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1202_170881\",\n \"code_snippet\": \"#include<iostream>\\n#include<cmath>\\n#include<vector>\\n#include<set>\\n#include<map>\\n#include<complex>\\n\\n#define START 0\\n#define END 1\\nusing namespace std;\\n\\ntypedef complex<double> point;\\n\\nconst double infty = 1e40;\\nconst double eps = 1e-10;\\n\\nbool eq(double a, double b){\\n return abs(b-a) < eps;\\n}\\n\\nstruct anntena{\\n point ul, rd;\\n anntena(point a, point b):ul(a),rd(b){}\\n bool isinside(const point &t){\\n if( ul.real()<=t.real()&&t.real()<=rd.real()&&\\n\\tul.imag()>=t.imag()&&t.imag()>=rd.imag())return true;\\n return false;\\n }\\n};\\n\\nint main()\\n{\\n int n;\\n int tc=1;\\n while(cin>>n && n>0){\\n double res = 0;\\n set<double> X;\\n set<double> Y;\\n vector<anntena> va;\\n\\n for(int i = 0; i < n; ++i){\\n double x,y,r;\\n scanf(\\\"%lf%lf%lf\\\", &x, &y, &r);\\n //cin >> x >> y >> r;\\n X.insert(x-r);\\n X.insert(x+r);\\n Y.insert(y-r);\\n Y.insert(y+r);\\n va.push_back( anntena(point(x-r,y+r), point(x+r,y-r) ) );\\n }\\n for(set<double>::iterator itx = X.begin(); itx != X.end(); ++itx){\\n\\n double x = *itx;\\n ++itx;\\n if(itx==X.end())break;\\n double nx = *itx;\\n --itx;\\n double span_x = nx - x;\\n for(set<double>::iterator ity = Y.begin(); ity != Y.end(); ++ity){\\n\\tdouble y = *ity;\\n\\t++ity;\\n\\tif(ity==Y.end())break;\\n\\tdouble ny = *ity;\\n\\t--ity;\\n\\tdouble span_y = ny - y;\\n\\t/*\\n\\tpoint lu = point(x,ny);\\n\\tpoint ru = point(nx,ny);\\n\\tpoint ld = point(x,y);\\n\\tpoint rd = point(nx,y);\\n\\t*/\\n\\tpoint cent = point((x+nx)/2,(y+ny)/2);\\n\\t//bool lu_cont = false;\\n\\t//bool rd_cont = false;\\n\\tbool cent_cont = false;\\n\\tfor(int i = 0; i < (int)va.size(); ++i){\\n\\t if( va[i].isinside( cent ) ) cent_cont = true;\\n\\t //if( va[i].isinside( rd ) ) rd_cont = true;\\n\\t}\\n\\tif( cent_cont ){//&& rd_cont ){\\n\\t res += span_x * span_y;\\n\\t}\\n } \\n }\\n printf(\\\"%d %.2lf\\\\n\\\", tc, res);\\n ++tc;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 0,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":671,"cells":{"group_id":{"kind":"string","value":"aoj_1201_cpp"},"problem_description":{"kind":"string","value":"Problem B:\nLattice Practices\nOnce upon a time, there was a king who loved beautiful costumes very much. The king had a special cocoon bed to make excellent cloth of silk. The cocoon bed had 16 small square rooms, forming a 4 × 4 lattice, for 16 silkworms. The cocoon bed can be depicted as follows:\nThe cocoon bed can be divided into 10 rectangular boards, each of which has 5 slits:\nNote that, except for the slit depth, there is no difference between the left side and the right side of the board (or, between the front and the back); thus, we cannot distinguish a symmetric board from its rotated image as is shown in the following:\nSlits have two kinds of depth, either shallow or deep. The cocoon bed should be constructed by fitting five of the boards vertically and the others horizontally, matching a shallow slit with a deep slit.\nYour job is to write a program that calculates the number of possible configurations to make the lattice. You may assume that there is no pair of identical boards. Notice that we are interested in the number of essentially different configurations and therefore you should not count mirror image configurations and rotated configurations separately as different configurations.\nThe following is an example of mirror image and rotated configurations, showing vertical and horizontal boards separately, where shallow and deep slits are denoted by '1' and '0' respectively.\nNotice that a rotation may exchange position of a vertical board and a horizontal board.\nInput\nThe input consists of multiple data sets, each in a line. A data set gives the patterns of slits of 10 boards used to construct the lattice. The format of a data set is as follows:\nXXXXX XXXXX XXXXX XXXXX XXXXX XXXXX XXXXX XXXXX XXXXX XXXXX\nEach x is either '0' or '1'. '0' means a deep slit, and '1' a shallow slit. A block of five slit descriptions corresponds to a board. There are 10 blocks of slit descriptions in a line. Two adjacent blocks are separated by a space.\nFor example, the first data set in the Sample Input means the set of the following 10 boards:\nThe end of the input is indicated by a line consisting solely of three characters \"END\".\nOutput\nFor each data set, the number of possible configurations to make the lattice from the given 10 boards should be output, each in a separate line.\nSample Input\n10000 01000 00100 11000 01100 11111 01110 11100 10110 11110\n10101 01000 00000 11001 01100 11101 01110 11100 10110 11010\nEND\nOutput for the Sample Input\n40\n6"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1201_9634679","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\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())\n#define UB(A,x) (upper_bound(ALL(A),x)-A.begin())\nint main(){\n while(1){\n vector<string>S(10);\n REP(i,10)cin>>S[i];\n vector<string>revS=S;\n REP(i,10)reverse(ALL(revS[i]));\n if(S[0]==\"END\")return 0;\n ll ans=0;\n REP(i,9)REP(j,9)if(i!=j)REP(k,9)if(k!=i&&k!=j)REP(l,9)if(l!=i&&l!=j&&l!=k)REP(m,i)if(m!=i&&m!=j&&m!=k&&m!=l){\n vector<string>T,revT,U={S[i],S[j],S[k],S[l],S[m]},revU={revS[i],revS[j],revS[k],revS[l],revS[m]};\n REP(n,10)if(n!=i&&n!=j&&n!=k&&n!=l&&n!=m){\n T.emplace_back(S[n]);\n revT.emplace_back(revS[n]);\n }\n REP(n,32){\n bool ok=1;\n REP(o,5)if((n>>o)%2&&U[o]==revU[o]){ok=0;break;}\n if(!ok)continue;\n vector<bool>K(5);\n REP(o,5){\n string t;\n REP(p,5){\n if((n>>p)%2)t+=revU[p][o];\n else t+=U[p][o];\n }\n REP(p,5)t[p]='1'+'0'-t[p];\n ll a=0;\n while(a<5&&T[a]!=t&&revT[a]!=t)a++;\n if(a==5||K[a]){ok=0;break;}\n K[a]=1;\n }\n if(ok){\n //cout<<S[i]<<endl<<S[j]<<endl<<S[k]<<endl<<S[l]<<endl<<S[m]<<endl;\n ans++;\n }\n }\n }\n ans/=2;\n cout<<ans<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":100,"memory_kb":3132,"score_of_the_acc":-0.0841,"final_rank":7},{"submission_id":"aoj_1201_5372353","code_snippet":"#include <iostream>\n#include<vector>\n#include<algorithm>\n#include<utility>\n#include<math.h>\n#include<iomanip>\n#include<string>\n#include <cassert>\n#include <complex>\n#include<bits/stdc++.h>\n\n#define rep(s,i,n) for(int i = s;i < n;i++)\n \nusing namespace std;\n \ntypedef long long ll; //10e18くらい\ntypedef long double ld;\ntypedef __int128_t lll;\ntypedef pair<ll, ll> pll;\n \nconst int dx[] = { 0,1,0,-1 };\nconst int dy[] = { 1,0,-1,0 };\nconst ll LongINF = 1e13 + 7;\nconst int INF = 1e9 + 7;\nconst ll LL_MAX = 9223372036854775807;\nconst ll LL_MIN = -9223372036854775807;\nconst double pi = 3.141592653589793;\n\n\nint dsp[3] = {-1,0,1};\n\n// int keta(ll i){\n\n// int keta = 0;\n// do{\n// keta++;\n// }while(i /= 10);\n\n// return keta;\n// }\n//素因数分解 O(√n)\n// vector<pair<ll,ll>> pfactor(ll n){\n// vector<pair<ll,ll>> factor;\n// ll ex; //指数\n// for(ll a = 2; a * a <= n; a++){\n// if(n % a != 0)continue;\n\n// ll ex = 0;\n\n// while(n % a == 0){\n// n /= a;\n// ex++;\n// }\n\n// factor.push_back({a,ex});\n// }\n\n// if(n != 1) factor.push_back({n,1});\n\n// return factor; \n// }\n\nstring s[10];\nstring srev[10];\nstring H[5];\nstring W[5];\nbool symm[10];//ブロックのスリットに対称性があるかどうか\n//噛み合うかどうか確認する\nbool check(int idx){\n rep(0,i,5){\n if(W[idx][i] == H[i][idx]) return false;\n }\n return true;\n}\n\nint solve(int idx,int S){\n if(S == (1<<10) - 1){\n return 1;\n }\n\n int res = 0;\n\n rep(0,i,10){\n //使ったブロックを、もう一度使うことは出来ない\n if( (S >> i) & 1)continue;\n //初めは縦に置く(idx < 5まで ＝ 初めの五回)\n if(idx < 5){\n H[idx] = s[i];\n //S i番目のブロックを使ったらsのiビット目が1になる\n res += solve(idx + 1,S| 1 << i);\n //対称性がないなら同じところに逆向きにおいてみる\n if(!symm[i]){\n H[idx] = srev[i];\n res += solve(idx + 1, S | (1 << i));\n }\n //縦に置き終わったら、横においていく\n }else{\n W[idx - 5] = s[i];\n if(check(idx - 5)){\n res += solve(idx + 1,S | (1 << i));\n }\n if(!symm[i]){\n W[idx - 5] = srev[i];\n if(check(idx - 5)){\n res += solve(idx + 1,S | (1 << i));\n }\n }\n\n }\n }\n \n return res;\n}\n\n\n\n\nint main(void){\n\n \n while(cin >> s[0],s[0] != \"END\"){\n memset(symm,false,sizeof(symm));\n srev[0] = s[0];\n reverse(srev[0].begin(),srev[0].end());\n symm[0] = (s[0] == srev[0]);\n\n rep(0,i,9){\n cin >> s[i + 1];\n srev[i + 1] = s[i + 1];\n reverse(srev[i + 1].begin(),srev[i + 1].end());\n symm[i + 1] = (s[i + 1] == srev[i + 1]);//sとsrevが同じなら対称性がある\n }\n cout << solve(0,0)/8 << endl;\n\n // rep(0,i,10){\n // cout << s[i] << \":\" ;\n\n // cout << srev[i] << endl;\n // }\n \n } \n \n \n return 0;\n\n}","accuracy":1,"time_ms":1580,"memory_kb":3180,"score_of_the_acc":-0.2779,"final_rank":10},{"submission_id":"aoj_1201_5035256","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nconst int N=10;\n\nstring slit[N+N];\nint choose[N],used[N];\n\n\nint check(int n) {\n int k=n/2;\n for (int i=n-1; i>=0; i-=2) {\n if (slit[choose[i]][k]+slit[choose[n]][i/2]!='0'+'1') return 0;\n }\n return 1;\n}\n\nint search(int n) {\n if (n==N) return 1;\n\n int cnt=0;\n for (int i=0; i<N; i++) {\n if (used[i]) continue;\n used[i]=1;\n\n choose[n]=i;\n if (check(n)) cnt+=search(n+1);\n\n if (!slit[N+i].empty()) {\n choose[n]=N+i;\n if (check(n)) cnt+=search(n+1);\n }\n\n used[i]=0;\n }\n return cnt;\n}\n\nint solve() {\n cin>>slit[0];\n if (slit[0]==\"END\") return 0;\n for (int i=1; i<N; i++) cin>>slit[i];\n\n for (int i=0; i<N; i++) {\n string rev(rbegin(slit[i]),rend(slit[i]));\n slit[N+i]=(rev!=slit[i] ? rev : \"\");\n }\n\n memset(used,0,sizeof(used));\n cout<<search(0)/8<<'\\n';\n\n return 1;\n}\n\nint main() {\n while (solve());\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3288,"score_of_the_acc":-0.0776,"final_rank":5},{"submission_id":"aoj_1201_4994264","code_snippet":"#include <cmath>\n#include <vector>\n#include <iostream>\n#include <algorithm>\n#include <set>\n#include <iomanip>\n#include <queue>\n#include <string>\n#include <map>\n#include <fstream>\n#include <cassert>\n#include <stack>\n#include <climits>\n#include <array>\n#include <unordered_set>\n#include <unordered_map>\n#include <memory>\n#include <functional>\n#include <cfloat>\n#include <numeric>\n#include <random>\n#include <sstream>\n#include <bitset>\nusing namespace std;\nint reverse(int n) {\n\tint result{ 0 };\n\tfor (auto i = 0; i < 5; ++i) {\n\t\tresult <<= 1;\n\t\tresult += n & 1;\n\t\tn >>= 1;\n\t}\n\treturn result;\n}\ntemplate<typename B>\nvoid iterate(const std::vector<int>& a, const int current, const int count, const B& block, std::vector<int> &use, std::vector<int>& not_use) {\n\tif (current == a.size()) {\n\t\treturn block(use, not_use);\n\t}\n\tif (a.size() > current + count) {\n\t\tnot_use.push_back(a[current]);\n\t\titerate(a, current + 1, count, block, use, not_use);\n\t\tnot_use.pop_back();\n\t}\n\tif (count > 0) {\n\t\tuse.push_back(a[current]);\n\t\titerate(a, current + 1, count - 1, block, use, not_use);\n\t\tuse.pop_back();\n\t}\n}\ntemplate<typename B>\nvoid iterate(const std::vector<int> &a, const B& block) {\n\tstd::vector<int> use, not_use; use.reserve(5); not_use.reserve(5);\n\tuse.push_back(a[0]);\n\titerate(a, 1, 4, block, use, not_use);\n}\n\nint solve(std::vector<int> boards) {\n\tfor (auto& a : boards) {\n\t\tif (a > reverse(a)) a = reverse(a);\n\t}\n\tstd::sort(boards.begin(), boards.end());\n\tint count{ 0 };\n\tconst auto block = [&count](std::vector<int> horizontal, std::vector<int> vertical) {\n\t\tstd::vector<int> index(5), actual(5); std::iota(index.begin(), index.end(), 0);\n\t\tint mask{ 0 }, c{ 0 };\n\t\tfor (auto i = 0; i < 5; ++i) {\n\t\t\tif (horizontal[i] == reverse(horizontal[i])) mask += 1 << i;\n\t\t}\n\t\tdo {\n\t\t\tif (index[0] > index[4]) continue;\n\t\t\tfor (auto pattern = 0; pattern < 32; ++pattern) {\n\t\t\t\tif ((mask & pattern) != 0) continue;\n\t\t\t\tfor (auto i = 0; i < 5; ++i) {\n\t\t\t\t\tactual[i] = (pattern >> index[i] & 1) == 0 ? horizontal[index[i]] : reverse(horizontal[index[i]]);\n\t\t\t\t}\n\t\t\t\tfor (auto i = 0; i < 5; ++i) {\n\t\t\t\t\tint target{ 0 };\n\t\t\t\t\tfor (auto j = 0; j < 5; ++j) {\n\t\t\t\t\t\ttarget += (((actual[j] >> i) & 1) ^ 1) << j;\n\t\t\t\t\t}\n\t\t\t\t\tauto find = std::find(vertical.begin() + i, vertical.end(), target);\n\t\t\t\t\tif (find == vertical.end()) {\n\t\t\t\t\t\tfind = std::find(vertical.begin() + i, vertical.end(), reverse(target));\n\t\t\t\t\t}\n\t\t\t\t\tif (find == vertical.end()) {\n\t\t\t\t\t\t--c;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tstd::swap(vertical[i], *find);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t++c;\n\t\t\t}\n\t\t} while (std::next_permutation(index.begin(), index.end()));\n\t\tcount += c;\n\t};\n\titerate(boards, block);\n\treturn count >> 1;\n}\n\nint main() {\n\twhile (true) {\n\t\tstd::string first; std::cin >> first;\n\t\tif (first == \"END\") break;\n\t\tstd::vector<int> boards(10);\n\t\tboards[0] = std::stoi(first, nullptr, 2);\n\t\tfor (auto i = 1; i < 10; ++i) {\n\t\t\tstd::cin >> first;\n\t\t\tboards[i] = std::stoi(first, nullptr, 2);\n\t\t}\n\t\tstd::cout << solve(boards) << '\\n';\n\t}\n}","accuracy":1,"time_ms":30,"memory_kb":3296,"score_of_the_acc":-0.0805,"final_rank":6},{"submission_id":"aoj_1201_2590910","code_snippet":"#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\n#include <time.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\nchar table[20][6];\n\nint ans;\n\nvoid recursive(bool used[20],int yoko[5],int yoko_index,int tate[5],int tate_index,bool is_pre_yoko){\n\n\tif(is_pre_yoko == false && tate_index == 5){\n\t\tans++;\n\t\treturn;\n\t}\n\n\tif(is_pre_yoko == false){\n\n\t\tswitch(yoko_index){\n\t\tcase 0:\n\t\t\tfor(int i = 0; i < 20; i++){\n\t\t\t\tif(used[i] == false){\n\t\t\t\t\tint next_yoko[5];\n\t\t\t\t\tnext_yoko[0] = i;\n\t\t\t\t\tbool next_used[20];\n\t\t\t\t\tfor(int k = 0; k < 20; k++)next_used[k] = used[k];\n\t\t\t\t\tnext_used[i] = true;\n\t\t\t\t\tif(i <= 9)next_used[i+10] = true;\n\t\t\t\t\telse{\n\t\t\t\t\t\tnext_used[i-10] = true;\n\t\t\t\t\t}\n\t\t\t\t\trecursive(next_used,next_yoko,yoko_index+1,tate,tate_index,true);\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak;\n\t\tcase 1:\n\t\t\tfor(int i = 0; i < 20; i++){\n\t\t\t\tif(used[i] == false && abs(table[tate[0]][1]-table[i][0]) == 1){\n\t\t\t\t\tint next_yoko[5];\n\t\t\t\t\tfor(int k = 0; k < 1; k++)next_yoko[k] = yoko[k];\n\t\t\t\t\tnext_yoko[1] = i;\n\t\t\t\t\tbool next_used[20];\n\t\t\t\t\tfor(int k = 0; k < 20; k++)next_used[k] = used[k];\n\t\t\t\t\tnext_used[i] = true;\n\t\t\t\t\tif(i <= 9)next_used[i+10] = true;\n\t\t\t\t\telse{\n\t\t\t\t\t\tnext_used[i-10] = true;\n\t\t\t\t\t}\n\t\t\t\t\trecursive(next_used,next_yoko,yoko_index+1,tate,tate_index,true);\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak;\n\t\tcase 2:\n\t\t\tfor(int i = 0; i < 20; i++){\n\t\t\t\tif(used[i] == false && abs(table[tate[0]][2]-table[i][0]) == 1 && abs(table[tate[1]][2]-table[i][1]) == 1){\n\t\t\t\t\tint next_yoko[5];\n\t\t\t\t\tfor(int k = 0; k < 2; k++)next_yoko[k] = yoko[k];\n\t\t\t\t\tnext_yoko[2] = i;\n\t\t\t\t\tbool next_used[20];\n\t\t\t\t\tfor(int k = 0; k < 20; k++)next_used[k] = used[k];\n\t\t\t\t\tnext_used[i] = true;\n\t\t\t\t\tif(i <= 9)next_used[i+10] = true;\n\t\t\t\t\telse{\n\t\t\t\t\t\tnext_used[i-10] = true;\n\t\t\t\t\t}\n\t\t\t\t\trecursive(next_used,next_yoko,yoko_index+1,tate,tate_index,true);\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak;\n\t\tcase 3:\n\t\t\tfor(int i = 0; i < 20; i++){\n\t\t\t\tif(used[i] == false && abs(table[tate[0]][3]-table[i][0]) == 1 && abs(table[tate[1]][3]-table[i][1]) == 1 &&\n\t\t\t\t\t\tabs(table[tate[2]][3]-table[i][2]) == 1 ){\n\t\t\t\t\tint next_yoko[5];\n\t\t\t\t\tfor(int k = 0; k < 3; k++)next_yoko[k] = yoko[k];\n\t\t\t\t\tnext_yoko[3] = i;\n\t\t\t\t\tbool next_used[20];\n\t\t\t\t\tfor(int k = 0; k < 20; k++)next_used[k] = used[k];\n\t\t\t\t\tnext_used[i] = true;\n\t\t\t\t\tif(i <= 9)next_used[i+10] = true;\n\t\t\t\t\telse{\n\t\t\t\t\t\tnext_used[i-10] = true;\n\t\t\t\t\t}\n\t\t\t\t\trecursive(next_used,next_yoko,yoko_index+1,tate,tate_index,true);\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak;\n\t\tcase 4:\n\t\t\tfor(int i = 0; i < 20; i++){\n\t\t\t\tif(used[i] == false && abs(table[tate[0]][4]-table[i][0]) == 1 && abs(table[tate[1]][4]-table[i][1]) == 1 &&\n\t\t\t\t\t\tabs(table[tate[2]][4]-table[i][2]) == 1 && abs(table[tate[3]][4]-table[i][3]) == 1){\n\t\t\t\t\tint next_yoko[5];\n\t\t\t\t\tfor(int k = 0; k < 4; k++)next_yoko[k] = yoko[k];\n\t\t\t\t\tnext_yoko[4] = i;\n\t\t\t\t\tbool next_used[20];\n\t\t\t\t\tfor(int k = 0; k < 20; k++)next_used[k] = used[k];\n\t\t\t\t\tnext_used[i] = true;\n\t\t\t\t\tif(i <= 9)next_used[i+10] = true;\n\t\t\t\t\telse{\n\t\t\t\t\t\tnext_used[i-10] = true;\n\t\t\t\t\t}\n\t\t\t\t\trecursive(next_used,next_yoko,yoko_index+1,tate,tate_index,true);\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\n\t}else{\n\n\t\tswitch(tate_index){\n\t\tcase 0:\n\t\t\tfor(int i = 0; i < 20; i++){\n\t\t\t\tif(used[i] == false && abs(table[yoko[0]][0] - table[i][0]) == 1){\n\t\t\t\t\tint next_tate[5];\n\t\t\t\t\tnext_tate[0] = i;\n\t\t\t\t\tbool next_used[20];\n\t\t\t\t\tfor(int k = 0; k < 20; k++)next_used[k] = used[k];\n\t\t\t\t\tnext_used[i] = true;\n\t\t\t\t\tif(i <= 9)next_used[i+10] = true;\n\t\t\t\t\telse{\n\t\t\t\t\t\tnext_used[i-10] = true;\n\t\t\t\t\t}\n\t\t\t\t\trecursive(next_used,yoko,yoko_index,next_tate,tate_index+1,false);\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak;\n\t\tcase 1:\n\t\t\tfor(int i = 0; i < 20; i++){\n\t\t\t\tif(used[i] == false && abs(table[yoko[0]][1] - table[i][0]) == 1 && abs(table[yoko[1]][1]-table[i][1]) == 1){\n\t\t\t\t\tint next_tate[5];\n\t\t\t\t\tfor(int k = 0; k < 1; k++)next_tate[k] = tate[k];\n\t\t\t\t\tnext_tate[1] = i;\n\t\t\t\t\tbool next_used[20];\n\t\t\t\t\tfor(int k = 0; k < 20; k++)next_used[k] = used[k];\n\t\t\t\t\tnext_used[i] = true;\n\t\t\t\t\tif(i <= 9)next_used[i+10] = true;\n\t\t\t\t\telse{\n\t\t\t\t\t\tnext_used[i-10] = true;\n\t\t\t\t\t}\n\t\t\t\t\trecursive(next_used,yoko,yoko_index,next_tate,tate_index+1,false);\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak;\n\t\tcase 2:\n\t\t\tfor(int i = 0; i < 20; i++){\n\t\t\t\tif(used[i] == false && abs(table[yoko[0]][2] - table[i][0]) == 1 && abs(table[yoko[1]][2]-table[i][1]) == 1 &&\n\t\t\t\t\t\tabs(table[yoko[2]][2]-table[i][2]) == 1){\n\t\t\t\t\tint next_tate[5];\n\t\t\t\t\tfor(int k = 0; k < 2; k++)next_tate[k] = tate[k];\n\t\t\t\t\tnext_tate[2] = i;\n\t\t\t\t\tbool next_used[20];\n\t\t\t\t\tfor(int k = 0; k < 20; k++)next_used[k] = used[k];\n\t\t\t\t\tnext_used[i] = true;\n\t\t\t\t\tif(i <= 9)next_used[i+10] = true;\n\t\t\t\t\telse{\n\t\t\t\t\t\tnext_used[i-10] = true;\n\t\t\t\t\t}\n\t\t\t\t\trecursive(next_used,yoko,yoko_index,next_tate,tate_index+1,false);\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak;\n\t\tcase 3:\n\t\t\tfor(int i = 0; i < 20; i++){\n\t\t\t\tif(used[i] == false && abs(table[yoko[0]][3] - table[i][0]) == 1 && abs(table[yoko[1]][3]-table[i][1]) == 1 &&\n\t\t\t\t\t\tabs(table[yoko[2]][3]-table[i][2]) == 1 && abs(table[yoko[3]][3]-table[i][3]) == 1){\n\t\t\t\t\tint next_tate[5];\n\t\t\t\t\tfor(int k = 0; k < 3; k++)next_tate[k] = tate[k];\n\t\t\t\t\tnext_tate[3] = i;\n\t\t\t\t\tbool next_used[20];\n\t\t\t\t\tfor(int k = 0; k < 20; k++)next_used[k] = used[k];\n\t\t\t\t\tnext_used[i] = true;\n\t\t\t\t\tif(i <= 9)next_used[i+10] = true;\n\t\t\t\t\telse{\n\t\t\t\t\t\tnext_used[i-10] = true;\n\t\t\t\t\t}\n\t\t\t\t\trecursive(next_used,yoko,yoko_index,next_tate,tate_index+1,false);\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak;\n\t\tcase 4:\n\t\t\tfor(int i = 0; i < 20; i++){\n\t\t\t\tif(used[i] == false && abs(table[yoko[0]][4] - table[i][0]) == 1 && abs(table[yoko[1]][4]-table[i][1]) == 1 &&\n\t\t\t\t\t\tabs(table[yoko[2]][4]-table[i][2]) == 1 && abs(table[yoko[3]][4]-table[i][3]) == 1 && abs(table[yoko[4]][4]-table[i][4]) == 1){\n\t\t\t\t\tint next_tate[5];\n\t\t\t\t\tfor(int k = 0; k < 4; k++)next_tate[k] = tate[k];\n\t\t\t\t\tnext_tate[4] = i;\n\t\t\t\t\tbool next_used[20];\n\t\t\t\t\tfor(int k = 0; k < 20; k++)next_used[k] = used[k];\n\t\t\t\t\tnext_used[i] = true;\n\t\t\t\t\tif(i <= 9)next_used[i+10] = true;\n\t\t\t\t\telse{\n\t\t\t\t\t\tnext_used[i-10] = true;\n\t\t\t\t\t}\n\t\t\t\t\trecursive(next_used,yoko,yoko_index,next_tate,tate_index+1,false);\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t}\n}\n\nvoid func(){\n\n\tfor(int i = 1; i <= 9; i++)scanf(\"%s\",table[i]);\n\n\tbool first_used[20];\n\tfor(int i = 0; i < 20; i++)first_used[i] = false;\n\n\tfor(int i = 0; i < 10; i++){\n\t\tfor(int k = 0; k < 5; k++)table[i+10][k] = table[i][4-k];\n\n\t\tif(table[i][0] == table[i][4] && table[i][1] == table[i][3]){\n\t\t\tfirst_used[i+10] = true;\n\t\t}\n\t}\n\n\tans = 0;\n\n\tint first_yoko[5],first_tate[5];\n\n\trecursive(first_used,first_yoko,0,first_tate,0,false);\n\n\tprintf(\"%d\\n\",ans/8);\n}\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%s\",table[0]);\n\t\tif(table[0][0] == 'E')break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3168,"score_of_the_acc":-0.0749,"final_rank":4},{"submission_id":"aoj_1201_2549491","code_snippet":"#include <bits/stdc++.h>\n#define int long long\n#define N 100010\nusing namespace std;\ntypedef unsigned long long ull;\nconst int INF = 1LL<<55;\nconst int mod = (1e9)+7;\nconst double EPS = 1e-8;\nconst double PI = 6.0 * asin(0.5);\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\nvector<vector<int> > AB,A,B;\nint Aidx[5],Bidx[5];\n\nset<ull> S;\null VtoH(const vector<vector<int> > &v){\n const ull B = 1777771;\n ull res = 0;\n for(int i=0;i<5;i++)\n for(int j=0;j<5;j++) res = res * B + (v[i][j]+'0');\n return res;\n}\n\nvector<int> rev(vector<int> a){reverse(a.begin(),a.end());return a;}\nvoid mirror(vector<vector<int> > &res){for(int i=0;i<5;i++) res[i] = rev(res[i]);}\n\nvector<vector<int> > rot(const vector<vector<int> > &a){\n vector<vector<int> > res(5,vector<int>(5));\n for(int i=0;i<5;i++)\n for(int j=0;j<5;j++) res[i][j] = a[4-j][i];\n return res;\n}\n\nvoid insert(vector<vector<int> > &v){\n S.insert(VtoH(v));\n v = rot(v) , v = rot(v), S.insert(VtoH(v));\n mirror(v), S.insert(VtoH(v));\n v = rot(v) , v = rot(v), S.insert(VtoH(v));\n}\n\nbool canPut(int idx,int j){\n int a = 1, b = 1;\n for(int i=0;i<5;i++) if(A[i][j] == B[idx][i]) a = 0;\n for(int i=0;i<5;i++) if(A[i][j] == B[idx][4-i]) b = 0;\n return a || b;\n}\n\nbool can(){\n int used = 0;\n for(int i=0;i<5;i++){\n for(int nx=0;nx<5;nx++){\n if((used>>nx&1) || !canPut(nx,i)) continue;\n Bidx[i] = nx;\n used |= (1<<nx);\n break;\n }\n }\n return used == (1<<5)-1;\n}\n\nint solve(){\n S.clear();\n int res = 0;\n for(int i=0;i<5;i++) Aidx[i] = i;\n for(int bit=0;bit<(1<<10);bit++){\n if(__builtin_popcount(bit) != 5) continue; \n A.clear();B.clear();\n for(int i=0;i<10;i++) (bit>>i&1)? A.push_back(AB[i]):B.push_back(AB[i]);\n vector<vector<int> > tmp = A;\n do{\n for(int a=0;a<(1<<5);a++){\n for(int i=0;i<5;i++) A[Aidx[i]] = (a>>i&1)? rev(tmp[i]):tmp[i];\n if(!can() || S.count(VtoH(A))) continue;\n insert(A);\n res++;\n }\n } while(next_permutation(Aidx,Aidx+5));\n }\n return res/2;\n}\n\nsigned main(){\n while(1){\n AB.clear();\n for(int i=0;i<10;i++){\n string str;\n cin>>str;\n if(str == \"END\") return 0;\n vector<int> tmp(5);\n for(int j=0;j<5;j++) tmp[j] = str[j] - '0';\n AB.push_back(tmp);\n }\n cout<<solve()<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":2750,"memory_kb":3200,"score_of_the_acc":-0.4305,"final_rank":16},{"submission_id":"aoj_1201_2549490","code_snippet":"#include <bits/stdc++.h>\n#define int long long\n#define N 100010\nusing namespace std;\ntypedef unsigned long long ull;\nconst int INF = 1LL<<55;\nconst int mod = (1e9)+7;\nconst double EPS = 1e-8;\nconst double PI = 6.0 * asin(0.5);\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\nvector<vector<int> > AB,A,B;\nint Aidx[5],Bidx[5];\n\nunordered_set<ull> S;\null VtoH(const vector<vector<int> > &v){\n const ull B = 1777771;\n ull res = 0;\n for(int i=0;i<5;i++)\n for(int j=0;j<5;j++) res = res * B + (v[i][j]+'0');\n return res;\n}\n\nvector<int> rev(vector<int> a){reverse(a.begin(),a.end());return a;}\nvoid mirror(vector<vector<int> > &res){for(int i=0;i<5;i++) res[i] = rev(res[i]);}\n\nvector<vector<int> > rot(const vector<vector<int> > &a){\n vector<vector<int> > res(5,vector<int>(5));\n for(int i=0;i<5;i++)\n for(int j=0;j<5;j++) res[i][j] = a[4-j][i];\n return res;\n}\n\nvoid insert(vector<vector<int> > &v){\n S.insert(VtoH(v));\n v = rot(v) , v = rot(v), S.insert(VtoH(v));\n mirror(v), S.insert(VtoH(v));\n v = rot(v) , v = rot(v), S.insert(VtoH(v));\n}\n\nbool canPut(int idx,int j){\n int a = 1, b = 1;\n for(int i=0;i<5;i++) if(A[i][j] == B[idx][i]) a = 0;\n for(int i=0;i<5;i++) if(A[i][j] == B[idx][4-i]) b = 0;\n return a || b;\n}\n\nbool can(){\n int used = 0;\n for(int i=0;i<5;i++){\n for(int nx=0;nx<5;nx++){\n if((used>>nx&1) || !canPut(nx,i)) continue;\n Bidx[i] = nx;\n used |= (1<<nx);\n break;\n }\n }\n return used == (1<<5)-1;\n}\n\nint solve(){\n S.clear();\n int res = 0;\n for(int i=0;i<5;i++) Aidx[i] = i;\n for(int bit=0;bit<(1<<10);bit++){\n if(__builtin_popcount(bit) != 5) continue; \n A.clear();B.clear();\n for(int i=0;i<10;i++) (bit>>i&1)? A.push_back(AB[i]):B.push_back(AB[i]);\n vector<vector<int> > tmp = A;\n do{\n for(int a=0;a<(1<<5);a++){\n for(int i=0;i<5;i++) A[Aidx[i]] = (a>>i&1)? rev(tmp[i]):tmp[i];\n if(!can() || S.count(VtoH(A))) continue;\n insert(A);\n res++;\n }\n } while(next_permutation(Aidx,Aidx+5));\n }\n return res/2;\n}\n\nsigned main(){\n while(1){\n AB.clear();\n for(int i=0;i<10;i++){\n string str;\n cin>>str;\n if(str == \"END\") return 0;\n vector<int> tmp(5);\n for(int j=0;j<5;j++) tmp[j] = str[j] - '0';\n AB.push_back(tmp);\n }\n cout<<solve()<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":2760,"memory_kb":3196,"score_of_the_acc":-0.4317,"final_rank":17},{"submission_id":"aoj_1201_2549488","code_snippet":"#include <bits/stdc++.h>\n#define int long long\n#define N 100010\nusing namespace std;\ntypedef unsigned long long ull;\nconst int INF = 1LL<<55;\nconst int mod = (1e9)+7;\nconst double EPS = 1e-8;\nconst double PI = 6.0 * asin(0.5);\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\nvector<vector<int> > AB,A,B;\nint Aidx[5],Bidx[5];\n\nunordered_set<ull> S;\null VtoH(const vector<vector<int> > &v){\n const ull B = 1777771;\n ull res = 0;\n for(int i=0;i<5;i++)\n for(int j=0;j<5;j++) res = res * B + (v[i][j]+'0');\n return res;\n}\n\nvector<int> rev(vector<int> a){reverse(a.begin(),a.end());return a;}\nvoid mirror(vector<vector<int> > &res){for(int i=0;i<5;i++) res[i] = rev(res[i]);}\n\nvector<vector<int> > rot(const vector<vector<int> > &a){\n vector<vector<int> > res(5,vector<int>(5));\n for(int i=0;i<5;i++)\n for(int j=0;j<5;j++) res[i][j] = a[4-j][i];\n return res;\n}\n\nvoid insert(vector<vector<int> > v){\n S.insert(VtoH(v));\n v = rot(v) , v = rot(v), S.insert(VtoH(v));\n mirror(v), S.insert(VtoH(v));\n v = rot(v) , v = rot(v), S.insert(VtoH(v));\n}\n\nbool canPut(int idx,int j){\n int a = 1, b = 1;\n for(int i=0;i<5;i++) if(A[i][j] == B[idx][i]) a = 0;\n for(int i=0;i<5;i++) if(A[i][j] == B[idx][4-i]) b = 0;\n return a || b;\n}\n\nbool can(){\n int used = 0;\n for(int i=0;i<5;i++){\n for(int nx=0;nx<5;nx++){\n if((used>>nx&1) || !canPut(nx,i)) continue;\n Bidx[i] = nx;\n used |= (1<<nx);\n break;\n }\n }\n return used == (1<<5)-1;\n}\n\nint solve(){\n S.clear();\n int res = 0;\n for(int i=0;i<5;i++) Aidx[i] = i;\n for(int bit=0;bit<(1<<10);bit++){\n if(__builtin_popcount(bit) != 5) continue; \n A.clear();B.clear();\n for(int i=0;i<10;i++) (bit>>i&1)? A.push_back(AB[i]):B.push_back(AB[i]);\n vector<vector<int> > tmp = A;\n do{\n for(int a=0;a<(1<<5);a++){\n for(int i=0;i<5;i++) A[Aidx[i]] = (a>>i&1)? rev(tmp[i]):tmp[i];\n if(!can() || S.count(VtoH(A))) continue;\n insert(A);\n res++;\n }\n } while(next_permutation(Aidx,Aidx+5));\n }\n return res/2;\n}\n\nsigned main(){\n while(1){\n AB.clear();\n for(int i=0;i<10;i++){\n string str;\n cin>>str;\n if(str == \"END\") return 0;\n vector<int> tmp(5);\n for(int j=0;j<5;j++) tmp[j] = str[j] - '0';\n AB.push_back(tmp);\n }\n cout<<solve()<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":2730,"memory_kb":3184,"score_of_the_acc":-0.4274,"final_rank":15},{"submission_id":"aoj_1201_2549486","code_snippet":"#include <bits/stdc++.h>\n#define int long long\n#define N 100010\nusing namespace std;\ntypedef unsigned long long ull;\nconst int INF = 1LL<<55;\nconst int mod = (1e9)+7;\nconst double EPS = 1e-8;\nconst double PI = 6.0 * asin(0.5);\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\nvector<vector<int> > AB,A,B;\nint Aidx[5],Bidx[5];\n\nunordered_set<ull> S;\null VtoH(const vector<vector<int> > &v){\n const ull B = 1777771;\n ull res = 0;\n for(int i=0;i<5;i++)\n for(int j=0;j<5;j++) res = res * B + (v[i][j]+'0');\n return res;\n}\n\nvector<int> rev(vector<int> a){reverse(a.begin(),a.end());return a;}\nvoid mirror(vector<vector<int> > &res){for(int i=0;i<5;i++) res[i] = rev(res[i]);}\n\nvector<vector<int> > rot(const vector<vector<int> > &a){\n vector<vector<int> > res(5,vector<int>(5));\n for(int i=0;i<5;i++)\n for(int j=0;j<5;j++) res[i][j] = a[4-j][i];\n return res;\n}\n\nvoid insert(vector<vector<int> > v){\n S.insert(VtoH(v));\n v = rot(v) , v = rot(v), S.insert(VtoH(v));\n mirror(v), S.insert(VtoH(v));\n v = rot(v) , v = rot(v), S.insert(VtoH(v));\n}\n\nbool canPut(int idx,int j){\n int a = 1, b = 1;\n for(int i=0;i<5;i++) if(A[i][j] == B[idx][i]) a = 0;\n for(int i=0;i<5;i++) if(A[i][j] == B[idx][4-i]) b = 0;\n return a || b;\n}\n\nbool can(){\n int used = 0;\n for(int i=0;i<5;i++){\n for(int nx=0;nx<5;nx++){\n if((used>>nx&1) || !canPut(nx,i)) continue;\n Bidx[i] = nx;\n used |= (1<<nx);\n break;\n }\n }\n return used == (1<<5)-1;\n}\n\nint solve(){\n S.clear();\n int res = 0;\n for(int i=0;i<5;i++) Aidx[i] = i;\n for(int bit=0;bit<(1<<10);bit++){\n if(__builtin_popcount(bit) != 5) continue; \n A.clear();B.clear();\n for(int i=0;i<10;i++) (bit>>i&1)? A.push_back(AB[i]):B.push_back(AB[i]);\n vector<vector<int> > tmp = A;\n do{\n for(int a=0;a<(1<<5);a++){\n for(int i=0;i<5;i++) A[Aidx[i]] = (a>>i&1)? rev(tmp[i]):tmp[i];\n if(S.count(VtoH(A)) || !can()) continue;\n insert(A);\n res++;\n }\n } while(next_permutation(Aidx,Aidx+5));\n }\n return res/2;\n}\n\nsigned main(){\n while(1){\n AB.clear();\n for(int i=0;i<10;i++){\n string str;\n cin>>str;\n if(str == \"END\") return 0;\n vector<int> tmp(5);\n for(int j=0;j<5;j++) tmp[j] = str[j] - '0';\n AB.push_back(tmp);\n }\n cout<<solve()<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":3160,"memory_kb":3184,"score_of_the_acc":-0.4832,"final_rank":18},{"submission_id":"aoj_1201_2548446","code_snippet":"#include <bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\nusing namespace std;\nint ans;\nstring s[10],r[10];\nstring t1[5],t2[5];\nbool b[11];\nbool check(int p){\n r(i,5)if(t1[i][p]==t2[p][i])return 0;\n return 1;\n}\nvoid dfs2(int d){\n if(d==5)ans++;\n else{\n r(i,10)if(!b[i]){\n b[i]=1;\n t2[d]=s[i];\n if(check(d))dfs2(d+1);\n t2[d]=r[i];\n if(check(d))dfs2(d+1);\n b[i]=0;\n }\n }\n}\nvoid dfs(int d){\n if(d==5)dfs2(0);\n else{\n r(i,10)if(!b[i]){\n b[i]=1;\n t1[d]=s[i];\n dfs(d+1);\n t1[d]=r[i];\n dfs(d+1);\n b[i]=0;\n }\n }\n}\nmain(){\n while(cin>>s[0],s[0]!=\"END\"){\n memset(b,0,sizeof(b));\n ans=0;\n r[0]=s[0];\n reverse(r[0].begin(),r[0].end());\n r(i,9){\n cin>>s[i+1];\n r[i+1]=s[i+1];\n reverse(r[i+1].begin(),r[i+1].end());\n }\n int p=0;\n r(i,10)if(s[i]==r[i])p++;\n dfs(0);\n cout<<ans/(pow(2,p)*8)<<endl;\n }\n}","accuracy":1,"time_ms":5080,"memory_kb":3404,"score_of_the_acc":-0.7399,"final_rank":19},{"submission_id":"aoj_1201_2293703","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define int long long\nstring s[10];\nset<int> si,us,cu;\nvector<int> v;\nint x,y;\nint calc(const int a[5][5]){\n int res=0;\n for(int i=0;i<5;i++)\n for(int j=0;j<5;j++)\n res+=(1LL<<(i*5+j))*a[i][j];\n return res;\n}\nint calc2(const int a[5][5]){\n int res=0;\n for(int i=0;i<5;i++)\n for(int j=0;j<5;j++)\n res+=(1LL<<(i*5+j))*a[i][4-j];\n return res;\n}\nstring t[5];\nbool check(){\n map<string,int> ms;\n for(int i=0;i<10;i++){\n if(cu.count(i)) continue;\n string tmp=s[i];\n ms[tmp]++;\n reverse(tmp.begin(),tmp.end());\n ms[tmp]++;\n }\n for(int i=0;i<5;i++){\n string tmp=t[i];\n ms[tmp]--;\n reverse(tmp.begin(),tmp.end());\n ms[tmp]--;\n if(ms[t[i]]<0) return false;\n }\n return true;\n}\nset<int> memo[6];\nvoid dfs(int d){\n if(memo[d].count(x)) return;\n memo[d].insert(x);\n if(d==5){\n if(si.count(x)) return;\n if(!check()) return;\n si.insert(x);\n return;\n }\n for(int i=0;i<20;i++){\n if(cu.count(i%10)) continue;\n cu.insert(i%10);\n if(i>=10) reverse(s[i%10].begin(),s[i%10].end());\n v.push_back(i%10);\n for(int j=0;j<5;j++){\n t[j]+=(s[i%10][j]=='1'?'0':'1');\n x+=(1LL<<(d*5+j))*(s[i%10][j]=='1');\n }\n dfs(d+1);\n v.pop_back();\n for(int j=0;j<5;j++){\n t[j].pop_back();\n x-=(1LL<<(d*5+j))*(s[i%10][j]=='1');\n }\n if(i>=10) reverse(s[i%10].begin(),s[i%10].end());\n cu.erase(i%10);\n }\n}\nsigned main(){\n while(cin>>s[0],s[0]!=\"END\"){\n for(int i=1;i<10;i++) cin>>s[i];\n si.clear();\n us.clear();\n for(int i=0;i<6;i++) memo[i].clear();\n x=y=0;\n dfs(0);\n int a[5][5];\n int c[5][5];\n int ans=0;\n for(int b:si){\n if(us.count(b)) continue;\n for(int i=0;i<5;i++)\n\tfor(int j=0;j<5;j++)\n\t a[i][j]=(b>>(i*5+j))&1;\n us.insert(calc(a));\n us.insert(calc2(a));\n for(int i=0;i<5;i++)\n\tfor(int j=0;j<5;j++)\n\t c[i][j]=a[4-j][i];\n us.insert(calc(c));\n us.insert(calc2(c));\n for(int i=0;i<5;i++)\n\tfor(int j=0;j<5;j++)\n\t c[i][j]=a[j][4-i];\n us.insert(calc(c));\n us.insert(calc2(c));\n for(int i=0;i<5;i++)\n\tfor(int j=0;j<5;j++)\n\t c[i][j]=a[4-i][4-j];\n us.insert(calc(c));\n us.insert(calc2(c));\n ans++;\n }\n //cout<<si.size()<<endl<<us.size()<<endl;\n cout<<ans/2<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":7710,"memory_kb":30904,"score_of_the_acc":-2,"final_rank":20},{"submission_id":"aoj_1201_2061405","code_snippet":"#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\nusing ld = long double;\nconst ld eps = 1e-9;\n\n//// < \"d:\\d_download\\visual studio 2015\\projects\\programing_contest_c++\\debug\\a.txt\" > \"d:\\d_download\\visual studio 2015\\projects\\programing_contest_c++\\debug\\b.txt\"\n\nint getnum(vector<int>&used, const vector<vector<int>>&walls, vector<vector<int>>&decided,int now) {\n\tint sum = 0;\n\tif (now == 10)return 1;\n\telse \tif (now < 5) {\n\t\tconst int y = now;\n\t\tfor (int i = 0; i < 10; ++i) {\n\t\t\tif (used[i])continue;\n\t\t\telse {\n\t\t\t\tused[i] = true;\n\t\t\t\tfor (int rev = 0; rev < 2; ++rev) {\n\t\t\t\t\tif (rev&&walls[i][0] == walls[i][4] && walls[i][1] == walls[i][3])continue;\n\t\t\t\t\tfor (int x = 0; x < 5; ++x) {\n\t\t\t\t\t\tdecided[y][rev?4-x:x] = walls[i][x];\n\t\t\t\t\t}\n\t\t\t\t\tsum += getnum(used, walls, decided, now + 1);\n\t\t\t\t\tfor (int x = 0; x < 5; ++x) {\n\t\t\t\t\t\tdecided[y][rev ? 4 - x : x] = -1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tused[i] = false;\n\t\t\t\t\n\t\t\t}\n\t\t}\n\t\t\n\t}\n\telse {\n\t\tconst int x = now-5;\n\t\tfor (int i = 0; i < 10; ++i) {\n\t\t\tif (used[i])continue;\n\t\t\telse {\n\t\t\t\tused[i] = true;\n\t\t\t\tfor (int rev = 0; rev < 2; ++rev) {\n\t\t\t\t\tif (rev&&walls[i][0] == walls[i][4] && walls[i][1] == walls[i][3])continue;\n\n\t\t\t\t\tbool ok = true;\n\t\t\t\t\tfor (int y = 0; y < 5; ++y) {\n\t\t\t\t\t\tif (decided[rev ? 4 - y : y][x] == walls[i][y])ok = false;\n\t\t\t\t\t}\n\t\t\t\t\tif (!ok)continue;\n\t\t\t\t\t\n\t\t\t\t\tsum += getnum(used, walls, decided, now + 1);\n\n\t\t\t\t}\n\t\t\t\tused[i] = false;\n\n\t\t\t}\n\t\t}\n\n\t}\n\treturn sum;\n}\n\nint main() {\n\twhile (1) {\n\t\tvector<vector<int>>walls (10);\n\t\tfor (int i = 0; i < 10; ++i) {\n\t\t\tstring st; cin >> st;\n\t\t\tif (st == \"END\")return 0;\n\t\t\telse {\n\t\t\t\tfor (int j = 0; j< 5; ++j) {\n\t\t\t\t\twalls[i].push_back(st[j] == '1');\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tvector<int>used(10, false);\n\t\tvector<vector<int>>decided(5, vector<int>(5, -1));\n\t\tint ans = getnum(used, walls, decided, 0);\n\t\tcout << ans/8<< endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":460,"memory_kb":3120,"score_of_the_acc":-0.1305,"final_rank":9},{"submission_id":"aoj_1201_1952873","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <string>\n#include <vector>\n#include <deque>\n#include <list>\n#include <algorithm>\n#include <numeric>\n#include <functional>\n#include <cmath>\n#include <cstring>\n#include <cctype>\n#include <sstream>\n#include <set>\n#include <map>\n#include <stack>\n#include <queue>\n#include <complex>\nusing namespace std;\n#define REP(i,n) for(int i = 0; i < (int)n; i++)\n#define FOR(i,a,b) for(int i = a; i < (int)b; i++)\n#define pb push_back\n#define mp make_pair\ntypedef vector<int> vi;\ntypedef pair<int, int> pi;\ntypedef long long ll;\nconst int INF = 1<<28;\nconst ll MOD = 1000000007;\n\nint cnt;\nstring s[2][10];\nbool same[10];\n\nbool chk(string &a, string &b, int &pnt) {\n\tREP(i, 5) {\n\t\tif(a[i*5 + pnt - 5] == b[i])\n\t\t\treturn false;\n\t}\n\treturn true;\n}\n\nvoid dfs(int pnt, string done, bool b[2][10]) {\n\tif(pnt == 10) {\n\t\t/*\n\t\t//debug\n\t\tREP(i, 10) {\n\t\t\tREP(j, 5) {\n\t\t\t\tcout << done[i*5 + j] << ' ';\n\t\t\t}\n\t\t\tcout << endl;\n\t\t\tif(i == 4) cout << \"-----\" << endl;\n\t\t}\n\t\tcout << endl;\n\t\t*/\n\t\tcnt++;\n\t\treturn;\n\t}\n\tif(pnt < 5) {\n\t\tREP(i, 2) REP(j, 10) {\n\t\t\tif(!b[i][j]) {\n\t\t\t\tb[0][j] = true;\n\t\t\t\tb[1][j] = true;\n\t\t\t\tdfs(pnt+1, done + s[i][j], b);\n\t\t\t\tb[0][j] = false;\n\t\t\t\tif(!same[j]) b[1][j] = false;\n\t\t\t}\n\t\t}\n\t}\n\telse {\n\t\tREP(i, 2) REP(j, 10) {\n\t\t\tif(!b[i][j] && chk(done, s[i][j], pnt)) {\n\t\t\t\tb[0][j] = true;\n\t\t\t\tb[1][j] = true;\n\t\t\t\tdfs(pnt+1, done + s[i][j], b);\n\t\t\t\tb[0][j] = false;\n\t\t\t\tif(!same[j]) b[1][j] = false;\n\t\t\t}\n\t\t}\n\t}\n\treturn;\n}\n\nint main() {\n\tstring in;\n\twhile(cin >> in, in != \"END\") {\n\t\tbool b[2][10] = {};\n\t\tREP(i, 10) {\n\t\t\tif(i)\n\t\t\t\tcin >> in;\n\t\t\ts[0][i] = in;\n\t\t\treverse(in.begin(), in.end());\n\t\t\ts[1][i] = in;\n\t\t\tsame[i] = s[0][i] == s[1][i] ? true:false;\n\t\t}\n\t\tcnt = 0;\n\t\tdfs(0, \"\", b);\n\t\tcout << cnt / 8 << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":870,"memory_kb":1200,"score_of_the_acc":-0.1196,"final_rank":8},{"submission_id":"aoj_1201_1923923","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\n/*\nstring cocoon[10];\nchar area[5][5];\nint ans;\n\nbool check(bool used[]){\n\tbool flag = false;\n\n\n\n\treturn flag;\n}\n\nvoid dfs(bool used[], depth){\n\tif (depth == 5){\n\n\t}\n\n\n\treturn;\n}\n\n\nint main(){\n\twhile (cin >> cocoon[0] && cocoon[0][0] != 'E'){\n\t\tfor (int i = 1; i < 10; i++){\n\t\t\tcin >> cocoon[i];\n\t\t}\n\n\t\tans = 0;\n\t\tbool used[10] = { false };\n\n\t\tcout << ans / 8 << endl;\n\t}\n\treturn 0;\n\n\n}\n\n*/\n\nint cocoon[10][5];\nint area[5][5];\nvector<int> bita, bitb;\nint ans;\n\nbool used[10];\n\nvoid check(int depth){\n\tint ret = 0;\n\n\tif (depth == 10){\n\t\tans++;\n\t\treturn;\n\t}\n\telse if (depth >= 5){\n\t\tfor (int i = 0; i < 5; i++){\n\t\t\tint num = bitb[i];\n\t\t\tif (used[num]) continue;\n\t\t\tused[num] = true;\n\t\t\tbool flag1 = true, flag2 = true;\n\n\t\t\tfor (int j = 0; j < 5; j++){\n\t\t\t\tif (area[j][depth - 5] == cocoon[num][j]) flag1 = false;\n\t\t\t\tif (area[j][depth - 5] == cocoon[num][4 - j]) flag2 = false;\n\t\t\t}\n\n\t\t\tif (flag1 || flag2) check(depth + 1);\n\t\t\t\n\t\t\tused[num] = false;\n\t\t}\n\t}\n\telse{\n\t\tfor (int i = 0; i < 5; i++){\n\t\t\tint num = bita[i];\n\t\t\tif (used[num]) continue;\n\t\t\tused[num] = true;\n\n\t\t\tfor (int j = 0; j < 5; j++){\n\t\t\t\tarea[depth][j] = cocoon[num][j];\n\t\t\t}\n\t\t\tcheck(depth + 1);\n\n\t\t\tif (cocoon[num][0] == cocoon[num][4] && cocoon[num][1] == cocoon[num][3]){\n\t\t\t\tused[num] = false;\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tfor (int j = 0; j < 5; j++){\n\t\t\t\tarea[depth][j] = cocoon[num][4 - j];\n\t\t\t}\n\t\t\tcheck(depth + 1);\n\n\t\t\tused[num] = false;\n\t\t}\n\t}\n\n\treturn;\n}\n\n\nint main(void){\n\n\tchar in[50];\n\n\twhile (cin >> in){\n\t\tif (in[0] == 'E') break;\n\n\t\tfor (int j = 0; j < 5; j++){\n\t\t\tcocoon[0][j] = in[j] - '0';\n\t\t}\n\n\t\tfor (int i = 1; i <= 9; i++){\n\t\t\tcin >> in;\n\t\t\tfor (int j = 0; j < 5; j++){\n\t\t\t\tcocoon[i][j] = in[j] - '0';\n\t\t\t}\n\t\t}\n\t\t\n\t\tans = 0;\n\n\t\tfor (int i = 0; i < 512; i++){\n\t\t\t\n\t\t\tbita.clear();\n\t\t\tbitb.clear();\n\t\t\tint num = i;\n\t\t\tfor (int j = 0; j <= 9; j++){\n\t\t\t\tif (num % 2 != 0) bita.push_back(j);\n\t\t\t\telse bitb.push_back(j);\n\n\t\t\t\tnum = num / 2;\n\t\t\t}\n\n\t\t\tif (bita.size() != 5) continue;\n\n\t\t\tcheck(0);\n\n\t\t}\n\n\t\tcout << ans / 4 << endl;\n\n\t}\n\n\treturn 0;\n}\n\n\n\n/*\n\nvoid check(vector<int> a, vector<int> b){\n\n\tif (!a.empty()){\n\t\tint count = a.size();\n\t\tfor (int i = 0; i < count; i++){\n\t\t\tvector<int> aa(a);\n\t\t\tint num = a[i];\n\t\t\taa.erase(aa.begin() + i);\n\t\t\tfor (int j = 0; j < 5; j++){\n\t\t\t\tarea[5 - count][j] = cocoon[num][j];\n\t\t\t}\n\t\t\tcheck(aa, b);\n\t\t\tfor (int j = 0; j < 5; j++){\n\t\t\t\tarea[5 - count][j] = cocoon[num][4 - j];\n\t\t\t}\n\t\t\tcheck(aa, b);\n\t\t}\n\t}\n\telse if (!b.empty()){\n\t\tint count = b.size();\n\t\tfor (int i = 0; i < count; i++){\n\t\t\tvector<int> bb(b);\n\t\t\tint num = b[i];\n\t\t\tbool flag1 = true, flag2 = true;\n\t\t\tfor (int j = 0; j < 5; j++){\n\t\t\t\tif (area[j][5 - count] == cocoon[num][j]) flag1 = false;\n\t\t\t\tif (area[j][5 - count] == cocoon[num][4 - j]) flag2 = false;\n\t\t\t}\n\n\t\t\tbb.erase(bb.begin() + i);\n\n\t\t\tif (flag1) check(a, bb);\n\t\t\tif (flag2) check(a, bb);\n\t\t}\n\t}\n\telse{\n\t\tans++;\n\t\treturn;\n\t}\n\n\n\treturn;\n}\n\n\nint main(void){\n\n\tchar in[50];\n\tchar end[] = \"END\";\n\n\twhile (cin >> in){\n\t\tif (in[0] == 'E') break;\n\n\t\tfor (int j = 0; j < 5; j++){\n\t\t\tcocoon[0][j] = in[j] - '0';\n\t\t}\n\n\t\tfor (int i = 1; i <= 9; i++){\n\t\t\tcin >> in;\n\t\t\tfor (int j = 0; j < 5; j++){\n\t\t\t\tcocoon[i][j] = in[j] - '0';\n\t\t\t}\n\t\t}\n\n\t\tans = 0;\n\n\t\tfor (int i = 0; i < 512; i++){\n\t\t\tvector<int> bita, bitb;\n\t\t\tint bits = 0;\n\t\t\tint num = i;\n\t\t\tfor (int j = 0; j <= 9; j++){\n\t\t\t\tif (num % 2 != 0) bita.push_back(j);\n\t\t\t\telse bitb.push_back(j);\n\n\t\t\t\tnum = num / 2;\n\t\t\t}\n\n\t\t\tif (bita.size() != 5) continue;\n\n\t\t\tcheck(bita, bitb);\n\n\t\t}\n\n\t\tcout << ans / 32 << endl;\n\n\t}\n\n\treturn 0;\n}\n*/","accuracy":1,"time_ms":110,"memory_kb":1196,"score_of_the_acc":-0.0207,"final_rank":1},{"submission_id":"aoj_1201_1874949","code_snippet":"#include <bits/stdc++.h>\n \nusing namespace std;\n \nstring s[10],srev[10];\nstring H[5],W[5];\nbool eq[10];\n \nbool valid(int idx){\n for(int i = 0 ; i < 5 ; i++){\n\tif(W[idx][i] == H[i][idx]){\n\t return false;\n\t}\n }\n return true;\n}\n \nint solve(int idx,int S){\n if(S == (1<<10)-1){\n\treturn 1;\n }\n int res = 0;\n for(int i = 0 ; i < 10 ; i++){\n\tif((S >> i) & 1) continue;\n\tif(idx < 5){\n\t H[idx] = s[i];\n\t res += solve(idx+1,S|(1<<i));\n\t if(!eq[i]){\n\t\tH[idx] = srev[i];\n\t\tres += solve(idx+1,S|(1<<i));\n\t }\n\t}else{\n\t W[idx-5] = s[i];\n\t if(valid(idx-5)){\n\t\tres += solve(idx+1,S|(1<<i));\n\t }\n\t if(!eq[i]){\n\t\tW[idx-5] = srev[i];\n\t\tif(valid(idx-5)){\n\t\t res += solve(idx+1,S|(1<<i));\n\t\t}\n\t }\n\t}\n }\n return res;\n}\n \nint main(){ \n while(cin >> s[0], s[0] != \"END\"){\n\tmemset(eq,false,sizeof(eq));\n\tstring tmp = s[0];\n\treverse(tmp.begin(),tmp.end());\n\tsrev[0] = tmp;\n\teq[0] = s[0] == srev[0];\n\tfor(int i = 0 ; i < 9 ; i++){\n\t cin >> s[i+1];\n\t tmp = s[i+1];\n\t reverse(tmp.begin(),tmp.end());\n\t srev[i+1] = tmp;\n\t eq[i+1] = s[i+1] == srev[i+1];\n\t}\n\tcout << solve(0,0)/8 << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":1580,"memory_kb":3200,"score_of_the_acc":-0.2786,"final_rank":11},{"submission_id":"aoj_1201_1159016","code_snippet":"#include <string> \n#include <algorithm> \n#include <cfloat> \n#include <climits> \n#include <cmath> \n#include <complex> \n#include <cstdio> \n#include <cstdlib> \n#include <cstring> \n#include <functional> \n#include <iostream> \n#include <map> \n#include <memory> \n#include <queue> \n#include <set> \n#include <sstream> \n#include <stack> \n#include <utility> \n#include <vector> \n\n#define EACH(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)\n#define ALL(x) (x).begin(),(x).end() \nusing namespace std; \ntypedef long long ll;\nconst double eps = 1e-10;\n\nbool check(const vector<string> &l, const vector<string> &u, int bit){\n vector<string> v;\n for(int i = 0; i < 5; ++i){\n v.push_back(l[i]);\n if(bit >> i & 1){\n reverse(ALL(v[i]));\n if(v[i] == l[i]) return false;\n }\n // cout << v[i] << \" \";\n }\n // cout << endl;\n\n vector<int> used(5, -1);\n for(int j = 0; j < 5; ++j){\n string s = \"\";\n for(int i = 0; i < 5; ++i){\n if(v[i][j] == '0')\n s.push_back('1');\n else\n s.push_back('0');\n }\n string rs = s;\n reverse(ALL(rs));\n bool flag = false;\n for(int i = 0; i < 5; ++i){\n if(used[i] < 0 && (s == u[i] || rs == u[i])){\n used[i] = j;\n flag = true;\n break;\n }\n }\n if(!flag) return false;\n }\n /*\n for(int i = 0; i < 5; ++i){\n cout << v[i] << endl;\n }\n cout << endl;\n for(int i = 0; i < 5; ++i){\n cout << u[i] << \" \";\n }\n cout << endl;\n for(int i = 0; i < 5; ++i) cout << used[i] << \" \";\n cout << endl;\n */\n return true;\n}\nint main(){\n for(;;){\n vector<string> v(10);\n cin >> v[0];\n if(v[0] == \"END\") return 0;\n for(int i = 1; i < 10; ++i) cin >> v[i];\n sort(ALL(v));\n int cnt = 0;\n for(int s = 0; s < 1 << 10; ++s) if(__builtin_popcount(s) == 5 && s < (~s & 1023)){\n vector<string> lv, uv;\n for(int i = 0; i < 10; ++i)\n if(s >> i & 1)\n lv.push_back(v[i]);\n else\n uv.push_back(v[i]);\n do{\n for(int t = 0; t < 1 << 5; ++t){\n bool res = check(lv, uv, t);\n if(res){\n ++cnt;\n }\n }\n }while(next_permutation(ALL(lv)));\n }\n cout << cnt / 4 << endl;\n }\n}","accuracy":1,"time_ms":2450,"memory_kb":1208,"score_of_the_acc":-0.325,"final_rank":13},{"submission_id":"aoj_1201_1129518","code_snippet":"#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nchar str[11][7];\nint used[11];\nint p[6][6];\nint solve(int a){\n\tif(a==10){\n\t\tfor(int i=0;i<5;i++)for(int j=0;j<5;j++)\n\t\t\tif(!p[i][j])return 0;\n\t\treturn 1;\n\t}\n\tint ret=0;\n\tfor(int i=0;i<10;i++){\n\t\tif(used[i])continue;\n\t\tused[i]=1;\n\t\tbool ok=true;\n\t\tif(a%2){\n\t\t\tfor(int j=0;j<5;j++){\n\t\t\t\tp[a/2][j]+=str[i][j]-'0';\n\t\t\t\tif(p[a/2][j]==2)ok=false;\n\t\t\t}\n\t\t}else{\n\t\t\tfor(int j=0;j<5;j++){\n\t\t\t\tp[j][a/2]+=str[i][j]-'0';\n\t\t\t\tif(p[j][a/2]==2)ok=false;\n\t\t\t}\n\t\t}\n\t\tif(ok)ret+=solve(a+1);\n\t\tused[i]=0;\n\t\tif(a%2){\n\t\t\tfor(int j=0;j<5;j++){\n\t\t\t\tp[a/2][j]-=str[i][j]-'0';\n\t\t\t}\n\t\t}else{\n\t\t\tfor(int j=0;j<5;j++){\n\t\t\t\tp[j][a/2]-=str[i][j]-'0';\n\t\t\t}\n\t\t}\n\t}\n\tfor(int i=0;i<10;i++){\n\t\tif(used[i])continue;\n\t\tif(str[i][0]==str[i][4]&&str[i][1]==str[i][3])continue;\n\t\tused[i]=1;\n\t\tbool ok=true;\n\t\tif(a%2){\n\t\t\tfor(int j=0;j<5;j++){\n\t\t\t\tp[a/2][j]+=str[i][4-j]-'0';\n\t\t\t\tif(p[a/2][j]==2)ok=false;\n\t\t\t}\n\t\t}else{\n\t\t\tfor(int j=0;j<5;j++){\n\t\t\t\tp[j][a/2]+=str[i][4-j]-'0';\n\t\t\t\tif(p[j][a/2]==2)ok=false;\n\t\t\t}\n\t\t}\n\t\tif(ok)ret+=solve(a+1);\n\t\tused[i]=0;\n\t\tif(a%2){\n\t\t\tfor(int j=0;j<5;j++){\n\t\t\t\tp[a/2][j]-=str[i][4-j]-'0';\n\t\t\t}\n\t\t}else{\n\t\t\tfor(int j=0;j<5;j++){\n\t\t\t\tp[j][a/2]-=str[i][4-j]-'0';\n\t\t\t}\n\t\t}\n\t}\n\treturn ret;\n}\nint main(){\n\twhile(1){\n\t\tfor(int i=0;i<5;i++)for(int j=0;j<5;j++)p[i][j]=0;\n\t\tscanf(\"%s\",str[0]);\n\t\tfor(int i=0;i<10;i++)used[i]=0;\n\t\tif(str[0][0]=='E')break;\n\t\tfor(int i=1;i<10;i++)scanf(\"%s\",str[i]);\n\t\tint ret=solve(0);\n\t\tprintf(\"%d\\n\",ret/8);\n\t}\n}","accuracy":1,"time_ms":410,"memory_kb":964,"score_of_the_acc":-0.0519,"final_rank":3},{"submission_id":"aoj_1201_1122346","code_snippet":"#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <cstring>\nusing namespace std;\n\nint lat[5][5];\n\nvector<vector<int>> bx = {\n {0, 1, 2, 3, 4},\n {0, 1, 2, 3, 4},\n {0, 1, 2, 3, 4},\n {0, 1, 2, 3, 4},\n {0, 1, 2, 3, 4},\n {0, 0, 0, 0, 0},\n {1, 1, 1, 1, 1},\n {2, 2, 2, 2, 2},\n {3, 3, 3, 3, 3},\n {4, 4, 4, 4, 4}\n};\n\nvector<vector<int>> by = {\n {0, 0, 0, 0, 0},\n {1, 1, 1, 1, 1},\n {2, 2, 2, 2, 2},\n {3, 3, 3, 3, 3},\n {4, 4, 4, 4, 4},\n {0, 1, 2, 3, 4},\n {0, 1, 2, 3, 4},\n {0, 1, 2, 3, 4},\n {0, 1, 2, 3, 4},\n {0, 1, 2, 3, 4}\n};\n\nstring rev(string s) {\n reverse(s.begin(), s.end());\n return s;\n}\n\nint dfs(vector<string> &v, int k) {\n if (k == 10) {\n return 1;\n }\n vector<string> S(1, v[k]);\n if (v[k] != rev(v[k])) {\n S.push_back(rev(v[k]));\n }\n int ret = 0;\n for (string bloc : S) {\n for (int i=0; i<10; ++i) {\n bool ok = true;\n vector<int> t;\n for (int j=0; j<5; ++j) {\n if ((lat[by[i][j]][bx[i][j]] & 1 && bloc[j] - '0' == 0) ||\n (lat[by[i][j]][bx[i][j]] & 2 && bloc[j] - '0' == 1)) {\n ok = false;\n break;\n }\n t.push_back(lat[by[i][j]][bx[i][j]]);\n }\n if (ok) {\n for (int j=0; j<5; ++j) {\n lat[by[i][j]][bx[i][j]] |= (bloc[j] - '0' + 1);\n }\n ret += dfs(v, k+1);\n for (int j=0; j<5; ++j) {\n lat[by[i][j]][bx[i][j]] = t[j];\n }\n }\n }\n }\n return ret;\n}\n\nint main() {\n vector<string> v(10);\n while (cin >> v[0], v[0] != \"END\") {\n for (int i=1; i<10; ++i) {\n cin >> v[i];\n }\n memset(lat, 0, sizeof lat);\n int ret = dfs(v, 0);\n cout << (ret == 0 ? 0 : ret / 8) << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":290,"memory_kb":1220,"score_of_the_acc":-0.0449,"final_rank":2},{"submission_id":"aoj_1201_1100714","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nstring s[10],srev[10];\nstring H[5],W[5];\nbool eq[10];\n\nbool valid(int idx){\n for(int i = 0 ; i < 5 ; i++){\n if(W[idx][i] == H[i][idx]){\n return false;\n }\n }\n return true;\n}\n\nint solve(int idx,int S){\n if(S == (1<<10)-1){\n return 1;\n }\n int res = 0;\n for(int i = 0 ; i < 10 ; i++){\n if((S >> i) & 1) continue;\n if(idx < 5){\n H[idx] = s[i];\n res += solve(idx+1,S|(1<<i));\n if(!eq[i]){\n H[idx] = srev[i];\n res += solve(idx+1,S|(1<<i));\n }\n }else{\n W[idx-5] = s[i];\n if(valid(idx-5)){\n res += solve(idx+1,S|(1<<i));\n }\n if(!eq[i]){\n W[idx-5] = srev[i];\n if(valid(idx-5)){\n res += solve(idx+1,S|(1<<i));\n }\n }\n }\n }\n return res;\n}\n\nint main(){ \n while(cin >> s[0], s[0] != \"END\"){\n memset(eq,false,sizeof(eq));\n string tmp = s[0];\n reverse(tmp.begin(),tmp.end());\n srev[0] = tmp;\n eq[0] = s[0] == srev[0];\n for(int i = 0 ; i < 9 ; i++){\n cin >> s[i+1];\n tmp = s[i+1];\n reverse(tmp.begin(),tmp.end());\n srev[i+1] = tmp;\n eq[i+1] = s[i+1] == srev[i+1];\n }\n cout << solve(0,0)/8 << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":2200,"memory_kb":1200,"score_of_the_acc":-0.2923,"final_rank":12},{"submission_id":"aoj_1201_1100272","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint ans;\nbool use[10];\nstring s[10],t[10];\n\nbool check(int n) {\n bool ck=true;\n for(int i=0; i<5; i++) {\n if(t[n][i]==t[i][n-5]) ck=false;\n }\n return ck;\n}\n\nvoid dfs(int n) {\n if(n==10) {\n ans++;\n return;\n }\n \n for(int i=0; i<10; i++) {\n if(!use[i]) {\n use[i]=true;\n \n t[n]=s[i];\n if(n<5) dfs(n+1);\n else {\n\tif(check(n)) {\n\t dfs(n+1);\n\t use[i]=false;\n\t return;\n\t}\n }\n\n reverse(s[i].begin(),s[i].end());\n t[n]=s[i];\n reverse(s[i].begin(),s[i].end());\n \n if(s[i]==t[n]) {\n\tuse[i]=false;\n\tcontinue;\n }\n \n if(n<5) dfs(n+1);\n else {\n\tif(check(n)) {\n\t dfs(n+1);\n\t use[i]=false;\n\t return;\n\t}\n }\n \n use[i]=false;\n }\n }\n}\n\nint main() {\n while(cin >> s[0]) {\n if(s[0]==\"END\") break;\n for(int i=1; i<10; i++) cin >> s[i];\n memset(use,false,sizeof(use));\n ans=0;\n dfs(0);\n cout << ans/8 << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":2740,"memory_kb":1200,"score_of_the_acc":-0.3624,"final_rank":14}],"string":"[\n {\n \"submission_id\": \"aoj_1201_9634679\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\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())\\n#define UB(A,x) (upper_bound(ALL(A),x)-A.begin())\\nint main(){\\n while(1){\\n vector<string>S(10);\\n REP(i,10)cin>>S[i];\\n vector<string>revS=S;\\n REP(i,10)reverse(ALL(revS[i]));\\n if(S[0]==\\\"END\\\")return 0;\\n ll ans=0;\\n REP(i,9)REP(j,9)if(i!=j)REP(k,9)if(k!=i&&k!=j)REP(l,9)if(l!=i&&l!=j&&l!=k)REP(m,i)if(m!=i&&m!=j&&m!=k&&m!=l){\\n vector<string>T,revT,U={S[i],S[j],S[k],S[l],S[m]},revU={revS[i],revS[j],revS[k],revS[l],revS[m]};\\n REP(n,10)if(n!=i&&n!=j&&n!=k&&n!=l&&n!=m){\\n T.emplace_back(S[n]);\\n revT.emplace_back(revS[n]);\\n }\\n REP(n,32){\\n bool ok=1;\\n REP(o,5)if((n>>o)%2&&U[o]==revU[o]){ok=0;break;}\\n if(!ok)continue;\\n vector<bool>K(5);\\n REP(o,5){\\n string t;\\n REP(p,5){\\n if((n>>p)%2)t+=revU[p][o];\\n else t+=U[p][o];\\n }\\n REP(p,5)t[p]='1'+'0'-t[p];\\n ll a=0;\\n while(a<5&&T[a]!=t&&revT[a]!=t)a++;\\n if(a==5||K[a]){ok=0;break;}\\n K[a]=1;\\n }\\n if(ok){\\n //cout<<S[i]<<endl<<S[j]<<endl<<S[k]<<endl<<S[l]<<endl<<S[m]<<endl;\\n ans++;\\n }\\n }\\n }\\n ans/=2;\\n cout<<ans<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 3132,\n \"score_of_the_acc\": -0.0841,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1201_5372353\",\n \"code_snippet\": \"#include <iostream>\\n#include<vector>\\n#include<algorithm>\\n#include<utility>\\n#include<math.h>\\n#include<iomanip>\\n#include<string>\\n#include <cassert>\\n#include <complex>\\n#include<bits/stdc++.h>\\n\\n#define rep(s,i,n) for(int i = s;i < n;i++)\\n \\nusing namespace std;\\n \\ntypedef long long ll; //10e18くらい\\ntypedef long double ld;\\ntypedef __int128_t lll;\\ntypedef pair<ll, ll> pll;\\n \\nconst int dx[] = { 0,1,0,-1 };\\nconst int dy[] = { 1,0,-1,0 };\\nconst ll LongINF = 1e13 + 7;\\nconst int INF = 1e9 + 7;\\nconst ll LL_MAX = 9223372036854775807;\\nconst ll LL_MIN = -9223372036854775807;\\nconst double pi = 3.141592653589793;\\n\\n\\nint dsp[3] = {-1,0,1};\\n\\n// int keta(ll i){\\n\\n// int keta = 0;\\n// do{\\n// keta++;\\n// }while(i /= 10);\\n\\n// return keta;\\n// }\\n//素因数分解 O(√n)\\n// vector<pair<ll,ll>> pfactor(ll n){\\n// vector<pair<ll,ll>> factor;\\n// ll ex; //指数\\n// for(ll a = 2; a * a <= n; a++){\\n// if(n % a != 0)continue;\\n\\n// ll ex = 0;\\n\\n// while(n % a == 0){\\n// n /= a;\\n// ex++;\\n// }\\n\\n// factor.push_back({a,ex});\\n// }\\n\\n// if(n != 1) factor.push_back({n,1});\\n\\n// return factor; \\n// }\\n\\nstring s[10];\\nstring srev[10];\\nstring H[5];\\nstring W[5];\\nbool symm[10];//ブロックのスリットに対称性があるかどうか\\n//噛み合うかどうか確認する\\nbool check(int idx){\\n rep(0,i,5){\\n if(W[idx][i] == H[i][idx]) return false;\\n }\\n return true;\\n}\\n\\nint solve(int idx,int S){\\n if(S == (1<<10) - 1){\\n return 1;\\n }\\n\\n int res = 0;\\n\\n rep(0,i,10){\\n //使ったブロックを、もう一度使うことは出来ない\\n if( (S >> i) & 1)continue;\\n //初めは縦に置く(idx < 5まで ＝ 初めの五回)\\n if(idx < 5){\\n H[idx] = s[i];\\n //S i番目のブロックを使ったらsのiビット目が1になる\\n res += solve(idx + 1,S| 1 << i);\\n //対称性がないなら同じところに逆向きにおいてみる\\n if(!symm[i]){\\n H[idx] = srev[i];\\n res += solve(idx + 1, S | (1 << i));\\n }\\n //縦に置き終わったら、横においていく\\n }else{\\n W[idx - 5] = s[i];\\n if(check(idx - 5)){\\n res += solve(idx + 1,S | (1 << i));\\n }\\n if(!symm[i]){\\n W[idx - 5] = srev[i];\\n if(check(idx - 5)){\\n res += solve(idx + 1,S | (1 << i));\\n }\\n }\\n\\n }\\n }\\n \\n return res;\\n}\\n\\n\\n\\n\\nint main(void){\\n\\n \\n while(cin >> s[0],s[0] != \\\"END\\\"){\\n memset(symm,false,sizeof(symm));\\n srev[0] = s[0];\\n reverse(srev[0].begin(),srev[0].end());\\n symm[0] = (s[0] == srev[0]);\\n\\n rep(0,i,9){\\n cin >> s[i + 1];\\n srev[i + 1] = s[i + 1];\\n reverse(srev[i + 1].begin(),srev[i + 1].end());\\n symm[i + 1] = (s[i + 1] == srev[i + 1]);//sとsrevが同じなら対称性がある\\n }\\n cout << solve(0,0)/8 << endl;\\n\\n // rep(0,i,10){\\n // cout << s[i] << \\\":\\\" ;\\n\\n // cout << srev[i] << endl;\\n // }\\n \\n } \\n \\n \\n return 0;\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1580,\n \"memory_kb\": 3180,\n \"score_of_the_acc\": -0.2779,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1201_5035256\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nconst int N=10;\\n\\nstring slit[N+N];\\nint choose[N],used[N];\\n\\n\\nint check(int n) {\\n int k=n/2;\\n for (int i=n-1; i>=0; i-=2) {\\n if (slit[choose[i]][k]+slit[choose[n]][i/2]!='0'+'1') return 0;\\n }\\n return 1;\\n}\\n\\nint search(int n) {\\n if (n==N) return 1;\\n\\n int cnt=0;\\n for (int i=0; i<N; i++) {\\n if (used[i]) continue;\\n used[i]=1;\\n\\n choose[n]=i;\\n if (check(n)) cnt+=search(n+1);\\n\\n if (!slit[N+i].empty()) {\\n choose[n]=N+i;\\n if (check(n)) cnt+=search(n+1);\\n }\\n\\n used[i]=0;\\n }\\n return cnt;\\n}\\n\\nint solve() {\\n cin>>slit[0];\\n if (slit[0]==\\\"END\\\") return 0;\\n for (int i=1; i<N; i++) cin>>slit[i];\\n\\n for (int i=0; i<N; i++) {\\n string rev(rbegin(slit[i]),rend(slit[i]));\\n slit[N+i]=(rev!=slit[i] ? rev : \\\"\\\");\\n }\\n\\n memset(used,0,sizeof(used));\\n cout<<search(0)/8<<'\\\\n';\\n\\n return 1;\\n}\\n\\nint main() {\\n while (solve());\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3288,\n \"score_of_the_acc\": -0.0776,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1201_4994264\",\n \"code_snippet\": \"#include <cmath>\\n#include <vector>\\n#include <iostream>\\n#include <algorithm>\\n#include <set>\\n#include <iomanip>\\n#include <queue>\\n#include <string>\\n#include <map>\\n#include <fstream>\\n#include <cassert>\\n#include <stack>\\n#include <climits>\\n#include <array>\\n#include <unordered_set>\\n#include <unordered_map>\\n#include <memory>\\n#include <functional>\\n#include <cfloat>\\n#include <numeric>\\n#include <random>\\n#include <sstream>\\n#include <bitset>\\nusing namespace std;\\nint reverse(int n) {\\n\\tint result{ 0 };\\n\\tfor (auto i = 0; i < 5; ++i) {\\n\\t\\tresult <<= 1;\\n\\t\\tresult += n & 1;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn result;\\n}\\ntemplate<typename B>\\nvoid iterate(const std::vector<int>& a, const int current, const int count, const B& block, std::vector<int> &use, std::vector<int>& not_use) {\\n\\tif (current == a.size()) {\\n\\t\\treturn block(use, not_use);\\n\\t}\\n\\tif (a.size() > current + count) {\\n\\t\\tnot_use.push_back(a[current]);\\n\\t\\titerate(a, current + 1, count, block, use, not_use);\\n\\t\\tnot_use.pop_back();\\n\\t}\\n\\tif (count > 0) {\\n\\t\\tuse.push_back(a[current]);\\n\\t\\titerate(a, current + 1, count - 1, block, use, not_use);\\n\\t\\tuse.pop_back();\\n\\t}\\n}\\ntemplate<typename B>\\nvoid iterate(const std::vector<int> &a, const B& block) {\\n\\tstd::vector<int> use, not_use; use.reserve(5); not_use.reserve(5);\\n\\tuse.push_back(a[0]);\\n\\titerate(a, 1, 4, block, use, not_use);\\n}\\n\\nint solve(std::vector<int> boards) {\\n\\tfor (auto& a : boards) {\\n\\t\\tif (a > reverse(a)) a = reverse(a);\\n\\t}\\n\\tstd::sort(boards.begin(), boards.end());\\n\\tint count{ 0 };\\n\\tconst auto block = [&count](std::vector<int> horizontal, std::vector<int> vertical) {\\n\\t\\tstd::vector<int> index(5), actual(5); std::iota(index.begin(), index.end(), 0);\\n\\t\\tint mask{ 0 }, c{ 0 };\\n\\t\\tfor (auto i = 0; i < 5; ++i) {\\n\\t\\t\\tif (horizontal[i] == reverse(horizontal[i])) mask += 1 << i;\\n\\t\\t}\\n\\t\\tdo {\\n\\t\\t\\tif (index[0] > index[4]) continue;\\n\\t\\t\\tfor (auto pattern = 0; pattern < 32; ++pattern) {\\n\\t\\t\\t\\tif ((mask & pattern) != 0) continue;\\n\\t\\t\\t\\tfor (auto i = 0; i < 5; ++i) {\\n\\t\\t\\t\\t\\tactual[i] = (pattern >> index[i] & 1) == 0 ? horizontal[index[i]] : reverse(horizontal[index[i]]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tfor (auto i = 0; i < 5; ++i) {\\n\\t\\t\\t\\t\\tint target{ 0 };\\n\\t\\t\\t\\t\\tfor (auto j = 0; j < 5; ++j) {\\n\\t\\t\\t\\t\\t\\ttarget += (((actual[j] >> i) & 1) ^ 1) << j;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tauto find = std::find(vertical.begin() + i, vertical.end(), target);\\n\\t\\t\\t\\t\\tif (find == vertical.end()) {\\n\\t\\t\\t\\t\\t\\tfind = std::find(vertical.begin() + i, vertical.end(), reverse(target));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif (find == vertical.end()) {\\n\\t\\t\\t\\t\\t\\t--c;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tstd::swap(vertical[i], *find);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t++c;\\n\\t\\t\\t}\\n\\t\\t} while (std::next_permutation(index.begin(), index.end()));\\n\\t\\tcount += c;\\n\\t};\\n\\titerate(boards, block);\\n\\treturn count >> 1;\\n}\\n\\nint main() {\\n\\twhile (true) {\\n\\t\\tstd::string first; std::cin >> first;\\n\\t\\tif (first == \\\"END\\\") break;\\n\\t\\tstd::vector<int> boards(10);\\n\\t\\tboards[0] = std::stoi(first, nullptr, 2);\\n\\t\\tfor (auto i = 1; i < 10; ++i) {\\n\\t\\t\\tstd::cin >> first;\\n\\t\\t\\tboards[i] = std::stoi(first, nullptr, 2);\\n\\t\\t}\\n\\t\\tstd::cout << solve(boards) << '\\\\n';\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3296,\n \"score_of_the_acc\": -0.0805,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1201_2590910\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <set>\\n#include <map>\\n#include <time.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\nchar table[20][6];\\n\\nint ans;\\n\\nvoid recursive(bool used[20],int yoko[5],int yoko_index,int tate[5],int tate_index,bool is_pre_yoko){\\n\\n\\tif(is_pre_yoko == false && tate_index == 5){\\n\\t\\tans++;\\n\\t\\treturn;\\n\\t}\\n\\n\\tif(is_pre_yoko == false){\\n\\n\\t\\tswitch(yoko_index){\\n\\t\\tcase 0:\\n\\t\\t\\tfor(int i = 0; i < 20; i++){\\n\\t\\t\\t\\tif(used[i] == false){\\n\\t\\t\\t\\t\\tint next_yoko[5];\\n\\t\\t\\t\\t\\tnext_yoko[0] = i;\\n\\t\\t\\t\\t\\tbool next_used[20];\\n\\t\\t\\t\\t\\tfor(int k = 0; k < 20; k++)next_used[k] = used[k];\\n\\t\\t\\t\\t\\tnext_used[i] = true;\\n\\t\\t\\t\\t\\tif(i <= 9)next_used[i+10] = true;\\n\\t\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\t\\tnext_used[i-10] = true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\trecursive(next_used,next_yoko,yoko_index+1,tate,tate_index,true);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tbreak;\\n\\t\\tcase 1:\\n\\t\\t\\tfor(int i = 0; i < 20; i++){\\n\\t\\t\\t\\tif(used[i] == false && abs(table[tate[0]][1]-table[i][0]) == 1){\\n\\t\\t\\t\\t\\tint next_yoko[5];\\n\\t\\t\\t\\t\\tfor(int k = 0; k < 1; k++)next_yoko[k] = yoko[k];\\n\\t\\t\\t\\t\\tnext_yoko[1] = i;\\n\\t\\t\\t\\t\\tbool next_used[20];\\n\\t\\t\\t\\t\\tfor(int k = 0; k < 20; k++)next_used[k] = used[k];\\n\\t\\t\\t\\t\\tnext_used[i] = true;\\n\\t\\t\\t\\t\\tif(i <= 9)next_used[i+10] = true;\\n\\t\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\t\\tnext_used[i-10] = true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\trecursive(next_used,next_yoko,yoko_index+1,tate,tate_index,true);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tbreak;\\n\\t\\tcase 2:\\n\\t\\t\\tfor(int i = 0; i < 20; i++){\\n\\t\\t\\t\\tif(used[i] == false && abs(table[tate[0]][2]-table[i][0]) == 1 && abs(table[tate[1]][2]-table[i][1]) == 1){\\n\\t\\t\\t\\t\\tint next_yoko[5];\\n\\t\\t\\t\\t\\tfor(int k = 0; k < 2; k++)next_yoko[k] = yoko[k];\\n\\t\\t\\t\\t\\tnext_yoko[2] = i;\\n\\t\\t\\t\\t\\tbool next_used[20];\\n\\t\\t\\t\\t\\tfor(int k = 0; k < 20; k++)next_used[k] = used[k];\\n\\t\\t\\t\\t\\tnext_used[i] = true;\\n\\t\\t\\t\\t\\tif(i <= 9)next_used[i+10] = true;\\n\\t\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\t\\tnext_used[i-10] = true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\trecursive(next_used,next_yoko,yoko_index+1,tate,tate_index,true);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tbreak;\\n\\t\\tcase 3:\\n\\t\\t\\tfor(int i = 0; i < 20; i++){\\n\\t\\t\\t\\tif(used[i] == false && abs(table[tate[0]][3]-table[i][0]) == 1 && abs(table[tate[1]][3]-table[i][1]) == 1 &&\\n\\t\\t\\t\\t\\t\\tabs(table[tate[2]][3]-table[i][2]) == 1 ){\\n\\t\\t\\t\\t\\tint next_yoko[5];\\n\\t\\t\\t\\t\\tfor(int k = 0; k < 3; k++)next_yoko[k] = yoko[k];\\n\\t\\t\\t\\t\\tnext_yoko[3] = i;\\n\\t\\t\\t\\t\\tbool next_used[20];\\n\\t\\t\\t\\t\\tfor(int k = 0; k < 20; k++)next_used[k] = used[k];\\n\\t\\t\\t\\t\\tnext_used[i] = true;\\n\\t\\t\\t\\t\\tif(i <= 9)next_used[i+10] = true;\\n\\t\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\t\\tnext_used[i-10] = true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\trecursive(next_used,next_yoko,yoko_index+1,tate,tate_index,true);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tbreak;\\n\\t\\tcase 4:\\n\\t\\t\\tfor(int i = 0; i < 20; i++){\\n\\t\\t\\t\\tif(used[i] == false && abs(table[tate[0]][4]-table[i][0]) == 1 && abs(table[tate[1]][4]-table[i][1]) == 1 &&\\n\\t\\t\\t\\t\\t\\tabs(table[tate[2]][4]-table[i][2]) == 1 && abs(table[tate[3]][4]-table[i][3]) == 1){\\n\\t\\t\\t\\t\\tint next_yoko[5];\\n\\t\\t\\t\\t\\tfor(int k = 0; k < 4; k++)next_yoko[k] = yoko[k];\\n\\t\\t\\t\\t\\tnext_yoko[4] = i;\\n\\t\\t\\t\\t\\tbool next_used[20];\\n\\t\\t\\t\\t\\tfor(int k = 0; k < 20; k++)next_used[k] = used[k];\\n\\t\\t\\t\\t\\tnext_used[i] = true;\\n\\t\\t\\t\\t\\tif(i <= 9)next_used[i+10] = true;\\n\\t\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\t\\tnext_used[i-10] = true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\trecursive(next_used,next_yoko,yoko_index+1,tate,tate_index,true);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\n\\t}else{\\n\\n\\t\\tswitch(tate_index){\\n\\t\\tcase 0:\\n\\t\\t\\tfor(int i = 0; i < 20; i++){\\n\\t\\t\\t\\tif(used[i] == false && abs(table[yoko[0]][0] - table[i][0]) == 1){\\n\\t\\t\\t\\t\\tint next_tate[5];\\n\\t\\t\\t\\t\\tnext_tate[0] = i;\\n\\t\\t\\t\\t\\tbool next_used[20];\\n\\t\\t\\t\\t\\tfor(int k = 0; k < 20; k++)next_used[k] = used[k];\\n\\t\\t\\t\\t\\tnext_used[i] = true;\\n\\t\\t\\t\\t\\tif(i <= 9)next_used[i+10] = true;\\n\\t\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\t\\tnext_used[i-10] = true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\trecursive(next_used,yoko,yoko_index,next_tate,tate_index+1,false);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tbreak;\\n\\t\\tcase 1:\\n\\t\\t\\tfor(int i = 0; i < 20; i++){\\n\\t\\t\\t\\tif(used[i] == false && abs(table[yoko[0]][1] - table[i][0]) == 1 && abs(table[yoko[1]][1]-table[i][1]) == 1){\\n\\t\\t\\t\\t\\tint next_tate[5];\\n\\t\\t\\t\\t\\tfor(int k = 0; k < 1; k++)next_tate[k] = tate[k];\\n\\t\\t\\t\\t\\tnext_tate[1] = i;\\n\\t\\t\\t\\t\\tbool next_used[20];\\n\\t\\t\\t\\t\\tfor(int k = 0; k < 20; k++)next_used[k] = used[k];\\n\\t\\t\\t\\t\\tnext_used[i] = true;\\n\\t\\t\\t\\t\\tif(i <= 9)next_used[i+10] = true;\\n\\t\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\t\\tnext_used[i-10] = true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\trecursive(next_used,yoko,yoko_index,next_tate,tate_index+1,false);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tbreak;\\n\\t\\tcase 2:\\n\\t\\t\\tfor(int i = 0; i < 20; i++){\\n\\t\\t\\t\\tif(used[i] == false && abs(table[yoko[0]][2] - table[i][0]) == 1 && abs(table[yoko[1]][2]-table[i][1]) == 1 &&\\n\\t\\t\\t\\t\\t\\tabs(table[yoko[2]][2]-table[i][2]) == 1){\\n\\t\\t\\t\\t\\tint next_tate[5];\\n\\t\\t\\t\\t\\tfor(int k = 0; k < 2; k++)next_tate[k] = tate[k];\\n\\t\\t\\t\\t\\tnext_tate[2] = i;\\n\\t\\t\\t\\t\\tbool next_used[20];\\n\\t\\t\\t\\t\\tfor(int k = 0; k < 20; k++)next_used[k] = used[k];\\n\\t\\t\\t\\t\\tnext_used[i] = true;\\n\\t\\t\\t\\t\\tif(i <= 9)next_used[i+10] = true;\\n\\t\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\t\\tnext_used[i-10] = true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\trecursive(next_used,yoko,yoko_index,next_tate,tate_index+1,false);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tbreak;\\n\\t\\tcase 3:\\n\\t\\t\\tfor(int i = 0; i < 20; i++){\\n\\t\\t\\t\\tif(used[i] == false && abs(table[yoko[0]][3] - table[i][0]) == 1 && abs(table[yoko[1]][3]-table[i][1]) == 1 &&\\n\\t\\t\\t\\t\\t\\tabs(table[yoko[2]][3]-table[i][2]) == 1 && abs(table[yoko[3]][3]-table[i][3]) == 1){\\n\\t\\t\\t\\t\\tint next_tate[5];\\n\\t\\t\\t\\t\\tfor(int k = 0; k < 3; k++)next_tate[k] = tate[k];\\n\\t\\t\\t\\t\\tnext_tate[3] = i;\\n\\t\\t\\t\\t\\tbool next_used[20];\\n\\t\\t\\t\\t\\tfor(int k = 0; k < 20; k++)next_used[k] = used[k];\\n\\t\\t\\t\\t\\tnext_used[i] = true;\\n\\t\\t\\t\\t\\tif(i <= 9)next_used[i+10] = true;\\n\\t\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\t\\tnext_used[i-10] = true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\trecursive(next_used,yoko,yoko_index,next_tate,tate_index+1,false);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tbreak;\\n\\t\\tcase 4:\\n\\t\\t\\tfor(int i = 0; i < 20; i++){\\n\\t\\t\\t\\tif(used[i] == false && abs(table[yoko[0]][4] - table[i][0]) == 1 && abs(table[yoko[1]][4]-table[i][1]) == 1 &&\\n\\t\\t\\t\\t\\t\\tabs(table[yoko[2]][4]-table[i][2]) == 1 && abs(table[yoko[3]][4]-table[i][3]) == 1 && abs(table[yoko[4]][4]-table[i][4]) == 1){\\n\\t\\t\\t\\t\\tint next_tate[5];\\n\\t\\t\\t\\t\\tfor(int k = 0; k < 4; k++)next_tate[k] = tate[k];\\n\\t\\t\\t\\t\\tnext_tate[4] = i;\\n\\t\\t\\t\\t\\tbool next_used[20];\\n\\t\\t\\t\\t\\tfor(int k = 0; k < 20; k++)next_used[k] = used[k];\\n\\t\\t\\t\\t\\tnext_used[i] = true;\\n\\t\\t\\t\\t\\tif(i <= 9)next_used[i+10] = true;\\n\\t\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\t\\tnext_used[i-10] = true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\trecursive(next_used,yoko,yoko_index,next_tate,tate_index+1,false);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n}\\n\\nvoid func(){\\n\\n\\tfor(int i = 1; i <= 9; i++)scanf(\\\"%s\\\",table[i]);\\n\\n\\tbool first_used[20];\\n\\tfor(int i = 0; i < 20; i++)first_used[i] = false;\\n\\n\\tfor(int i = 0; i < 10; i++){\\n\\t\\tfor(int k = 0; k < 5; k++)table[i+10][k] = table[i][4-k];\\n\\n\\t\\tif(table[i][0] == table[i][4] && table[i][1] == table[i][3]){\\n\\t\\t\\tfirst_used[i+10] = true;\\n\\t\\t}\\n\\t}\\n\\n\\tans = 0;\\n\\n\\tint first_yoko[5],first_tate[5];\\n\\n\\trecursive(first_used,first_yoko,0,first_tate,0,false);\\n\\n\\tprintf(\\\"%d\\\\n\\\",ans/8);\\n}\\n\\nint main(){\\n\\n\\twhile(true){\\n\\t\\tscanf(\\\"%s\\\",table[0]);\\n\\t\\tif(table[0][0] == 'E')break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3168,\n \"score_of_the_acc\": -0.0749,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1201_2549491\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define int long long\\n#define N 100010\\nusing namespace std;\\ntypedef unsigned long long ull;\\nconst int INF = 1LL<<55;\\nconst int mod = (1e9)+7;\\nconst double EPS = 1e-8;\\nconst double PI = 6.0 * asin(0.5);\\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\\nvector<vector<int> > AB,A,B;\\nint Aidx[5],Bidx[5];\\n\\nset<ull> S;\\null VtoH(const vector<vector<int> > &v){\\n const ull B = 1777771;\\n ull res = 0;\\n for(int i=0;i<5;i++)\\n for(int j=0;j<5;j++) res = res * B + (v[i][j]+'0');\\n return res;\\n}\\n\\nvector<int> rev(vector<int> a){reverse(a.begin(),a.end());return a;}\\nvoid mirror(vector<vector<int> > &res){for(int i=0;i<5;i++) res[i] = rev(res[i]);}\\n\\nvector<vector<int> > rot(const vector<vector<int> > &a){\\n vector<vector<int> > res(5,vector<int>(5));\\n for(int i=0;i<5;i++)\\n for(int j=0;j<5;j++) res[i][j] = a[4-j][i];\\n return res;\\n}\\n\\nvoid insert(vector<vector<int> > &v){\\n S.insert(VtoH(v));\\n v = rot(v) , v = rot(v), S.insert(VtoH(v));\\n mirror(v), S.insert(VtoH(v));\\n v = rot(v) , v = rot(v), S.insert(VtoH(v));\\n}\\n\\nbool canPut(int idx,int j){\\n int a = 1, b = 1;\\n for(int i=0;i<5;i++) if(A[i][j] == B[idx][i]) a = 0;\\n for(int i=0;i<5;i++) if(A[i][j] == B[idx][4-i]) b = 0;\\n return a || b;\\n}\\n\\nbool can(){\\n int used = 0;\\n for(int i=0;i<5;i++){\\n for(int nx=0;nx<5;nx++){\\n if((used>>nx&1) || !canPut(nx,i)) continue;\\n Bidx[i] = nx;\\n used |= (1<<nx);\\n break;\\n }\\n }\\n return used == (1<<5)-1;\\n}\\n\\nint solve(){\\n S.clear();\\n int res = 0;\\n for(int i=0;i<5;i++) Aidx[i] = i;\\n for(int bit=0;bit<(1<<10);bit++){\\n if(__builtin_popcount(bit) != 5) continue; \\n A.clear();B.clear();\\n for(int i=0;i<10;i++) (bit>>i&1)? A.push_back(AB[i]):B.push_back(AB[i]);\\n vector<vector<int> > tmp = A;\\n do{\\n for(int a=0;a<(1<<5);a++){\\n for(int i=0;i<5;i++) A[Aidx[i]] = (a>>i&1)? rev(tmp[i]):tmp[i];\\n if(!can() || S.count(VtoH(A))) continue;\\n insert(A);\\n res++;\\n }\\n } while(next_permutation(Aidx,Aidx+5));\\n }\\n return res/2;\\n}\\n\\nsigned main(){\\n while(1){\\n AB.clear();\\n for(int i=0;i<10;i++){\\n string str;\\n cin>>str;\\n if(str == \\\"END\\\") return 0;\\n vector<int> tmp(5);\\n for(int j=0;j<5;j++) tmp[j] = str[j] - '0';\\n AB.push_back(tmp);\\n }\\n cout<<solve()<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2750,\n \"memory_kb\": 3200,\n \"score_of_the_acc\": -0.4305,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1201_2549490\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define int long long\\n#define N 100010\\nusing namespace std;\\ntypedef unsigned long long ull;\\nconst int INF = 1LL<<55;\\nconst int mod = (1e9)+7;\\nconst double EPS = 1e-8;\\nconst double PI = 6.0 * asin(0.5);\\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\\nvector<vector<int> > AB,A,B;\\nint Aidx[5],Bidx[5];\\n\\nunordered_set<ull> S;\\null VtoH(const vector<vector<int> > &v){\\n const ull B = 1777771;\\n ull res = 0;\\n for(int i=0;i<5;i++)\\n for(int j=0;j<5;j++) res = res * B + (v[i][j]+'0');\\n return res;\\n}\\n\\nvector<int> rev(vector<int> a){reverse(a.begin(),a.end());return a;}\\nvoid mirror(vector<vector<int> > &res){for(int i=0;i<5;i++) res[i] = rev(res[i]);}\\n\\nvector<vector<int> > rot(const vector<vector<int> > &a){\\n vector<vector<int> > res(5,vector<int>(5));\\n for(int i=0;i<5;i++)\\n for(int j=0;j<5;j++) res[i][j] = a[4-j][i];\\n return res;\\n}\\n\\nvoid insert(vector<vector<int> > &v){\\n S.insert(VtoH(v));\\n v = rot(v) , v = rot(v), S.insert(VtoH(v));\\n mirror(v), S.insert(VtoH(v));\\n v = rot(v) , v = rot(v), S.insert(VtoH(v));\\n}\\n\\nbool canPut(int idx,int j){\\n int a = 1, b = 1;\\n for(int i=0;i<5;i++) if(A[i][j] == B[idx][i]) a = 0;\\n for(int i=0;i<5;i++) if(A[i][j] == B[idx][4-i]) b = 0;\\n return a || b;\\n}\\n\\nbool can(){\\n int used = 0;\\n for(int i=0;i<5;i++){\\n for(int nx=0;nx<5;nx++){\\n if((used>>nx&1) || !canPut(nx,i)) continue;\\n Bidx[i] = nx;\\n used |= (1<<nx);\\n break;\\n }\\n }\\n return used == (1<<5)-1;\\n}\\n\\nint solve(){\\n S.clear();\\n int res = 0;\\n for(int i=0;i<5;i++) Aidx[i] = i;\\n for(int bit=0;bit<(1<<10);bit++){\\n if(__builtin_popcount(bit) != 5) continue; \\n A.clear();B.clear();\\n for(int i=0;i<10;i++) (bit>>i&1)? A.push_back(AB[i]):B.push_back(AB[i]);\\n vector<vector<int> > tmp = A;\\n do{\\n for(int a=0;a<(1<<5);a++){\\n for(int i=0;i<5;i++) A[Aidx[i]] = (a>>i&1)? rev(tmp[i]):tmp[i];\\n if(!can() || S.count(VtoH(A))) continue;\\n insert(A);\\n res++;\\n }\\n } while(next_permutation(Aidx,Aidx+5));\\n }\\n return res/2;\\n}\\n\\nsigned main(){\\n while(1){\\n AB.clear();\\n for(int i=0;i<10;i++){\\n string str;\\n cin>>str;\\n if(str == \\\"END\\\") return 0;\\n vector<int> tmp(5);\\n for(int j=0;j<5;j++) tmp[j] = str[j] - '0';\\n AB.push_back(tmp);\\n }\\n cout<<solve()<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2760,\n \"memory_kb\": 3196,\n \"score_of_the_acc\": -0.4317,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1201_2549488\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define int long long\\n#define N 100010\\nusing namespace std;\\ntypedef unsigned long long ull;\\nconst int INF = 1LL<<55;\\nconst int mod = (1e9)+7;\\nconst double EPS = 1e-8;\\nconst double PI = 6.0 * asin(0.5);\\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\\nvector<vector<int> > AB,A,B;\\nint Aidx[5],Bidx[5];\\n\\nunordered_set<ull> S;\\null VtoH(const vector<vector<int> > &v){\\n const ull B = 1777771;\\n ull res = 0;\\n for(int i=0;i<5;i++)\\n for(int j=0;j<5;j++) res = res * B + (v[i][j]+'0');\\n return res;\\n}\\n\\nvector<int> rev(vector<int> a){reverse(a.begin(),a.end());return a;}\\nvoid mirror(vector<vector<int> > &res){for(int i=0;i<5;i++) res[i] = rev(res[i]);}\\n\\nvector<vector<int> > rot(const vector<vector<int> > &a){\\n vector<vector<int> > res(5,vector<int>(5));\\n for(int i=0;i<5;i++)\\n for(int j=0;j<5;j++) res[i][j] = a[4-j][i];\\n return res;\\n}\\n\\nvoid insert(vector<vector<int> > v){\\n S.insert(VtoH(v));\\n v = rot(v) , v = rot(v), S.insert(VtoH(v));\\n mirror(v), S.insert(VtoH(v));\\n v = rot(v) , v = rot(v), S.insert(VtoH(v));\\n}\\n\\nbool canPut(int idx,int j){\\n int a = 1, b = 1;\\n for(int i=0;i<5;i++) if(A[i][j] == B[idx][i]) a = 0;\\n for(int i=0;i<5;i++) if(A[i][j] == B[idx][4-i]) b = 0;\\n return a || b;\\n}\\n\\nbool can(){\\n int used = 0;\\n for(int i=0;i<5;i++){\\n for(int nx=0;nx<5;nx++){\\n if((used>>nx&1) || !canPut(nx,i)) continue;\\n Bidx[i] = nx;\\n used |= (1<<nx);\\n break;\\n }\\n }\\n return used == (1<<5)-1;\\n}\\n\\nint solve(){\\n S.clear();\\n int res = 0;\\n for(int i=0;i<5;i++) Aidx[i] = i;\\n for(int bit=0;bit<(1<<10);bit++){\\n if(__builtin_popcount(bit) != 5) continue; \\n A.clear();B.clear();\\n for(int i=0;i<10;i++) (bit>>i&1)? A.push_back(AB[i]):B.push_back(AB[i]);\\n vector<vector<int> > tmp = A;\\n do{\\n for(int a=0;a<(1<<5);a++){\\n for(int i=0;i<5;i++) A[Aidx[i]] = (a>>i&1)? rev(tmp[i]):tmp[i];\\n if(!can() || S.count(VtoH(A))) continue;\\n insert(A);\\n res++;\\n }\\n } while(next_permutation(Aidx,Aidx+5));\\n }\\n return res/2;\\n}\\n\\nsigned main(){\\n while(1){\\n AB.clear();\\n for(int i=0;i<10;i++){\\n string str;\\n cin>>str;\\n if(str == \\\"END\\\") return 0;\\n vector<int> tmp(5);\\n for(int j=0;j<5;j++) tmp[j] = str[j] - '0';\\n AB.push_back(tmp);\\n }\\n cout<<solve()<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2730,\n \"memory_kb\": 3184,\n \"score_of_the_acc\": -0.4274,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1201_2549486\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define int long long\\n#define N 100010\\nusing namespace std;\\ntypedef unsigned long long ull;\\nconst int INF = 1LL<<55;\\nconst int mod = (1e9)+7;\\nconst double EPS = 1e-8;\\nconst double PI = 6.0 * asin(0.5);\\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\\nvector<vector<int> > AB,A,B;\\nint Aidx[5],Bidx[5];\\n\\nunordered_set<ull> S;\\null VtoH(const vector<vector<int> > &v){\\n const ull B = 1777771;\\n ull res = 0;\\n for(int i=0;i<5;i++)\\n for(int j=0;j<5;j++) res = res * B + (v[i][j]+'0');\\n return res;\\n}\\n\\nvector<int> rev(vector<int> a){reverse(a.begin(),a.end());return a;}\\nvoid mirror(vector<vector<int> > &res){for(int i=0;i<5;i++) res[i] = rev(res[i]);}\\n\\nvector<vector<int> > rot(const vector<vector<int> > &a){\\n vector<vector<int> > res(5,vector<int>(5));\\n for(int i=0;i<5;i++)\\n for(int j=0;j<5;j++) res[i][j] = a[4-j][i];\\n return res;\\n}\\n\\nvoid insert(vector<vector<int> > v){\\n S.insert(VtoH(v));\\n v = rot(v) , v = rot(v), S.insert(VtoH(v));\\n mirror(v), S.insert(VtoH(v));\\n v = rot(v) , v = rot(v), S.insert(VtoH(v));\\n}\\n\\nbool canPut(int idx,int j){\\n int a = 1, b = 1;\\n for(int i=0;i<5;i++) if(A[i][j] == B[idx][i]) a = 0;\\n for(int i=0;i<5;i++) if(A[i][j] == B[idx][4-i]) b = 0;\\n return a || b;\\n}\\n\\nbool can(){\\n int used = 0;\\n for(int i=0;i<5;i++){\\n for(int nx=0;nx<5;nx++){\\n if((used>>nx&1) || !canPut(nx,i)) continue;\\n Bidx[i] = nx;\\n used |= (1<<nx);\\n break;\\n }\\n }\\n return used == (1<<5)-1;\\n}\\n\\nint solve(){\\n S.clear();\\n int res = 0;\\n for(int i=0;i<5;i++) Aidx[i] = i;\\n for(int bit=0;bit<(1<<10);bit++){\\n if(__builtin_popcount(bit) != 5) continue; \\n A.clear();B.clear();\\n for(int i=0;i<10;i++) (bit>>i&1)? A.push_back(AB[i]):B.push_back(AB[i]);\\n vector<vector<int> > tmp = A;\\n do{\\n for(int a=0;a<(1<<5);a++){\\n for(int i=0;i<5;i++) A[Aidx[i]] = (a>>i&1)? rev(tmp[i]):tmp[i];\\n if(S.count(VtoH(A)) || !can()) continue;\\n insert(A);\\n res++;\\n }\\n } while(next_permutation(Aidx,Aidx+5));\\n }\\n return res/2;\\n}\\n\\nsigned main(){\\n while(1){\\n AB.clear();\\n for(int i=0;i<10;i++){\\n string str;\\n cin>>str;\\n if(str == \\\"END\\\") return 0;\\n vector<int> tmp(5);\\n for(int j=0;j<5;j++) tmp[j] = str[j] - '0';\\n AB.push_back(tmp);\\n }\\n cout<<solve()<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3160,\n \"memory_kb\": 3184,\n \"score_of_the_acc\": -0.4832,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1201_2548446\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define r(i,n) for(int i=0;i<n;i++)\\nusing namespace std;\\nint ans;\\nstring s[10],r[10];\\nstring t1[5],t2[5];\\nbool b[11];\\nbool check(int p){\\n r(i,5)if(t1[i][p]==t2[p][i])return 0;\\n return 1;\\n}\\nvoid dfs2(int d){\\n if(d==5)ans++;\\n else{\\n r(i,10)if(!b[i]){\\n b[i]=1;\\n t2[d]=s[i];\\n if(check(d))dfs2(d+1);\\n t2[d]=r[i];\\n if(check(d))dfs2(d+1);\\n b[i]=0;\\n }\\n }\\n}\\nvoid dfs(int d){\\n if(d==5)dfs2(0);\\n else{\\n r(i,10)if(!b[i]){\\n b[i]=1;\\n t1[d]=s[i];\\n dfs(d+1);\\n t1[d]=r[i];\\n dfs(d+1);\\n b[i]=0;\\n }\\n }\\n}\\nmain(){\\n while(cin>>s[0],s[0]!=\\\"END\\\"){\\n memset(b,0,sizeof(b));\\n ans=0;\\n r[0]=s[0];\\n reverse(r[0].begin(),r[0].end());\\n r(i,9){\\n cin>>s[i+1];\\n r[i+1]=s[i+1];\\n reverse(r[i+1].begin(),r[i+1].end());\\n }\\n int p=0;\\n r(i,10)if(s[i]==r[i])p++;\\n dfs(0);\\n cout<<ans/(pow(2,p)*8)<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5080,\n \"memory_kb\": 3404,\n \"score_of_the_acc\": -0.7399,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1201_2293703\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define int long long\\nstring s[10];\\nset<int> si,us,cu;\\nvector<int> v;\\nint x,y;\\nint calc(const int a[5][5]){\\n int res=0;\\n for(int i=0;i<5;i++)\\n for(int j=0;j<5;j++)\\n res+=(1LL<<(i*5+j))*a[i][j];\\n return res;\\n}\\nint calc2(const int a[5][5]){\\n int res=0;\\n for(int i=0;i<5;i++)\\n for(int j=0;j<5;j++)\\n res+=(1LL<<(i*5+j))*a[i][4-j];\\n return res;\\n}\\nstring t[5];\\nbool check(){\\n map<string,int> ms;\\n for(int i=0;i<10;i++){\\n if(cu.count(i)) continue;\\n string tmp=s[i];\\n ms[tmp]++;\\n reverse(tmp.begin(),tmp.end());\\n ms[tmp]++;\\n }\\n for(int i=0;i<5;i++){\\n string tmp=t[i];\\n ms[tmp]--;\\n reverse(tmp.begin(),tmp.end());\\n ms[tmp]--;\\n if(ms[t[i]]<0) return false;\\n }\\n return true;\\n}\\nset<int> memo[6];\\nvoid dfs(int d){\\n if(memo[d].count(x)) return;\\n memo[d].insert(x);\\n if(d==5){\\n if(si.count(x)) return;\\n if(!check()) return;\\n si.insert(x);\\n return;\\n }\\n for(int i=0;i<20;i++){\\n if(cu.count(i%10)) continue;\\n cu.insert(i%10);\\n if(i>=10) reverse(s[i%10].begin(),s[i%10].end());\\n v.push_back(i%10);\\n for(int j=0;j<5;j++){\\n t[j]+=(s[i%10][j]=='1'?'0':'1');\\n x+=(1LL<<(d*5+j))*(s[i%10][j]=='1');\\n }\\n dfs(d+1);\\n v.pop_back();\\n for(int j=0;j<5;j++){\\n t[j].pop_back();\\n x-=(1LL<<(d*5+j))*(s[i%10][j]=='1');\\n }\\n if(i>=10) reverse(s[i%10].begin(),s[i%10].end());\\n cu.erase(i%10);\\n }\\n}\\nsigned main(){\\n while(cin>>s[0],s[0]!=\\\"END\\\"){\\n for(int i=1;i<10;i++) cin>>s[i];\\n si.clear();\\n us.clear();\\n for(int i=0;i<6;i++) memo[i].clear();\\n x=y=0;\\n dfs(0);\\n int a[5][5];\\n int c[5][5];\\n int ans=0;\\n for(int b:si){\\n if(us.count(b)) continue;\\n for(int i=0;i<5;i++)\\n\\tfor(int j=0;j<5;j++)\\n\\t a[i][j]=(b>>(i*5+j))&1;\\n us.insert(calc(a));\\n us.insert(calc2(a));\\n for(int i=0;i<5;i++)\\n\\tfor(int j=0;j<5;j++)\\n\\t c[i][j]=a[4-j][i];\\n us.insert(calc(c));\\n us.insert(calc2(c));\\n for(int i=0;i<5;i++)\\n\\tfor(int j=0;j<5;j++)\\n\\t c[i][j]=a[j][4-i];\\n us.insert(calc(c));\\n us.insert(calc2(c));\\n for(int i=0;i<5;i++)\\n\\tfor(int j=0;j<5;j++)\\n\\t c[i][j]=a[4-i][4-j];\\n us.insert(calc(c));\\n us.insert(calc2(c));\\n ans++;\\n }\\n //cout<<si.size()<<endl<<us.size()<<endl;\\n cout<<ans/2<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 7710,\n \"memory_kb\": 30904,\n \"score_of_the_acc\": -2,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1201_2061405\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\nusing ld = long double;\\nconst ld eps = 1e-9;\\n\\n//// < \\\"d:\\\\d_download\\\\visual studio 2015\\\\projects\\\\programing_contest_c++\\\\debug\\\\a.txt\\\" > \\\"d:\\\\d_download\\\\visual studio 2015\\\\projects\\\\programing_contest_c++\\\\debug\\\\b.txt\\\"\\n\\nint getnum(vector<int>&used, const vector<vector<int>>&walls, vector<vector<int>>&decided,int now) {\\n\\tint sum = 0;\\n\\tif (now == 10)return 1;\\n\\telse \\tif (now < 5) {\\n\\t\\tconst int y = now;\\n\\t\\tfor (int i = 0; i < 10; ++i) {\\n\\t\\t\\tif (used[i])continue;\\n\\t\\t\\telse {\\n\\t\\t\\t\\tused[i] = true;\\n\\t\\t\\t\\tfor (int rev = 0; rev < 2; ++rev) {\\n\\t\\t\\t\\t\\tif (rev&&walls[i][0] == walls[i][4] && walls[i][1] == walls[i][3])continue;\\n\\t\\t\\t\\t\\tfor (int x = 0; x < 5; ++x) {\\n\\t\\t\\t\\t\\t\\tdecided[y][rev?4-x:x] = walls[i][x];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tsum += getnum(used, walls, decided, now + 1);\\n\\t\\t\\t\\t\\tfor (int x = 0; x < 5; ++x) {\\n\\t\\t\\t\\t\\t\\tdecided[y][rev ? 4 - x : x] = -1;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tused[i] = false;\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t}\\n\\telse {\\n\\t\\tconst int x = now-5;\\n\\t\\tfor (int i = 0; i < 10; ++i) {\\n\\t\\t\\tif (used[i])continue;\\n\\t\\t\\telse {\\n\\t\\t\\t\\tused[i] = true;\\n\\t\\t\\t\\tfor (int rev = 0; rev < 2; ++rev) {\\n\\t\\t\\t\\t\\tif (rev&&walls[i][0] == walls[i][4] && walls[i][1] == walls[i][3])continue;\\n\\n\\t\\t\\t\\t\\tbool ok = true;\\n\\t\\t\\t\\t\\tfor (int y = 0; y < 5; ++y) {\\n\\t\\t\\t\\t\\t\\tif (decided[rev ? 4 - y : y][x] == walls[i][y])ok = false;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif (!ok)continue;\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tsum += getnum(used, walls, decided, now + 1);\\n\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tused[i] = false;\\n\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t}\\n\\treturn sum;\\n}\\n\\nint main() {\\n\\twhile (1) {\\n\\t\\tvector<vector<int>>walls (10);\\n\\t\\tfor (int i = 0; i < 10; ++i) {\\n\\t\\t\\tstring st; cin >> st;\\n\\t\\t\\tif (st == \\\"END\\\")return 0;\\n\\t\\t\\telse {\\n\\t\\t\\t\\tfor (int j = 0; j< 5; ++j) {\\n\\t\\t\\t\\t\\twalls[i].push_back(st[j] == '1');\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvector<int>used(10, false);\\n\\t\\tvector<vector<int>>decided(5, vector<int>(5, -1));\\n\\t\\tint ans = getnum(used, walls, decided, 0);\\n\\t\\tcout << ans/8<< endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 460,\n \"memory_kb\": 3120,\n \"score_of_the_acc\": -0.1305,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1201_1952873\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <string>\\n#include <vector>\\n#include <deque>\\n#include <list>\\n#include <algorithm>\\n#include <numeric>\\n#include <functional>\\n#include <cmath>\\n#include <cstring>\\n#include <cctype>\\n#include <sstream>\\n#include <set>\\n#include <map>\\n#include <stack>\\n#include <queue>\\n#include <complex>\\nusing namespace std;\\n#define REP(i,n) for(int i = 0; i < (int)n; i++)\\n#define FOR(i,a,b) for(int i = a; i < (int)b; i++)\\n#define pb push_back\\n#define mp make_pair\\ntypedef vector<int> vi;\\ntypedef pair<int, int> pi;\\ntypedef long long ll;\\nconst int INF = 1<<28;\\nconst ll MOD = 1000000007;\\n\\nint cnt;\\nstring s[2][10];\\nbool same[10];\\n\\nbool chk(string &a, string &b, int &pnt) {\\n\\tREP(i, 5) {\\n\\t\\tif(a[i*5 + pnt - 5] == b[i])\\n\\t\\t\\treturn false;\\n\\t}\\n\\treturn true;\\n}\\n\\nvoid dfs(int pnt, string done, bool b[2][10]) {\\n\\tif(pnt == 10) {\\n\\t\\t/*\\n\\t\\t//debug\\n\\t\\tREP(i, 10) {\\n\\t\\t\\tREP(j, 5) {\\n\\t\\t\\t\\tcout << done[i*5 + j] << ' ';\\n\\t\\t\\t}\\n\\t\\t\\tcout << endl;\\n\\t\\t\\tif(i == 4) cout << \\\"-----\\\" << endl;\\n\\t\\t}\\n\\t\\tcout << endl;\\n\\t\\t*/\\n\\t\\tcnt++;\\n\\t\\treturn;\\n\\t}\\n\\tif(pnt < 5) {\\n\\t\\tREP(i, 2) REP(j, 10) {\\n\\t\\t\\tif(!b[i][j]) {\\n\\t\\t\\t\\tb[0][j] = true;\\n\\t\\t\\t\\tb[1][j] = true;\\n\\t\\t\\t\\tdfs(pnt+1, done + s[i][j], b);\\n\\t\\t\\t\\tb[0][j] = false;\\n\\t\\t\\t\\tif(!same[j]) b[1][j] = false;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\telse {\\n\\t\\tREP(i, 2) REP(j, 10) {\\n\\t\\t\\tif(!b[i][j] && chk(done, s[i][j], pnt)) {\\n\\t\\t\\t\\tb[0][j] = true;\\n\\t\\t\\t\\tb[1][j] = true;\\n\\t\\t\\t\\tdfs(pnt+1, done + s[i][j], b);\\n\\t\\t\\t\\tb[0][j] = false;\\n\\t\\t\\t\\tif(!same[j]) b[1][j] = false;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn;\\n}\\n\\nint main() {\\n\\tstring in;\\n\\twhile(cin >> in, in != \\\"END\\\") {\\n\\t\\tbool b[2][10] = {};\\n\\t\\tREP(i, 10) {\\n\\t\\t\\tif(i)\\n\\t\\t\\t\\tcin >> in;\\n\\t\\t\\ts[0][i] = in;\\n\\t\\t\\treverse(in.begin(), in.end());\\n\\t\\t\\ts[1][i] = in;\\n\\t\\t\\tsame[i] = s[0][i] == s[1][i] ? true:false;\\n\\t\\t}\\n\\t\\tcnt = 0;\\n\\t\\tdfs(0, \\\"\\\", b);\\n\\t\\tcout << cnt / 8 << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 870,\n \"memory_kb\": 1200,\n \"score_of_the_acc\": -0.1196,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1201_1923923\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\n/*\\nstring cocoon[10];\\nchar area[5][5];\\nint ans;\\n\\nbool check(bool used[]){\\n\\tbool flag = false;\\n\\n\\n\\n\\treturn flag;\\n}\\n\\nvoid dfs(bool used[], depth){\\n\\tif (depth == 5){\\n\\n\\t}\\n\\n\\n\\treturn;\\n}\\n\\n\\nint main(){\\n\\twhile (cin >> cocoon[0] && cocoon[0][0] != 'E'){\\n\\t\\tfor (int i = 1; i < 10; i++){\\n\\t\\t\\tcin >> cocoon[i];\\n\\t\\t}\\n\\n\\t\\tans = 0;\\n\\t\\tbool used[10] = { false };\\n\\n\\t\\tcout << ans / 8 << endl;\\n\\t}\\n\\treturn 0;\\n\\n\\n}\\n\\n*/\\n\\nint cocoon[10][5];\\nint area[5][5];\\nvector<int> bita, bitb;\\nint ans;\\n\\nbool used[10];\\n\\nvoid check(int depth){\\n\\tint ret = 0;\\n\\n\\tif (depth == 10){\\n\\t\\tans++;\\n\\t\\treturn;\\n\\t}\\n\\telse if (depth >= 5){\\n\\t\\tfor (int i = 0; i < 5; i++){\\n\\t\\t\\tint num = bitb[i];\\n\\t\\t\\tif (used[num]) continue;\\n\\t\\t\\tused[num] = true;\\n\\t\\t\\tbool flag1 = true, flag2 = true;\\n\\n\\t\\t\\tfor (int j = 0; j < 5; j++){\\n\\t\\t\\t\\tif (area[j][depth - 5] == cocoon[num][j]) flag1 = false;\\n\\t\\t\\t\\tif (area[j][depth - 5] == cocoon[num][4 - j]) flag2 = false;\\n\\t\\t\\t}\\n\\n\\t\\t\\tif (flag1 || flag2) check(depth + 1);\\n\\t\\t\\t\\n\\t\\t\\tused[num] = false;\\n\\t\\t}\\n\\t}\\n\\telse{\\n\\t\\tfor (int i = 0; i < 5; i++){\\n\\t\\t\\tint num = bita[i];\\n\\t\\t\\tif (used[num]) continue;\\n\\t\\t\\tused[num] = true;\\n\\n\\t\\t\\tfor (int j = 0; j < 5; j++){\\n\\t\\t\\t\\tarea[depth][j] = cocoon[num][j];\\n\\t\\t\\t}\\n\\t\\t\\tcheck(depth + 1);\\n\\n\\t\\t\\tif (cocoon[num][0] == cocoon[num][4] && cocoon[num][1] == cocoon[num][3]){\\n\\t\\t\\t\\tused[num] = false;\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\n\\t\\t\\tfor (int j = 0; j < 5; j++){\\n\\t\\t\\t\\tarea[depth][j] = cocoon[num][4 - j];\\n\\t\\t\\t}\\n\\t\\t\\tcheck(depth + 1);\\n\\n\\t\\t\\tused[num] = false;\\n\\t\\t}\\n\\t}\\n\\n\\treturn;\\n}\\n\\n\\nint main(void){\\n\\n\\tchar in[50];\\n\\n\\twhile (cin >> in){\\n\\t\\tif (in[0] == 'E') break;\\n\\n\\t\\tfor (int j = 0; j < 5; j++){\\n\\t\\t\\tcocoon[0][j] = in[j] - '0';\\n\\t\\t}\\n\\n\\t\\tfor (int i = 1; i <= 9; i++){\\n\\t\\t\\tcin >> in;\\n\\t\\t\\tfor (int j = 0; j < 5; j++){\\n\\t\\t\\t\\tcocoon[i][j] = in[j] - '0';\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tans = 0;\\n\\n\\t\\tfor (int i = 0; i < 512; i++){\\n\\t\\t\\t\\n\\t\\t\\tbita.clear();\\n\\t\\t\\tbitb.clear();\\n\\t\\t\\tint num = i;\\n\\t\\t\\tfor (int j = 0; j <= 9; j++){\\n\\t\\t\\t\\tif (num % 2 != 0) bita.push_back(j);\\n\\t\\t\\t\\telse bitb.push_back(j);\\n\\n\\t\\t\\t\\tnum = num / 2;\\n\\t\\t\\t}\\n\\n\\t\\t\\tif (bita.size() != 5) continue;\\n\\n\\t\\t\\tcheck(0);\\n\\n\\t\\t}\\n\\n\\t\\tcout << ans / 4 << endl;\\n\\n\\t}\\n\\n\\treturn 0;\\n}\\n\\n\\n\\n/*\\n\\nvoid check(vector<int> a, vector<int> b){\\n\\n\\tif (!a.empty()){\\n\\t\\tint count = a.size();\\n\\t\\tfor (int i = 0; i < count; i++){\\n\\t\\t\\tvector<int> aa(a);\\n\\t\\t\\tint num = a[i];\\n\\t\\t\\taa.erase(aa.begin() + i);\\n\\t\\t\\tfor (int j = 0; j < 5; j++){\\n\\t\\t\\t\\tarea[5 - count][j] = cocoon[num][j];\\n\\t\\t\\t}\\n\\t\\t\\tcheck(aa, b);\\n\\t\\t\\tfor (int j = 0; j < 5; j++){\\n\\t\\t\\t\\tarea[5 - count][j] = cocoon[num][4 - j];\\n\\t\\t\\t}\\n\\t\\t\\tcheck(aa, b);\\n\\t\\t}\\n\\t}\\n\\telse if (!b.empty()){\\n\\t\\tint count = b.size();\\n\\t\\tfor (int i = 0; i < count; i++){\\n\\t\\t\\tvector<int> bb(b);\\n\\t\\t\\tint num = b[i];\\n\\t\\t\\tbool flag1 = true, flag2 = true;\\n\\t\\t\\tfor (int j = 0; j < 5; j++){\\n\\t\\t\\t\\tif (area[j][5 - count] == cocoon[num][j]) flag1 = false;\\n\\t\\t\\t\\tif (area[j][5 - count] == cocoon[num][4 - j]) flag2 = false;\\n\\t\\t\\t}\\n\\n\\t\\t\\tbb.erase(bb.begin() + i);\\n\\n\\t\\t\\tif (flag1) check(a, bb);\\n\\t\\t\\tif (flag2) check(a, bb);\\n\\t\\t}\\n\\t}\\n\\telse{\\n\\t\\tans++;\\n\\t\\treturn;\\n\\t}\\n\\n\\n\\treturn;\\n}\\n\\n\\nint main(void){\\n\\n\\tchar in[50];\\n\\tchar end[] = \\\"END\\\";\\n\\n\\twhile (cin >> in){\\n\\t\\tif (in[0] == 'E') break;\\n\\n\\t\\tfor (int j = 0; j < 5; j++){\\n\\t\\t\\tcocoon[0][j] = in[j] - '0';\\n\\t\\t}\\n\\n\\t\\tfor (int i = 1; i <= 9; i++){\\n\\t\\t\\tcin >> in;\\n\\t\\t\\tfor (int j = 0; j < 5; j++){\\n\\t\\t\\t\\tcocoon[i][j] = in[j] - '0';\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tans = 0;\\n\\n\\t\\tfor (int i = 0; i < 512; i++){\\n\\t\\t\\tvector<int> bita, bitb;\\n\\t\\t\\tint bits = 0;\\n\\t\\t\\tint num = i;\\n\\t\\t\\tfor (int j = 0; j <= 9; j++){\\n\\t\\t\\t\\tif (num % 2 != 0) bita.push_back(j);\\n\\t\\t\\t\\telse bitb.push_back(j);\\n\\n\\t\\t\\t\\tnum = num / 2;\\n\\t\\t\\t}\\n\\n\\t\\t\\tif (bita.size() != 5) continue;\\n\\n\\t\\t\\tcheck(bita, bitb);\\n\\n\\t\\t}\\n\\n\\t\\tcout << ans / 32 << endl;\\n\\n\\t}\\n\\n\\treturn 0;\\n}\\n*/\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 1196,\n \"score_of_the_acc\": -0.0207,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1201_1874949\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n \\nusing namespace std;\\n \\nstring s[10],srev[10];\\nstring H[5],W[5];\\nbool eq[10];\\n \\nbool valid(int idx){\\n for(int i = 0 ; i < 5 ; i++){\\n\\tif(W[idx][i] == H[i][idx]){\\n\\t return false;\\n\\t}\\n }\\n return true;\\n}\\n \\nint solve(int idx,int S){\\n if(S == (1<<10)-1){\\n\\treturn 1;\\n }\\n int res = 0;\\n for(int i = 0 ; i < 10 ; i++){\\n\\tif((S >> i) & 1) continue;\\n\\tif(idx < 5){\\n\\t H[idx] = s[i];\\n\\t res += solve(idx+1,S|(1<<i));\\n\\t if(!eq[i]){\\n\\t\\tH[idx] = srev[i];\\n\\t\\tres += solve(idx+1,S|(1<<i));\\n\\t }\\n\\t}else{\\n\\t W[idx-5] = s[i];\\n\\t if(valid(idx-5)){\\n\\t\\tres += solve(idx+1,S|(1<<i));\\n\\t }\\n\\t if(!eq[i]){\\n\\t\\tW[idx-5] = srev[i];\\n\\t\\tif(valid(idx-5)){\\n\\t\\t res += solve(idx+1,S|(1<<i));\\n\\t\\t}\\n\\t }\\n\\t}\\n }\\n return res;\\n}\\n \\nint main(){ \\n while(cin >> s[0], s[0] != \\\"END\\\"){\\n\\tmemset(eq,false,sizeof(eq));\\n\\tstring tmp = s[0];\\n\\treverse(tmp.begin(),tmp.end());\\n\\tsrev[0] = tmp;\\n\\teq[0] = s[0] == srev[0];\\n\\tfor(int i = 0 ; i < 9 ; i++){\\n\\t cin >> s[i+1];\\n\\t tmp = s[i+1];\\n\\t reverse(tmp.begin(),tmp.end());\\n\\t srev[i+1] = tmp;\\n\\t eq[i+1] = s[i+1] == srev[i+1];\\n\\t}\\n\\tcout << solve(0,0)/8 << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1580,\n \"memory_kb\": 3200,\n \"score_of_the_acc\": -0.2786,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1201_1159016\",\n \"code_snippet\": \"#include <string> \\n#include <algorithm> \\n#include <cfloat> \\n#include <climits> \\n#include <cmath> \\n#include <complex> \\n#include <cstdio> \\n#include <cstdlib> \\n#include <cstring> \\n#include <functional> \\n#include <iostream> \\n#include <map> \\n#include <memory> \\n#include <queue> \\n#include <set> \\n#include <sstream> \\n#include <stack> \\n#include <utility> \\n#include <vector> \\n\\n#define EACH(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)\\n#define ALL(x) (x).begin(),(x).end() \\nusing namespace std; \\ntypedef long long ll;\\nconst double eps = 1e-10;\\n\\nbool check(const vector<string> &l, const vector<string> &u, int bit){\\n vector<string> v;\\n for(int i = 0; i < 5; ++i){\\n v.push_back(l[i]);\\n if(bit >> i & 1){\\n reverse(ALL(v[i]));\\n if(v[i] == l[i]) return false;\\n }\\n // cout << v[i] << \\\" \\\";\\n }\\n // cout << endl;\\n\\n vector<int> used(5, -1);\\n for(int j = 0; j < 5; ++j){\\n string s = \\\"\\\";\\n for(int i = 0; i < 5; ++i){\\n if(v[i][j] == '0')\\n s.push_back('1');\\n else\\n s.push_back('0');\\n }\\n string rs = s;\\n reverse(ALL(rs));\\n bool flag = false;\\n for(int i = 0; i < 5; ++i){\\n if(used[i] < 0 && (s == u[i] || rs == u[i])){\\n used[i] = j;\\n flag = true;\\n break;\\n }\\n }\\n if(!flag) return false;\\n }\\n /*\\n for(int i = 0; i < 5; ++i){\\n cout << v[i] << endl;\\n }\\n cout << endl;\\n for(int i = 0; i < 5; ++i){\\n cout << u[i] << \\\" \\\";\\n }\\n cout << endl;\\n for(int i = 0; i < 5; ++i) cout << used[i] << \\\" \\\";\\n cout << endl;\\n */\\n return true;\\n}\\nint main(){\\n for(;;){\\n vector<string> v(10);\\n cin >> v[0];\\n if(v[0] == \\\"END\\\") return 0;\\n for(int i = 1; i < 10; ++i) cin >> v[i];\\n sort(ALL(v));\\n int cnt = 0;\\n for(int s = 0; s < 1 << 10; ++s) if(__builtin_popcount(s) == 5 && s < (~s & 1023)){\\n vector<string> lv, uv;\\n for(int i = 0; i < 10; ++i)\\n if(s >> i & 1)\\n lv.push_back(v[i]);\\n else\\n uv.push_back(v[i]);\\n do{\\n for(int t = 0; t < 1 << 5; ++t){\\n bool res = check(lv, uv, t);\\n if(res){\\n ++cnt;\\n }\\n }\\n }while(next_permutation(ALL(lv)));\\n }\\n cout << cnt / 4 << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2450,\n \"memory_kb\": 1208,\n \"score_of_the_acc\": -0.325,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1201_1129518\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<algorithm>\\nusing namespace std;\\nchar str[11][7];\\nint used[11];\\nint p[6][6];\\nint solve(int a){\\n\\tif(a==10){\\n\\t\\tfor(int i=0;i<5;i++)for(int j=0;j<5;j++)\\n\\t\\t\\tif(!p[i][j])return 0;\\n\\t\\treturn 1;\\n\\t}\\n\\tint ret=0;\\n\\tfor(int i=0;i<10;i++){\\n\\t\\tif(used[i])continue;\\n\\t\\tused[i]=1;\\n\\t\\tbool ok=true;\\n\\t\\tif(a%2){\\n\\t\\t\\tfor(int j=0;j<5;j++){\\n\\t\\t\\t\\tp[a/2][j]+=str[i][j]-'0';\\n\\t\\t\\t\\tif(p[a/2][j]==2)ok=false;\\n\\t\\t\\t}\\n\\t\\t}else{\\n\\t\\t\\tfor(int j=0;j<5;j++){\\n\\t\\t\\t\\tp[j][a/2]+=str[i][j]-'0';\\n\\t\\t\\t\\tif(p[j][a/2]==2)ok=false;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(ok)ret+=solve(a+1);\\n\\t\\tused[i]=0;\\n\\t\\tif(a%2){\\n\\t\\t\\tfor(int j=0;j<5;j++){\\n\\t\\t\\t\\tp[a/2][j]-=str[i][j]-'0';\\n\\t\\t\\t}\\n\\t\\t}else{\\n\\t\\t\\tfor(int j=0;j<5;j++){\\n\\t\\t\\t\\tp[j][a/2]-=str[i][j]-'0';\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor(int i=0;i<10;i++){\\n\\t\\tif(used[i])continue;\\n\\t\\tif(str[i][0]==str[i][4]&&str[i][1]==str[i][3])continue;\\n\\t\\tused[i]=1;\\n\\t\\tbool ok=true;\\n\\t\\tif(a%2){\\n\\t\\t\\tfor(int j=0;j<5;j++){\\n\\t\\t\\t\\tp[a/2][j]+=str[i][4-j]-'0';\\n\\t\\t\\t\\tif(p[a/2][j]==2)ok=false;\\n\\t\\t\\t}\\n\\t\\t}else{\\n\\t\\t\\tfor(int j=0;j<5;j++){\\n\\t\\t\\t\\tp[j][a/2]+=str[i][4-j]-'0';\\n\\t\\t\\t\\tif(p[j][a/2]==2)ok=false;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(ok)ret+=solve(a+1);\\n\\t\\tused[i]=0;\\n\\t\\tif(a%2){\\n\\t\\t\\tfor(int j=0;j<5;j++){\\n\\t\\t\\t\\tp[a/2][j]-=str[i][4-j]-'0';\\n\\t\\t\\t}\\n\\t\\t}else{\\n\\t\\t\\tfor(int j=0;j<5;j++){\\n\\t\\t\\t\\tp[j][a/2]-=str[i][4-j]-'0';\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\nint main(){\\n\\twhile(1){\\n\\t\\tfor(int i=0;i<5;i++)for(int j=0;j<5;j++)p[i][j]=0;\\n\\t\\tscanf(\\\"%s\\\",str[0]);\\n\\t\\tfor(int i=0;i<10;i++)used[i]=0;\\n\\t\\tif(str[0][0]=='E')break;\\n\\t\\tfor(int i=1;i<10;i++)scanf(\\\"%s\\\",str[i]);\\n\\t\\tint ret=solve(0);\\n\\t\\tprintf(\\\"%d\\\\n\\\",ret/8);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 410,\n \"memory_kb\": 964,\n \"score_of_the_acc\": -0.0519,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1201_1122346\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <vector>\\n#include <algorithm>\\n#include <cstring>\\nusing namespace std;\\n\\nint lat[5][5];\\n\\nvector<vector<int>> bx = {\\n {0, 1, 2, 3, 4},\\n {0, 1, 2, 3, 4},\\n {0, 1, 2, 3, 4},\\n {0, 1, 2, 3, 4},\\n {0, 1, 2, 3, 4},\\n {0, 0, 0, 0, 0},\\n {1, 1, 1, 1, 1},\\n {2, 2, 2, 2, 2},\\n {3, 3, 3, 3, 3},\\n {4, 4, 4, 4, 4}\\n};\\n\\nvector<vector<int>> by = {\\n {0, 0, 0, 0, 0},\\n {1, 1, 1, 1, 1},\\n {2, 2, 2, 2, 2},\\n {3, 3, 3, 3, 3},\\n {4, 4, 4, 4, 4},\\n {0, 1, 2, 3, 4},\\n {0, 1, 2, 3, 4},\\n {0, 1, 2, 3, 4},\\n {0, 1, 2, 3, 4},\\n {0, 1, 2, 3, 4}\\n};\\n\\nstring rev(string s) {\\n reverse(s.begin(), s.end());\\n return s;\\n}\\n\\nint dfs(vector<string> &v, int k) {\\n if (k == 10) {\\n return 1;\\n }\\n vector<string> S(1, v[k]);\\n if (v[k] != rev(v[k])) {\\n S.push_back(rev(v[k]));\\n }\\n int ret = 0;\\n for (string bloc : S) {\\n for (int i=0; i<10; ++i) {\\n bool ok = true;\\n vector<int> t;\\n for (int j=0; j<5; ++j) {\\n if ((lat[by[i][j]][bx[i][j]] & 1 && bloc[j] - '0' == 0) ||\\n (lat[by[i][j]][bx[i][j]] & 2 && bloc[j] - '0' == 1)) {\\n ok = false;\\n break;\\n }\\n t.push_back(lat[by[i][j]][bx[i][j]]);\\n }\\n if (ok) {\\n for (int j=0; j<5; ++j) {\\n lat[by[i][j]][bx[i][j]] |= (bloc[j] - '0' + 1);\\n }\\n ret += dfs(v, k+1);\\n for (int j=0; j<5; ++j) {\\n lat[by[i][j]][bx[i][j]] = t[j];\\n }\\n }\\n }\\n }\\n return ret;\\n}\\n\\nint main() {\\n vector<string> v(10);\\n while (cin >> v[0], v[0] != \\\"END\\\") {\\n for (int i=1; i<10; ++i) {\\n cin >> v[i];\\n }\\n memset(lat, 0, sizeof lat);\\n int ret = dfs(v, 0);\\n cout << (ret == 0 ? 0 : ret / 8) << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 290,\n \"memory_kb\": 1220,\n \"score_of_the_acc\": -0.0449,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1201_1100714\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nstring s[10],srev[10];\\nstring H[5],W[5];\\nbool eq[10];\\n\\nbool valid(int idx){\\n for(int i = 0 ; i < 5 ; i++){\\n if(W[idx][i] == H[i][idx]){\\n return false;\\n }\\n }\\n return true;\\n}\\n\\nint solve(int idx,int S){\\n if(S == (1<<10)-1){\\n return 1;\\n }\\n int res = 0;\\n for(int i = 0 ; i < 10 ; i++){\\n if((S >> i) & 1) continue;\\n if(idx < 5){\\n H[idx] = s[i];\\n res += solve(idx+1,S|(1<<i));\\n if(!eq[i]){\\n H[idx] = srev[i];\\n res += solve(idx+1,S|(1<<i));\\n }\\n }else{\\n W[idx-5] = s[i];\\n if(valid(idx-5)){\\n res += solve(idx+1,S|(1<<i));\\n }\\n if(!eq[i]){\\n W[idx-5] = srev[i];\\n if(valid(idx-5)){\\n res += solve(idx+1,S|(1<<i));\\n }\\n }\\n }\\n }\\n return res;\\n}\\n\\nint main(){ \\n while(cin >> s[0], s[0] != \\\"END\\\"){\\n memset(eq,false,sizeof(eq));\\n string tmp = s[0];\\n reverse(tmp.begin(),tmp.end());\\n srev[0] = tmp;\\n eq[0] = s[0] == srev[0];\\n for(int i = 0 ; i < 9 ; i++){\\n cin >> s[i+1];\\n tmp = s[i+1];\\n reverse(tmp.begin(),tmp.end());\\n srev[i+1] = tmp;\\n eq[i+1] = s[i+1] == srev[i+1];\\n }\\n cout << solve(0,0)/8 << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2200,\n \"memory_kb\": 1200,\n \"score_of_the_acc\": -0.2923,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1201_1100272\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint ans;\\nbool use[10];\\nstring s[10],t[10];\\n\\nbool check(int n) {\\n bool ck=true;\\n for(int i=0; i<5; i++) {\\n if(t[n][i]==t[i][n-5]) ck=false;\\n }\\n return ck;\\n}\\n\\nvoid dfs(int n) {\\n if(n==10) {\\n ans++;\\n return;\\n }\\n \\n for(int i=0; i<10; i++) {\\n if(!use[i]) {\\n use[i]=true;\\n \\n t[n]=s[i];\\n if(n<5) dfs(n+1);\\n else {\\n\\tif(check(n)) {\\n\\t dfs(n+1);\\n\\t use[i]=false;\\n\\t return;\\n\\t}\\n }\\n\\n reverse(s[i].begin(),s[i].end());\\n t[n]=s[i];\\n reverse(s[i].begin(),s[i].end());\\n \\n if(s[i]==t[n]) {\\n\\tuse[i]=false;\\n\\tcontinue;\\n }\\n \\n if(n<5) dfs(n+1);\\n else {\\n\\tif(check(n)) {\\n\\t dfs(n+1);\\n\\t use[i]=false;\\n\\t return;\\n\\t}\\n }\\n \\n use[i]=false;\\n }\\n }\\n}\\n\\nint main() {\\n while(cin >> s[0]) {\\n if(s[0]==\\\"END\\\") break;\\n for(int i=1; i<10; i++) cin >> s[i];\\n memset(use,false,sizeof(use));\\n ans=0;\\n dfs(0);\\n cout << ans/8 << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2740,\n \"memory_kb\": 1200,\n \"score_of_the_acc\": -0.3624,\n \"final_rank\": 14\n }\n]","isConversational":false}}},{"rowIdx":672,"cells":{"group_id":{"kind":"string","value":"aoj_1214_cpp"},"problem_description":{"kind":"string","value":"Problem G:\nWalking Ant\nAnts are quite diligent. They sometimes build their nests beneath flagstones.\nHere, an ant is walking in a rectangular area tiled with square flagstones, seeking the only hole leading to her nest.\nThe ant takes exactly one second to move from one flagstone to another. That is, if the ant is on the flagstone with coordinates (\nx\n,\ny\n) at time\nt\n, she will be on one of the five flagstones with the following coordinates at time\nt\n+ 1:\n(\nx\n,\ny\n), (\nx\n+ 1,\ny\n), (\nx\n- 1,\ny\n), (\nx\n,\ny\n+ 1), (\nx\n,\ny\n- 1).\nThe ant cannot go out of the rectangular area. The ant can visit the same flagstone more than once.\nInsects are easy to starve. The ant has to go back to her nest without starving. Physical strength of the ant is expressed by the unit \"HP\". Initially, the ant has the strength of 6 HP. Every second, she loses 1 HP. When the ant arrives at a flagstone with some food on it, she eats a small piece of the food there, and recovers her strength to the maximum value, i.e., 6 HP, without taking any time. The food is plenty enough, and she can eat it as many times as she wants.\nWhen the ant's strength gets down to 0 HP, she dies and will not move anymore. If the ant's strength gets down to 0 HP at the moment she moves to a flagstone, she does not effectively reach the flagstone: even if some food is on it, she cannot eat it; even if the hole is on that stone, she has to die at the entrance of her home.\nIf there is a puddle on a flagstone, the ant cannot move there.\nYour job is to write a program which computes the minimum possible time for the ant to reach the hole with positive strength from her start position, if ever possible.\nInput\nThe input consists of multiple maps, each representing the size and the arrangement of the rectangular area. A map is given in the following format.\nw h\nd\n11\nd\n12\nd\n13\n...\nd\n1\nw\nd\n2\nd\n22\nd\n23\n...\nd\n2\nw\n...\nd\nh\n1\nd\nh\n2\nd\nh\n3\n...\nd\nh\nw\nThe integers\nw\nand\nh\nare the numbers of flagstones in the\nx\n- and\ny\n-directions, respectively.\nw\nand\nh\nare less than or equal to 8. The integer\nd\nyx\nrepresents the state of the flagstone with coordinates (\nx\n,\ny\n) as follows.\n0: There is a puddle on the flagstone, and the ant cannot move there.\n1, 2: Nothing exists on the flagstone, and the ant can move there. '2' indicates where the ant initially stands.\n3: The hole to the nest is on the flagstone.\n4: Some food is on the flagstone.\nThere is one and only one flagstone with a hole. Not more than five flagstones have food on them.\nThe end of the input is indicated by a line with two zeros.\nInteger numbers in an input line are separated by at least one space character.\nOutput\nfor each map in the input, your program should output one line containing one integer representing the minimum time. If the ant cannot return to her nest, your program should output -1 instead of the minimum time.\nSample Input\n3 3\n2 1 1\n1 1 0\n1 1 3\n8 4\n2 1 1 0 1 1 1 0\n1 0 4 1 1 0 4 1\n1 0 0 0 0 0 0 1\n1 1 1 4 1 1 1 3\n8 5\n1 2 1 1 1 1 1 4\n1 0 0 0 1 0 0 1\n1 4 1 0 1 \n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1214_5976490","code_snippet":"#include<iostream>\n#include<cstring>\n#include<cstdio>\n#include<sstream>\n#include<algorithm>\n#include<cstdlib>\n#include<queue>\n#include<set>\n#include<map>\n#include<cmath>\n#include<ctime>\n#include<stack>\n#include<functional>\n#define INF 2100000000\n#define MOD 1000000007\n//freopen(\"input.txt\", \"r\", stdin);\n//freopen(\"output.txt\", \"w\", stdout);\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\nint w, h;\nint mp[10][10];\nint hp[10][10];\nint t[10][10];\nint vis[10][10];\nint ans = INF;\nint nxt[4][2] = {\n\t1,0,\n\t0,-1,\n\t-1,0,\n\t0,1\n};\nvoid dfs(int x, int y, int hp, int t)\n{\n\tif (hp == 0) return;\n\tif (mp[x][y] == 3)\n\t{\n\t\tans = min(ans, t);\n\t\treturn;\n\t}\n\tif (mp[x][y] == 4)\n\t{\n\t\thp = 6;\n\t\t//cout << t << endl;\n\t}\n\tfor (int i = 0; i < 4; i++)\n\t{\n\t\tint nx = x + nxt[i][0];\n\t\tint ny = y + nxt[i][1];\n\t\tif (nx > 0 && nx <= h && ny > 0 && ny <= w && mp[nx][ny] != 0 && vis[nx][ny] == 0)\n\t\t{\n\t\t\tif (mp[nx][ny] == 4) vis[nx][ny] = 1;;\n\t\t\tdfs(nx, ny, hp - 1, t + 1);\n\t\t\tif (mp[nx][ny] == 4) vis[nx][ny] = 0;\n\t\t}\n\t}\n}\nint main(void)\n{\n\twhile (scanf(\"%d %d\", &w, &h) == 2)\n\t{\n\t\tif (w == 0) break;\n\t\tint x = 0, y = 0;\n\t\tans = INF;\n\t\tfor (int i = 1; i <= h; i++)\n\t\t{\n\t\t\tfor (int j = 1; j <= w; j++)\n\t\t\t{\n\t\t\t\tscanf(\"%d\", &mp[i][j]);\n\t\t\t\tif (mp[i][j] == 2) x = i, y = j;\n\t\t\t}\n\t\t}\n\t\tdfs(x, y, 6, 0);\n\t\tif (ans == INF) printf(\"-1\\n\");\n\t\telse printf(\"%d\\n\", ans);\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":6020,"memory_kb":3204,"score_of_the_acc":-1.0544,"final_rank":6},{"submission_id":"aoj_1214_2159175","code_snippet":"#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <iostream>\ntypedef long long int ll;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\nstruct Info{\n\tInfo(){\n\t\teat_after = row = col = hp = time = 0;\n\t}\n\n\tvoid set(int arg_row,int arg_col,int arg_hp,int arg_time,int arg_eat_after){\n\t\trow = arg_row;\n\t\tcol = arg_col;\n\t\thp = arg_hp;\n\t\ttime = arg_time;\n\t\teat_after = arg_eat_after;\n\t}\n\n\tint row,col,hp,time,eat_after;\n\tshort check[8][8];\n};\n\nstruct Data{\n\tint row,col;\n};\n\nint W,H,div_row[4] = {-1,0,0,1},div_col[5] = {0,-1,1,0};\nbool isCrearable;\n\nData data[7];\nint data_index,distMap[8][8],map[8][8];\nint start_row,start_col,goal_row,goal_col;\n\n\nbool rangeCheck(int row,int col){\n\tif(row >= 0 && row <= H-1 && col >= 0 && col <= W-1)return true;\n\telse{\n\t\treturn false;\n\t}\n}\n\nvoid dist5(int row,int col){\n\tint next_row,next_col;\n\tfor(int i = 0; i < 4; i++){\n\t\tnext_row = row+div_row[i],next_col = col+div_col[i];\n\t\tif(rangeCheck(next_row,next_col) == true && map[next_row][next_col] != 0 && distMap[next_row][next_col] > distMap[row][col]+1 && distMap[row][col] <= 4){\n\t\t\tdistMap[next_row][next_col] = min(distMap[next_row][next_col],distMap[row][col]+1);\n\t\t\tif(map[next_row][next_col] == 4){\n\t\t\t\tdistMap[next_row][next_col] = 0;\n\t\t\t\tdist5(next_row,next_col);\n\t\t\t}else if(next_row == start_row && next_col == start_col){\n\t\t\t\tisCrearable = true;\n\t\t\t\treturn;\n\t\t\t}else{\n\t\t\t\tdist5(next_row,next_col);\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid func(){\n\n\tfor(int i = 0; i < H; i++){\n\t\tfor(int k = 0; k < W; k++){\n\t\t\tscanf(\"%d\",&map[i][k]);\n\t\t\tif(map[i][k] == 2){\n\t\t\t\tstart_row = i;\n\t\t\t\tstart_col = k;\n\t\t\t\tmap[i][k] = 1;\n\t\t\t}else if(map[i][k] == 3){\n\t\t\t\tgoal_row = i;\n\t\t\t\tgoal_col = k;\n\t\t\t}\n\t\t}\n\t}\n\n\tisCrearable = false;\n\tfor(int i = 0; i < H; i++){\n\t\tfor(int k = 0; k < W; k++)distMap[i][k] = BIG_NUM;\n\t}\n\n\tdistMap[goal_row][goal_col] = 0;\n\tdata_index = 0;\n\n\tdist5(goal_row,goal_col);\n\n\tif(isCrearable == false){\n\t\tprintf(\"-1\\n\");\n\t\treturn;\n\t}\n\n\tint ans = -1,limit = 36;\n\tqueue<Info> Q;\n\tInfo current;\n\n\tInfo first;\n\n\tfor(int i = 0; i < H; i++){\n\t\tfor(int k = 0; k < W; k++)first.check[i][k] = 0;\n\t}\n\n\tfirst.check[start_row][start_col] = 1;\n\tfirst.set(start_row,start_col,6,0,3);\n\n\tQ.push(first);\n\n\twhile(!Q.empty()){\n\t\tcurrent = Q.front();\n\t\tQ.pop();\n\n\t\tif(current.hp == 0)continue;\n\n\t\tif(map[current.row][current.col] == 3){\n\t\t\tans = current.time;\n\t\t\tbreak;\n\t\t}else if(map[current.row][current.col] == 4){\n\t\t\tcurrent.hp = 6;\n\t\t\tcurrent.eat_after = 0;\n\t\t}\n\n\t\tif(current.time + abs(current.row-goal_row)+abs(current.col-goal_col) > limit)continue;\n\n\t\tfor(int i = 0; i < 4; i++){\n\t\t\tif(rangeCheck(current.row+div_row[i],current.col+div_col[i]) == true && map[current.row+div_row[i]][current.col+div_col[i]] != 0 &&\n\t\t\t\t\t((current.check[current.row+div_row[i]][current.col+div_col[i]] == 0) || (current.check[current.row+div_row[i]][current.col+div_col[i]] == 1 &&\tcurrent.eat_after <= 1))){\n\t\t\t\tInfo new_info;\n\t\t\t\tfor(int a = 0; a < H; a++){\n\t\t\t\t\tfor(int b = 0; b < W; b++){\n\t\t\t\t\t\tnew_info.check[a][b] = current.check[a][b];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tnew_info.check[current.row+div_row[i]][current.col+div_col[i]]++;\n\t\t\t\tnew_info.set(current.row+div_row[i],current.col+div_col[i],current.hp-1,current.time+1,current.eat_after+1);\n\t\t\t\tQ.push(new_info);\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"%d\\n\",ans);\n}\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%d %d\",&W,&H);\n\t\tif(W == 0 && H == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":40,"memory_kb":24036,"score_of_the_acc":-0.4133,"final_rank":3},{"submission_id":"aoj_1214_2158966","code_snippet":"#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <iostream>\ntypedef long long int ll;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\nint W,H,div_row[4] = {-1,0,0,1},div_col[5] = {0,-1,1,0};\n\nstruct Info{\n\tInfo(){\n\t\teat_after = row = col = hp = time = 0;\n\t}\n\n\tvoid set(int arg_row,int arg_col,int arg_hp,int arg_time,int arg_eat_after){\n\t\trow = arg_row;\n\t\tcol = arg_col;\n\t\thp = arg_hp;\n\t\ttime = arg_time;\n\t\teat_after = arg_eat_after;\n\t}\n\n\tint row,col,hp,time,eat_after;\n\tshort check[8][8];\n};\n\nbool rangeCheck(int row,int col){\n\tif(row >= 0 && row <= H-1 && col >= 0 && col <= W-1)return true;\n\telse{\n\t\treturn false;\n\t}\n}\n\nvoid func(){\n\n\tint map[H][W];\n\tint start_row,start_col,goal_row,goal_col;\n\n\tfor(int i = 0; i < H; i++){\n\t\tfor(int k = 0; k < W; k++){\n\t\t\tscanf(\"%d\",&map[i][k]);\n\t\t\tif(map[i][k] == 2){\n\t\t\t\tstart_row = i;\n\t\t\t\tstart_col = k;\n\t\t\t\tmap[i][k] = 1;\n\t\t\t}else if(map[i][k] == 3){\n\t\t\t\tgoal_row = i;\n\t\t\t\tgoal_col = k;\n\t\t\t}\n\t\t}\n\t}\n\n\tint ans = -1,limit = 2*H*W;\n\tqueue<Info> Q;\n\tInfo current;\n\n\tInfo first;\n\n\tfor(int i = 0; i < H; i++){\n\t\tfor(int k = 0; k < W; k++)first.check[i][k] = 0;\n\t}\n\n\tfirst.check[start_row][start_col] = 1;\n\tfirst.set(start_row,start_col,6,0,3);\n\n\tQ.push(first);\n\n\tint debug = 0;\n\twhile(!Q.empty()){\n\t\tcurrent = Q.front();\n\t\tQ.pop();\n\n\t\tdebug++;\n\t\tif(debug > 240000){ //I'm very sorry,I'm tired. I will submit an appropriate code someday.\n\t\t\tbreak;\n\t\t}\n\n\t\tif(current.hp == 0)continue;\n\n\t\tif(map[current.row][current.col] == 3){\n\t\t\tans = current.time;\n\t\t\tbreak;\n\t\t}else if(map[current.row][current.col] == 4){\n\t\t\tcurrent.hp = 6;\n\t\t\tcurrent.eat_after = 0;\n\t\t}\n\n\t\tif(current.time + abs(current.row-goal_row)+abs(current.col-goal_col) > limit)continue;\n\n\t\tfor(int i = 0; i < 4; i++){\n\t\t\tif(rangeCheck(current.row+div_row[i],current.col+div_col[i]) == true && map[current.row+div_row[i]][current.col+div_col[i]] != 0 &&\n\t\t\t\t\t((current.check[current.row+div_row[i]][current.col+div_col[i]] == 0) || (current.check[current.row+div_row[i]][current.col+div_col[i]] == 1 &&\tcurrent.eat_after <= 1))){\n\t\t\t\tInfo new_info;\n\t\t\t\tfor(int a = 0; a < H; a++){\n\t\t\t\t\tfor(int b = 0; b < W; b++){\n\t\t\t\t\t\tnew_info.check[a][b] = current.check[a][b];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tnew_info.check[current.row+div_row[i]][current.col+div_col[i]]++;\n\t\t\t\tnew_info.set(current.row+div_row[i],current.col+div_col[i],current.hp-1,current.time+1,current.eat_after+1);\n\t\t\t\tQ.push(new_info);\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"%d\\n\",ans);\n}\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%d %d\",&W,&H);\n\t\tif(W == 0 && H == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":230,"memory_kb":56652,"score_of_the_acc":-0.999,"final_rank":4},{"submission_id":"aoj_1214_2158927","code_snippet":"#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <iostream>\ntypedef long long int ll;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\nint W,H,div_row[4] = {-1,0,0,1},div_col[5] = {0,-1,1,0};\n\nstruct Info{\n\tInfo(){\n\t\teat_after = row = col = hp = time = 0;\n\t}\n\n\tvoid set(int arg_row,int arg_col,int arg_hp,int arg_time,int arg_eat_after){\n\t\trow = arg_row;\n\t\tcol = arg_col;\n\t\thp = arg_hp;\n\t\ttime = arg_time;\n\t\teat_after = arg_eat_after;\n\t}\n\n\tint row,col,hp,time,eat_after;\n\tshort check[8][8];\n};\n\nbool rangeCheck(int row,int col){\n\tif(row >= 0 && row <= H-1 && col >= 0 && col <= W-1)return true;\n\telse{\n\t\treturn false;\n\t}\n}\n\nvoid func(){\n\n\tint map[H][W];\n\tint start_row,start_col,goal_row,goal_col;\n\n\tfor(int i = 0; i < H; i++){\n\t\tfor(int k = 0; k < W; k++){\n\t\t\tscanf(\"%d\",&map[i][k]);\n\t\t\tif(map[i][k] == 2){\n\t\t\t\tstart_row = i;\n\t\t\t\tstart_col = k;\n\t\t\t\tmap[i][k] = 1;\n\t\t\t}else if(map[i][k] == 3){\n\t\t\t\tgoal_row = i;\n\t\t\t\tgoal_col = k;\n\t\t\t}\n\t\t}\n\t}\n\n\tint ans = -1,limit = 2*H*W;\n\tqueue<Info> Q;\n\tInfo current;\n\n\tInfo first;\n\n\tfor(int i = 0; i < H; i++){\n\t\tfor(int k = 0; k < W; k++)first.check[i][k] = 0;\n\t}\n\n\tfirst.check[start_row][start_col] = 1;\n\tfirst.set(start_row,start_col,6,0,3);\n\n\tQ.push(first);\n\n\tint debug = 0;\n\twhile(!Q.empty()){\n\t\tcurrent = Q.front();\n\t\tQ.pop();\n\n\t\tdebug++;\n\t\tif(debug > 250000){\n\t\t\tbreak;\n\t\t}\n\n\t\tif(current.hp == 0)continue;\n\n\t\tif(map[current.row][current.col] == 3){\n\t\t\tans = current.time;\n\t\t\tbreak;\n\t\t}else if(map[current.row][current.col] == 4){\n\t\t\tcurrent.hp = 6;\n\t\t\tcurrent.eat_after = 0;\n\t\t}\n\n\t\tif(current.time + abs(current.row-goal_row)+abs(current.col-goal_col) > limit)continue;\n\n\t\tfor(int i = 0; i < 4; i++){\n\t\t\tif(rangeCheck(current.row+div_row[i],current.col+div_col[i]) == true && map[current.row+div_row[i]][current.col+div_col[i]] != 0 &&\n\t\t\t\t\t((current.check[current.row+div_row[i]][current.col+div_col[i]] == 0) || (current.check[current.row+div_row[i]][current.col+div_col[i]] == 1 &&\tcurrent.eat_after <= 1))){\n\t\t\t\tInfo new_info;\n\t\t\t\tfor(int a = 0; a < H; a++){\n\t\t\t\t\tfor(int b = 0; b < W; b++){\n\t\t\t\t\t\tnew_info.check[a][b] = current.check[a][b];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tnew_info.check[current.row+div_row[i]][current.col+div_col[i]]++;\n\t\t\t\tnew_info.set(current.row+div_row[i],current.col+div_col[i],current.hp-1,current.time+1,current.eat_after+1);\n\t\t\t\tQ.push(new_info);\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"%d\\n\",ans);\n}\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%d %d\",&W,&H);\n\t\tif(W == 0 && H == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":250,"memory_kb":58864,"score_of_the_acc":-1.0399,"final_rank":5},{"submission_id":"aoj_1214_498499","code_snippet":"#include<iostream>\n#include<queue>\n#include<map>\n#include<set>\n\nusing namespace std;\n\nconst int H = 16;\nconst int W = 16;\n\nint M[H][W];\n\nstruct state{\n int i,j;\n int food;\n int hp;\n int cost;\n state(int i, int j, int food, int hp, int cost):i(i),j(j),food(food),hp(hp),cost(cost){}\n bool operator<(const state &t)const{\n if(i!=t.i)return i<t.i;\n if(j!=t.j)return j<t.j;\n if(food!=t.food)return food<t.food;\n if(hp!=t.hp)return hp<t.hp;\n if(cost!=t.cost)return cost<t.cost;\n return false;\n }\n};\n\n\nconst int di[] = {0,-1,0,1,0};\nconst int dj[] = {0,0,1,0,-1};\nconst int inf = 1<<22;\n\nbool inside(int i, int j, int h, int w){\n return 0<=i&&i<h&&0<=j&&j<w;\n}\n\nint solve(int h, int w){\n int si, sj, gi, gj;\n int fid = 0;\n int ret = inf;\n set<state> vis;\n map<pair<int,int>,int> food_conv;\n map<int,pair<int,int> > food_rev;\n \n for(int i = 0; i < h; ++i){\n for(int j = 0; j < w; ++j){\n if( M[i][j] == 2 ){\n si = i;\n sj = j;\n }else if( M[i][j] == 3 ){\n gi = i;\n gj = j;\n }else if( M[i][j] == 4 ){\n food_conv[make_pair(i,j)] = fid;\n food_rev[fid] = make_pair(i,j);\n ++fid;\n }\n }\n }\n state init(si,sj,0,6,0);\n\n queue<state> q;\n for(q.push(init); !q.empty(); q.pop()){\n state cur = q.front();\n\n // if( cur.hp == 0 ) continue;\n\n if( cur.i == gi && cur.j == gj ){\n ret = min(ret, cur.cost );\n }\n\n if( vis.find(cur) == vis.end() ) vis.insert(cur);\n else continue;\n\n for(int k = 0; k < 5; ++k){\n int ni = cur.i + di[k];\n int nj = cur.j + dj[k];\n \n if( inside(ni,nj,h,w) && M[ni][nj] != 0 ){\n int nhp = cur.hp - 1;\n int nfood = cur.food;\n\n if( nhp > 0 ){\n\n if( M[ni][nj] == 4 ){\n int fid = food_conv[make_pair(ni,nj)];\n if( !(cur.food & (1<<fid)) ){\n nhp = 6;\n nfood |= 1<<fid;\n }\n }\n int ncost = cur.cost + 1;\n q.push(state(ni,nj,nfood,nhp,ncost));\n }\n }\n }\n }\n\n \n return ret==inf?-1:ret;\n}\n\nint main()\n{\n int w,h;\n while( cin >> w >> h ){\n if( w == 0 && h == 0 ) break;\n \n for(int i = 0; i < h; ++i){\n for(int j = 0; j < w; ++j){\n cin >> M[i][j];\n }\n }\n \n cout << solve(h,w) << endl;\n } \n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3628,"score_of_the_acc":-0.0666,"final_rank":2},{"submission_id":"aoj_1214_124857","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<stack>\n#include<map>\n#include<set>\n#include<queue>\n#include<deque>\n#include<cstdio>\n#include<climits>\n#include<cmath>\n#include<cstring>\n#include<string>\n#include<sstream>\n#include<numeric>\n#include<cassert>\n\n#define f first\n#define s second\n#define mp make_pair\n\n#define REP(i,n) for(int i=0; i<(int)(n); i++)\n#define rep(i,s,n) for(int i=(s); i<(int)(n); i++)\n#define FOR(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); i++)\n#define ALL(c) (c).begin(), (c).end()\n#define IN(x,s,g) ((x) >= (s) && (x) < (g))\n#define ISIN(x,y,w,h) (IN((x),0,(w)) && IN((y),0,(h)))\n#define print(x) printf(\"%d\\n\",x)\n\nusing namespace std;\n\ntypedef unsigned int uint;\ntypedef long long ll;\n\nconst int _dx[] = {0,1,0,-1};\nconst int _dy[] = {-1,0,1,0};\n\nint getInt(){\n int ret = 0,c;\n c = getchar();\n while(!isdigit(c)) c = getchar();\n while(isdigit(c)){\n ret *= 10;\n ret += c - '0';\n c = getchar();\n }\n return ret;\n}\n\nint d[8][8][8][8];\nint sx,sy;\nint gx,gy;\nint dist[10][10];\nint n;\n\n#define MAX 10000\n\nint solve(int now, int flag){\n if(now == n-1) return 0;\n int ret = MAX;\n REP(i,n) if((flag & 1<<i) == 0){\n if(dist[now][i] < 6){\n ret = min(ret, dist[now][i] + solve(i, flag | (1<<i)));\n }\n }\n return ret;\n}\n\nint main(){\n int w,h;\n while((w = getInt()) + (h = getInt())){\n int b[h][w];\n deque<pair<int,int> > v;\n\n REP(i,h) REP(j,w){\n int t = getInt();\n if(t == 2){\n\tt = 1;\n\tsx = j; sy = i;\n }else if(t == 3){\n\tt = 1;\n\tgx = j; gy = i;\n }else if(t == 4){\n\tt = 1;\n\tv.push_back(mp(j,i));\n }\n b[i][j] = t;\n }\n\n v.push_back(mp(gx,gy));\n v.push_front(mp(sx,sy));\n\n REP(i,h) REP(j,w) REP(k,h) REP(l,w)\n d[i][j][k][l] = MAX;\n\n REP(i,h) REP(j,w) d[i][j][i][j] = 0;\n\n REP(i,h) REP(j,w){\n if(b[i][j] == 0) continue;\n if(i < h-1) if(b[i+1][j] == 1)\n\td[i][j][i+1][j] = d[i+1][j][i][j] = 1;\n if(j < w-1) if(b[i][j+1] == 1)\n\td[i][j][i][j+1] = d[i][j+1][i][j] = 1;\n }\n\n REP(k,w*h) REP(i,w*h) REP(j,w*h)\n d[i/w][i%w][j/w][j%w]\n = min(d[i/w][i%w][j/w][j%w],\n\t d[i/w][i%w][k/w][k%w] + d[k/w][k%w][j/w][j%w]);\n\n //REP(i,h) { REP(j,w) printf(\"%d \",d[sy][sx][i][j]==10000?-1:d[sy][sx][i][j]); puts(\"\"); }\n\n n = v.size();\n\n if(n == 0){\n if(d[sy][sx][gy][gx] == MAX)\n\tprint(-1);\n else\n\tprint(d[sy][sx][gy][gx]);\n continue;\n }\n\n REP(i,n) REP(j,n)\n dist[i][j] = d[v[i].s][v[i].f][v[j].s][v[j].f];\n \n int ans = solve(0,0);\n\n if(ans >= MAX){\n print(-1);\n continue;\n }\n\n print(ans);\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":0,"score_of_the_acc":0,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_1214_5976490\",\n \"code_snippet\": \"#include<iostream>\\n#include<cstring>\\n#include<cstdio>\\n#include<sstream>\\n#include<algorithm>\\n#include<cstdlib>\\n#include<queue>\\n#include<set>\\n#include<map>\\n#include<cmath>\\n#include<ctime>\\n#include<stack>\\n#include<functional>\\n#define INF 2100000000\\n#define MOD 1000000007\\n//freopen(\\\"input.txt\\\", \\\"r\\\", stdin);\\n//freopen(\\\"output.txt\\\", \\\"w\\\", stdout);\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\nint w, h;\\nint mp[10][10];\\nint hp[10][10];\\nint t[10][10];\\nint vis[10][10];\\nint ans = INF;\\nint nxt[4][2] = {\\n\\t1,0,\\n\\t0,-1,\\n\\t-1,0,\\n\\t0,1\\n};\\nvoid dfs(int x, int y, int hp, int t)\\n{\\n\\tif (hp == 0) return;\\n\\tif (mp[x][y] == 3)\\n\\t{\\n\\t\\tans = min(ans, t);\\n\\t\\treturn;\\n\\t}\\n\\tif (mp[x][y] == 4)\\n\\t{\\n\\t\\thp = 6;\\n\\t\\t//cout << t << endl;\\n\\t}\\n\\tfor (int i = 0; i < 4; i++)\\n\\t{\\n\\t\\tint nx = x + nxt[i][0];\\n\\t\\tint ny = y + nxt[i][1];\\n\\t\\tif (nx > 0 && nx <= h && ny > 0 && ny <= w && mp[nx][ny] != 0 && vis[nx][ny] == 0)\\n\\t\\t{\\n\\t\\t\\tif (mp[nx][ny] == 4) vis[nx][ny] = 1;;\\n\\t\\t\\tdfs(nx, ny, hp - 1, t + 1);\\n\\t\\t\\tif (mp[nx][ny] == 4) vis[nx][ny] = 0;\\n\\t\\t}\\n\\t}\\n}\\nint main(void)\\n{\\n\\twhile (scanf(\\\"%d %d\\\", &w, &h) == 2)\\n\\t{\\n\\t\\tif (w == 0) break;\\n\\t\\tint x = 0, y = 0;\\n\\t\\tans = INF;\\n\\t\\tfor (int i = 1; i <= h; i++)\\n\\t\\t{\\n\\t\\t\\tfor (int j = 1; j <= w; j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tscanf(\\\"%d\\\", &mp[i][j]);\\n\\t\\t\\t\\tif (mp[i][j] == 2) x = i, y = j;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tdfs(x, y, 6, 0);\\n\\t\\tif (ans == INF) printf(\\\"-1\\\\n\\\");\\n\\t\\telse printf(\\\"%d\\\\n\\\", ans);\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6020,\n \"memory_kb\": 3204,\n \"score_of_the_acc\": -1.0544,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1214_2159175\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <iostream>\\ntypedef long long int ll;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\nstruct Info{\\n\\tInfo(){\\n\\t\\teat_after = row = col = hp = time = 0;\\n\\t}\\n\\n\\tvoid set(int arg_row,int arg_col,int arg_hp,int arg_time,int arg_eat_after){\\n\\t\\trow = arg_row;\\n\\t\\tcol = arg_col;\\n\\t\\thp = arg_hp;\\n\\t\\ttime = arg_time;\\n\\t\\teat_after = arg_eat_after;\\n\\t}\\n\\n\\tint row,col,hp,time,eat_after;\\n\\tshort check[8][8];\\n};\\n\\nstruct Data{\\n\\tint row,col;\\n};\\n\\nint W,H,div_row[4] = {-1,0,0,1},div_col[5] = {0,-1,1,0};\\nbool isCrearable;\\n\\nData data[7];\\nint data_index,distMap[8][8],map[8][8];\\nint start_row,start_col,goal_row,goal_col;\\n\\n\\nbool rangeCheck(int row,int col){\\n\\tif(row >= 0 && row <= H-1 && col >= 0 && col <= W-1)return true;\\n\\telse{\\n\\t\\treturn false;\\n\\t}\\n}\\n\\nvoid dist5(int row,int col){\\n\\tint next_row,next_col;\\n\\tfor(int i = 0; i < 4; i++){\\n\\t\\tnext_row = row+div_row[i],next_col = col+div_col[i];\\n\\t\\tif(rangeCheck(next_row,next_col) == true && map[next_row][next_col] != 0 && distMap[next_row][next_col] > distMap[row][col]+1 && distMap[row][col] <= 4){\\n\\t\\t\\tdistMap[next_row][next_col] = min(distMap[next_row][next_col],distMap[row][col]+1);\\n\\t\\t\\tif(map[next_row][next_col] == 4){\\n\\t\\t\\t\\tdistMap[next_row][next_col] = 0;\\n\\t\\t\\t\\tdist5(next_row,next_col);\\n\\t\\t\\t}else if(next_row == start_row && next_col == start_col){\\n\\t\\t\\t\\tisCrearable = true;\\n\\t\\t\\t\\treturn;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tdist5(next_row,next_col);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nvoid func(){\\n\\n\\tfor(int i = 0; i < H; i++){\\n\\t\\tfor(int k = 0; k < W; k++){\\n\\t\\t\\tscanf(\\\"%d\\\",&map[i][k]);\\n\\t\\t\\tif(map[i][k] == 2){\\n\\t\\t\\t\\tstart_row = i;\\n\\t\\t\\t\\tstart_col = k;\\n\\t\\t\\t\\tmap[i][k] = 1;\\n\\t\\t\\t}else if(map[i][k] == 3){\\n\\t\\t\\t\\tgoal_row = i;\\n\\t\\t\\t\\tgoal_col = k;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tisCrearable = false;\\n\\tfor(int i = 0; i < H; i++){\\n\\t\\tfor(int k = 0; k < W; k++)distMap[i][k] = BIG_NUM;\\n\\t}\\n\\n\\tdistMap[goal_row][goal_col] = 0;\\n\\tdata_index = 0;\\n\\n\\tdist5(goal_row,goal_col);\\n\\n\\tif(isCrearable == false){\\n\\t\\tprintf(\\\"-1\\\\n\\\");\\n\\t\\treturn;\\n\\t}\\n\\n\\tint ans = -1,limit = 36;\\n\\tqueue<Info> Q;\\n\\tInfo current;\\n\\n\\tInfo first;\\n\\n\\tfor(int i = 0; i < H; i++){\\n\\t\\tfor(int k = 0; k < W; k++)first.check[i][k] = 0;\\n\\t}\\n\\n\\tfirst.check[start_row][start_col] = 1;\\n\\tfirst.set(start_row,start_col,6,0,3);\\n\\n\\tQ.push(first);\\n\\n\\twhile(!Q.empty()){\\n\\t\\tcurrent = Q.front();\\n\\t\\tQ.pop();\\n\\n\\t\\tif(current.hp == 0)continue;\\n\\n\\t\\tif(map[current.row][current.col] == 3){\\n\\t\\t\\tans = current.time;\\n\\t\\t\\tbreak;\\n\\t\\t}else if(map[current.row][current.col] == 4){\\n\\t\\t\\tcurrent.hp = 6;\\n\\t\\t\\tcurrent.eat_after = 0;\\n\\t\\t}\\n\\n\\t\\tif(current.time + abs(current.row-goal_row)+abs(current.col-goal_col) > limit)continue;\\n\\n\\t\\tfor(int i = 0; i < 4; i++){\\n\\t\\t\\tif(rangeCheck(current.row+div_row[i],current.col+div_col[i]) == true && map[current.row+div_row[i]][current.col+div_col[i]] != 0 &&\\n\\t\\t\\t\\t\\t((current.check[current.row+div_row[i]][current.col+div_col[i]] == 0) || (current.check[current.row+div_row[i]][current.col+div_col[i]] == 1 &&\\tcurrent.eat_after <= 1))){\\n\\t\\t\\t\\tInfo new_info;\\n\\t\\t\\t\\tfor(int a = 0; a < H; a++){\\n\\t\\t\\t\\t\\tfor(int b = 0; b < W; b++){\\n\\t\\t\\t\\t\\t\\tnew_info.check[a][b] = current.check[a][b];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tnew_info.check[current.row+div_row[i]][current.col+div_col[i]]++;\\n\\t\\t\\t\\tnew_info.set(current.row+div_row[i],current.col+div_col[i],current.hp-1,current.time+1,current.eat_after+1);\\n\\t\\t\\t\\tQ.push(new_info);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tprintf(\\\"%d\\\\n\\\",ans);\\n}\\n\\nint main(){\\n\\n\\twhile(true){\\n\\t\\tscanf(\\\"%d %d\\\",&W,&H);\\n\\t\\tif(W == 0 && H == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 24036,\n \"score_of_the_acc\": -0.4133,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1214_2158966\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <iostream>\\ntypedef long long int ll;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\nint W,H,div_row[4] = {-1,0,0,1},div_col[5] = {0,-1,1,0};\\n\\nstruct Info{\\n\\tInfo(){\\n\\t\\teat_after = row = col = hp = time = 0;\\n\\t}\\n\\n\\tvoid set(int arg_row,int arg_col,int arg_hp,int arg_time,int arg_eat_after){\\n\\t\\trow = arg_row;\\n\\t\\tcol = arg_col;\\n\\t\\thp = arg_hp;\\n\\t\\ttime = arg_time;\\n\\t\\teat_after = arg_eat_after;\\n\\t}\\n\\n\\tint row,col,hp,time,eat_after;\\n\\tshort check[8][8];\\n};\\n\\nbool rangeCheck(int row,int col){\\n\\tif(row >= 0 && row <= H-1 && col >= 0 && col <= W-1)return true;\\n\\telse{\\n\\t\\treturn false;\\n\\t}\\n}\\n\\nvoid func(){\\n\\n\\tint map[H][W];\\n\\tint start_row,start_col,goal_row,goal_col;\\n\\n\\tfor(int i = 0; i < H; i++){\\n\\t\\tfor(int k = 0; k < W; k++){\\n\\t\\t\\tscanf(\\\"%d\\\",&map[i][k]);\\n\\t\\t\\tif(map[i][k] == 2){\\n\\t\\t\\t\\tstart_row = i;\\n\\t\\t\\t\\tstart_col = k;\\n\\t\\t\\t\\tmap[i][k] = 1;\\n\\t\\t\\t}else if(map[i][k] == 3){\\n\\t\\t\\t\\tgoal_row = i;\\n\\t\\t\\t\\tgoal_col = k;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tint ans = -1,limit = 2*H*W;\\n\\tqueue<Info> Q;\\n\\tInfo current;\\n\\n\\tInfo first;\\n\\n\\tfor(int i = 0; i < H; i++){\\n\\t\\tfor(int k = 0; k < W; k++)first.check[i][k] = 0;\\n\\t}\\n\\n\\tfirst.check[start_row][start_col] = 1;\\n\\tfirst.set(start_row,start_col,6,0,3);\\n\\n\\tQ.push(first);\\n\\n\\tint debug = 0;\\n\\twhile(!Q.empty()){\\n\\t\\tcurrent = Q.front();\\n\\t\\tQ.pop();\\n\\n\\t\\tdebug++;\\n\\t\\tif(debug > 240000){ //I'm very sorry,I'm tired. I will submit an appropriate code someday.\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\n\\t\\tif(current.hp == 0)continue;\\n\\n\\t\\tif(map[current.row][current.col] == 3){\\n\\t\\t\\tans = current.time;\\n\\t\\t\\tbreak;\\n\\t\\t}else if(map[current.row][current.col] == 4){\\n\\t\\t\\tcurrent.hp = 6;\\n\\t\\t\\tcurrent.eat_after = 0;\\n\\t\\t}\\n\\n\\t\\tif(current.time + abs(current.row-goal_row)+abs(current.col-goal_col) > limit)continue;\\n\\n\\t\\tfor(int i = 0; i < 4; i++){\\n\\t\\t\\tif(rangeCheck(current.row+div_row[i],current.col+div_col[i]) == true && map[current.row+div_row[i]][current.col+div_col[i]] != 0 &&\\n\\t\\t\\t\\t\\t((current.check[current.row+div_row[i]][current.col+div_col[i]] == 0) || (current.check[current.row+div_row[i]][current.col+div_col[i]] == 1 &&\\tcurrent.eat_after <= 1))){\\n\\t\\t\\t\\tInfo new_info;\\n\\t\\t\\t\\tfor(int a = 0; a < H; a++){\\n\\t\\t\\t\\t\\tfor(int b = 0; b < W; b++){\\n\\t\\t\\t\\t\\t\\tnew_info.check[a][b] = current.check[a][b];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tnew_info.check[current.row+div_row[i]][current.col+div_col[i]]++;\\n\\t\\t\\t\\tnew_info.set(current.row+div_row[i],current.col+div_col[i],current.hp-1,current.time+1,current.eat_after+1);\\n\\t\\t\\t\\tQ.push(new_info);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tprintf(\\\"%d\\\\n\\\",ans);\\n}\\n\\nint main(){\\n\\n\\twhile(true){\\n\\t\\tscanf(\\\"%d %d\\\",&W,&H);\\n\\t\\tif(W == 0 && H == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 230,\n \"memory_kb\": 56652,\n \"score_of_the_acc\": -0.999,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1214_2158927\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <iostream>\\ntypedef long long int ll;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\nint W,H,div_row[4] = {-1,0,0,1},div_col[5] = {0,-1,1,0};\\n\\nstruct Info{\\n\\tInfo(){\\n\\t\\teat_after = row = col = hp = time = 0;\\n\\t}\\n\\n\\tvoid set(int arg_row,int arg_col,int arg_hp,int arg_time,int arg_eat_after){\\n\\t\\trow = arg_row;\\n\\t\\tcol = arg_col;\\n\\t\\thp = arg_hp;\\n\\t\\ttime = arg_time;\\n\\t\\teat_after = arg_eat_after;\\n\\t}\\n\\n\\tint row,col,hp,time,eat_after;\\n\\tshort check[8][8];\\n};\\n\\nbool rangeCheck(int row,int col){\\n\\tif(row >= 0 && row <= H-1 && col >= 0 && col <= W-1)return true;\\n\\telse{\\n\\t\\treturn false;\\n\\t}\\n}\\n\\nvoid func(){\\n\\n\\tint map[H][W];\\n\\tint start_row,start_col,goal_row,goal_col;\\n\\n\\tfor(int i = 0; i < H; i++){\\n\\t\\tfor(int k = 0; k < W; k++){\\n\\t\\t\\tscanf(\\\"%d\\\",&map[i][k]);\\n\\t\\t\\tif(map[i][k] == 2){\\n\\t\\t\\t\\tstart_row = i;\\n\\t\\t\\t\\tstart_col = k;\\n\\t\\t\\t\\tmap[i][k] = 1;\\n\\t\\t\\t}else if(map[i][k] == 3){\\n\\t\\t\\t\\tgoal_row = i;\\n\\t\\t\\t\\tgoal_col = k;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tint ans = -1,limit = 2*H*W;\\n\\tqueue<Info> Q;\\n\\tInfo current;\\n\\n\\tInfo first;\\n\\n\\tfor(int i = 0; i < H; i++){\\n\\t\\tfor(int k = 0; k < W; k++)first.check[i][k] = 0;\\n\\t}\\n\\n\\tfirst.check[start_row][start_col] = 1;\\n\\tfirst.set(start_row,start_col,6,0,3);\\n\\n\\tQ.push(first);\\n\\n\\tint debug = 0;\\n\\twhile(!Q.empty()){\\n\\t\\tcurrent = Q.front();\\n\\t\\tQ.pop();\\n\\n\\t\\tdebug++;\\n\\t\\tif(debug > 250000){\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\n\\t\\tif(current.hp == 0)continue;\\n\\n\\t\\tif(map[current.row][current.col] == 3){\\n\\t\\t\\tans = current.time;\\n\\t\\t\\tbreak;\\n\\t\\t}else if(map[current.row][current.col] == 4){\\n\\t\\t\\tcurrent.hp = 6;\\n\\t\\t\\tcurrent.eat_after = 0;\\n\\t\\t}\\n\\n\\t\\tif(current.time + abs(current.row-goal_row)+abs(current.col-goal_col) > limit)continue;\\n\\n\\t\\tfor(int i = 0; i < 4; i++){\\n\\t\\t\\tif(rangeCheck(current.row+div_row[i],current.col+div_col[i]) == true && map[current.row+div_row[i]][current.col+div_col[i]] != 0 &&\\n\\t\\t\\t\\t\\t((current.check[current.row+div_row[i]][current.col+div_col[i]] == 0) || (current.check[current.row+div_row[i]][current.col+div_col[i]] == 1 &&\\tcurrent.eat_after <= 1))){\\n\\t\\t\\t\\tInfo new_info;\\n\\t\\t\\t\\tfor(int a = 0; a < H; a++){\\n\\t\\t\\t\\t\\tfor(int b = 0; b < W; b++){\\n\\t\\t\\t\\t\\t\\tnew_info.check[a][b] = current.check[a][b];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tnew_info.check[current.row+div_row[i]][current.col+div_col[i]]++;\\n\\t\\t\\t\\tnew_info.set(current.row+div_row[i],current.col+div_col[i],current.hp-1,current.time+1,current.eat_after+1);\\n\\t\\t\\t\\tQ.push(new_info);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tprintf(\\\"%d\\\\n\\\",ans);\\n}\\n\\nint main(){\\n\\n\\twhile(true){\\n\\t\\tscanf(\\\"%d %d\\\",&W,&H);\\n\\t\\tif(W == 0 && H == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 58864,\n \"score_of_the_acc\": -1.0399,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1214_498499\",\n \"code_snippet\": \"#include<iostream>\\n#include<queue>\\n#include<map>\\n#include<set>\\n\\nusing namespace std;\\n\\nconst int H = 16;\\nconst int W = 16;\\n\\nint M[H][W];\\n\\nstruct state{\\n int i,j;\\n int food;\\n int hp;\\n int cost;\\n state(int i, int j, int food, int hp, int cost):i(i),j(j),food(food),hp(hp),cost(cost){}\\n bool operator<(const state &t)const{\\n if(i!=t.i)return i<t.i;\\n if(j!=t.j)return j<t.j;\\n if(food!=t.food)return food<t.food;\\n if(hp!=t.hp)return hp<t.hp;\\n if(cost!=t.cost)return cost<t.cost;\\n return false;\\n }\\n};\\n\\n\\nconst int di[] = {0,-1,0,1,0};\\nconst int dj[] = {0,0,1,0,-1};\\nconst int inf = 1<<22;\\n\\nbool inside(int i, int j, int h, int w){\\n return 0<=i&&i<h&&0<=j&&j<w;\\n}\\n\\nint solve(int h, int w){\\n int si, sj, gi, gj;\\n int fid = 0;\\n int ret = inf;\\n set<state> vis;\\n map<pair<int,int>,int> food_conv;\\n map<int,pair<int,int> > food_rev;\\n \\n for(int i = 0; i < h; ++i){\\n for(int j = 0; j < w; ++j){\\n if( M[i][j] == 2 ){\\n si = i;\\n sj = j;\\n }else if( M[i][j] == 3 ){\\n gi = i;\\n gj = j;\\n }else if( M[i][j] == 4 ){\\n food_conv[make_pair(i,j)] = fid;\\n food_rev[fid] = make_pair(i,j);\\n ++fid;\\n }\\n }\\n }\\n state init(si,sj,0,6,0);\\n\\n queue<state> q;\\n for(q.push(init); !q.empty(); q.pop()){\\n state cur = q.front();\\n\\n // if( cur.hp == 0 ) continue;\\n\\n if( cur.i == gi && cur.j == gj ){\\n ret = min(ret, cur.cost );\\n }\\n\\n if( vis.find(cur) == vis.end() ) vis.insert(cur);\\n else continue;\\n\\n for(int k = 0; k < 5; ++k){\\n int ni = cur.i + di[k];\\n int nj = cur.j + dj[k];\\n \\n if( inside(ni,nj,h,w) && M[ni][nj] != 0 ){\\n int nhp = cur.hp - 1;\\n int nfood = cur.food;\\n\\n if( nhp > 0 ){\\n\\n if( M[ni][nj] == 4 ){\\n int fid = food_conv[make_pair(ni,nj)];\\n if( !(cur.food & (1<<fid)) ){\\n nhp = 6;\\n nfood |= 1<<fid;\\n }\\n }\\n int ncost = cur.cost + 1;\\n q.push(state(ni,nj,nfood,nhp,ncost));\\n }\\n }\\n }\\n }\\n\\n \\n return ret==inf?-1:ret;\\n}\\n\\nint main()\\n{\\n int w,h;\\n while( cin >> w >> h ){\\n if( w == 0 && h == 0 ) break;\\n \\n for(int i = 0; i < h; ++i){\\n for(int j = 0; j < w; ++j){\\n cin >> M[i][j];\\n }\\n }\\n \\n cout << solve(h,w) << endl;\\n } \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3628,\n \"score_of_the_acc\": -0.0666,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1214_124857\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<vector>\\n#include<stack>\\n#include<map>\\n#include<set>\\n#include<queue>\\n#include<deque>\\n#include<cstdio>\\n#include<climits>\\n#include<cmath>\\n#include<cstring>\\n#include<string>\\n#include<sstream>\\n#include<numeric>\\n#include<cassert>\\n\\n#define f first\\n#define s second\\n#define mp make_pair\\n\\n#define REP(i,n) for(int i=0; i<(int)(n); i++)\\n#define rep(i,s,n) for(int i=(s); i<(int)(n); i++)\\n#define FOR(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); i++)\\n#define ALL(c) (c).begin(), (c).end()\\n#define IN(x,s,g) ((x) >= (s) && (x) < (g))\\n#define ISIN(x,y,w,h) (IN((x),0,(w)) && IN((y),0,(h)))\\n#define print(x) printf(\\\"%d\\\\n\\\",x)\\n\\nusing namespace std;\\n\\ntypedef unsigned int uint;\\ntypedef long long ll;\\n\\nconst int _dx[] = {0,1,0,-1};\\nconst int _dy[] = {-1,0,1,0};\\n\\nint getInt(){\\n int ret = 0,c;\\n c = getchar();\\n while(!isdigit(c)) c = getchar();\\n while(isdigit(c)){\\n ret *= 10;\\n ret += c - '0';\\n c = getchar();\\n }\\n return ret;\\n}\\n\\nint d[8][8][8][8];\\nint sx,sy;\\nint gx,gy;\\nint dist[10][10];\\nint n;\\n\\n#define MAX 10000\\n\\nint solve(int now, int flag){\\n if(now == n-1) return 0;\\n int ret = MAX;\\n REP(i,n) if((flag & 1<<i) == 0){\\n if(dist[now][i] < 6){\\n ret = min(ret, dist[now][i] + solve(i, flag | (1<<i)));\\n }\\n }\\n return ret;\\n}\\n\\nint main(){\\n int w,h;\\n while((w = getInt()) + (h = getInt())){\\n int b[h][w];\\n deque<pair<int,int> > v;\\n\\n REP(i,h) REP(j,w){\\n int t = getInt();\\n if(t == 2){\\n\\tt = 1;\\n\\tsx = j; sy = i;\\n }else if(t == 3){\\n\\tt = 1;\\n\\tgx = j; gy = i;\\n }else if(t == 4){\\n\\tt = 1;\\n\\tv.push_back(mp(j,i));\\n }\\n b[i][j] = t;\\n }\\n\\n v.push_back(mp(gx,gy));\\n v.push_front(mp(sx,sy));\\n\\n REP(i,h) REP(j,w) REP(k,h) REP(l,w)\\n d[i][j][k][l] = MAX;\\n\\n REP(i,h) REP(j,w) d[i][j][i][j] = 0;\\n\\n REP(i,h) REP(j,w){\\n if(b[i][j] == 0) continue;\\n if(i < h-1) if(b[i+1][j] == 1)\\n\\td[i][j][i+1][j] = d[i+1][j][i][j] = 1;\\n if(j < w-1) if(b[i][j+1] == 1)\\n\\td[i][j][i][j+1] = d[i][j+1][i][j] = 1;\\n }\\n\\n REP(k,w*h) REP(i,w*h) REP(j,w*h)\\n d[i/w][i%w][j/w][j%w]\\n = min(d[i/w][i%w][j/w][j%w],\\n\\t d[i/w][i%w][k/w][k%w] + d[k/w][k%w][j/w][j%w]);\\n\\n //REP(i,h) { REP(j,w) printf(\\\"%d \\\",d[sy][sx][i][j]==10000?-1:d[sy][sx][i][j]); puts(\\\"\\\"); }\\n\\n n = v.size();\\n\\n if(n == 0){\\n if(d[sy][sx][gy][gx] == MAX)\\n\\tprint(-1);\\n else\\n\\tprint(d[sy][sx][gy][gx]);\\n continue;\\n }\\n\\n REP(i,n) REP(j,n)\\n dist[i][j] = d[v[i].s][v[i].f][v[j].s][v[j].f];\\n \\n int ans = solve(0,0);\\n\\n if(ans >= MAX){\\n print(-1);\\n continue;\\n }\\n\\n print(ans);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 0,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":673,"cells":{"group_id":{"kind":"string","value":"aoj_1203_cpp"},"problem_description":{"kind":"string","value":"Problem D:\nNapoleon's Grumble\nLegend has it that, after being defeated in Waterloo, Napoleon Bonaparte, in retrospect of his days of glory, talked to himself \"Able was I ere I saw Elba.\" Although, it is quite doubtful that he should have said this in English, this phrase is widely known as a typical\npalindrome\n.\nA palindrome is a symmetric character sequence that looks the same when read backwards, right to left. In the above Napoleon's grumble, white spaces appear at the same positions when read backwards. This is not a required condition for a palindrome. The following, ignoring spaces and punctuation marks, are known as the first conversation and the first palindromes by human beings.\n\"Madam, I'm Adam.\"\n\"Eve.\"\n(by Mark Twain)\nWrite a program that finds palindromes in input lines.\nInput\nA multi-line text is given as the input. The input ends at the end of the file.\nThere are at most 100 lines in the input. Each line has less than 1,024 Roman alphabet characters.\nOutput\nCorresponding to each input line, a line consisting of\nall\nthe character sequences that are palindromes in the input line should be output. However, trivial palindromes consisting of only one or two characters should not be reported.\nOn finding palindromes, any characters in the input except Roman alphabets, such as punctuation characters, digits, space, and tabs, should be ignored. Characters that differ only in their cases should be looked upon as the same character. Whether or not the character sequences represent a proper English word or sentence does not matter.\nPalindromes should be reported all in uppercase characters. When two or more palindromes are reported, they should be separated by a space character. You may report palindromes in any order.\nIf two or more occurrences of the same palindromes are found in the same input line, report only once. When a palindrome overlaps with another, even when one is completely included in the other, both should be reported. However, palindromes appearing in the center of another palindrome, whether or not they also appear elsewhere, should not be reported. For example, for an input line of \"AAAAAA\", two palindromes \"AAAAAA\" and \"AAAAA\" should be output, but not \"AAAA\" nor \"AAA\". For \"AABCAAAAAA\", the output remains the same.\nOne line should be output corresponding to one input line. If an input line does not contain any palindromes, an empty line should be output.\nSample Input\nAs the first man said to the\nfirst woman:\n\"Madam, I'm Adam.\"\nShe responded:\n\"Eve.\"\nOutput for the Sample Input\nTOT\n\nMADAMIMADAM MADAM\nERE DED\nEVE\nNote that the second line in the output is empty, corresponding to the second input line containing no palindromes. Also note that some of the palindromes in the third input line, namely \"ADA\", \"MIM\", \"AMIMA\", \"DAMIMAD\", and \"ADAMIMADA\", are not reported because they appear at the center of reported ones. \"MADAM\"\nis\nreported, as it does not appear in the center, but only once, disregarding its second occurrence."},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1203_1892938","code_snippet":"#include<iostream>\n#include<vector>\n#include<string>\n#include<algorithm>\t\n#include<map>\n#include<set>\n#include<utility>\n#include<cmath>\n#include<cstring>\n#include<queue>\n#include<cstdio>\n#include<sstream>\n#include<iomanip>\n#define loop(i,a,b) for(int i=a;i<b;i++) \n#define rep(i,a) loop(i,0,a)\n#define pb push_back\n#define mp make_pair\n#define all(in) in.begin(),in.end()\n#define shosu(x) fixed<<setprecision(x)\nusing namespace std;\n//kaewasuretyuui\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<pii> vp;\ntypedef vector<vp> vvp;\ntypedef pair<int,pii> pip;\ntypedef vector<pip>vip;\nconst double PI=acos(-1);\nconst double EPS=1e-8;\nconst int inf=1e8;\nint main(){\n\tstring s;\n\twhile(getline(cin,s)){\n\t\tstring t=\"\";\n\t\tset<string>out,no;\n\t\trep(i,s.size())if(isalpha(s[i]))t+=toupper(s[i]);\n\t\trep(i,t.size())loop(j,3,t.size()+1)if(i+j<=t.size()){\n\t\t\tstring a=t.substr(i,j),b=a;\n\t\t\treverse(all(b));\n\t\t\tif(a==b){\n\t\t\t\tout.insert(a);\n\t\t\t\tno.insert(t.substr(i+1,j-2));\n\t\t\t}\n\t\t}\n\t\tvector<string>ans;\n\t\tfor(set<string>::iterator it=out.begin();it!=out.end();it++)\n\t\t\tif(no.find(*it)==no.end())\n\t\t\t\tans.pb(*it);\n\t\treverse(all(ans));\n\t\trep(i,ans.size()){\n\t\t\tif(i)cout<<\" \";\n\t\t\tcout<<ans[i];\n\t\t}\n\t\tcout<<endl;\n\t}\n}","accuracy":1,"time_ms":20,"memory_kb":1260,"score_of_the_acc":-0.226,"final_rank":6},{"submission_id":"aoj_1203_1892936","code_snippet":"#include<iostream>\n#include<vector>\n#include<string>\n#include<algorithm>\t\n#include<map>\n#include<set>\n#include<utility>\n#include<cmath>\n#include<cstring>\n#include<queue>\n#include<cstdio>\n#include<sstream>\n#include<iomanip>\n#define loop(i,a,b) for(int i=a;i<b;i++) \n#define rep(i,a) loop(i,0,a)\n#define pb push_back\n#define mp make_pair\n#define all(in) in.begin(),in.end()\n#define shosu(x) fixed<<setprecision(x)\nusing namespace std;\n//kaewasuretyuui\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<pii> vp;\ntypedef vector<vp> vvp;\ntypedef pair<int,pii> pip;\ntypedef vector<pip>vip;\nconst double PI=acos(-1);\nconst double EPS=1e-8;\nconst int inf=1e8;\nint main(){\n\tstring s;\n\twhile(getline(cin,s)){\n\t\tstring t=\"\";\n\t\tset<string>out,no;\n\t\trep(i,s.size())if(isalpha(s[i]))t+=toupper(s[i]);\n\t\trep(i,t.size())loop(j,3,t.size()+1)if(i+j<=t.size()){\n\t\t\tstring a=t.substr(i,j),b=a;\n\t\t\treverse(all(b));\n\t\t\tif(a==b){\n\t\t\t\tout.insert(a);\n\t\t\t\tno.insert(t.substr(i+1,j-2));\n\t\t\t}\n\t\t}\n\t\tvector<string>ans;\n\t\tfor(set<string>::iterator it=out.begin();it!=out.end();it++)\n\t\t\tif(no.find(*it)==no.end())\n\t\t\t\tans.pb(*it);\n\t\trep(i,ans.size()){\n\t\t\tif(i)cout<<\" \";\n\t\t\tcout<<ans[i];\n\t\t}\n\t\tcout<<endl;\n\t}\n}","accuracy":1,"time_ms":20,"memory_kb":1256,"score_of_the_acc":-0.2257,"final_rank":5},{"submission_id":"aoj_1203_1874995","code_snippet":"#include <bits/stdc++.h>\n \nusing namespace std;\n \nstring s;\ntypedef pair<int,string> P;\n \nbool is_palindrome(const string &str){\n int size = str.size();\n for(int i = 0 ; i < size/2 ; i++){\n\tif(str[i] != str[size-i-1]) return false;\n }\n return true;\n}\n \nbool check(string a,string b){\n int alen = a.size(),blen = b.size();\n if(alen % 2 && blen % 2 == 0) return true;\n if(alen % 2 == 0 && blen % 2) return true;\n if(alen == blen) return true;\n if(alen > blen) swap(a,b),swap(alen,blen);\n int p = 0;\n while(true){\n\tif(p*2+alen == blen) break;\n\tp++;\n }\n for(int i = p ; i < p+alen ; i++){\n\tif(a[i-p] != b[i]) return true;\n }\n return false;\n}\n \nint main(){\n string in;\n while(getline(cin,in)){\n\tint size;\n\tset<P> st;\n\tset<string> ans;\n\ts.clear();\n \n\tfor(int i = 0 ; i < (int)in.size() ; i++){\n\t if(isalpha(in[i])){\n\t\ts += toupper(in[i]);\n\t }\n\t}\n\tsize = s.size();\n\tfor(int i = 0 ; i < size ; i++){\n\t for(int j = size ; j > i ; j--){\n\t\tstring str = s.substr(i,j-i);\n\t\tif(is_palindrome(str) && j-i >= 3){\n\t\t st.insert(P(str.size(),str));\n\t\t}\n\t }\n\t}\n\tbool ok[1145] = {false};\n\tint ii,jj;\n\tset<P>::iterator i,j;\n\tfor(ii = 0,i = st.begin() ; i != st.end() ; ++i,++ii){\n\t for(jj = 0,j = st.begin() ; j != st.end() ; ++j,++jj){\n\t\tif(i == j) continue;\n\t\tif(!check(i->second,j->second)){\n\t\t if(i->first > j->first){\n\t\t\tok[jj] = true;\n\t\t }else{\n\t\t\tok[ii] = true;\n\t\t }\n\t\t}\n\t }\n\t}\n\tfor(ii = 0,i = st.begin() ; i != st.end() ; ++i,++ii){\n\t if(ok[ii]) continue;\n\t ans.insert(i->second);\n\t}\n\tbool flg = false;\n\tset<string>::iterator k;\n\tfor(k = ans.begin() ; k != ans.end() ; ++k){\n\t if(flg) cout << \" \";\n\t flg = true;\n\t cout << *k;\n\t}\n\tcout << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3212,"score_of_the_acc":-0.2575,"final_rank":7},{"submission_id":"aoj_1203_1759572","code_snippet":"#include <iostream>\n#include <vector>\n#include <string>\n#include <set>\n#include <queue>\n\nusing namespace std;\n\nbool isPalindrome(string s)\n{\n\tint n = s.size();\n\tfor (int i = 0; i < n / 2; ++i)\n\t{\n\t\tif (s[i] != s[n - i - 1])\n\t\t{\n\t\t\treturn(false);\n\t\t}\n\t}\n\treturn(true);\n}\n\nvoid solve()\n{\n\tstring temp;\n\twhile (getline(cin, temp))\n\t{\n\t\tstring str;\n\t\tfor (int i = 0; i < temp.size(); ++i)\n\t\t{\n\t\t\tif ('a' <= temp[i] && temp[i] <= 'z')\n\t\t\t{\n\t\t\t\tstr += temp[i] - 'a' + 'A';\n\t\t\t}\n\t\t\tif ('A' <= temp[i] && temp[i] <= 'Z')\n\t\t\t{\n\t\t\t\tstr += temp[i];\n\t\t\t}\n\t\t}\n\t\tint n = str.size();\n\t\tvector<string> palindrome;\n\t\tset<string> bad;\n\t\tdeque< deque<bool> > flag(n, deque<bool>(n));\n\t\tfor (int i = n; i >= 3; --i)\n\t\t{\n\t\t\tfor (int j = 0; j <= n - i; ++j)\n\t\t\t{\n\t\t\t\tif (flag[j][j + i - 1])\n\t\t\t\t{\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tstring sub;\n\t\t\t\tfor (int k = j; k < j + i; ++k)\n\t\t\t\t{\n\t\t\t\t\tsub += str[k];\n\t\t\t\t}\n\t\t\t\tif (isPalindrome(sub) && bad.find(sub) == bad.end())\n\t\t\t\t{\n\t\t\t\t\tpalindrome.push_back(sub);\n\t\t\t\t\tfor (int k = 0; k < i / 2; ++k)\n\t\t\t\t\t{\n\t\t\t\t\t\tflag[j + k][j + i - k - 1] = true;\n\t\t\t\t\t\tstring tmp;\n\t\t\t\t\t\tfor (int l = k; l < i - k; ++l)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\ttmp += sub[l];\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbad.insert(tmp);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tbool isFirst = true;\n\t\tfor (int i = 0; i < palindrome.size(); ++i)\n\t\t{\n\t\t\tif (!isFirst)\n\t\t\t{\n\t\t\t\tcout << \" \";\n\t\t\t}\n\t\t\tcout << palindrome[i];\n\t\t\tisFirst = false;\n\t\t}\n\t\tcout << endl;\n\t}\n}\n\nint main()\n{\n\tsolve();\n\treturn(0);\n}","accuracy":1,"time_ms":50,"memory_kb":1324,"score_of_the_acc":-0.6061,"final_rank":14},{"submission_id":"aoj_1203_1138954","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nstring buf;\n\nbool check( string &s){\n int st = 0, ed = s.size()-1;\n while( st<ed && s[st] == s[ed] ){ st++; ed--;}\n return st >= ed;\n}\n\nint main(){\n while( getline(cin,buf) ){\n string s;\n for(int i=0;i<(int)buf.size();i++){\n if( 'a' <= buf[i] && buf[i] <= 'z' ) s += (buf[i]+'A'-'a');\n else if( 'A' <= buf[i] && buf[i] <= 'Z' ) s+= buf[i];\n }\n\n vector<string> ans;\n for(int i=1;i<(int)s.size();i++){\n int range = min( i, (int)s.size() - i - 1 );\n for(int j=range;j>0;j--){\n\tstring r = s.substr(i-j,2*j+1);\n\t//\tcout << r << endl;\n\tif( check(r) ) {\n\t ans.push_back(r);\n\t break;\n\t}\n }\n }\n\n for(int i=0;i<(int)s.size();i++){\n int range = s.size()-i;\n if( range & 1 ) range--;\n for(int j=0;range-j*2>2;j++){\n\tstring r = s.substr(i+j,range-2*j);\n\t//\tcout << r << endl;\n\tif( check(r) ) {\n\t ans.push_back(r);\n\t break;\n\t}\n }\n }\n sort(ans.begin(),ans.end());\n ans.erase(unique(ans.begin(),ans.end()),ans.end());\n \n\n set<string> M;\n for(int i=0;i<(int)ans.size();i++){\n //cout << ans[i] << endl;\n //cout << M.count( ans[i] ) << endl;\n if( M.count(ans[i]) != 0 ) continue;\n int range = ans[i].size();\n // cout << range << endl;\n for(int j=1;range-2*j>2;j++){\n\t//\tcout << ans[i].substr(j,range-2*j) << endl;\n\tM.insert(ans[i].substr(j,range-2*j));\n }\n }\n vector<string> res;\n for(int i=0;i<(int)ans.size();i++){\n //cout << M.count(ans[i]) << endl;\n //cout << ans[i] << endl;\n if( M.count(ans[i]) == 0 )\n\tres.push_back(ans[i]);\n }\n\n\n for(int i=0;i<(int)res.size();i++){\n if( i ) cout << \" \";\n cout << res[i];\n }\n cout << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":1224,"score_of_the_acc":-0.0981,"final_rank":3},{"submission_id":"aoj_1203_1138202","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nstring s;\ntypedef pair<int,string> P;\n\nbool is_palindrome(const string &str){\n int size = str.size();\n for(int i = 0 ; i < size/2 ; i++){\n if(str[i] != str[size-i-1]) return false;\n }\n return true;\n}\n\nbool check(string a,string b){\n int alen = a.size(),blen = b.size();\n if(alen % 2 && blen % 2 == 0) return true;\n if(alen % 2 == 0 && blen % 2) return true;\n if(alen == blen) return true;\n if(alen > blen) swap(a,b),swap(alen,blen);\n int p = 0;\n while(true){\n if(p*2+alen == blen) break;\n p++;\n }\n for(int i = p ; i < p+alen ; i++){\n if(a[i-p] != b[i]) return true;\n }\n return false;\n}\n\nint main(){\n string in;\n while(getline(cin,in)){\n int size;\n set<P> st;\n set<string> ans;\n s.clear();\n \n for(int i = 0 ; i < (int)in.size() ; i++){\n if(isalpha(in[i])){\n s += toupper(in[i]);\n }\n }\n size = s.size();\n for(int i = 0 ; i < size ; i++){\n for(int j = size ; j > i ; j--){\n string str = s.substr(i,j-i);\n if(is_palindrome(str) && j-i >= 3){\n st.insert(P(str.size(),str));\n }\n }\n }\n bool ok[1145] = {false};\n int ii,jj;\n set<P>::iterator i,j;\n for(ii = 0,i = st.begin() ; i != st.end() ; ++i,++ii){\n for(jj = 0,j = st.begin() ; j != st.end() ; ++j,++jj){\n if(i == j) continue;\n if(!check(i->second,j->second)){\n if(i->first > j->first){\n ok[jj] = true;\n }else{\n ok[ii] = true;\n }\n }\n }\n }\n for(ii = 0,i = st.begin() ; i != st.end() ; ++i,++ii){\n if(ok[ii]) continue;\n ans.insert(i->second);\n }\n bool flg = false;\n set<string>::iterator k;\n for(k = ans.begin() ; k != ans.end() ; ++k){\n if(flg) cout << \" \";\n flg = true;\n cout << *k;\n }\n cout << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1228,"score_of_the_acc":-0.2234,"final_rank":4},{"submission_id":"aoj_1203_1138138","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define REP(i,a,b) for(int i=a;i<(int)b;i++)\n#define rep(i,n) REP(i,0,n)\n\nint memo[1200][1200];\n\nint center[1200];\nint center2[1200][1200];\n\ntypedef pair<int, int> Pii;\nmap<int, Pii> mp1;\nmap<Pii, Pii> mp2;\n\nint N;\nstring line;\n\nbool is_palindrome(int L, int R) {\n if(L >= R) return 1;\n\n if(memo[L][R] != -1) {\n return memo[L][R];\n }\n \n int SIZE = R-L;\n \n if(line[L] == line[R-1]) {\n memo[L][R] = is_palindrome(L+1, R-1);\n\n if(memo[L][R] == 1) {\n if(R-L > 2) {\n\tif(SIZE % 2 == 0) {\n\t int l = (L+R)/2, r = (L+R)/2+1;\n\t if(center2[l][r] < R-L) {\n\t mp2[Pii(l, r)] = Pii(L, R);\n\t center2[l][r] = R-L;\n\t }\n\t}\n\telse {\n\t int m = (L+R)/2;\n\t if(center[m] < R-L) {\n\t mp1[m] = Pii(L, R);\n\t center[m] = R-L;\n\t }\n\t}\n }\n return 1;\n }\n else if(memo[L][R] == 0) return 0;\n else assert(false);\n }\n memo[L][R] = 0; return 0;\n}\n\nvoid kirei() {\n string ret;\n int const N = line.size();\n rep(i, N) {\n if(isalpha(line[i])) { ret += toupper(line[i]); }\n }\n line = ret;\n}\n\nbool cmp(string const& a, string const& b) {\n return a.size() < b.size();\n}\n\nvector<string> contains_remove(vector<string>& vec) {\n \n vector<bool> retbool(vec.size());\n vector<string> ret;\n sort(vec.begin(), vec.end(), cmp);\n \n rep(i, vec.size()) {\n int ISize = vec[i].size();\n REP(j, i+1, vec.size()) {\n int JSize = vec[j].size();\n if(ISize % 2 != JSize % 2) continue;\n if(ISize % 2 == 0) {\n\tif(vec[i] == string(vec[j].begin()+(JSize/2-ISize/2), vec[j].begin()+(JSize/2+ISize/2))) {\n\t retbool[i] = 1;\n\t}\n }\n else {\n\tif(vec[i] == string(vec[j].begin()+(JSize/2-ISize/2), vec[j].begin()+(JSize/2+ISize/2+1))) {\n\t retbool[i] = 1;\n\t}\n }\n }\n }\n \n for(int i=0; i<(int)vec.size(); i++) {\n if(!retbool[i]) {\n ret.push_back(vec[i]);\n }\n }\n \n return ret;\n}\n\n\nint main() {\n \n while(getline(cin, line)) {\n rep(i, 1200) {\n rep(j, 1200) {\n\tmemo[i][j] = -1;\n\tcenter2[i][j] = -1;\n }\n center[i] = -1;\n }\n mp1.clear(), mp2.clear();\n \n kirei();\n N = line.size();\n \n rep(i, N) REP(j, i+1, N+1) {\n memo[i][j] = is_palindrome(i, j);\n }\n \n vector<string> vec;\n {\n map<int, Pii>::iterator it = mp1.begin();\n for(; it!=mp1.end(); it++) {\n\tint L = it->second.first;\n\tint R = it->second.second;\n\tvec.push_back(string(line.begin()+L, line.begin()+R));\n }\n }\n {\n map<Pii, Pii>::iterator it = mp2.begin();\n for(; it!=mp2.end(); it++) {\n\tint L = it->second.first;\n\tint R = it->second.second;\n\tvec.push_back(string(line.begin()+L, line.begin()+R));\n }\n }\n \n sort(vec.begin(), vec.end());\n vec.erase(unique(vec.begin(), vec.end()), vec.end());\n vec = contains_remove(vec);\n\n for(int i=0; i<(int)vec.size(); i++) {\n if(i) cout << \" \";\n cout << vec[i];\n }\n cout << endl;\n }\n \n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":12476,"score_of_the_acc":-1.25,"final_rank":16},{"submission_id":"aoj_1203_992383","code_snippet":"#include <algorithm>\n#include <set>\n#include <cctype>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cassert>\n#include <functional>\n#include <iostream>\n#include <iomanip>\n#include <iterator>\n#include <map>\n#include <queue>\n#include <utility>\n#include <vector>\n\nusing namespace std;\n\ntypedef long long Long;\n#define whole(xs) xs.begin(), xs.end()\n\nstring L;\nbool input() {\n string _;\n getline(cin, _);\n if (cin.eof()) return false;\n L.clear();\n for (int i = 0; i < _.size(); i++) {\n if (isalpha(_[i])) {\n L.push_back(toupper(_[i]));\n }\n }\n return true;\n}\n\n#define ML 1024\nint dp[ML][ML];\n\nbool isPalindrome(int from, int to) {\n if (dp[from][to] >= 0) return dp[from][to];\n if (from >= to) return 1;\n if (L[from] == L[to]) {\n return dp[from][to] = isPalindrome(from + 1, to - 1);\n }\n return dp[from][to] = 0;\n}\n\nset<string> Ans;\nset<string> Dup;\n\nvoid AddDup(int from, int to) {\n if (to - from <= 1) return;\n Dup.insert(L.substr(from, to - from + 1));\n AddDup(from + 1, to - 1);\n}\n\nbool used[ML][ML];\nvoid dfs(int from, int to) {\n if (to - from <= 1) return;\n if (used[from][to]) return;\n //cerr << \"(\" << from << \", \" << to << \")\" << endl;\n string X = L.substr(from, to - from + 1);\n if (isPalindrome(from, to) && !Dup.count(X)) {\n //cerr << from << \" \" << to << endl;\n Ans.insert(X);\n AddDup(from + 1, to - 1);\n }\n dfs(from + 1, to);\n dfs(from, to - 1);\n used[from][to] = true;\n}\n\nvoid solve() {\n Ans.clear();\n Dup.clear();\n memset(dp, -1, sizeof(dp));\n memset(used, 0, sizeof(used));\n dfs(0, int(L.size()) - 1);\n if (Ans.empty()) {\n cout << endl;\n return;\n }\n set<string> RealAns;\n set<string>::iterator it = Ans.begin();\n for (; it != Ans.end(); it++) {\n if (!Dup.count(*it)) RealAns.insert(*it);\n }\n it = RealAns.begin();\n cout << *it;\n for (it++; it != RealAns.end(); it++) {\n cout << \" \" << *it;\n }\n cout << endl;\n}\n\nint main() {\n while (input()) solve();\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":6424,"score_of_the_acc":-0.5149,"final_rank":13},{"submission_id":"aoj_1203_554773","code_snippet":"#include<iostream>\n#include<vector>\n#include<string>\n#include<algorithm>\nusing namespace std;\n\nstring prepare(string a){\n string res;\n for(int i=0;i<a.size();i++){\n if('a'<=a[i] && a[i]<='z')res += a[i]-32;\n if('A'<=a[i] && a[i]<='Z')res += a[i];\n }\n return res;\n}\n\nbool pal(string a){\n int l = a.size();\n for(int i=0;i<l/2;i++){\n if(a[i] != a[l-1-i])return false;\n }\n return true;\n}\n\nstring x,tmp;\n\nint main(){\n while(getline(cin,x)){\n x = prepare(x);\n vector<string> v;\n for(int i=0;i<x.size();i++){\n for(int j=3;j+i<=x.size();j++){\n\ttmp = x.substr(i,j);\n\tif(pal(tmp))v.push_back(tmp);\n }\n }\n sort(v.begin(),v.end());\n v.erase(unique(v.begin(),v.end()),v.end());\n\n for(int i=0;i<v.size();i++){\n for(int j=0;j<v.size();j++){\n\tif(i!=j){\n\t if(v[i].size() <= v[j].size()+1)continue;\n\t int a = v[i].size(); a -= v[j].size();\n\t if(a&1)continue; a >>= 1;\n\t if(v[j] == v[i].substr(a,v[j].size())){\n\t v.erase(v.begin()+j);\n\t if(j<i)i--;\n\t j--;\n\t }\n\t}\n }\n }\n\n for(int i=0;i<v.size();i++){\n cout << v[i] << ((i+1==v.size())?\"\\n\":\" \");\n }\n if(v.empty())cout << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":1216,"score_of_the_acc":-0.0975,"final_rank":2},{"submission_id":"aoj_1203_418080","code_snippet":"#include <iostream>\n#include <sstream>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <set>\n#include <map>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <cassert>\n//C++11\n#if __cplusplus == 201103L\n#include <tuple>\n#endif\n\nusing namespace std;\n\n#define FOR(i,k,n) for(int i=(k); i<(int)n; ++i)\n#define REP(i,n) FOR(i,0,n)\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n\ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cout<<*i<<\" \"; cout<<endl; }\n\ntypedef long long ll;\nconst int INF = 100000000;\nconst double EPS = 1e-8;\nconst int MOD = 1000000007;\n\nint main(){\n for(string s; getline(cin, s);){\n string t;\n REP(i, s.size())if(isalpha(s[i])) t += toupper(s[i]);\n vector<string> candy;\n REP(i, t.size()){\n for(int l = 3; i + l - 1 < t.size(); l++){\n string sub = t.substr(i, l);\n string rev = sub;\n reverse(rev.begin(), rev.end());\n if(sub == rev) candy.push_back(sub);\n }\n }\n sort(candy.begin(), candy.end());\n candy.erase(unique(candy.begin(), candy.end()), candy.end());\n REP(i, candy.size()){\n bool ok = true;\n REP(j, candy.size()){\n if(candy[i] == candy[j].substr(1, candy[j].size() - 2)){\n ok = false;\n }\n }\n if(ok) cout<<candy[i]<<\" \";\n }\n cout<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":940,"score_of_the_acc":-0.3253,"final_rank":10},{"submission_id":"aoj_1203_284104","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <string>\n#include <set>\n#include <cstring>\n\nusing namespace std;\n\nbool used[2000];\nbool check(string s){\n for(int i = 0; i < s.size()/2; i++){\n if(s[i]==s[s.size()-1-i])\n continue;\n else\n return false;\n }\n return true;\n}\n\nint main(){\n\n string str;\n while(getline(cin,str)){\n\n memset(used,0,sizeof(used));\n string s;\n for(int i = 0; i < str.size(); i++){\n if((str[i]>='a'&&str[i]<='z')||(str[i]>='A'&&str[i]<='Z')){\n s+=toupper(str[i]);\n }\n }\n set<string> ss;\n for(int i = s.size(); i >= 3; i--){\n for(int j = 0; j + i -1 < s.size(); j++){\n if(check(s.substr(j,i))){\n ss.insert(s.substr(j,i));\n }\n }\n }\n vector<string> tmps=vector<string>(ss.begin(),ss.end());\n for(int i = 0; i < tmps.size(); i++){\n for(int j = i+1; j < tmps.size(); j++){\n if(tmps[i].size()<tmps[j].size()){\n int diff=tmps[j].size()-tmps[i].size();\n diff/=2;\n if(tmps[j].substr(diff,tmps[i].size())==tmps[i]){\n used[i]=true;\n }\n }\n else{\n int diff=tmps[i].size()-tmps[j].size();\n diff/=2;\n if(tmps[i].substr(diff,tmps[j].size())==tmps[j]){\n used[j]=true;\n }\n }\n }\n }\n ss.clear();\n for(int i = 0; i < tmps.size(); i++){\n if(!used[i])\n ss.insert(tmps[i]);\n }\n for(set<string>::iterator it=ss.begin();it!=ss.end();it++){\n cout<<*it;\n set<string>::iterator iit=it;\n iit++;\n if(iit==ss.end()){\n cout<<endl;\n }\n else\n cout<<\" \";\n }\n if(ss.size()==0)cout<<endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":0,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_1203_250846","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <vector>\n#include <algorithm>\n#include <complex>\n#include <queue>\n#include <map>\n#include <set>\n#include <cstring>\n#include <cstdlib>\n#include <string>\n#include <cmath>\nusing namespace std;\n\n#define REP(i,n) for(int i=0;i<(int)n;++i)\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n#define ALL(c) (c).begin(), (c).end()\nconst int INF = 1<<29;\n\nint main() {\n string line;\n while(getline(cin,line)) {\n string str;\n FOR(it,line)\n if (isalpha(*it))\n str += toupper(*it);\n set<string> res;\n set<string> ignore;\n for (int len = str.size(); len >= 3; --len) {\n for (int pos = 0; pos < str.size()-len+1; ++pos) {\n string s = str.substr(pos, len);\n if (ignore.count(s)) continue;\n string t = s;\n reverse(ALL(t));\n if (s == t) {\n res.insert(s);\n for (int i=0; i<(len-1)/2; ++i) {\n ignore.insert(s.substr(i, len-i*2));\n }\n }\n }\n }\n bool f = 0;\n FOR (it, res) {\n if (f) cout << \" \";\n else f = 1;\n cout << *it;\n }\n cout << endl;\n }\n}","accuracy":1,"time_ms":40,"memory_kb":0,"score_of_the_acc":-0.375,"final_rank":12},{"submission_id":"aoj_1203_249159","code_snippet":"#include<set>\n#include<algorithm>\n#include<iostream>\n#include<string>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\nusing namespace std;\nint main(){\n int i,j,k;\n string s;\n while(getline(cin,s)){\n int ln=s.length();\n for(i=0;i<ln;i++){\n if(0){\n }else if(s[i]>='a'&&s[i]<='z'){\n\ts[i]+='A'-'a';\n }else if(s[i]>='A'&&s[i]<='Z'){\n }else{\n\ts.erase(i,1);\n\ti--;\n\tln--;\n }\n }\n set<string,greater<string> > a;\n set<string> b;\n for(i=ln;i>2;i--){\n for(j=0;j<ln-i+1;j++){\n\tif(b.find(s.substr(j,i))==b.end()){\n\t for(k=0;k<i/2;k++){\n\t if(s[j+k]!=s[j+i-1-k])\n\t break;\n\t }\n\t if(k==i/2){\n\t a.insert(s.substr(j,i));\n\t for(k=1;i-k*2>1;k++)\n\t b.insert(s.substr(j+k,i-k*2));\n\t }\n\t}\n }\n }\n if(a.empty()==0){\n set<string>::iterator it;\n cout<<*a.begin();\n for(it=a.begin(),it++;it!=a.end();it++)\n\tcout<<\" \"<<*it;\n }\n cout<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":932,"score_of_the_acc":-0.3247,"final_rank":9},{"submission_id":"aoj_1203_191960","code_snippet":"#include<iostream>\n#include<string>\n#include<set>\n#include<cctype>\n#include<algorithm>\nusing namespace std;\ntypedef set<string>T;\nint main()\n{\n\tint i,j,len,x,c;\n\tstring s,t,u,v;\n\tT S;\n\tT::iterator p,q;\n\twhile(getline(cin,s))\n\t{\n\t\tfor(c=i=0;i<s.size();)\n\t\t\tif(isalpha(s[i]))s[i]=toupper(s[i]),++i;\n\t\t\telse s.erase(i,1);\n\t\tlen=s.size();\n\t\tfor(x=0;x<2;++x)\n\t\t{\n\t\t\tS.clear();\n\t\t\tfor(i=1;i<len-1-x;++i)\n\t\t\t{\n\t\t\t\tfor(j=min(i,len-i-1-x);j>0;--j)\n\t\t\t\t{\n\t\t\t\t\tu=t=s.substr(i-j,2*j+1+x);\n\t\t\t\t\treverse(u.begin(),u.end());\n\t\t\t\t\tif(t==u)\n\t\t\t\t\t{\n\t\t\t\t\t\tS.insert(t);\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\tfor(p=S.begin();p!=S.end();)\n\t\t\t{\n\t\t\t\tfor(q=p,++q;q!=S.end();)\n\t\t\t\t{\n\t\t\t\t\tt=*p;\n\t\t\t\t\tu=*q;\n\t\t\t\t\ti=t.size();\n\t\t\t\t\tj=u.size();\n\t\t\t\t\tif(i<j)\n\t\t\t\t\t{v=u.substr((j+1)/2-(i+1)/2,i);\n\t\t\t\t\t\tif(v==t)\n\t\t\t\t\t\t{\tS.erase(p++);\n\t\t\t\t\t\t\tgoto E;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse if(i>j)\n\t\t\t\t\t{\n\t\t\t\t\t\tv=t.substr((i+1)/2-(j+1)/2,j);\n\t\t\t\t\t\tif(v==u)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tS.erase(q++);\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\t++q;\n\t\t\t\t}\n\t\t\t\t++p;\nE:;\n\t\t\t}\n\t\t\tfor(p=S.begin();p!=S.end();++p)\n\t\t\t{\n\t\t\t\tif(c++)cout<<' ';\n\t\t\t\tcout<<*p;\n\t\t\t}\n\t\t}\n\t\tcout<<endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":30,"memory_kb":912,"score_of_the_acc":-0.3231,"final_rank":8},{"submission_id":"aoj_1203_171759","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cctype>\n#include <string>\n#include <set>\nusing namespace std;\n\nstring str;\n\n\nbool isSymmetry(string &s) {\n string s2 = \"\";\n for(int i = s.length()-1; i >= 0; --i) {\n s2 += s[i];\n }\n return s2 == s;\n}\n\nvoid solve() {\n set<string> vis;\n\n for(int j = str.length(); j > 2; --j) {\n for(int i = 0; i+j <= str.length(); ++i) {\n string s = str.substr(i, j);\n if(isSymmetry(s) && vis.find(s) == vis.end()) {\n\tif(vis.size() != 0) cout << \" \";\n\tvis.insert(s);\n\tcout << s;\n\twhile(1) {\n\t s = s.substr(1, s.length()-2);\n\t vis.insert(s);\n\t if(s.length() < 3) break;\n\t}\n }\n }\n }\n cout << endl;\n}\n\nmain() {\n char c;\n str = \"\";\n while(scanf(\"%c\", &c) != EOF) {\n if(c == '\\n') {\n solve();\n str = \"\";\n } else if(!isalpha(c)) {\n continue;\n } else {\n str += toupper(c);\n }\n }\n}","accuracy":1,"time_ms":90,"memory_kb":960,"score_of_the_acc":-1.0769,"final_rank":15},{"submission_id":"aoj_1203_85107","code_snippet":"#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<set>\nusing namespace std;\n#define REP(i,b,n) for(int i=b;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define ALL(C) (C).begin(),(C).end()\n#define pb push_back\n\n\nbool isinclude(string tar,vector<string> a){\n rep(i,a.size()){\n string tmp = a[i].substr(1,(int)a[i].size()-2);\n if (tmp == tar)return true;\n /*\n if (search(tmp.begin(),tmp.end(),tar.begin(),tar.end()) != \n tmp.end())return true;\n */\n }\n return false;\n}\n\n\nvector<string> makeans(vector<string> a){\n vector<string> ret; \n rep(i,a.size()){\n if (!isinclude(a[i],a))ret.pb(a[i]);\n }\n return ret;\n}\n\nvoid solve(string in){\n vector<string> ver1,ans;\n rep(i,in.size()){\n string now=\"\";\n REP(j,i,in.size()){\n now=now+in[j];\n if (now.size() > 2){\n\tstring tmp=now;\n\treverse(ALL(tmp));\n\tif (tmp == now)ver1.pb(now);\n }\n }\n }\n\n sort(ALL(ver1));\n ver1.erase(unique(ALL(ver1)),ver1.end());\n\n ans =makeans(ver1);\n sort(ALL(ans));\n rep(i,ans.size()){\n if (i)cout <<' ';\n cout << ans[i];\n }\n cout << endl;\n}\n\nmain(){\n string in;\n while(getline(cin,in)){\n string tar=\"\";\n rep(i,in.size()){\n if (isalpha(in[i]))tar+=toupper(in[i]);\n }\n solve(tar);\n }\n}","accuracy":1,"time_ms":30,"memory_kb":952,"score_of_the_acc":-0.3263,"final_rank":11}],"string":"[\n {\n \"submission_id\": \"aoj_1203_1892938\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<string>\\n#include<algorithm>\\t\\n#include<map>\\n#include<set>\\n#include<utility>\\n#include<cmath>\\n#include<cstring>\\n#include<queue>\\n#include<cstdio>\\n#include<sstream>\\n#include<iomanip>\\n#define loop(i,a,b) for(int i=a;i<b;i++) \\n#define rep(i,a) loop(i,0,a)\\n#define pb push_back\\n#define mp make_pair\\n#define all(in) in.begin(),in.end()\\n#define shosu(x) fixed<<setprecision(x)\\nusing namespace std;\\n//kaewasuretyuui\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\ntypedef vector<pii> vp;\\ntypedef vector<vp> vvp;\\ntypedef pair<int,pii> pip;\\ntypedef vector<pip>vip;\\nconst double PI=acos(-1);\\nconst double EPS=1e-8;\\nconst int inf=1e8;\\nint main(){\\n\\tstring s;\\n\\twhile(getline(cin,s)){\\n\\t\\tstring t=\\\"\\\";\\n\\t\\tset<string>out,no;\\n\\t\\trep(i,s.size())if(isalpha(s[i]))t+=toupper(s[i]);\\n\\t\\trep(i,t.size())loop(j,3,t.size()+1)if(i+j<=t.size()){\\n\\t\\t\\tstring a=t.substr(i,j),b=a;\\n\\t\\t\\treverse(all(b));\\n\\t\\t\\tif(a==b){\\n\\t\\t\\t\\tout.insert(a);\\n\\t\\t\\t\\tno.insert(t.substr(i+1,j-2));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvector<string>ans;\\n\\t\\tfor(set<string>::iterator it=out.begin();it!=out.end();it++)\\n\\t\\t\\tif(no.find(*it)==no.end())\\n\\t\\t\\t\\tans.pb(*it);\\n\\t\\treverse(all(ans));\\n\\t\\trep(i,ans.size()){\\n\\t\\t\\tif(i)cout<<\\\" \\\";\\n\\t\\t\\tcout<<ans[i];\\n\\t\\t}\\n\\t\\tcout<<endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1260,\n \"score_of_the_acc\": -0.226,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1203_1892936\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<string>\\n#include<algorithm>\\t\\n#include<map>\\n#include<set>\\n#include<utility>\\n#include<cmath>\\n#include<cstring>\\n#include<queue>\\n#include<cstdio>\\n#include<sstream>\\n#include<iomanip>\\n#define loop(i,a,b) for(int i=a;i<b;i++) \\n#define rep(i,a) loop(i,0,a)\\n#define pb push_back\\n#define mp make_pair\\n#define all(in) in.begin(),in.end()\\n#define shosu(x) fixed<<setprecision(x)\\nusing namespace std;\\n//kaewasuretyuui\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\ntypedef vector<pii> vp;\\ntypedef vector<vp> vvp;\\ntypedef pair<int,pii> pip;\\ntypedef vector<pip>vip;\\nconst double PI=acos(-1);\\nconst double EPS=1e-8;\\nconst int inf=1e8;\\nint main(){\\n\\tstring s;\\n\\twhile(getline(cin,s)){\\n\\t\\tstring t=\\\"\\\";\\n\\t\\tset<string>out,no;\\n\\t\\trep(i,s.size())if(isalpha(s[i]))t+=toupper(s[i]);\\n\\t\\trep(i,t.size())loop(j,3,t.size()+1)if(i+j<=t.size()){\\n\\t\\t\\tstring a=t.substr(i,j),b=a;\\n\\t\\t\\treverse(all(b));\\n\\t\\t\\tif(a==b){\\n\\t\\t\\t\\tout.insert(a);\\n\\t\\t\\t\\tno.insert(t.substr(i+1,j-2));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvector<string>ans;\\n\\t\\tfor(set<string>::iterator it=out.begin();it!=out.end();it++)\\n\\t\\t\\tif(no.find(*it)==no.end())\\n\\t\\t\\t\\tans.pb(*it);\\n\\t\\trep(i,ans.size()){\\n\\t\\t\\tif(i)cout<<\\\" \\\";\\n\\t\\t\\tcout<<ans[i];\\n\\t\\t}\\n\\t\\tcout<<endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1256,\n \"score_of_the_acc\": -0.2257,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1203_1874995\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n \\nusing namespace std;\\n \\nstring s;\\ntypedef pair<int,string> P;\\n \\nbool is_palindrome(const string &str){\\n int size = str.size();\\n for(int i = 0 ; i < size/2 ; i++){\\n\\tif(str[i] != str[size-i-1]) return false;\\n }\\n return true;\\n}\\n \\nbool check(string a,string b){\\n int alen = a.size(),blen = b.size();\\n if(alen % 2 && blen % 2 == 0) return true;\\n if(alen % 2 == 0 && blen % 2) return true;\\n if(alen == blen) return true;\\n if(alen > blen) swap(a,b),swap(alen,blen);\\n int p = 0;\\n while(true){\\n\\tif(p*2+alen == blen) break;\\n\\tp++;\\n }\\n for(int i = p ; i < p+alen ; i++){\\n\\tif(a[i-p] != b[i]) return true;\\n }\\n return false;\\n}\\n \\nint main(){\\n string in;\\n while(getline(cin,in)){\\n\\tint size;\\n\\tset<P> st;\\n\\tset<string> ans;\\n\\ts.clear();\\n \\n\\tfor(int i = 0 ; i < (int)in.size() ; i++){\\n\\t if(isalpha(in[i])){\\n\\t\\ts += toupper(in[i]);\\n\\t }\\n\\t}\\n\\tsize = s.size();\\n\\tfor(int i = 0 ; i < size ; i++){\\n\\t for(int j = size ; j > i ; j--){\\n\\t\\tstring str = s.substr(i,j-i);\\n\\t\\tif(is_palindrome(str) && j-i >= 3){\\n\\t\\t st.insert(P(str.size(),str));\\n\\t\\t}\\n\\t }\\n\\t}\\n\\tbool ok[1145] = {false};\\n\\tint ii,jj;\\n\\tset<P>::iterator i,j;\\n\\tfor(ii = 0,i = st.begin() ; i != st.end() ; ++i,++ii){\\n\\t for(jj = 0,j = st.begin() ; j != st.end() ; ++j,++jj){\\n\\t\\tif(i == j) continue;\\n\\t\\tif(!check(i->second,j->second)){\\n\\t\\t if(i->first > j->first){\\n\\t\\t\\tok[jj] = true;\\n\\t\\t }else{\\n\\t\\t\\tok[ii] = true;\\n\\t\\t }\\n\\t\\t}\\n\\t }\\n\\t}\\n\\tfor(ii = 0,i = st.begin() ; i != st.end() ; ++i,++ii){\\n\\t if(ok[ii]) continue;\\n\\t ans.insert(i->second);\\n\\t}\\n\\tbool flg = false;\\n\\tset<string>::iterator k;\\n\\tfor(k = ans.begin() ; k != ans.end() ; ++k){\\n\\t if(flg) cout << \\\" \\\";\\n\\t flg = true;\\n\\t cout << *k;\\n\\t}\\n\\tcout << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3212,\n \"score_of_the_acc\": -0.2575,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1203_1759572\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <string>\\n#include <set>\\n#include <queue>\\n\\nusing namespace std;\\n\\nbool isPalindrome(string s)\\n{\\n\\tint n = s.size();\\n\\tfor (int i = 0; i < n / 2; ++i)\\n\\t{\\n\\t\\tif (s[i] != s[n - i - 1])\\n\\t\\t{\\n\\t\\t\\treturn(false);\\n\\t\\t}\\n\\t}\\n\\treturn(true);\\n}\\n\\nvoid solve()\\n{\\n\\tstring temp;\\n\\twhile (getline(cin, temp))\\n\\t{\\n\\t\\tstring str;\\n\\t\\tfor (int i = 0; i < temp.size(); ++i)\\n\\t\\t{\\n\\t\\t\\tif ('a' <= temp[i] && temp[i] <= 'z')\\n\\t\\t\\t{\\n\\t\\t\\t\\tstr += temp[i] - 'a' + 'A';\\n\\t\\t\\t}\\n\\t\\t\\tif ('A' <= temp[i] && temp[i] <= 'Z')\\n\\t\\t\\t{\\n\\t\\t\\t\\tstr += temp[i];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tint n = str.size();\\n\\t\\tvector<string> palindrome;\\n\\t\\tset<string> bad;\\n\\t\\tdeque< deque<bool> > flag(n, deque<bool>(n));\\n\\t\\tfor (int i = n; i >= 3; --i)\\n\\t\\t{\\n\\t\\t\\tfor (int j = 0; j <= n - i; ++j)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif (flag[j][j + i - 1])\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tstring sub;\\n\\t\\t\\t\\tfor (int k = j; k < j + i; ++k)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tsub += str[k];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (isPalindrome(sub) && bad.find(sub) == bad.end())\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tpalindrome.push_back(sub);\\n\\t\\t\\t\\t\\tfor (int k = 0; k < i / 2; ++k)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tflag[j + k][j + i - k - 1] = true;\\n\\t\\t\\t\\t\\t\\tstring tmp;\\n\\t\\t\\t\\t\\t\\tfor (int l = k; l < i - k; ++l)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\ttmp += sub[l];\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tbad.insert(tmp);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tbool isFirst = true;\\n\\t\\tfor (int i = 0; i < palindrome.size(); ++i)\\n\\t\\t{\\n\\t\\t\\tif (!isFirst)\\n\\t\\t\\t{\\n\\t\\t\\t\\tcout << \\\" \\\";\\n\\t\\t\\t}\\n\\t\\t\\tcout << palindrome[i];\\n\\t\\t\\tisFirst = false;\\n\\t\\t}\\n\\t\\tcout << endl;\\n\\t}\\n}\\n\\nint main()\\n{\\n\\tsolve();\\n\\treturn(0);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 1324,\n \"score_of_the_acc\": -0.6061,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1203_1138954\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nstring buf;\\n\\nbool check( string &s){\\n int st = 0, ed = s.size()-1;\\n while( st<ed && s[st] == s[ed] ){ st++; ed--;}\\n return st >= ed;\\n}\\n\\nint main(){\\n while( getline(cin,buf) ){\\n string s;\\n for(int i=0;i<(int)buf.size();i++){\\n if( 'a' <= buf[i] && buf[i] <= 'z' ) s += (buf[i]+'A'-'a');\\n else if( 'A' <= buf[i] && buf[i] <= 'Z' ) s+= buf[i];\\n }\\n\\n vector<string> ans;\\n for(int i=1;i<(int)s.size();i++){\\n int range = min( i, (int)s.size() - i - 1 );\\n for(int j=range;j>0;j--){\\n\\tstring r = s.substr(i-j,2*j+1);\\n\\t//\\tcout << r << endl;\\n\\tif( check(r) ) {\\n\\t ans.push_back(r);\\n\\t break;\\n\\t}\\n }\\n }\\n\\n for(int i=0;i<(int)s.size();i++){\\n int range = s.size()-i;\\n if( range & 1 ) range--;\\n for(int j=0;range-j*2>2;j++){\\n\\tstring r = s.substr(i+j,range-2*j);\\n\\t//\\tcout << r << endl;\\n\\tif( check(r) ) {\\n\\t ans.push_back(r);\\n\\t break;\\n\\t}\\n }\\n }\\n sort(ans.begin(),ans.end());\\n ans.erase(unique(ans.begin(),ans.end()),ans.end());\\n \\n\\n set<string> M;\\n for(int i=0;i<(int)ans.size();i++){\\n //cout << ans[i] << endl;\\n //cout << M.count( ans[i] ) << endl;\\n if( M.count(ans[i]) != 0 ) continue;\\n int range = ans[i].size();\\n // cout << range << endl;\\n for(int j=1;range-2*j>2;j++){\\n\\t//\\tcout << ans[i].substr(j,range-2*j) << endl;\\n\\tM.insert(ans[i].substr(j,range-2*j));\\n }\\n }\\n vector<string> res;\\n for(int i=0;i<(int)ans.size();i++){\\n //cout << M.count(ans[i]) << endl;\\n //cout << ans[i] << endl;\\n if( M.count(ans[i]) == 0 )\\n\\tres.push_back(ans[i]);\\n }\\n\\n\\n for(int i=0;i<(int)res.size();i++){\\n if( i ) cout << \\\" \\\";\\n cout << res[i];\\n }\\n cout << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1224,\n \"score_of_the_acc\": -0.0981,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1203_1138202\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nstring s;\\ntypedef pair<int,string> P;\\n\\nbool is_palindrome(const string &str){\\n int size = str.size();\\n for(int i = 0 ; i < size/2 ; i++){\\n if(str[i] != str[size-i-1]) return false;\\n }\\n return true;\\n}\\n\\nbool check(string a,string b){\\n int alen = a.size(),blen = b.size();\\n if(alen % 2 && blen % 2 == 0) return true;\\n if(alen % 2 == 0 && blen % 2) return true;\\n if(alen == blen) return true;\\n if(alen > blen) swap(a,b),swap(alen,blen);\\n int p = 0;\\n while(true){\\n if(p*2+alen == blen) break;\\n p++;\\n }\\n for(int i = p ; i < p+alen ; i++){\\n if(a[i-p] != b[i]) return true;\\n }\\n return false;\\n}\\n\\nint main(){\\n string in;\\n while(getline(cin,in)){\\n int size;\\n set<P> st;\\n set<string> ans;\\n s.clear();\\n \\n for(int i = 0 ; i < (int)in.size() ; i++){\\n if(isalpha(in[i])){\\n s += toupper(in[i]);\\n }\\n }\\n size = s.size();\\n for(int i = 0 ; i < size ; i++){\\n for(int j = size ; j > i ; j--){\\n string str = s.substr(i,j-i);\\n if(is_palindrome(str) && j-i >= 3){\\n st.insert(P(str.size(),str));\\n }\\n }\\n }\\n bool ok[1145] = {false};\\n int ii,jj;\\n set<P>::iterator i,j;\\n for(ii = 0,i = st.begin() ; i != st.end() ; ++i,++ii){\\n for(jj = 0,j = st.begin() ; j != st.end() ; ++j,++jj){\\n if(i == j) continue;\\n if(!check(i->second,j->second)){\\n if(i->first > j->first){\\n ok[jj] = true;\\n }else{\\n ok[ii] = true;\\n }\\n }\\n }\\n }\\n for(ii = 0,i = st.begin() ; i != st.end() ; ++i,++ii){\\n if(ok[ii]) continue;\\n ans.insert(i->second);\\n }\\n bool flg = false;\\n set<string>::iterator k;\\n for(k = ans.begin() ; k != ans.end() ; ++k){\\n if(flg) cout << \\\" \\\";\\n flg = true;\\n cout << *k;\\n }\\n cout << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1228,\n \"score_of_the_acc\": -0.2234,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1203_1138138\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define REP(i,a,b) for(int i=a;i<(int)b;i++)\\n#define rep(i,n) REP(i,0,n)\\n\\nint memo[1200][1200];\\n\\nint center[1200];\\nint center2[1200][1200];\\n\\ntypedef pair<int, int> Pii;\\nmap<int, Pii> mp1;\\nmap<Pii, Pii> mp2;\\n\\nint N;\\nstring line;\\n\\nbool is_palindrome(int L, int R) {\\n if(L >= R) return 1;\\n\\n if(memo[L][R] != -1) {\\n return memo[L][R];\\n }\\n \\n int SIZE = R-L;\\n \\n if(line[L] == line[R-1]) {\\n memo[L][R] = is_palindrome(L+1, R-1);\\n\\n if(memo[L][R] == 1) {\\n if(R-L > 2) {\\n\\tif(SIZE % 2 == 0) {\\n\\t int l = (L+R)/2, r = (L+R)/2+1;\\n\\t if(center2[l][r] < R-L) {\\n\\t mp2[Pii(l, r)] = Pii(L, R);\\n\\t center2[l][r] = R-L;\\n\\t }\\n\\t}\\n\\telse {\\n\\t int m = (L+R)/2;\\n\\t if(center[m] < R-L) {\\n\\t mp1[m] = Pii(L, R);\\n\\t center[m] = R-L;\\n\\t }\\n\\t}\\n }\\n return 1;\\n }\\n else if(memo[L][R] == 0) return 0;\\n else assert(false);\\n }\\n memo[L][R] = 0; return 0;\\n}\\n\\nvoid kirei() {\\n string ret;\\n int const N = line.size();\\n rep(i, N) {\\n if(isalpha(line[i])) { ret += toupper(line[i]); }\\n }\\n line = ret;\\n}\\n\\nbool cmp(string const& a, string const& b) {\\n return a.size() < b.size();\\n}\\n\\nvector<string> contains_remove(vector<string>& vec) {\\n \\n vector<bool> retbool(vec.size());\\n vector<string> ret;\\n sort(vec.begin(), vec.end(), cmp);\\n \\n rep(i, vec.size()) {\\n int ISize = vec[i].size();\\n REP(j, i+1, vec.size()) {\\n int JSize = vec[j].size();\\n if(ISize % 2 != JSize % 2) continue;\\n if(ISize % 2 == 0) {\\n\\tif(vec[i] == string(vec[j].begin()+(JSize/2-ISize/2), vec[j].begin()+(JSize/2+ISize/2))) {\\n\\t retbool[i] = 1;\\n\\t}\\n }\\n else {\\n\\tif(vec[i] == string(vec[j].begin()+(JSize/2-ISize/2), vec[j].begin()+(JSize/2+ISize/2+1))) {\\n\\t retbool[i] = 1;\\n\\t}\\n }\\n }\\n }\\n \\n for(int i=0; i<(int)vec.size(); i++) {\\n if(!retbool[i]) {\\n ret.push_back(vec[i]);\\n }\\n }\\n \\n return ret;\\n}\\n\\n\\nint main() {\\n \\n while(getline(cin, line)) {\\n rep(i, 1200) {\\n rep(j, 1200) {\\n\\tmemo[i][j] = -1;\\n\\tcenter2[i][j] = -1;\\n }\\n center[i] = -1;\\n }\\n mp1.clear(), mp2.clear();\\n \\n kirei();\\n N = line.size();\\n \\n rep(i, N) REP(j, i+1, N+1) {\\n memo[i][j] = is_palindrome(i, j);\\n }\\n \\n vector<string> vec;\\n {\\n map<int, Pii>::iterator it = mp1.begin();\\n for(; it!=mp1.end(); it++) {\\n\\tint L = it->second.first;\\n\\tint R = it->second.second;\\n\\tvec.push_back(string(line.begin()+L, line.begin()+R));\\n }\\n }\\n {\\n map<Pii, Pii>::iterator it = mp2.begin();\\n for(; it!=mp2.end(); it++) {\\n\\tint L = it->second.first;\\n\\tint R = it->second.second;\\n\\tvec.push_back(string(line.begin()+L, line.begin()+R));\\n }\\n }\\n \\n sort(vec.begin(), vec.end());\\n vec.erase(unique(vec.begin(), vec.end()), vec.end());\\n vec = contains_remove(vec);\\n\\n for(int i=0; i<(int)vec.size(); i++) {\\n if(i) cout << \\\" \\\";\\n cout << vec[i];\\n }\\n cout << endl;\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 12476,\n \"score_of_the_acc\": -1.25,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1203_992383\",\n \"code_snippet\": \"#include <algorithm>\\n#include <set>\\n#include <cctype>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <cassert>\\n#include <functional>\\n#include <iostream>\\n#include <iomanip>\\n#include <iterator>\\n#include <map>\\n#include <queue>\\n#include <utility>\\n#include <vector>\\n\\nusing namespace std;\\n\\ntypedef long long Long;\\n#define whole(xs) xs.begin(), xs.end()\\n\\nstring L;\\nbool input() {\\n string _;\\n getline(cin, _);\\n if (cin.eof()) return false;\\n L.clear();\\n for (int i = 0; i < _.size(); i++) {\\n if (isalpha(_[i])) {\\n L.push_back(toupper(_[i]));\\n }\\n }\\n return true;\\n}\\n\\n#define ML 1024\\nint dp[ML][ML];\\n\\nbool isPalindrome(int from, int to) {\\n if (dp[from][to] >= 0) return dp[from][to];\\n if (from >= to) return 1;\\n if (L[from] == L[to]) {\\n return dp[from][to] = isPalindrome(from + 1, to - 1);\\n }\\n return dp[from][to] = 0;\\n}\\n\\nset<string> Ans;\\nset<string> Dup;\\n\\nvoid AddDup(int from, int to) {\\n if (to - from <= 1) return;\\n Dup.insert(L.substr(from, to - from + 1));\\n AddDup(from + 1, to - 1);\\n}\\n\\nbool used[ML][ML];\\nvoid dfs(int from, int to) {\\n if (to - from <= 1) return;\\n if (used[from][to]) return;\\n //cerr << \\\"(\\\" << from << \\\", \\\" << to << \\\")\\\" << endl;\\n string X = L.substr(from, to - from + 1);\\n if (isPalindrome(from, to) && !Dup.count(X)) {\\n //cerr << from << \\\" \\\" << to << endl;\\n Ans.insert(X);\\n AddDup(from + 1, to - 1);\\n }\\n dfs(from + 1, to);\\n dfs(from, to - 1);\\n used[from][to] = true;\\n}\\n\\nvoid solve() {\\n Ans.clear();\\n Dup.clear();\\n memset(dp, -1, sizeof(dp));\\n memset(used, 0, sizeof(used));\\n dfs(0, int(L.size()) - 1);\\n if (Ans.empty()) {\\n cout << endl;\\n return;\\n }\\n set<string> RealAns;\\n set<string>::iterator it = Ans.begin();\\n for (; it != Ans.end(); it++) {\\n if (!Dup.count(*it)) RealAns.insert(*it);\\n }\\n it = RealAns.begin();\\n cout << *it;\\n for (it++; it != RealAns.end(); it++) {\\n cout << \\\" \\\" << *it;\\n }\\n cout << endl;\\n}\\n\\nint main() {\\n while (input()) solve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 6424,\n \"score_of_the_acc\": -0.5149,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1203_554773\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<string>\\n#include<algorithm>\\nusing namespace std;\\n\\nstring prepare(string a){\\n string res;\\n for(int i=0;i<a.size();i++){\\n if('a'<=a[i] && a[i]<='z')res += a[i]-32;\\n if('A'<=a[i] && a[i]<='Z')res += a[i];\\n }\\n return res;\\n}\\n\\nbool pal(string a){\\n int l = a.size();\\n for(int i=0;i<l/2;i++){\\n if(a[i] != a[l-1-i])return false;\\n }\\n return true;\\n}\\n\\nstring x,tmp;\\n\\nint main(){\\n while(getline(cin,x)){\\n x = prepare(x);\\n vector<string> v;\\n for(int i=0;i<x.size();i++){\\n for(int j=3;j+i<=x.size();j++){\\n\\ttmp = x.substr(i,j);\\n\\tif(pal(tmp))v.push_back(tmp);\\n }\\n }\\n sort(v.begin(),v.end());\\n v.erase(unique(v.begin(),v.end()),v.end());\\n\\n for(int i=0;i<v.size();i++){\\n for(int j=0;j<v.size();j++){\\n\\tif(i!=j){\\n\\t if(v[i].size() <= v[j].size()+1)continue;\\n\\t int a = v[i].size(); a -= v[j].size();\\n\\t if(a&1)continue; a >>= 1;\\n\\t if(v[j] == v[i].substr(a,v[j].size())){\\n\\t v.erase(v.begin()+j);\\n\\t if(j<i)i--;\\n\\t j--;\\n\\t }\\n\\t}\\n }\\n }\\n\\n for(int i=0;i<v.size();i++){\\n cout << v[i] << ((i+1==v.size())?\\\"\\\\n\\\":\\\" \\\");\\n }\\n if(v.empty())cout << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1216,\n \"score_of_the_acc\": -0.0975,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1203_418080\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n#include <string>\\n#include <algorithm>\\n#include <vector>\\n#include <stack>\\n#include <queue>\\n#include <set>\\n#include <map>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <cmath>\\n#include <cassert>\\n//C++11\\n#if __cplusplus == 201103L\\n#include <tuple>\\n#endif\\n\\nusing namespace std;\\n\\n#define FOR(i,k,n) for(int i=(k); i<(int)n; ++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\\n\\ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cout<<*i<<\\\" \\\"; cout<<endl; }\\n\\ntypedef long long ll;\\nconst int INF = 100000000;\\nconst double EPS = 1e-8;\\nconst int MOD = 1000000007;\\n\\nint main(){\\n for(string s; getline(cin, s);){\\n string t;\\n REP(i, s.size())if(isalpha(s[i])) t += toupper(s[i]);\\n vector<string> candy;\\n REP(i, t.size()){\\n for(int l = 3; i + l - 1 < t.size(); l++){\\n string sub = t.substr(i, l);\\n string rev = sub;\\n reverse(rev.begin(), rev.end());\\n if(sub == rev) candy.push_back(sub);\\n }\\n }\\n sort(candy.begin(), candy.end());\\n candy.erase(unique(candy.begin(), candy.end()), candy.end());\\n REP(i, candy.size()){\\n bool ok = true;\\n REP(j, candy.size()){\\n if(candy[i] == candy[j].substr(1, candy[j].size() - 2)){\\n ok = false;\\n }\\n }\\n if(ok) cout<<candy[i]<<\\\" \\\";\\n }\\n cout<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 940,\n \"score_of_the_acc\": -0.3253,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1203_284104\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <string>\\n#include <set>\\n#include <cstring>\\n\\nusing namespace std;\\n\\nbool used[2000];\\nbool check(string s){\\n for(int i = 0; i < s.size()/2; i++){\\n if(s[i]==s[s.size()-1-i])\\n continue;\\n else\\n return false;\\n }\\n return true;\\n}\\n\\nint main(){\\n\\n string str;\\n while(getline(cin,str)){\\n\\n memset(used,0,sizeof(used));\\n string s;\\n for(int i = 0; i < str.size(); i++){\\n if((str[i]>='a'&&str[i]<='z')||(str[i]>='A'&&str[i]<='Z')){\\n s+=toupper(str[i]);\\n }\\n }\\n set<string> ss;\\n for(int i = s.size(); i >= 3; i--){\\n for(int j = 0; j + i -1 < s.size(); j++){\\n if(check(s.substr(j,i))){\\n ss.insert(s.substr(j,i));\\n }\\n }\\n }\\n vector<string> tmps=vector<string>(ss.begin(),ss.end());\\n for(int i = 0; i < tmps.size(); i++){\\n for(int j = i+1; j < tmps.size(); j++){\\n if(tmps[i].size()<tmps[j].size()){\\n int diff=tmps[j].size()-tmps[i].size();\\n diff/=2;\\n if(tmps[j].substr(diff,tmps[i].size())==tmps[i]){\\n used[i]=true;\\n }\\n }\\n else{\\n int diff=tmps[i].size()-tmps[j].size();\\n diff/=2;\\n if(tmps[i].substr(diff,tmps[j].size())==tmps[j]){\\n used[j]=true;\\n }\\n }\\n }\\n }\\n ss.clear();\\n for(int i = 0; i < tmps.size(); i++){\\n if(!used[i])\\n ss.insert(tmps[i]);\\n }\\n for(set<string>::iterator it=ss.begin();it!=ss.end();it++){\\n cout<<*it;\\n set<string>::iterator iit=it;\\n iit++;\\n if(iit==ss.end()){\\n cout<<endl;\\n }\\n else\\n cout<<\\\" \\\";\\n }\\n if(ss.size()==0)cout<<endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 0,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1203_250846\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <vector>\\n#include <algorithm>\\n#include <complex>\\n#include <queue>\\n#include <map>\\n#include <set>\\n#include <cstring>\\n#include <cstdlib>\\n#include <string>\\n#include <cmath>\\nusing namespace std;\\n\\n#define REP(i,n) for(int i=0;i<(int)n;++i)\\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\\n#define ALL(c) (c).begin(), (c).end()\\nconst int INF = 1<<29;\\n\\nint main() {\\n string line;\\n while(getline(cin,line)) {\\n string str;\\n FOR(it,line)\\n if (isalpha(*it))\\n str += toupper(*it);\\n set<string> res;\\n set<string> ignore;\\n for (int len = str.size(); len >= 3; --len) {\\n for (int pos = 0; pos < str.size()-len+1; ++pos) {\\n string s = str.substr(pos, len);\\n if (ignore.count(s)) continue;\\n string t = s;\\n reverse(ALL(t));\\n if (s == t) {\\n res.insert(s);\\n for (int i=0; i<(len-1)/2; ++i) {\\n ignore.insert(s.substr(i, len-i*2));\\n }\\n }\\n }\\n }\\n bool f = 0;\\n FOR (it, res) {\\n if (f) cout << \\\" \\\";\\n else f = 1;\\n cout << *it;\\n }\\n cout << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 0,\n \"score_of_the_acc\": -0.375,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1203_249159\",\n \"code_snippet\": \"#include<set>\\n#include<algorithm>\\n#include<iostream>\\n#include<string>\\n#include<cstdlib>\\n#include<cstring>\\n#include<cmath>\\nusing namespace std;\\nint main(){\\n int i,j,k;\\n string s;\\n while(getline(cin,s)){\\n int ln=s.length();\\n for(i=0;i<ln;i++){\\n if(0){\\n }else if(s[i]>='a'&&s[i]<='z'){\\n\\ts[i]+='A'-'a';\\n }else if(s[i]>='A'&&s[i]<='Z'){\\n }else{\\n\\ts.erase(i,1);\\n\\ti--;\\n\\tln--;\\n }\\n }\\n set<string,greater<string> > a;\\n set<string> b;\\n for(i=ln;i>2;i--){\\n for(j=0;j<ln-i+1;j++){\\n\\tif(b.find(s.substr(j,i))==b.end()){\\n\\t for(k=0;k<i/2;k++){\\n\\t if(s[j+k]!=s[j+i-1-k])\\n\\t break;\\n\\t }\\n\\t if(k==i/2){\\n\\t a.insert(s.substr(j,i));\\n\\t for(k=1;i-k*2>1;k++)\\n\\t b.insert(s.substr(j+k,i-k*2));\\n\\t }\\n\\t}\\n }\\n }\\n if(a.empty()==0){\\n set<string>::iterator it;\\n cout<<*a.begin();\\n for(it=a.begin(),it++;it!=a.end();it++)\\n\\tcout<<\\\" \\\"<<*it;\\n }\\n cout<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 932,\n \"score_of_the_acc\": -0.3247,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1203_191960\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<set>\\n#include<cctype>\\n#include<algorithm>\\nusing namespace std;\\ntypedef set<string>T;\\nint main()\\n{\\n\\tint i,j,len,x,c;\\n\\tstring s,t,u,v;\\n\\tT S;\\n\\tT::iterator p,q;\\n\\twhile(getline(cin,s))\\n\\t{\\n\\t\\tfor(c=i=0;i<s.size();)\\n\\t\\t\\tif(isalpha(s[i]))s[i]=toupper(s[i]),++i;\\n\\t\\t\\telse s.erase(i,1);\\n\\t\\tlen=s.size();\\n\\t\\tfor(x=0;x<2;++x)\\n\\t\\t{\\n\\t\\t\\tS.clear();\\n\\t\\t\\tfor(i=1;i<len-1-x;++i)\\n\\t\\t\\t{\\n\\t\\t\\t\\tfor(j=min(i,len-i-1-x);j>0;--j)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tu=t=s.substr(i-j,2*j+1+x);\\n\\t\\t\\t\\t\\treverse(u.begin(),u.end());\\n\\t\\t\\t\\t\\tif(t==u)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tS.insert(t);\\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\\tfor(p=S.begin();p!=S.end();)\\n\\t\\t\\t{\\n\\t\\t\\t\\tfor(q=p,++q;q!=S.end();)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tt=*p;\\n\\t\\t\\t\\t\\tu=*q;\\n\\t\\t\\t\\t\\ti=t.size();\\n\\t\\t\\t\\t\\tj=u.size();\\n\\t\\t\\t\\t\\tif(i<j)\\n\\t\\t\\t\\t\\t{v=u.substr((j+1)/2-(i+1)/2,i);\\n\\t\\t\\t\\t\\t\\tif(v==t)\\n\\t\\t\\t\\t\\t\\t{\\tS.erase(p++);\\n\\t\\t\\t\\t\\t\\t\\tgoto E;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse if(i>j)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tv=t.substr((i+1)/2-(j+1)/2,j);\\n\\t\\t\\t\\t\\t\\tif(v==u)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tS.erase(q++);\\n\\t\\t\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t++q;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t++p;\\nE:;\\n\\t\\t\\t}\\n\\t\\t\\tfor(p=S.begin();p!=S.end();++p)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif(c++)cout<<' ';\\n\\t\\t\\t\\tcout<<*p;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout<<endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 912,\n \"score_of_the_acc\": -0.3231,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1203_171759\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cctype>\\n#include <string>\\n#include <set>\\nusing namespace std;\\n\\nstring str;\\n\\n\\nbool isSymmetry(string &s) {\\n string s2 = \\\"\\\";\\n for(int i = s.length()-1; i >= 0; --i) {\\n s2 += s[i];\\n }\\n return s2 == s;\\n}\\n\\nvoid solve() {\\n set<string> vis;\\n\\n for(int j = str.length(); j > 2; --j) {\\n for(int i = 0; i+j <= str.length(); ++i) {\\n string s = str.substr(i, j);\\n if(isSymmetry(s) && vis.find(s) == vis.end()) {\\n\\tif(vis.size() != 0) cout << \\\" \\\";\\n\\tvis.insert(s);\\n\\tcout << s;\\n\\twhile(1) {\\n\\t s = s.substr(1, s.length()-2);\\n\\t vis.insert(s);\\n\\t if(s.length() < 3) break;\\n\\t}\\n }\\n }\\n }\\n cout << endl;\\n}\\n\\nmain() {\\n char c;\\n str = \\\"\\\";\\n while(scanf(\\\"%c\\\", &c) != EOF) {\\n if(c == '\\\\n') {\\n solve();\\n str = \\\"\\\";\\n } else if(!isalpha(c)) {\\n continue;\\n } else {\\n str += toupper(c);\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 960,\n \"score_of_the_acc\": -1.0769,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1203_85107\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<algorithm>\\n#include<set>\\nusing namespace std;\\n#define REP(i,b,n) for(int i=b;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define ALL(C) (C).begin(),(C).end()\\n#define pb push_back\\n\\n\\nbool isinclude(string tar,vector<string> a){\\n rep(i,a.size()){\\n string tmp = a[i].substr(1,(int)a[i].size()-2);\\n if (tmp == tar)return true;\\n /*\\n if (search(tmp.begin(),tmp.end(),tar.begin(),tar.end()) != \\n tmp.end())return true;\\n */\\n }\\n return false;\\n}\\n\\n\\nvector<string> makeans(vector<string> a){\\n vector<string> ret; \\n rep(i,a.size()){\\n if (!isinclude(a[i],a))ret.pb(a[i]);\\n }\\n return ret;\\n}\\n\\nvoid solve(string in){\\n vector<string> ver1,ans;\\n rep(i,in.size()){\\n string now=\\\"\\\";\\n REP(j,i,in.size()){\\n now=now+in[j];\\n if (now.size() > 2){\\n\\tstring tmp=now;\\n\\treverse(ALL(tmp));\\n\\tif (tmp == now)ver1.pb(now);\\n }\\n }\\n }\\n\\n sort(ALL(ver1));\\n ver1.erase(unique(ALL(ver1)),ver1.end());\\n\\n ans =makeans(ver1);\\n sort(ALL(ans));\\n rep(i,ans.size()){\\n if (i)cout <<' ';\\n cout << ans[i];\\n }\\n cout << endl;\\n}\\n\\nmain(){\\n string in;\\n while(getline(cin,in)){\\n string tar=\\\"\\\";\\n rep(i,in.size()){\\n if (isalpha(in[i]))tar+=toupper(in[i]);\\n }\\n solve(tar);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 952,\n \"score_of_the_acc\": -0.3263,\n \"final_rank\": 11\n }\n]","isConversational":false}}},{"rowIdx":674,"cells":{"group_id":{"kind":"string","value":"aoj_1208_cpp"},"problem_description":{"kind":"string","value":"Problem A:\nRational Irrationals\nRational numbers are numbers represented by ratios of two integers. For a prime number\np\n, one of the elementary theorems in the number theory is that there is no rational number equal to √\np\n. Such numbers are called irrational numbers. It is also known that there are rational numbers arbitrarily close to √\np\nNow, given a positive integer\nn\n, we define a set\nQ\nn\nof all rational numbers whose elements are represented by ratios of two positive integers both of which are less than or equal to\nn\n. For example,\nQ\n4\nis a set of 11 rational numbers {1/1, 1/2, 1/3, 1/4, 2/1, 2/3, 3/1, 3/2, 3/4, 4/1, 4/3}. 2/2, 2/4, 3/3, 4/2 and 4/4 are not included here because they are equal to 1/1, 1/2, 1/1, 2/1 and 1/1, respectively.\nYour job is to write a program that reads two integers\np\nand\nn\nand reports two rational numbers\nx / y\nand\nu / v\n, where\nu / v\n< √\np\n<\nx / y\nand there are no other elements of\nQ\nn\nbetween\nu/v\nand\nx/y\n. When\nn\nis greater than √\np\n, such a pair of rational numbers always exists.\nInput\nThe input consists of lines each of which contains two positive integers, a prime number\np\nand an integer\nn\nin the following format.\np n\nThey are separated by a space character. You can assume that\np\nand\nn\nare less than 10000, and that\nn\nis greater than √\np\n. The end of the input is indicated by a line consisting of two zeros.\nOutput\nFor each input line, your program should output a line consisting of the two rational numbers\nx / y\nand\nu / v\n(\nx / y\n>\nu / v\n) separated by a space character in the following format.\nx/y u/v\nThey should be irreducible. For example, 6/14 and 15/3 are not accepted. They should be reduced to 3/7 and 5/1, respectively.\nSample Input\n2 5\n3 10\n5 100\n0 0\nOutput for the Sample Input\n3/2 4/3\n7/4 5/3\n85/38 38/17"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1208_8658705","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define overload4(_1, _2, _3, _4, name, ...) name\n#define rep1(n) for(int i = 0; i < (int)(n); ++i)\n#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)\n#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)\n#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n\n#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)\n#define ALL(a) (a).begin(), (a).end()\n#define Sort(a) (sort((a).begin(), (a).end()))\n#define RSort(a) (sort((a).rbegin(), (a).rend()))\n#define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end()))\n\ntypedef long long int ll;\ntypedef unsigned long long ul;\ntypedef long double ld;\ntypedef vector<int> vi;\ntypedef vector<long long> vll;\ntypedef vector<char> vc;\ntypedef vector<string> vst;\ntypedef vector<double> vd;\ntypedef vector<long double> vld;\ntypedef pair<long long, long long> P;\n\ntemplate<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }\ntemplate<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }\ntemplate<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }\n\nconst long long MINF = 0x7fffffffffff;\nconst long long INF = 0x1fffffffffffffff;\nconst long long MOD = 998244353;\nconst long double EPS = 1e-9;\nconst long double PI = acos(-1);\n \ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n\ntemplate<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }\ntemplate<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << \"(\" << p.first << \", \" << p.second << \")\"; return os; }\ntemplate<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }\ntemplate<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? \" \" : \"\"); } return os; }\ntemplate <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << \":\" << val << \" \"; } return os; }\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? \" \" : \"\"); itr++; } return os; }\ntemplate <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? \" \" : \"\"); itr++; } return os; }\ntemplate <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << \" \"; q.pop(); } return os; }\ntemplate <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << \" \"; q.pop_front(); } return os; }\ntemplate <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << \" \"; st.pop(); } return os; }\ntemplate <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << \" \"; pq.pop(); } return os; }\n\ntemplate<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }\ntemplate<class T> inline void vout(T vec, string s = \"\\n\"){ for(auto x : vec) cout << x << s; }\ntemplate<class... T> void in(T&... a){ (cin >> ... >> a); }\nvoid out(){ cout << '\\n'; }\ntemplate<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\\n'; }\ntemplate<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }\n\ntemplate <long long base = 1000000LL, int digit = 6>\nstruct BigInt{\n int sign = 1;\n vector<long long> val;\n\n constexpr BigInt(const long long _val = 0) noexcept {\n if(_val != 0){\n val.assign(1, abs(_val));\n shift();\n }\n if(_val < 0) sign = -1;\n }\n constexpr BigInt(const vector<long long> &_val) noexcept : val(_val) {}\n constexpr BigInt(const string &s) noexcept {\n stoi(s);\n }\n\nprivate:\n void normalize(){\n while(!val.empty() && val.back() == 0) val.pop_back();\n if(val.empty()) sign = 1;\n }\n vector<long long> karatsuba_algorithm(vector<long long> &a, vector<long long> &b){\n const int n = (int) a.size();\n const int h = n >> 1;\n assert(a.size() == b.size());\n assert((n & (n - 1)) == 0);\n if(n <= 64){\n vector<long long> res(2 * n - 1);\n for(int i = 0; i < n; ++i){\n for(int j = 0; j < n; ++j){\n res[i + j] += a[i] * b[j];\n }\n }\n return res;\n }\n vector<long long> p(h), q(h), r(h), s(h), t(h), u(h);\n for(int i = 0; i < h; ++i){\n p[i] = a[i + h];\n q[i] = a[i];\n r[i] = b[i + h];\n s[i] = b[i];\n t[i] = p[i] + q[i];\n u[i] = r[i] + s[i];\n }\n p = karatsuba_algorithm(p, r);\n q = karatsuba_algorithm(q, s);\n t = karatsuba_algorithm(t, u);\n vector<long long> res(2 * n - 1, 0);\n for(int i = 0; i < n - 1; ++i){\n res[i] += q[i];\n res[i + h] += t[i] - p[i] - q[i];\n res[i + n] += p[i];\n }\n return res;\n }\n\n pair<BigInt, BigInt> divide_naive(const BigInt& rhs) const {\n assert(!rhs.val.empty());\n const int k = base / (rhs.val.back() + 1);\n const BigInt dividend = (sign == 1 ? *this : -(*this)) * k;\n const BigInt divisor = (rhs.sign == 1 ? rhs : -rhs) * k;\n BigInt quo, rem = 0;\n quo.val.resize(dividend.val.size());\n const int n = divisor.val.size();\n for(int i = (int) dividend.val.size() - 1; i >= 0; --i){\n rem.val.emplace(rem.val.begin(), dividend.val[i]);\n quo.val[i] = ((n < (int) rem.val.size() ? rem.val[n] * base : 0) + ((n - 1) < (int) rem.val.size() ? rem.val[n - 1] : 0)) / divisor.val.back();\n rem -= divisor * quo.val[i];\n while (rem.sign == -1) {\n rem += divisor;\n --quo.val[i];\n }\n }\n quo.sign = sign * rhs.sign;\n quo.normalize();\n rem.sign = sign;\n rem.normalize();\n return {quo, rem / k};\n }\n\n pair<BigInt, BigInt> divide_newton(const BigInt& rhs) const {\n assert(!rhs.val.empty());\n int preci = val.size() - rhs.val.size();\n BigInt t(1);\n BigInt two = BigInt(2) << rhs.val.size();\n BigInt pre;\n int lim = min(preci, 3);\n int rhslim = min(int(rhs.val.size()), 6);\n t <<= lim;\n while(pre != t){\n BigInt rb = rhs >> (rhs.val.size() - rhslim);\n if(rhslim != (int) rhs.val.size()) rb += BigInt(1);\n pre = t;\n t *= (BigInt(2) << (rhslim + lim)) - rb * t;\n t.val = vector<long long>(t.val.begin() + lim + rhslim, t.val.end());\n }\n if(lim != preci){\n pre = BigInt();\n while(pre != t){\n BigInt rb = rhs >> (rhs.val.size() - rhslim);\n if(rhslim != (int) rhs.val.size()) rb += BigInt(1);\n pre = t;\n t *= (BigInt(2) << (rhslim + lim)) - rb * t;\n t.val = vector<long long>(t.val.begin() + lim + rhslim, t.val.end());\n int next_lim = min(lim * 2 + 1, preci);\n if (next_lim != lim) t <<= next_lim - lim;\n int next_rhslim = min(rhslim * 2 + 1, int(rhs.val.size()));\n lim = next_lim;\n rhslim = next_rhslim;\n }\n }\n BigInt quo = (*this) * t;\n quo.val = vector<long long>(quo.val.begin() + val.size(), quo.val.end());\n BigInt mul = quo * rhs;\n while(mul + rhs <= (*this)){\n quo += BigInt(1);\n mul += rhs;\n }\n BigInt rem = *this - quo * rhs;\n return {quo, rem};\n }\n\npublic:\n void stoi(string &s){\n if(s == \"0\") return;\n int n = s.size(), idx = 0;\n if(s[0] == '-'){\n n -= 1;\n sign = -1;\n idx = 1;\n }\n int len = (n + digit - 1) / digit, rem = n % digit;\n if(rem == 0) rem += digit;\n val.resize(len);\n for(int i = len - 1; i >= 0; --i){\n if(i == len - 1){\n val[i] = stoll(s.substr(idx, rem));\n idx += rem;\n }else{\n val[i] = stoll(s.substr(idx, digit));\n idx += digit;\n }\n }\n }\n string itos() const {\n string res = \"\";\n if(sign == -1) res += \"-\";\n bool flag = false;\n for(int i = (int) val.size() - 1; i >= 0; --i){\n if(val[i] > 0 && !flag){\n res += to_string(val[i]);\n flag = true;\n }else if(flag){\n string rem = to_string(val[i]);\n res += string(digit - rem.size(), '0') + rem;\n }\n }\n return (res.empty() || res == \"-\") ? \"0\" : res;\n }\n pair<BigInt, BigInt> divide_mod(const BigInt& rhs){\n assert(!rhs.val.empty());\n BigInt div = *this / rhs;\n return make_pair(div, *this - div * rhs);\n }\n BigInt& shift(){\n for(int i = 0; i < (int) val.size() - 1; ++i){\n if(val[i] >= 0){\n val[i + 1] += val[i] / base;\n val[i] %= base;\n }else{\n long long x = (-val[i] + base - 1) / base;\n val[i] += x * base;\n val[i + 1] -= x;\n }\n }\n while(val.back() >= base){\n val.emplace_back(val.back() / base);\n val[val.size() - 2] %= base;\n }\n return *this;\n }\n BigInt& operator=(const BigInt& x) = default;\n inline BigInt& operator+=(const BigInt& rhs) noexcept {\n if(rhs.val.empty()) return *this;\n if(sign != rhs.sign) return *this -= -rhs;\n if(val.size() < rhs.val.size()){\n val.resize(rhs.val.size());\n }\n for(int i = 0; i < (int) rhs.val.size(); ++i){\n val[i] += rhs.val[i];\n }\n return (*this).shift();\n }\n inline BigInt& operator-=(const BigInt& rhs) noexcept {\n if(rhs.val.empty()) return *this;\n if(sign != rhs.sign) return *this += -rhs;\n if((sign == 1 ? *this : -(*this)) < (rhs.sign == 1 ? rhs : -rhs)){\n return *this = -(rhs - *this);\n }\n for(int i = 0; i < (int) rhs.val.size(); ++i){\n val[i] -= rhs.val[i];\n }\n \n shift();\n normalize();\n return *this;\n }\n // Karatsuba Algorithm (O(N^(1.58)))\n inline BigInt& operator*=(const BigInt& rhs) noexcept {\n if(val.empty() || rhs.val.empty()){\n return *this = BigInt();\n }\n\n sign *= rhs.sign;\n vector<long long> rhsval = rhs.val;\n int k = 1;\n while(k < (int) max(val.size(), rhsval.size())){\n k *= 2;\n }\n val.resize(k), rhsval.resize(k);\n val = karatsuba_algorithm(val, rhsval);\n\n shift();\n normalize();\n return *this;\n }\n // Newton method\n inline BigInt& operator/=(const BigInt& rhst) noexcept {\n assert(!rhst.val.empty());\n if(val.empty()) return *this;\n if((int) val.size() <= 32 && (int) rhst.val.size() <= 32){\n return *this = divide_naive(rhst).first;\n }\n\n BigInt rhs = rhst;\n int mulsign = sign * rhs.sign;\n sign = 1, rhs.sign = 1;\n if(*this < rhs){\n return *this = BigInt();\n }\n\n *this = divide_newton(rhs).first;\n sign = mulsign;\n normalize();\n return *this;\n }\n inline BigInt& operator%=(const BigInt& rhs) noexcept {\n assert(!rhs.val.empty());\n return *this = *this - (*this / rhs) * rhs;\n }\n inline BigInt& operator++() { return *this += 1; }\n inline BigInt operator++(int) {\n const BigInt res = *this;\n ++(*this);\n return res;\n }\n inline BigInt& operator--() { return *this -= 1; }\n inline BigInt operator--(int) {\n const BigInt res = *this;\n --(*this);\n return res;\n }\n inline BigInt operator+() const { return *this; }\n inline BigInt operator-() const {\n BigInt res = *this;\n if (!res.val.empty()) res.sign = -res.sign;\n return res;\n }\n inline BigInt& operator<<=(const unsigned int rhs){\n if(val.back() >= 1 || (int) val.size() >= 2){\n vector<long long> tmp(rhs, 0);\n val.insert(val.begin(), tmp.begin(), tmp.end());\n }\n return *this;\n }\n inline BigInt& operator>>=(const unsigned int rhs){\n if(rhs == 0) return *this;\n if(rhs > val.size()) val = {0};\n else val = vector<long long>(val.begin() + rhs, val.end()); \n return *this;\n }\n inline bool operator<(const BigInt& rhs) const {\n if(sign != rhs.sign) return sign < rhs.sign;\n if(val.size() != rhs.val.size()) return sign * val.size() < rhs.sign * rhs.val.size();\n for(int i = (int) val.size() - 1; i >= 0; --i){\n if(val[i] != rhs.val[i]) return sign * val[i] < rhs.sign * rhs.val[i];\n }\n return false;\n }\n inline bool operator>(const BigInt& rhs) const { return rhs < (*this); }\n inline bool operator<=(const BigInt& rhs) const { return !((*this) > rhs); }\n inline bool operator>=(const BigInt& rhs) const { return !((*this) < rhs); }\n friend inline BigInt operator+(const BigInt& lhs, const BigInt& rhs) noexcept { return BigInt(lhs) += rhs; }\n friend inline BigInt operator-(const BigInt& lhs, const BigInt& rhs) noexcept { return BigInt(lhs) -= rhs; }\n friend inline BigInt operator*(const BigInt& lhs, const BigInt& rhs) noexcept { return BigInt(lhs) *= rhs; }\n friend inline BigInt operator/(const BigInt& lhs, const BigInt& rhs) noexcept { return BigInt(lhs) /= rhs; }\n friend inline BigInt operator%(const BigInt& lhs, const BigInt& rhs) noexcept { return BigInt(lhs) %= rhs; }\n friend inline BigInt operator<<(const BigInt& lhs, const unsigned int rhs) noexcept { return BigInt(lhs) <<= rhs; }\n friend inline BigInt operator>>(const BigInt& lhs, const unsigned int rhs) noexcept { return BigInt(lhs) >>= rhs; }\n friend inline bool operator==(const BigInt& lhs, const BigInt& rhs) noexcept { return lhs.val == rhs.val; }\n friend inline bool operator!=(const BigInt& lhs, const BigInt& rhs) noexcept { return lhs.val != rhs.val; }\n friend inline istream& operator>>(istream& is, BigInt& x) noexcept {\n string s;\n is >> s;\n x.stoi(s);\n return is;\n }\n friend inline ostream& operator<<(ostream& os, const BigInt& x) noexcept { return os << x.itos(); }\n};\n\nusing bint = BigInt<1000000LL, 6>;\n\nstruct fraction{\n bint p, q;\n fraction(bint P = 0, bint Q = 1): p(P), q(Q){ }\n inline bool operator==(const fraction &other) const {\n return p * other.q == other.p * q;\n }\n inline bool operator!=(const fraction &other) const {\n return p * other.q != other.p * q;\n }\n inline bool operator<(const fraction &other) const {\n return p * other.q < other.p * q;\n }\n inline bool operator<=(const fraction &other) const {\n return p * other.q <= other.p * q;\n }\n inline bool operator>(const fraction &other) const {\n return p * other.q > other.p * q;\n }\n inline bool operator>=(const fraction &other) const {\n return p * other.q >= other.p * q;\n }\n inline fraction operator+(const fraction &other) const { return fraction(p * other.q + q * other.p, q * other.q); }\n inline fraction operator-(const fraction &other) const { return fraction(p * other.q - q * other.p, q * other.q); }\n inline fraction operator*(const fraction &other) const { return fraction(p * other.p, q * other.q); }\n inline fraction operator/(const fraction &other) const { return fraction(p * other.q, q * other.p); }\n inline fraction& operator+=(const fraction& rhs) noexcept {\n *this = *this + rhs;\n return *this;\n }\n inline fraction& operator-=(const fraction& rhs) noexcept {\n *this = *this - rhs;\n return *this;\n }\n inline fraction& operator*=(const fraction& rhs) noexcept {\n *this = *this * rhs;\n return *this;\n }\n inline fraction& operator/=(const fraction& rhs) noexcept {\n *this = *this / rhs;\n return *this;\n }\n friend inline istream& operator>>(istream& is, fraction& x) noexcept {\n is >> x.p;\n x.q = 1;\n return is;\n }\n friend inline ostream& operator<<(ostream& os, const fraction& x) noexcept { return os << x.p << \"/\" << x.q; }\n};\n\npair<fraction, fraction> SternBrocot(bint n, fraction p){\n fraction a(0, 1), b(1, 0);\n fraction x(0, 1), y(1, 0);\n bool ok_left = true, ok_right = true;\n while(ok_left && ok_right){\n fraction m(a.p + b.p, a.q + b.q);\n if(p < m * m){\n bint ok = 0, ng = n;\n while(ng - ok > 1){\n bint mid = (ok + ng) / 2;\n fraction m2(a.p * mid + b.p, a.q * mid + b.q);\n if(p < m2 * m2 && m2.p <= n && m2.q <= n){\n ok = mid;\n m = m2;\n }else{\n ng = mid;\n }\n }\n b = m;\n if(m.p <= n && m.q <= n){\n y = m;\n }else{\n ok_left = false;\n }\n }else{\n bint ok = 0, ng = n;\n while(ng - ok > 1){\n bint mid = (ok + ng) / 2;\n fraction m2(a.p + b.p * mid, a.q + b.q * mid);\n if(p >= m2 * m2 && m2.p <= n && m2.q <= n){\n ok = mid;\n m = m2;\n }else{\n ng = mid;\n }\n }\n a = m;\n if(m.p <= n && m.q <= n){\n x = m;\n }else{\n ok_right = false;\n }\n }\n }\n return make_pair(x, y);\n}\n\nvoid input(){\n}\n\nvoid solve(){\n while(1){\n bint p, n; in(p, n);\n if(p == 0 && n == 0) break;\n fraction pf(p, 1);\n auto [a, b] = SternBrocot(n, pf);\n out(b, a);\n }\n}\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(20);\n \n input();\n solve();\n}","accuracy":1,"time_ms":40,"memory_kb":3432,"score_of_the_acc":-1.0062,"final_rank":19},{"submission_id":"aoj_1208_5038849","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint gcd(int a, int b) { return b==0 ? a : gcd(b,a%b); }\n\nstruct Rational {\n int a,b;\n\n bool isnorm() { return gcd(a,b)==1; }\n\n bool operator<(const Rational& rhs) const {\n return 1.0*a*rhs.b<1.0*b*rhs.a;\n }\n};\n\nint solve() {\n int p,n;\n cin>>p>>n;\n if (p==0||n==0) return 0;\n\n double pp=sqrt(p);\n Rational lo={1,n}, hi={n,1};\n for (int b=1; b<=n; b++) {\n int a=(int)floor(b*pp);\n Rational l={a,b}, h={a+1,b};\n\n if (a<=n && l.isnorm() && lo<l) lo=l;\n if (a+1<=n && h.isnorm() && h<hi) hi=h;\n }\n\n cout<<hi.a<<'/'<<hi.b<<' '<<lo.a<<'/'<<lo.b<<'\\n';\n return 1;\n}\n\nint main() {\n while (solve());\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3104,"score_of_the_acc":-0.8554,"final_rank":12},{"submission_id":"aoj_1208_4834018","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <cmath>\nusing namespace std;\ntypedef long long int lli;\n\nint main(){\n while(1){\n lli p,n;\n cin >> p >> n;\n if(n == 0) break;\n\n lli lt=0,lb=1,ht=n,hb=1;\n for(int b=1; b<=n; b++){\n // t/b < sqrt(p)\n // t*t/b*b < p\n // t < sqrt(p*b*b)\n // この辺を雑に探索\n lli ul = n*n;\n lli a = p*b*b;\n lli tt = sqrt((long double)min(a, ul));\n for(lli i=-10; i<=10; i++){\n if(tt+i<0 or tt+i>n) continue;\n lli t = tt+i;\n if(t*t < p*b*b and 1.0l*t/b > 1.0l*lt/lb){\n lt = t;\n lb = b;\n }\n if(t*t > p*b*b and 1.0l*t/b < 1.0l*ht/hb){\n ht = t;\n hb = b;\n }\n }\n }\n cout << ht << \"/\" << hb << \" \" << lt << \"/\" << lb << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":260,"memory_kb":3072,"score_of_the_acc":-0.8928,"final_rank":15},{"submission_id":"aoj_1208_4180702","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <vector>\n#include <array>\n#include <string>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <unordered_map>\n#include <unordered_set>\n#include <set>\n#include <tuple>\n#include <cmath>\n#include <algorithm>\n#include <functional>\n#include <numeric>\n#include <cfloat>\n#include <climits>\n#include <cassert>\n#include <random>\n#include <fstream>\n\n\nint gcd(int a, int b) {\n\treturn b == 0 ? a : gcd(b, a % b);\n}\nstruct Rational {\n\tRational(int num, int den) : numerator{ num }, denominator{ den } {\n\t\tconst auto g = gcd(num, den);\n\t\tnumerator /= g;\n\t\tdenominator /= g;\n\t}\n\tRational(int value) : numerator{ value }, denominator{ 1 }{}\n\tint numerator, denominator;\n\tRational operator+(const Rational that) const {\n\t\treturn Rational(numerator * that.denominator + that.numerator * denominator, denominator * that.denominator);\n\t}\n\tbool operator<(const Rational that) const {\n\t\treturn numerator * that.denominator < denominator * that.numerator;\n\t}\n};\nstd::ostream& operator<<(std::ostream& os, const Rational& that) {\n\treturn os << that.numerator << '/' << that.denominator;\n}\nint main(){\n\twhile (true) {\n\t\tint prime, n; std::cin >> prime >> n; if (prime == 0) break;\n\t\tRational lower(1), upper(n);\n\t\tdouble sqrt = std::sqrt(prime);\n\t\tfor (auto i = 1; i <= n; ++i) {\n\t\t\tconst int l = sqrt * i;\n\t\t\tif (l <= n && lower < Rational(l, i)) {\n\t\t\t\tlower = Rational(l, i);\n\t\t\t}\n\t\t\tif (l + 1 <= n && Rational(l + 1, i) < upper) {\n\t\t\t\tupper = Rational(l + 1, i);\n\t\t\t}\n\t\t}\n\t\tstd::cout << upper << ' ' << lower << '\\n';\n\t}\n}","accuracy":1,"time_ms":10,"memory_kb":3032,"score_of_the_acc":-0.8236,"final_rank":7},{"submission_id":"aoj_1208_3427965","code_snippet":"#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<cfloat>\n#include<cmath>\nusing namespace std;\n\nint gcd(int a, int b){\n return b == 0 ? a : gcd(b, a%b);\n}\n\nint main(){\n int p, n;\n while(cin >> p >> n, p+n){\n double l = 0, r = DBL_MAX, sq = sqrt(p);\n int lc, lm, rc, rm;\n for(int m = 1; m <= n; m++){\n int ll = (int)(sq*m), rr = ceil(sq*m);\n if(ll < 1) ll = 1;\n if(rr < 1) rr = 1;\n if(ll > n) ll = n;\n if(rr > n) rr = n;\n if((double)ll/m < sq && (double)ll/m > l){\n l = (double)ll/m, lc = ll, lm = m;\n }\n if((double)rr/m > sq && (double)rr/m < r){\n r = (double)rr/m, rc = rr, rm = m;\n }\n }\n int g = gcd(lc, lm); lc /= g, lm /= g;\n g = gcd(rc, rm); rc /= g, rm /= g;\n printf(\"%d/%d %d/%d\\n\", rc, rm, lc, lm);\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3112,"score_of_the_acc":-0.8589,"final_rank":13},{"submission_id":"aoj_1208_3427964","code_snippet":"#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<cfloat>\n#include<cmath>\nusing namespace std;\n\nint gcd(int a, int b){\n return b == 0 ? a : gcd(b, a%b);\n}\n\n// 10000 * log(10000) * 2 ?\nint main(){\n int p, n;\n while(cin >> p >> n, p+n){\n double l = 0, r = DBL_MAX, sq = sqrt(p);\n int lc, lm, rc, rm;\n for(int m = 1; m <= n; m++){\n int ll = (int)(sq*m), rr = ceil(sq*m);\n if(ll < 1) ll = 1;\n if(rr < 1) rr = 1;\n if(ll > n) ll = n;\n if(rr > n) rr = n;\n if((double)ll/m < sq && (double)ll/m > l){\n l = (double)ll/m, lc = ll, lm = m;\n }\n if((double)rr/m > sq && (double)rr/m < r){\n r = (double)rr/m, rc = rr, rm = m;\n }\n }\n int g = gcd(lc, lm); lc /= g, lm /= g;\n g = gcd(rc, rm); rc /= g, rm /= g;\n printf(\"%d/%d %d/%d\\n\", rc, rm, lc, lm);\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3068,"score_of_the_acc":-0.8395,"final_rank":8},{"submission_id":"aoj_1208_2567897","code_snippet":"#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\nint calc(int x,int y){\n\tif(y == 0){\n\t\treturn x;\n\t}else{\n\t\treturn calc(y,x%y);\n\t}\n}\n\nint main(){\n\n\tint p,n,x,y,u,v,common;\n\tint left,right,m,tmp_bunshi;\n\tdouble sqrt_p,near_small,near_big;\n\tdouble tmp,tmp_small,tmp_big;\n\n\twhile(true){\n\t\tscanf(\"%d %d\",&p,&n);\n\t\tif(p == 0 && n == 0)break;\n\n\t\tnear_small = 0,near_big = DBL_MAX;\n\n\t\tsqrt_p = (double)sqrt(p);\n\n\t\tfor(int bunbo = 1; bunbo <= n; bunbo++){\n\n\t\t\tleft = 1,right = n, m = (left+right)/2;\n\t\t\ttmp_small = 0;\n\n\t\t\twhile(left <= right){\n\t\t\t\ttmp = (double)m/(double)bunbo;\n\n\t\t\t\tif(tmp < sqrt_p){\n\t\t\t\t\ttmp_small = tmp;\n\t\t\t\t\ttmp_bunshi = m;\n\t\t\t\t\tleft = m+1;\n\t\t\t\t}else{\n\t\t\t\t\tright = m-1;\n\t\t\t\t}\n\t\t\t\tm = (left+right)/2;\n\t\t\t}\n\t\t\tif(near_small < tmp_small){\n\t\t\t\tnear_small = tmp_small;\n\t\t\t\tu = tmp_bunshi;\n\t\t\t\tv = bunbo;\n\t\t\t}\n\n\t\t\tleft = 1,right = n, m = (left+right)/2;\n\t\t\ttmp_big = DBL_MAX;\n\n\t\t\twhile(left <= right){\n\t\t\t\ttmp = (double)m/(double)bunbo;\n\n\t\t\t\tif(tmp > sqrt_p){\n\t\t\t\t\ttmp_big = tmp;\n\t\t\t\t\ttmp_bunshi = m;\n\t\t\t\t\tright = m-1;\n\t\t\t\t}else{\n\t\t\t\t\tleft = m+1;\n\t\t\t\t}\n\t\t\t\tm = (left+right)/2;\n\t\t\t}\n\n\t\t\tif(near_big > tmp_big){\n\t\t\t\tnear_big = tmp_big;\n\t\t\t\tx = tmp_bunshi;\n\t\t\t\ty = bunbo;\n\t\t\t}\n\t\t}\n\n\t\tif(u >= v){\n\t\t\tcommon = calc(u,v);\n\t\t}else{\n\t\t\tcommon = calc(v,u);\n\t\t}\n\n\t\tu /= common;\n\t\tv /= common;\n\n\t\tif(x >= y){\n\t\t\tcommon = calc(x,y);\n\t\t}else{\n\t\t\tcommon = calc(y,x);\n\t\t}\n\n\t\tx /= common;\n\t\ty /= common;\n\n\t\tprintf(\"%d/%d %d/%d\\n\",x,y,u,v);\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":210,"memory_kb":3124,"score_of_the_acc":-0.9054,"final_rank":17},{"submission_id":"aoj_1208_2293940","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n double p;\n int n;\n while(cin>>p>>n,n){\n double t=sqrt(p);\n int x=0,y=1,u=1e9,v=1;\n for(int i=1;i<n;i++){\n int l=0,r=n+1,m;\n while(l<r){\n m=(l+r)/2;\n if(t<(1.0*m/i))r=m;\n else l=m+1;\n }\n if(x*i<(r-1)*y)x=r-1,y=i;\n if(r!=n+1&&u*i>v*r)u=r,v=i;\n }\n cout<<u<<'/'<<v<<' '<<x<<'/'<<y<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":100,"memory_kb":3156,"score_of_the_acc":-0.8969,"final_rank":16},{"submission_id":"aoj_1208_2293751","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef pair<double,pair<int,int> > VP;\nbool kyk(int,int);\nint main(){\n vector<int> jj(10005);\n for(int i=0;i<=10004;i++){\n jj[i]=i*i;\n }\n while(1){\n int p,n;\n cin >> p >> n;\n if(p==0&&n==0)break;\n vector<VP> sm;\n vector<VP> la;\n for(int i=1;i<=n;i++){\n VP pul;\n VP pus;\n pus.second.second=i;\n pul.second.second=i; \n int bns=lower_bound(jj.begin(),jj.end(),jj[i]*p)-jj.begin();\n if(bns-1>n)break;\n pul.second.first=jj[bns];\n pus.second.first=jj[bns-1];\n pul.first=(double)pul.second.first/(i*i);\n pus.first=(double)pus.second.first/(i*i);\n sm.push_back(pus);\n la.push_back(pul);\n }\n //cout << i*i << \" \"<< pus.first << endl;\n //cout << pul.first << endl << endl;\n sort(sm.begin(),sm.end());\n sort(la.begin(),la.end());\n for(int i=0;i<la.size();i++){\n if(kyk(la[i].second.first,la[i].second.second)&&la[i].second.first<=n*n){\n\tcout << (int)sqrt(la[i].second.first)<<\"/\"<<la[i].second.second<<\" \";\n\tbreak;\n }\n }\n for(int i=sm.size()-1;i>=0;i--){\n if(kyk(sm[i].second.first,sm[i].second.second)&&sm[i].second.first<=n*n){\n\tcout << (int)sqrt(sm[i].second.first)<<\"/\"<<sm[i].second.second<<endl;\n\tbreak;\n }\n }\t\n }\n \n return 0;\n}\nbool kyk(int a,int b){\n //cout << a << b <<endl;\n if(a==0||b==0)return 0;\n if(b!=1&&a==b*b)return 0;\n if(b!=1&&a%b==0)return 0;\n for(int i=2;i*i<=b*b;i++){\n if(a%i==0&&b%i==0)return 0;\n }\n return 1;\n}","accuracy":1,"time_ms":10,"memory_kb":3176,"score_of_the_acc":-0.8871,"final_rank":14},{"submission_id":"aoj_1208_2293738","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define int long long\nsigned main(){\n int p, n;\n while(cin >> p >> n, p || n) {\n int u = 1, v = 1, x = n, y = 1;\n for(int i = 1; i <= n; i++) {\n for(int j = u*i/v; j <= n; j++) {\n\tif(j*j <= p*i*i) {\n\t if(__gcd(i, j) != 1) continue;\n\t if(u*i - j*v < 0) u = j, v = i;\n\t} else {\n\t if(x*i - j*y > 0) x = j, y = i;\n\t break;\n\t}\n }\n }\n cout << x << \"/\" << y << \" \" << u << \"/\" << v << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3084,"score_of_the_acc":-0.8486,"final_rank":10},{"submission_id":"aoj_1208_2293579","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n double p;\n int n;\n while(cin>>p>>n,n){\n double t=sqrt(p);\n int x=0,y=1,u=1e9,v=1;\n for(int i=1;i<n;i++){\n int l=0,r=n+1,m;\n while(l<r){\n\tm=(l+r)/2;\n\tif(t<(1.0*m/i))r=m;\n\telse l=m+1;\n }\n if(x*i<(r-1)*y)x=r-1,y=i;\n if(r!=n+1&&u*i>v*r)u=r,v=i;\n }\n cout<<u<<'/'<<v<<' '<<x<<'/'<<y<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":100,"memory_kb":3200,"score_of_the_acc":-0.9163,"final_rank":18},{"submission_id":"aoj_1208_2062408","code_snippet":"#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\nusing ld = long double;\nconst ld eps = 1e-9;\n\n//// < \"d:\\d_download\\visual studio 2015\\projects\\programing_contest_c++\\debug\\a.txt\" > \"d:\\d_download\\visual studio 2015\\projects\\programing_contest_c++\\debug\\b.txt\"\n\n\nint main() {\n\twhile (1) {\n\t\tint p, n; cin >> p >> n;\n\t\tif (!p)break;\n\t\tpair<int, int>minp, maxp;\n\t\tld minsa = 1e9, maxsa = 1e9;\n\t\tfor (long long int bo = 1; bo <= n; ++bo) {\n\t\t\tld num = sqrt(ld(bo*bo) * p);\n\t\t\tfor (int si = max(1, int(num - 2)); si <= min(n, int(num + 1)); ++si) {\n\t\t\t\tif (si*si < bo*bo*p) {\n\t\t\t\t\tif (minsa >sqrt(p)-ld(si)/bo ) {\n\t\t\t\t\t\tminp = (make_pair(si, bo));\n\t\t\t\t\t\tminsa = sqrt(p) - ld(si) / bo;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse if (si*si > bo*bo*p) {\n\t\t\t\t\tif (maxsa > ld(si) / bo - sqrt(p)) {\n\t\t\t\t\t\tmaxp = make_pair(si, bo);\n\t\t\t\t\t\tmaxsa = ld(si) / bo - sqrt(p);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << maxp.first << \"/\" << maxp.second << \" \" << minp.first << '/' << minp.second << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":2964,"score_of_the_acc":-0.7957,"final_rank":6},{"submission_id":"aoj_1208_1886709","code_snippet":"#include<iostream>\n#include<vector>\n#include<string>\n#include<algorithm>\t\n#include<map>\n#include<set>\n#include<utility>\n#include<cmath>\n#include<cstring>\n#include<queue>\n#include<cstdio>\n#include<sstream>\n#include<iomanip>\n#define loop(i,a,b) for(int i=a;i<b;i++) \n#define rep(i,a) loop(i,0,a)\n#define pb push_back\n#define mp make_pair\n#define all(in) in.begin(),in.end()\n#define shosu(x) fixed<<setprecision(x)\nusing namespace std;\n//kaewasuretyuui\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<pii> vp;\ntypedef vector<vp> vvp;\ntypedef pair<int,pii> pip;\ntypedef vector<pip>vip;\nconst double PI=acos(-1);\nconst double EPS=1e-8;\nconst int inf=1e8;\nint gcd(int a,int b){\n\treturn (b==0?a:gcd(b,a%b));\n}\nint main(){\n\tint a,b;\n\twhile(cin>>a>>b,a+b){\n\t\tdouble q=sqrt(a);\n\t\tint c=1,d=1,e=1,f=inf;\n\t\tloop(i,1,b+1){\n\t\t\tint t=ceil(i/q);\n\t\t\tt--;\n\t\t\tif(q<(double)i/t&&(double)i/t<(double)f/e){\n\t\t\t\tf=i;e=t;\n\t\t\t\tint w=gcd(f,e);\n\t\t\t\tf/=w;t/=w;\n\t\t\t}\n\t\t\tt++;\n\t\t\tif(t!=0){\n\t\t\t\tif(q>(double)i/t&&(double)i/t>(double)d/c){\n\t\t\t\t\td=i;c=t;\n\t\t\t\t\tint w=gcd(d,c);\n\t\t\t\t\td/=w;c/=w;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout<<f<<\"/\"<<e<<\" \"<<d<<\"/\"<<c<<endl;\n\t}\n}","accuracy":1,"time_ms":70,"memory_kb":1164,"score_of_the_acc":-0.0124,"final_rank":1},{"submission_id":"aoj_1208_1874997","code_snippet":"#include <bits/stdc++.h>\n \nusing namespace std;\n \n#define INF 1e9\n \nclass Fraction{\npublic:;\n double numerator,denominator;\n double div();\n};\n \ndouble Fraction::div(){\n return numerator/denominator;\n}\n \nostream &operator << (ostream &os,const Fraction &f){\n os << f.numerator << '/' << f.denominator;\n return os;\n}\n \nint main(){\n double p;\n int n;\n while(cin >> p >> n, p){\n\tp = sqrt(p);\n\tFraction a = (Fraction){-1,1};\n\tFraction b = (Fraction){INF,1};\n\tfor(int den = 1 ; den <= n ; den++){\n\t int l = 0, r = n+1;\n\t while(l < r){\n\t\tdouble mid = (l + r) / 2;\n\t\tif(mid < p*den){\n\t\t if(mid/den > a.div()){\n\t\t\ta = (Fraction){mid,den};\n\t\t }\n\t\t l = mid+1;\n\t\t}else{\n\t\t r = mid;\n\t\t}\n\t }\n\t l = 0, r = n+1;\n\t while(l < r){\n\t\tdouble mid = (l + r) / 2;\n\t\tif(mid > p*den){\n\t\t if(mid/den < b.div()){\n\t\t\tb = (Fraction){mid,den};\n\t\t }\n\t\t r = mid;\n\t\t}else{\n\t\t l = mid+1;\n\t\t}\n\t }\n\t}\n\tcout << b << \" \" << a << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":370,"memory_kb":1284,"score_of_the_acc":-0.1271,"final_rank":3},{"submission_id":"aoj_1208_1803620","code_snippet":"#include<iostream>\n#include<cmath>\n#include<tuple>\nusing namespace std;\nint p, q;\nint main() {\n\twhile (true) {\n\t\tcin >> p >> q;\n\t\tif (p == 0 && q == 0)break;\n\t\ttuple<int, int, double>x, y;\n\t\tx = make_tuple(0, 0, 0);\n\t\ty = make_tuple(0, 0, 100000);\n\t\tdouble T = sqrt(1.0*p);\n\t\tfor (int i = 1; i <= q; i++) {\n\t\t\tdouble I = T*i;\n\t\t\tint J = I;\n\t\t\tdouble K = 1.0*J / i;\n\t\t\tdouble L = 1.0*(J + 1) / i;\n\t\t\tif (K > get<2>(x) && J <= q) {\n\t\t\t\tx = make_tuple(J, i, K);\n\t\t\t}\n\t\t\tif (L < get<2>(y) && J + 1 <= q) {\n\t\t\t\ty = make_tuple(J + 1, i, L);\n\t\t\t}\n\t\t}\n\t\tcout << get<0>(y) << '/' << get<1>(y) << ' ';\n\t\tcout << get<0>(x) << '/' << get<1>(x) << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3076,"score_of_the_acc":-0.8451,"final_rank":9},{"submission_id":"aoj_1208_1801348","code_snippet":"#include <cmath>\n#include <iostream>\nusing namespace std;\nint p, n; long double d;\nint main() {\n\twhile (cin >> p >> n, n) {\n\t\td = sqrtl(p);\n\t\tint p1 = 999999, q1 = 1, p2 = 0, q2 = 1;\n\t\tfor (int i = 1; i <= n; i++) {\n\t\t\tint j = i / d;\n\t\t\tif (0 < j && j <= n && 1.0L * i / j < 1.0L * p1 / q1) p1 = i, q1 = j;\n\t\t\tif (0 < (j + 1) && (j + 1) <= n && 1.0L * i / (j + 1) > 1.0L * p2 / q2) p2 = i, q2 = j + 1;\n\t\t}\n\t\tcout << p1 << '/' << q1 << ' ' << p2 << '/' << q2 << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3088,"score_of_the_acc":-0.8545,"final_rank":11},{"submission_id":"aoj_1208_1274074","code_snippet":"#include <iostream>\n#include <complex>\n#include <sstream>\n#include <string>\n#include <algorithm>\n#include <deque>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <vector>\n#include <set>\n#include <limits>\n#include <cstdio>\n#include <cctype>\n#include <cmath>\n#include <cstring>\n#include <cstdlib>\n#include <ctime>\nusing namespace std;\n#define REP(i, j) for(int i = 0; i < (int)(j); ++i)\n#define FOR(i, j, k) for(int i = (int)(j); i < (int)(k); ++i)\n#define SORT(v) sort((v).begin(), (v).end())\n#define REVERSE(v) reverse((v).begin(), (v).end())\nconst int INF = 10001;\n\nint gcd(int a, int b){ return (b == 0 ? a : gcd(b, a % b)); }\n\nclass R{\n public:\n double a, b;\n R(int aa, int bb) { a = aa; b = bb; int r; while((r = gcd(a, b)) != 1) { a /= r; b /= r; } }\n bool operator > (const R &r) const { return a / b > r.a / r.b; }\n bool operator < (const R &r) const { return a / b < r.a / r.b; }\n};\n\n\nint main() {\n double P;\n int N;\n while(cin >>P >>N && (P || N)){\n P = sqrt(P);\n R lower = R(-1, 1), upper = R(INF, 1);\n FOR(i, 1, N + 1){\n int l = 0, r = N + 1;\n while(r - l > 1){\n double m = (r + l) / 2;\n if(m / i >= P){\n r = m;\n upper = min(upper, R(r, i));\n }\n else{\n l = m;\n lower = max(lower, R(l, i));\n }\n }\n }\n cout <<upper.a <<\"/\" <<upper.b <<\" \" <<lower.a <<\"/\" <<lower.b <<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":2630,"memory_kb":1284,"score_of_the_acc":-0.5931,"final_rank":5},{"submission_id":"aoj_1208_1140042","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define INF 1e9\n\nclass Fraction{\npublic:;\n double numerator,denominator;\n double div();\n};\n\ndouble Fraction::div(){\n return numerator/denominator;\n}\n\nostream &operator << (ostream &os,const Fraction &f){\n os << f.numerator << '/' << f.denominator;\n return os;\n}\n\nint main(){\n double p;\n int n;\n while(cin >> p >> n, p){\n p = sqrt(p);\n Fraction a = (Fraction){-1,1};\n Fraction b = (Fraction){INF,1};\n for(int den = 1 ; den <= n ; den++){\n int l = 0, r = n+1;\n while(l < r){\n double mid = (l + r) / 2;\n if(mid < p*den){\n if(mid/den > a.div()){\n a = (Fraction){mid,den};\n }\n l = mid+1;\n }else{\n r = mid;\n }\n }\n l = 0, r = n+1;\n while(l < r){\n double mid = (l + r) / 2;\n if(mid > p*den){\n if(mid/den < b.div()){\n b = (Fraction){mid,den};\n }\n r = mid;\n }else{\n l = mid+1;\n }\n }\n }\n cout << b << \" \" << a << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":370,"memory_kb":1284,"score_of_the_acc":-0.1271,"final_rank":3},{"submission_id":"aoj_1208_1140040","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define INF 1e9\n\nclass Fraction{\npublic:;\n double numerator,denominator;\n double div();\n};\n\ndouble Fraction::div(){\n return numerator/denominator;\n}\n\nostream &operator << (ostream &os,const Fraction &f){\n os << f.numerator << '/' << f.denominator;\n return os;\n}\n\nint main(){\n double p;\n int n;\n while(cin >> p >> n, p){\n p = sqrt(p);\n Fraction a = (Fraction){-1,1};\n Fraction b = (Fraction){INF,1};\n for(int den = 1 ; den <= n ; den++){\n int l = 0, r = n+1;\n for(int i = 0 ; i < 150 ; i++){\n double mid = (l + r) / 2;\n if(mid < p*den){\n if(mid/den > a.div()){\n a = (Fraction){mid,den};\n }\n l = mid;\n }else{\n r = mid;\n }\n }\n l = 0, r = n+1;\n for(int i = 0 ; i < 150 ; i++){\n double mid = (l + r) / 2;\n if(mid > p*den){\n if(mid/den < b.div()){\n b = (Fraction){mid,den};\n }\n r = mid;\n }else{\n l = mid;\n }\n }\n }\n cout << b << \" \" << a << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":4860,"memory_kb":1288,"score_of_the_acc":-1.0547,"final_rank":20},{"submission_id":"aoj_1208_1139716","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define MAX 1000000007\n\nint main() {\n double p,n;\n while(cin >> p >> n) {\n if(p==0 && n==0) break;\n p=sqrt(p);\n int x=0,y=0,u=0,v=0;\n double a2=MAX,b2=MAX;\n for(int i=1; i<=n; i++) {\n int a=(int)(p*i);\n int b=a+1;\n if(a>n) break;\n if(__gcd(a,i)==1 && p-(double)a/i<a2) {\n\ta2=p-(double)a/i;\n\tu=a;v=i;\n }\n if(b>n) continue;\n if(__gcd(b,i)==1 && (double)b/i-p<b2) {\n\tb2=(double)b/i-p;\n\tx=b;y=i;\n }\n }\n printf(\"%d/%d %d/%d\\n\",x,y,u,v);\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1200,"score_of_the_acc":-0.0159,"final_rank":2}],"string":"[\n {\n \"submission_id\": \"aoj_1208_8658705\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define overload4(_1, _2, _3, _4, name, ...) name\\n#define rep1(n) for(int i = 0; i < (int)(n); ++i)\\n#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)\\n#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)\\n#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))\\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\\n\\n#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)\\n#define ALL(a) (a).begin(), (a).end()\\n#define Sort(a) (sort((a).begin(), (a).end()))\\n#define RSort(a) (sort((a).rbegin(), (a).rend()))\\n#define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end()))\\n\\ntypedef long long int ll;\\ntypedef unsigned long long ul;\\ntypedef long double ld;\\ntypedef vector<int> vi;\\ntypedef vector<long long> vll;\\ntypedef vector<char> vc;\\ntypedef vector<string> vst;\\ntypedef vector<double> vd;\\ntypedef vector<long double> vld;\\ntypedef pair<long long, long long> P;\\n\\ntemplate<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }\\ntemplate<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }\\ntemplate<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }\\n\\nconst long long MINF = 0x7fffffffffff;\\nconst long long INF = 0x1fffffffffffffff;\\nconst long long MOD = 998244353;\\nconst long double EPS = 1e-9;\\nconst long double PI = acos(-1);\\n \\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n\\ntemplate<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }\\ntemplate<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << \\\"(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\"; return os; }\\ntemplate<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }\\ntemplate<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? \\\" \\\" : \\\"\\\"); } return os; }\\ntemplate <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << \\\":\\\" << val << \\\" \\\"; } return os; }\\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? \\\" \\\" : \\\"\\\"); itr++; } return os; }\\ntemplate <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? \\\" \\\" : \\\"\\\"); itr++; } return os; }\\ntemplate <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << \\\" \\\"; q.pop(); } return os; }\\ntemplate <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << \\\" \\\"; q.pop_front(); } return os; }\\ntemplate <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << \\\" \\\"; st.pop(); } return os; }\\ntemplate <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << \\\" \\\"; pq.pop(); } return os; }\\n\\ntemplate<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }\\ntemplate<class T> inline void vout(T vec, string s = \\\"\\\\n\\\"){ for(auto x : vec) cout << x << s; }\\ntemplate<class... T> void in(T&... a){ (cin >> ... >> a); }\\nvoid out(){ cout << '\\\\n'; }\\ntemplate<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\\\\n'; }\\ntemplate<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }\\n\\ntemplate <long long base = 1000000LL, int digit = 6>\\nstruct BigInt{\\n int sign = 1;\\n vector<long long> val;\\n\\n constexpr BigInt(const long long _val = 0) noexcept {\\n if(_val != 0){\\n val.assign(1, abs(_val));\\n shift();\\n }\\n if(_val < 0) sign = -1;\\n }\\n constexpr BigInt(const vector<long long> &_val) noexcept : val(_val) {}\\n constexpr BigInt(const string &s) noexcept {\\n stoi(s);\\n }\\n\\nprivate:\\n void normalize(){\\n while(!val.empty() && val.back() == 0) val.pop_back();\\n if(val.empty()) sign = 1;\\n }\\n vector<long long> karatsuba_algorithm(vector<long long> &a, vector<long long> &b){\\n const int n = (int) a.size();\\n const int h = n >> 1;\\n assert(a.size() == b.size());\\n assert((n & (n - 1)) == 0);\\n if(n <= 64){\\n vector<long long> res(2 * n - 1);\\n for(int i = 0; i < n; ++i){\\n for(int j = 0; j < n; ++j){\\n res[i + j] += a[i] * b[j];\\n }\\n }\\n return res;\\n }\\n vector<long long> p(h), q(h), r(h), s(h), t(h), u(h);\\n for(int i = 0; i < h; ++i){\\n p[i] = a[i + h];\\n q[i] = a[i];\\n r[i] = b[i + h];\\n s[i] = b[i];\\n t[i] = p[i] + q[i];\\n u[i] = r[i] + s[i];\\n }\\n p = karatsuba_algorithm(p, r);\\n q = karatsuba_algorithm(q, s);\\n t = karatsuba_algorithm(t, u);\\n vector<long long> res(2 * n - 1, 0);\\n for(int i = 0; i < n - 1; ++i){\\n res[i] += q[i];\\n res[i + h] += t[i] - p[i] - q[i];\\n res[i + n] += p[i];\\n }\\n return res;\\n }\\n\\n pair<BigInt, BigInt> divide_naive(const BigInt& rhs) const {\\n assert(!rhs.val.empty());\\n const int k = base / (rhs.val.back() + 1);\\n const BigInt dividend = (sign == 1 ? *this : -(*this)) * k;\\n const BigInt divisor = (rhs.sign == 1 ? rhs : -rhs) * k;\\n BigInt quo, rem = 0;\\n quo.val.resize(dividend.val.size());\\n const int n = divisor.val.size();\\n for(int i = (int) dividend.val.size() - 1; i >= 0; --i){\\n rem.val.emplace(rem.val.begin(), dividend.val[i]);\\n quo.val[i] = ((n < (int) rem.val.size() ? rem.val[n] * base : 0) + ((n - 1) < (int) rem.val.size() ? rem.val[n - 1] : 0)) / divisor.val.back();\\n rem -= divisor * quo.val[i];\\n while (rem.sign == -1) {\\n rem += divisor;\\n --quo.val[i];\\n }\\n }\\n quo.sign = sign * rhs.sign;\\n quo.normalize();\\n rem.sign = sign;\\n rem.normalize();\\n return {quo, rem / k};\\n }\\n\\n pair<BigInt, BigInt> divide_newton(const BigInt& rhs) const {\\n assert(!rhs.val.empty());\\n int preci = val.size() - rhs.val.size();\\n BigInt t(1);\\n BigInt two = BigInt(2) << rhs.val.size();\\n BigInt pre;\\n int lim = min(preci, 3);\\n int rhslim = min(int(rhs.val.size()), 6);\\n t <<= lim;\\n while(pre != t){\\n BigInt rb = rhs >> (rhs.val.size() - rhslim);\\n if(rhslim != (int) rhs.val.size()) rb += BigInt(1);\\n pre = t;\\n t *= (BigInt(2) << (rhslim + lim)) - rb * t;\\n t.val = vector<long long>(t.val.begin() + lim + rhslim, t.val.end());\\n }\\n if(lim != preci){\\n pre = BigInt();\\n while(pre != t){\\n BigInt rb = rhs >> (rhs.val.size() - rhslim);\\n if(rhslim != (int) rhs.val.size()) rb += BigInt(1);\\n pre = t;\\n t *= (BigInt(2) << (rhslim + lim)) - rb * t;\\n t.val = vector<long long>(t.val.begin() + lim + rhslim, t.val.end());\\n int next_lim = min(lim * 2 + 1, preci);\\n if (next_lim != lim) t <<= next_lim - lim;\\n int next_rhslim = min(rhslim * 2 + 1, int(rhs.val.size()));\\n lim = next_lim;\\n rhslim = next_rhslim;\\n }\\n }\\n BigInt quo = (*this) * t;\\n quo.val = vector<long long>(quo.val.begin() + val.size(), quo.val.end());\\n BigInt mul = quo * rhs;\\n while(mul + rhs <= (*this)){\\n quo += BigInt(1);\\n mul += rhs;\\n }\\n BigInt rem = *this - quo * rhs;\\n return {quo, rem};\\n }\\n\\npublic:\\n void stoi(string &s){\\n if(s == \\\"0\\\") return;\\n int n = s.size(), idx = 0;\\n if(s[0] == '-'){\\n n -= 1;\\n sign = -1;\\n idx = 1;\\n }\\n int len = (n + digit - 1) / digit, rem = n % digit;\\n if(rem == 0) rem += digit;\\n val.resize(len);\\n for(int i = len - 1; i >= 0; --i){\\n if(i == len - 1){\\n val[i] = stoll(s.substr(idx, rem));\\n idx += rem;\\n }else{\\n val[i] = stoll(s.substr(idx, digit));\\n idx += digit;\\n }\\n }\\n }\\n string itos() const {\\n string res = \\\"\\\";\\n if(sign == -1) res += \\\"-\\\";\\n bool flag = false;\\n for(int i = (int) val.size() - 1; i >= 0; --i){\\n if(val[i] > 0 && !flag){\\n res += to_string(val[i]);\\n flag = true;\\n }else if(flag){\\n string rem = to_string(val[i]);\\n res += string(digit - rem.size(), '0') + rem;\\n }\\n }\\n return (res.empty() || res == \\\"-\\\") ? \\\"0\\\" : res;\\n }\\n pair<BigInt, BigInt> divide_mod(const BigInt& rhs){\\n assert(!rhs.val.empty());\\n BigInt div = *this / rhs;\\n return make_pair(div, *this - div * rhs);\\n }\\n BigInt& shift(){\\n for(int i = 0; i < (int) val.size() - 1; ++i){\\n if(val[i] >= 0){\\n val[i + 1] += val[i] / base;\\n val[i] %= base;\\n }else{\\n long long x = (-val[i] + base - 1) / base;\\n val[i] += x * base;\\n val[i + 1] -= x;\\n }\\n }\\n while(val.back() >= base){\\n val.emplace_back(val.back() / base);\\n val[val.size() - 2] %= base;\\n }\\n return *this;\\n }\\n BigInt& operator=(const BigInt& x) = default;\\n inline BigInt& operator+=(const BigInt& rhs) noexcept {\\n if(rhs.val.empty()) return *this;\\n if(sign != rhs.sign) return *this -= -rhs;\\n if(val.size() < rhs.val.size()){\\n val.resize(rhs.val.size());\\n }\\n for(int i = 0; i < (int) rhs.val.size(); ++i){\\n val[i] += rhs.val[i];\\n }\\n return (*this).shift();\\n }\\n inline BigInt& operator-=(const BigInt& rhs) noexcept {\\n if(rhs.val.empty()) return *this;\\n if(sign != rhs.sign) return *this += -rhs;\\n if((sign == 1 ? *this : -(*this)) < (rhs.sign == 1 ? rhs : -rhs)){\\n return *this = -(rhs - *this);\\n }\\n for(int i = 0; i < (int) rhs.val.size(); ++i){\\n val[i] -= rhs.val[i];\\n }\\n \\n shift();\\n normalize();\\n return *this;\\n }\\n // Karatsuba Algorithm (O(N^(1.58)))\\n inline BigInt& operator*=(const BigInt& rhs) noexcept {\\n if(val.empty() || rhs.val.empty()){\\n return *this = BigInt();\\n }\\n\\n sign *= rhs.sign;\\n vector<long long> rhsval = rhs.val;\\n int k = 1;\\n while(k < (int) max(val.size(), rhsval.size())){\\n k *= 2;\\n }\\n val.resize(k), rhsval.resize(k);\\n val = karatsuba_algorithm(val, rhsval);\\n\\n shift();\\n normalize();\\n return *this;\\n }\\n // Newton method\\n inline BigInt& operator/=(const BigInt& rhst) noexcept {\\n assert(!rhst.val.empty());\\n if(val.empty()) return *this;\\n if((int) val.size() <= 32 && (int) rhst.val.size() <= 32){\\n return *this = divide_naive(rhst).first;\\n }\\n\\n BigInt rhs = rhst;\\n int mulsign = sign * rhs.sign;\\n sign = 1, rhs.sign = 1;\\n if(*this < rhs){\\n return *this = BigInt();\\n }\\n\\n *this = divide_newton(rhs).first;\\n sign = mulsign;\\n normalize();\\n return *this;\\n }\\n inline BigInt& operator%=(const BigInt& rhs) noexcept {\\n assert(!rhs.val.empty());\\n return *this = *this - (*this / rhs) * rhs;\\n }\\n inline BigInt& operator++() { return *this += 1; }\\n inline BigInt operator++(int) {\\n const BigInt res = *this;\\n ++(*this);\\n return res;\\n }\\n inline BigInt& operator--() { return *this -= 1; }\\n inline BigInt operator--(int) {\\n const BigInt res = *this;\\n --(*this);\\n return res;\\n }\\n inline BigInt operator+() const { return *this; }\\n inline BigInt operator-() const {\\n BigInt res = *this;\\n if (!res.val.empty()) res.sign = -res.sign;\\n return res;\\n }\\n inline BigInt& operator<<=(const unsigned int rhs){\\n if(val.back() >= 1 || (int) val.size() >= 2){\\n vector<long long> tmp(rhs, 0);\\n val.insert(val.begin(), tmp.begin(), tmp.end());\\n }\\n return *this;\\n }\\n inline BigInt& operator>>=(const unsigned int rhs){\\n if(rhs == 0) return *this;\\n if(rhs > val.size()) val = {0};\\n else val = vector<long long>(val.begin() + rhs, val.end()); \\n return *this;\\n }\\n inline bool operator<(const BigInt& rhs) const {\\n if(sign != rhs.sign) return sign < rhs.sign;\\n if(val.size() != rhs.val.size()) return sign * val.size() < rhs.sign * rhs.val.size();\\n for(int i = (int) val.size() - 1; i >= 0; --i){\\n if(val[i] != rhs.val[i]) return sign * val[i] < rhs.sign * rhs.val[i];\\n }\\n return false;\\n }\\n inline bool operator>(const BigInt& rhs) const { return rhs < (*this); }\\n inline bool operator<=(const BigInt& rhs) const { return !((*this) > rhs); }\\n inline bool operator>=(const BigInt& rhs) const { return !((*this) < rhs); }\\n friend inline BigInt operator+(const BigInt& lhs, const BigInt& rhs) noexcept { return BigInt(lhs) += rhs; }\\n friend inline BigInt operator-(const BigInt& lhs, const BigInt& rhs) noexcept { return BigInt(lhs) -= rhs; }\\n friend inline BigInt operator*(const BigInt& lhs, const BigInt& rhs) noexcept { return BigInt(lhs) *= rhs; }\\n friend inline BigInt operator/(const BigInt& lhs, const BigInt& rhs) noexcept { return BigInt(lhs) /= rhs; }\\n friend inline BigInt operator%(const BigInt& lhs, const BigInt& rhs) noexcept { return BigInt(lhs) %= rhs; }\\n friend inline BigInt operator<<(const BigInt& lhs, const unsigned int rhs) noexcept { return BigInt(lhs) <<= rhs; }\\n friend inline BigInt operator>>(const BigInt& lhs, const unsigned int rhs) noexcept { return BigInt(lhs) >>= rhs; }\\n friend inline bool operator==(const BigInt& lhs, const BigInt& rhs) noexcept { return lhs.val == rhs.val; }\\n friend inline bool operator!=(const BigInt& lhs, const BigInt& rhs) noexcept { return lhs.val != rhs.val; }\\n friend inline istream& operator>>(istream& is, BigInt& x) noexcept {\\n string s;\\n is >> s;\\n x.stoi(s);\\n return is;\\n }\\n friend inline ostream& operator<<(ostream& os, const BigInt& x) noexcept { return os << x.itos(); }\\n};\\n\\nusing bint = BigInt<1000000LL, 6>;\\n\\nstruct fraction{\\n bint p, q;\\n fraction(bint P = 0, bint Q = 1): p(P), q(Q){ }\\n inline bool operator==(const fraction &other) const {\\n return p * other.q == other.p * q;\\n }\\n inline bool operator!=(const fraction &other) const {\\n return p * other.q != other.p * q;\\n }\\n inline bool operator<(const fraction &other) const {\\n return p * other.q < other.p * q;\\n }\\n inline bool operator<=(const fraction &other) const {\\n return p * other.q <= other.p * q;\\n }\\n inline bool operator>(const fraction &other) const {\\n return p * other.q > other.p * q;\\n }\\n inline bool operator>=(const fraction &other) const {\\n return p * other.q >= other.p * q;\\n }\\n inline fraction operator+(const fraction &other) const { return fraction(p * other.q + q * other.p, q * other.q); }\\n inline fraction operator-(const fraction &other) const { return fraction(p * other.q - q * other.p, q * other.q); }\\n inline fraction operator*(const fraction &other) const { return fraction(p * other.p, q * other.q); }\\n inline fraction operator/(const fraction &other) const { return fraction(p * other.q, q * other.p); }\\n inline fraction& operator+=(const fraction& rhs) noexcept {\\n *this = *this + rhs;\\n return *this;\\n }\\n inline fraction& operator-=(const fraction& rhs) noexcept {\\n *this = *this - rhs;\\n return *this;\\n }\\n inline fraction& operator*=(const fraction& rhs) noexcept {\\n *this = *this * rhs;\\n return *this;\\n }\\n inline fraction& operator/=(const fraction& rhs) noexcept {\\n *this = *this / rhs;\\n return *this;\\n }\\n friend inline istream& operator>>(istream& is, fraction& x) noexcept {\\n is >> x.p;\\n x.q = 1;\\n return is;\\n }\\n friend inline ostream& operator<<(ostream& os, const fraction& x) noexcept { return os << x.p << \\\"/\\\" << x.q; }\\n};\\n\\npair<fraction, fraction> SternBrocot(bint n, fraction p){\\n fraction a(0, 1), b(1, 0);\\n fraction x(0, 1), y(1, 0);\\n bool ok_left = true, ok_right = true;\\n while(ok_left && ok_right){\\n fraction m(a.p + b.p, a.q + b.q);\\n if(p < m * m){\\n bint ok = 0, ng = n;\\n while(ng - ok > 1){\\n bint mid = (ok + ng) / 2;\\n fraction m2(a.p * mid + b.p, a.q * mid + b.q);\\n if(p < m2 * m2 && m2.p <= n && m2.q <= n){\\n ok = mid;\\n m = m2;\\n }else{\\n ng = mid;\\n }\\n }\\n b = m;\\n if(m.p <= n && m.q <= n){\\n y = m;\\n }else{\\n ok_left = false;\\n }\\n }else{\\n bint ok = 0, ng = n;\\n while(ng - ok > 1){\\n bint mid = (ok + ng) / 2;\\n fraction m2(a.p + b.p * mid, a.q + b.q * mid);\\n if(p >= m2 * m2 && m2.p <= n && m2.q <= n){\\n ok = mid;\\n m = m2;\\n }else{\\n ng = mid;\\n }\\n }\\n a = m;\\n if(m.p <= n && m.q <= n){\\n x = m;\\n }else{\\n ok_right = false;\\n }\\n }\\n }\\n return make_pair(x, y);\\n}\\n\\nvoid input(){\\n}\\n\\nvoid solve(){\\n while(1){\\n bint p, n; in(p, n);\\n if(p == 0 && n == 0) break;\\n fraction pf(p, 1);\\n auto [a, b] = SternBrocot(n, pf);\\n out(b, a);\\n }\\n}\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(20);\\n \\n input();\\n solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3432,\n \"score_of_the_acc\": -1.0062,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1208_5038849\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint gcd(int a, int b) { return b==0 ? a : gcd(b,a%b); }\\n\\nstruct Rational {\\n int a,b;\\n\\n bool isnorm() { return gcd(a,b)==1; }\\n\\n bool operator<(const Rational& rhs) const {\\n return 1.0*a*rhs.b<1.0*b*rhs.a;\\n }\\n};\\n\\nint solve() {\\n int p,n;\\n cin>>p>>n;\\n if (p==0||n==0) return 0;\\n\\n double pp=sqrt(p);\\n Rational lo={1,n}, hi={n,1};\\n for (int b=1; b<=n; b++) {\\n int a=(int)floor(b*pp);\\n Rational l={a,b}, h={a+1,b};\\n\\n if (a<=n && l.isnorm() && lo<l) lo=l;\\n if (a+1<=n && h.isnorm() && h<hi) hi=h;\\n }\\n\\n cout<<hi.a<<'/'<<hi.b<<' '<<lo.a<<'/'<<lo.b<<'\\\\n';\\n return 1;\\n}\\n\\nint main() {\\n while (solve());\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3104,\n \"score_of_the_acc\": -0.8554,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1208_4834018\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <cmath>\\nusing namespace std;\\ntypedef long long int lli;\\n\\nint main(){\\n while(1){\\n lli p,n;\\n cin >> p >> n;\\n if(n == 0) break;\\n\\n lli lt=0,lb=1,ht=n,hb=1;\\n for(int b=1; b<=n; b++){\\n // t/b < sqrt(p)\\n // t*t/b*b < p\\n // t < sqrt(p*b*b)\\n // この辺を雑に探索\\n lli ul = n*n;\\n lli a = p*b*b;\\n lli tt = sqrt((long double)min(a, ul));\\n for(lli i=-10; i<=10; i++){\\n if(tt+i<0 or tt+i>n) continue;\\n lli t = tt+i;\\n if(t*t < p*b*b and 1.0l*t/b > 1.0l*lt/lb){\\n lt = t;\\n lb = b;\\n }\\n if(t*t > p*b*b and 1.0l*t/b < 1.0l*ht/hb){\\n ht = t;\\n hb = b;\\n }\\n }\\n }\\n cout << ht << \\\"/\\\" << hb << \\\" \\\" << lt << \\\"/\\\" << lb << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 260,\n \"memory_kb\": 3072,\n \"score_of_the_acc\": -0.8928,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1208_4180702\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <vector>\\n#include <array>\\n#include <string>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <set>\\n#include <tuple>\\n#include <cmath>\\n#include <algorithm>\\n#include <functional>\\n#include <numeric>\\n#include <cfloat>\\n#include <climits>\\n#include <cassert>\\n#include <random>\\n#include <fstream>\\n\\n\\nint gcd(int a, int b) {\\n\\treturn b == 0 ? a : gcd(b, a % b);\\n}\\nstruct Rational {\\n\\tRational(int num, int den) : numerator{ num }, denominator{ den } {\\n\\t\\tconst auto g = gcd(num, den);\\n\\t\\tnumerator /= g;\\n\\t\\tdenominator /= g;\\n\\t}\\n\\tRational(int value) : numerator{ value }, denominator{ 1 }{}\\n\\tint numerator, denominator;\\n\\tRational operator+(const Rational that) const {\\n\\t\\treturn Rational(numerator * that.denominator + that.numerator * denominator, denominator * that.denominator);\\n\\t}\\n\\tbool operator<(const Rational that) const {\\n\\t\\treturn numerator * that.denominator < denominator * that.numerator;\\n\\t}\\n};\\nstd::ostream& operator<<(std::ostream& os, const Rational& that) {\\n\\treturn os << that.numerator << '/' << that.denominator;\\n}\\nint main(){\\n\\twhile (true) {\\n\\t\\tint prime, n; std::cin >> prime >> n; if (prime == 0) break;\\n\\t\\tRational lower(1), upper(n);\\n\\t\\tdouble sqrt = std::sqrt(prime);\\n\\t\\tfor (auto i = 1; i <= n; ++i) {\\n\\t\\t\\tconst int l = sqrt * i;\\n\\t\\t\\tif (l <= n && lower < Rational(l, i)) {\\n\\t\\t\\t\\tlower = Rational(l, i);\\n\\t\\t\\t}\\n\\t\\t\\tif (l + 1 <= n && Rational(l + 1, i) < upper) {\\n\\t\\t\\t\\tupper = Rational(l + 1, i);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tstd::cout << upper << ' ' << lower << '\\\\n';\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3032,\n \"score_of_the_acc\": -0.8236,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1208_3427965\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<algorithm>\\n#include<cfloat>\\n#include<cmath>\\nusing namespace std;\\n\\nint gcd(int a, int b){\\n return b == 0 ? a : gcd(b, a%b);\\n}\\n\\nint main(){\\n int p, n;\\n while(cin >> p >> n, p+n){\\n double l = 0, r = DBL_MAX, sq = sqrt(p);\\n int lc, lm, rc, rm;\\n for(int m = 1; m <= n; m++){\\n int ll = (int)(sq*m), rr = ceil(sq*m);\\n if(ll < 1) ll = 1;\\n if(rr < 1) rr = 1;\\n if(ll > n) ll = n;\\n if(rr > n) rr = n;\\n if((double)ll/m < sq && (double)ll/m > l){\\n l = (double)ll/m, lc = ll, lm = m;\\n }\\n if((double)rr/m > sq && (double)rr/m < r){\\n r = (double)rr/m, rc = rr, rm = m;\\n }\\n }\\n int g = gcd(lc, lm); lc /= g, lm /= g;\\n g = gcd(rc, rm); rc /= g, rm /= g;\\n printf(\\\"%d/%d %d/%d\\\\n\\\", rc, rm, lc, lm);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3112,\n \"score_of_the_acc\": -0.8589,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1208_3427964\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<algorithm>\\n#include<cfloat>\\n#include<cmath>\\nusing namespace std;\\n\\nint gcd(int a, int b){\\n return b == 0 ? a : gcd(b, a%b);\\n}\\n\\n// 10000 * log(10000) * 2 ?\\nint main(){\\n int p, n;\\n while(cin >> p >> n, p+n){\\n double l = 0, r = DBL_MAX, sq = sqrt(p);\\n int lc, lm, rc, rm;\\n for(int m = 1; m <= n; m++){\\n int ll = (int)(sq*m), rr = ceil(sq*m);\\n if(ll < 1) ll = 1;\\n if(rr < 1) rr = 1;\\n if(ll > n) ll = n;\\n if(rr > n) rr = n;\\n if((double)ll/m < sq && (double)ll/m > l){\\n l = (double)ll/m, lc = ll, lm = m;\\n }\\n if((double)rr/m > sq && (double)rr/m < r){\\n r = (double)rr/m, rc = rr, rm = m;\\n }\\n }\\n int g = gcd(lc, lm); lc /= g, lm /= g;\\n g = gcd(rc, rm); rc /= g, rm /= g;\\n printf(\\\"%d/%d %d/%d\\\\n\\\", rc, rm, lc, lm);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3068,\n \"score_of_the_acc\": -0.8395,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1208_2567897\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <set>\\n#include <map>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\nint calc(int x,int y){\\n\\tif(y == 0){\\n\\t\\treturn x;\\n\\t}else{\\n\\t\\treturn calc(y,x%y);\\n\\t}\\n}\\n\\nint main(){\\n\\n\\tint p,n,x,y,u,v,common;\\n\\tint left,right,m,tmp_bunshi;\\n\\tdouble sqrt_p,near_small,near_big;\\n\\tdouble tmp,tmp_small,tmp_big;\\n\\n\\twhile(true){\\n\\t\\tscanf(\\\"%d %d\\\",&p,&n);\\n\\t\\tif(p == 0 && n == 0)break;\\n\\n\\t\\tnear_small = 0,near_big = DBL_MAX;\\n\\n\\t\\tsqrt_p = (double)sqrt(p);\\n\\n\\t\\tfor(int bunbo = 1; bunbo <= n; bunbo++){\\n\\n\\t\\t\\tleft = 1,right = n, m = (left+right)/2;\\n\\t\\t\\ttmp_small = 0;\\n\\n\\t\\t\\twhile(left <= right){\\n\\t\\t\\t\\ttmp = (double)m/(double)bunbo;\\n\\n\\t\\t\\t\\tif(tmp < sqrt_p){\\n\\t\\t\\t\\t\\ttmp_small = tmp;\\n\\t\\t\\t\\t\\ttmp_bunshi = m;\\n\\t\\t\\t\\t\\tleft = m+1;\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\tright = m-1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tm = (left+right)/2;\\n\\t\\t\\t}\\n\\t\\t\\tif(near_small < tmp_small){\\n\\t\\t\\t\\tnear_small = tmp_small;\\n\\t\\t\\t\\tu = tmp_bunshi;\\n\\t\\t\\t\\tv = bunbo;\\n\\t\\t\\t}\\n\\n\\t\\t\\tleft = 1,right = n, m = (left+right)/2;\\n\\t\\t\\ttmp_big = DBL_MAX;\\n\\n\\t\\t\\twhile(left <= right){\\n\\t\\t\\t\\ttmp = (double)m/(double)bunbo;\\n\\n\\t\\t\\t\\tif(tmp > sqrt_p){\\n\\t\\t\\t\\t\\ttmp_big = tmp;\\n\\t\\t\\t\\t\\ttmp_bunshi = m;\\n\\t\\t\\t\\t\\tright = m-1;\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\tleft = m+1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tm = (left+right)/2;\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(near_big > tmp_big){\\n\\t\\t\\t\\tnear_big = tmp_big;\\n\\t\\t\\t\\tx = tmp_bunshi;\\n\\t\\t\\t\\ty = bunbo;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(u >= v){\\n\\t\\t\\tcommon = calc(u,v);\\n\\t\\t}else{\\n\\t\\t\\tcommon = calc(v,u);\\n\\t\\t}\\n\\n\\t\\tu /= common;\\n\\t\\tv /= common;\\n\\n\\t\\tif(x >= y){\\n\\t\\t\\tcommon = calc(x,y);\\n\\t\\t}else{\\n\\t\\t\\tcommon = calc(y,x);\\n\\t\\t}\\n\\n\\t\\tx /= common;\\n\\t\\ty /= common;\\n\\n\\t\\tprintf(\\\"%d/%d %d/%d\\\\n\\\",x,y,u,v);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 3124,\n \"score_of_the_acc\": -0.9054,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1208_2293940\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nint main(){\\n double p;\\n int n;\\n while(cin>>p>>n,n){\\n double t=sqrt(p);\\n int x=0,y=1,u=1e9,v=1;\\n for(int i=1;i<n;i++){\\n int l=0,r=n+1,m;\\n while(l<r){\\n m=(l+r)/2;\\n if(t<(1.0*m/i))r=m;\\n else l=m+1;\\n }\\n if(x*i<(r-1)*y)x=r-1,y=i;\\n if(r!=n+1&&u*i>v*r)u=r,v=i;\\n }\\n cout<<u<<'/'<<v<<' '<<x<<'/'<<y<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 3156,\n \"score_of_the_acc\": -0.8969,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1208_2293751\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef pair<double,pair<int,int> > VP;\\nbool kyk(int,int);\\nint main(){\\n vector<int> jj(10005);\\n for(int i=0;i<=10004;i++){\\n jj[i]=i*i;\\n }\\n while(1){\\n int p,n;\\n cin >> p >> n;\\n if(p==0&&n==0)break;\\n vector<VP> sm;\\n vector<VP> la;\\n for(int i=1;i<=n;i++){\\n VP pul;\\n VP pus;\\n pus.second.second=i;\\n pul.second.second=i; \\n int bns=lower_bound(jj.begin(),jj.end(),jj[i]*p)-jj.begin();\\n if(bns-1>n)break;\\n pul.second.first=jj[bns];\\n pus.second.first=jj[bns-1];\\n pul.first=(double)pul.second.first/(i*i);\\n pus.first=(double)pus.second.first/(i*i);\\n sm.push_back(pus);\\n la.push_back(pul);\\n }\\n //cout << i*i << \\\" \\\"<< pus.first << endl;\\n //cout << pul.first << endl << endl;\\n sort(sm.begin(),sm.end());\\n sort(la.begin(),la.end());\\n for(int i=0;i<la.size();i++){\\n if(kyk(la[i].second.first,la[i].second.second)&&la[i].second.first<=n*n){\\n\\tcout << (int)sqrt(la[i].second.first)<<\\\"/\\\"<<la[i].second.second<<\\\" \\\";\\n\\tbreak;\\n }\\n }\\n for(int i=sm.size()-1;i>=0;i--){\\n if(kyk(sm[i].second.first,sm[i].second.second)&&sm[i].second.first<=n*n){\\n\\tcout << (int)sqrt(sm[i].second.first)<<\\\"/\\\"<<sm[i].second.second<<endl;\\n\\tbreak;\\n }\\n }\\t\\n }\\n \\n return 0;\\n}\\nbool kyk(int a,int b){\\n //cout << a << b <<endl;\\n if(a==0||b==0)return 0;\\n if(b!=1&&a==b*b)return 0;\\n if(b!=1&&a%b==0)return 0;\\n for(int i=2;i*i<=b*b;i++){\\n if(a%i==0&&b%i==0)return 0;\\n }\\n return 1;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3176,\n \"score_of_the_acc\": -0.8871,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1208_2293738\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define int long long\\nsigned main(){\\n int p, n;\\n while(cin >> p >> n, p || n) {\\n int u = 1, v = 1, x = n, y = 1;\\n for(int i = 1; i <= n; i++) {\\n for(int j = u*i/v; j <= n; j++) {\\n\\tif(j*j <= p*i*i) {\\n\\t if(__gcd(i, j) != 1) continue;\\n\\t if(u*i - j*v < 0) u = j, v = i;\\n\\t} else {\\n\\t if(x*i - j*y > 0) x = j, y = i;\\n\\t break;\\n\\t}\\n }\\n }\\n cout << x << \\\"/\\\" << y << \\\" \\\" << u << \\\"/\\\" << v << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3084,\n \"score_of_the_acc\": -0.8486,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1208_2293579\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nint main(){\\n double p;\\n int n;\\n while(cin>>p>>n,n){\\n double t=sqrt(p);\\n int x=0,y=1,u=1e9,v=1;\\n for(int i=1;i<n;i++){\\n int l=0,r=n+1,m;\\n while(l<r){\\n\\tm=(l+r)/2;\\n\\tif(t<(1.0*m/i))r=m;\\n\\telse l=m+1;\\n }\\n if(x*i<(r-1)*y)x=r-1,y=i;\\n if(r!=n+1&&u*i>v*r)u=r,v=i;\\n }\\n cout<<u<<'/'<<v<<' '<<x<<'/'<<y<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 3200,\n \"score_of_the_acc\": -0.9163,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1208_2062408\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\nusing ld = long double;\\nconst ld eps = 1e-9;\\n\\n//// < \\\"d:\\\\d_download\\\\visual studio 2015\\\\projects\\\\programing_contest_c++\\\\debug\\\\a.txt\\\" > \\\"d:\\\\d_download\\\\visual studio 2015\\\\projects\\\\programing_contest_c++\\\\debug\\\\b.txt\\\"\\n\\n\\nint main() {\\n\\twhile (1) {\\n\\t\\tint p, n; cin >> p >> n;\\n\\t\\tif (!p)break;\\n\\t\\tpair<int, int>minp, maxp;\\n\\t\\tld minsa = 1e9, maxsa = 1e9;\\n\\t\\tfor (long long int bo = 1; bo <= n; ++bo) {\\n\\t\\t\\tld num = sqrt(ld(bo*bo) * p);\\n\\t\\t\\tfor (int si = max(1, int(num - 2)); si <= min(n, int(num + 1)); ++si) {\\n\\t\\t\\t\\tif (si*si < bo*bo*p) {\\n\\t\\t\\t\\t\\tif (minsa >sqrt(p)-ld(si)/bo ) {\\n\\t\\t\\t\\t\\t\\tminp = (make_pair(si, bo));\\n\\t\\t\\t\\t\\t\\tminsa = sqrt(p) - ld(si) / bo;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (si*si > bo*bo*p) {\\n\\t\\t\\t\\t\\tif (maxsa > ld(si) / bo - sqrt(p)) {\\n\\t\\t\\t\\t\\t\\tmaxp = make_pair(si, bo);\\n\\t\\t\\t\\t\\t\\tmaxsa = ld(si) / bo - sqrt(p);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << maxp.first << \\\"/\\\" << maxp.second << \\\" \\\" << minp.first << '/' << minp.second << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 2964,\n \"score_of_the_acc\": -0.7957,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1208_1886709\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<string>\\n#include<algorithm>\\t\\n#include<map>\\n#include<set>\\n#include<utility>\\n#include<cmath>\\n#include<cstring>\\n#include<queue>\\n#include<cstdio>\\n#include<sstream>\\n#include<iomanip>\\n#define loop(i,a,b) for(int i=a;i<b;i++) \\n#define rep(i,a) loop(i,0,a)\\n#define pb push_back\\n#define mp make_pair\\n#define all(in) in.begin(),in.end()\\n#define shosu(x) fixed<<setprecision(x)\\nusing namespace std;\\n//kaewasuretyuui\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\ntypedef vector<pii> vp;\\ntypedef vector<vp> vvp;\\ntypedef pair<int,pii> pip;\\ntypedef vector<pip>vip;\\nconst double PI=acos(-1);\\nconst double EPS=1e-8;\\nconst int inf=1e8;\\nint gcd(int a,int b){\\n\\treturn (b==0?a:gcd(b,a%b));\\n}\\nint main(){\\n\\tint a,b;\\n\\twhile(cin>>a>>b,a+b){\\n\\t\\tdouble q=sqrt(a);\\n\\t\\tint c=1,d=1,e=1,f=inf;\\n\\t\\tloop(i,1,b+1){\\n\\t\\t\\tint t=ceil(i/q);\\n\\t\\t\\tt--;\\n\\t\\t\\tif(q<(double)i/t&&(double)i/t<(double)f/e){\\n\\t\\t\\t\\tf=i;e=t;\\n\\t\\t\\t\\tint w=gcd(f,e);\\n\\t\\t\\t\\tf/=w;t/=w;\\n\\t\\t\\t}\\n\\t\\t\\tt++;\\n\\t\\t\\tif(t!=0){\\n\\t\\t\\t\\tif(q>(double)i/t&&(double)i/t>(double)d/c){\\n\\t\\t\\t\\t\\td=i;c=t;\\n\\t\\t\\t\\t\\tint w=gcd(d,c);\\n\\t\\t\\t\\t\\td/=w;c/=w;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout<<f<<\\\"/\\\"<<e<<\\\" \\\"<<d<<\\\"/\\\"<<c<<endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 1164,\n \"score_of_the_acc\": -0.0124,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1208_1874997\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n \\nusing namespace std;\\n \\n#define INF 1e9\\n \\nclass Fraction{\\npublic:;\\n double numerator,denominator;\\n double div();\\n};\\n \\ndouble Fraction::div(){\\n return numerator/denominator;\\n}\\n \\nostream &operator << (ostream &os,const Fraction &f){\\n os << f.numerator << '/' << f.denominator;\\n return os;\\n}\\n \\nint main(){\\n double p;\\n int n;\\n while(cin >> p >> n, p){\\n\\tp = sqrt(p);\\n\\tFraction a = (Fraction){-1,1};\\n\\tFraction b = (Fraction){INF,1};\\n\\tfor(int den = 1 ; den <= n ; den++){\\n\\t int l = 0, r = n+1;\\n\\t while(l < r){\\n\\t\\tdouble mid = (l + r) / 2;\\n\\t\\tif(mid < p*den){\\n\\t\\t if(mid/den > a.div()){\\n\\t\\t\\ta = (Fraction){mid,den};\\n\\t\\t }\\n\\t\\t l = mid+1;\\n\\t\\t}else{\\n\\t\\t r = mid;\\n\\t\\t}\\n\\t }\\n\\t l = 0, r = n+1;\\n\\t while(l < r){\\n\\t\\tdouble mid = (l + r) / 2;\\n\\t\\tif(mid > p*den){\\n\\t\\t if(mid/den < b.div()){\\n\\t\\t\\tb = (Fraction){mid,den};\\n\\t\\t }\\n\\t\\t r = mid;\\n\\t\\t}else{\\n\\t\\t l = mid+1;\\n\\t\\t}\\n\\t }\\n\\t}\\n\\tcout << b << \\\" \\\" << a << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 370,\n \"memory_kb\": 1284,\n \"score_of_the_acc\": -0.1271,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1208_1803620\",\n \"code_snippet\": \"#include<iostream>\\n#include<cmath>\\n#include<tuple>\\nusing namespace std;\\nint p, q;\\nint main() {\\n\\twhile (true) {\\n\\t\\tcin >> p >> q;\\n\\t\\tif (p == 0 && q == 0)break;\\n\\t\\ttuple<int, int, double>x, y;\\n\\t\\tx = make_tuple(0, 0, 0);\\n\\t\\ty = make_tuple(0, 0, 100000);\\n\\t\\tdouble T = sqrt(1.0*p);\\n\\t\\tfor (int i = 1; i <= q; i++) {\\n\\t\\t\\tdouble I = T*i;\\n\\t\\t\\tint J = I;\\n\\t\\t\\tdouble K = 1.0*J / i;\\n\\t\\t\\tdouble L = 1.0*(J + 1) / i;\\n\\t\\t\\tif (K > get<2>(x) && J <= q) {\\n\\t\\t\\t\\tx = make_tuple(J, i, K);\\n\\t\\t\\t}\\n\\t\\t\\tif (L < get<2>(y) && J + 1 <= q) {\\n\\t\\t\\t\\ty = make_tuple(J + 1, i, L);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << get<0>(y) << '/' << get<1>(y) << ' ';\\n\\t\\tcout << get<0>(x) << '/' << get<1>(x) << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3076,\n \"score_of_the_acc\": -0.8451,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1208_1801348\",\n \"code_snippet\": \"#include <cmath>\\n#include <iostream>\\nusing namespace std;\\nint p, n; long double d;\\nint main() {\\n\\twhile (cin >> p >> n, n) {\\n\\t\\td = sqrtl(p);\\n\\t\\tint p1 = 999999, q1 = 1, p2 = 0, q2 = 1;\\n\\t\\tfor (int i = 1; i <= n; i++) {\\n\\t\\t\\tint j = i / d;\\n\\t\\t\\tif (0 < j && j <= n && 1.0L * i / j < 1.0L * p1 / q1) p1 = i, q1 = j;\\n\\t\\t\\tif (0 < (j + 1) && (j + 1) <= n && 1.0L * i / (j + 1) > 1.0L * p2 / q2) p2 = i, q2 = j + 1;\\n\\t\\t}\\n\\t\\tcout << p1 << '/' << q1 << ' ' << p2 << '/' << q2 << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3088,\n \"score_of_the_acc\": -0.8545,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1208_1274074\",\n \"code_snippet\": \"#include <iostream>\\n#include <complex>\\n#include <sstream>\\n#include <string>\\n#include <algorithm>\\n#include <deque>\\n#include <list>\\n#include <map>\\n#include <numeric>\\n#include <queue>\\n#include <vector>\\n#include <set>\\n#include <limits>\\n#include <cstdio>\\n#include <cctype>\\n#include <cmath>\\n#include <cstring>\\n#include <cstdlib>\\n#include <ctime>\\nusing namespace std;\\n#define REP(i, j) for(int i = 0; i < (int)(j); ++i)\\n#define FOR(i, j, k) for(int i = (int)(j); i < (int)(k); ++i)\\n#define SORT(v) sort((v).begin(), (v).end())\\n#define REVERSE(v) reverse((v).begin(), (v).end())\\nconst int INF = 10001;\\n\\nint gcd(int a, int b){ return (b == 0 ? a : gcd(b, a % b)); }\\n\\nclass R{\\n public:\\n double a, b;\\n R(int aa, int bb) { a = aa; b = bb; int r; while((r = gcd(a, b)) != 1) { a /= r; b /= r; } }\\n bool operator > (const R &r) const { return a / b > r.a / r.b; }\\n bool operator < (const R &r) const { return a / b < r.a / r.b; }\\n};\\n\\n\\nint main() {\\n double P;\\n int N;\\n while(cin >>P >>N && (P || N)){\\n P = sqrt(P);\\n R lower = R(-1, 1), upper = R(INF, 1);\\n FOR(i, 1, N + 1){\\n int l = 0, r = N + 1;\\n while(r - l > 1){\\n double m = (r + l) / 2;\\n if(m / i >= P){\\n r = m;\\n upper = min(upper, R(r, i));\\n }\\n else{\\n l = m;\\n lower = max(lower, R(l, i));\\n }\\n }\\n }\\n cout <<upper.a <<\\\"/\\\" <<upper.b <<\\\" \\\" <<lower.a <<\\\"/\\\" <<lower.b <<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2630,\n \"memory_kb\": 1284,\n \"score_of_the_acc\": -0.5931,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1208_1140042\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define INF 1e9\\n\\nclass Fraction{\\npublic:;\\n double numerator,denominator;\\n double div();\\n};\\n\\ndouble Fraction::div(){\\n return numerator/denominator;\\n}\\n\\nostream &operator << (ostream &os,const Fraction &f){\\n os << f.numerator << '/' << f.denominator;\\n return os;\\n}\\n\\nint main(){\\n double p;\\n int n;\\n while(cin >> p >> n, p){\\n p = sqrt(p);\\n Fraction a = (Fraction){-1,1};\\n Fraction b = (Fraction){INF,1};\\n for(int den = 1 ; den <= n ; den++){\\n int l = 0, r = n+1;\\n while(l < r){\\n double mid = (l + r) / 2;\\n if(mid < p*den){\\n if(mid/den > a.div()){\\n a = (Fraction){mid,den};\\n }\\n l = mid+1;\\n }else{\\n r = mid;\\n }\\n }\\n l = 0, r = n+1;\\n while(l < r){\\n double mid = (l + r) / 2;\\n if(mid > p*den){\\n if(mid/den < b.div()){\\n b = (Fraction){mid,den};\\n }\\n r = mid;\\n }else{\\n l = mid+1;\\n }\\n }\\n }\\n cout << b << \\\" \\\" << a << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 370,\n \"memory_kb\": 1284,\n \"score_of_the_acc\": -0.1271,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1208_1140040\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define INF 1e9\\n\\nclass Fraction{\\npublic:;\\n double numerator,denominator;\\n double div();\\n};\\n\\ndouble Fraction::div(){\\n return numerator/denominator;\\n}\\n\\nostream &operator << (ostream &os,const Fraction &f){\\n os << f.numerator << '/' << f.denominator;\\n return os;\\n}\\n\\nint main(){\\n double p;\\n int n;\\n while(cin >> p >> n, p){\\n p = sqrt(p);\\n Fraction a = (Fraction){-1,1};\\n Fraction b = (Fraction){INF,1};\\n for(int den = 1 ; den <= n ; den++){\\n int l = 0, r = n+1;\\n for(int i = 0 ; i < 150 ; i++){\\n double mid = (l + r) / 2;\\n if(mid < p*den){\\n if(mid/den > a.div()){\\n a = (Fraction){mid,den};\\n }\\n l = mid;\\n }else{\\n r = mid;\\n }\\n }\\n l = 0, r = n+1;\\n for(int i = 0 ; i < 150 ; i++){\\n double mid = (l + r) / 2;\\n if(mid > p*den){\\n if(mid/den < b.div()){\\n b = (Fraction){mid,den};\\n }\\n r = mid;\\n }else{\\n l = mid;\\n }\\n }\\n }\\n cout << b << \\\" \\\" << a << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4860,\n \"memory_kb\": 1288,\n \"score_of_the_acc\": -1.0547,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1208_1139716\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define MAX 1000000007\\n\\nint main() {\\n double p,n;\\n while(cin >> p >> n) {\\n if(p==0 && n==0) break;\\n p=sqrt(p);\\n int x=0,y=0,u=0,v=0;\\n double a2=MAX,b2=MAX;\\n for(int i=1; i<=n; i++) {\\n int a=(int)(p*i);\\n int b=a+1;\\n if(a>n) break;\\n if(__gcd(a,i)==1 && p-(double)a/i<a2) {\\n\\ta2=p-(double)a/i;\\n\\tu=a;v=i;\\n }\\n if(b>n) continue;\\n if(__gcd(b,i)==1 && (double)b/i-p<b2) {\\n\\tb2=(double)b/i-p;\\n\\tx=b;y=i;\\n }\\n }\\n printf(\\\"%d/%d %d/%d\\\\n\\\",x,y,u,v);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1200,\n \"score_of_the_acc\": -0.0159,\n \"final_rank\": 2\n }\n]","isConversational":false}}},{"rowIdx":675,"cells":{"group_id":{"kind":"string","value":"aoj_1204_cpp"},"problem_description":{"kind":"string","value":"Problem E:\nPipeline Scheduling\nAn\narithmetic pipeline\nis designed to process more than one task simultaneously in an overlapping manner. It includes function units and data paths among them. Tasks are processed by\npipelining\n: at each clock, one or more units are dedicated to a task and the output produced for the task at the clock is cascading to the units that are responsible for the next stage; since each unit may work in parallel with the others at any clock, more than one task may be being processed at a time by a single pipeline.\nIn this problem, a pipeline may have a feedback structure, that is, data paths among function units may have directed loops as shown in the next figure.\nExample of a feed back pipeline\nSince an arithmetic pipeline in this problem is designed as special purpose dedicated hardware, we assume that it accepts just a single sort of task. Therefore, the timing information of a pipeline is fully described by a simple table called a\nreservation table\n, which specifies the function units that are busy at each clock when a task is processed without overlapping execution.\nExample of a \"reservation table\"\nIn reservation tables, 'X' means \"the function unit is busy at that clock\" and '.' means \"the function unit is not busy at that clock.\" In this case, once a task enters the pipeline, it is processed by unit0 at the first clock, by unit1 at the second clock, and so on. It takes seven clock cycles to perform a task.\nNotice that no special hardware is provided to avoid simultaneous use of the same function unit.\nTherefore, a task must not be started if it would conflict with any tasks being processed. For instance, with the above reservation table, if two tasks, say task 0 and task 1, were started at clock 0 and clock 1, respectively, a conflict would occur on unit0 at clock 5. This means that you should not start two tasks with single cycle interval. This invalid schedule is depicted in the following process table, which is obtained by overlapping two copies of the reservation table with one being shifted to the right by 1 clock.\nExample of a \"conflict\"\n('0's and '1's in this table except those in the first row represent tasks 0 and 1, respectively, and 'C' means the conflict.)\nYour job is to write a program that reports the minimum number of clock cycles in which the given pipeline can process 10 tasks.\nInput\nThe input consists of multiple data sets, each representing the reservation table of a pipeline. A data set is given in the following format.\nn\nx\n0,0\nx\n0,1\n...\nx\n0,n-1\nx\n1,0\nx\n1,1\n...\nx\n1,n-1\nx\n2,0\nx\n2,1\n...\nx\n2,n-1\nx\n3,0\nx\n3,1\n...\nx\n3,n-1\nx\n4,0\nx\n4,1\n...\nx\n4,n-1\nThe integer\nn\n(< 20) in the first line is the width of the reservation table, or the number of clock cycles that is necessary to perform a single task. The second line represents the usage of unit0, the third line unit1, and so on.\nx\ni,j\nis either 'X' or '.'. The former means\nreserved\nand the latter\nfree\n. There are no spaces in any input line. For simplicity, we\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1204_2581073","code_snippet":"#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\nstruct Info{\n\tvoid set(int arg_task,int arg_num){\n\t\ttask = arg_task;\n\t\tnum = arg_num;\n\t}\n\tint task,num;\n};\n\nstruct Data{\n\tInfo unit_table[5];\n\tint clock,min_task,max_task;\n};\n\nchar table[5][20];\nint loc[20];\nint N;\n\nvoid func(){\n\n\tfor(int i = 0; i < 5; i++)scanf(\"%s\",table[i]);\n\n\tfor(int i = 0; i < N; i++){\n\t\tfor(int k = 0; k < 5; k++){\n\t\t\tif(table[k][i] == 'X'){\n\t\t\t\tloc[i] = k;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\tData first;\n\tfor(int unit = 0; unit < 5; unit++){\n\t\tif(table[unit][0] == 'X'){\n\t\t\tfirst.unit_table[unit].set(0,0);\n\t\t}else{\n\t\t\tfirst.unit_table[unit].set(BIG_NUM,BIG_NUM);\n\t\t}\n\t}\n\tfirst.clock = 1;\n\tfirst.min_task = 0;\n\tfirst.max_task = 0;\n\n\tqueue<Data> Q;\n\tQ.push(first);\n\n\tint count;\n\tbool collide;\n\n\twhile(!Q.empty()){\n\n\t\tData new_data;\n\t\tfor(int unit = 0; unit < 5; unit++)new_data.unit_table[unit].set(BIG_NUM,BIG_NUM);\n\n\t\tcollide = false;\n\t\tcount = 0;\n\t\tnew_data.min_task = BIG_NUM,new_data.max_task = -BIG_NUM;\n\n\t\tfor(int task = Q.front().min_task; task <= Q.front().max_task; task++){\n\t\t\tfor(int unit = 0; unit < 5; unit++){\n\t\t\t\tif(Q.front().unit_table[unit].task == task){\n\n\t\t\t\t\tif(Q.front().unit_table[unit].num < N-1){\n\t\t\t\t\t\tnew_data.min_task = min(new_data.min_task,task);\n\t\t\t\t\t\tnew_data.max_task = max(new_data.max_task,task);\n\n\t\t\t\t\t\tint next_loc = loc[Q.front().unit_table[unit].num+1];\n\t\t\t\t\t\tif(new_data.unit_table[next_loc].task == BIG_NUM){\n\t\t\t\t\t\t\tcount++;\n\t\t\t\t\t\t\tnew_data.unit_table[next_loc].task = task;\n\t\t\t\t\t\t\tnew_data.unit_table[next_loc].num = Q.front().unit_table[unit].num+1;\n\n\t\t\t\t\t\t\tif(task == 9 && Q.front().unit_table[unit].num+1 == N-1){\n\t\t\t\t\t\t\t\tprintf(\"%d\\n\",Q.front().clock+1);\n\t\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\tcollide = true;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(collide)break;\n\t\t}\n\t\tif(collide){\n\t\t\tQ.pop();\n\t\t\tcontinue;\n\t\t}\n\n\t\tif(new_data.unit_table[loc[0]].task == BIG_NUM && new_data.max_task < 9){\n\t\t\tData new_data_add;\n\t\t\tfor(int unit = 0; unit < 5; unit++){\n\t\t\t\tnew_data_add.unit_table[unit].set(new_data.unit_table[unit].task,new_data.unit_table[unit].num);\n\t\t\t}\n\t\t\tnew_data_add.unit_table[loc[0]].set(new_data.max_task+1,0);\n\t\t\tnew_data_add.clock = Q.front().clock+1;\n\t\t\tnew_data_add.min_task = new_data.min_task;\n\t\t\tnew_data_add.max_task = new_data.max_task+1;\n\n\t\t\tQ.push(new_data_add);\n\t\t}\n\n\t\tif(count > 0){\n\t\t\tnew_data.clock = Q.front().clock+1;\n\t\t\tQ.push(new_data);\n\t\t}\n\t\tQ.pop();\n\t}\n}\n\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%d\",&N);\n\t\tif(N == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":4456,"score_of_the_acc":-0.1626,"final_rank":11},{"submission_id":"aoj_1204_2062326","code_snippet":"#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\nusing ld = long double;\nconst ld eps = 1e-9;\n\n//// < \"d:\\d_download\\visual studio 2015\\projects\\programing_contest_c++\\debug\\a.txt\" > \"d:\\d_download\\visual studio 2015\\projects\\programing_contest_c++\\debug\\b.txt\"\n\nint getans(const bitset<19>&bs,int rest,vector<vector<int>>&memo,vector<int>&confs) {\n\tif (!rest)return 0;\n\telse {\n\t\tif (memo[rest][bs.to_ulong()] != -1)return memo[rest][bs.to_ulong()];\n\t\telse {\n\t\t\tint ans = 10000;\n\t\t\tfor (int bet = 1; bet < 19; ++bet) {\n\t\t\t\tbool ok = true;\n\t\t\t\tfor (int i = bet; i < 19; ++i) {\n\t\t\t\t\tif (bs[i] && confs[bet+18-i]) {\n\t\t\t\t\t\tok = false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (ok) {\n\t\t\t\t\tbitset<19>nextbs;\n\t\t\t\t\tfor (int i = 0; i < 19 -bet; ++i) {\n\t\t\t\t\t\tnextbs[i] = bs[i + bet];\n\t\t\t\t\t}\n\t\t\t\t\tnextbs[18] = true;\n\t\t\t\t\tans = min(ans,bet + getans(nextbs, rest - 1, memo, confs));\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn memo[rest][bs.to_ulong()] = ans;\n\t\t}\n\t}\n}\n\nint main() {\n\twhile (1) {\n\t\tint N; cin >> N;\n\t\tif (!N)break;\n\t\tvector<vector<int>>tables(5, vector<int>(N));\n\t\tfor (int i = 0; i < 5; ++i) {\n\t\t\tstring st; cin >> st;\n\t\t\tfor (int j = 0; j < N; ++j) {\n\t\t\t\ttables[i][j] = (st[j] == 'X');\n\t\t\t}\n\t\t}\n\t\tvector<int>conf(41);\n\t\tfor (int i = 1; i < N; ++i) {\n\t\t\tfor (int y = 0; y < 5; ++y) {\n\t\t\t\tfor (int l = 0; l < N-i; ++l) {\n\t\t\t\t\tint r = l + i;\n\t\t\t\t\tif (tables[y][l] && tables[y][r])conf[i] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tbitset<19>bs;\n\t\tvector<vector<int>>memo(11, vector<int>(1 << 19,-1));\n\t\tint ans = getans(bs, 10, memo, conf);\n\t\tcout << ans+N-1 << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":90,"memory_kb":27412,"score_of_the_acc":-1.0113,"final_rank":15},{"submission_id":"aoj_1204_1953384","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <string>\n#include <vector>\n#include <deque>\n#include <list>\n#include <algorithm>\n#include <numeric>\n#include <functional>\n#include <cmath>\n#include <cstring>\n#include <cctype>\n#include <sstream>\n#include <set>\n#include <map>\n#include <stack>\n#include <queue>\n#include <complex>\nusing namespace std;\n#define REP(i,n) for(int i = 0; i < (int)n; i++)\n#define FOR(i,a,b) for(int i = a; i < (int)b; i++)\n#define pb push_back\n#define mp make_pair\ntypedef vector<int> vi;\ntypedef pair<int, int> pi;\ntypedef long long ll;\nconst int INF = 1<<28;\nconst ll MOD = 1000000007;\nvector<pi> x;\nint n, ans;\n\nvoid dfs(int pnt, int cnt, bool b[5][200]) {\n\tif(pnt + n > ans) return;\n\tif(cnt == 10) {\n\t\tans = min(ans, pnt + n-1);\n\t\treturn;\n\t}\n\tREP(i, x.size()) {\n\t\tif(b[x[i].first][x[i].second + pnt]) {\n\t\t\tdfs(pnt+1, cnt, b);\n\t\t\treturn;\n\t\t}\n\t}\n\tREP(i, x.size())\n\t\tb[x[i].first][x[i].second + pnt] = true;\n\tdfs(pnt+1, cnt+1, b);\n\tREP(i, x.size())\n\t\tb[x[i].first][x[i].second + pnt] = false;\n\tdfs(pnt+1, cnt, b);\n\treturn;\n}\n\nint main() {\n\tios_base::sync_with_stdio(0);\n\tcin.tie(0);\n\twhile(cin >> n, n) {\n\t\tans = n * 10;\n\t\tx.clear();\n\t\tREP(i, 5) REP(j, n) {\n\t\t\tchar c; cin >> c;\n\t\t\tif(c == 'X')\n\t\t\t\tx.pb(mp(i, j));\n\t\t}\n\t\tbool b[5][200] = {};\n\t\tdfs(0, 0, b);\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1204,"score_of_the_acc":-0.0439,"final_rank":4},{"submission_id":"aoj_1204_1171799","code_snippet":"#include <iostream>\n#include <complex>\n#include <sstream>\n#include <string>\n#include <algorithm>\n#include <deque>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <vector>\n#include <set>\n#include <limits>\n#include <cstdio>\n#include <cctype>\n#include <cmath>\n#include <cstring>\n#include <cstdlib>\n#include <ctime>\nusing namespace std;\n#define REP(i, j) for(int i = 0; i < (int)(j); ++i)\n#define FOR(i, j, k) for(int i = (int)(j); i < (int)(k); ++i)\n#define SORT(v) sort((v).begin(), (v).end())\n#define REVERSE(v) reverse((v).begin(), (v).end())\ntypedef complex<double> P;\nconst int M = 5;\nconst int INF = 1e9;\n\nint N, ans = INF;\n\nint count(vector< vector<int> > &v){\n int ret = 0, j;\n REP(i, M){\n for(j = (int)v[i].size() - 1; j >= 0 && v[i][j] == -1; --j) ;\n ret = max(ret, j);\n }\n return ret + 1;\n}\n\nbool check(int x, int s, vector< vector<int> > &v, vector< vector<int> > &t){\n REP(i, M) REP(j, N) if(t[i][j] && v[i][j + x + s] != -1) return false;\n return true;\n}\n\nvoid dfs(int n, int x, vector< vector<int> > &v, vector< vector<int> > &t){\n if(n >= 10) if(x + N < ans) ans = x + N;\n if(x + N >= ans) return ;\n FOR(_, 1, N + 1){\n if(!check(x, _, v, t)) continue;\n REP(i, M) REP(j, N) if(t[i][j]) v[i][j + x + _] = n;\n dfs(n + 1, x + _, v, t);\n REP(i, M) REP(j, N) if(t[i][j]) v[i][j + x + _] = -1;\n }\n}\n\nint main() {\n while(cin >>N && N){\n ans = INF;\n vector< vector<int> > t(M, vector<int>(N)), v(M, vector<int>(N * 12, -1));\n REP(i, M){\n REP(j, N){\n char c; cin >>c;\n t[i][j] = (c == 'X' ? 1 : 0);\n if(t[i][j]) v[i][j] = 0;\n }\n }\n dfs(1, 0, v, t);\n cout <<ans <<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1220,"score_of_the_acc":-0.0445,"final_rank":6},{"submission_id":"aoj_1204_1010649","code_snippet":"#include<iostream>\n#include<bitset>\n#include<array>\n#include<utility>\n#include<vector>\n\nusing namespace std;\n\ntypedef array<bitset<200>,5> Board;\n\nint main(){\n for(int n;cin>>n,n;){\n Board b;\n for(int i=0;i<5;i++){\n for(int j=0;j<n;j++){\n\tchar c;\n\tcin>>c;\n\tb[i][j]=c=='X';\n }\n }\n const int BW=20;\n static bool t[1<<BW];\n for(int i=0;i<1<<BW;i++){\n Board c;\n Board cb=b;\n for(int j=0;j<BW;j++){\n\tif(i>>j&1){\n\t for(int k=0;k<5;k++){\n\t c[k]|=cb[k];\n\t }\n\t}\n\tfor(auto &e:cb){\n\t e<<=1;\n\t}\n }\n bool f=false;\n for(int j=0;j<5;j++){\n\tf|=(c[j]&b[j]).any();\n }\n t[i]=!f;\n }\n static int mem[1<<BW];\n fill(begin(mem),end(mem),-1);\n vector<pair<int,int> > stats[222];\n stats[0].emplace_back(0,0);\n for(int i=0;;i++){\n for(auto e:stats[i]){\n\tint f=e.first;\n\tint s=e.second;\n\tif(f==10){\n\t cout<<i+n-1<<endl;\n\t goto next;\n\t}\n\tif(mem[s]>=f)continue;\n\tmem[s]=f;\n\tstats[i+1].emplace_back(f,s<<1&(1<<BW)-1);\n\tif(t[s]){\n\t stats[i+1].emplace_back(f+1,(s|1)<<1&(1<<BW)-1);\n\t}\n }\n }\n next:\n ;\n }\n}","accuracy":1,"time_ms":5720,"memory_kb":6452,"score_of_the_acc":-1.043,"final_rank":16},{"submission_id":"aoj_1204_896174","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <string>\n#include <sstream>\n#include <cstring>\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <numeric>\n#include <cctype>\n#include <tuple>\n#include <array>\n\n#ifdef _MSC_VER\n#include <agents.h>\n#endif\n\n#define FOR(i, a, b) for(int i = (a); i < (int)(b); ++i)\n#define rep(i, n) FOR(i, 0, n)\n#define ALL(v) v.begin(), v.end()\n#define REV(v) v.rbegin(), v.rend()\n#define MEMSET(v, s) memset(v, s, sizeof(v))\n#define X first\n#define Y second\n\nusing namespace std;\n\nint ok[1 << 20];\nint used[5][50];\nint dp[2][1 << 20];\n\n\n\nint main(){\n\tint n;\n\twhile (cin >> n, n){\n\t\tarray<string, 5> ar;\n\t\trep(i, 5) cin >> ar[i];\n\n\t\tint len = 0;\n\t\trep(i, 5) rep(j, n) if (ar[i][j] == 'X') len = max(len, j+1);\n\n\t\trep(i, 1 << n){\n\t\t\tok[i] = 1;\n\t\t\tMEMSET(used, 0);\n\t\t\trep(j, n){\n\t\t\t\tif (i&(1 << j)){\n\t\t\t\t\trep(k, 5) rep(l, n){\n\t\t\t\t\t\tif (ar[k][l] != 'X') continue;\n\t\t\t\t\t\tif (used[k][l+j]) ok[i] = 0;\n\t\t\t\t\t\tused[k][l+j] = 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t//if (ok[i]){\n\t\t\t//\trep(j, n) cout << !!(i&(1 << j));\n\t\t\t//\tcout << endl;\n\t\t\t//}\n\t\t}\n\t\tint mask = (1 << n) - 1;\n\n\t\tMEMSET(dp, 0);\n\t\trep(i, n * 15){\n\t\t\trep(j, 1 << n){\n\t\t\t\tint nxt = (i + 1) & 1, bits = (j << 1)&mask;\n\t\t\t\tdp[nxt][bits] = max(dp[nxt][bits], dp[i & 1][j]);\n\t\t\t\tif (ok[bits | 1]) dp[nxt][bits | 1] = max(dp[nxt][bits | 1], dp[i & 1][j] + 1);\n\t\t\t\tif (dp[nxt][bits | 1] == 10){\n\t\t\t\t\tcout << i + len << endl;\n\t\t\t\t\tgoto end;\n\t\t\t\t}\n\t\t\t}\n\t\t\t//rep(j, 1 << n){\n\t\t\t//\t\trep(k, n) cout << !!(j&(1 << n-k-1));\n\t\t\t//\t\tcout << endl;\n\t\t\t//\t\tcout << dp[i + 1 & 1][j] << endl;\n\t\t\t//}\n\t\t}\n\tend:;\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":11444,"score_of_the_acc":-0.4175,"final_rank":12},{"submission_id":"aoj_1204_652113","code_snippet":"#include<iostream>\nusing namespace std;\n\nint n;\nint c;\nstring p[5];\n\nint rec(int id,int st,int pos){\n if(id == 10){\n return pos + n;\n }\n \n int res = 10000;\n for(int i=1;i<n;i++){\n if(pos+i>=res)return res;\n if(!((st>>i)&1)){\n int nxt = (st >> i) | c;\n res = min(res,rec(id+1,nxt,pos+i));\n }\n }\n return res;\n}\n\nint main(){\n cin.tie(0);\n std::ios::sync_with_stdio(false);\n while(cin >> n,n){\n for(int i=0;i<5;i++)cin >> p[i];\n\n c = 0;\n for(int i=1;i<n;i++){\n bool f = true;\n for(int j=0;j<5;j++){\n\tfor(int k=0;k<n;k++){\n\t if(k+i>=n)break;\n\t if(p[j][k] == p[j][k+i] && p[j][k] == 'X')f = false;\n\t}\n }\n if(!f)c |= 1<<i;\n }\n cout << rec(1,c,0) << endl;\n }\n}","accuracy":1,"time_ms":30,"memory_kb":1200,"score_of_the_acc":-0.0466,"final_rank":7},{"submission_id":"aoj_1204_652110","code_snippet":"#include<iostream>\nusing namespace std;\n\nint n;\nint c;\nstring p[5];\n\nint rec(int id,int st,int pos){\n if(id == 10){\n return pos + n;\n }\n \n int res = 10000;\n for(int i=1;i<n;i++){\n if(!((st>>i)&1)){\n int nxt = (st >> i) | c;\n res = min(res,rec(id+1,nxt,pos+i));\n }\n }\n return res;\n}\n\nint main(){\n while(cin >> n,n){\n for(int i=0;i<5;i++)cin >> p[i];\n\n c = 0;\n for(int i=1;i<n;i++){\n bool f = true;\n for(int j=0;j<5;j++){\n\tfor(int k=0;k<n;k++){\n\t if(k+i>=n)break;\n\t if(p[j][k] == p[j][k+i] && p[j][k] == 'X'){\n\t f = false;\n\t break;\n\t }\n\t}\n\tif(!f)break;\n }\n if(!f)c |= 1<<i;\n }\n\n cout << rec(1,c,0) << endl;\n }\n}","accuracy":1,"time_ms":30,"memory_kb":1204,"score_of_the_acc":-0.0468,"final_rank":8},{"submission_id":"aoj_1204_628456","code_snippet":"#include <iostream>\n#include <sstream>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <set>\n#include <map>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <cassert>\n//C++11\n#if __cplusplus == 201103L\n#include <tuple>\n#endif\n\nusing namespace std;\n\n#define FOR(i,k,n) for(int i=(k); i<(int)n; ++i)\n#define REP(i,n) FOR(i,0,n)\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n\ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cout<<*i<<\" \"; cout<<endl; }\n\ntypedef long long ll;\nconst int INF = 100000000;\nconst double EPS = 1e-8;\nconst int MOD = 1000000007;\nint W;\nbool used[5][410] = {};\nvector<string> grid;\nint min_ans;\nint dfs(int p, int bx){\n if(min_ans <= (10 - p) + bx + W - 1) return INF;\n if(p == 10) {\n return min_ans = bx + W - 1;\n }\n int res = INF;\n for(int dx = 0; dx <= W; dx++){\n if(p == 0 && dx > 0) break;\n bool bad = false;\n REP(y, 5) REP(x, W) if(grid[y][x] == 'X' && used[y][bx + dx + x]) bad = true;\n if(bad) continue;\n REP(y, 5) REP(x, W) if(grid[y][x] == 'X') used[y][bx + dx + x] = true;\n res = min(res, dfs(p + 1, bx + dx + 1));\n REP(y, 5) REP(x, W) if(grid[y][x] == 'X') used[y][bx + dx + x] = false;\n }\n return res;\n}\n\nint main(){\n while(cin>>W && W){\n grid.assign(5, \"\");\n REP(i, 5) cin>>grid[i];\n bool empty = true;\n REP(y, 5) REP(x, W) if(grid[y][x] != '.') empty = false;\n assert(not empty);\n memset(used, 0, sizeof(used));\n min_ans = INF;\n cout << dfs(0, 0) << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1216,"score_of_the_acc":-0.0444,"final_rank":5},{"submission_id":"aoj_1204_618446","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <vector>\n#include <complex>\n#include <algorithm>\n#include <set>\n#include <map>\n#include <queue>\n#include <string>\n#include <cstring>\n#include <stack>\n#include <cmath>\n#include <iomanip>\n#include <sstream>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef ll li;\ntypedef pair<int,int> PI;\n\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\n#define REP(i,m,n) for(int i=m; i<=(int)(n); ++i)\n#define F first\n#define S second\n#define mp(a,b) make_pair(a,b)\n#define pb(a) push_back(a)\n#define SZ(a) (int)((a).size())\n#define ALL(a) a.begin(),a.end()\n#define FOR(it,a) for(__typeof(a.begin())it=a.begin();it!=a.end();++it)\n\nint n;\n\nstring in[5];\n\nbool nok(int sz){\n rep(i,5)\n rep(j,SZ(in[i]))\n if(sz+j<SZ(in[i]))\n if(in[i][j]=='X' && in[i][sz+j]=='X')\n return true;\n\n return false;\n}\n\nbool nokl[200];\nint ans;\nint len[10];\nvoid dfs(int ne,int nlen){\n if(ne==10){\n if(nlen+n-1<ans){\n ans = nlen+n-1;\n //cout << ans << endl;\n }\n return;\n }\n \n //cout << ne << ' ' << nlen << endl;\n\n for(int i=nlen;i<=nlen+n-1;++i){\n //if(i+n>ans) break;\n bool tok = false;\n rep(j,ne) if(nokl[i-len[j]]){\n tok=true;\n break;\n }\n if(tok) continue;\n len[ne] = i;\n dfs(ne+1,i+1);\n }\n}\n\nvoid solve(){\n memset(nokl,0,sizeof(nokl));\n rep(i,5) cin >> in[i];\n\n \n rep(i,SZ(in[0])){\n nokl[i+1] = nok(i+1);\n //if(nokl[i+1]) cout << i+1 << endl;\n }\n ans = 10*n;\n dfs(0,0);\n cout << ans << endl;\n}\n\nmain(){\n while(cin >> n,n) solve();\n}","accuracy":1,"time_ms":7080,"memory_kb":1204,"score_of_the_acc":-1.0439,"final_rank":17},{"submission_id":"aoj_1204_618445","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <vector>\n#include <complex>\n#include <algorithm>\n#include <set>\n#include <map>\n#include <queue>\n#include <string>\n#include <cstring>\n#include <stack>\n#include <cmath>\n#include <iomanip>\n#include <sstream>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef ll li;\ntypedef pair<int,int> PI;\n\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\n#define REP(i,m,n) for(int i=m; i<=(int)(n); ++i)\n#define F first\n#define S second\n#define mp(a,b) make_pair(a,b)\n#define pb(a) push_back(a)\n#define SZ(a) (int)((a).size())\n#define ALL(a) a.begin(),a.end()\n#define FOR(it,a) for(__typeof(a.begin())it=a.begin();it!=a.end();++it)\n\nint n;\n\nstring in[5];\n\nbool nok(int sz){\n rep(i,5)\n rep(j,SZ(in[i]))\n if(sz+j<SZ(in[i]))\n if(in[i][j]=='X' && in[i][sz+j]=='X')\n return true;\n\n return false;\n}\n\nbool nokl[200];\nint ans;\nint len[10];\nvoid dfs(int ne,int nlen){\n if(ne==10){\n if(nlen+n-1<ans){\n ans = nlen+n-1;\n //cout << ans << endl;\n }\n return;\n }\n \n //cout << ne << ' ' << nlen << endl;\n\n for(int i=nlen;i<=nlen+n-1;++i){\n //if(i+n>ans) break;\n bool tok = false;\n rep(j,ne) if(nokl[i-len[j]]) tok=true;\n if(tok) continue;\n len[ne] = i;\n dfs(ne+1,i+1);\n }\n}\n\nvoid solve(){\n memset(nokl,0,sizeof(nokl));\n rep(i,5) cin >> in[i];\n\n \n rep(i,SZ(in[0])){\n nokl[i+1] = nok(i+1);\n //if(nokl[i+1]) cout << i+1 << endl;\n }\n ans = 10*n;\n dfs(0,0);\n cout << ans << endl;\n}\n\nmain(){\n while(cin >> n,n) solve();\n}","accuracy":1,"time_ms":6320,"memory_kb":1204,"score_of_the_acc":-0.9364,"final_rank":14},{"submission_id":"aoj_1204_618064","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<string>\n#include<stack>\nusing namespace std;\n\nint n, t;\nint head[10] = {0};\nint rsv[5][20];\nvector<vector<int> > crsv(5);\n\nbool mCheck(int head){\n\tfor(int a = 0; a < 5; a++){\n\t\tfor(int b = 0; b < n; b++){\n\t\t\tif(crsv[a][head+b] == 1 && rsv[a][b] == 1) return false;\n\t\t}\n\t}\n\treturn true;\n}\n\nvoid set_crsv(int head){\n\tfor(int a = 0; a < 5; a++){\n\t\tfor(int b = 0; b < n; b++){\n\t\t\tif(rsv[a][b] == 1) crsv[a][head+b] = 1;\n\t\t}\n\t}\n}\n\nvoid clear_crsv(int head){\n\tfor(int a = 0; a < 5; a++){\n\t\tfor(int b = 0; b < n; b++){\n\t\t\tif(rsv[a][b] == 1) crsv[a][head+b] = 0;\n\t\t}\n\t}\n}\n\nint main(){\n\tint i, j;\n\tstring str;\n\t\n\tfor(i = 0; i < crsv.size(); i++) crsv[i] = vector<int>(201);\n\twhile(1){\n\t\tint ans = 99999;\n\n\t\tcin >> n;\n\t\tif(n == 0) break;\n\t\tfor(i = 0; i < 5; i++){\n\t\t\tfor(j = 0; j < 201; j++){\n\t\t\t\tcrsv[i][j] = 0;\n\t\t\t}\n\t\t}\n\t\tfor(i = 0; i < 5; i++){\n\t\t\tcin >> str;\n\t\t\tfor(j = 0; str[j] != 0; j++){\n\t\t\t\tif(str[j] == 'X') {\n\t\t\t\t\trsv[i][j] = 1;\n\t\t\t\t\tcrsv[i][j] = 1;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\trsv[i][j] = 0;\n\t\t\t\t\tcrsv[i][j] = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tstack<pair<int, int> > stk;\n\t\tstack<vector<vector<int> > > stk2;\n\t\t\n\t\tstk.push(make_pair(0,0));\n\t\tstk2.push(crsv);\n\t\twhile(!stk.empty()){\n\t\t\tpair<int, int> tv = stk.top();\n\t\t\tcrsv = stk2.top();\n\t\t\tstk.pop();\n\t\t\tstk2.pop();\n\t\t\tset_crsv(tv.second);\n\t\t\t\n\t\t\tif(tv.second > ans) continue;\n\t\t\tif(tv.first == 9){\n\t\t\t\t//cout << \"A\" << tv.first << \" \" << tv.second << endl;\n\t\t\t\tans = min(ans, tv.second);\n\t\t\t\t/*\n\t\t\t\tfor(i = 0; i < 5; i++){\n\t\t\t\t\tfor(j = 0; j < 30; j++){\n\t\t\t\t\t\tcout << crsv[i][j];\n\t\t\t\t\t}\n\t\t\t\t\tcout << endl;\n\t\t\t\t}\n\t\t\t\t*/\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\t/*\n\t\t\tcout << \"POP: \";\n\t\t\tcout << tv.first << \" \" << tv.second;\n\t\t\tcout << endl;\n\t\t\t*/\n\t\t\t\n\t\t\ttv.first++;\t\t\t\t\n\t\t\tfor(i = n-1; i >= 0; i--){\n\t\t\t\tif(mCheck(tv.second + i)){\n\t\t\t\t\ttv.second += i;\n\t\t\t\t\t/*\n\t\t\t\t\tcout << \"PUSH: \";\n\t\t\t\t\tcout << tv.first << \" \" << tv.second;\n\t\t\t\t\tcout << endl;\n\t\t\t\t\t*/\n\t\t\t\t\tstk.push(tv);\n\t\t\t\t\tstk2.push(crsv);\n\t\t\t\t\ttv.second -= i;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\t\t\n\t\t\t//if(stk.top().second <= tv.second) clear_crsv(tv.second);\t\t\t\n\t\t}\n\t\t\n\t\tans += n;\n\t\tcout << ans << endl;\n\t\t\n\t}\n\n}","accuracy":1,"time_ms":30,"memory_kb":1364,"score_of_the_acc":-0.0526,"final_rank":9},{"submission_id":"aoj_1204_497929","code_snippet":"#include<iostream>\n#include<queue>\n#include<algorithm>\n#include<functional>\n\nusing namespace std;\n\nvector<string> task;\nconst int inf = 1<<22;\n\nstruct state{\n int num;\n int pos[10];\n int cost;\n state(){\n cost = 0;\n num = 0;\n fill(pos,pos+10,-1);\n }\n state(int p[10], int n, int c){\n copy(p,p+10,pos);\n cost = c;\n num = n;\n }\n bool operator>(const state &t)const{\n return cost>t.cost;\n }\n};\n\nvoid rev(char M[5][300], const state &t){\n for(int i = 0; i < 10; ++i){\n if( t.pos[i] > -1 ){\n for(int j = 0; j < (int)task.size(); ++j){\n for(int k = 0; k < (int)task[j].size(); ++k){\n if( task[j][k] != '.'){\n M[j][t.pos[i]+k] = task[j][k];\n }\n }\n }\n }\n }\n}\n\nbool canPut(char M[5][300], int st, int offset){\n for(int i = 0; i < (int)task.size(); ++i){\n for(int j = 0; j < (int)task[i].size(); ++j){\n if( task[i][j] != '.' && M[i][st+offset+j] != 0 ){\n return false;\n }\n }\n }\n return true;\n}\n\nint solve(int n){\n state init;\n init.num = 0;\n init.pos[init.num] = 0;\n init.cost = n;\n int ret = inf;\n\n priority_queue<state, vector<state>, greater<state> > q;\n int vis[10];\n fill(vis,vis+10,inf);\n \n q.push(init);\n while(!q.empty()){\n state cur = q.top(); q.pop();\n if( cur.num == 9 ){\n return cur.cost;\n ret = min(ret, cur.cost);\n }\n \n int initial = *max_element(cur.pos,cur.pos+10);\n char M[5][300] = {{0}};\n rev(M,cur);\n for(int off = 1; off <= n; ++off){\n if(canPut(M,initial,off)){\n state next = cur;\n next.num++;\n next.pos[next.num] = initial + off;\n next.cost = initial + off + n;\n \n if( vis[next.num] > next.cost ){\n // vis[next.num] = next.cost;\n q.push(next);\n }\n }\n }\n }\n return ret;\n}\n\nint main()\n{\n int n;\n while(true){\n task.clear();\n cin >> n;\n if(n == 0) break;\n for(int i = 0; i < 5; ++i){\n string s;\n cin >> s;\n task.push_back(s);\n }\n cout << solve(n) << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":2128,"score_of_the_acc":-0.079,"final_rank":10},{"submission_id":"aoj_1204_386649","code_snippet":"#include <iostream>\n#include <cstring>\nusing namespace std;\n\nint n, res;\nchar t[5][22], ans[5][302];\n\nbool check(int idx){\n for(int i = 0; i < 5; i++){\n for(int j = 0; j < n; j++){\n if(t[i][j] == 'X' && ans[i][idx + j] != '.'){\n return false;\n }\n }\n }\n return true;\n}\n\nvoid draw(int idx, char ch){\n for(int i = 0; i < 5; i++){\n for(int j = 0; j < n; j++){\n if(t[i][j] == 'X'){\n ans[i][idx + j] = ch;\n }\n }\n }\n}\n\nvoid dfs(int idx, int cnt){\n if(cnt == 10){\n res = min(res, idx - 1);\n return;\n }\n if(idx > cnt * n || idx == res){\n return;\n }\n\n dfs(idx + 1, cnt);\n\n if(check(idx)){\n draw(idx, '0' + cnt);\n dfs(idx + 1, cnt + 1);\n draw(idx, '.');\n }\n}\n\nint main(){\n while(cin >> n, n){\n for(int i = 0; i < 5; i++){\n cin >> t[i];\n }\n memset(ans, '.', sizeof(ans));\n res = n * 10 - n;\n dfs(0, 0);\n cout << res + n << endl;\n }\n}","accuracy":1,"time_ms":40,"memory_kb":876,"score_of_the_acc":-0.0362,"final_rank":2},{"submission_id":"aoj_1204_250870","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <vector>\n#include <algorithm>\n#include <complex>\n#include <queue>\n#include <map>\n#include <set>\n#include <cstring>\n#include <cstdlib>\n#include <string>\n#include <cmath>\n#include <bitset>\nusing namespace std;\n\n#define REP(i,n) for(int i=0;i<(int)n;++i)\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n#define ALL(c) (c).begin(), (c).end()\nconst int INF = 1<<29;\n\n\nint n;\nint dame;\n\nint rec(int S, int num) { // ツつサツづ個クツδ債ッツクツづタツスツクツづーツ始ツづ淞づァツづェツづ按つッツづェツづ篠ビツッツトツつェツ１\n// cout << bitset<7>(S) << \" \" << num << endl;\n if (num == 10) return n;\n int res = INF;\n for (int i=1;i<n;++i) {\n if (!(S >> i & 1)) {\n int tmp = S >> i;\n tmp |= dame;\n res = min(res, rec(tmp, num+1) + i);\n }\n }\n return res;\n}\n\nint main() {\n while(cin>>n,n) {\n int table[n];\n REP(i,5) {\n REP(j,n) {\n char c;\n cin >> c;\n if (c == 'X')\n table[j] = i; \n }\n }\n dame = 0;\n for (int i=1; i<n; ++i) {\n REP(j, i) {\n if (table[i] == table[j]) {\n dame |= 1 << i-j;\n }\n }\n }\n cout << rec(dame,1) << endl;\n }\n}","accuracy":1,"time_ms":50,"memory_kb":0,"score_of_the_acc":-0.0057,"final_rank":1},{"submission_id":"aoj_1204_121463","code_snippet":"#include <iostream>\n#include <queue>\nusing namespace std;\n\nint n;\nint data[5][20];\n\nclass State {\npublic:\n int clock;\n int cnt;\n int task[5][40];\n\n bool operator <(const State &s) const {\n return clock > s.clock;\n }\n\n State() {\n clock = 0;\n cnt = 0;\n for(int i = 0; i < 5; i++) {\n for(int j = 0; j < 40; j++) {\n\ttask[i][j] = 0;\n }\n }\n }\n\n bool isPut() {\n for(int i = 0; i < 5; i++) {\n for(int j = 0; j < n; j++) {\n\tif(data[i][j] == 1 && task[i][40-n+j] != 0) return false;\n }\n }\n return true;\n }\n\n void put() {\n for(int i = 0; i < 5; i++) {\n for(int j = 0; j < n; j++) {\n\ttask[i][40-n+j] += data[i][j];\n }\n }\n cnt++;\n }\n\n void shiftL() {\n for(int i = 0; i < 5; i++) {\n for(int j = 0; j < 40; j++) {\n\tif(j+1 == 40) task[i][j] = 0;\n\telse task[i][j] = task[i][j+1];\n }\n }\n clock++;\n }\n};\n\nvoid bfs() {\n priority_queue<State> PQ;\n State s;\n s.put();\n s.clock = n;\n PQ.push(s);\n while(!PQ.empty()) {\n s = PQ.top();\n PQ.pop();\n\n if(s.cnt == 10) {\n cout << s.clock << endl;\n break;\n }\n\n for(int i = 0; i < n; i++) {\n s.shiftL();\n State s2 = s;\n if(s2.isPut()) {\n\ts2.put();\n\tPQ.push(s2);\n }\n }\n }\n}\n\nint main() {\n while(1) {\n cin >> n;\n if(n == 0) break;\n for(int i = 0; i < 5; i++) {\n for(int j = 0; j < n; j++) {\n\tchar c;\n\tcin >> c;\n\tif(c == 'X') data[i][j] = 1;\n\telse data[i][j] = 0;\n }\n }\n\n bfs();\n }\n return 0;\n}","accuracy":1,"time_ms":140,"memory_kb":12000,"score_of_the_acc":-0.4562,"final_rank":13},{"submission_id":"aoj_1204_26646","code_snippet":"#include<iostream>\n#include<algorithm>\nusing namespace std;\n#define rep(i, n) for ( int i = 0; i < n; i++)\n#define MAX 20\n#define H 5\n#define N 10\n\nint n, minw;\nchar P[H][MAX], B[H][MAX*N];\n\nbool invalid(int p){\n rep(i, H) rep(j, n){\n\tif ( P[i][j] == 'X' && B[i][j+p] != '.' ) return true;\n }\n return false;\n}\n\nvoid setTask(int p, char ch){\n rep(i, H) for ( int j = p; j < p+n; j++ ){\n\tif ( P[i][j-p] == 'X' )\tB[i][j] = ch;\n }\n}\n\nvoid rec( int pos, int last){\n if ( pos == N ){ minw = min(minw, last+n); return; }\n if ( minw <= last+n-1 + (n-pos) ) return;\n for ( int j = last+1; j <= last+n; j++ ){\n\tif ( invalid(j) ) continue;\n\tsetTask(j, 'X');\n\trec(pos+1, j);\n\tsetTask(j, '.');\n }\n}\n\nvoid init(){\n minw = (1<<21);\n rep(i, H) rep(j, MAX*N) B[i][j] = '.';\n}\n\nmain(){\n while ( cin >> n && n ){\n\trep(i, H) rep(j, n) cin >> P[i][j];\n\tinit();\n\trec(0, -1);\n\tcout << minw << endl;\n }\n}","accuracy":1,"time_ms":50,"memory_kb":868,"score_of_the_acc":-0.0373,"final_rank":3}],"string":"[\n {\n \"submission_id\": \"aoj_1204_2581073\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <set>\\n#include <map>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\nstruct Info{\\n\\tvoid set(int arg_task,int arg_num){\\n\\t\\ttask = arg_task;\\n\\t\\tnum = arg_num;\\n\\t}\\n\\tint task,num;\\n};\\n\\nstruct Data{\\n\\tInfo unit_table[5];\\n\\tint clock,min_task,max_task;\\n};\\n\\nchar table[5][20];\\nint loc[20];\\nint N;\\n\\nvoid func(){\\n\\n\\tfor(int i = 0; i < 5; i++)scanf(\\\"%s\\\",table[i]);\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tfor(int k = 0; k < 5; k++){\\n\\t\\t\\tif(table[k][i] == 'X'){\\n\\t\\t\\t\\tloc[i] = k;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tData first;\\n\\tfor(int unit = 0; unit < 5; unit++){\\n\\t\\tif(table[unit][0] == 'X'){\\n\\t\\t\\tfirst.unit_table[unit].set(0,0);\\n\\t\\t}else{\\n\\t\\t\\tfirst.unit_table[unit].set(BIG_NUM,BIG_NUM);\\n\\t\\t}\\n\\t}\\n\\tfirst.clock = 1;\\n\\tfirst.min_task = 0;\\n\\tfirst.max_task = 0;\\n\\n\\tqueue<Data> Q;\\n\\tQ.push(first);\\n\\n\\tint count;\\n\\tbool collide;\\n\\n\\twhile(!Q.empty()){\\n\\n\\t\\tData new_data;\\n\\t\\tfor(int unit = 0; unit < 5; unit++)new_data.unit_table[unit].set(BIG_NUM,BIG_NUM);\\n\\n\\t\\tcollide = false;\\n\\t\\tcount = 0;\\n\\t\\tnew_data.min_task = BIG_NUM,new_data.max_task = -BIG_NUM;\\n\\n\\t\\tfor(int task = Q.front().min_task; task <= Q.front().max_task; task++){\\n\\t\\t\\tfor(int unit = 0; unit < 5; unit++){\\n\\t\\t\\t\\tif(Q.front().unit_table[unit].task == task){\\n\\n\\t\\t\\t\\t\\tif(Q.front().unit_table[unit].num < N-1){\\n\\t\\t\\t\\t\\t\\tnew_data.min_task = min(new_data.min_task,task);\\n\\t\\t\\t\\t\\t\\tnew_data.max_task = max(new_data.max_task,task);\\n\\n\\t\\t\\t\\t\\t\\tint next_loc = loc[Q.front().unit_table[unit].num+1];\\n\\t\\t\\t\\t\\t\\tif(new_data.unit_table[next_loc].task == BIG_NUM){\\n\\t\\t\\t\\t\\t\\t\\tcount++;\\n\\t\\t\\t\\t\\t\\t\\tnew_data.unit_table[next_loc].task = task;\\n\\t\\t\\t\\t\\t\\t\\tnew_data.unit_table[next_loc].num = Q.front().unit_table[unit].num+1;\\n\\n\\t\\t\\t\\t\\t\\t\\tif(task == 9 && Q.front().unit_table[unit].num+1 == N-1){\\n\\t\\t\\t\\t\\t\\t\\t\\tprintf(\\\"%d\\\\n\\\",Q.front().clock+1);\\n\\t\\t\\t\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\t\\tcollide = true;\\n\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(collide)break;\\n\\t\\t}\\n\\t\\tif(collide){\\n\\t\\t\\tQ.pop();\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\n\\t\\tif(new_data.unit_table[loc[0]].task == BIG_NUM && new_data.max_task < 9){\\n\\t\\t\\tData new_data_add;\\n\\t\\t\\tfor(int unit = 0; unit < 5; unit++){\\n\\t\\t\\t\\tnew_data_add.unit_table[unit].set(new_data.unit_table[unit].task,new_data.unit_table[unit].num);\\n\\t\\t\\t}\\n\\t\\t\\tnew_data_add.unit_table[loc[0]].set(new_data.max_task+1,0);\\n\\t\\t\\tnew_data_add.clock = Q.front().clock+1;\\n\\t\\t\\tnew_data_add.min_task = new_data.min_task;\\n\\t\\t\\tnew_data_add.max_task = new_data.max_task+1;\\n\\n\\t\\t\\tQ.push(new_data_add);\\n\\t\\t}\\n\\n\\t\\tif(count > 0){\\n\\t\\t\\tnew_data.clock = Q.front().clock+1;\\n\\t\\t\\tQ.push(new_data);\\n\\t\\t}\\n\\t\\tQ.pop();\\n\\t}\\n}\\n\\n\\nint main(){\\n\\n\\twhile(true){\\n\\t\\tscanf(\\\"%d\\\",&N);\\n\\t\\tif(N == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4456,\n \"score_of_the_acc\": -0.1626,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1204_2062326\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\nusing ld = long double;\\nconst ld eps = 1e-9;\\n\\n//// < \\\"d:\\\\d_download\\\\visual studio 2015\\\\projects\\\\programing_contest_c++\\\\debug\\\\a.txt\\\" > \\\"d:\\\\d_download\\\\visual studio 2015\\\\projects\\\\programing_contest_c++\\\\debug\\\\b.txt\\\"\\n\\nint getans(const bitset<19>&bs,int rest,vector<vector<int>>&memo,vector<int>&confs) {\\n\\tif (!rest)return 0;\\n\\telse {\\n\\t\\tif (memo[rest][bs.to_ulong()] != -1)return memo[rest][bs.to_ulong()];\\n\\t\\telse {\\n\\t\\t\\tint ans = 10000;\\n\\t\\t\\tfor (int bet = 1; bet < 19; ++bet) {\\n\\t\\t\\t\\tbool ok = true;\\n\\t\\t\\t\\tfor (int i = bet; i < 19; ++i) {\\n\\t\\t\\t\\t\\tif (bs[i] && confs[bet+18-i]) {\\n\\t\\t\\t\\t\\t\\tok = false;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (ok) {\\n\\t\\t\\t\\t\\tbitset<19>nextbs;\\n\\t\\t\\t\\t\\tfor (int i = 0; i < 19 -bet; ++i) {\\n\\t\\t\\t\\t\\t\\tnextbs[i] = bs[i + bet];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tnextbs[18] = true;\\n\\t\\t\\t\\t\\tans = min(ans,bet + getans(nextbs, rest - 1, memo, confs));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn memo[rest][bs.to_ulong()] = ans;\\n\\t\\t}\\n\\t}\\n}\\n\\nint main() {\\n\\twhile (1) {\\n\\t\\tint N; cin >> N;\\n\\t\\tif (!N)break;\\n\\t\\tvector<vector<int>>tables(5, vector<int>(N));\\n\\t\\tfor (int i = 0; i < 5; ++i) {\\n\\t\\t\\tstring st; cin >> st;\\n\\t\\t\\tfor (int j = 0; j < N; ++j) {\\n\\t\\t\\t\\ttables[i][j] = (st[j] == 'X');\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvector<int>conf(41);\\n\\t\\tfor (int i = 1; i < N; ++i) {\\n\\t\\t\\tfor (int y = 0; y < 5; ++y) {\\n\\t\\t\\t\\tfor (int l = 0; l < N-i; ++l) {\\n\\t\\t\\t\\t\\tint r = l + i;\\n\\t\\t\\t\\t\\tif (tables[y][l] && tables[y][r])conf[i] = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tbitset<19>bs;\\n\\t\\tvector<vector<int>>memo(11, vector<int>(1 << 19,-1));\\n\\t\\tint ans = getans(bs, 10, memo, conf);\\n\\t\\tcout << ans+N-1 << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 27412,\n \"score_of_the_acc\": -1.0113,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1204_1953384\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <string>\\n#include <vector>\\n#include <deque>\\n#include <list>\\n#include <algorithm>\\n#include <numeric>\\n#include <functional>\\n#include <cmath>\\n#include <cstring>\\n#include <cctype>\\n#include <sstream>\\n#include <set>\\n#include <map>\\n#include <stack>\\n#include <queue>\\n#include <complex>\\nusing namespace std;\\n#define REP(i,n) for(int i = 0; i < (int)n; i++)\\n#define FOR(i,a,b) for(int i = a; i < (int)b; i++)\\n#define pb push_back\\n#define mp make_pair\\ntypedef vector<int> vi;\\ntypedef pair<int, int> pi;\\ntypedef long long ll;\\nconst int INF = 1<<28;\\nconst ll MOD = 1000000007;\\nvector<pi> x;\\nint n, ans;\\n\\nvoid dfs(int pnt, int cnt, bool b[5][200]) {\\n\\tif(pnt + n > ans) return;\\n\\tif(cnt == 10) {\\n\\t\\tans = min(ans, pnt + n-1);\\n\\t\\treturn;\\n\\t}\\n\\tREP(i, x.size()) {\\n\\t\\tif(b[x[i].first][x[i].second + pnt]) {\\n\\t\\t\\tdfs(pnt+1, cnt, b);\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t}\\n\\tREP(i, x.size())\\n\\t\\tb[x[i].first][x[i].second + pnt] = true;\\n\\tdfs(pnt+1, cnt+1, b);\\n\\tREP(i, x.size())\\n\\t\\tb[x[i].first][x[i].second + pnt] = false;\\n\\tdfs(pnt+1, cnt, b);\\n\\treturn;\\n}\\n\\nint main() {\\n\\tios_base::sync_with_stdio(0);\\n\\tcin.tie(0);\\n\\twhile(cin >> n, n) {\\n\\t\\tans = n * 10;\\n\\t\\tx.clear();\\n\\t\\tREP(i, 5) REP(j, n) {\\n\\t\\t\\tchar c; cin >> c;\\n\\t\\t\\tif(c == 'X')\\n\\t\\t\\t\\tx.pb(mp(i, j));\\n\\t\\t}\\n\\t\\tbool b[5][200] = {};\\n\\t\\tdfs(0, 0, b);\\n\\t\\tcout << ans << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1204,\n \"score_of_the_acc\": -0.0439,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1204_1171799\",\n \"code_snippet\": \"#include <iostream>\\n#include <complex>\\n#include <sstream>\\n#include <string>\\n#include <algorithm>\\n#include <deque>\\n#include <list>\\n#include <map>\\n#include <numeric>\\n#include <queue>\\n#include <vector>\\n#include <set>\\n#include <limits>\\n#include <cstdio>\\n#include <cctype>\\n#include <cmath>\\n#include <cstring>\\n#include <cstdlib>\\n#include <ctime>\\nusing namespace std;\\n#define REP(i, j) for(int i = 0; i < (int)(j); ++i)\\n#define FOR(i, j, k) for(int i = (int)(j); i < (int)(k); ++i)\\n#define SORT(v) sort((v).begin(), (v).end())\\n#define REVERSE(v) reverse((v).begin(), (v).end())\\ntypedef complex<double> P;\\nconst int M = 5;\\nconst int INF = 1e9;\\n\\nint N, ans = INF;\\n\\nint count(vector< vector<int> > &v){\\n int ret = 0, j;\\n REP(i, M){\\n for(j = (int)v[i].size() - 1; j >= 0 && v[i][j] == -1; --j) ;\\n ret = max(ret, j);\\n }\\n return ret + 1;\\n}\\n\\nbool check(int x, int s, vector< vector<int> > &v, vector< vector<int> > &t){\\n REP(i, M) REP(j, N) if(t[i][j] && v[i][j + x + s] != -1) return false;\\n return true;\\n}\\n\\nvoid dfs(int n, int x, vector< vector<int> > &v, vector< vector<int> > &t){\\n if(n >= 10) if(x + N < ans) ans = x + N;\\n if(x + N >= ans) return ;\\n FOR(_, 1, N + 1){\\n if(!check(x, _, v, t)) continue;\\n REP(i, M) REP(j, N) if(t[i][j]) v[i][j + x + _] = n;\\n dfs(n + 1, x + _, v, t);\\n REP(i, M) REP(j, N) if(t[i][j]) v[i][j + x + _] = -1;\\n }\\n}\\n\\nint main() {\\n while(cin >>N && N){\\n ans = INF;\\n vector< vector<int> > t(M, vector<int>(N)), v(M, vector<int>(N * 12, -1));\\n REP(i, M){\\n REP(j, N){\\n char c; cin >>c;\\n t[i][j] = (c == 'X' ? 1 : 0);\\n if(t[i][j]) v[i][j] = 0;\\n }\\n }\\n dfs(1, 0, v, t);\\n cout <<ans <<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1220,\n \"score_of_the_acc\": -0.0445,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1204_1010649\",\n \"code_snippet\": \"#include<iostream>\\n#include<bitset>\\n#include<array>\\n#include<utility>\\n#include<vector>\\n\\nusing namespace std;\\n\\ntypedef array<bitset<200>,5> Board;\\n\\nint main(){\\n for(int n;cin>>n,n;){\\n Board b;\\n for(int i=0;i<5;i++){\\n for(int j=0;j<n;j++){\\n\\tchar c;\\n\\tcin>>c;\\n\\tb[i][j]=c=='X';\\n }\\n }\\n const int BW=20;\\n static bool t[1<<BW];\\n for(int i=0;i<1<<BW;i++){\\n Board c;\\n Board cb=b;\\n for(int j=0;j<BW;j++){\\n\\tif(i>>j&1){\\n\\t for(int k=0;k<5;k++){\\n\\t c[k]|=cb[k];\\n\\t }\\n\\t}\\n\\tfor(auto &e:cb){\\n\\t e<<=1;\\n\\t}\\n }\\n bool f=false;\\n for(int j=0;j<5;j++){\\n\\tf|=(c[j]&b[j]).any();\\n }\\n t[i]=!f;\\n }\\n static int mem[1<<BW];\\n fill(begin(mem),end(mem),-1);\\n vector<pair<int,int> > stats[222];\\n stats[0].emplace_back(0,0);\\n for(int i=0;;i++){\\n for(auto e:stats[i]){\\n\\tint f=e.first;\\n\\tint s=e.second;\\n\\tif(f==10){\\n\\t cout<<i+n-1<<endl;\\n\\t goto next;\\n\\t}\\n\\tif(mem[s]>=f)continue;\\n\\tmem[s]=f;\\n\\tstats[i+1].emplace_back(f,s<<1&(1<<BW)-1);\\n\\tif(t[s]){\\n\\t stats[i+1].emplace_back(f+1,(s|1)<<1&(1<<BW)-1);\\n\\t}\\n }\\n }\\n next:\\n ;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5720,\n \"memory_kb\": 6452,\n \"score_of_the_acc\": -1.043,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1204_896174\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <string>\\n#include <sstream>\\n#include <cstring>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cmath>\\n#include <queue>\\n#include <stack>\\n#include <map>\\n#include <set>\\n#include <numeric>\\n#include <cctype>\\n#include <tuple>\\n#include <array>\\n\\n#ifdef _MSC_VER\\n#include <agents.h>\\n#endif\\n\\n#define FOR(i, a, b) for(int i = (a); i < (int)(b); ++i)\\n#define rep(i, n) FOR(i, 0, n)\\n#define ALL(v) v.begin(), v.end()\\n#define REV(v) v.rbegin(), v.rend()\\n#define MEMSET(v, s) memset(v, s, sizeof(v))\\n#define X first\\n#define Y second\\n\\nusing namespace std;\\n\\nint ok[1 << 20];\\nint used[5][50];\\nint dp[2][1 << 20];\\n\\n\\n\\nint main(){\\n\\tint n;\\n\\twhile (cin >> n, n){\\n\\t\\tarray<string, 5> ar;\\n\\t\\trep(i, 5) cin >> ar[i];\\n\\n\\t\\tint len = 0;\\n\\t\\trep(i, 5) rep(j, n) if (ar[i][j] == 'X') len = max(len, j+1);\\n\\n\\t\\trep(i, 1 << n){\\n\\t\\t\\tok[i] = 1;\\n\\t\\t\\tMEMSET(used, 0);\\n\\t\\t\\trep(j, n){\\n\\t\\t\\t\\tif (i&(1 << j)){\\n\\t\\t\\t\\t\\trep(k, 5) rep(l, n){\\n\\t\\t\\t\\t\\t\\tif (ar[k][l] != 'X') continue;\\n\\t\\t\\t\\t\\t\\tif (used[k][l+j]) ok[i] = 0;\\n\\t\\t\\t\\t\\t\\tused[k][l+j] = 1;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\t//if (ok[i]){\\n\\t\\t\\t//\\trep(j, n) cout << !!(i&(1 << j));\\n\\t\\t\\t//\\tcout << endl;\\n\\t\\t\\t//}\\n\\t\\t}\\n\\t\\tint mask = (1 << n) - 1;\\n\\n\\t\\tMEMSET(dp, 0);\\n\\t\\trep(i, n * 15){\\n\\t\\t\\trep(j, 1 << n){\\n\\t\\t\\t\\tint nxt = (i + 1) & 1, bits = (j << 1)&mask;\\n\\t\\t\\t\\tdp[nxt][bits] = max(dp[nxt][bits], dp[i & 1][j]);\\n\\t\\t\\t\\tif (ok[bits | 1]) dp[nxt][bits | 1] = max(dp[nxt][bits | 1], dp[i & 1][j] + 1);\\n\\t\\t\\t\\tif (dp[nxt][bits | 1] == 10){\\n\\t\\t\\t\\t\\tcout << i + len << endl;\\n\\t\\t\\t\\t\\tgoto end;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t//rep(j, 1 << n){\\n\\t\\t\\t//\\t\\trep(k, n) cout << !!(j&(1 << n-k-1));\\n\\t\\t\\t//\\t\\tcout << endl;\\n\\t\\t\\t//\\t\\tcout << dp[i + 1 & 1][j] << endl;\\n\\t\\t\\t//}\\n\\t\\t}\\n\\tend:;\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 11444,\n \"score_of_the_acc\": -0.4175,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1204_652113\",\n \"code_snippet\": \"#include<iostream>\\nusing namespace std;\\n\\nint n;\\nint c;\\nstring p[5];\\n\\nint rec(int id,int st,int pos){\\n if(id == 10){\\n return pos + n;\\n }\\n \\n int res = 10000;\\n for(int i=1;i<n;i++){\\n if(pos+i>=res)return res;\\n if(!((st>>i)&1)){\\n int nxt = (st >> i) | c;\\n res = min(res,rec(id+1,nxt,pos+i));\\n }\\n }\\n return res;\\n}\\n\\nint main(){\\n cin.tie(0);\\n std::ios::sync_with_stdio(false);\\n while(cin >> n,n){\\n for(int i=0;i<5;i++)cin >> p[i];\\n\\n c = 0;\\n for(int i=1;i<n;i++){\\n bool f = true;\\n for(int j=0;j<5;j++){\\n\\tfor(int k=0;k<n;k++){\\n\\t if(k+i>=n)break;\\n\\t if(p[j][k] == p[j][k+i] && p[j][k] == 'X')f = false;\\n\\t}\\n }\\n if(!f)c |= 1<<i;\\n }\\n cout << rec(1,c,0) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 1200,\n \"score_of_the_acc\": -0.0466,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1204_652110\",\n \"code_snippet\": \"#include<iostream>\\nusing namespace std;\\n\\nint n;\\nint c;\\nstring p[5];\\n\\nint rec(int id,int st,int pos){\\n if(id == 10){\\n return pos + n;\\n }\\n \\n int res = 10000;\\n for(int i=1;i<n;i++){\\n if(!((st>>i)&1)){\\n int nxt = (st >> i) | c;\\n res = min(res,rec(id+1,nxt,pos+i));\\n }\\n }\\n return res;\\n}\\n\\nint main(){\\n while(cin >> n,n){\\n for(int i=0;i<5;i++)cin >> p[i];\\n\\n c = 0;\\n for(int i=1;i<n;i++){\\n bool f = true;\\n for(int j=0;j<5;j++){\\n\\tfor(int k=0;k<n;k++){\\n\\t if(k+i>=n)break;\\n\\t if(p[j][k] == p[j][k+i] && p[j][k] == 'X'){\\n\\t f = false;\\n\\t break;\\n\\t }\\n\\t}\\n\\tif(!f)break;\\n }\\n if(!f)c |= 1<<i;\\n }\\n\\n cout << rec(1,c,0) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 1204,\n \"score_of_the_acc\": -0.0468,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1204_628456\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n#include <string>\\n#include <algorithm>\\n#include <vector>\\n#include <stack>\\n#include <queue>\\n#include <set>\\n#include <map>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <cmath>\\n#include <cassert>\\n//C++11\\n#if __cplusplus == 201103L\\n#include <tuple>\\n#endif\\n\\nusing namespace std;\\n\\n#define FOR(i,k,n) for(int i=(k); i<(int)n; ++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\\n\\ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cout<<*i<<\\\" \\\"; cout<<endl; }\\n\\ntypedef long long ll;\\nconst int INF = 100000000;\\nconst double EPS = 1e-8;\\nconst int MOD = 1000000007;\\nint W;\\nbool used[5][410] = {};\\nvector<string> grid;\\nint min_ans;\\nint dfs(int p, int bx){\\n if(min_ans <= (10 - p) + bx + W - 1) return INF;\\n if(p == 10) {\\n return min_ans = bx + W - 1;\\n }\\n int res = INF;\\n for(int dx = 0; dx <= W; dx++){\\n if(p == 0 && dx > 0) break;\\n bool bad = false;\\n REP(y, 5) REP(x, W) if(grid[y][x] == 'X' && used[y][bx + dx + x]) bad = true;\\n if(bad) continue;\\n REP(y, 5) REP(x, W) if(grid[y][x] == 'X') used[y][bx + dx + x] = true;\\n res = min(res, dfs(p + 1, bx + dx + 1));\\n REP(y, 5) REP(x, W) if(grid[y][x] == 'X') used[y][bx + dx + x] = false;\\n }\\n return res;\\n}\\n\\nint main(){\\n while(cin>>W && W){\\n grid.assign(5, \\\"\\\");\\n REP(i, 5) cin>>grid[i];\\n bool empty = true;\\n REP(y, 5) REP(x, W) if(grid[y][x] != '.') empty = false;\\n assert(not empty);\\n memset(used, 0, sizeof(used));\\n min_ans = INF;\\n cout << dfs(0, 0) << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1216,\n \"score_of_the_acc\": -0.0444,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1204_618446\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <vector>\\n#include <complex>\\n#include <algorithm>\\n#include <set>\\n#include <map>\\n#include <queue>\\n#include <string>\\n#include <cstring>\\n#include <stack>\\n#include <cmath>\\n#include <iomanip>\\n#include <sstream>\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef ll li;\\ntypedef pair<int,int> PI;\\n\\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\\n#define REP(i,m,n) for(int i=m; i<=(int)(n); ++i)\\n#define F first\\n#define S second\\n#define mp(a,b) make_pair(a,b)\\n#define pb(a) push_back(a)\\n#define SZ(a) (int)((a).size())\\n#define ALL(a) a.begin(),a.end()\\n#define FOR(it,a) for(__typeof(a.begin())it=a.begin();it!=a.end();++it)\\n\\nint n;\\n\\nstring in[5];\\n\\nbool nok(int sz){\\n rep(i,5)\\n rep(j,SZ(in[i]))\\n if(sz+j<SZ(in[i]))\\n if(in[i][j]=='X' && in[i][sz+j]=='X')\\n return true;\\n\\n return false;\\n}\\n\\nbool nokl[200];\\nint ans;\\nint len[10];\\nvoid dfs(int ne,int nlen){\\n if(ne==10){\\n if(nlen+n-1<ans){\\n ans = nlen+n-1;\\n //cout << ans << endl;\\n }\\n return;\\n }\\n \\n //cout << ne << ' ' << nlen << endl;\\n\\n for(int i=nlen;i<=nlen+n-1;++i){\\n //if(i+n>ans) break;\\n bool tok = false;\\n rep(j,ne) if(nokl[i-len[j]]){\\n tok=true;\\n break;\\n }\\n if(tok) continue;\\n len[ne] = i;\\n dfs(ne+1,i+1);\\n }\\n}\\n\\nvoid solve(){\\n memset(nokl,0,sizeof(nokl));\\n rep(i,5) cin >> in[i];\\n\\n \\n rep(i,SZ(in[0])){\\n nokl[i+1] = nok(i+1);\\n //if(nokl[i+1]) cout << i+1 << endl;\\n }\\n ans = 10*n;\\n dfs(0,0);\\n cout << ans << endl;\\n}\\n\\nmain(){\\n while(cin >> n,n) solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 7080,\n \"memory_kb\": 1204,\n \"score_of_the_acc\": -1.0439,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1204_618445\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <vector>\\n#include <complex>\\n#include <algorithm>\\n#include <set>\\n#include <map>\\n#include <queue>\\n#include <string>\\n#include <cstring>\\n#include <stack>\\n#include <cmath>\\n#include <iomanip>\\n#include <sstream>\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef ll li;\\ntypedef pair<int,int> PI;\\n\\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\\n#define REP(i,m,n) for(int i=m; i<=(int)(n); ++i)\\n#define F first\\n#define S second\\n#define mp(a,b) make_pair(a,b)\\n#define pb(a) push_back(a)\\n#define SZ(a) (int)((a).size())\\n#define ALL(a) a.begin(),a.end()\\n#define FOR(it,a) for(__typeof(a.begin())it=a.begin();it!=a.end();++it)\\n\\nint n;\\n\\nstring in[5];\\n\\nbool nok(int sz){\\n rep(i,5)\\n rep(j,SZ(in[i]))\\n if(sz+j<SZ(in[i]))\\n if(in[i][j]=='X' && in[i][sz+j]=='X')\\n return true;\\n\\n return false;\\n}\\n\\nbool nokl[200];\\nint ans;\\nint len[10];\\nvoid dfs(int ne,int nlen){\\n if(ne==10){\\n if(nlen+n-1<ans){\\n ans = nlen+n-1;\\n //cout << ans << endl;\\n }\\n return;\\n }\\n \\n //cout << ne << ' ' << nlen << endl;\\n\\n for(int i=nlen;i<=nlen+n-1;++i){\\n //if(i+n>ans) break;\\n bool tok = false;\\n rep(j,ne) if(nokl[i-len[j]]) tok=true;\\n if(tok) continue;\\n len[ne] = i;\\n dfs(ne+1,i+1);\\n }\\n}\\n\\nvoid solve(){\\n memset(nokl,0,sizeof(nokl));\\n rep(i,5) cin >> in[i];\\n\\n \\n rep(i,SZ(in[0])){\\n nokl[i+1] = nok(i+1);\\n //if(nokl[i+1]) cout << i+1 << endl;\\n }\\n ans = 10*n;\\n dfs(0,0);\\n cout << ans << endl;\\n}\\n\\nmain(){\\n while(cin >> n,n) solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6320,\n \"memory_kb\": 1204,\n \"score_of_the_acc\": -0.9364,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1204_618064\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<vector>\\n#include<string>\\n#include<stack>\\nusing namespace std;\\n\\nint n, t;\\nint head[10] = {0};\\nint rsv[5][20];\\nvector<vector<int> > crsv(5);\\n\\nbool mCheck(int head){\\n\\tfor(int a = 0; a < 5; a++){\\n\\t\\tfor(int b = 0; b < n; b++){\\n\\t\\t\\tif(crsv[a][head+b] == 1 && rsv[a][b] == 1) return false;\\n\\t\\t}\\n\\t}\\n\\treturn true;\\n}\\n\\nvoid set_crsv(int head){\\n\\tfor(int a = 0; a < 5; a++){\\n\\t\\tfor(int b = 0; b < n; b++){\\n\\t\\t\\tif(rsv[a][b] == 1) crsv[a][head+b] = 1;\\n\\t\\t}\\n\\t}\\n}\\n\\nvoid clear_crsv(int head){\\n\\tfor(int a = 0; a < 5; a++){\\n\\t\\tfor(int b = 0; b < n; b++){\\n\\t\\t\\tif(rsv[a][b] == 1) crsv[a][head+b] = 0;\\n\\t\\t}\\n\\t}\\n}\\n\\nint main(){\\n\\tint i, j;\\n\\tstring str;\\n\\t\\n\\tfor(i = 0; i < crsv.size(); i++) crsv[i] = vector<int>(201);\\n\\twhile(1){\\n\\t\\tint ans = 99999;\\n\\n\\t\\tcin >> n;\\n\\t\\tif(n == 0) break;\\n\\t\\tfor(i = 0; i < 5; i++){\\n\\t\\t\\tfor(j = 0; j < 201; j++){\\n\\t\\t\\t\\tcrsv[i][j] = 0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor(i = 0; i < 5; i++){\\n\\t\\t\\tcin >> str;\\n\\t\\t\\tfor(j = 0; str[j] != 0; j++){\\n\\t\\t\\t\\tif(str[j] == 'X') {\\n\\t\\t\\t\\t\\trsv[i][j] = 1;\\n\\t\\t\\t\\t\\tcrsv[i][j] = 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\trsv[i][j] = 0;\\n\\t\\t\\t\\t\\tcrsv[i][j] = 0;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tstack<pair<int, int> > stk;\\n\\t\\tstack<vector<vector<int> > > stk2;\\n\\t\\t\\n\\t\\tstk.push(make_pair(0,0));\\n\\t\\tstk2.push(crsv);\\n\\t\\twhile(!stk.empty()){\\n\\t\\t\\tpair<int, int> tv = stk.top();\\n\\t\\t\\tcrsv = stk2.top();\\n\\t\\t\\tstk.pop();\\n\\t\\t\\tstk2.pop();\\n\\t\\t\\tset_crsv(tv.second);\\n\\t\\t\\t\\n\\t\\t\\tif(tv.second > ans) continue;\\n\\t\\t\\tif(tv.first == 9){\\n\\t\\t\\t\\t//cout << \\\"A\\\" << tv.first << \\\" \\\" << tv.second << endl;\\n\\t\\t\\t\\tans = min(ans, tv.second);\\n\\t\\t\\t\\t/*\\n\\t\\t\\t\\tfor(i = 0; i < 5; i++){\\n\\t\\t\\t\\t\\tfor(j = 0; j < 30; j++){\\n\\t\\t\\t\\t\\t\\tcout << crsv[i][j];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tcout << endl;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t*/\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\t/*\\n\\t\\t\\tcout << \\\"POP: \\\";\\n\\t\\t\\tcout << tv.first << \\\" \\\" << tv.second;\\n\\t\\t\\tcout << endl;\\n\\t\\t\\t*/\\n\\t\\t\\t\\n\\t\\t\\ttv.first++;\\t\\t\\t\\t\\n\\t\\t\\tfor(i = n-1; i >= 0; i--){\\n\\t\\t\\t\\tif(mCheck(tv.second + i)){\\n\\t\\t\\t\\t\\ttv.second += i;\\n\\t\\t\\t\\t\\t/*\\n\\t\\t\\t\\t\\tcout << \\\"PUSH: \\\";\\n\\t\\t\\t\\t\\tcout << tv.first << \\\" \\\" << tv.second;\\n\\t\\t\\t\\t\\tcout << endl;\\n\\t\\t\\t\\t\\t*/\\n\\t\\t\\t\\t\\tstk.push(tv);\\n\\t\\t\\t\\t\\tstk2.push(crsv);\\n\\t\\t\\t\\t\\ttv.second -= i;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t//if(stk.top().second <= tv.second) clear_crsv(tv.second);\\t\\t\\t\\n\\t\\t}\\n\\t\\t\\n\\t\\tans += n;\\n\\t\\tcout << ans << endl;\\n\\t\\t\\n\\t}\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 1364,\n \"score_of_the_acc\": -0.0526,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1204_497929\",\n \"code_snippet\": \"#include<iostream>\\n#include<queue>\\n#include<algorithm>\\n#include<functional>\\n\\nusing namespace std;\\n\\nvector<string> task;\\nconst int inf = 1<<22;\\n\\nstruct state{\\n int num;\\n int pos[10];\\n int cost;\\n state(){\\n cost = 0;\\n num = 0;\\n fill(pos,pos+10,-1);\\n }\\n state(int p[10], int n, int c){\\n copy(p,p+10,pos);\\n cost = c;\\n num = n;\\n }\\n bool operator>(const state &t)const{\\n return cost>t.cost;\\n }\\n};\\n\\nvoid rev(char M[5][300], const state &t){\\n for(int i = 0; i < 10; ++i){\\n if( t.pos[i] > -1 ){\\n for(int j = 0; j < (int)task.size(); ++j){\\n for(int k = 0; k < (int)task[j].size(); ++k){\\n if( task[j][k] != '.'){\\n M[j][t.pos[i]+k] = task[j][k];\\n }\\n }\\n }\\n }\\n }\\n}\\n\\nbool canPut(char M[5][300], int st, int offset){\\n for(int i = 0; i < (int)task.size(); ++i){\\n for(int j = 0; j < (int)task[i].size(); ++j){\\n if( task[i][j] != '.' && M[i][st+offset+j] != 0 ){\\n return false;\\n }\\n }\\n }\\n return true;\\n}\\n\\nint solve(int n){\\n state init;\\n init.num = 0;\\n init.pos[init.num] = 0;\\n init.cost = n;\\n int ret = inf;\\n\\n priority_queue<state, vector<state>, greater<state> > q;\\n int vis[10];\\n fill(vis,vis+10,inf);\\n \\n q.push(init);\\n while(!q.empty()){\\n state cur = q.top(); q.pop();\\n if( cur.num == 9 ){\\n return cur.cost;\\n ret = min(ret, cur.cost);\\n }\\n \\n int initial = *max_element(cur.pos,cur.pos+10);\\n char M[5][300] = {{0}};\\n rev(M,cur);\\n for(int off = 1; off <= n; ++off){\\n if(canPut(M,initial,off)){\\n state next = cur;\\n next.num++;\\n next.pos[next.num] = initial + off;\\n next.cost = initial + off + n;\\n \\n if( vis[next.num] > next.cost ){\\n // vis[next.num] = next.cost;\\n q.push(next);\\n }\\n }\\n }\\n }\\n return ret;\\n}\\n\\nint main()\\n{\\n int n;\\n while(true){\\n task.clear();\\n cin >> n;\\n if(n == 0) break;\\n for(int i = 0; i < 5; ++i){\\n string s;\\n cin >> s;\\n task.push_back(s);\\n }\\n cout << solve(n) << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 2128,\n \"score_of_the_acc\": -0.079,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1204_386649\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstring>\\nusing namespace std;\\n\\nint n, res;\\nchar t[5][22], ans[5][302];\\n\\nbool check(int idx){\\n for(int i = 0; i < 5; i++){\\n for(int j = 0; j < n; j++){\\n if(t[i][j] == 'X' && ans[i][idx + j] != '.'){\\n return false;\\n }\\n }\\n }\\n return true;\\n}\\n\\nvoid draw(int idx, char ch){\\n for(int i = 0; i < 5; i++){\\n for(int j = 0; j < n; j++){\\n if(t[i][j] == 'X'){\\n ans[i][idx + j] = ch;\\n }\\n }\\n }\\n}\\n\\nvoid dfs(int idx, int cnt){\\n if(cnt == 10){\\n res = min(res, idx - 1);\\n return;\\n }\\n if(idx > cnt * n || idx == res){\\n return;\\n }\\n\\n dfs(idx + 1, cnt);\\n\\n if(check(idx)){\\n draw(idx, '0' + cnt);\\n dfs(idx + 1, cnt + 1);\\n draw(idx, '.');\\n }\\n}\\n\\nint main(){\\n while(cin >> n, n){\\n for(int i = 0; i < 5; i++){\\n cin >> t[i];\\n }\\n memset(ans, '.', sizeof(ans));\\n res = n * 10 - n;\\n dfs(0, 0);\\n cout << res + n << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 876,\n \"score_of_the_acc\": -0.0362,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1204_250870\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <vector>\\n#include <algorithm>\\n#include <complex>\\n#include <queue>\\n#include <map>\\n#include <set>\\n#include <cstring>\\n#include <cstdlib>\\n#include <string>\\n#include <cmath>\\n#include <bitset>\\nusing namespace std;\\n\\n#define REP(i,n) for(int i=0;i<(int)n;++i)\\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\\n#define ALL(c) (c).begin(), (c).end()\\nconst int INF = 1<<29;\\n\\n\\nint n;\\nint dame;\\n\\nint rec(int S, int num) { // ツつサツづ個クツδ債ッツクツづタツスツクツづーツ始ツづ淞づァツづェツづ按つッツづェツづ篠ビツッツトツつェツ１\\n// cout << bitset<7>(S) << \\\" \\\" << num << endl;\\n if (num == 10) return n;\\n int res = INF;\\n for (int i=1;i<n;++i) {\\n if (!(S >> i & 1)) {\\n int tmp = S >> i;\\n tmp |= dame;\\n res = min(res, rec(tmp, num+1) + i);\\n }\\n }\\n return res;\\n}\\n\\nint main() {\\n while(cin>>n,n) {\\n int table[n];\\n REP(i,5) {\\n REP(j,n) {\\n char c;\\n cin >> c;\\n if (c == 'X')\\n table[j] = i; \\n }\\n }\\n dame = 0;\\n for (int i=1; i<n; ++i) {\\n REP(j, i) {\\n if (table[i] == table[j]) {\\n dame |= 1 << i-j;\\n }\\n }\\n }\\n cout << rec(dame,1) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 0,\n \"score_of_the_acc\": -0.0057,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1204_121463\",\n \"code_snippet\": \"#include <iostream>\\n#include <queue>\\nusing namespace std;\\n\\nint n;\\nint data[5][20];\\n\\nclass State {\\npublic:\\n int clock;\\n int cnt;\\n int task[5][40];\\n\\n bool operator <(const State &s) const {\\n return clock > s.clock;\\n }\\n\\n State() {\\n clock = 0;\\n cnt = 0;\\n for(int i = 0; i < 5; i++) {\\n for(int j = 0; j < 40; j++) {\\n\\ttask[i][j] = 0;\\n }\\n }\\n }\\n\\n bool isPut() {\\n for(int i = 0; i < 5; i++) {\\n for(int j = 0; j < n; j++) {\\n\\tif(data[i][j] == 1 && task[i][40-n+j] != 0) return false;\\n }\\n }\\n return true;\\n }\\n\\n void put() {\\n for(int i = 0; i < 5; i++) {\\n for(int j = 0; j < n; j++) {\\n\\ttask[i][40-n+j] += data[i][j];\\n }\\n }\\n cnt++;\\n }\\n\\n void shiftL() {\\n for(int i = 0; i < 5; i++) {\\n for(int j = 0; j < 40; j++) {\\n\\tif(j+1 == 40) task[i][j] = 0;\\n\\telse task[i][j] = task[i][j+1];\\n }\\n }\\n clock++;\\n }\\n};\\n\\nvoid bfs() {\\n priority_queue<State> PQ;\\n State s;\\n s.put();\\n s.clock = n;\\n PQ.push(s);\\n while(!PQ.empty()) {\\n s = PQ.top();\\n PQ.pop();\\n\\n if(s.cnt == 10) {\\n cout << s.clock << endl;\\n break;\\n }\\n\\n for(int i = 0; i < n; i++) {\\n s.shiftL();\\n State s2 = s;\\n if(s2.isPut()) {\\n\\ts2.put();\\n\\tPQ.push(s2);\\n }\\n }\\n }\\n}\\n\\nint main() {\\n while(1) {\\n cin >> n;\\n if(n == 0) break;\\n for(int i = 0; i < 5; i++) {\\n for(int j = 0; j < n; j++) {\\n\\tchar c;\\n\\tcin >> c;\\n\\tif(c == 'X') data[i][j] = 1;\\n\\telse data[i][j] = 0;\\n }\\n }\\n\\n bfs();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 12000,\n \"score_of_the_acc\": -0.4562,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1204_26646\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\nusing namespace std;\\n#define rep(i, n) for ( int i = 0; i < n; i++)\\n#define MAX 20\\n#define H 5\\n#define N 10\\n\\nint n, minw;\\nchar P[H][MAX], B[H][MAX*N];\\n\\nbool invalid(int p){\\n rep(i, H) rep(j, n){\\n\\tif ( P[i][j] == 'X' && B[i][j+p] != '.' ) return true;\\n }\\n return false;\\n}\\n\\nvoid setTask(int p, char ch){\\n rep(i, H) for ( int j = p; j < p+n; j++ ){\\n\\tif ( P[i][j-p] == 'X' )\\tB[i][j] = ch;\\n }\\n}\\n\\nvoid rec( int pos, int last){\\n if ( pos == N ){ minw = min(minw, last+n); return; }\\n if ( minw <= last+n-1 + (n-pos) ) return;\\n for ( int j = last+1; j <= last+n; j++ ){\\n\\tif ( invalid(j) ) continue;\\n\\tsetTask(j, 'X');\\n\\trec(pos+1, j);\\n\\tsetTask(j, '.');\\n }\\n}\\n\\nvoid init(){\\n minw = (1<<21);\\n rep(i, H) rep(j, MAX*N) B[i][j] = '.';\\n}\\n\\nmain(){\\n while ( cin >> n && n ){\\n\\trep(i, H) rep(j, n) cin >> P[i][j];\\n\\tinit();\\n\\trec(0, -1);\\n\\tcout << minw << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 868,\n \"score_of_the_acc\": -0.0373,\n \"final_rank\": 3\n }\n]","isConversational":false}}},{"rowIdx":676,"cells":{"group_id":{"kind":"string","value":"aoj_1218_cpp"},"problem_description":{"kind":"string","value":"Problem C:\nPush!!\nMr. Schwarz was a famous powerful pro wrestler. He starts a part time job as a warehouseman.\nHis task is to move a cargo to a goal by repeatedly pushing the cargo in the warehouse, of course,\nwithout breaking the walls and the pillars of the warehouse.\nThere may be some pillars in the warehouse. Except for the locations of the pillars, the floor of\nthe warehouse is paved with square tiles whose size fits with the cargo. Each pillar occupies the\nsame area as a tile.\nInitially, the cargo is on the center of a tile. With one push, he can move the cargo onto the\ncenter of an adjacent tile if he is in proper position. The tile onto which he will move the cargo\nmust be one of (at most) four tiles (i.e., east, west, north or south) adjacent to the tile where\nthe cargo is present.\nTo push, he must also be on the tile adjacent to the present tile. He can only push the cargo in\nthe same direction as he faces to it and he cannot pull it. So, when the cargo is on the tile next\nto a wall (or a pillar), he can only move it along the wall (or the pillar). Furthermore, once he\nplaces it on a corner tile, he cannot move it anymore.\nHe can change his position, if there is a path to the position without obstacles (such as the cargo\nand pillars) in the way. The goal is not an obstacle. In addition, he can move only in the four\ndirections (i.e., east, west, north or south) and change his direction only at the center of a tile.\nAs he is not so young, he wants to save his energy by keeping the number of required pushes\nas small as possible. But he does not mind the count of his pedometer, because walking is very\nlight exercise for him.\nYour job is to write a program that outputs the minimum number of pushes required to move\nthe cargo to the goal, if ever possible.\nInput\nThe input consists of multiple maps, each representing the size and the arrangement of the\nwarehouse. A map is given in the following format.\nw h\nd\n11\nd\n12\nd\n13\n...\nd\n1\nw\nd\n21\nd\n22\nd\n23\n...\nd\n2\nw\n...\nd\nh\n1\nd\nh\n2\nd\nh\n3\n...\nd\nh\nw\nThe integers w and h are the lengths of the two sides of the floor of the warehouse in terms of\nwidths of floor tiles.\nw\nand\nh\nare less than or equal to 7. The integer\nd\nij\nrepresents what is\ninitially on the corresponding floor area in the following way.\n0: nothing (simply a floor tile)\n1: a pillar\n2: the cargo\n3: the goal\n4: the warehouseman (Mr. Schwarz)\nEach of the integers 2, 3 and 4 appears exactly once as\nd\nij\nin the map. Integer numbers in an\ninput line are separated by at least one space character. The end of the input is indicated by a\nline containing two zeros.\nOutput\nFor each map, your program should output a line containing the minimum number of pushes.\nIf the cargo cannot be moved to the goal, -1 should be output instead.\nSample Input\n5 5\n0 0 0 0 0\n4 2 0 1 1\n0 1 0 0 0\n1 0 0 0 3\n1 0 0 0 0\n5 3\n4 0 0 0 0\n2 0 0 0 0\n0 0 0 0 3\n7 5\n1 1 4 1 0 0 0\n1 1 2 1 0 0 0\n3 0 0 0 0 0 0\n0 1 0 1 0 0 0\n0 0 0 1 0 0 0\n6 6\n0 0 0 0 0 3\n0 0 0 0 0 0\n0 0 0 0 0 0\n0 0 0 0 0 0\n0 2\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1218_3807528","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\n\nconstexpr long double EPS = 1e-15;\nconst long double PI = acos(-1);\nconstexpr int inf = 2e9;\nconstexpr ll INF = 2e18;\nconstexpr ll MOD = 1e9+7;\nconstexpr ll MOD1 = 998244353;\ntypedef pair<ll,ll> P;\n\n//#define all(v) (v).begin(), (v).end()\n#define rep(i,a,b) for (int i = (a); i < (b); i++)\n#define REP(i,n) rep(i,0,n)\n#define sz(s) (s).size()\n#define pb push_back\n#define fi first\n#define se second\n//#define mp make_pair\n\nint w,h;\nint gh,gw;\nmap<string,int> mp;\nint dh[4] = {0,0,1,-1};\nint dw[4] = {1,-1,0,0};\n\nint id (int hh, int ww) {\n return w * hh + ww;\n}\n\nvoid out(string s) {\n REP(i,h) {\n REP(j,w) {\n cout << s[id(i,j)];\n }\n cout << endl;\n }\n cout << endl;\n}\n\nvoid solve() {\nwhile (cin >> w >> h) {\n if (w == 0 && h == 0) break;\n mp.clear();\n string s;\n REP(hh,h) {\n REP(ww,w) {\n char c;\n cin >> c;\n if (c == '3') {\n gh = hh;\n gw = ww;\n }\n s +=c;\n }\n }\n int ans = inf;\n mp[s] = 0;\n queue<pair<string,int>> que;\n que.push({s,0});\n while (!que.empty()) {\n string maze = que.front().fi;\n int cost = que.front().se;\n que.pop();\n if (cost > mp[maze]) continue;\n \n int hh = -1,ww;\n REP(i,h) {\n REP(j,w) {\n if (maze[id(i,j)] == '4') {\n hh = i;\n ww = j;\n break;\n }\n }\n if (hh != -1) break;\n }\n for (int i = 0; i < 4; i++) {\n\n int th = hh + dh[i];\n int tw = ww + dw[i];\n if (th < 0 || th >= h || tw < 0 || tw >= w) continue;\n if (maze[id(th,tw)] == '1') continue;\n\n if (maze[id(th,tw)] == '0' || maze[id(th,tw)] == '3') {\n string tmp = maze;\n swap(tmp[id(th,tw)], tmp[id(hh,ww)]);\n if (mp.count(tmp)) continue;\n mp[tmp] = cost;\n que.push({tmp, cost});\n }\n\n if (maze[id(th,tw)] == '2') {\n int tth = th + dh[i];\n int ttw = tw + dw[i];\n if (tth < 0 || tth >= h || ttw < 0 || ttw >= w) continue;\n if (maze[id(tth,ttw)] == '1') continue;\n string tmp = maze;\n swap(tmp[id(tth,ttw)], tmp[id(th,tw)]);\n swap(tmp[id(th,tw)], tmp[id(hh,ww)]);\n if (mp.count(tmp)) continue;\n mp[tmp] = cost + 1;\n if (tth == gh && ttw == gw) {\n ans = min(ans, cost + 1);\n continue;\n }\n que.push({tmp, cost + 1});\n }\n\n }\n }\n if (ans == inf) cout << -1 << endl;\n else cout << ans << endl;\n}\n}\n\n\nint main(int argc, char *argv[]){\n\n // /* Regular */\n // int case_num = 1;\n // if (argc > 1 && stoi(argv[1])) cin >> case_num;\n // REP(case_no, case_num) {\n // cerr << endl << \"case \" << case_no + 1 << endl;\n // solve();\n // }\n\n /* AOJ */\n solve();\n\n return 0;\n}","accuracy":1,"time_ms":190,"memory_kb":9176,"score_of_the_acc":-1.6,"final_rank":11},{"submission_id":"aoj_1218_1571205","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <queue>\n#define f first\n#define s second\n#define INF (1e9)\n#define N 7\nusing namespace std;\ntypedef pair<int,int> P;\nint bfs(int,int,int,int,int,int);\nbool check(int,int,int,int,int,int);\nint w,h,data[N][N],d[N][N],cnt[N][N];\nint dy[4]={-1,0,1,0};\nint dx[4]={0,1,0,-1};\ntypedef struct data{\n int cy,cx,wy,wx;\n} dat;\n\nint main(){\n int sy,sx,gy,gx,wy,wx,ans;\n while(1){\n cin>>w>>h;\n if(!w&&!h) break;\n for(int i=0;i<h;i++)\n for(int j=0;j<w;j++){\n\tcin >> data[i][j];\n\tif(data[i][j]==2) sy=i,sx=j;\n\telse if(data[i][j]==3) gy=i,gx=j;\n\telse if(data[i][j]==4) wy=i,wx=j;\n\td[i][j]=INF;\n }\n ans=bfs(sy,sx,wy,wx,gy,gx);\n cout << ans << endl;\n }\n return 0;\n}\n\nint bfs(int sy,int sx,int wy,int wx,int gy,int gx){\n queue<dat > q;\n int flag;\n dat k={sy,sx,wy,wx};\n q.push(k);\n d[sy][sx]=0;\n for(int i=0;i<N;i++)\n for(int j=0;j<N;j++) cnt[i][j]=0;\n while(!q.empty()){\n dat u=q.front();\n q.pop();\n flag=0;\n for(int i=0;i<4;i++){\n int ny=u.cy+dy[i],nx=u.cx+dx[i];\n if(ny<0||nx<0||h<=ny||w<=nx||data[ny][nx]==1) continue;\n if(check(u.wy,u.wx,u.cy-dy[i],u.cx-dx[i],u.cy,u.cx)){\n\td[ny][nx]=d[u.cy][u.cx]+1;\n\tcnt[nx][ny]++;\n\tif(cnt[nx][ny]==500){\n\t flag=1;\n\t break;\n\t}\n\tif(d[gy][gx]!=INF){\n\t flag=2;\n\t break;\n\t}\n\tdat t={ny,nx,u.cy-dy[i],u.cx-dx[i]};\n\tq.push(t);\n }\n }\n if(flag) break;\n }\n if(flag==2) return d[gy][gx];\n if(flag) return -1;\n if(d[gy][gx]!=INF) return d[gy][gx];\n return -1;\n}\n\nbool check(int sy,int sx,int gy,int gx,int xy,int xx){\n if(gy<0||gx<0||h<=gy||w<=gx) return false;\n if(data[gy][gx]==1) return false;\n bool c[N][N];\n for(int i=0;i<h;i++)\n for(int j=0;j<w;j++) c[i][j]=false;\n queue<P > q;\n q.push(make_pair(sy,sx));\n c[sy][sx]=true;\n while(!q.empty()){\n P u=q.front();\n q.pop();\n for(int i=0;i<4;i++){\n int ny=u.f+dy[i],nx=u.s+dx[i];\n if(ny<0||nx<0||h<=ny||w<=nx||data[ny][nx]==1||(ny==xy&&nx==xx)) continue;\n if(c[ny][nx]==true) continue;\n c[ny][nx]=true;\n q.push(make_pair(ny,nx));\n }\n }\n if(c[gy][gx]==true) return true;\n return false;\n}","accuracy":1,"time_ms":10,"memory_kb":1280,"score_of_the_acc":-0.014,"final_rank":1},{"submission_id":"aoj_1218_1571195","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <queue>\n#define f first\n#define s second\n#define INF (1e9)\n#define N 7\nusing namespace std;\ntypedef pair<int,int> P;\nint bfs(int,int,int,int,int,int);\nbool check(int,int,int,int,int,int);\nint w,h,data[N][N],d[N][N],cnt[N][N];\nint dy[4]={-1,0,1,0};\nint dx[4]={0,1,0,-1};\ntypedef struct data{\n int cy,cx,wy,wx;\n} dat;\n\nint main(){\n int sy,sx,gy,gx,wy,wx,ans;\n while(1){\n cin>>w>>h;\n if(!w&&!h) break;\n for(int i=0;i<h;i++)\n for(int j=0;j<w;j++){\n\tcin >> data[i][j];\n\tif(data[i][j]==2) sy=i,sx=j;\n\telse if(data[i][j]==3) gy=i,gx=j;\n\telse if(data[i][j]==4) wy=i,wx=j;\n\td[i][j]=INF;\n }\n ans=bfs(sy,sx,wy,wx,gy,gx);\n cout << ans << endl;\n }\n return 0;\n}\n\nint bfs(int sy,int sx,int wy,int wx,int gy,int gx){\n queue<dat > q;\n int flag;\n dat k={sy,sx,wy,wx};\n q.push(k);\n d[sy][sx]=0;\n for(int i=0;i<N;i++)\n for(int j=0;j<N;j++) cnt[i][j]=0;\n while(!q.empty()){\n dat u=q.front();\n q.pop();\n flag=0;\n for(int i=0;i<4;i++){\n int ny=u.cy+dy[i],nx=u.cx+dx[i];\n if(ny<0||nx<0||h<=ny||w<=nx||data[ny][nx]==1) continue;\n if(check(u.wy,u.wx,u.cy-dy[i],u.cx-dx[i],u.cy,u.cx)){\n\td[ny][nx]=d[u.cy][u.cx]+1;\n\tcnt[nx][ny]++;\n\tif(cnt[nx][ny]==1000){\n\t flag=1;\n\t break;\n\t}\n\tif(d[gy][gx]!=INF){\n\t flag=2;\n\t break;\n\t}\n\tdat t={ny,nx,u.cy-dy[i],u.cx-dx[i]};\n\tq.push(t);\n }\n }\n if(flag) break;\n }\n if(flag==2) return d[gy][gx];\n if(flag) return -1;\n if(d[gy][gx]!=INF) return d[gy][gx];\n return -1;\n}\n\nbool check(int sy,int sx,int gy,int gx,int xy,int xx){\n if(gy<0||gx<0||h<=gy||w<=gx) return false;\n if(data[gy][gx]==1) return false;\n bool c[N][N];\n for(int i=0;i<h;i++)\n for(int j=0;j<w;j++) c[i][j]=false;\n queue<P > q;\n q.push(make_pair(sy,sx));\n c[sy][sx]=true;\n while(!q.empty()){\n P u=q.front();\n q.pop();\n for(int i=0;i<4;i++){\n int ny=u.f+dy[i],nx=u.s+dx[i];\n if(ny<0||nx<0||h<=ny||w<=nx||data[ny][nx]==1||(ny==xy&&nx==xx)) continue;\n if(c[ny][nx]==true) continue;\n c[ny][nx]=true;\n q.push(make_pair(ny,nx));\n }\n }\n if(c[gy][gx]==true) return true;\n return false;\n}","accuracy":1,"time_ms":10,"memory_kb":1280,"score_of_the_acc":-0.014,"final_rank":1},{"submission_id":"aoj_1218_1571192","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <queue>\n#define f first\n#define s second\n#define INF (1e9)\n#define N 7\nusing namespace std;\ntypedef pair<int,int> P;\nint bfs(int,int,int,int,int,int);\nbool check(int,int,int,int,int,int);\nint w,h,data[N][N],d[N][N],cnt[N][N];\nint dy[4]={-1,0,1,0};\nint dx[4]={0,1,0,-1};\ntypedef struct data{\n int cy,cx,wy,wx;\n} dat;\n\nint main(){\n int sy,sx,gy,gx,wy,wx,ans;\n while(1){\n cin>>w>>h;\n if(!w&&!h) break;\n for(int i=0;i<h;i++)\n for(int j=0;j<w;j++){\n\tcin >> data[i][j];\n\tif(data[i][j]==2) sy=i,sx=j;\n\telse if(data[i][j]==3) gy=i,gx=j;\n\telse if(data[i][j]==4) wy=i,wx=j;\n\td[i][j]=INF;\n }\n ans=bfs(sy,sx,wy,wx,gy,gx);\n cout << ans << endl;\n }\n return 0;\n}\n\nint bfs(int sy,int sx,int wy,int wx,int gy,int gx){\n queue<dat > q;\n int flag;\n dat k={sy,sx,wy,wx};\n q.push(k);\n d[sy][sx]=0;\n for(int i=0;i<N;i++)\n for(int j=0;j<N;j++) cnt[i][j]=0;\n while(!q.empty()){\n dat u=q.front();\n q.pop();\n flag=0;\n for(int i=0;i<4;i++){\n int ny=u.cy+dy[i],nx=u.cx+dx[i];\n if(ny<0||nx<0||h<=ny||w<=nx||data[ny][nx]==1) continue;\n if(check(u.wy,u.wx,u.cy-dy[i],u.cx-dx[i],u.cy,u.cx)){\n\td[ny][nx]=d[u.cy][u.cx]+1;\n\tcnt[nx][ny]++;\n\tif(cnt[nx][ny]==10000){\n\t flag=1;\n\t break;\n\t}\n\tif(d[gy][gx]!=INF){\n\t flag=2;\n\t break;\n\t}\n\tdat t={ny,nx,u.cy-dy[i],u.cx-dx[i]};\n\tq.push(t);\n }\n }\n if(flag) break;\n }\n if(flag==2) return d[gy][gx];\n if(flag) return -1;\n if(d[gy][gx]!=INF) return d[gy][gx];\n return -1;\n}\n\nbool check(int sy,int sx,int gy,int gx,int xy,int xx){\n if(gy<0||gx<0||h<=gy||w<=gx) return false;\n if(data[gy][gx]==1) return false;\n bool c[N][N];\n for(int i=0;i<h;i++)\n for(int j=0;j<w;j++) c[i][j]=false;\n queue<P > q;\n q.push(make_pair(sy,sx));\n c[sy][sx]=true;\n while(!q.empty()){\n P u=q.front();\n q.pop();\n for(int i=0;i<4;i++){\n int ny=u.f+dy[i],nx=u.s+dx[i];\n if(ny<0||nx<0||h<=ny||w<=nx||data[ny][nx]==1||(ny==xy&&nx==xx)) continue;\n if(c[ny][nx]==true) continue;\n c[ny][nx]=true;\n q.push(make_pair(ny,nx));\n }\n }\n if(c[gy][gx]==true) return true;\n return false;\n}","accuracy":1,"time_ms":30,"memory_kb":1356,"score_of_the_acc":-0.0901,"final_rank":5},{"submission_id":"aoj_1218_1571190","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <queue>\n#define f first\n#define s second\n#define INF (1e9)\n#define N 7\nusing namespace std;\ntypedef pair<int,int> P;\nint bfs(int,int,int,int,int,int);\nbool check(int,int,int,int,int,int);\nint w,h,data[N][N],d[N][N],cnt[N][N];\nint dy[4]={-1,0,1,0};\nint dx[4]={0,1,0,-1};\ntypedef struct data{\n int cy,cx,wy,wx;\n} dat;\n\nint main(){\n int sy,sx,gy,gx,wy,wx,ans;\n while(1){\n cin>>w>>h;\n if(!w&&!h) break;\n for(int i=0;i<h;i++)\n for(int j=0;j<w;j++){\n\tcin >> data[i][j];\n\tif(data[i][j]==2) sy=i,sx=j;\n\telse if(data[i][j]==3) gy=i,gx=j;\n\telse if(data[i][j]==4) wy=i,wx=j;\n\td[i][j]=INF;\n }\n ans=bfs(sy,sx,wy,wx,gy,gx);\n cout << ans << endl;\n }\n return 0;\n}\n\nint bfs(int sy,int sx,int wy,int wx,int gy,int gx){\n queue<dat > q;\n int flag;\n dat k={sy,sx,wy,wx};\n q.push(k);\n d[sy][sx]=0;\n for(int i=0;i<N;i++)\n for(int j=0;j<N;j++) cnt[i][j]=0;\n while(!q.empty()){\n dat u=q.front();\n q.pop();\n flag=0;\n for(int i=0;i<4;i++){\n int ny=u.cy+dy[i],nx=u.cx+dx[i];\n if(ny<0||nx<0||h<=ny||w<=nx||data[ny][nx]==1) continue;\n if(check(u.wy,u.wx,u.cy-dy[i],u.cx-dx[i],u.cy,u.cx)){\n\td[ny][nx]=d[u.cy][u.cx]+1;\n\tcnt[nx][ny]++;\n\tif(cnt[nx][ny]==100000){\n\t flag=1;\n\t break;\n\t}\n\tif(d[gy][gx]!=INF){\n\t flag=2;\n\t break;\n\t}\n\tdat t={ny,nx,u.cy-dy[i],u.cx-dx[i]};\n\tq.push(t);\n }\n }\n if(flag) break;\n }\n if(flag==2) return d[gy][gx];\n if(flag) return -1;\n if(d[gy][gx]!=INF) return d[gy][gx];\n return -1;\n}\n\nbool check(int sy,int sx,int gy,int gx,int xy,int xx){\n if(gy<0||gx<0||h<=gy||w<=gx) return false;\n if(data[gy][gx]==1) return false;\n bool c[N][N];\n for(int i=0;i<h;i++)\n for(int j=0;j<w;j++) c[i][j]=false;\n queue<P > q;\n q.push(make_pair(sy,sx));\n c[sy][sx]=true;\n while(!q.empty()){\n P u=q.front();\n q.pop();\n for(int i=0;i<4;i++){\n int ny=u.f+dy[i],nx=u.s+dx[i];\n if(ny<0||nx<0||h<=ny||w<=nx||data[ny][nx]==1||(ny==xy&&nx==xx)) continue;\n if(c[ny][nx]==true) continue;\n c[ny][nx]=true;\n q.push(make_pair(ny,nx));\n }\n }\n if(c[gy][gx]==true) return true;\n return false;\n}","accuracy":1,"time_ms":220,"memory_kb":3692,"score_of_the_acc":-1.0152,"final_rank":10},{"submission_id":"aoj_1218_808767","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <algorithm>\n#include <vector>\n#include <queue>\n\nusing namespace std;\n\ntypedef pair<int, int> P;\n\nconst int dx[] = {1, 0, -1, 0};\nconst int dy[] = {0, 1, 0, -1};\n\nint H, W;\nint field[8][8];\nbool arrive[8][8][8][8][8][8];\n\nvoid init(){\n memset(field, 0, sizeof(field));\n memset(arrive, false, sizeof(arrive));\n}\n\nvoid canArrive(int bx, int by, int sx, int sy){\n int tmp_field[8][8];\n memset(tmp_field, 0, sizeof(tmp_field));\n for(int i = 0 ; i < H ; i++){\n for(int j = 0 ; j < W ; j++){\n if(field[i][j] != 1) tmp_field[i][j] = 0;\n else tmp_field[i][j] = field[i][j];\n }\n }\n \n tmp_field[by][bx] = 2;\n\n queue<P> que;\n que.push(P(sx, sy));\n while(!que.empty()){\n P q = que.front(); que.pop();\n arrive[by][bx][sy][sx][q.second][q.first] = true;\n \n for(int i = 0 ; i < 4 ; i++){\n int nx = q.first + dx[i], ny = q.second + dy[i];\n if(nx < 0 || nx >= W || ny < 0 || ny >= H) continue;\n if(tmp_field[ny][nx] != 0) continue;\n if(arrive[by][bx][sy][sx][ny][nx]) continue;\n que.push(P(nx, ny));\n } \n }\n}\n\nstruct State{\n int x, y, sx, sy, cost;\n State(int x, int y, int sx, int sy, int cost) : x(x), y(y), sx(sx), sy(sy), cost(cost){}\n};\n\nconst bool operator < (const State &a, const State &b){\n return a.cost > b.cost;\n}\n\nint bfs(){\n int sx, sy, bx, by;\n for(int i = 0 ; i < H ; i++){\n for(int j = 0 ; j < W ; j++){\n if(field[i][j] == 2) bx = j, by = i;\n if(field[i][j] == 4) sx = j, sy = i;\n }\n }\n \n priority_queue<State> que;\n que.push(State(bx, by, sx, sy, 0));\n \n bool used[8][8][8][8];\n memset(used, false, sizeof(used));\n \n while(!que.empty()){\n State p = que.top(); que.pop();\n\n if(field[p.y][p.x] == 3) return p.cost; \n\n if(used[p.y][p.x][p.sy][p.sx]) continue;\n used[p.y][p.x][p.sy][p.sx] = true;\n \n for(int i = 0 ; i < 4 ; i++){\n int nx1, nx2, ny1, ny2;\n nx1 = p.x + dx[i], ny1 = p.y + dy[i];\n nx2 = p.x - dx[i], ny2 = p.y - dy[i];\n if(nx1 < 0 || nx1 >= W || ny1 < 0 || ny1 >= H ||\n\t nx2 < 0 || nx2 >= W || ny2 < 0 || ny2 >= H) continue;\n if(field[ny1][nx1] == 1) continue;\n if(field[ny2][nx2] == 1) continue;\n if(!arrive[p.y][p.x][p.sy][p.sx][ny2][nx2]) continue; \n que.push(State(nx1, ny1, nx2, ny2, p.cost+1));\n } \n }\n return -1;\n}\n\nint main(){\n while(cin >> W >> H, W|H){\n init();\n \n for(int i = 0 ; i < H ; i++)\n for(int j = 0 ; j < W ; j++) cin >> field[i][j];\n \n for(int by = 0 ; by < H ; by++){\n for(int bx = 0 ; bx < W ; bx++){\n\tif(field[by][bx] == 1) continue;\n\tfor(int sy = 0 ; sy < H ; sy++){\n\t for(int sx = 0 ; sx < W ; sx++){\n\t if(sy == by && sx == bx) continue;\n\t if(field[sy][sx] == 1) continue;\n\t canArrive(bx, by, sx, sy);\n\t }\n\t}\n }\n }\n cout << bfs() << endl; \n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":1492,"score_of_the_acc":-0.1071,"final_rank":6},{"submission_id":"aoj_1218_808766","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <algorithm>\n#include <vector>\n#include <queue>\n\nusing namespace std;\n\ntypedef pair<int, int> P;\n\nconst int dx[] = {1, 0, -1, 0};\nconst int dy[] = {0, 1, 0, -1};\n\nint H, W;\nint field[8][8];\nbool arrive[8][8][8][8][8][8];\n\nvoid init(){\n memset(field, 0, sizeof(field));\n memset(arrive, false, sizeof(arrive));\n}\n\nbool canArrive(int bx, int by, int sx, int sy){\n int tmp_field[8][8];\n memset(tmp_field, 0, sizeof(tmp_field));\n for(int i = 0 ; i < H ; i++){\n for(int j = 0 ; j < W ; j++){\n if(field[i][j] != 1) tmp_field[i][j] = 0;\n else tmp_field[i][j] = field[i][j];\n }\n }\n \n tmp_field[by][bx] = 2;\n\n queue<P> que;\n que.push(P(sx, sy));\n while(!que.empty()){\n P q = que.front(); que.pop();\n arrive[by][bx][sy][sx][q.second][q.first] = true;\n \n for(int i = 0 ; i < 4 ; i++){\n int nx = q.first + dx[i], ny = q.second + dy[i];\n if(nx < 0 || nx >= W || ny < 0 || ny >= H) continue;\n if(tmp_field[ny][nx] != 0) continue;\n if(arrive[by][bx][sy][sx][ny][nx]) continue;\n que.push(P(nx, ny));\n } \n }\n}\n\n\nstruct State{\n int x, y, sx, sy, cost;\n State(int x, int y, int sx, int sy, int cost) : x(x), y(y), sx(sx), sy(sy), cost(cost){}\n};\n\nconst bool operator < (const State &a, const State &b){\n return a.cost > b.cost;\n}\n\nint bfs(){\n int sx, sy, bx, by;\n for(int i = 0 ; i < H ; i++){\n for(int j = 0 ; j < W ; j++){\n if(field[i][j] == 2) bx = j, by = i;\n if(field[i][j] == 4) sx = j, sy = i;\n }\n }\n \n priority_queue<State> que;\n que.push(State(bx, by, sx, sy, 0));\n \n bool used[8][8][8][8];\n memset(used, false, sizeof(used));\n \n while(!que.empty()){\n State p = que.top(); que.pop();\n\n if(field[p.y][p.x] == 3) return p.cost; \n\n if(used[p.y][p.x][p.sy][p.sx]) continue;\n used[p.y][p.x][p.sy][p.sx] = true;\n \n for(int i = 0 ; i < 4 ; i++){\n int nx1, nx2, ny1, ny2;\n nx1 = p.x + dx[i], ny1 = p.y + dy[i];\n nx2 = p.x - dx[i], ny2 = p.y - dy[i];\n if(nx1 < 0 || nx1 >= W || ny1 < 0 || ny1 >= H ||\n\t nx2 < 0 || nx2 >= W || ny2 < 0 || ny2 >= H) continue;\n if(field[ny1][nx1] == 1) continue;\n if(field[ny2][nx2] == 1) continue;\n if(!arrive[p.y][p.x][p.sy][p.sx][ny2][nx2]) continue; \n que.push(State(nx1, ny1, nx2, ny2, p.cost+1));\n } \n }\n return -1;\n}\n\nint main(){\n while(cin >> W >> H, W|H){\n init();\n \n for(int i = 0 ; i < H ; i++)\n for(int j = 0 ; j < W ; j++) cin >> field[i][j];\n \n for(int by = 0 ; by < H ; by++){\n for(int bx = 0 ; bx < W ; bx++){\n\tif(field[by][bx] == 1) continue;\n\tfor(int sy = 0 ; sy < H ; sy++){\n\t for(int sx = 0 ; sx < W ; sx++){\n\t if(sy == by && sx == bx) continue;\n\t if(field[sy][sx] == 1) continue;\n\t canArrive(bx, by, sx, sy);\n\t }\n\t}\n }\n }\n\n cout << bfs() << endl;\n \n }\n\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1488,"score_of_the_acc":-0.0733,"final_rank":3},{"submission_id":"aoj_1218_808764","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <algorithm>\n#include <vector>\n#include <queue>\n\nusing namespace std;\n\ntypedef pair<int, int> P;\n\nconst int dx[] = {1, 0, -1, 0};\nconst int dy[] = {0, 1, 0, -1};\n\nint H, W;\nint field[8][8];\nbool arrive[8][8][8][8][8][8];\n\nvoid init(){\n memset(field, 0, sizeof(field));\n memset(arrive, false, sizeof(arrive));\n}\n\nvoid canArrive(int bx, int by, int sx, int sy){\n int tmp_field[8][8];\n memset(tmp_field, 0, sizeof(tmp_field));\n for(int i = 0 ; i < H ; i++){\n for(int j = 0 ; j < W ; j++){\n if(field[i][j] != 1) tmp_field[i][j] = 0;\n else tmp_field[i][j] = field[i][j];\n }\n }\n \n tmp_field[by][bx] = 2;\n\n queue<P> que;\n que.push(P(sx, sy));\n while(!que.empty()){\n P q = que.front(); que.pop();\n arrive[by][bx][sy][sx][q.second][q.first] = true;\n \n for(int i = 0 ; i < 4 ; i++){\n int nx = q.first + dx[i], ny = q.second + dy[i];\n if(nx < 0 || nx >= W || ny < 0 || ny >= H) continue;\n if(tmp_field[ny][nx] != 0) continue;\n if(arrive[by][bx][sy][sx][ny][nx]) continue;\n que.push(P(nx, ny));\n } \n }\n}\n\n\nstruct State{\n int x, y, sx, sy, cost;\n State(int x, int y, int sx, int sy, int cost) : x(x), y(y), sx(sx), sy(sy), cost(cost){}\n};\n\nconst bool operator < (const State &a, const State &b){\n return a.cost > b.cost;\n}\n\nint bfs(){\n int sx, sy, bx, by;\n for(int i = 0 ; i < H ; i++){\n for(int j = 0 ; j < W ; j++){\n if(field[i][j] == 2) bx = j, by = i;\n if(field[i][j] == 4) sx = j, sy = i;\n }\n }\n \n priority_queue<State> que;\n que.push(State(bx, by, sx, sy, 0));\n \n bool used[8][8][8][8];\n memset(used, false, sizeof(used));\n \n while(!que.empty()){\n State p = que.top(); que.pop();\n\n if(field[p.y][p.x] == 3) return p.cost; \n\n if(used[p.y][p.x][p.sy][p.sx]) continue;\n used[p.y][p.x][p.sy][p.sx] = true;\n \n for(int i = 0 ; i < 4 ; i++){\n int nx1, nx2, ny1, ny2;\n nx1 = p.x + dx[i], ny1 = p.y + dy[i];\n nx2 = p.x - dx[i], ny2 = p.y - dy[i];\n if(nx1 < 0 || nx1 >= W || ny1 < 0 || ny1 >= H ||\n\t nx2 < 0 || nx2 >= W || ny2 < 0 || ny2 >= H) continue;\n if(field[ny1][nx1] == 1) continue;\n if(field[ny2][nx2] == 1) continue;\n if(!arrive[p.y][p.x][p.sy][p.sx][ny2][nx2]) continue; \n que.push(State(nx1, ny1, nx2, ny2, p.cost+1));\n } \n }\n return -1;\n}\n\nint main(){\n while(cin >> W >> H, W|H){\n init();\n \n for(int i = 0 ; i < H ; i++)\n for(int j = 0 ; j < W ; j++) cin >> field[i][j];\n \n for(int by = 0 ; by < H ; by++){\n for(int bx = 0 ; bx < W ; bx++){\n\tif(field[by][bx] == 1) continue;\n\tfor(int sy = 0 ; sy < H ; sy++){\n\t for(int sx = 0 ; sx < W ; sx++){\n\t if(sy == by && sx == bx) continue;\n\t if(field[sy][sx] == 1) continue;\n\t canArrive(bx, by, sx, sy);\n\t }\n\t}\n }\n }\n\n cout << bfs() << endl;\n \n }\n\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":1492,"score_of_the_acc":-0.1071,"final_rank":6},{"submission_id":"aoj_1218_743099","code_snippet":"#include<iostream>\n#include<vector>\n#include<queue>\n#include<algorithm>\n#include<string>\n#include<sstream>\n#include<cmath>\nusing namespace std;\n#define REP(i, j) for(int i = 0; i < j; i++)\n#define FOR(i, j, k) for(int i = j; i < k; i++)\nconst int H = 7;\nconst int W = 7;\nconst int P = H * W + 10;\nconst int INF = P * P;\n\nclass C{\n public:\n int y, x, cy, cx, s, p;\n C(int _y, int _x, int _cy, int _cx, int _s, int _p){\n y = _y;\n x = _x;\n cy = _cy;\n cx = _cx;\n s = _s;\n p = _p;\n }\n bool operator >(const C c) const{\n return p > c.p;\n }\n};\n\nint w, h;\n\nint main(){\n while(cin >>w >>h && w){\n vector< vector<int> > v(h, vector<int>(w));\n int sy, sx, scy, scx;\n REP(i, h){\n REP(j, w){\n cin >>v[i][j];\n if(v[i][j] == 4){\n sy = i;\n sx = j;\n v[i][j] = 0;\n }\n if(v[i][j] == 2){\n scy = i;\n scx = j;\n v[i][j] = 0;\n }\n }\n }\n\n int ans = -1;\n priority_queue<C, vector<C>, greater<C> > open;\n open.push( C(sy, sx, scy, scx, 0, 0) );\n int closed[P][H][W][H][W];\n REP(i, P) REP(j, H) REP(k, W) REP(l, H) REP(m, W) closed[i][j][k][l][m] = INF;\n\n\n while(!open.empty()){\n C now = open.top();\n open.pop();\n\n //debug\n //cout <<now.y <<\" \" <<now.x <<\" \" <<now.cy <<\" \" <<now.cx <<\" \" <<now.s <<\" \" <<now.p <<endl;\n\n if(v[now.cy][now.cx] == 3){\n ans = now.p;\n break;\n }\n\n //debug\n //cout <<\"step 1\" <<endl;\n //cout <<now.s <<\" \" <<closed[now.p][now.y][now.x][now.cy][now.cx] <<endl;\n\n if(now.s >= closed[now.p][now.y][now.x][now.cy][now.cx]) continue;\n closed[now.p][now.y][now.x][now.cy][now.cx] = now.s;\n\n //debug\n //cout <<\"step 2\" <<endl;\n\n int my[] = {1, -1, 0, 0};\n int mx[] = {0, 0, 1, -1};\n REP(i, 4){\n int ny = now.y + my[i];\n int nx = now.x + mx[i];\n if(ny < 0 || nx < 0 || ny >= h || nx >= w || v[ny][nx] == 1) continue;\n if(ny == now.cy && nx == now.cx){\n int ncy = ny + my[i];\n int ncx = nx + mx[i];\n if(ncy < 0 || ncx < 0 || ncy >= h || ncx >= w || v[ncy][ncx] == 1) continue;\n open.push( C(ny, nx, ncy, ncx, now.s + 1, now.p + 1) );\n } else{\n open.push( C(ny, nx, now.cy, now.cx, now.s + 1, now.p) );\n }\n }\n }\n\n cout <<ans <<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1796,"score_of_the_acc":-0.0784,"final_rank":4},{"submission_id":"aoj_1218_493737","code_snippet":"//42\n#include<iostream>\n#include<algorithm>\n\nusing namespace std;\n\nint main(){\n for(int w,h;cin>>w>>h,w|h;){\n int g[7][7];\n int wx,wy,cx,cy,gx,gy;\n for(int i=0;i<h;i++){\n for(int j=0;j<w;j++){\n\tcin>>g[i][j];\n\tif(g[i][j]==2){\n\t cx=j;\n\t cy=i;\n\t}else if(g[i][j]==4){\n\t wx=j;\n\t wy=i;\n\t}else if(g[i][j]==3){\n\t gx=j;\n\t gy=i;\n\t}\n }\n }\n int d[7][7][7][7];\n fill(d[0][0][0],d[7][0][0],1<<30);\n d[cy][cx][wy][wx]=0;\n for(int i=0;i<w*w*h*h;i++){\n for(int j=0;j<h;j++){\n\tfor(int k=0;k<w;k++){\n\t for(int l=0;l<h;l++){\n\t for(int m=0;m<w;m++){\n\t for(int n=0;n<4;n++){\n\t\tint dd[]={0,1,0,-1,0};\n\t\tint ny=l+dd[n];\n\t\tint nx=m+dd[n+1];\n\t\tif(0<=nx&&nx<w&&0<=ny&&ny<h&&g[ny][nx]!=1){\n\t\t if(ny!=j||nx!=k){\n\t\t d[j][k][ny][nx]=min(d[j][k][ny][nx],d[j][k][l][m]);\n\t\t }else{\n\t\t int nny=ny+dd[n];\n\t\t int nnx=nx+dd[n+1];\n\t\t if(0<=nny&&nny<h&&0<=nnx&&nnx<w&&g[nny][nnx]!=1){\n\t\t d[nny][nnx][ny][nx]=min(d[nny][nnx][ny][nx],d[j][k][l][m]+1);\n\t\t }\n\t\t }\n\t\t}\n\t }\n\t }\n\t }\n\t}\n }\n }\n int me=*min_element(d[gy][gx][0],d[gy][gx+1][0]);\n cout<<((me==1<<30)?-1:me)<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":310,"memory_kb":1168,"score_of_the_acc":-1,"final_rank":9},{"submission_id":"aoj_1218_285716","code_snippet":"#include <iostream>\n#include <queue>\n#include <vector>\n#include <algorithm>\n#include <cstring>\n\nusing namespace std;\n\nconst int dy[]={-1,0,0,1};\nconst int dx[]={0,-1,1,0};\n\nint main(){\n\n int w,h;\n int field[20][20];\n while(cin>>w>>h&&!(w==0&&h==0)){\n int gy,gx,sy,sx;\n int mx,my;\n for(int i = 0; i < h; i++){\n for(int j = 0; j < w; j++){\n cin>>field[i][j];\n if(field[i][j]==3){\n gy=i;\n gx=j;\n }\n else if(field[i][j]==2){\n sy=i;\n sx=j;\n }\n else if(field[i][j]==4){\n mx=j;\n my=i;\n }\n if(field[i][j]!=1)\n field[i][j]=0;\n }\n }\n queue<pair<int,pair<pair<int,int>,pair<int,int> > > > *prv=new queue<pair<int,pair<pair<int,int>,pair<int,int> > > > ();\n queue<pair<int,pair<pair<int,int>,pair<int,int> > > > *nxt=new queue<pair<int,pair<pair<int,int>,pair<int,int> > > > ();\n prv->push(make_pair(0,make_pair(make_pair(sy,sx),make_pair(my,mx))));\n bool passed[100][10][10][10][10];\n memset(passed,0,sizeof(passed));\n passed[0][sy][sx][my][mx]=true;\n int time=0;\n const int INF=1000000000;\n int minTime=INF;\n while(prv->size()){\n while(prv->size()){\n pair<int,int> ccp=prv->front().second.first;\n pair<int,int> cmp=prv->front().second.second;\n int cnt=prv->front().first;\n prv->pop();\n if(ccp.first==gy&&ccp.second==gx)\n minTime=min(minTime,cnt);\n // lðSÉl¦é\n for(int i = 0; i < 4; i++){\n int ny=dy[i]+cmp.first;\n int nx=dx[i]+cmp.second;\n if(ny>=0&&nx>=0&&nx<w&&ny<h&&field[ny][nx]==0){\n // »ÌêÉרª é©Ç¤©\n if(!(ccp.first==ny&&ccp.second==nx)){\n if(!passed[cnt][ccp.first][ccp.second][ny][nx]){\n passed[cnt][ccp.first][ccp.second][ny][nx]=true;\n nxt->push(make_pair(cnt,make_pair(ccp,make_pair(ny,nx))));\n }\n }\n // רª éÈçAר𮩹éêA®©·\n else{\n int nccy=ccp.first+dy[i];\n int nccx=ccp.second+dx[i];\n if(cnt<99&&nccy>=0&&nccx>=0&&nccy<h&&nccx<w&&field[nccy][nccx]==0){\n if(!passed[cnt+1][nccy][nccx][ny][nx]){\n passed[cnt+1][nccy][nccx][ny][nx]=true;\n nxt->push(make_pair(cnt+1,make_pair(make_pair(nccy,nccx),make_pair(ny,nx))));\n }\n }\n }\n }\n }\n }\n time++;\n swap(prv,nxt);\n }\n if(minTime==INF)cout<<-1<<endl;\n else cout<<minTime<<endl;\n delete prv;\n delete nxt;\n }\n\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1892,"score_of_the_acc":-0.1237,"final_rank":8}],"string":"[\n {\n \"submission_id\": \"aoj_1218_3807528\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ull = unsigned long long;\\n\\nconstexpr long double EPS = 1e-15;\\nconst long double PI = acos(-1);\\nconstexpr int inf = 2e9;\\nconstexpr ll INF = 2e18;\\nconstexpr ll MOD = 1e9+7;\\nconstexpr ll MOD1 = 998244353;\\ntypedef pair<ll,ll> P;\\n\\n//#define all(v) (v).begin(), (v).end()\\n#define rep(i,a,b) for (int i = (a); i < (b); i++)\\n#define REP(i,n) rep(i,0,n)\\n#define sz(s) (s).size()\\n#define pb push_back\\n#define fi first\\n#define se second\\n//#define mp make_pair\\n\\nint w,h;\\nint gh,gw;\\nmap<string,int> mp;\\nint dh[4] = {0,0,1,-1};\\nint dw[4] = {1,-1,0,0};\\n\\nint id (int hh, int ww) {\\n return w * hh + ww;\\n}\\n\\nvoid out(string s) {\\n REP(i,h) {\\n REP(j,w) {\\n cout << s[id(i,j)];\\n }\\n cout << endl;\\n }\\n cout << endl;\\n}\\n\\nvoid solve() {\\nwhile (cin >> w >> h) {\\n if (w == 0 && h == 0) break;\\n mp.clear();\\n string s;\\n REP(hh,h) {\\n REP(ww,w) {\\n char c;\\n cin >> c;\\n if (c == '3') {\\n gh = hh;\\n gw = ww;\\n }\\n s +=c;\\n }\\n }\\n int ans = inf;\\n mp[s] = 0;\\n queue<pair<string,int>> que;\\n que.push({s,0});\\n while (!que.empty()) {\\n string maze = que.front().fi;\\n int cost = que.front().se;\\n que.pop();\\n if (cost > mp[maze]) continue;\\n \\n int hh = -1,ww;\\n REP(i,h) {\\n REP(j,w) {\\n if (maze[id(i,j)] == '4') {\\n hh = i;\\n ww = j;\\n break;\\n }\\n }\\n if (hh != -1) break;\\n }\\n for (int i = 0; i < 4; i++) {\\n\\n int th = hh + dh[i];\\n int tw = ww + dw[i];\\n if (th < 0 || th >= h || tw < 0 || tw >= w) continue;\\n if (maze[id(th,tw)] == '1') continue;\\n\\n if (maze[id(th,tw)] == '0' || maze[id(th,tw)] == '3') {\\n string tmp = maze;\\n swap(tmp[id(th,tw)], tmp[id(hh,ww)]);\\n if (mp.count(tmp)) continue;\\n mp[tmp] = cost;\\n que.push({tmp, cost});\\n }\\n\\n if (maze[id(th,tw)] == '2') {\\n int tth = th + dh[i];\\n int ttw = tw + dw[i];\\n if (tth < 0 || tth >= h || ttw < 0 || ttw >= w) continue;\\n if (maze[id(tth,ttw)] == '1') continue;\\n string tmp = maze;\\n swap(tmp[id(tth,ttw)], tmp[id(th,tw)]);\\n swap(tmp[id(th,tw)], tmp[id(hh,ww)]);\\n if (mp.count(tmp)) continue;\\n mp[tmp] = cost + 1;\\n if (tth == gh && ttw == gw) {\\n ans = min(ans, cost + 1);\\n continue;\\n }\\n que.push({tmp, cost + 1});\\n }\\n\\n }\\n }\\n if (ans == inf) cout << -1 << endl;\\n else cout << ans << endl;\\n}\\n}\\n\\n\\nint main(int argc, char *argv[]){\\n\\n // /* Regular */\\n // int case_num = 1;\\n // if (argc > 1 && stoi(argv[1])) cin >> case_num;\\n // REP(case_no, case_num) {\\n // cerr << endl << \\\"case \\\" << case_no + 1 << endl;\\n // solve();\\n // }\\n\\n /* AOJ */\\n solve();\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 9176,\n \"score_of_the_acc\": -1.6,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1218_1571205\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <queue>\\n#define f first\\n#define s second\\n#define INF (1e9)\\n#define N 7\\nusing namespace std;\\ntypedef pair<int,int> P;\\nint bfs(int,int,int,int,int,int);\\nbool check(int,int,int,int,int,int);\\nint w,h,data[N][N],d[N][N],cnt[N][N];\\nint dy[4]={-1,0,1,0};\\nint dx[4]={0,1,0,-1};\\ntypedef struct data{\\n int cy,cx,wy,wx;\\n} dat;\\n\\nint main(){\\n int sy,sx,gy,gx,wy,wx,ans;\\n while(1){\\n cin>>w>>h;\\n if(!w&&!h) break;\\n for(int i=0;i<h;i++)\\n for(int j=0;j<w;j++){\\n\\tcin >> data[i][j];\\n\\tif(data[i][j]==2) sy=i,sx=j;\\n\\telse if(data[i][j]==3) gy=i,gx=j;\\n\\telse if(data[i][j]==4) wy=i,wx=j;\\n\\td[i][j]=INF;\\n }\\n ans=bfs(sy,sx,wy,wx,gy,gx);\\n cout << ans << endl;\\n }\\n return 0;\\n}\\n\\nint bfs(int sy,int sx,int wy,int wx,int gy,int gx){\\n queue<dat > q;\\n int flag;\\n dat k={sy,sx,wy,wx};\\n q.push(k);\\n d[sy][sx]=0;\\n for(int i=0;i<N;i++)\\n for(int j=0;j<N;j++) cnt[i][j]=0;\\n while(!q.empty()){\\n dat u=q.front();\\n q.pop();\\n flag=0;\\n for(int i=0;i<4;i++){\\n int ny=u.cy+dy[i],nx=u.cx+dx[i];\\n if(ny<0||nx<0||h<=ny||w<=nx||data[ny][nx]==1) continue;\\n if(check(u.wy,u.wx,u.cy-dy[i],u.cx-dx[i],u.cy,u.cx)){\\n\\td[ny][nx]=d[u.cy][u.cx]+1;\\n\\tcnt[nx][ny]++;\\n\\tif(cnt[nx][ny]==500){\\n\\t flag=1;\\n\\t break;\\n\\t}\\n\\tif(d[gy][gx]!=INF){\\n\\t flag=2;\\n\\t break;\\n\\t}\\n\\tdat t={ny,nx,u.cy-dy[i],u.cx-dx[i]};\\n\\tq.push(t);\\n }\\n }\\n if(flag) break;\\n }\\n if(flag==2) return d[gy][gx];\\n if(flag) return -1;\\n if(d[gy][gx]!=INF) return d[gy][gx];\\n return -1;\\n}\\n\\nbool check(int sy,int sx,int gy,int gx,int xy,int xx){\\n if(gy<0||gx<0||h<=gy||w<=gx) return false;\\n if(data[gy][gx]==1) return false;\\n bool c[N][N];\\n for(int i=0;i<h;i++)\\n for(int j=0;j<w;j++) c[i][j]=false;\\n queue<P > q;\\n q.push(make_pair(sy,sx));\\n c[sy][sx]=true;\\n while(!q.empty()){\\n P u=q.front();\\n q.pop();\\n for(int i=0;i<4;i++){\\n int ny=u.f+dy[i],nx=u.s+dx[i];\\n if(ny<0||nx<0||h<=ny||w<=nx||data[ny][nx]==1||(ny==xy&&nx==xx)) continue;\\n if(c[ny][nx]==true) continue;\\n c[ny][nx]=true;\\n q.push(make_pair(ny,nx));\\n }\\n }\\n if(c[gy][gx]==true) return true;\\n return false;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1280,\n \"score_of_the_acc\": -0.014,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1218_1571195\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <queue>\\n#define f first\\n#define s second\\n#define INF (1e9)\\n#define N 7\\nusing namespace std;\\ntypedef pair<int,int> P;\\nint bfs(int,int,int,int,int,int);\\nbool check(int,int,int,int,int,int);\\nint w,h,data[N][N],d[N][N],cnt[N][N];\\nint dy[4]={-1,0,1,0};\\nint dx[4]={0,1,0,-1};\\ntypedef struct data{\\n int cy,cx,wy,wx;\\n} dat;\\n\\nint main(){\\n int sy,sx,gy,gx,wy,wx,ans;\\n while(1){\\n cin>>w>>h;\\n if(!w&&!h) break;\\n for(int i=0;i<h;i++)\\n for(int j=0;j<w;j++){\\n\\tcin >> data[i][j];\\n\\tif(data[i][j]==2) sy=i,sx=j;\\n\\telse if(data[i][j]==3) gy=i,gx=j;\\n\\telse if(data[i][j]==4) wy=i,wx=j;\\n\\td[i][j]=INF;\\n }\\n ans=bfs(sy,sx,wy,wx,gy,gx);\\n cout << ans << endl;\\n }\\n return 0;\\n}\\n\\nint bfs(int sy,int sx,int wy,int wx,int gy,int gx){\\n queue<dat > q;\\n int flag;\\n dat k={sy,sx,wy,wx};\\n q.push(k);\\n d[sy][sx]=0;\\n for(int i=0;i<N;i++)\\n for(int j=0;j<N;j++) cnt[i][j]=0;\\n while(!q.empty()){\\n dat u=q.front();\\n q.pop();\\n flag=0;\\n for(int i=0;i<4;i++){\\n int ny=u.cy+dy[i],nx=u.cx+dx[i];\\n if(ny<0||nx<0||h<=ny||w<=nx||data[ny][nx]==1) continue;\\n if(check(u.wy,u.wx,u.cy-dy[i],u.cx-dx[i],u.cy,u.cx)){\\n\\td[ny][nx]=d[u.cy][u.cx]+1;\\n\\tcnt[nx][ny]++;\\n\\tif(cnt[nx][ny]==1000){\\n\\t flag=1;\\n\\t break;\\n\\t}\\n\\tif(d[gy][gx]!=INF){\\n\\t flag=2;\\n\\t break;\\n\\t}\\n\\tdat t={ny,nx,u.cy-dy[i],u.cx-dx[i]};\\n\\tq.push(t);\\n }\\n }\\n if(flag) break;\\n }\\n if(flag==2) return d[gy][gx];\\n if(flag) return -1;\\n if(d[gy][gx]!=INF) return d[gy][gx];\\n return -1;\\n}\\n\\nbool check(int sy,int sx,int gy,int gx,int xy,int xx){\\n if(gy<0||gx<0||h<=gy||w<=gx) return false;\\n if(data[gy][gx]==1) return false;\\n bool c[N][N];\\n for(int i=0;i<h;i++)\\n for(int j=0;j<w;j++) c[i][j]=false;\\n queue<P > q;\\n q.push(make_pair(sy,sx));\\n c[sy][sx]=true;\\n while(!q.empty()){\\n P u=q.front();\\n q.pop();\\n for(int i=0;i<4;i++){\\n int ny=u.f+dy[i],nx=u.s+dx[i];\\n if(ny<0||nx<0||h<=ny||w<=nx||data[ny][nx]==1||(ny==xy&&nx==xx)) continue;\\n if(c[ny][nx]==true) continue;\\n c[ny][nx]=true;\\n q.push(make_pair(ny,nx));\\n }\\n }\\n if(c[gy][gx]==true) return true;\\n return false;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1280,\n \"score_of_the_acc\": -0.014,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1218_1571192\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <queue>\\n#define f first\\n#define s second\\n#define INF (1e9)\\n#define N 7\\nusing namespace std;\\ntypedef pair<int,int> P;\\nint bfs(int,int,int,int,int,int);\\nbool check(int,int,int,int,int,int);\\nint w,h,data[N][N],d[N][N],cnt[N][N];\\nint dy[4]={-1,0,1,0};\\nint dx[4]={0,1,0,-1};\\ntypedef struct data{\\n int cy,cx,wy,wx;\\n} dat;\\n\\nint main(){\\n int sy,sx,gy,gx,wy,wx,ans;\\n while(1){\\n cin>>w>>h;\\n if(!w&&!h) break;\\n for(int i=0;i<h;i++)\\n for(int j=0;j<w;j++){\\n\\tcin >> data[i][j];\\n\\tif(data[i][j]==2) sy=i,sx=j;\\n\\telse if(data[i][j]==3) gy=i,gx=j;\\n\\telse if(data[i][j]==4) wy=i,wx=j;\\n\\td[i][j]=INF;\\n }\\n ans=bfs(sy,sx,wy,wx,gy,gx);\\n cout << ans << endl;\\n }\\n return 0;\\n}\\n\\nint bfs(int sy,int sx,int wy,int wx,int gy,int gx){\\n queue<dat > q;\\n int flag;\\n dat k={sy,sx,wy,wx};\\n q.push(k);\\n d[sy][sx]=0;\\n for(int i=0;i<N;i++)\\n for(int j=0;j<N;j++) cnt[i][j]=0;\\n while(!q.empty()){\\n dat u=q.front();\\n q.pop();\\n flag=0;\\n for(int i=0;i<4;i++){\\n int ny=u.cy+dy[i],nx=u.cx+dx[i];\\n if(ny<0||nx<0||h<=ny||w<=nx||data[ny][nx]==1) continue;\\n if(check(u.wy,u.wx,u.cy-dy[i],u.cx-dx[i],u.cy,u.cx)){\\n\\td[ny][nx]=d[u.cy][u.cx]+1;\\n\\tcnt[nx][ny]++;\\n\\tif(cnt[nx][ny]==10000){\\n\\t flag=1;\\n\\t break;\\n\\t}\\n\\tif(d[gy][gx]!=INF){\\n\\t flag=2;\\n\\t break;\\n\\t}\\n\\tdat t={ny,nx,u.cy-dy[i],u.cx-dx[i]};\\n\\tq.push(t);\\n }\\n }\\n if(flag) break;\\n }\\n if(flag==2) return d[gy][gx];\\n if(flag) return -1;\\n if(d[gy][gx]!=INF) return d[gy][gx];\\n return -1;\\n}\\n\\nbool check(int sy,int sx,int gy,int gx,int xy,int xx){\\n if(gy<0||gx<0||h<=gy||w<=gx) return false;\\n if(data[gy][gx]==1) return false;\\n bool c[N][N];\\n for(int i=0;i<h;i++)\\n for(int j=0;j<w;j++) c[i][j]=false;\\n queue<P > q;\\n q.push(make_pair(sy,sx));\\n c[sy][sx]=true;\\n while(!q.empty()){\\n P u=q.front();\\n q.pop();\\n for(int i=0;i<4;i++){\\n int ny=u.f+dy[i],nx=u.s+dx[i];\\n if(ny<0||nx<0||h<=ny||w<=nx||data[ny][nx]==1||(ny==xy&&nx==xx)) continue;\\n if(c[ny][nx]==true) continue;\\n c[ny][nx]=true;\\n q.push(make_pair(ny,nx));\\n }\\n }\\n if(c[gy][gx]==true) return true;\\n return false;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 1356,\n \"score_of_the_acc\": -0.0901,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1218_1571190\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <queue>\\n#define f first\\n#define s second\\n#define INF (1e9)\\n#define N 7\\nusing namespace std;\\ntypedef pair<int,int> P;\\nint bfs(int,int,int,int,int,int);\\nbool check(int,int,int,int,int,int);\\nint w,h,data[N][N],d[N][N],cnt[N][N];\\nint dy[4]={-1,0,1,0};\\nint dx[4]={0,1,0,-1};\\ntypedef struct data{\\n int cy,cx,wy,wx;\\n} dat;\\n\\nint main(){\\n int sy,sx,gy,gx,wy,wx,ans;\\n while(1){\\n cin>>w>>h;\\n if(!w&&!h) break;\\n for(int i=0;i<h;i++)\\n for(int j=0;j<w;j++){\\n\\tcin >> data[i][j];\\n\\tif(data[i][j]==2) sy=i,sx=j;\\n\\telse if(data[i][j]==3) gy=i,gx=j;\\n\\telse if(data[i][j]==4) wy=i,wx=j;\\n\\td[i][j]=INF;\\n }\\n ans=bfs(sy,sx,wy,wx,gy,gx);\\n cout << ans << endl;\\n }\\n return 0;\\n}\\n\\nint bfs(int sy,int sx,int wy,int wx,int gy,int gx){\\n queue<dat > q;\\n int flag;\\n dat k={sy,sx,wy,wx};\\n q.push(k);\\n d[sy][sx]=0;\\n for(int i=0;i<N;i++)\\n for(int j=0;j<N;j++) cnt[i][j]=0;\\n while(!q.empty()){\\n dat u=q.front();\\n q.pop();\\n flag=0;\\n for(int i=0;i<4;i++){\\n int ny=u.cy+dy[i],nx=u.cx+dx[i];\\n if(ny<0||nx<0||h<=ny||w<=nx||data[ny][nx]==1) continue;\\n if(check(u.wy,u.wx,u.cy-dy[i],u.cx-dx[i],u.cy,u.cx)){\\n\\td[ny][nx]=d[u.cy][u.cx]+1;\\n\\tcnt[nx][ny]++;\\n\\tif(cnt[nx][ny]==100000){\\n\\t flag=1;\\n\\t break;\\n\\t}\\n\\tif(d[gy][gx]!=INF){\\n\\t flag=2;\\n\\t break;\\n\\t}\\n\\tdat t={ny,nx,u.cy-dy[i],u.cx-dx[i]};\\n\\tq.push(t);\\n }\\n }\\n if(flag) break;\\n }\\n if(flag==2) return d[gy][gx];\\n if(flag) return -1;\\n if(d[gy][gx]!=INF) return d[gy][gx];\\n return -1;\\n}\\n\\nbool check(int sy,int sx,int gy,int gx,int xy,int xx){\\n if(gy<0||gx<0||h<=gy||w<=gx) return false;\\n if(data[gy][gx]==1) return false;\\n bool c[N][N];\\n for(int i=0;i<h;i++)\\n for(int j=0;j<w;j++) c[i][j]=false;\\n queue<P > q;\\n q.push(make_pair(sy,sx));\\n c[sy][sx]=true;\\n while(!q.empty()){\\n P u=q.front();\\n q.pop();\\n for(int i=0;i<4;i++){\\n int ny=u.f+dy[i],nx=u.s+dx[i];\\n if(ny<0||nx<0||h<=ny||w<=nx||data[ny][nx]==1||(ny==xy&&nx==xx)) continue;\\n if(c[ny][nx]==true) continue;\\n c[ny][nx]=true;\\n q.push(make_pair(ny,nx));\\n }\\n }\\n if(c[gy][gx]==true) return true;\\n return false;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 220,\n \"memory_kb\": 3692,\n \"score_of_the_acc\": -1.0152,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1218_808767\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cstring>\\n#include <algorithm>\\n#include <vector>\\n#include <queue>\\n\\nusing namespace std;\\n\\ntypedef pair<int, int> P;\\n\\nconst int dx[] = {1, 0, -1, 0};\\nconst int dy[] = {0, 1, 0, -1};\\n\\nint H, W;\\nint field[8][8];\\nbool arrive[8][8][8][8][8][8];\\n\\nvoid init(){\\n memset(field, 0, sizeof(field));\\n memset(arrive, false, sizeof(arrive));\\n}\\n\\nvoid canArrive(int bx, int by, int sx, int sy){\\n int tmp_field[8][8];\\n memset(tmp_field, 0, sizeof(tmp_field));\\n for(int i = 0 ; i < H ; i++){\\n for(int j = 0 ; j < W ; j++){\\n if(field[i][j] != 1) tmp_field[i][j] = 0;\\n else tmp_field[i][j] = field[i][j];\\n }\\n }\\n \\n tmp_field[by][bx] = 2;\\n\\n queue<P> que;\\n que.push(P(sx, sy));\\n while(!que.empty()){\\n P q = que.front(); que.pop();\\n arrive[by][bx][sy][sx][q.second][q.first] = true;\\n \\n for(int i = 0 ; i < 4 ; i++){\\n int nx = q.first + dx[i], ny = q.second + dy[i];\\n if(nx < 0 || nx >= W || ny < 0 || ny >= H) continue;\\n if(tmp_field[ny][nx] != 0) continue;\\n if(arrive[by][bx][sy][sx][ny][nx]) continue;\\n que.push(P(nx, ny));\\n } \\n }\\n}\\n\\nstruct State{\\n int x, y, sx, sy, cost;\\n State(int x, int y, int sx, int sy, int cost) : x(x), y(y), sx(sx), sy(sy), cost(cost){}\\n};\\n\\nconst bool operator < (const State &a, const State &b){\\n return a.cost > b.cost;\\n}\\n\\nint bfs(){\\n int sx, sy, bx, by;\\n for(int i = 0 ; i < H ; i++){\\n for(int j = 0 ; j < W ; j++){\\n if(field[i][j] == 2) bx = j, by = i;\\n if(field[i][j] == 4) sx = j, sy = i;\\n }\\n }\\n \\n priority_queue<State> que;\\n que.push(State(bx, by, sx, sy, 0));\\n \\n bool used[8][8][8][8];\\n memset(used, false, sizeof(used));\\n \\n while(!que.empty()){\\n State p = que.top(); que.pop();\\n\\n if(field[p.y][p.x] == 3) return p.cost; \\n\\n if(used[p.y][p.x][p.sy][p.sx]) continue;\\n used[p.y][p.x][p.sy][p.sx] = true;\\n \\n for(int i = 0 ; i < 4 ; i++){\\n int nx1, nx2, ny1, ny2;\\n nx1 = p.x + dx[i], ny1 = p.y + dy[i];\\n nx2 = p.x - dx[i], ny2 = p.y - dy[i];\\n if(nx1 < 0 || nx1 >= W || ny1 < 0 || ny1 >= H ||\\n\\t nx2 < 0 || nx2 >= W || ny2 < 0 || ny2 >= H) continue;\\n if(field[ny1][nx1] == 1) continue;\\n if(field[ny2][nx2] == 1) continue;\\n if(!arrive[p.y][p.x][p.sy][p.sx][ny2][nx2]) continue; \\n que.push(State(nx1, ny1, nx2, ny2, p.cost+1));\\n } \\n }\\n return -1;\\n}\\n\\nint main(){\\n while(cin >> W >> H, W|H){\\n init();\\n \\n for(int i = 0 ; i < H ; i++)\\n for(int j = 0 ; j < W ; j++) cin >> field[i][j];\\n \\n for(int by = 0 ; by < H ; by++){\\n for(int bx = 0 ; bx < W ; bx++){\\n\\tif(field[by][bx] == 1) continue;\\n\\tfor(int sy = 0 ; sy < H ; sy++){\\n\\t for(int sx = 0 ; sx < W ; sx++){\\n\\t if(sy == by && sx == bx) continue;\\n\\t if(field[sy][sx] == 1) continue;\\n\\t canArrive(bx, by, sx, sy);\\n\\t }\\n\\t}\\n }\\n }\\n cout << bfs() << endl; \\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 1492,\n \"score_of_the_acc\": -0.1071,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1218_808766\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cstring>\\n#include <algorithm>\\n#include <vector>\\n#include <queue>\\n\\nusing namespace std;\\n\\ntypedef pair<int, int> P;\\n\\nconst int dx[] = {1, 0, -1, 0};\\nconst int dy[] = {0, 1, 0, -1};\\n\\nint H, W;\\nint field[8][8];\\nbool arrive[8][8][8][8][8][8];\\n\\nvoid init(){\\n memset(field, 0, sizeof(field));\\n memset(arrive, false, sizeof(arrive));\\n}\\n\\nbool canArrive(int bx, int by, int sx, int sy){\\n int tmp_field[8][8];\\n memset(tmp_field, 0, sizeof(tmp_field));\\n for(int i = 0 ; i < H ; i++){\\n for(int j = 0 ; j < W ; j++){\\n if(field[i][j] != 1) tmp_field[i][j] = 0;\\n else tmp_field[i][j] = field[i][j];\\n }\\n }\\n \\n tmp_field[by][bx] = 2;\\n\\n queue<P> que;\\n que.push(P(sx, sy));\\n while(!que.empty()){\\n P q = que.front(); que.pop();\\n arrive[by][bx][sy][sx][q.second][q.first] = true;\\n \\n for(int i = 0 ; i < 4 ; i++){\\n int nx = q.first + dx[i], ny = q.second + dy[i];\\n if(nx < 0 || nx >= W || ny < 0 || ny >= H) continue;\\n if(tmp_field[ny][nx] != 0) continue;\\n if(arrive[by][bx][sy][sx][ny][nx]) continue;\\n que.push(P(nx, ny));\\n } \\n }\\n}\\n\\n\\nstruct State{\\n int x, y, sx, sy, cost;\\n State(int x, int y, int sx, int sy, int cost) : x(x), y(y), sx(sx), sy(sy), cost(cost){}\\n};\\n\\nconst bool operator < (const State &a, const State &b){\\n return a.cost > b.cost;\\n}\\n\\nint bfs(){\\n int sx, sy, bx, by;\\n for(int i = 0 ; i < H ; i++){\\n for(int j = 0 ; j < W ; j++){\\n if(field[i][j] == 2) bx = j, by = i;\\n if(field[i][j] == 4) sx = j, sy = i;\\n }\\n }\\n \\n priority_queue<State> que;\\n que.push(State(bx, by, sx, sy, 0));\\n \\n bool used[8][8][8][8];\\n memset(used, false, sizeof(used));\\n \\n while(!que.empty()){\\n State p = que.top(); que.pop();\\n\\n if(field[p.y][p.x] == 3) return p.cost; \\n\\n if(used[p.y][p.x][p.sy][p.sx]) continue;\\n used[p.y][p.x][p.sy][p.sx] = true;\\n \\n for(int i = 0 ; i < 4 ; i++){\\n int nx1, nx2, ny1, ny2;\\n nx1 = p.x + dx[i], ny1 = p.y + dy[i];\\n nx2 = p.x - dx[i], ny2 = p.y - dy[i];\\n if(nx1 < 0 || nx1 >= W || ny1 < 0 || ny1 >= H ||\\n\\t nx2 < 0 || nx2 >= W || ny2 < 0 || ny2 >= H) continue;\\n if(field[ny1][nx1] == 1) continue;\\n if(field[ny2][nx2] == 1) continue;\\n if(!arrive[p.y][p.x][p.sy][p.sx][ny2][nx2]) continue; \\n que.push(State(nx1, ny1, nx2, ny2, p.cost+1));\\n } \\n }\\n return -1;\\n}\\n\\nint main(){\\n while(cin >> W >> H, W|H){\\n init();\\n \\n for(int i = 0 ; i < H ; i++)\\n for(int j = 0 ; j < W ; j++) cin >> field[i][j];\\n \\n for(int by = 0 ; by < H ; by++){\\n for(int bx = 0 ; bx < W ; bx++){\\n\\tif(field[by][bx] == 1) continue;\\n\\tfor(int sy = 0 ; sy < H ; sy++){\\n\\t for(int sx = 0 ; sx < W ; sx++){\\n\\t if(sy == by && sx == bx) continue;\\n\\t if(field[sy][sx] == 1) continue;\\n\\t canArrive(bx, by, sx, sy);\\n\\t }\\n\\t}\\n }\\n }\\n\\n cout << bfs() << endl;\\n \\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1488,\n \"score_of_the_acc\": -0.0733,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1218_808764\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cstring>\\n#include <algorithm>\\n#include <vector>\\n#include <queue>\\n\\nusing namespace std;\\n\\ntypedef pair<int, int> P;\\n\\nconst int dx[] = {1, 0, -1, 0};\\nconst int dy[] = {0, 1, 0, -1};\\n\\nint H, W;\\nint field[8][8];\\nbool arrive[8][8][8][8][8][8];\\n\\nvoid init(){\\n memset(field, 0, sizeof(field));\\n memset(arrive, false, sizeof(arrive));\\n}\\n\\nvoid canArrive(int bx, int by, int sx, int sy){\\n int tmp_field[8][8];\\n memset(tmp_field, 0, sizeof(tmp_field));\\n for(int i = 0 ; i < H ; i++){\\n for(int j = 0 ; j < W ; j++){\\n if(field[i][j] != 1) tmp_field[i][j] = 0;\\n else tmp_field[i][j] = field[i][j];\\n }\\n }\\n \\n tmp_field[by][bx] = 2;\\n\\n queue<P> que;\\n que.push(P(sx, sy));\\n while(!que.empty()){\\n P q = que.front(); que.pop();\\n arrive[by][bx][sy][sx][q.second][q.first] = true;\\n \\n for(int i = 0 ; i < 4 ; i++){\\n int nx = q.first + dx[i], ny = q.second + dy[i];\\n if(nx < 0 || nx >= W || ny < 0 || ny >= H) continue;\\n if(tmp_field[ny][nx] != 0) continue;\\n if(arrive[by][bx][sy][sx][ny][nx]) continue;\\n que.push(P(nx, ny));\\n } \\n }\\n}\\n\\n\\nstruct State{\\n int x, y, sx, sy, cost;\\n State(int x, int y, int sx, int sy, int cost) : x(x), y(y), sx(sx), sy(sy), cost(cost){}\\n};\\n\\nconst bool operator < (const State &a, const State &b){\\n return a.cost > b.cost;\\n}\\n\\nint bfs(){\\n int sx, sy, bx, by;\\n for(int i = 0 ; i < H ; i++){\\n for(int j = 0 ; j < W ; j++){\\n if(field[i][j] == 2) bx = j, by = i;\\n if(field[i][j] == 4) sx = j, sy = i;\\n }\\n }\\n \\n priority_queue<State> que;\\n que.push(State(bx, by, sx, sy, 0));\\n \\n bool used[8][8][8][8];\\n memset(used, false, sizeof(used));\\n \\n while(!que.empty()){\\n State p = que.top(); que.pop();\\n\\n if(field[p.y][p.x] == 3) return p.cost; \\n\\n if(used[p.y][p.x][p.sy][p.sx]) continue;\\n used[p.y][p.x][p.sy][p.sx] = true;\\n \\n for(int i = 0 ; i < 4 ; i++){\\n int nx1, nx2, ny1, ny2;\\n nx1 = p.x + dx[i], ny1 = p.y + dy[i];\\n nx2 = p.x - dx[i], ny2 = p.y - dy[i];\\n if(nx1 < 0 || nx1 >= W || ny1 < 0 || ny1 >= H ||\\n\\t nx2 < 0 || nx2 >= W || ny2 < 0 || ny2 >= H) continue;\\n if(field[ny1][nx1] == 1) continue;\\n if(field[ny2][nx2] == 1) continue;\\n if(!arrive[p.y][p.x][p.sy][p.sx][ny2][nx2]) continue; \\n que.push(State(nx1, ny1, nx2, ny2, p.cost+1));\\n } \\n }\\n return -1;\\n}\\n\\nint main(){\\n while(cin >> W >> H, W|H){\\n init();\\n \\n for(int i = 0 ; i < H ; i++)\\n for(int j = 0 ; j < W ; j++) cin >> field[i][j];\\n \\n for(int by = 0 ; by < H ; by++){\\n for(int bx = 0 ; bx < W ; bx++){\\n\\tif(field[by][bx] == 1) continue;\\n\\tfor(int sy = 0 ; sy < H ; sy++){\\n\\t for(int sx = 0 ; sx < W ; sx++){\\n\\t if(sy == by && sx == bx) continue;\\n\\t if(field[sy][sx] == 1) continue;\\n\\t canArrive(bx, by, sx, sy);\\n\\t }\\n\\t}\\n }\\n }\\n\\n cout << bfs() << endl;\\n \\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 1492,\n \"score_of_the_acc\": -0.1071,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1218_743099\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<queue>\\n#include<algorithm>\\n#include<string>\\n#include<sstream>\\n#include<cmath>\\nusing namespace std;\\n#define REP(i, j) for(int i = 0; i < j; i++)\\n#define FOR(i, j, k) for(int i = j; i < k; i++)\\nconst int H = 7;\\nconst int W = 7;\\nconst int P = H * W + 10;\\nconst int INF = P * P;\\n\\nclass C{\\n public:\\n int y, x, cy, cx, s, p;\\n C(int _y, int _x, int _cy, int _cx, int _s, int _p){\\n y = _y;\\n x = _x;\\n cy = _cy;\\n cx = _cx;\\n s = _s;\\n p = _p;\\n }\\n bool operator >(const C c) const{\\n return p > c.p;\\n }\\n};\\n\\nint w, h;\\n\\nint main(){\\n while(cin >>w >>h && w){\\n vector< vector<int> > v(h, vector<int>(w));\\n int sy, sx, scy, scx;\\n REP(i, h){\\n REP(j, w){\\n cin >>v[i][j];\\n if(v[i][j] == 4){\\n sy = i;\\n sx = j;\\n v[i][j] = 0;\\n }\\n if(v[i][j] == 2){\\n scy = i;\\n scx = j;\\n v[i][j] = 0;\\n }\\n }\\n }\\n\\n int ans = -1;\\n priority_queue<C, vector<C>, greater<C> > open;\\n open.push( C(sy, sx, scy, scx, 0, 0) );\\n int closed[P][H][W][H][W];\\n REP(i, P) REP(j, H) REP(k, W) REP(l, H) REP(m, W) closed[i][j][k][l][m] = INF;\\n\\n\\n while(!open.empty()){\\n C now = open.top();\\n open.pop();\\n\\n //debug\\n //cout <<now.y <<\\\" \\\" <<now.x <<\\\" \\\" <<now.cy <<\\\" \\\" <<now.cx <<\\\" \\\" <<now.s <<\\\" \\\" <<now.p <<endl;\\n\\n if(v[now.cy][now.cx] == 3){\\n ans = now.p;\\n break;\\n }\\n\\n //debug\\n //cout <<\\\"step 1\\\" <<endl;\\n //cout <<now.s <<\\\" \\\" <<closed[now.p][now.y][now.x][now.cy][now.cx] <<endl;\\n\\n if(now.s >= closed[now.p][now.y][now.x][now.cy][now.cx]) continue;\\n closed[now.p][now.y][now.x][now.cy][now.cx] = now.s;\\n\\n //debug\\n //cout <<\\\"step 2\\\" <<endl;\\n\\n int my[] = {1, -1, 0, 0};\\n int mx[] = {0, 0, 1, -1};\\n REP(i, 4){\\n int ny = now.y + my[i];\\n int nx = now.x + mx[i];\\n if(ny < 0 || nx < 0 || ny >= h || nx >= w || v[ny][nx] == 1) continue;\\n if(ny == now.cy && nx == now.cx){\\n int ncy = ny + my[i];\\n int ncx = nx + mx[i];\\n if(ncy < 0 || ncx < 0 || ncy >= h || ncx >= w || v[ncy][ncx] == 1) continue;\\n open.push( C(ny, nx, ncy, ncx, now.s + 1, now.p + 1) );\\n } else{\\n open.push( C(ny, nx, now.cy, now.cx, now.s + 1, now.p) );\\n }\\n }\\n }\\n\\n cout <<ans <<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1796,\n \"score_of_the_acc\": -0.0784,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1218_493737\",\n \"code_snippet\": \"//42\\n#include<iostream>\\n#include<algorithm>\\n\\nusing namespace std;\\n\\nint main(){\\n for(int w,h;cin>>w>>h,w|h;){\\n int g[7][7];\\n int wx,wy,cx,cy,gx,gy;\\n for(int i=0;i<h;i++){\\n for(int j=0;j<w;j++){\\n\\tcin>>g[i][j];\\n\\tif(g[i][j]==2){\\n\\t cx=j;\\n\\t cy=i;\\n\\t}else if(g[i][j]==4){\\n\\t wx=j;\\n\\t wy=i;\\n\\t}else if(g[i][j]==3){\\n\\t gx=j;\\n\\t gy=i;\\n\\t}\\n }\\n }\\n int d[7][7][7][7];\\n fill(d[0][0][0],d[7][0][0],1<<30);\\n d[cy][cx][wy][wx]=0;\\n for(int i=0;i<w*w*h*h;i++){\\n for(int j=0;j<h;j++){\\n\\tfor(int k=0;k<w;k++){\\n\\t for(int l=0;l<h;l++){\\n\\t for(int m=0;m<w;m++){\\n\\t for(int n=0;n<4;n++){\\n\\t\\tint dd[]={0,1,0,-1,0};\\n\\t\\tint ny=l+dd[n];\\n\\t\\tint nx=m+dd[n+1];\\n\\t\\tif(0<=nx&&nx<w&&0<=ny&&ny<h&&g[ny][nx]!=1){\\n\\t\\t if(ny!=j||nx!=k){\\n\\t\\t d[j][k][ny][nx]=min(d[j][k][ny][nx],d[j][k][l][m]);\\n\\t\\t }else{\\n\\t\\t int nny=ny+dd[n];\\n\\t\\t int nnx=nx+dd[n+1];\\n\\t\\t if(0<=nny&&nny<h&&0<=nnx&&nnx<w&&g[nny][nnx]!=1){\\n\\t\\t d[nny][nnx][ny][nx]=min(d[nny][nnx][ny][nx],d[j][k][l][m]+1);\\n\\t\\t }\\n\\t\\t }\\n\\t\\t}\\n\\t }\\n\\t }\\n\\t }\\n\\t}\\n }\\n }\\n int me=*min_element(d[gy][gx][0],d[gy][gx+1][0]);\\n cout<<((me==1<<30)?-1:me)<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 310,\n \"memory_kb\": 1168,\n \"score_of_the_acc\": -1,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1218_285716\",\n \"code_snippet\": \"#include <iostream>\\n#include <queue>\\n#include <vector>\\n#include <algorithm>\\n#include <cstring>\\n\\nusing namespace std;\\n\\nconst int dy[]={-1,0,0,1};\\nconst int dx[]={0,-1,1,0};\\n\\nint main(){\\n\\n int w,h;\\n int field[20][20];\\n while(cin>>w>>h&&!(w==0&&h==0)){\\n int gy,gx,sy,sx;\\n int mx,my;\\n for(int i = 0; i < h; i++){\\n for(int j = 0; j < w; j++){\\n cin>>field[i][j];\\n if(field[i][j]==3){\\n gy=i;\\n gx=j;\\n }\\n else if(field[i][j]==2){\\n sy=i;\\n sx=j;\\n }\\n else if(field[i][j]==4){\\n mx=j;\\n my=i;\\n }\\n if(field[i][j]!=1)\\n field[i][j]=0;\\n }\\n }\\n queue<pair<int,pair<pair<int,int>,pair<int,int> > > > *prv=new queue<pair<int,pair<pair<int,int>,pair<int,int> > > > ();\\n queue<pair<int,pair<pair<int,int>,pair<int,int> > > > *nxt=new queue<pair<int,pair<pair<int,int>,pair<int,int> > > > ();\\n prv->push(make_pair(0,make_pair(make_pair(sy,sx),make_pair(my,mx))));\\n bool passed[100][10][10][10][10];\\n memset(passed,0,sizeof(passed));\\n passed[0][sy][sx][my][mx]=true;\\n int time=0;\\n const int INF=1000000000;\\n int minTime=INF;\\n while(prv->size()){\\n while(prv->size()){\\n pair<int,int> ccp=prv->front().second.first;\\n pair<int,int> cmp=prv->front().second.second;\\n int cnt=prv->front().first;\\n prv->pop();\\n if(ccp.first==gy&&ccp.second==gx)\\n minTime=min(minTime,cnt);\\n // lðSÉl¦é\\n for(int i = 0; i < 4; i++){\\n int ny=dy[i]+cmp.first;\\n int nx=dx[i]+cmp.second;\\n if(ny>=0&&nx>=0&&nx<w&&ny<h&&field[ny][nx]==0){\\n // »ÌêÉרª é©Ç¤©\\n if(!(ccp.first==ny&&ccp.second==nx)){\\n if(!passed[cnt][ccp.first][ccp.second][ny][nx]){\\n passed[cnt][ccp.first][ccp.second][ny][nx]=true;\\n nxt->push(make_pair(cnt,make_pair(ccp,make_pair(ny,nx))));\\n }\\n }\\n // רª éÈçAר𮩹éêA®©·\\n else{\\n int nccy=ccp.first+dy[i];\\n int nccx=ccp.second+dx[i];\\n if(cnt<99&&nccy>=0&&nccx>=0&&nccy<h&&nccx<w&&field[nccy][nccx]==0){\\n if(!passed[cnt+1][nccy][nccx][ny][nx]){\\n passed[cnt+1][nccy][nccx][ny][nx]=true;\\n nxt->push(make_pair(cnt+1,make_pair(make_pair(nccy,nccx),make_pair(ny,nx))));\\n }\\n }\\n }\\n }\\n }\\n }\\n time++;\\n swap(prv,nxt);\\n }\\n if(minTime==INF)cout<<-1<<endl;\\n else cout<<minTime<<endl;\\n delete prv;\\n delete nxt;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1892,\n \"score_of_the_acc\": -0.1237,\n \"final_rank\": 8\n }\n]","isConversational":false}}},{"rowIdx":677,"cells":{"group_id":{"kind":"string","value":"aoj_1216_cpp"},"problem_description":{"kind":"string","value":"Problem A:\nLost in Space\nWilliam Robinson was completely puzzled in the music room; he could not find his triangle in\nhis bag. He was sure that he had prepared it the night before. He remembered its clank when\nhe had stepped on the school bus early that morning. No, not in his dream. His triangle was\nquite unique: no two sides had the same length, which made his favorite peculiar jingle. He\ninsisted to the music teacher, Mr. Smith, that his triangle had probably been stolen by those\naliens and thrown away into deep space.\nYour mission is to help Will find his triangle in space. His triangle has been made invisible by the\naliens, but candidate positions of its vertices are somehow known. You have to tell which three\nof them make his triangle. Having gone through worm-holes, the triangle may have changed its\nsize. However, even in that case, all the sides are known to be enlarged or shrunk equally, that\nis, the transformed triangle is\nsimilar\nto the original.\nInput\nThe very first line of the input has an integer which is the number of data sets. Each data set\ngives data for one incident such as that of Will’s. At least one and at most ten data sets are\ngiven.\nThe first line of each data set contains three decimals that give lengths of the sides of the original\ntriangle, measured in centimeters. Three vertices of the original triangle are named P, Q, and\nR. Three decimals given in the first line correspond to the lengths of sides QR, RP, and PQ, in\nthis order. They are separated by one or more space characters.\nThe second line of a data set has an integer which is the number of points in space to be\nconsidered as candidates for vertices. At least three and at most thirty points are considered.\nThe rest of the data set are lines containing coordinates of candidate points, in light years. Each\nline has three decimals, corresponding to x, y, and z coordinates, separated by one or more space\ncharacters. Points are numbered in the order of their appearances, starting from one.\nAmong all the triangles formed by three of the given points, only one of them is\nsimilar\nto the\noriginal, that is, ratios of the lengths of any two sides are equal to the corresponding ratios of\nthe original allowing an error of less than 0.01 percent. Other triangles have some of the ratios\ndifferent from the original by at least 0.1 percent.\nThe origin of the coordinate system is not the center of the earth but the center of our galaxy.\nNote that negative coordinate values may appear here. As they are all within or close to our galaxy, coordinate values are less than one hundred thousand light years. You don’t have to\ntake relativistic effects into account, i.e., you may assume that we are in a Euclidean space. You\nmay also assume in your calculation that one light year is equal to 9.461 × 10\n12\nkilometers.\nA succeeding data set, if any, starts from the line immediately following the last line of the\npreceding data set.\nOutput\nFor each data set, one line should be output. That li\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1216_3807101","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <string>\n#include <numeric>\n\n#define REP(i, a, b) for (int i = int(a); i < int(b); i++)\nusing namespace std;\ntypedef long long int ll;\n\n// clang-format off\n#ifdef _DEBUG_\n#define dump(...) do{ cerr << __LINE__ << \":\\t\" << #__VA_ARGS__ << \" = \"; PPPPP(__VA_ARGS__); cerr << endl; } while(false)\ntemplate<typename T> void PPPPP(T t) { cerr << t; }\ntemplate<typename T, typename... S> void PPPPP(T t, S... s) { cerr << t << \", \"; PPPPP(s...); }\n#else\n#define dump(...)\n#endif\ntemplate<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }\ntemplate<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }\ntemplate<typename T>\nbool chmin(T &a, T b) { if (a > b) {a = b; return true; } return false;}\ntemplate<typename T>\nbool chmax(T &a, T b) { if (a < b) {a = b; return true; } return false;}\n// clang-format on\n\n#include <valarray>\n#include <cmath>\n\ndouble calc(valarray<double> p1, valarray<double> p2) {\n double res = 0.0;\n REP (i, 0, 3) {\n res += pow(p1[i] - p2[i], 2);\n }\n return sqrt(res);\n}\n\nvoid subMain() {\n valarray<double> len(3);\n REP(i, 0, 3) {\n cin >> len[i];\n }\n int n;\n cin >> n;\n vector<valarray<double>> point(n, valarray<double>(3));\n REP(i, 0, n) {\n REP(j, 0, 3) {\n cin >> point[i][j];\n }\n }\n REP(i, 0, n) {\n REP(j, 0, n) {\n REP(k, 0, n) {\n if (i == j || j == k || k == i) continue;\n valarray<double> res = {\n calc(point[i], point[j]),\n calc(point[j], point[k]),\n calc(point[k], point[i]),\n };\n res /= len;\n double eps = 1e-3;\n if (abs(res[0] - res[1]) <= eps && abs(res[0] - res[2]) <= eps && abs(res[1] - res[2]) <= eps) {\n cout << k + 1 << \" \" << i + 1 << \" \" << j + 1 << endl;\n return;\n }\n }\n }\n }\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int T;\n cin >> T;\n REP(t, 0, T) {\n subMain();\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3284,"score_of_the_acc":-0.9739,"final_rank":17},{"submission_id":"aoj_1216_2376234","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nstruct P{\n double x, y, z;\n P():x(0), y(0), z(0){}\n P(double x, double y, double z):x(x), y(y), z(z){}\n P operator+(const P& b)const{\n P res;\n res.x = x + b.x;\n res.y = y + b.y;\n res.z = z + b.z;\n return res;\n }\n P operator-(const P& b)const{\n P res;\n res.x = x - b.x;\n res.y = y - b.y;\n res.z = z - b.z;\n return res;\n }\n bool operator<(const P& b)const{\n if(x == b.x)\n if(y == b.y)\n return z < b.z;\n else\n return y < b.y;\n else\n return x < b.x;\n }\n};\n\nbool eq(double a, double b){\n return abs(a-b) < 0.0001;\n}\n\n// Experimence\nint main(void){\n int T; cin >> T;\n while(T--){\n double QR, RP, PQ; cin >> QR >> RP >> PQ;\n double P_arg = acos((PQ*PQ+RP*RP-QR*QR) / (2*PQ*RP));\n double Q_arg = acos((PQ*PQ+QR*QR-RP*RP) / (2*PQ*QR));\n double R_arg = acos((QR*QR+RP*RP-PQ*PQ) / (2*QR*RP));\n int N; cin >> N;\n vector<P> points(N);\n for(int i = 0; i < N; i++){\n cin >> points[i].x >> points[i].y >> points[i].z;\n }\n for(int i = 0; i < N; i++){\n for(int j = 0; j < N; j++){\n for(int k = 0; k < N; k++){\n if(i == j || j == k || i == k) continue;\n vector<P> triangle(3);\n triangle[0] = points[i];\n triangle[1] = points[j];\n triangle[2] = points[k];\n\n //do{\n vector<double> edge(3);\n for(int edge_idx = 0; edge_idx < 3; edge_idx++){\n P subtract = triangle[edge_idx%3] - triangle[(edge_idx+1)%3];\n edge[edge_idx] = sqrt(subtract.x*subtract.x + subtract.y*subtract.y + subtract.z*subtract.z);\n }\n double arg1, arg2, arg3;\n arg1 = acos((edge[0]*edge[0]+edge[2]*edge[2]-edge[1]*edge[1]) / (2*edge[0]*edge[2]));\n arg2 = acos((edge[0]*edge[0]+edge[1]*edge[1]-edge[2]*edge[2]) / (2*edge[0]*edge[1]));\n arg3 = acos((edge[1]*edge[1]+edge[2]*edge[2]-edge[0]*edge[0]) / (2*edge[1]*edge[2]));\n //DEBUG\n if(eq(P_arg, arg1) && eq(Q_arg, arg2) && eq(R_arg, arg3)){\n cout << i+1 << \" \" << j+1 << \" \" << k+1 << endl;\n i = N; j = N; k = N;\n }\n //}while(next_permutation(triangle.begin(), triangle.end()));\n\n //cout << i << j << k << endl;\n }\n }\n }\n }\n}","accuracy":1,"time_ms":20,"memory_kb":3372,"score_of_the_acc":-1.5,"final_rank":20},{"submission_id":"aoj_1216_1893151","code_snippet":"#include<iostream>\n#include<vector>\n#include<string>\n#include<algorithm>\t\n#include<map>\n#include<set>\n#include<utility>\n#include<cmath>\n#include<cstring>\n#include<queue>\n#include<cstdio>\n#include<sstream>\n#include<iomanip>\n#define loop(i,a,b) for(int i=a;i<b;i++) \n#define rep(i,a) loop(i,0,a)\n#define pb push_back\n#define mp make_pair\n#define all(in) in.begin(),in.end()\n#define shosu(x) fixed<<setprecision(x)\nusing namespace std;\n//kaewasuretyuui\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<pii> vp;\ntypedef vector<vp> vvp;\ntypedef pair<int,pii> pip;\ntypedef vector<pip>vip;\nconst double PI=acos(-1);\nconst double EPS=1e-2;\nconst int inf=1e8;\nint main(){\n\tint q;\n\tcin>>q;\n\twhile(q--){\n\t\tdouble x,y,z;\n\t\tcin>>x>>y>>z;\n\t\tint n;\n\t\tcin>>n;\n\t\tvector<vector<double> >in(n,vector<double>(3));\n\t\trep(i,n)rep(j,3)cin>>in[i][j];\n\t\trep(i,n)rep(j,n)rep(k,n)if(i!=j&&j!=k&&k!=i){\n\t\t\tdouble a=hypot(hypot(in[i][0]-in[j][0],in[i][1]-in[j][1]),in[i][2]-in[j][2]);\n\t\t\tdouble b=hypot(hypot(in[k][0]-in[j][0],in[k][1]-in[j][1]),in[k][2]-in[j][2]);\n\t\t\tdouble c=hypot(hypot(in[i][0]-in[k][0],in[i][1]-in[k][1]),in[i][2]-in[k][2]);\n\t\t\tdouble t=a/x;\n\t\t\tif(abs(x*t-a)<EPS&&abs(y*t-b)<EPS&&abs(z*t-c)<EPS)cout<<k+1<<\" \"<<i+1<<\" \"<<j+1<<endl;\n\t\t}\n\t}\n}","accuracy":1,"time_ms":20,"memory_kb":1268,"score_of_the_acc":-0.876,"final_rank":16},{"submission_id":"aoj_1216_1451534","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int uli;\nconst int mx=40;\ndouble x[mx],y[mx],z[mx];\nconst double eps=1e-4;\ndouble d(int i,int j){\n return sqrt(pow(x[i]-x[j],2)+pow(y[i]-y[j],2)+pow(z[i]-z[j],2));\n}\nbool eq(double x,double y){\n return fabs(x-y)<eps;\n}\nint main(){\n int t,n;\n scanf(\"%d\",&t);\n double qr,rp,pq;\n while(t--){\n scanf(\"%lf %lf %lf\",&qr,&rp,&pq);\n scanf(\"%d\",&n);\n for(int i=0;i<n;i++){\n scanf(\"%lf %lf %lf\",x+i,y+i,z+i);\n }\n int p,q,r;\n for(int i=0;i<n;i++){\n for(int j=0;j<n;j++) if(j!=i){\n for(int k=0;k<n;k++) if(k!=i && k!=j){\n double l1=d(i,j);\n double l2=d(j,k);\n double l3=d(k,i);\n double r1=l1/qr;\n double r2=l2/rp;\n double r3=l3/pq;\n if(eq(r1,r2)&&eq(r1,r3)&&eq(r2,r3)){\n q=i,r=j,p=k; \n }\n }\n }\n }\n printf(\"%d %d %d\\n\",p+1,q+1,r+1);\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1228,"score_of_the_acc":-0.3642,"final_rank":7},{"submission_id":"aoj_1216_1332049","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define EPS 1e-7\n#define equals(a,b) (fabs(a-b) < EPS)\n\nstruct Point{\n double x,y,z;\n\n double getDist(const Point &p){\n return sqrt(pow(x-p.x,2)+pow(y-p.y,2)+pow(z-p.z,2));\n }\n};\n\nint main(){\n int Tc,N;\n double QR,RP,PQ;\n cin >> Tc;\n while(Tc--){\n cin >> QR >> RP >> PQ >> N;\n Point p[N];\n for(int i = 0 ; i < N ; i++){\n cin >> p[i].x >> p[i].y >> p[i].z;\n }\n double qr,rp,pq;\n for(int i = 0 ; i < N ; i++){\n for(int j = 0 ; j < N ; j++){\n if(i == j){ continue; }\n for(int k = 0 ; k < N ; k++){\n if(i == k || j == k){ continue; }\n qr = p[j].getDist(p[k]);\n rp = p[k].getDist(p[i]);\n pq = p[i].getDist(p[j]);\n if(equals(QR/qr,RP/rp) && equals(RP/rp,PQ/pq)){\n cout << i+1 << \" \" << j+1 << \" \" << k+1 << endl;\n goto end;\n }\n }\n }\n }\n end:;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1236,"score_of_the_acc":-0.3665,"final_rank":8},{"submission_id":"aoj_1216_1162333","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nconst double EPS = 0.05;\ninline double dis(vector<double> a, vector<double> b){\n double res = 0;\n for(int i=0;i<3;i++)res += (a[i]-b[i])*(a[i]-b[i]);\n return sqrt(res);\n}\n\nint main(){\n int casenum;\n cin >> casenum;\n while(casenum--){\n double qr,rp,pq;\n cin >> qr >> rp >> pq;\n int n;\n cin >> n;\n vector< vector<double> > vp(n,vector<double>(3));\n for(int i=0;i<n;i++){\n for(int j=0;j<3;j++)cin >> vp[i][j];\n }\n\n bool f = true;\n for(int i=0;f && i<n;i++){\n for(int j=0;f && j<n;j++){\n\tif(i==j)continue;\n\tfor(int k=0;f && k<n;k++){\n\t if(i==k)continue;\n\n\t double d1 = dis(vp[j],vp[k]), d2 = dis(vp[k],vp[i]), d3 = dis(vp[i],vp[j]);\n\t double ratio = d1/qr;\n\t if( abs(ratio*rp-d2)<EPS && abs(ratio*pq-d3)<EPS){\n\t cout << i+1 << \" \" << j+1 << \" \" << k+1 << endl;\n\t f = false;\n\t }\n\t}\n }\n }\n }\n}","accuracy":1,"time_ms":30,"memory_kb":1256,"score_of_the_acc":-1.3725,"final_rank":19},{"submission_id":"aoj_1216_1103848","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nstruct P {\n double x,y,z;\n};\n\ndouble D(P a, P b) {\n return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y)+(a.z-b.z)*(a.z-b.z));\n}\n\nbool equal(double a, double b) {\n return fabs(a-b)<0.0000001;\n}\n\nint main() {\n int T;\n cin >> T;\n while(T--) {\n double l[3];\n for(int i=0; i<3; i++) cin >> l[i];\n int n;\n cin >> n;\n P a[n];\n for(int i=0; i<n; i++) cin >> a[i].x >> a[i].y >> a[i].z;\n for(int i=0; i<n; i++) {\n for(int j=0; j<n; j++) {\n\tfor(int k=0; k<n; k++) {\n\t if(i==j || j==k || k==i) continue;\n\t double d1=l[2]/D(a[i],a[j]);\n\t double d2=l[0]/D(a[j],a[k]);\n\t double d3=l[1]/D(a[k],a[i]);\n\t if(!equal(d1,d2) || !equal(d1,d3)) continue;\n\t cout << i+1 << \" \" << j+1 << \" \" << k+1 << endl;\n\t goto End;\n\t}\n }\n }\n End:;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1236,"score_of_the_acc":-0.3665,"final_rank":8},{"submission_id":"aoj_1216_1092546","code_snippet":"#include <iostream>\n#include <vector>\n#include <cmath>\n\nusing namespace std;\ntypedef double D;\nstruct P {\n\tD x, y, z;\n\tP(){}\n\tP(D xx, D yy, D zz):x(xx), y(yy), z(zz){}\n};\n\nD dis(P a, P b) {\n\treturn sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y)+(a.z-b.z)*(a.z-b.z));\n}\n\nconst double EPS = 0.05;\n\nint main()\n{\n\tint N; cin>>N;\n\twhile (N--) {\n\t\tD QR, RP, PQ;\n\t\tcin>>QR>>RP>>PQ;\n\t\tint M; cin>>M;\n\t\tvector<P> points;\n\t\t\n\t\tfor (int i=0; i<M; i++) {\n\t\t\tdouble x, y, z;\n\t\t\tcin>>x>>y>>z;\n\t\t\tpoints.push_back(P(x, y, z));\n\t\t}\n\t\t\n\t\tfor (int p=0; p<M; p++) {\n\t\t\tfor (int q=0; q<M; q++) {\n\t\t\t\tfor (int r=0; r<M; r++) {\n\t\t\t\t\tif (p!=q && p!=r) {\n\t\t\t\t\t\tD a = dis(points[p], points[q])/PQ;\n\t\t\t\t\t\tD b = dis(points[q], points[r])/QR;\n\t\t\t\t\t\tD c = dis(points[r], points[p])/RP;\n\t\t\t\t\t\tif (fabs(a-b)<EPS && fabs(b-c)<EPS && fabs(c-a)<EPS) {\n\t\t\t\t\t\t\tcout << (p+1) << \" \" << (q+1) << \" \" << (r+1) << endl;\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}","accuracy":1,"time_ms":10,"memory_kb":1248,"score_of_the_acc":-0.3701,"final_rank":14},{"submission_id":"aoj_1216_902177","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <string>\n#include <sstream>\n#include <cstring>\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <numeric>\n#include <cctype>\n#include <tuple>\n\n#ifdef _MSC_VER\n#include <agents.h>\n#endif\n\n#define FOR(i, a, b) for(int i = (a); i < (int)(b); ++i)\n#define rep(i, n) FOR(i, 0, n)\n#define ALL(v) v.begin(), v.end()\n#define REV(v) v.rbegin(), v.rend()\n#define MEMSET(v, s) memset(v, s, sizeof(v))\n#define X first\n#define Y second\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int, int> P;\n\ninline double sq(double x){\n\treturn x*x;\n}\n\ndouble x[100], y[100], z[100];\n\ndouble dist(int i, int j){\n\treturn sqrt(sq(x[i] - x[j]) + sq(y[i] - y[j]) + sq(z[i] - z[j]));\n}\n\ndouble EPS = 1e-4;\nbool check(double a, double b, double c){\n\tif (abs(a - b) > EPS) return false;\n\tif (abs(b - c) > EPS) return false;\n\tif (abs(c - a) > EPS) return false;\n\treturn true;\n}\n\nint main(){\n\tint T;\n\tcin >> T;\n\twhile (T--){\n\t\tdouble a, b, c;\n\t\tcin >> a >> b >> c;\n\t\tint n;\n\t\tcin >> n;\n\t\trep(i, n) cin >> x[i] >> y[i] >> z[i];\n\n\t\trep(i, n) rep(j, n) rep(k, n){\n\t\t\tif (i == j && j == k) continue;\n\t\t\tif (check(dist(j, k) / a, dist(k, i) / b, dist(i, j) / c)){\n\t\t\t\tcout << i+1 << \" \" << j+1 << \" \" << k+1 << endl;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1236,"score_of_the_acc":-0.3665,"final_rank":8},{"submission_id":"aoj_1216_499198","code_snippet":"#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<cmath>\n\nusing namespace std;\n\nconst double eps = 5e-3;\n\nstruct point {\n double x,y,z;\n point(){}\n point(double x, double y, double z):x(x),y(y),z(z){}\n point operator-(const point &t){\n return point(x-t.x,y-t.y,z-t.z);\n }\n};\n\ndouble abs(const point &a){\n return sqrt(a.x*a.x + a.y*a.y + a.z*a.z);\n}\n\nbool eq( double a, double b){\n return abs(a/b-b/a)<0.0001;\n}\n\nint main()\n{\n int T;\n cin >> T;\n for(int tc=0;tc<T;++tc){\n int n;\n double l[3];\n vector<point> vp;\n\n for(int i = 0; i < 3; ++i){\n // QR , RP , PQ\n cin >> l[i];\n }\n\n cin >> n;\n for(int i = 0; i < n; ++i){\n point p; cin >> p.x >> p.y >> p.z;\n vp.push_back( p );\n }\n\n for(int a = 0; a < n; ++a){\n \n for(int b = 0; b < n; ++b){\n if( a == b ) continue;\n \n for(int c = 0; c < n; ++c){\n if( b == c || a == c ) continue;\n \n double tl[3];\n \n tl[0] = abs(vp[a]-vp[b]);\n tl[1] = abs(vp[b]-vp[c]);\n tl[2] = abs(vp[c]-vp[a]);\n if( eq(tl[2]/l[2], tl[1]/l[1]) &&\n eq(tl[2]/l[2], tl[0]/l[0]) ){\n cout << c+1 << ' ' << a+1 << ' ' << b+1 << endl;\n }\n }\n }\n }\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1240,"score_of_the_acc":-0.3677,"final_rank":12},{"submission_id":"aoj_1216_499197","code_snippet":"#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<cmath>\n\nusing namespace std;\n\nconst double eps = 5e-3;\n\nstruct point {\n double x,y,z;\n point(){}\n point(double x, double y, double z):x(x),y(y),z(z){}\n point operator-(const point &t){\n return point(x-t.x,y-t.y,z-t.z);\n }\n};\n\ndouble abs(const point &a){\n return sqrt(a.x*a.x + a.y*a.y + a.z*a.z);\n}\n\nbool eq( double a, double b){\n return abs(a/b-b/a)<0.0001;\n}\n\n// a b c\n// Q R P\nconst int possible[3][3] = { {1,1,0},\n {0,1,1},\n {1,0,1} };\n\nbool determine(int p[3], int q[3], int depth, pair<int,int> out[3] ){\n if( depth == 3 ){\n for(int i = 0; i < depth; ++i){\n for(int j = i+1; j < depth; ++j){\n if( (out[i].first == out[j].first || out[i].second == out[j].second) ){\n return false;\n }\n }\n }\n return true;\n }\n for(int j = 0; j < 3; ++j){\n for(int k = 0; k < 3; ++k){\n if( possible[p[depth]][j] && possible[q[depth]][k] ){\n out[depth] = make_pair(j,k);\n if( determine(p,q,depth+1,out) ) return true;\n }\n }\n }\n return false;\n}\n\nint main()\n{\n int T;\n cin >> T;\n for(int tc=0;tc<T;++tc){\n int n;\n pair<double,int> l[3];\n vector<point> vp;\n\n for(int i = 0; i < 3; ++i){\n // QR , RP , PQ\n cin >> l[i].first;\n l[i].second = i;\n }\n // sort(l,l+3);\n\n cin >> n;\n for(int i = 0; i < n; ++i){\n point p; cin >> p.x >> p.y >> p.z;\n vp.push_back( p );\n }\n\n for(int a = 0; a < n; ++a){\n \n for(int b = 0; b < n; ++b){\n if( a == b ) continue;\n \n for(int c = 0; c < n; ++c){\n if( b == c || a == c ) continue;\n \n pair<double,int> tl[3];\n \n tl[0] = make_pair(abs(vp[a]-vp[b]),0);\n tl[1] = make_pair(abs(vp[b]-vp[c]),1);\n tl[2] = make_pair(abs(vp[c]-vp[a]),2);\n // sort(tl,tl+3);\n \n if( eq( tl[2].first / l[2].first, tl[1].first / l[1].first ) &&\n eq( tl[2].first / l[2].first, tl[0].first / l[0].first) ) {\n\n cout << c+1 << ' ' << a+1 << ' ' << b+1 << endl;\n /*\n int pp[3] = { l[2].second, l[1].second, l[0].second};\n int qq[3] = {tl[2].second,tl[1].second,tl[0].second};\n pair<int,int> res[3];\n determine(pp,qq,0,res);\n\n sort(res,res+3);\n\n cout << a << ' ' << b << ' ' << c << endl;\n for(int i = 0; i < 3; ++i){\n cout << res[i].first << ' ' << res[i].second << endl;\n }\n swap(res[0],res[2]);\n swap(res[1],res[2]);\n\n int id[3] = {a,b,c};\n for(int i = 0; i < 3; ++i){\n if( i ) cout << ' ';\n cout << 1+id[res[i].second];\n }\n cout << endl;\n */\n }\n }\n }\n }\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1240,"score_of_the_acc":-0.3677,"final_rank":12},{"submission_id":"aoj_1216_487419","code_snippet":"//12\n#include<iostream>\n#include<algorithm>\n#include<cmath>\n\nusing namespace std;\n\nstruct P{\n double x,y,z;\n double sq(double a){\n return a*a;\n }\n double ds(P a){\n return sqrt(sq(x-a.x)+sq(y-a.y)+sq(z-a.z));\n }\n};\n\nint main(){\n int t;\n cin>>t;\n while(t--){\n double qr,rp,pq;\n int np;\n cin>>qr>>rp>>pq>>np;\n P ps[30];\n for(int i=0;i<np;i++){\n cin>>ps[i].x>>ps[i].y>>ps[i].z;\n }\n double e=1<<30;\n int p,q,r;\n for(int i=0;i<np;i++){\n for(int j=0;j<np;j++){\n\tfor(int k=0;k<np;k++){\n\t double cqr,crp,cpq;\n\t cqr=ps[j].ds(ps[k])/qr;\n\t crp=ps[k].ds(ps[i])/rp;\n\t cpq=ps[i].ds(ps[j])/pq;\n\t cqr/=crp;\n\t cpq/=crp;\n\t double me=max(fabs(cqr-1),fabs(cpq-1));\n\t if(min(cqr,min(crp,cpq))>0&&me<e){\n\t e=me;\n\t p=i;\n\t q=j;\n\t r=k;\n\t }\n\t}\n }\n }\n cout<<p+1<<' '<<q+1<<' '<<r+1<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1236,"score_of_the_acc":-0.3665,"final_rank":8},{"submission_id":"aoj_1216_444011","code_snippet":"#include <iostream>\n#include <sstream>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <set>\n#include <map>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <cassert>\n\nusing namespace std;\n\n#define FOR(i,k,n) for(int i=(k); i<(int)n; ++i)\n#define REP(i,n) FOR(i,0,n)\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n\ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cout<<*i<<\" \"; cout<<endl; }\n\ntypedef long long ll;\nconst int INF = 100000000;\nconst double EPS = 1e-4;\nconst int MOD = 1000000007;\nstruct P{\n double x, y, z;\n};\ndouble dist(double x, double y, double z){\n return sqrt(x*x + y*y + z*z);\n}\ndouble dist2(P p, P q){\n return dist(p.x-q.x, p.y-q.y, p.z-q.z);\n}\n\nint main(){\n int T; cin>>T;\n while(T--){\n double target[3];\n REP(i, 3) cin>>target[i];\n int N; cin>>N;\n vector<P> points(N);\n REP(i, N){\n cin>>points[i].x>>points[i].y>>points[i].z;\n }\n REP(i, N)REP(j, N)REP(k, N)if(i != j && j != k && k != i){\n double tri[3];\n tri[0] = dist2(points[i], points[j]);\n tri[1] = dist2(points[j], points[k]);\n tri[2] = dist2(points[k], points[i]);\n bool ok = true;\n REP(idx, 3){\n if(abs(tri[(idx+1)%3]/tri[idx] - target[(idx+1)%3]/target[idx]) > EPS){\n ok = false;\n }\n }\n if(ok) printf(\"%d %d %d\\n\", k+1, i+1, j+1);\n }\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":0,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_1216_366539","code_snippet":"#include<stdio.h>\n#include<math.h>\nstruct P{double x,y,z;};\n#define S(x) ((x)*(x))\ndouble D(P a,P b){return sqrt(S(a.x-b.x)+S(a.y-b.y)+S(a.z-b.z));}\nint G(double x,double y)\n{\n\treturn (x*0.9998<=y&&y<=x*1.0002);\n}\nint F(P p,P q)\n{\n\tdouble c=q.x/p.x,d=q.y/p.y,e=q.z/p.z;\n\treturn G(c,d)&&G(c,e);\n}\nint main()\n{\n\tP p,a[100];\n\tint T,n,i,j,k;\n\tfor(scanf(\"%d\",&T);T--;)\n\t{\n\t\tscanf(\"%lf%lf%lf%d\",&p.x,&p.y,&p.z,&n);\n\t\tfor(i=0;i<n;++i)scanf(\"%lf%lf%lf\",&a[i].x,&a[i].y,&a[i].z);\n\t\tfor(i=0;i<n;++i)for(j=0;j<n;++j)for(k=0;k<n;++k)\n\t\t{\n\t\t\tif(i==j||j==k)continue;\n\t\t\tP x={D(a[j],a[k]),D(a[k],a[i]),D(a[i],a[j])};\n\t\t\tif(F(p,x))printf(\"%d %d %d\\n\",i+1,j+1,k+1);\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":0,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_1216_319912","code_snippet":"#include <cstdio>\n#include <algorithm>\n#include <queue>\n#include <cmath>\n#define REP(i,n) for(int i=0; i<(int)(n); i++)\n\nusing namespace std;\n\ndouble x[30];\ndouble y[30];\ndouble z[30];\n\ninline double dbl(double i){ return i * i; }\n\ndouble dist(int i, int j){\n return sqrt( dbl(x[i] - x[j]) +\n\t dbl(y[i] - y[j]) +\n\t dbl(z[i] - z[j]) );\n}\n\nint main(){\n int cc;\n double qr, rp, pq;\n scanf(\"%d\", &cc);\n\n while(cc --> 0){\n int n; \n scanf(\"%lf%lf%lf\", &qr, &rp, &pq);\n scanf(\"%d\", &n);\n REP(i,n) scanf(\"%lf%lf%lf\",x+i,y+i,z+i);\n vector<int> v(n);\n v[n-1] = v[n-2] = v[n-3] = 1;\n do{\n vector<int> pqr;\n REP(i,n) if(v[i]) pqr.push_back(i);\n\n do{\n\tconst int p = pqr[0];\n\tconst int q = pqr[1];\n\tconst int r = pqr[2];\n\tconst double e1 = dist(p, q) / pq;\n\tconst double e2 = dist(q, r) / qr;\n\tconst double e3 = dist(r, p) / rp;\n\tconst double eps = 1e-5;\n\n\tif(std::abs(e1 - e2) < e1 * eps &&\n\t std::abs(e2 - e3) < e2 * eps &&\n\t std::abs(e3 - e1) < e3 * eps){\n\t printf(\"%d %d %d\\n\", p + 1, q + 1, r + 1);\n\t goto next;\n\t}\n }while(next_permutation(pqr.begin(), pqr.end()));\n }while(next_permutation(v.begin(), v.end()));\n next:;\n }\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":0,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_1216_285584","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <complex>\n#include <cmath>\n\nusing namespace std;\n\ntypedef complex<double> P;\n\nstruct Triangle{\n double qr,rp,pq;\n};\n\nstruct Point{\n double x,y,z;\n};\n\n#define EPS (0.05)\n#define EQ(a,b) (abs((a)-(b))<EPS)\n\nint main(){\n\n int t;\n cin>>t;\n while(t--){\n Point p[100];\n int n;\n Triangle org;\n cin>>org.qr>>org.rp>>org.pq;\n cin>>n;\n for(int i = 0; i < n; i++)\n cin>>p[i].x>>p[i].y>>p[i].z;\n // ツ三ツ点ツ選ツづアツづ堕環篠猟チツェツッツク\n for(int i = 0; i < n; i++){\n for(int j = 0; j < n; j++){\n for(int k = 0; k < n; k++){\n if(i==j||j==k||k==i)\n continue;\n // ツ選ツづアツつセツ点ツづ三ツ陛督づーツ催ャツづゥ\n double pq=sqrt(pow(p[i].x-p[j].x,2)+pow(p[i].y-p[j].y,2)+pow(p[i].z-p[j].z,2));\n double qr=sqrt(pow(p[j].x-p[k].x,2)+pow(p[j].y-p[k].y,2)+pow(p[j].z-p[k].z,2));\n double rp=sqrt(pow(p[k].x-p[i].x,2)+pow(p[k].y-p[i].y,2)+pow(p[k].z-p[i].z,2));\n // ツ三ツ陛督づ個氾、ツ猟ヲツづーツ確ツ認\n double pqPer=pq/org.pq;\n double qrPer=qr/org.qr;\n double rpPer=rp/org.rp;\n // match\n if(EQ(pqPer,qrPer)&&EQ(qrPer,rpPer))\n cout<<i+1<<\" \"<<j+1<<\" \"<<k+1<<endl;\n }\n }\n }\n }\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":0,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_1216_279616","code_snippet":"#include<iostream>\n#include<vector>\n#include<cmath>\nusing namespace std;\n\n#define EPS 0.0002\n\nstruct Point{double x,y,z;};\ndouble getDistance(Point p1,Point p2)\n{\n return sqrt(pow(p1.x-p2.x,2.0)+pow(p1.y-p2.y,2.0)+pow(p1.z-p2.z,2.0));\n}\n\nint main()\n{\n int n,m,P,Q,R;\n double original[3],x,y,z;\n int i,j,k,t;\n cin>>n;\n while(n-->0){\n for(i=0;i<3;i++)cin>>original[i];\n\n cin>>m;\n vector<Point>v(m);\n for(i=0;i<m;i++){\n cin>>x>>y>>z;\n Point p={x,y,z};\n v[i]=p;\n }\n\n P=0;\n for(i=0;i<m;i++){\n for(j=0;j<m;j++){\n\tif(i==j)continue;\n\tfor(k=0;k<m;k++){\n\t if(i==k||j==k)continue;\n\t double d[3]={getDistance(v[j],v[k]),getDistance(v[k],v[i]),getDistance(v[i],v[j])};\n\t bool ok=true;\n\t for(t=0;t<3;t++){\n\t if(original[t]/original[(t+1)%3]-d[t]/d[(t+1)%3]>EPS)ok=false;\n\t }\n\t if(ok){\n\t P=i+1;\n\t Q=j+1;\n\t R=k+1;\n\t }\n\t if(P)break;\n\t}\n\tif(P)break;\n }\n if(P)break;\n }\n\n cout<<P<<\" \"<<Q<<\" \"<<R<<endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":0,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_1216_279615","code_snippet":"#include<iostream>\n#include<vector>\n#include<cmath>\nusing namespace std;\n\n#define EPS 0.0002\n\nstruct Point{double x,y,z;};\ndouble getDistance(Point p1,Point p2)\n{\n return sqrt(pow(p1.x-p2.x,2.0)+pow(p1.y-p2.y,2.0)+pow(p1.z-p2.z,2.0));\n}\n\nint main()\n{\n int n,m,P,Q,R;\n double original[3],x,y,z;\n int i,j,k;\n cin>>n;\n while(n-->0){\n for(i=0;i<3;i++)cin>>original[i];\n\n cin>>m;\n vector<Point>v(m);\n for(i=0;i<m;i++){\n cin>>x>>y>>z;\n Point p={x,y,z};\n v[i]=p;\n }\n\n P=0;\n for(i=0;i<m;i++){\n for(j=0;j<m;j++){\n\tif(i==j)continue;\n\tfor(k=0;k<m;k++){\n\t if(i==k||j==k)continue;\n\t Point p[3]={v[i],v[j],v[k]};\n\t bool ok=true;\n\t double d[3]={getDistance(p[1],p[2]),getDistance(p[2],p[0]),getDistance(p[0],p[1])};\n\t for(int s=0;s<3;s++){\n\t if(original[s]/original[(s+1)%3]-d[s]/d[(s+1)%3]>EPS)ok=false;\n\t }\n\t if(ok){\n\t P=i+1;\n\t Q=j+1;\n\t R=k+1;\n\t }\n\t if(P)break;\n\t}\n\tif(P)break;\n }\n if(P)break;\n }\n\n cout<<P<<\" \"<<Q<<\" \"<<R<<endl;\n }\n}","accuracy":1,"time_ms":20,"memory_kb":968,"score_of_the_acc":-0.7871,"final_rank":15},{"submission_id":"aoj_1216_279613","code_snippet":"#include<iostream>\n#include<vector>\n#include<cmath>\nusing namespace std;\n\n#define EPS 0.0002\n\nstruct Point{double x,y,z;};\ndouble getDistance(Point p1,Point p2)\n{\n return sqrt(pow(p1.x-p2.x,2.0)+pow(p1.y-p2.y,2.0)+pow(p1.z-p2.z,2.0));\n}\n\nint main()\n{\n int n,m,P,Q,R;\n double original[3],x,y,z;\n int i,j,k,l;\n cin>>n;\n while(n-->0){\n for(i=0;i<3;i++)cin>>original[i];\n\n cin>>m;\n vector<Point>v(m);\n for(i=0;i<m;i++){\n cin>>x>>y>>z;\n Point p={x,y,z};\n v[i]=p;\n }\n\n P=0;\n for(i=0;i<m;i++){\n for(j=0;j<m;j++){\n\tif(i==j)continue;\n\tfor(k=0;k<m;k++){\n\t if(i==k||j==k)continue;\n\t Point p[3]={v[i],v[j],v[k]};\n\t bool ok=true;\n\t double d[3]={getDistance(p[1],p[2]),getDistance(p[2],p[0]),getDistance(p[0],p[1])};\n\t for(int s=0;s<3;s++){\n\t for(int t=0;t<3;t++){\n\t if(original[s]/original[t]-d[s]/d[t]>EPS)ok=false;\n\t }\n\t }\n\t if(ok){\n\t P=i+1;\n\t Q=j+1;\n\t R=k+1;\n\t }\n\t if(P)break;\n\t}\n\tif(P)break;\n }\n if(P)break;\n }\n\n cout<<P<<\" \"<<Q<<\" \"<<R<<endl;\n }\n}","accuracy":1,"time_ms":30,"memory_kb":968,"score_of_the_acc":-1.2871,"final_rank":18},{"submission_id":"aoj_1216_273893","code_snippet":"#define _USE_MATH_DEFINES\n#include <iostream>\n#include <memory>\n#include <memory.h>\n#include <fstream>\n#include <cmath>\n#include <numeric>\n#include <vector>\n#include <stack>\n#include <string>\n#include <queue>\n#include <sstream>\n#include <cstdlib>\n#include <cassert>\n#include <cstdio>\n#include <cstring>\n#include <map>\n#include <set>\n#include <iomanip>\n#include <list>\n#include <cctype>\n#include <algorithm>\n#include <complex>\nusing namespace std;\n\ntypedef complex<double> xy_t;\ntypedef pair<xy_t, xy_t> line;\ntypedef long long ll;\ntypedef pair<int, int> P;\ntypedef pair<double, double> Pd;\ntypedef pair<int, P> PP;\ntypedef pair<int, PP> PPP;\nconst int INF = 1 << 29;\nconst double EPS = 1E-4;\n\n#define rep(i, n) for(int i = 0; i < n; i++)\n#define rep2(i, m, n) for(int i = m; i < n; i++)\n\nlong double QR, RP, PQ;\nlong double x[100];\nlong double y[100];\nlong double z[100];\nlong double dist(int i, int j){\n\tlong double dx = abs(x[i] - x[j]);\n\tlong double dy = abs(y[i] - y[j]);\n\tlong double dz = abs(z[i] - z[j]);\n\treturn sqrt(dx * dx + dy * dy + dz * dz);\n}\n\nint main(){\n\tint T;\n\tint n;\n\tlong double pq, qr, rp;\n\tcin >> T;\n\trep(t, T){\n\t\tcin >> QR >> RP >> PQ;\n\t\tcin >> n;\n\t\trep(i, n){\n\t\t\tcin >> x[i] >> y[i] >> z[i];\n\t\t}\n\t\n\t\trep(i, n) rep(j, n) rep(k, n){\n\t\t\tif(i == j || j == k || k == i) continue;\n\t\t\tpq = dist(i, j);\n\t\t\tqr = dist(j, k);\n\t\t\trp = dist(k, i);\n\t\t\tlong double ratio = pq / PQ;\n\t\t\tif(abs(ratio - qr / QR) < EPS && abs(ratio - rp / RP) < EPS){\n\t\t\t\tcout << i + 1 << \" \" << j + 1 << \" \" << k + 1 << endl;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":0,"score_of_the_acc":0,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_1216_3807101\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <string>\\n#include <numeric>\\n\\n#define REP(i, a, b) for (int i = int(a); i < int(b); i++)\\nusing namespace std;\\ntypedef long long int ll;\\n\\n// clang-format off\\n#ifdef _DEBUG_\\n#define dump(...) do{ cerr << __LINE__ << \\\":\\\\t\\\" << #__VA_ARGS__ << \\\" = \\\"; PPPPP(__VA_ARGS__); cerr << endl; } while(false)\\ntemplate<typename T> void PPPPP(T t) { cerr << t; }\\ntemplate<typename T, typename... S> void PPPPP(T t, S... s) { cerr << t << \\\", \\\"; PPPPP(s...); }\\n#else\\n#define dump(...)\\n#endif\\ntemplate<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }\\ntemplate<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }\\ntemplate<typename T>\\nbool chmin(T &a, T b) { if (a > b) {a = b; return true; } return false;}\\ntemplate<typename T>\\nbool chmax(T &a, T b) { if (a < b) {a = b; return true; } return false;}\\n// clang-format on\\n\\n#include <valarray>\\n#include <cmath>\\n\\ndouble calc(valarray<double> p1, valarray<double> p2) {\\n double res = 0.0;\\n REP (i, 0, 3) {\\n res += pow(p1[i] - p2[i], 2);\\n }\\n return sqrt(res);\\n}\\n\\nvoid subMain() {\\n valarray<double> len(3);\\n REP(i, 0, 3) {\\n cin >> len[i];\\n }\\n int n;\\n cin >> n;\\n vector<valarray<double>> point(n, valarray<double>(3));\\n REP(i, 0, n) {\\n REP(j, 0, 3) {\\n cin >> point[i][j];\\n }\\n }\\n REP(i, 0, n) {\\n REP(j, 0, n) {\\n REP(k, 0, n) {\\n if (i == j || j == k || k == i) continue;\\n valarray<double> res = {\\n calc(point[i], point[j]),\\n calc(point[j], point[k]),\\n calc(point[k], point[i]),\\n };\\n res /= len;\\n double eps = 1e-3;\\n if (abs(res[0] - res[1]) <= eps && abs(res[0] - res[2]) <= eps && abs(res[1] - res[2]) <= eps) {\\n cout << k + 1 << \\\" \\\" << i + 1 << \\\" \\\" << j + 1 << endl;\\n return;\\n }\\n }\\n }\\n }\\n}\\n\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int T;\\n cin >> T;\\n REP(t, 0, T) {\\n subMain();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3284,\n \"score_of_the_acc\": -0.9739,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1216_2376234\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nstruct P{\\n double x, y, z;\\n P():x(0), y(0), z(0){}\\n P(double x, double y, double z):x(x), y(y), z(z){}\\n P operator+(const P& b)const{\\n P res;\\n res.x = x + b.x;\\n res.y = y + b.y;\\n res.z = z + b.z;\\n return res;\\n }\\n P operator-(const P& b)const{\\n P res;\\n res.x = x - b.x;\\n res.y = y - b.y;\\n res.z = z - b.z;\\n return res;\\n }\\n bool operator<(const P& b)const{\\n if(x == b.x)\\n if(y == b.y)\\n return z < b.z;\\n else\\n return y < b.y;\\n else\\n return x < b.x;\\n }\\n};\\n\\nbool eq(double a, double b){\\n return abs(a-b) < 0.0001;\\n}\\n\\n// Experimence\\nint main(void){\\n int T; cin >> T;\\n while(T--){\\n double QR, RP, PQ; cin >> QR >> RP >> PQ;\\n double P_arg = acos((PQ*PQ+RP*RP-QR*QR) / (2*PQ*RP));\\n double Q_arg = acos((PQ*PQ+QR*QR-RP*RP) / (2*PQ*QR));\\n double R_arg = acos((QR*QR+RP*RP-PQ*PQ) / (2*QR*RP));\\n int N; cin >> N;\\n vector<P> points(N);\\n for(int i = 0; i < N; i++){\\n cin >> points[i].x >> points[i].y >> points[i].z;\\n }\\n for(int i = 0; i < N; i++){\\n for(int j = 0; j < N; j++){\\n for(int k = 0; k < N; k++){\\n if(i == j || j == k || i == k) continue;\\n vector<P> triangle(3);\\n triangle[0] = points[i];\\n triangle[1] = points[j];\\n triangle[2] = points[k];\\n\\n //do{\\n vector<double> edge(3);\\n for(int edge_idx = 0; edge_idx < 3; edge_idx++){\\n P subtract = triangle[edge_idx%3] - triangle[(edge_idx+1)%3];\\n edge[edge_idx] = sqrt(subtract.x*subtract.x + subtract.y*subtract.y + subtract.z*subtract.z);\\n }\\n double arg1, arg2, arg3;\\n arg1 = acos((edge[0]*edge[0]+edge[2]*edge[2]-edge[1]*edge[1]) / (2*edge[0]*edge[2]));\\n arg2 = acos((edge[0]*edge[0]+edge[1]*edge[1]-edge[2]*edge[2]) / (2*edge[0]*edge[1]));\\n arg3 = acos((edge[1]*edge[1]+edge[2]*edge[2]-edge[0]*edge[0]) / (2*edge[1]*edge[2]));\\n //DEBUG\\n if(eq(P_arg, arg1) && eq(Q_arg, arg2) && eq(R_arg, arg3)){\\n cout << i+1 << \\\" \\\" << j+1 << \\\" \\\" << k+1 << endl;\\n i = N; j = N; k = N;\\n }\\n //}while(next_permutation(triangle.begin(), triangle.end()));\\n\\n //cout << i << j << k << endl;\\n }\\n }\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3372,\n \"score_of_the_acc\": -1.5,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1216_1893151\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<string>\\n#include<algorithm>\\t\\n#include<map>\\n#include<set>\\n#include<utility>\\n#include<cmath>\\n#include<cstring>\\n#include<queue>\\n#include<cstdio>\\n#include<sstream>\\n#include<iomanip>\\n#define loop(i,a,b) for(int i=a;i<b;i++) \\n#define rep(i,a) loop(i,0,a)\\n#define pb push_back\\n#define mp make_pair\\n#define all(in) in.begin(),in.end()\\n#define shosu(x) fixed<<setprecision(x)\\nusing namespace std;\\n//kaewasuretyuui\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\ntypedef vector<pii> vp;\\ntypedef vector<vp> vvp;\\ntypedef pair<int,pii> pip;\\ntypedef vector<pip>vip;\\nconst double PI=acos(-1);\\nconst double EPS=1e-2;\\nconst int inf=1e8;\\nint main(){\\n\\tint q;\\n\\tcin>>q;\\n\\twhile(q--){\\n\\t\\tdouble x,y,z;\\n\\t\\tcin>>x>>y>>z;\\n\\t\\tint n;\\n\\t\\tcin>>n;\\n\\t\\tvector<vector<double> >in(n,vector<double>(3));\\n\\t\\trep(i,n)rep(j,3)cin>>in[i][j];\\n\\t\\trep(i,n)rep(j,n)rep(k,n)if(i!=j&&j!=k&&k!=i){\\n\\t\\t\\tdouble a=hypot(hypot(in[i][0]-in[j][0],in[i][1]-in[j][1]),in[i][2]-in[j][2]);\\n\\t\\t\\tdouble b=hypot(hypot(in[k][0]-in[j][0],in[k][1]-in[j][1]),in[k][2]-in[j][2]);\\n\\t\\t\\tdouble c=hypot(hypot(in[i][0]-in[k][0],in[i][1]-in[k][1]),in[i][2]-in[k][2]);\\n\\t\\t\\tdouble t=a/x;\\n\\t\\t\\tif(abs(x*t-a)<EPS&&abs(y*t-b)<EPS&&abs(z*t-c)<EPS)cout<<k+1<<\\\" \\\"<<i+1<<\\\" \\\"<<j+1<<endl;\\n\\t\\t}\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1268,\n \"score_of_the_acc\": -0.876,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1216_1451534\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long int uli;\\nconst int mx=40;\\ndouble x[mx],y[mx],z[mx];\\nconst double eps=1e-4;\\ndouble d(int i,int j){\\n return sqrt(pow(x[i]-x[j],2)+pow(y[i]-y[j],2)+pow(z[i]-z[j],2));\\n}\\nbool eq(double x,double y){\\n return fabs(x-y)<eps;\\n}\\nint main(){\\n int t,n;\\n scanf(\\\"%d\\\",&t);\\n double qr,rp,pq;\\n while(t--){\\n scanf(\\\"%lf %lf %lf\\\",&qr,&rp,&pq);\\n scanf(\\\"%d\\\",&n);\\n for(int i=0;i<n;i++){\\n scanf(\\\"%lf %lf %lf\\\",x+i,y+i,z+i);\\n }\\n int p,q,r;\\n for(int i=0;i<n;i++){\\n for(int j=0;j<n;j++) if(j!=i){\\n for(int k=0;k<n;k++) if(k!=i && k!=j){\\n double l1=d(i,j);\\n double l2=d(j,k);\\n double l3=d(k,i);\\n double r1=l1/qr;\\n double r2=l2/rp;\\n double r3=l3/pq;\\n if(eq(r1,r2)&&eq(r1,r3)&&eq(r2,r3)){\\n q=i,r=j,p=k; \\n }\\n }\\n }\\n }\\n printf(\\\"%d %d %d\\\\n\\\",p+1,q+1,r+1);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1228,\n \"score_of_the_acc\": -0.3642,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1216_1332049\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define EPS 1e-7\\n#define equals(a,b) (fabs(a-b) < EPS)\\n\\nstruct Point{\\n double x,y,z;\\n\\n double getDist(const Point &p){\\n return sqrt(pow(x-p.x,2)+pow(y-p.y,2)+pow(z-p.z,2));\\n }\\n};\\n\\nint main(){\\n int Tc,N;\\n double QR,RP,PQ;\\n cin >> Tc;\\n while(Tc--){\\n cin >> QR >> RP >> PQ >> N;\\n Point p[N];\\n for(int i = 0 ; i < N ; i++){\\n cin >> p[i].x >> p[i].y >> p[i].z;\\n }\\n double qr,rp,pq;\\n for(int i = 0 ; i < N ; i++){\\n for(int j = 0 ; j < N ; j++){\\n if(i == j){ continue; }\\n for(int k = 0 ; k < N ; k++){\\n if(i == k || j == k){ continue; }\\n qr = p[j].getDist(p[k]);\\n rp = p[k].getDist(p[i]);\\n pq = p[i].getDist(p[j]);\\n if(equals(QR/qr,RP/rp) && equals(RP/rp,PQ/pq)){\\n cout << i+1 << \\\" \\\" << j+1 << \\\" \\\" << k+1 << endl;\\n goto end;\\n }\\n }\\n }\\n }\\n end:;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1236,\n \"score_of_the_acc\": -0.3665,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1216_1162333\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nconst double EPS = 0.05;\\ninline double dis(vector<double> a, vector<double> b){\\n double res = 0;\\n for(int i=0;i<3;i++)res += (a[i]-b[i])*(a[i]-b[i]);\\n return sqrt(res);\\n}\\n\\nint main(){\\n int casenum;\\n cin >> casenum;\\n while(casenum--){\\n double qr,rp,pq;\\n cin >> qr >> rp >> pq;\\n int n;\\n cin >> n;\\n vector< vector<double> > vp(n,vector<double>(3));\\n for(int i=0;i<n;i++){\\n for(int j=0;j<3;j++)cin >> vp[i][j];\\n }\\n\\n bool f = true;\\n for(int i=0;f && i<n;i++){\\n for(int j=0;f && j<n;j++){\\n\\tif(i==j)continue;\\n\\tfor(int k=0;f && k<n;k++){\\n\\t if(i==k)continue;\\n\\n\\t double d1 = dis(vp[j],vp[k]), d2 = dis(vp[k],vp[i]), d3 = dis(vp[i],vp[j]);\\n\\t double ratio = d1/qr;\\n\\t if( abs(ratio*rp-d2)<EPS && abs(ratio*pq-d3)<EPS){\\n\\t cout << i+1 << \\\" \\\" << j+1 << \\\" \\\" << k+1 << endl;\\n\\t f = false;\\n\\t }\\n\\t}\\n }\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 1256,\n \"score_of_the_acc\": -1.3725,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1216_1103848\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nstruct P {\\n double x,y,z;\\n};\\n\\ndouble D(P a, P b) {\\n return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y)+(a.z-b.z)*(a.z-b.z));\\n}\\n\\nbool equal(double a, double b) {\\n return fabs(a-b)<0.0000001;\\n}\\n\\nint main() {\\n int T;\\n cin >> T;\\n while(T--) {\\n double l[3];\\n for(int i=0; i<3; i++) cin >> l[i];\\n int n;\\n cin >> n;\\n P a[n];\\n for(int i=0; i<n; i++) cin >> a[i].x >> a[i].y >> a[i].z;\\n for(int i=0; i<n; i++) {\\n for(int j=0; j<n; j++) {\\n\\tfor(int k=0; k<n; k++) {\\n\\t if(i==j || j==k || k==i) continue;\\n\\t double d1=l[2]/D(a[i],a[j]);\\n\\t double d2=l[0]/D(a[j],a[k]);\\n\\t double d3=l[1]/D(a[k],a[i]);\\n\\t if(!equal(d1,d2) || !equal(d1,d3)) continue;\\n\\t cout << i+1 << \\\" \\\" << j+1 << \\\" \\\" << k+1 << endl;\\n\\t goto End;\\n\\t}\\n }\\n }\\n End:;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1236,\n \"score_of_the_acc\": -0.3665,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1216_1092546\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <cmath>\\n\\nusing namespace std;\\ntypedef double D;\\nstruct P {\\n\\tD x, y, z;\\n\\tP(){}\\n\\tP(D xx, D yy, D zz):x(xx), y(yy), z(zz){}\\n};\\n\\nD dis(P a, P b) {\\n\\treturn sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y)+(a.z-b.z)*(a.z-b.z));\\n}\\n\\nconst double EPS = 0.05;\\n\\nint main()\\n{\\n\\tint N; cin>>N;\\n\\twhile (N--) {\\n\\t\\tD QR, RP, PQ;\\n\\t\\tcin>>QR>>RP>>PQ;\\n\\t\\tint M; cin>>M;\\n\\t\\tvector<P> points;\\n\\t\\t\\n\\t\\tfor (int i=0; i<M; i++) {\\n\\t\\t\\tdouble x, y, z;\\n\\t\\t\\tcin>>x>>y>>z;\\n\\t\\t\\tpoints.push_back(P(x, y, z));\\n\\t\\t}\\n\\t\\t\\n\\t\\tfor (int p=0; p<M; p++) {\\n\\t\\t\\tfor (int q=0; q<M; q++) {\\n\\t\\t\\t\\tfor (int r=0; r<M; r++) {\\n\\t\\t\\t\\t\\tif (p!=q && p!=r) {\\n\\t\\t\\t\\t\\t\\tD a = dis(points[p], points[q])/PQ;\\n\\t\\t\\t\\t\\t\\tD b = dis(points[q], points[r])/QR;\\n\\t\\t\\t\\t\\t\\tD c = dis(points[r], points[p])/RP;\\n\\t\\t\\t\\t\\t\\tif (fabs(a-b)<EPS && fabs(b-c)<EPS && fabs(c-a)<EPS) {\\n\\t\\t\\t\\t\\t\\t\\tcout << (p+1) << \\\" \\\" << (q+1) << \\\" \\\" << (r+1) << endl;\\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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1248,\n \"score_of_the_acc\": -0.3701,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1216_902177\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <string>\\n#include <sstream>\\n#include <cstring>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cmath>\\n#include <queue>\\n#include <stack>\\n#include <map>\\n#include <set>\\n#include <numeric>\\n#include <cctype>\\n#include <tuple>\\n\\n#ifdef _MSC_VER\\n#include <agents.h>\\n#endif\\n\\n#define FOR(i, a, b) for(int i = (a); i < (int)(b); ++i)\\n#define rep(i, n) FOR(i, 0, n)\\n#define ALL(v) v.begin(), v.end()\\n#define REV(v) v.rbegin(), v.rend()\\n#define MEMSET(v, s) memset(v, s, sizeof(v))\\n#define X first\\n#define Y second\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef pair<int, int> P;\\n\\ninline double sq(double x){\\n\\treturn x*x;\\n}\\n\\ndouble x[100], y[100], z[100];\\n\\ndouble dist(int i, int j){\\n\\treturn sqrt(sq(x[i] - x[j]) + sq(y[i] - y[j]) + sq(z[i] - z[j]));\\n}\\n\\ndouble EPS = 1e-4;\\nbool check(double a, double b, double c){\\n\\tif (abs(a - b) > EPS) return false;\\n\\tif (abs(b - c) > EPS) return false;\\n\\tif (abs(c - a) > EPS) return false;\\n\\treturn true;\\n}\\n\\nint main(){\\n\\tint T;\\n\\tcin >> T;\\n\\twhile (T--){\\n\\t\\tdouble a, b, c;\\n\\t\\tcin >> a >> b >> c;\\n\\t\\tint n;\\n\\t\\tcin >> n;\\n\\t\\trep(i, n) cin >> x[i] >> y[i] >> z[i];\\n\\n\\t\\trep(i, n) rep(j, n) rep(k, n){\\n\\t\\t\\tif (i == j && j == k) continue;\\n\\t\\t\\tif (check(dist(j, k) / a, dist(k, i) / b, dist(i, j) / c)){\\n\\t\\t\\t\\tcout << i+1 << \\\" \\\" << j+1 << \\\" \\\" << k+1 << endl;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1236,\n \"score_of_the_acc\": -0.3665,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1216_499198\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<algorithm>\\n#include<cmath>\\n\\nusing namespace std;\\n\\nconst double eps = 5e-3;\\n\\nstruct point {\\n double x,y,z;\\n point(){}\\n point(double x, double y, double z):x(x),y(y),z(z){}\\n point operator-(const point &t){\\n return point(x-t.x,y-t.y,z-t.z);\\n }\\n};\\n\\ndouble abs(const point &a){\\n return sqrt(a.x*a.x + a.y*a.y + a.z*a.z);\\n}\\n\\nbool eq( double a, double b){\\n return abs(a/b-b/a)<0.0001;\\n}\\n\\nint main()\\n{\\n int T;\\n cin >> T;\\n for(int tc=0;tc<T;++tc){\\n int n;\\n double l[3];\\n vector<point> vp;\\n\\n for(int i = 0; i < 3; ++i){\\n // QR , RP , PQ\\n cin >> l[i];\\n }\\n\\n cin >> n;\\n for(int i = 0; i < n; ++i){\\n point p; cin >> p.x >> p.y >> p.z;\\n vp.push_back( p );\\n }\\n\\n for(int a = 0; a < n; ++a){\\n \\n for(int b = 0; b < n; ++b){\\n if( a == b ) continue;\\n \\n for(int c = 0; c < n; ++c){\\n if( b == c || a == c ) continue;\\n \\n double tl[3];\\n \\n tl[0] = abs(vp[a]-vp[b]);\\n tl[1] = abs(vp[b]-vp[c]);\\n tl[2] = abs(vp[c]-vp[a]);\\n if( eq(tl[2]/l[2], tl[1]/l[1]) &&\\n eq(tl[2]/l[2], tl[0]/l[0]) ){\\n cout << c+1 << ' ' << a+1 << ' ' << b+1 << endl;\\n }\\n }\\n }\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1240,\n \"score_of_the_acc\": -0.3677,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1216_499197\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<algorithm>\\n#include<cmath>\\n\\nusing namespace std;\\n\\nconst double eps = 5e-3;\\n\\nstruct point {\\n double x,y,z;\\n point(){}\\n point(double x, double y, double z):x(x),y(y),z(z){}\\n point operator-(const point &t){\\n return point(x-t.x,y-t.y,z-t.z);\\n }\\n};\\n\\ndouble abs(const point &a){\\n return sqrt(a.x*a.x + a.y*a.y + a.z*a.z);\\n}\\n\\nbool eq( double a, double b){\\n return abs(a/b-b/a)<0.0001;\\n}\\n\\n// a b c\\n// Q R P\\nconst int possible[3][3] = { {1,1,0},\\n {0,1,1},\\n {1,0,1} };\\n\\nbool determine(int p[3], int q[3], int depth, pair<int,int> out[3] ){\\n if( depth == 3 ){\\n for(int i = 0; i < depth; ++i){\\n for(int j = i+1; j < depth; ++j){\\n if( (out[i].first == out[j].first || out[i].second == out[j].second) ){\\n return false;\\n }\\n }\\n }\\n return true;\\n }\\n for(int j = 0; j < 3; ++j){\\n for(int k = 0; k < 3; ++k){\\n if( possible[p[depth]][j] && possible[q[depth]][k] ){\\n out[depth] = make_pair(j,k);\\n if( determine(p,q,depth+1,out) ) return true;\\n }\\n }\\n }\\n return false;\\n}\\n\\nint main()\\n{\\n int T;\\n cin >> T;\\n for(int tc=0;tc<T;++tc){\\n int n;\\n pair<double,int> l[3];\\n vector<point> vp;\\n\\n for(int i = 0; i < 3; ++i){\\n // QR , RP , PQ\\n cin >> l[i].first;\\n l[i].second = i;\\n }\\n // sort(l,l+3);\\n\\n cin >> n;\\n for(int i = 0; i < n; ++i){\\n point p; cin >> p.x >> p.y >> p.z;\\n vp.push_back( p );\\n }\\n\\n for(int a = 0; a < n; ++a){\\n \\n for(int b = 0; b < n; ++b){\\n if( a == b ) continue;\\n \\n for(int c = 0; c < n; ++c){\\n if( b == c || a == c ) continue;\\n \\n pair<double,int> tl[3];\\n \\n tl[0] = make_pair(abs(vp[a]-vp[b]),0);\\n tl[1] = make_pair(abs(vp[b]-vp[c]),1);\\n tl[2] = make_pair(abs(vp[c]-vp[a]),2);\\n // sort(tl,tl+3);\\n \\n if( eq( tl[2].first / l[2].first, tl[1].first / l[1].first ) &&\\n eq( tl[2].first / l[2].first, tl[0].first / l[0].first) ) {\\n\\n cout << c+1 << ' ' << a+1 << ' ' << b+1 << endl;\\n /*\\n int pp[3] = { l[2].second, l[1].second, l[0].second};\\n int qq[3] = {tl[2].second,tl[1].second,tl[0].second};\\n pair<int,int> res[3];\\n determine(pp,qq,0,res);\\n\\n sort(res,res+3);\\n\\n cout << a << ' ' << b << ' ' << c << endl;\\n for(int i = 0; i < 3; ++i){\\n cout << res[i].first << ' ' << res[i].second << endl;\\n }\\n swap(res[0],res[2]);\\n swap(res[1],res[2]);\\n\\n int id[3] = {a,b,c};\\n for(int i = 0; i < 3; ++i){\\n if( i ) cout << ' ';\\n cout << 1+id[res[i].second];\\n }\\n cout << endl;\\n */\\n }\\n }\\n }\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1240,\n \"score_of_the_acc\": -0.3677,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1216_487419\",\n \"code_snippet\": \"//12\\n#include<iostream>\\n#include<algorithm>\\n#include<cmath>\\n\\nusing namespace std;\\n\\nstruct P{\\n double x,y,z;\\n double sq(double a){\\n return a*a;\\n }\\n double ds(P a){\\n return sqrt(sq(x-a.x)+sq(y-a.y)+sq(z-a.z));\\n }\\n};\\n\\nint main(){\\n int t;\\n cin>>t;\\n while(t--){\\n double qr,rp,pq;\\n int np;\\n cin>>qr>>rp>>pq>>np;\\n P ps[30];\\n for(int i=0;i<np;i++){\\n cin>>ps[i].x>>ps[i].y>>ps[i].z;\\n }\\n double e=1<<30;\\n int p,q,r;\\n for(int i=0;i<np;i++){\\n for(int j=0;j<np;j++){\\n\\tfor(int k=0;k<np;k++){\\n\\t double cqr,crp,cpq;\\n\\t cqr=ps[j].ds(ps[k])/qr;\\n\\t crp=ps[k].ds(ps[i])/rp;\\n\\t cpq=ps[i].ds(ps[j])/pq;\\n\\t cqr/=crp;\\n\\t cpq/=crp;\\n\\t double me=max(fabs(cqr-1),fabs(cpq-1));\\n\\t if(min(cqr,min(crp,cpq))>0&&me<e){\\n\\t e=me;\\n\\t p=i;\\n\\t q=j;\\n\\t r=k;\\n\\t }\\n\\t}\\n }\\n }\\n cout<<p+1<<' '<<q+1<<' '<<r+1<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1236,\n \"score_of_the_acc\": -0.3665,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1216_444011\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n#include <string>\\n#include <algorithm>\\n#include <vector>\\n#include <stack>\\n#include <queue>\\n#include <set>\\n#include <map>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <cmath>\\n#include <cassert>\\n\\nusing namespace std;\\n\\n#define FOR(i,k,n) for(int i=(k); i<(int)n; ++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\\n\\ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cout<<*i<<\\\" \\\"; cout<<endl; }\\n\\ntypedef long long ll;\\nconst int INF = 100000000;\\nconst double EPS = 1e-4;\\nconst int MOD = 1000000007;\\nstruct P{\\n double x, y, z;\\n};\\ndouble dist(double x, double y, double z){\\n return sqrt(x*x + y*y + z*z);\\n}\\ndouble dist2(P p, P q){\\n return dist(p.x-q.x, p.y-q.y, p.z-q.z);\\n}\\n\\nint main(){\\n int T; cin>>T;\\n while(T--){\\n double target[3];\\n REP(i, 3) cin>>target[i];\\n int N; cin>>N;\\n vector<P> points(N);\\n REP(i, N){\\n cin>>points[i].x>>points[i].y>>points[i].z;\\n }\\n REP(i, N)REP(j, N)REP(k, N)if(i != j && j != k && k != i){\\n double tri[3];\\n tri[0] = dist2(points[i], points[j]);\\n tri[1] = dist2(points[j], points[k]);\\n tri[2] = dist2(points[k], points[i]);\\n bool ok = true;\\n REP(idx, 3){\\n if(abs(tri[(idx+1)%3]/tri[idx] - target[(idx+1)%3]/target[idx]) > EPS){\\n ok = false;\\n }\\n }\\n if(ok) printf(\\\"%d %d %d\\\\n\\\", k+1, i+1, j+1);\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 0,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1216_366539\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<math.h>\\nstruct P{double x,y,z;};\\n#define S(x) ((x)*(x))\\ndouble D(P a,P b){return sqrt(S(a.x-b.x)+S(a.y-b.y)+S(a.z-b.z));}\\nint G(double x,double y)\\n{\\n\\treturn (x*0.9998<=y&&y<=x*1.0002);\\n}\\nint F(P p,P q)\\n{\\n\\tdouble c=q.x/p.x,d=q.y/p.y,e=q.z/p.z;\\n\\treturn G(c,d)&&G(c,e);\\n}\\nint main()\\n{\\n\\tP p,a[100];\\n\\tint T,n,i,j,k;\\n\\tfor(scanf(\\\"%d\\\",&T);T--;)\\n\\t{\\n\\t\\tscanf(\\\"%lf%lf%lf%d\\\",&p.x,&p.y,&p.z,&n);\\n\\t\\tfor(i=0;i<n;++i)scanf(\\\"%lf%lf%lf\\\",&a[i].x,&a[i].y,&a[i].z);\\n\\t\\tfor(i=0;i<n;++i)for(j=0;j<n;++j)for(k=0;k<n;++k)\\n\\t\\t{\\n\\t\\t\\tif(i==j||j==k)continue;\\n\\t\\t\\tP x={D(a[j],a[k]),D(a[k],a[i]),D(a[i],a[j])};\\n\\t\\t\\tif(F(p,x))printf(\\\"%d %d %d\\\\n\\\",i+1,j+1,k+1);\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 0,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1216_319912\",\n \"code_snippet\": \"#include <cstdio>\\n#include <algorithm>\\n#include <queue>\\n#include <cmath>\\n#define REP(i,n) for(int i=0; i<(int)(n); i++)\\n\\nusing namespace std;\\n\\ndouble x[30];\\ndouble y[30];\\ndouble z[30];\\n\\ninline double dbl(double i){ return i * i; }\\n\\ndouble dist(int i, int j){\\n return sqrt( dbl(x[i] - x[j]) +\\n\\t dbl(y[i] - y[j]) +\\n\\t dbl(z[i] - z[j]) );\\n}\\n\\nint main(){\\n int cc;\\n double qr, rp, pq;\\n scanf(\\\"%d\\\", &cc);\\n\\n while(cc --> 0){\\n int n; \\n scanf(\\\"%lf%lf%lf\\\", &qr, &rp, &pq);\\n scanf(\\\"%d\\\", &n);\\n REP(i,n) scanf(\\\"%lf%lf%lf\\\",x+i,y+i,z+i);\\n vector<int> v(n);\\n v[n-1] = v[n-2] = v[n-3] = 1;\\n do{\\n vector<int> pqr;\\n REP(i,n) if(v[i]) pqr.push_back(i);\\n\\n do{\\n\\tconst int p = pqr[0];\\n\\tconst int q = pqr[1];\\n\\tconst int r = pqr[2];\\n\\tconst double e1 = dist(p, q) / pq;\\n\\tconst double e2 = dist(q, r) / qr;\\n\\tconst double e3 = dist(r, p) / rp;\\n\\tconst double eps = 1e-5;\\n\\n\\tif(std::abs(e1 - e2) < e1 * eps &&\\n\\t std::abs(e2 - e3) < e2 * eps &&\\n\\t std::abs(e3 - e1) < e3 * eps){\\n\\t printf(\\\"%d %d %d\\\\n\\\", p + 1, q + 1, r + 1);\\n\\t goto next;\\n\\t}\\n }while(next_permutation(pqr.begin(), pqr.end()));\\n }while(next_permutation(v.begin(), v.end()));\\n next:;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 0,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1216_285584\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <complex>\\n#include <cmath>\\n\\nusing namespace std;\\n\\ntypedef complex<double> P;\\n\\nstruct Triangle{\\n double qr,rp,pq;\\n};\\n\\nstruct Point{\\n double x,y,z;\\n};\\n\\n#define EPS (0.05)\\n#define EQ(a,b) (abs((a)-(b))<EPS)\\n\\nint main(){\\n\\n int t;\\n cin>>t;\\n while(t--){\\n Point p[100];\\n int n;\\n Triangle org;\\n cin>>org.qr>>org.rp>>org.pq;\\n cin>>n;\\n for(int i = 0; i < n; i++)\\n cin>>p[i].x>>p[i].y>>p[i].z;\\n // ツ三ツ点ツ選ツづアツづ堕環篠猟チツェツッツク\\n for(int i = 0; i < n; i++){\\n for(int j = 0; j < n; j++){\\n for(int k = 0; k < n; k++){\\n if(i==j||j==k||k==i)\\n continue;\\n // ツ選ツづアツつセツ点ツづ三ツ陛督づーツ催ャツづゥ\\n double pq=sqrt(pow(p[i].x-p[j].x,2)+pow(p[i].y-p[j].y,2)+pow(p[i].z-p[j].z,2));\\n double qr=sqrt(pow(p[j].x-p[k].x,2)+pow(p[j].y-p[k].y,2)+pow(p[j].z-p[k].z,2));\\n double rp=sqrt(pow(p[k].x-p[i].x,2)+pow(p[k].y-p[i].y,2)+pow(p[k].z-p[i].z,2));\\n // ツ三ツ陛督づ個氾、ツ猟ヲツづーツ確ツ認\\n double pqPer=pq/org.pq;\\n double qrPer=qr/org.qr;\\n double rpPer=rp/org.rp;\\n // match\\n if(EQ(pqPer,qrPer)&&EQ(qrPer,rpPer))\\n cout<<i+1<<\\\" \\\"<<j+1<<\\\" \\\"<<k+1<<endl;\\n }\\n }\\n }\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 0,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1216_279616\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<cmath>\\nusing namespace std;\\n\\n#define EPS 0.0002\\n\\nstruct Point{double x,y,z;};\\ndouble getDistance(Point p1,Point p2)\\n{\\n return sqrt(pow(p1.x-p2.x,2.0)+pow(p1.y-p2.y,2.0)+pow(p1.z-p2.z,2.0));\\n}\\n\\nint main()\\n{\\n int n,m,P,Q,R;\\n double original[3],x,y,z;\\n int i,j,k,t;\\n cin>>n;\\n while(n-->0){\\n for(i=0;i<3;i++)cin>>original[i];\\n\\n cin>>m;\\n vector<Point>v(m);\\n for(i=0;i<m;i++){\\n cin>>x>>y>>z;\\n Point p={x,y,z};\\n v[i]=p;\\n }\\n\\n P=0;\\n for(i=0;i<m;i++){\\n for(j=0;j<m;j++){\\n\\tif(i==j)continue;\\n\\tfor(k=0;k<m;k++){\\n\\t if(i==k||j==k)continue;\\n\\t double d[3]={getDistance(v[j],v[k]),getDistance(v[k],v[i]),getDistance(v[i],v[j])};\\n\\t bool ok=true;\\n\\t for(t=0;t<3;t++){\\n\\t if(original[t]/original[(t+1)%3]-d[t]/d[(t+1)%3]>EPS)ok=false;\\n\\t }\\n\\t if(ok){\\n\\t P=i+1;\\n\\t Q=j+1;\\n\\t R=k+1;\\n\\t }\\n\\t if(P)break;\\n\\t}\\n\\tif(P)break;\\n }\\n if(P)break;\\n }\\n\\n cout<<P<<\\\" \\\"<<Q<<\\\" \\\"<<R<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 0,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1216_279615\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<cmath>\\nusing namespace std;\\n\\n#define EPS 0.0002\\n\\nstruct Point{double x,y,z;};\\ndouble getDistance(Point p1,Point p2)\\n{\\n return sqrt(pow(p1.x-p2.x,2.0)+pow(p1.y-p2.y,2.0)+pow(p1.z-p2.z,2.0));\\n}\\n\\nint main()\\n{\\n int n,m,P,Q,R;\\n double original[3],x,y,z;\\n int i,j,k;\\n cin>>n;\\n while(n-->0){\\n for(i=0;i<3;i++)cin>>original[i];\\n\\n cin>>m;\\n vector<Point>v(m);\\n for(i=0;i<m;i++){\\n cin>>x>>y>>z;\\n Point p={x,y,z};\\n v[i]=p;\\n }\\n\\n P=0;\\n for(i=0;i<m;i++){\\n for(j=0;j<m;j++){\\n\\tif(i==j)continue;\\n\\tfor(k=0;k<m;k++){\\n\\t if(i==k||j==k)continue;\\n\\t Point p[3]={v[i],v[j],v[k]};\\n\\t bool ok=true;\\n\\t double d[3]={getDistance(p[1],p[2]),getDistance(p[2],p[0]),getDistance(p[0],p[1])};\\n\\t for(int s=0;s<3;s++){\\n\\t if(original[s]/original[(s+1)%3]-d[s]/d[(s+1)%3]>EPS)ok=false;\\n\\t }\\n\\t if(ok){\\n\\t P=i+1;\\n\\t Q=j+1;\\n\\t R=k+1;\\n\\t }\\n\\t if(P)break;\\n\\t}\\n\\tif(P)break;\\n }\\n if(P)break;\\n }\\n\\n cout<<P<<\\\" \\\"<<Q<<\\\" \\\"<<R<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 968,\n \"score_of_the_acc\": -0.7871,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1216_279613\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<cmath>\\nusing namespace std;\\n\\n#define EPS 0.0002\\n\\nstruct Point{double x,y,z;};\\ndouble getDistance(Point p1,Point p2)\\n{\\n return sqrt(pow(p1.x-p2.x,2.0)+pow(p1.y-p2.y,2.0)+pow(p1.z-p2.z,2.0));\\n}\\n\\nint main()\\n{\\n int n,m,P,Q,R;\\n double original[3],x,y,z;\\n int i,j,k,l;\\n cin>>n;\\n while(n-->0){\\n for(i=0;i<3;i++)cin>>original[i];\\n\\n cin>>m;\\n vector<Point>v(m);\\n for(i=0;i<m;i++){\\n cin>>x>>y>>z;\\n Point p={x,y,z};\\n v[i]=p;\\n }\\n\\n P=0;\\n for(i=0;i<m;i++){\\n for(j=0;j<m;j++){\\n\\tif(i==j)continue;\\n\\tfor(k=0;k<m;k++){\\n\\t if(i==k||j==k)continue;\\n\\t Point p[3]={v[i],v[j],v[k]};\\n\\t bool ok=true;\\n\\t double d[3]={getDistance(p[1],p[2]),getDistance(p[2],p[0]),getDistance(p[0],p[1])};\\n\\t for(int s=0;s<3;s++){\\n\\t for(int t=0;t<3;t++){\\n\\t if(original[s]/original[t]-d[s]/d[t]>EPS)ok=false;\\n\\t }\\n\\t }\\n\\t if(ok){\\n\\t P=i+1;\\n\\t Q=j+1;\\n\\t R=k+1;\\n\\t }\\n\\t if(P)break;\\n\\t}\\n\\tif(P)break;\\n }\\n if(P)break;\\n }\\n\\n cout<<P<<\\\" \\\"<<Q<<\\\" \\\"<<R<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 968,\n \"score_of_the_acc\": -1.2871,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1216_273893\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#include <iostream>\\n#include <memory>\\n#include <memory.h>\\n#include <fstream>\\n#include <cmath>\\n#include <numeric>\\n#include <vector>\\n#include <stack>\\n#include <string>\\n#include <queue>\\n#include <sstream>\\n#include <cstdlib>\\n#include <cassert>\\n#include <cstdio>\\n#include <cstring>\\n#include <map>\\n#include <set>\\n#include <iomanip>\\n#include <list>\\n#include <cctype>\\n#include <algorithm>\\n#include <complex>\\nusing namespace std;\\n\\ntypedef complex<double> xy_t;\\ntypedef pair<xy_t, xy_t> line;\\ntypedef long long ll;\\ntypedef pair<int, int> P;\\ntypedef pair<double, double> Pd;\\ntypedef pair<int, P> PP;\\ntypedef pair<int, PP> PPP;\\nconst int INF = 1 << 29;\\nconst double EPS = 1E-4;\\n\\n#define rep(i, n) for(int i = 0; i < n; i++)\\n#define rep2(i, m, n) for(int i = m; i < n; i++)\\n\\nlong double QR, RP, PQ;\\nlong double x[100];\\nlong double y[100];\\nlong double z[100];\\nlong double dist(int i, int j){\\n\\tlong double dx = abs(x[i] - x[j]);\\n\\tlong double dy = abs(y[i] - y[j]);\\n\\tlong double dz = abs(z[i] - z[j]);\\n\\treturn sqrt(dx * dx + dy * dy + dz * dz);\\n}\\n\\nint main(){\\n\\tint T;\\n\\tint n;\\n\\tlong double pq, qr, rp;\\n\\tcin >> T;\\n\\trep(t, T){\\n\\t\\tcin >> QR >> RP >> PQ;\\n\\t\\tcin >> n;\\n\\t\\trep(i, n){\\n\\t\\t\\tcin >> x[i] >> y[i] >> z[i];\\n\\t\\t}\\n\\t\\n\\t\\trep(i, n) rep(j, n) rep(k, n){\\n\\t\\t\\tif(i == j || j == k || k == i) continue;\\n\\t\\t\\tpq = dist(i, j);\\n\\t\\t\\tqr = dist(j, k);\\n\\t\\t\\trp = dist(k, i);\\n\\t\\t\\tlong double ratio = pq / PQ;\\n\\t\\t\\tif(abs(ratio - qr / QR) < EPS && abs(ratio - rp / RP) < EPS){\\n\\t\\t\\t\\tcout << i + 1 << \\\" \\\" << j + 1 << \\\" \\\" << k + 1 << endl;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 0,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":678,"cells":{"group_id":{"kind":"string","value":"aoj_1209_cpp"},"problem_description":{"kind":"string","value":"Problem B:\nSquare Coins\nPeople in Silverland use square coins. Not only they have square shapes but also their values are square numbers. Coins with values of all square numbers up to 289 (= 17\n2\n), i.e., 1-credit coins, 4-credit coins, 9-credit coins, ..., and 289-credit coins, are available in Silverland.\nThere are four combinations of coins to pay ten credits:\nten 1-credit coins,\none 4-credit coin and six 1-credit coins,\ntwo 4-credit coins and two 1-credit coins, and\none 9-credit coin and one 1-credit coin.\nYour mission is to count the number of ways to pay a given amount using coins of Silverland.\nInput\nThe input consists of lines each containing an integer meaning an amount to be paid, followed by a line containing a zero. You may assume that all the amounts are positive and less than 300.\nOutput\nFor each of the given amount, one line containing a single integer representing the number of combinations of coins should be output. No other characters should appear in the output.\nSample Input\n2\n10\n30\n0\nOutput for the Sample Input\n1\n4\n27"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1209_2539223","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nint count( int S[], int m, int n )\n{\n if (n == 0)\n return 1;\n if (n < 0)\n return 0;\n if (m <=0 && n >= 1)\n return 0;\n return count( S, m - 1, n ) + count( S, m, n-S[m-1] );\n}\nint main()\n{\n int n;\n while(cin>>n){\n if(n==0) exit(0);\n else{\n int arr[300];\n int j=0;\n for(int i=1;i<=n;i++){\n if((i*i)<=n){\n arr[j++]=i*i;\n }\n }\n cout<<count(arr,j,n)<<endl;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3020,"score_of_the_acc":-0.1619,"final_rank":9},{"submission_id":"aoj_1209_1981849","code_snippet":"#include <iostream>\n#include <string>\n#include<bits/stdc++.h>\nusing namespace std;\n \nint coin[17];\nint ans;\n \nvoid solve(int n, int u){\n \n for (int i = u; i >= 0; i--){\n if (n > coin[i]) solve(n - coin[i], i);\n else if (n == coin[i]) ans++;\n }\n \n return;\n}\n \n \nint main(void){\n \n int n;\n\n for (int i = 0; i < 17; i++){\n coin[i] = (i + 1) * (i + 1);\n }\n \n while (cin >> n, n){\n ans = 0;\n solve(n, 16);\n cout << ans << endl;\n }\n \n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1168,"score_of_the_acc":-0.0626,"final_rank":5},{"submission_id":"aoj_1209_1923947","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\n\nint square[] = { 1, 4, 9, 16, 25, 36, 49, 64, 81, 100, 121, 144, 169, 196, 225, 256, 289 };\nint ans;\n\n\nvoid dfs(int num, int upper){\n\t//cout << num << \"\\t\" << upper << endl;\n\n\tfor (int i = upper; i >= 0; i--){\n\t\tif (num > square[i]) dfs(num - square[i], i);\n\t\telse if (num == square[i]) ans++;\n\t}\n\n\treturn;\n}\n\n\nint main(void){\n\n\tint num;\n\n\twhile (cin >> num, num){\n\t\tans = 0;\n\t\tdfs(num, 16);\n\n\t\tcout << ans << endl;\n\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1164,"score_of_the_acc":-0.0624,"final_rank":2},{"submission_id":"aoj_1209_1890569","code_snippet":"#include <bits/stdc++.h>\nusing namespace std ;\n\n#define pb(n) push_back(n)\n#define fi first\n#define se second\n#define all(r) (r).begin(),(r).end()\n#define vmax(ary) *max_element(all(ary))\n#define vmin(ary) *min_element(all(ary))\n#define debug(x) cout<<#x<<\": \"<<x<<endl\n#define fcout(n) cout<<fixed<<setprecision((n))\n#define scout(n) cout<<setw(n)\n#define vary(type,name,size,init) vector< type> name(size,init)\n#define vvl(v,w,h,init) vector<vector<ll>> v(w,vector<ll>(h,init))\n#define mp(a,b) make_pair(a,b)\n\n#define rep(i,n) for(int i = 0; i < (int)(n);++i)\n#define REP(i,a,b) for(int i = (a);i < (int)(b);++i)\n#define repi(it,array) for(auto it = array.begin(),end = array.end(); it != end;++it)\n#define repa(n,array) for(auto &n :(array))\n\nusing ll = long long;\nusing vi = vector<int>;\nusing vl = vector<ll>;\nusing dict = map<string,int>;\nusing pii = pair<int,int> ;\nusing pll = pair<ll,ll> ;\n\nconst int mod = 1000000007;\nconstexpr int inf = ((1<<30)-1)*2+1 ;\nconstexpr double PI = acos(-1.0) ;\ndouble eps = 1e-10 ;\n\nvector<vector<ll>> dp(1000,vector<ll>(20,0));\n\nvary(int,v,0,0);\nint tar;\nint DP(int i,int k){\n if(k == tar){\n return 1;\n }\n if(k > tar) return 0;\n int cnt = 0;\n dp[i][k] = 1;\n REP(j,i,18){\n cnt += DP(j,k+v[j]);\n }\n return cnt;\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n v.clear();\n REP(i,0,18){\n v.pb(i*i);\n }\n int n;\n while(cin >> n&&n){\n tar = n;\n dp = vector<vector<ll>>(1000,vector<ll>(1000,0));\n cout << DP(1,0) << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":18652,"score_of_the_acc":-1.2917,"final_rank":16},{"submission_id":"aoj_1209_1446038","code_snippet":"#include <algorithm>\n#include <functional>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <string>\n#include <sstream>\n#include <iostream>\n#include <iomanip>\n#include <vector>\n#include <list>\n#include <stack>\n#include <queue>\n#include <map>\n#include <set>\n#include <bitset>\n#include <climits>\n\n#define all(c) (c).begin(), (c).end()\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define pb(e) push_back(e)\n#define mp(a, b) make_pair(a, b)\n#define fr first\n#define sc second\n\nconst int INF=100000000;\nint dx[4]={1,0,-1,0};\nint dy[4]={0,1,0,-1};\nusing namespace std;\ntypedef pair<int ,int > P;\ntypedef long long ll;\n\n\nll dfs(int x,int a) {\n if(x==0) return 1;\n ll ret=0;\n rep(i,18) if(a<=i) {\n if(x-i*i>=0) {\n ret+=dfs(x-i*i,i);\n }\n }\n\n return ret;\n}\n\nint main() {\n ll x;\n while(cin>>x) {\n if(x==0) break;\n cout<<dfs(x,1)<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":120,"memory_kb":1164,"score_of_the_acc":-0.5207,"final_rank":13},{"submission_id":"aoj_1209_1356427","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\n#ifdef __GXX_EXPERIMENTAL_CXX0X__\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#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#ifdef __GXX_EXPERIMENTAL_CXX0X__\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 <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\nusing namespace std;\n\nint data[18] = {};\n\nlong long int saiki(int N,int reb)\n{\n\tif (!N)return 1;\n\twhile (data[reb] > N)reb--;\n\tlong long int count = 0;\n\tfor (size_t i = reb; i >0; i--)\n\t{\n\t\tcount += saiki(N - data[i], i);\n\t}\n\treturn count;\n}\n\nint main()\n{\n\tint N;\n\tfor (size_t i = 0; i < 18; i++)\n\t{\n\t\tdata[i] = i*i;\n\t}\n\twhile (cin >> N, N)\n\t{\n\t\tcout << saiki(N, 17) << endl;\n\t}\n}","accuracy":1,"time_ms":10,"memory_kb":1164,"score_of_the_acc":-0.0624,"final_rank":2},{"submission_id":"aoj_1209_1237336","code_snippet":"#include<cstdio>\n#include<algorithm>\n#include<vector>\n#include<iostream>\nusing namespace std;\nint n;\nint v[17];\nint dfs(int pos,int sum){\n if(pos==17){\n if(sum==n)return 1;\n else return 0;\n }\n int res=0;\n for(int i=0;sum+v[pos]*i<=n;i++)res+=dfs(pos+1,sum+v[pos]*i);\n return res;\n}\nint main(){\n for(int i=0;i<17;i++)v[i]=(i+1)*(i+1);\n while(cin>>n,n)cout<<dfs(0,0)<<endl;\n}","accuracy":1,"time_ms":110,"memory_kb":1160,"score_of_the_acc":-0.4789,"final_rank":12},{"submission_id":"aoj_1209_668536","code_snippet":"#include <iostream>\n\nusing namespace std;\n\nint div[17];\n\nint dfs(int num, int s)\n{\n int ret = 0;\n\n if (num == 0)\n return 1;\n else if (num < 0)\n return 0;\n\n for (int i = s; i < 17; i++) {\n if (num < div[i])\n break;\n ret += dfs(num - div[i], i);\n }\n return ret;\n}\n\nint main()\n{\n int n;\n\n for (int i = 1; i <= 17; i++)\n div[i - 1] = i * i;\n\n while (cin >> n, n) {\n int ans = 0;\n\n cout << dfs(n, 0) << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1164,"score_of_the_acc":-0.0624,"final_rank":2},{"submission_id":"aoj_1209_516568","code_snippet":"#include<iostream>\n#include<vector>\n#include<algorithm>\n\nusing namespace std;\n\nvoid MakeData(int, int, bool, vector<int>, vector<int>&);\nvoid NextData(vector<int>, vector<int>&);\n\nint main(){\n int i, n;\n vector<int> coin, data;\n\n for(i=1; i<=17; ++i) coin.push_back(i*i);\n\n while(1){\n cin >> n;\n if(n == 0) break;\n MakeData(n, n, true, coin, data);\n\n for(i=1; data[0]!=1; ++i) NextData(coin, data);\n cout << i << endl;\n data.clear();\n }\n return 0;\n}\n\nvoid MakeData(int n, int m, bool is_upper,\n\t vector<int> coin, vector<int>& data){\n vector<int>::iterator i;\n if(is_upper) i = upper_bound(coin.begin(), coin.end(), m);\n else i = lower_bound(coin.begin(), coin.end(), m);\n --i;\n while(1){\n if(n >= *i){\n data.push_back(*i);\n n -= *i;\n if(n == 0) return;\n }else{\n --i;\n }\n }\n}\n\nvoid NextData(vector<int> coin, vector<int>& data){\n int n, sum;\n vector<int>::iterator i, j;\n i = find(data.begin(), data.end(), 1);\n n = *(i-1);\n if(i == data.end()){\n data.pop_back();\n MakeData(n, n, false, coin, data);\n }else{\n for(j=i-1, sum=0; j!=data.end(); ++j) sum += *j;\n data.erase(i-1, data.end());\n MakeData(sum, n, false, coin, data);\n }\n}","accuracy":1,"time_ms":10,"memory_kb":1220,"score_of_the_acc":-0.0654,"final_rank":6},{"submission_id":"aoj_1209_465451","code_snippet":"#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <climits>\n#include <cfloat>\n#include <cstring>\n#include <map>\n#include <utility>\n#include <set>\n#include <iostream>\n#include <memory>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <functional>\n#include <sstream>\n#include <complex>\n#include <stack>\n#include <queue>\n\n#define FOR(i,b,n) for(int i=b;i<n;i++)\n#define RFOR(i,b,n) for(int i=n-1;i>=b;i--)\n#define CLR(mat) memset(mat, 0, sizeof(mat))\n#define NCLR(mat) memset(mat, -1, sizeof(mat))\n\nusing namespace std;\n\nstatic const double EPS = 1e-9;\ntypedef long long ll;\ntypedef pair<int, int> paii;\n\nint coin[18] = {0}; \nint n, res = 0;\n\nvoid solve_rec(int sum, int i)\n{\n\tif( i <= 17)\n\t{\n\t\tif( sum == n)\n\t\t\tres++;\n\t\telse if(sum < n)\n\t\t{\n\t\t\tsolve_rec(sum+coin[i], i);\n\t\t\tsolve_rec(sum, i+1);\n\t\t}\n\t}\n\t\n\treturn;\n}\n\nint solve()\n{\n\tres = 0;\n\tsolve_rec(0, 1);\n\treturn res;\n}\n\nvoid init()\n{\n\tFOR(i, 1, 18)\n\t{\n\t\tcoin[i] = i*i;\n\t}\n\t\n\treturn;\n}\n\nint main()\n{\n\tinit();\n\t\n\twhile(cin >> n, n)\n\t{\n\t\tcout << solve() << endl;\n\t}\n\t\n\treturn 0;\n}","accuracy":1,"time_ms":160,"memory_kb":1168,"score_of_the_acc":-0.6876,"final_rank":14},{"submission_id":"aoj_1209_371652","code_snippet":"#include <iostream>\n#include <cstring>\n\nusing namespace std;\nint dp[18][301][301];\nint hoge;\nint main(){\n memset(dp,0,sizeof(dp));\n for(int i=0;i<301;++i) dp[0][i][i] = 1;\n \n for(int i=1;i<18;i++){\n for(int j=0;j<301;j++){\n for(int k=0;k<301;++k){\n int cnt=0;\n while((i+1)*(i+1)*cnt+k<301){\n dp[i][j+cnt][(i+1)*(i+1)*cnt+k] += dp[i-1][j][k];\n cnt++;\n }\n }\n }\n }\n\n int n;\n while(cin >> n && n){\n int ret=0;\n for(int i=0;i<301;++i) ret+= dp[17][i][n];\n cout << ret << endl;\n }\n}","accuracy":1,"time_ms":30,"memory_kb":7124,"score_of_the_acc":-0.4653,"final_rank":11},{"submission_id":"aoj_1209_340626","code_snippet":"#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\n#include<cassert>\n#include<iostream>\n#include<sstream>\n#include<string>\n#include<vector>\n#include<queue>\n#include<set>\n#include<map>\n#include<utility>\n#include<numeric>\n#include<algorithm>\n#include<bitset>\n#include<complex>\n#include<stack>\n\nusing namespace std;\n\ntypedef long long Int;\ntypedef vector<int> vint;\ntypedef pair<int,int> pint;\ntypedef vector<string> vstring;\ntypedef vector<pint> vpint;\n\nstruct Edge{int to,from,cost;};\n\n#ifdef DEBUGLOCAL\n#define debug cout\n#else\nstringstream __ss__;\n#define debug __ss__\n#endif\n\ntemplate<class T> void pv(T a, T b) { for (T i = a; i != b; ++i) debug << *i << \" \"; debug << endl; }\ntemplate<class T> void chmin(T &t, T f) { if (t > f) t = f; }\ntemplate<class T> void chmax(T &t, T f) { if (t < f) t = f; }\nint in() { int x; scanf(\"%d\", &x); return x; }\n\n#define rep(i,n) for(int i=0;i<(n);++i)\n#define repd(i,n) for(int i=(n)-1;i>=0;i--)\n#define repn(i,m,n) for(int i=(m);i<=(n);++i)\n#define repnd(i,m,n) for(int i=(n)-1;i>=(m);i--)\n#define rep0(i,n) for(i=0;i<(n);++i)\n#define all(n) n.begin(),n.end()\n#define sz(n) ((int)(n).size())\n#define IL for(;;)\n#define MP make_pair\n#define PB push_back\n#define SS stringstream\n#define X second\n#define Y first\n#define PUTLINE debug<<\"LINE:\"<<__LINE__<<endl;\n\nconst int INF = 2147483647/3;\nconst double EPS = 1e-10;\nconst double PI = acos(-1.0);\n\nconst int dx[]={1,-1,0,0,1,-1,1,-1,0};\nconst int dy[]={0,0,1,-1,1,-1,-1,1,0};\n\nint solve(int n,int a){\n\tif(n==0)return 1;\n\tint res=0;\n\tfor(int i=a;i*i<=n;++i){\n\t\tres+=solve(n-i*i,i);\n\t}\n\treturn res;\n}\n\nint main() {\n\tint n;\n\tIL{\n\t\tcin>>n;\n\t\tif(n==0)break;\n\t\tcout<<solve(n,1)<<endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":40,"memory_kb":876,"score_of_the_acc":-0.172,"final_rank":10},{"submission_id":"aoj_1209_317707","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <string>\n\nusing namespace std;\n\nconst int N = 17;\nint n;\n\nint dfs(int i)\n{\n\tif (n < 0) {\n\t\treturn 0;\n\t}\n\tif (n == 0) {\n\t\treturn 1;\n\t}\n\tint ans = 0;\n\tfor (int j = i; j <= N; j++) {\n\t\tn -= j * j;\n\t\tans += dfs(j);\n\t\tn += j * j;\n\t}\n\treturn ans;\n}\n\nvoid solve()\n{\n\tint ans = dfs(1);\n\tcout << ans << endl;\n}\n\nint main()\n{\n\twhile (cin >> n, n) {\n\t\tsolve();\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":250,"memory_kb":872,"score_of_the_acc":-1.0468,"final_rank":15},{"submission_id":"aoj_1209_157610","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <cassert>\n#include <cctype>\n#include <complex>\n#include <cstdio>\n#include <map>\n#include <math.h>\n#include <queue>\n#include <set>\n#include <stack>\n#include <string>\n#include <vector>\nusing namespace std;\n\n#define rep(i,n) for(int i=0;i<n;i++)\n\nint n;\n\nint solve(int n,int m){\n\tif(!n)return 1;\n\tif(n<0)return 0;\n\tint res=0;\n\trep(i,m)res+=solve(n-(i+1)*(i+1),i+1);\n\treturn res;\n}\n\nint main(){\n\twhile(cin>>n&&n)cout<<solve(n,17)<<endl;\n}","accuracy":1,"time_ms":20,"memory_kb":0,"score_of_the_acc":-0.0417,"final_rank":1},{"submission_id":"aoj_1209_120892","code_snippet":"#include <iostream>\n#include <cmath>\nusing namespace std;\n\nint value[301];\n\nint pow(int x, int n) {\n int ans = 1;\n for(int i = 0; i < n; i++) {\n ans *= x;\n }\n return ans;\n}\n\nbool isHeiho(int x) {\n return (double)((int)sqrt(x)) == sqrt(x);\n}\n\nvoid rec(int minI, int x, int maxX) {\n if(x == 0) {\n value[maxX]++;\n return;\n }\n for(int i = minI; i <= 17; i++) {\n int tmp = pow(i, 2);\n if(tmp <= x) rec(i, x-tmp, maxX);\n if(tmp > x) break;\n }\n}\n\nint main() {\n for(int i = 1; i <= 30; i++) {\n value[i] = 0;\n }\n\n while(1) {\n int price;\n cin >> price;\n if(price == 0) break;\n if(value[price] == 0) {\n rec(1, price, price);\n }\n cout << value[price] << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":868,"score_of_the_acc":-0.1299,"final_rank":8},{"submission_id":"aoj_1209_93535","code_snippet":"#include<stdio.h>\n#include<string.h>\n\nint c,sq[18];\n\nint count(int n,int i){\n\tif(n==0)return 0;\n\tint j;\n\tfor(j=i;j>=1;j--){\n\t\tif(n<sq[j])continue;\n\t\tif(n==sq[j]){\n\t\t\t++c;\n\t\t\tcontinue;\n\t\t}\n\t\tcount(n-sq[j],j);\n\t}\n\treturn 0;\n}\n\nint main(){\n\n\tint i,j,n;\n\t\n\tfor(i=0;i<=17;i++){\n\t\tsq[i]=i*i;\n\t}\n\t\n\twhile(0<=scanf(\"%d\",&n)){\n\t\tif(n==0)break;\n\t\tc=0;\n\t\t\n\t\tfor(i=1;i<=17;i++){\n\t\t\tif(n<sq[i]){\n\t\t\t\t--i;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tcount(n,i);\n\t\tprintf(\"%d\\n\",c);\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":760,"score_of_the_acc":-0.0824,"final_rank":7}],"string":"[\n {\n \"submission_id\": \"aoj_1209_2539223\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nint count( int S[], int m, int n )\\n{\\n if (n == 0)\\n return 1;\\n if (n < 0)\\n return 0;\\n if (m <=0 && n >= 1)\\n return 0;\\n return count( S, m - 1, n ) + count( S, m, n-S[m-1] );\\n}\\nint main()\\n{\\n int n;\\n while(cin>>n){\\n if(n==0) exit(0);\\n else{\\n int arr[300];\\n int j=0;\\n for(int i=1;i<=n;i++){\\n if((i*i)<=n){\\n arr[j++]=i*i;\\n }\\n }\\n cout<<count(arr,j,n)<<endl;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3020,\n \"score_of_the_acc\": -0.1619,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1209_1981849\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include<bits/stdc++.h>\\nusing namespace std;\\n \\nint coin[17];\\nint ans;\\n \\nvoid solve(int n, int u){\\n \\n for (int i = u; i >= 0; i--){\\n if (n > coin[i]) solve(n - coin[i], i);\\n else if (n == coin[i]) ans++;\\n }\\n \\n return;\\n}\\n \\n \\nint main(void){\\n \\n int n;\\n\\n for (int i = 0; i < 17; i++){\\n coin[i] = (i + 1) * (i + 1);\\n }\\n \\n while (cin >> n, n){\\n ans = 0;\\n solve(n, 16);\\n cout << ans << endl;\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1168,\n \"score_of_the_acc\": -0.0626,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1209_1923947\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\n\\nint square[] = { 1, 4, 9, 16, 25, 36, 49, 64, 81, 100, 121, 144, 169, 196, 225, 256, 289 };\\nint ans;\\n\\n\\nvoid dfs(int num, int upper){\\n\\t//cout << num << \\\"\\\\t\\\" << upper << endl;\\n\\n\\tfor (int i = upper; i >= 0; i--){\\n\\t\\tif (num > square[i]) dfs(num - square[i], i);\\n\\t\\telse if (num == square[i]) ans++;\\n\\t}\\n\\n\\treturn;\\n}\\n\\n\\nint main(void){\\n\\n\\tint num;\\n\\n\\twhile (cin >> num, num){\\n\\t\\tans = 0;\\n\\t\\tdfs(num, 16);\\n\\n\\t\\tcout << ans << endl;\\n\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1164,\n \"score_of_the_acc\": -0.0624,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1209_1890569\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std ;\\n\\n#define pb(n) push_back(n)\\n#define fi first\\n#define se second\\n#define all(r) (r).begin(),(r).end()\\n#define vmax(ary) *max_element(all(ary))\\n#define vmin(ary) *min_element(all(ary))\\n#define debug(x) cout<<#x<<\\\": \\\"<<x<<endl\\n#define fcout(n) cout<<fixed<<setprecision((n))\\n#define scout(n) cout<<setw(n)\\n#define vary(type,name,size,init) vector< type> name(size,init)\\n#define vvl(v,w,h,init) vector<vector<ll>> v(w,vector<ll>(h,init))\\n#define mp(a,b) make_pair(a,b)\\n\\n#define rep(i,n) for(int i = 0; i < (int)(n);++i)\\n#define REP(i,a,b) for(int i = (a);i < (int)(b);++i)\\n#define repi(it,array) for(auto it = array.begin(),end = array.end(); it != end;++it)\\n#define repa(n,array) for(auto &n :(array))\\n\\nusing ll = long long;\\nusing vi = vector<int>;\\nusing vl = vector<ll>;\\nusing dict = map<string,int>;\\nusing pii = pair<int,int> ;\\nusing pll = pair<ll,ll> ;\\n\\nconst int mod = 1000000007;\\nconstexpr int inf = ((1<<30)-1)*2+1 ;\\nconstexpr double PI = acos(-1.0) ;\\ndouble eps = 1e-10 ;\\n\\nvector<vector<ll>> dp(1000,vector<ll>(20,0));\\n\\nvary(int,v,0,0);\\nint tar;\\nint DP(int i,int k){\\n if(k == tar){\\n return 1;\\n }\\n if(k > tar) return 0;\\n int cnt = 0;\\n dp[i][k] = 1;\\n REP(j,i,18){\\n cnt += DP(j,k+v[j]);\\n }\\n return cnt;\\n}\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n v.clear();\\n REP(i,0,18){\\n v.pb(i*i);\\n }\\n int n;\\n while(cin >> n&&n){\\n tar = n;\\n dp = vector<vector<ll>>(1000,vector<ll>(1000,0));\\n cout << DP(1,0) << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 18652,\n \"score_of_the_acc\": -1.2917,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1209_1446038\",\n \"code_snippet\": \"#include <algorithm>\\n#include <functional>\\n#include <cmath>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <string>\\n#include <sstream>\\n#include <iostream>\\n#include <iomanip>\\n#include <vector>\\n#include <list>\\n#include <stack>\\n#include <queue>\\n#include <map>\\n#include <set>\\n#include <bitset>\\n#include <climits>\\n\\n#define all(c) (c).begin(), (c).end()\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n#define pb(e) push_back(e)\\n#define mp(a, b) make_pair(a, b)\\n#define fr first\\n#define sc second\\n\\nconst int INF=100000000;\\nint dx[4]={1,0,-1,0};\\nint dy[4]={0,1,0,-1};\\nusing namespace std;\\ntypedef pair<int ,int > P;\\ntypedef long long ll;\\n\\n\\nll dfs(int x,int a) {\\n if(x==0) return 1;\\n ll ret=0;\\n rep(i,18) if(a<=i) {\\n if(x-i*i>=0) {\\n ret+=dfs(x-i*i,i);\\n }\\n }\\n\\n return ret;\\n}\\n\\nint main() {\\n ll x;\\n while(cin>>x) {\\n if(x==0) break;\\n cout<<dfs(x,1)<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 1164,\n \"score_of_the_acc\": -0.5207,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1209_1356427\",\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\\n#ifdef __GXX_EXPERIMENTAL_CXX0X__\\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#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#ifdef __GXX_EXPERIMENTAL_CXX0X__\\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 <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\\nusing namespace std;\\n\\nint data[18] = {};\\n\\nlong long int saiki(int N,int reb)\\n{\\n\\tif (!N)return 1;\\n\\twhile (data[reb] > N)reb--;\\n\\tlong long int count = 0;\\n\\tfor (size_t i = reb; i >0; i--)\\n\\t{\\n\\t\\tcount += saiki(N - data[i], i);\\n\\t}\\n\\treturn count;\\n}\\n\\nint main()\\n{\\n\\tint N;\\n\\tfor (size_t i = 0; i < 18; i++)\\n\\t{\\n\\t\\tdata[i] = i*i;\\n\\t}\\n\\twhile (cin >> N, N)\\n\\t{\\n\\t\\tcout << saiki(N, 17) << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1164,\n \"score_of_the_acc\": -0.0624,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1209_1237336\",\n \"code_snippet\": \"#include<cstdio>\\n#include<algorithm>\\n#include<vector>\\n#include<iostream>\\nusing namespace std;\\nint n;\\nint v[17];\\nint dfs(int pos,int sum){\\n if(pos==17){\\n if(sum==n)return 1;\\n else return 0;\\n }\\n int res=0;\\n for(int i=0;sum+v[pos]*i<=n;i++)res+=dfs(pos+1,sum+v[pos]*i);\\n return res;\\n}\\nint main(){\\n for(int i=0;i<17;i++)v[i]=(i+1)*(i+1);\\n while(cin>>n,n)cout<<dfs(0,0)<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 1160,\n \"score_of_the_acc\": -0.4789,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1209_668536\",\n \"code_snippet\": \"#include <iostream>\\n\\nusing namespace std;\\n\\nint div[17];\\n\\nint dfs(int num, int s)\\n{\\n int ret = 0;\\n\\n if (num == 0)\\n return 1;\\n else if (num < 0)\\n return 0;\\n\\n for (int i = s; i < 17; i++) {\\n if (num < div[i])\\n break;\\n ret += dfs(num - div[i], i);\\n }\\n return ret;\\n}\\n\\nint main()\\n{\\n int n;\\n\\n for (int i = 1; i <= 17; i++)\\n div[i - 1] = i * i;\\n\\n while (cin >> n, n) {\\n int ans = 0;\\n\\n cout << dfs(n, 0) << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1164,\n \"score_of_the_acc\": -0.0624,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1209_516568\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<algorithm>\\n\\nusing namespace std;\\n\\nvoid MakeData(int, int, bool, vector<int>, vector<int>&);\\nvoid NextData(vector<int>, vector<int>&);\\n\\nint main(){\\n int i, n;\\n vector<int> coin, data;\\n\\n for(i=1; i<=17; ++i) coin.push_back(i*i);\\n\\n while(1){\\n cin >> n;\\n if(n == 0) break;\\n MakeData(n, n, true, coin, data);\\n\\n for(i=1; data[0]!=1; ++i) NextData(coin, data);\\n cout << i << endl;\\n data.clear();\\n }\\n return 0;\\n}\\n\\nvoid MakeData(int n, int m, bool is_upper,\\n\\t vector<int> coin, vector<int>& data){\\n vector<int>::iterator i;\\n if(is_upper) i = upper_bound(coin.begin(), coin.end(), m);\\n else i = lower_bound(coin.begin(), coin.end(), m);\\n --i;\\n while(1){\\n if(n >= *i){\\n data.push_back(*i);\\n n -= *i;\\n if(n == 0) return;\\n }else{\\n --i;\\n }\\n }\\n}\\n\\nvoid NextData(vector<int> coin, vector<int>& data){\\n int n, sum;\\n vector<int>::iterator i, j;\\n i = find(data.begin(), data.end(), 1);\\n n = *(i-1);\\n if(i == data.end()){\\n data.pop_back();\\n MakeData(n, n, false, coin, data);\\n }else{\\n for(j=i-1, sum=0; j!=data.end(); ++j) sum += *j;\\n data.erase(i-1, data.end());\\n MakeData(sum, n, false, coin, data);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1220,\n \"score_of_the_acc\": -0.0654,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1209_465451\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstdlib>\\n#include <cmath>\\n#include <climits>\\n#include <cfloat>\\n#include <cstring>\\n#include <map>\\n#include <utility>\\n#include <set>\\n#include <iostream>\\n#include <memory>\\n#include <string>\\n#include <vector>\\n#include <algorithm>\\n#include <functional>\\n#include <sstream>\\n#include <complex>\\n#include <stack>\\n#include <queue>\\n\\n#define FOR(i,b,n) for(int i=b;i<n;i++)\\n#define RFOR(i,b,n) for(int i=n-1;i>=b;i--)\\n#define CLR(mat) memset(mat, 0, sizeof(mat))\\n#define NCLR(mat) memset(mat, -1, sizeof(mat))\\n\\nusing namespace std;\\n\\nstatic const double EPS = 1e-9;\\ntypedef long long ll;\\ntypedef pair<int, int> paii;\\n\\nint coin[18] = {0}; \\nint n, res = 0;\\n\\nvoid solve_rec(int sum, int i)\\n{\\n\\tif( i <= 17)\\n\\t{\\n\\t\\tif( sum == n)\\n\\t\\t\\tres++;\\n\\t\\telse if(sum < n)\\n\\t\\t{\\n\\t\\t\\tsolve_rec(sum+coin[i], i);\\n\\t\\t\\tsolve_rec(sum, i+1);\\n\\t\\t}\\n\\t}\\n\\t\\n\\treturn;\\n}\\n\\nint solve()\\n{\\n\\tres = 0;\\n\\tsolve_rec(0, 1);\\n\\treturn res;\\n}\\n\\nvoid init()\\n{\\n\\tFOR(i, 1, 18)\\n\\t{\\n\\t\\tcoin[i] = i*i;\\n\\t}\\n\\t\\n\\treturn;\\n}\\n\\nint main()\\n{\\n\\tinit();\\n\\t\\n\\twhile(cin >> n, n)\\n\\t{\\n\\t\\tcout << solve() << endl;\\n\\t}\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 1168,\n \"score_of_the_acc\": -0.6876,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1209_371652\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstring>\\n\\nusing namespace std;\\nint dp[18][301][301];\\nint hoge;\\nint main(){\\n memset(dp,0,sizeof(dp));\\n for(int i=0;i<301;++i) dp[0][i][i] = 1;\\n \\n for(int i=1;i<18;i++){\\n for(int j=0;j<301;j++){\\n for(int k=0;k<301;++k){\\n int cnt=0;\\n while((i+1)*(i+1)*cnt+k<301){\\n dp[i][j+cnt][(i+1)*(i+1)*cnt+k] += dp[i-1][j][k];\\n cnt++;\\n }\\n }\\n }\\n }\\n\\n int n;\\n while(cin >> n && n){\\n int ret=0;\\n for(int i=0;i<301;++i) ret+= dp[17][i][n];\\n cout << ret << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 7124,\n \"score_of_the_acc\": -0.4653,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1209_340626\",\n \"code_snippet\": \"#include<cstdio>\\n#include<cstdlib>\\n#include<cstring>\\n#include<cmath>\\n#include<cassert>\\n#include<iostream>\\n#include<sstream>\\n#include<string>\\n#include<vector>\\n#include<queue>\\n#include<set>\\n#include<map>\\n#include<utility>\\n#include<numeric>\\n#include<algorithm>\\n#include<bitset>\\n#include<complex>\\n#include<stack>\\n\\nusing namespace std;\\n\\ntypedef long long Int;\\ntypedef vector<int> vint;\\ntypedef pair<int,int> pint;\\ntypedef vector<string> vstring;\\ntypedef vector<pint> vpint;\\n\\nstruct Edge{int to,from,cost;};\\n\\n#ifdef DEBUGLOCAL\\n#define debug cout\\n#else\\nstringstream __ss__;\\n#define debug __ss__\\n#endif\\n\\ntemplate<class T> void pv(T a, T b) { for (T i = a; i != b; ++i) debug << *i << \\\" \\\"; debug << endl; }\\ntemplate<class T> void chmin(T &t, T f) { if (t > f) t = f; }\\ntemplate<class T> void chmax(T &t, T f) { if (t < f) t = f; }\\nint in() { int x; scanf(\\\"%d\\\", &x); return x; }\\n\\n#define rep(i,n) for(int i=0;i<(n);++i)\\n#define repd(i,n) for(int i=(n)-1;i>=0;i--)\\n#define repn(i,m,n) for(int i=(m);i<=(n);++i)\\n#define repnd(i,m,n) for(int i=(n)-1;i>=(m);i--)\\n#define rep0(i,n) for(i=0;i<(n);++i)\\n#define all(n) n.begin(),n.end()\\n#define sz(n) ((int)(n).size())\\n#define IL for(;;)\\n#define MP make_pair\\n#define PB push_back\\n#define SS stringstream\\n#define X second\\n#define Y first\\n#define PUTLINE debug<<\\\"LINE:\\\"<<__LINE__<<endl;\\n\\nconst int INF = 2147483647/3;\\nconst double EPS = 1e-10;\\nconst double PI = acos(-1.0);\\n\\nconst int dx[]={1,-1,0,0,1,-1,1,-1,0};\\nconst int dy[]={0,0,1,-1,1,-1,-1,1,0};\\n\\nint solve(int n,int a){\\n\\tif(n==0)return 1;\\n\\tint res=0;\\n\\tfor(int i=a;i*i<=n;++i){\\n\\t\\tres+=solve(n-i*i,i);\\n\\t}\\n\\treturn res;\\n}\\n\\nint main() {\\n\\tint n;\\n\\tIL{\\n\\t\\tcin>>n;\\n\\t\\tif(n==0)break;\\n\\t\\tcout<<solve(n,1)<<endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 876,\n \"score_of_the_acc\": -0.172,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1209_317707\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <string>\\n\\nusing namespace std;\\n\\nconst int N = 17;\\nint n;\\n\\nint dfs(int i)\\n{\\n\\tif (n < 0) {\\n\\t\\treturn 0;\\n\\t}\\n\\tif (n == 0) {\\n\\t\\treturn 1;\\n\\t}\\n\\tint ans = 0;\\n\\tfor (int j = i; j <= N; j++) {\\n\\t\\tn -= j * j;\\n\\t\\tans += dfs(j);\\n\\t\\tn += j * j;\\n\\t}\\n\\treturn ans;\\n}\\n\\nvoid solve()\\n{\\n\\tint ans = dfs(1);\\n\\tcout << ans << endl;\\n}\\n\\nint main()\\n{\\n\\twhile (cin >> n, n) {\\n\\t\\tsolve();\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 872,\n \"score_of_the_acc\": -1.0468,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1209_157610\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <cassert>\\n#include <cctype>\\n#include <complex>\\n#include <cstdio>\\n#include <map>\\n#include <math.h>\\n#include <queue>\\n#include <set>\\n#include <stack>\\n#include <string>\\n#include <vector>\\nusing namespace std;\\n\\n#define rep(i,n) for(int i=0;i<n;i++)\\n\\nint n;\\n\\nint solve(int n,int m){\\n\\tif(!n)return 1;\\n\\tif(n<0)return 0;\\n\\tint res=0;\\n\\trep(i,m)res+=solve(n-(i+1)*(i+1),i+1);\\n\\treturn res;\\n}\\n\\nint main(){\\n\\twhile(cin>>n&&n)cout<<solve(n,17)<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 0,\n \"score_of_the_acc\": -0.0417,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1209_120892\",\n \"code_snippet\": \"#include <iostream>\\n#include <cmath>\\nusing namespace std;\\n\\nint value[301];\\n\\nint pow(int x, int n) {\\n int ans = 1;\\n for(int i = 0; i < n; i++) {\\n ans *= x;\\n }\\n return ans;\\n}\\n\\nbool isHeiho(int x) {\\n return (double)((int)sqrt(x)) == sqrt(x);\\n}\\n\\nvoid rec(int minI, int x, int maxX) {\\n if(x == 0) {\\n value[maxX]++;\\n return;\\n }\\n for(int i = minI; i <= 17; i++) {\\n int tmp = pow(i, 2);\\n if(tmp <= x) rec(i, x-tmp, maxX);\\n if(tmp > x) break;\\n }\\n}\\n\\nint main() {\\n for(int i = 1; i <= 30; i++) {\\n value[i] = 0;\\n }\\n\\n while(1) {\\n int price;\\n cin >> price;\\n if(price == 0) break;\\n if(value[price] == 0) {\\n rec(1, price, price);\\n }\\n cout << value[price] << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 868,\n \"score_of_the_acc\": -0.1299,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1209_93535\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<string.h>\\n\\nint c,sq[18];\\n\\nint count(int n,int i){\\n\\tif(n==0)return 0;\\n\\tint j;\\n\\tfor(j=i;j>=1;j--){\\n\\t\\tif(n<sq[j])continue;\\n\\t\\tif(n==sq[j]){\\n\\t\\t\\t++c;\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tcount(n-sq[j],j);\\n\\t}\\n\\treturn 0;\\n}\\n\\nint main(){\\n\\n\\tint i,j,n;\\n\\t\\n\\tfor(i=0;i<=17;i++){\\n\\t\\tsq[i]=i*i;\\n\\t}\\n\\t\\n\\twhile(0<=scanf(\\\"%d\\\",&n)){\\n\\t\\tif(n==0)break;\\n\\t\\tc=0;\\n\\t\\t\\n\\t\\tfor(i=1;i<=17;i++){\\n\\t\\t\\tif(n<sq[i]){\\n\\t\\t\\t\\t--i;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcount(n,i);\\n\\t\\tprintf(\\\"%d\\\\n\\\",c);\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 760,\n \"score_of_the_acc\": -0.0824,\n \"final_rank\": 7\n }\n]","isConversational":false}}},{"rowIdx":679,"cells":{"group_id":{"kind":"string","value":"aoj_1215_cpp"},"problem_description":{"kind":"string","value":"Problem H:\nCo-occurrence Search\nA huge amount of information is being heaped on WWW. Albeit it is not well-organized, users can browse WWW as an unbounded source of up-to-date information, instead of consulting established but a little out-of-date encyclopedia. However, you can further exploit WWW by learning more about keyword search algorithms.\nFor example, if you want to get information on recent comparison between Windows and UNIX, you may expect to get relevant description out of a big bunch of Web texts, by extracting texts that contain both keywords \"Windows\" and \"UNIX\" close together.\nHere we have a simplified version of this co-occurrence keyword search problem, where the text and keywords are replaced by a string and key characters, respectively. A character string S of length\nn\n(1 ≤\nn\n≤ 1,000,000) and a set\nK\nof\nk\ndistinct key characters\na\n1\n, ...,\na\nk\n(1 ≤\nk\n≤ 50) are given. Find every shortest substring of\nS\nthat contains all of the key characters\na\n1\n, ...,\na\nk\n.\nInput\nThe input is a text file which contains only printable characters (ASCII codes 21 to 7E in hexadecimal) and newlines. No white space such as space or tab appears in the input.\nThe text is a sequence of the shortest string search problems described above. Each problem consists of character string\nS\ni\nand key character set\nK\ni\n(\ni\n= 1, 2, ...,\np\n). Every\nS\ni\nand\nK\ni\nis followed by an empty line. However, any single newline between successive lines in a string should be ignored; that is, newlines are not part of the string. For various technical reasons, every line consists of at most 72 characters. Each key character set is given in a single line. The input is terminated by consecutive empty lines;\np\nis not given explicitly.\nOutput\nAll of\np\nproblems should be solved and their answers should be output in order. However, it is not requested to print all of the shortest substrings if more than one substring is found in a problem, since found substrings may be too much to check them all. Only the number of the substrings together with their representative is requested instead. That is, for each problem\ni\n, the number of the shortest substrings should be output followed by the first (or the leftmost) shortest substring\ns\ni\n1\n, obeying the following format:\nthe number of the shortest substrings for the i-th problem\n empty line\n the first line of s\ni1\nthe second line of s\ni1\n...\n the last line of s\ni1\nempty line for the substring termination\nwhere each line of the shortest substring\ns\ni\n1\nexcept for the last line should consist of exactly 72 characters and the last line (or the single line if the substring is shorter than or equal to 72 characters, of course) should not exceed 72 characters.\nIf there is no such substring for a problem, the output will be a 0 followed by an empty line; no more successive empty line should be output because there is no substring to be terminated.\nSample Input\nThefirstexampleistrivial.\n\nmfv\n\nAhugeamountofinformationisbeingheapedonWWW.Alb\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1215_2683439","code_snippet":"#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\n#include <time.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\nstring buf,line,pattern;\nvector<int> LOC[128];\n\n\nbool check(int start,int end){\n\n\tbool FLG;\n\n\tint left,right,m,tmp_start,tmp_end;\n\n\tfor(int i = 0; i < pattern.length(); i++){\n\t\tint ch = pattern[i];\n\n\t\tleft = 0,right = LOC[ch].size()-1,m = (left+right)/2;\n\t\ttmp_start = BIG_NUM;\n\n\t\twhile(left <= right){\n\t\t\tif(LOC[ch][m] >= start){\n\t\t\t\ttmp_start = m;\n\t\t\t\tright = m-1;\n\t\t\t}else{\n\t\t\t\tleft = m+1;\n\t\t\t}\n\t\t\tm = (left+right)/2;\n\t\t}\n\t\tif(tmp_start == BIG_NUM)return false;\n\n\t\tleft = tmp_start,right = LOC[ch].size()-1,m = (left+right)/2;\n\t\ttmp_end = BIG_NUM;\n\n\t\twhile(left <= right){\n\t\t\tif(LOC[ch][m] <= end){\n\t\t\t\ttmp_end = m;\n\t\t\t\tleft = m+1;\n\t\t\t}else{\n\t\t\t\tright = m-1;\n\t\t\t}\n\t\t\tm = (left+right)/2;\n\t\t}\n\t\tif(tmp_end == BIG_NUM)return false;\n\t}\n\treturn true;\n}\n\nvoid func(){\n\n\tfor(int i = 0; i < 128; i++)LOC[i].clear();\n\n\tline += buf;\n\twhile(true){\n\t\tgetline(cin,buf);\n\t\tif(buf == \"\")break;\n\t\tline += buf;\n\t}\n\tgetline(cin,pattern);\n\tgetline(cin,buf);\n\n\tfor(int i = 0; i < line.length(); i++){\n\t\tLOC[line[i]].push_back(i);\n\t}\n\n\tfor(int i = 0; i < pattern.length(); i++){\n\t\tif(LOC[pattern[i]].size() == 0){\n\t\t\tprintf(\"0\\n\\n\");\n\t\t\treturn;\n\t\t}\n\t}\n\n\tbool FLG;\n\tint left,right,m,minimum = BIG_NUM,ans_count = 1,tmp_end;\n\tint ans_start,ans_end;\n\n\tfor(int start = 0; start < line.length(); start++){\n\n\t\tleft = start,right = line.length()-1,m = (left+right)/2;\n\t\ttmp_end = BIG_NUM;\n\n\t\twhile(left <= right){\n\t\t\tif(check(start,m)){\n\t\t\t\ttmp_end = m;\n\t\t\t\tright = m-1;\n\t\t\t}else{\n\t\t\t\tleft = m+1;\n\t\t\t}\n\t\t\tm = (left+right)/2;\n\t\t}\n\t\tif(tmp_end == BIG_NUM)continue;\n\n\t\tif(tmp_end-start+1 < minimum){\n\n\t\t\tminimum = tmp_end-start+1;\n\t\t\tans_count = 1;\n\t\t\tans_start = start;\n\t\t\tans_end = tmp_end;\n\n\t\t}else if(tmp_end-start+1 == minimum){\n\t\t\tans_count++;\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\\n\",ans_count);\n\tfor(int i = ans_start; i <= ans_end; i += 72){\n\t\tfor(int k = i; k <= min(ans_end,i+71); k++){\n\t\t\tprintf(\"%c\",line[k]);\n\t\t}\n\t\tprintf(\"\\n\");\n\t}\n\tprintf(\"\\n\");\n\n\tline.clear();\n\tpattern.clear();\n}\n\n\nint main(){\n\n\twhile(true){\n\t\tgetline(cin,buf);\n\t\tif(buf == \"\")break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":2150,"memory_kb":6068,"score_of_the_acc":-1.7524,"final_rank":20},{"submission_id":"aoj_1215_2198500","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define int long long\n#define all(v) begin(v), end(v)\n#define rep(i, n) for(int i = 0; i < (int)(n); i++)\n#define reps(i, s, n) for(int i = (int)(s); i < (int)(n); i++)\n#define min(...) min({__VA_ARGS__})\n#define max(...) max({__VA_ARGS__})\n\ntemplate<class T1, class T2> void chmin(T1 &a, T2 b){if(a>b)a=b;}\ntemplate<class T1, class T2> void chmax(T1 &a, T2 b){if(a<b)a=b;}\n\nusing pint = pair<int, int>;\nusing tint = tuple<int, int, int>;\nusing vint = vector<int>;\n\nconst int inf = 1LL << 55;\nconst int mod = 1e9 + 7;\n\nsigned main()\n{\n cin.tie(0);\n ios_base::sync_with_stdio(0);\n cout << fixed << setprecision(12);\n\n string line;\n while(getline(cin, line), line != \"\") {\n string s = line, a;\n while(getline(cin, line), line != \"\") s += line;\n getline(cin, a);\n\n int n = s.size(), k = a.size();\n vint pos[55];\n rep(i, n) rep(j, k) {\n if(s[i] == a[j]) pos[j].push_back(i);\n }\n bool imp = false;\n rep(i, k) if(!pos[i].size()) imp = true;\n if(imp) {\n cout << 0 << endl << endl;\n getline(cin, line);\n continue;\n }\n\n int idx[55] = {};\n int ans = 0, head = 0, len = n;\n rep(i, n) {\n int tail = i;\n rep(j, k) chmax(tail, pos[j][idx[j]]);\n if(tail-i+1 < len) ans = 0, head = i, len = tail-i+1;\n if(tail-i+1 == len) ans++;\n int p = a.find(s[i]);\n if(p != -1) {\n\tidx[p]++;\n\tif(idx[p] >= pos[p].size()) break;\n }\n }\n\n string t = s.substr(head, len);\n cout << ans << endl;\n rep(i, t.size()) {\n if(i%72 == 0) cout << endl;\n cout << t[i];\n }\n cout << endl << endl;\n getline(cin, line);\n }\n\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3476,"score_of_the_acc":-0.3254,"final_rank":11},{"submission_id":"aoj_1215_2197064","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nstring S,K;\nconst int n = 1<<8;\n\nint getlen(){\n int mx[n],res=1e9;\n memset(mx,-1,sizeof(mx));\n for(int i=0;i<S.size();i++){\n int ch = S[i];\n mx[ch] = max(mx[ch],i);\n int c=0,l=1e9;\n for(int j=0;j<K.size();j++)c+=mx[K[j]]>=0,l=min(l,mx[K[j]]);\n if(c<K.size()) continue;\n res=min(res,i-l);\n }\n return res;\n}\n\nint count(int len){\n int cnt[n]={},res=0;\n for(int i=0;i<S.size();i++){\n cnt[S[i]]++;\n int c=0;\n for(int j=0;j<K.size();j++)c+=cnt[K[j]]>0;\n if(c==K.size())res++;\n if(i-len>=0) cnt[S[i-len]]--;\n }\n return res;\n}\n\nstring getstr(int len){\n int cnt[n]={},res=0;\n for(int i=0;i<S.size();i++){\n cnt[S[i]]++;\n int c=0;\n for(int j=0;j<K.size();j++)c+=cnt[K[j]]>0;\n if(c==K.size()) return S.substr(i-len,len+1);\n if(i-len>=0) cnt[S[i-len]]--;\n }\n return \"\";\n}\n\nint main(){\n while(1){\n S.clear();\n while(1){\n string s; \n getline(cin,s);\n if(s.empty()) break;\n S+=s;\n }\n if(S.empty())break;\n getline(cin,K);\n \n int len = getlen();\n cout<<count(len)<<endl;\n string str = getstr(len);\n for(int i=0;i<str.size();i++){\n if(i!=str.size()-1&&i%72==0)cout<<endl;\n cout<<str[i];\n }\n cout<<endl;\n if(len<1e9)cout<<endl;\n getline(cin,K); \n }\n return 0;\n}","accuracy":1,"time_ms":90,"memory_kb":3376,"score_of_the_acc":-0.3269,"final_rank":12},{"submission_id":"aoj_1215_2196819","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint main(){\n string buf;\n while(getline(cin,buf),buf!=\"\"){\n string s=buf;\n while(getline(cin,buf),buf!=\"\") s+=buf;\n string a;\n getline(cin,a);\n //cout<<s<<endl<<a<<endl;\n \n int n=a.size();\n vector<int> pos[n];\n for(int i=0;i<(int)s.size();i++)\n for(int j=0;j<n;j++)\n if(s[i]==a[j]) pos[j].push_back(i);\n \n bool f=1;\n for(int i=0;i<n;i++) f&=!!(pos[i].size());\n if(!f){\n cout<<0<<endl<<endl;\n getline(cin,buf);\n continue;\n }\n \n int idx[n];\n memset(idx,0,sizeof(idx));\n \n int ans=0,len=s.size()+1,head=0;\n for(int i=0;i<(int)s.size();i++){\n int nxt=i;\n for(int j=0;j<n;j++)\n nxt=max(nxt,pos[j][idx[j]]);\n \n if(nxt-i+1<len) ans=0,len=nxt-i+1,head=i;\n if(nxt-i+1==len) ans++;\n \n for(int j=0;j<n;j++){\n if(s[i]==a[j]) idx[j]++;\n if(idx[j]>=(int)pos[j].size()) goto LAB;\n }\n }\n \n LAB:\n string str=s.substr(head,len);\n \n cout<<ans<<endl;\n for(int i=0;i<(int)str.size();i++){\n if(i%72==0) cout<<endl;\n cout<<str[i];\n }\n cout<<endl<<endl;;\n //ready for next;\n getline(cin,buf);\n }\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":3608,"score_of_the_acc":-0.3621,"final_rank":14},{"submission_id":"aoj_1215_2196733","code_snippet":"#include<bits/stdc++.h>\n#define M 1000005\n#define N 300\nusing namespace std;\nstring s,t,temp;\nint scnt[N],tcnt[N],ans[M],B[M],E[M];\n\nint main(){\n while(1){\n getline(cin,temp);\n if(temp==\"\")break;\n s=\"\";\n s+=temp;\n while(1){\n getline(cin,temp);\n s+=temp;\n if(temp==\"\")break;\n }\n getline(cin,temp);\n t=temp;\n getline(cin,temp);\n int flag=0;\n memset(tcnt,0,sizeof(tcnt));\n for(int i=0;i<(int)t.size();i++)\n tcnt[(int)t[i]]++;\n int cnt=0,idx=0;\n memset(scnt,0,sizeof(scnt));\n memset(ans,0,sizeof(ans)); \n for(int i=0;i<(int)s.size();i++){\n if(scnt[(int)s[i]]<tcnt[(int)s[i]])cnt++;\n scnt[(int)s[i]]++;\n if(cnt==t.size()){\n\tflag=1;\n\tif(!ans[i-idx+1]){\n\t B[i-idx+1]=idx;\n\t E[i-idx+1]=i;\n\t ans[i-idx+1]++;\n\t}else ans[i-idx+1]++;\n\twhile(1){\n\t if(scnt[(int)s[idx]]==tcnt[(int)s[idx]]){\n\t scnt[(int)s[idx]]--;\n\t idx++;\n\t cnt--;\n\t break;\n\t }\n\t scnt[(int)s[idx]]--;\n\t idx++;\n\t if(cnt==t.size()){\n\t if(!ans[i-idx+1]){\n\t B[i-idx+1]=idx;\n\t E[i-idx+1]=i;\n\t ans[i-idx+1]++;\n\t }else ans[i-idx+1]++;\n\t }\n\t}\n }\n }\n if(!flag)cout<<0<<endl<<endl;\n for(int i=0;i<M;i++)\n if(ans[i]){\n\tcout<<ans[i]<<endl<<endl;\n\tstring str=s.substr(B[i],E[i]-B[i]+1);\n\tfor(int j=0;j<str.size();j++){\n\t cout<<str[j];\n\t if(!((j+1)%72))cout<<endl;\n\t}\n\tif(str.size()%72)cout<<endl;\n\tcout<<endl;\n\tbreak;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":7508,"score_of_the_acc":-1,"final_rank":19},{"submission_id":"aoj_1215_2196625","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint main(){\n string buf;\n while(getline(cin,buf),buf!=\"\"){\n string s=buf;\n while(getline(cin,buf),buf!=\"\") s+=buf;\n string a;\n getline(cin,a);\n //cout<<s<<endl<<a<<endl;\n \n int n=a.size();\n vector<int> pos[n];\n for(int i=0;i<(int)s.size();i++)\n for(int j=0;j<n;j++)\n\tif(s[i]==a[j]) pos[j].push_back(i);\n\n bool f=1;\n for(int i=0;i<n;i++) f&=!!(pos[i].size());\n if(!f){\n cout<<0<<endl<<endl;\n getline(cin,buf);\n continue;\n }\n \n int idx[n];\n memset(idx,0,sizeof(idx));\n \n int ans=0,len=s.size()+1,head=0;\n for(int i=0;i<(int)s.size();i++){\n int nxt=i;\n for(int j=0;j<n;j++)\n\tnxt=max(nxt,pos[j][idx[j]]);\n\n if(nxt-i+1<len) ans=0,len=nxt-i+1,head=i;\n if(nxt-i+1==len) ans++;\n\n for(int j=0;j<n;j++){\n\tif(s[i]==a[j]) idx[j]++;\n\tif(idx[j]>=(int)pos[j].size()) goto LAB;\n }\n }\n \n LAB:\n string str=s.substr(head,len);\n \n cout<<ans<<endl;\n for(int i=0;i<(int)str.size();i++){\n if(i%72==0) cout<<endl;\n cout<<str[i];\n }\n cout<<endl<<endl;;\n //ready for next;\n getline(cin,buf);\n }\n return 0;\n}","accuracy":1,"time_ms":90,"memory_kb":3448,"score_of_the_acc":-0.3393,"final_rank":13},{"submission_id":"aoj_1215_1130392","code_snippet":"/*\n000000000011111111112222222222333333333344444444\n012345678901234567890123456789012345678901234567\nTfefirstemampleistrivivlTfefirstemampleistrifivl\n . . .\nlen = 18 sp = 3\nlen = 15 sp = 11\nlen = 12 sp = 22\nlen = 12 sp = 35\nmfv\n \n000000000011111111112222222222\n012345678901234567890123456789\naabbccbbccaabbaacceeddffccaabb\n . ..\n \nlen = 4 sp = 1\n \nabc\n \n*/\n \n#include<set>\n#include<iostream>\n#include<cmath>\n#include<cstdio>\n \n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define inf (1<<29)\n \nusing namespace std;\n \nvoid compute(string text,string S)\n{\n int nt = text.size(),nS = S.size();\n int mlen = inf;\n string ans;\n set<string> all;\n bool found[nS];\n int CNT = 0;\n int fpos[nS];\n rep(i,nS)found[i] = false;\n \n rep(i,nt)\n {\n bool update = false;\n int cnt = 0,mn,mx;\n mn = inf,mx = -inf;\n rep(j,nS)\n {\n if(S[j] == text[i])\n {\n update = true;\n found[j] = true;\n fpos[j] = i;\n }\n if(found[j])\n {\n cnt++;\n mn = min(mn,fpos[j]);\n mx = max(mx,fpos[j]);\n }\n }\n if(cnt == nS)\n {\n int cost = mx - mn + 1;\n if(cost < mlen)\n {\n mlen = cost;\n ans = text.substr(mn,cost);\n all.clear();\n CNT = 1;\n all.insert(text.substr(mn,cost));\n }\n else if(cost == mlen)\n {\n if(update)CNT++;\n all.insert(text.substr(mn,cost));\n }\n }\n }\n cout << CNT << endl << endl;\n //printf(\"%d\\n\\n\",(int)all.size());\n \n if(all.empty())\n {\n return;\n }\n \n rep(i,ans.size())\n if((i+1)%72 == 0 && i != 0)\n printf(\"%c\\n\",ans[i]);\n else\n printf(\"%c\",ans[i]);\n if(ans.size()%72 != 0)puts(\"\\n\");\n else puts(\"\");\n}\n \nint main()\n{\n string blank;\n while(getline(cin,blank))\n {\n string text,S;\n text += blank;\n while(getline(cin,blank))\n {\n if(blank.empty())break;\n text += blank;\n }\n if(text.empty())goto Fin;\n while(getline(cin,blank))\n if(blank.empty())break;\n else S += blank;\n compute(text,S);\n }\n Fin:;\n return 0;\n}","accuracy":1,"time_ms":550,"memory_kb":2652,"score_of_the_acc":-0.4174,"final_rank":16},{"submission_id":"aoj_1215_1100289","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n while(1) {\n string s=\"\",t,r;\n getline(cin,s);\n if(s==\"\") break;\n while(1) {\n getline(cin,r);\n if(r==\"\") break;\n s+=r;\n }\n getline(cin,t);\n getline(cin,r);\n \n map<char,int> m,d;\n m.clear();\n d.clear();\n for(int i=0; i<t.size(); i++) d[t[i]]=1;\n vector<int> v;\n for(int i=0; i<s.size(); i++) {\n if(d[s[i]]==1) v.push_back(i);\n }\n int x=0,cnt=0;\n string ans=s;\n for(int i=0; i<v.size(); i++) {\n char c=s[v[i]];\n m[c]++;\n if(m.size()==t.size()) {\n\twhile(m[s[v[x]]]>1) {\n\t m[s[v[x]]]--;\n\t x++;\n\t}\n\tif(ans.size()==v[i]-v[x]+1) {\n\t cnt++;\n\t} else if(ans.size()>v[i]-v[x]+1) {\n\t cnt=1;\n\t ans=s.substr(v[x],v[i]-v[x]+1);\n\t}\n }\n }\n \n if(cnt==0) cout << cnt << endl;\n else {\n cout << cnt << endl << endl;\n for(int i=0; i<ans.size(); i++) {\n\tcout << ans[i];\n\tif((i+1)%72==0) cout << endl;\n }\n if(ans.size()%72) cout << endl;\n }\n cout << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":2116,"score_of_the_acc":-0.0776,"final_rank":9},{"submission_id":"aoj_1215_1081269","code_snippet":"#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n\n#include <iostream>\n#include <cstdio>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cctype>\n#include <utility>\n#include <assert.h>\n \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <int,int> P;\ntypedef pair <int,P> PP;\n \nstatic const double EPS = 1e-8;\n\nvoid print_text(const string& text){\n int offset = 0;\n int text_i = 0;\n while(offset < text.size()){\n for(text_i = offset; text_i < text.size(); text_i++){\n if(text_i - offset >= 72) break;\n printf(\"%c\",text[text_i]);\n }\n printf(\"\\n\");\n offset += 72;\n }\n}\n\nvoid print_co_occurrence(const string& text,const string& query){\n\n int head = 0;\n int tail = 0;\n\n int include_keys = 0;\n int freq[256] = {};\n\n bool is_key[256];\n memset(is_key,false,sizeof(is_key));\n\n for(int query_i = 0; query_i < query.size(); query_i++){\n is_key[query[query_i]] = true;\n }\n\n int min_tail = INF;\n int min_len = INF;\n int ans_freq = 0;\n string ans = \"\";\n\n while(tail < text.size()){\n for(;head < text.size();head++){\n if(is_key[text[head]] && !freq[text[head]]++){\n include_keys++;\n if(include_keys == query.size()){\n head++;\n break;\n }\n }\n }\n\n for(;tail <= head;tail++){\n if(is_key[text[tail]] && !--freq[text[tail]]){\n\n if(include_keys == query.size()) {\n if((head -1) - tail + 1 < min_len){\n min_len = (head -1) - tail + 1;\n ans = text.substr(tail,(head -1) - tail + 1);\n ans_freq = 1;\n }\n else if((head -1) - tail + 1 == min_len){\n ans_freq++;\n }\n }\n include_keys--;\n tail++;\n break;\n }\n }\n }\n\n if(ans_freq == 0){\n printf(\"%d\\n\",ans_freq);\n printf(\"\\n\");\n }\n else{\n printf(\"%d\\n\",ans_freq);\n printf(\"\\n\");\n print_text(ans);\n printf(\"\\n\");\n }\n}\n\nint main(){\n string str;\n int phase = 0;\n string text = \"\";\n string query = \"\";\n while(getline(cin,str)){\n if(str.size() == 0){\n phase++;\n continue;\n }\n if(phase % 2 == 0){\n text += str;\n }\n else{\n query = str;\n\n print_co_occurrence(text,query);\n \n query = \"\";\n text = \"\";\n }\n }\n}","accuracy":1,"time_ms":20,"memory_kb":1844,"score_of_the_acc":-0.0308,"final_rank":2},{"submission_id":"aoj_1215_1081268","code_snippet":"#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n\n#include <iostream>\n#include <cstdio>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cctype>\n#include <utility>\n#include <assert.h>\n \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <int,int> P;\ntypedef pair <int,P> PP;\n \nstatic const double EPS = 1e-8;\n\nvoid print_text(const string& text){\n int offset = 0;\n int text_i = 0;\n while(offset < text.size()){\n for(text_i = offset; text_i < text.size(); text_i++){\n if(text_i - offset >= 72) break;\n printf(\"%c\",text[text_i]);\n }\n printf(\"\\n\");\n offset += 72;\n }\n}\n\nvoid print_co_occurrence(const string& text,const string& query){\n\n int head = 0;\n int tail = 0;\n\n int include_keys = 0;\n int freq[1024] = {};\n\n bool is_key[1024];\n memset(is_key,false,sizeof(is_key));\n\n for(int query_i = 0; query_i < query.size(); query_i++){\n is_key[query[query_i]] = true;\n }\n\n int min_tail = INF;\n int min_len = INF;\n int ans_freq = 0;\n string ans = \"\";\n\n while(tail < text.size()){\n for(;head < text.size();head++){\n if(is_key[text[head]] && !freq[text[head]]++){\n include_keys++;\n if(include_keys == query.size()){\n head++;\n break;\n }\n }\n }\n\n for(;tail <= head;tail++){\n if(is_key[text[tail]] && !--freq[text[tail]]){\n\n if(include_keys == query.size()) {\n if((head -1) - tail + 1 < min_len){\n min_len = (head -1) - tail + 1;\n ans = text.substr(tail,(head -1) - tail + 1);\n ans_freq = 1;\n }\n else if((head -1) - tail + 1 == min_len){\n ans_freq++;\n }\n }\n include_keys--;\n tail++;\n break;\n }\n }\n }\n\n if(ans_freq == 0){\n printf(\"%d\\n\",ans_freq);\n printf(\"\\n\");\n }\n else{\n printf(\"%d\\n\",ans_freq);\n printf(\"\\n\");\n print_text(ans);\n printf(\"\\n\");\n }\n}\n\nint main(){\n string str;\n int phase = 0;\n string text = \"\";\n string query = \"\";\n while(getline(cin,str)){\n if(str.size() == 0){\n phase++;\n continue;\n }\n if(phase % 2 == 0){\n text += str;\n }\n else{\n query = str;\n\n print_co_occurrence(text,query);\n \n query = \"\";\n text = \"\";\n }\n }\n}","accuracy":1,"time_ms":20,"memory_kb":1848,"score_of_the_acc":-0.0315,"final_rank":3},{"submission_id":"aoj_1215_902066","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <string>\n#include <sstream>\n#include <cstring>\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <numeric>\n#include <cctype>\n#include <tuple>\n\n#ifdef _MSC_VER\n#include <agents.h>\n#endif\n\n#define FOR(i, a, b) for(int i = (a); i < (int)(b); ++i)\n#define rep(i, n) FOR(i, 0, n)\n#define ALL(v) v.begin(), v.end()\n#define REV(v) v.rbegin(), v.rend()\n#define MEMSET(v, s) memset(v, s, sizeof(v))\n#define X first\n#define Y second\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int, int> P;\n\nint valid[256];\nint cnt[256];\nint kind;\n\nvoid add(char c){\n\tif (!valid[c]) return;\n\tif (cnt[c]++) return;\n\t++kind;\n}\n\nvoid sub(char c){\n\tif (!valid[c]) return;\n\tif (--cnt[c]) return;\n\t--kind;\n}\n\nint main(){\n\tstring str, key;\n\twhile (1){\n\t\tstr.clear();\n\t\tkey.clear();\n\n\t\twhile (true){\n\t\t\tgetline(cin, key);\n\t\t\tif (key.empty() || !cin) break;\n\t\t\tstr += key;\n\t\t}\n\t\tif (str.empty() || !cin) break;\n\n\t\tgetline(cin, key);\n\t\tcin.ignore();\n\n\t\t//cout << str << endl;\n\t\t//cout << key << endl;\n\t\tMEMSET(cnt, 0);\n\t\tMEMSET(valid, 0);\n\t\tkind = 0;\n\t\tfor (auto &c : key) valid[c] = 1;\n\t\tint n = str.size(), m = key.size();\n\n\t\tint l = 0, r = 0;\n\t\tint ans = n + 1;\n\t\tint anscnt = 0;\n\t\tP p;\n\t\twhile (1){\n\t\t\twhile (kind < m && r < n){\n\t\t\t\tadd(str[r++]);\n\t\t\t}\n\t\t\tif (kind == m){\n\t\t\t\tif (r - l < ans){\n\t\t\t\t\tans = r - l;\n\t\t\t\t\tp = make_pair(l, r);\n\t\t\t\t\tanscnt = 1;\n\t\t\t\t}\n\t\t\t\telse if (r - l == ans){\n\t\t\t\t\t++anscnt;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (l >= r) break;\n\t\t\tsub(str[l++]);\n\t\t}\n\n\t\tcout << anscnt << endl;\n\t\tint chr = 0;\n\t\tif (anscnt){\n\t\t\tcout << endl;\n\t\t\tfor (int i = p.first; i < p.second; ++i){\n\t\t\t\tcout << str[i];\n\t\t\t\t++chr;\n\t\t\t\tif (chr % 72 == 0) cout << endl;\n\t\t\t}\n\t\t\tif (chr % 72) cout << endl;\n\t\t}\n\t\tcout << endl;\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1692,"score_of_the_acc":-0.0047,"final_rank":1},{"submission_id":"aoj_1215_794481","code_snippet":"#include<iostream>\n#include<cmath>\n#include<cstdio>\n \n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define inf (1<<29)\n \nusing namespace std;\n \nvoid compute(string text,string S)\n{\n int nt = text.size(),nS = S.size();\n int mlen = inf;\n string ans;\n bool found[nS];\n int CNT = 0;\n int fpos[nS];\n rep(i,nS)found[i] = false;\n \n rep(i,nt)\n {\n bool update = false;\n int cnt = 0,mn,mx;\n mn = inf,mx = -inf;\n rep(j,nS)\n\t{\n\t if(S[j] == text[i])\n\t {\n\t update = true;\n\t found[j] = true;\n\t fpos[j] = i;\n\t }\n\t if(found[j])\n\t {\n\t cnt++;\n\t mn = min(mn,fpos[j]);\n\t mx = max(mx,fpos[j]);\n\t }\n\t}\n if(cnt == nS)\n\t{\n\t int cost = mx - mn + 1;\n\t if(cost < mlen)\n\t {\n\t mlen = cost;\n\t ans = text.substr(mn,cost);\n\t CNT = 1;\n\t }\n\t else if(cost == mlen && update)CNT++;\t \n\t}\n }\n cout << CNT << endl << endl;\n if(!CNT)return;\n\n rep(i,ans.size())\n if((i+1)%72 == 0 && i != 0)\n printf(\"%c\\n\",ans[i]);\n else\n printf(\"%c\",ans[i]);\n if(ans.size()%72 != 0)puts(\"\\n\");\n else puts(\"\");\n}\n \nint main()\n{\n string blank;\n while(getline(cin,blank))\n {\n string text,S;\n text += blank;\n while(getline(cin,blank))\n\t{\n\t if(blank.empty())break;\n\t text += blank;\n\t}\n if(text.empty())goto Fin;\n while(getline(cin,blank))\n\tif(blank.empty())break;\n\telse S += blank;\n compute(text,S);\n }\n Fin:;\n return 0;\n}","accuracy":1,"time_ms":100,"memory_kb":2384,"score_of_the_acc":-0.161,"final_rank":10},{"submission_id":"aoj_1215_794479","code_snippet":"/*\n000000000011111111112222222222333333333344444444\n012345678901234567890123456789012345678901234567\nTfefirstemampleistrivivlTfefirstemampleistrifivl\n . . .\nlen = 18 sp = 3\nlen = 15 sp = 11\nlen = 12 sp = 22\nlen = 12 sp = 35\nmfv\n \n000000000011111111112222222222\n012345678901234567890123456789\naabbccbbccaabbaacceeddffccaabb\n . ..\n \nlen = 4 sp = 1\n \nabc\n \n*/\n \n#include<set>\n#include<iostream>\n#include<cmath>\n#include<cstdio>\n \n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define inf (1<<29)\n \nusing namespace std;\n \nvoid compute(string text,string S)\n{\n int nt = text.size(),nS = S.size();\n int mlen = inf;\n string ans;\n set<string> all;\n bool found[nS];\n int CNT = 0;\n int fpos[nS];\n rep(i,nS)found[i] = false;\n \n rep(i,nt)\n {\n bool update = false;\n int cnt = 0,mn,mx;\n mn = inf,mx = -inf;\n rep(j,nS)\n\t{\n\t if(S[j] == text[i])\n\t {\n\t update = true;\n\t found[j] = true;\n\t fpos[j] = i;\n\t }\n\t if(found[j])\n\t {\n\t cnt++;\n\t mn = min(mn,fpos[j]);\n\t mx = max(mx,fpos[j]);\n\t }\n\t}\n if(cnt == nS)\n\t{\n\t int cost = mx - mn + 1;\n\t if(cost < mlen)\n\t {\n\t mlen = cost;\n\t ans = text.substr(mn,cost);\n\t all.clear();\n\t CNT = 1;\n\t all.insert(text.substr(mn,cost));\n\t }\n\t else if(cost == mlen)\n\t {\n\t if(update)CNT++;\n\t all.insert(text.substr(mn,cost));\n\t }\n\t}\n }\n cout << CNT << endl << endl;\n //printf(\"%d\\n\\n\",(int)all.size());\n \n if(all.empty())\n {\n return;\n }\n\n rep(i,ans.size())\n if((i+1)%72 == 0 && i != 0)\n printf(\"%c\\n\",ans[i]);\n else\n printf(\"%c\",ans[i]);\n if(ans.size()%72 != 0)puts(\"\\n\");\n else puts(\"\");\n}\n \nint main()\n{\n string blank;\n while(getline(cin,blank))\n {\n string text,S;\n text += blank;\n while(getline(cin,blank))\n\t{\n\t if(blank.empty())break;\n\t text += blank;\n\t}\n if(text.empty())goto Fin;\n while(getline(cin,blank))\n\tif(blank.empty())break;\n\telse S += blank;\n compute(text,S);\n }\n Fin:;\n return 0;\n}","accuracy":1,"time_ms":550,"memory_kb":2656,"score_of_the_acc":-0.4181,"final_rank":17},{"submission_id":"aoj_1215_793468","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <map>\n#include <set>\nusing namespace std;\n \n#define FOUND 1\n#define NOT_FOUND -1\n \nbool compare(string s1, string s2){\n if(s1.size() == s2.size()) return s1 < s2;\n return s1.size() < s2.size();\n} \n \nint main(){\n string in, sub;\n string seq;\n bool flag = true;\n while(getline(cin, in)){\n if(!flag && (in.size() == 0 || cin.eof())){\n if(cin.eof()) sub += in; \n flag = true;\n \n map<char, int > mp;\n set<char> data;\n \n for(int i = 0 ; i < sub.size() ; i++) data.insert(sub[i]);\n for(int i = 0 ; i < sub.size() ; i++) mp[ sub[i] ] = NOT_FOUND;\n \n int ans = 0;\n int len = (1<<29);\n string ans2;\n \n for(int i = 0 ; i < seq.size() ; i++){\n if(data.find(seq[i]) == data.end()) continue;\n mp[ seq[i] ] = i;\n \n int left = (1<<29);\n bool ok = true;\n for(int j = 0 ; j < sub.size() ; j++){\n if(mp[ sub[j] ] == NOT_FOUND){\n ok = false;\n break;\n }\n left = min(left, mp[ sub[j] ]);\n }\n \n if(!ok) continue;\n \n if(i - left == len) ans++;\n if(i - left < len){\n len = i - left;\n ans = 1;\n //cout << \"i = \" << i << \" left = \" << left << endl;\n //cout << i << endl;\n ans2 = seq.substr(left, i-left+1);\n //cout << seq.substr(left, i-left+1) << endl;\n }\n \n }\n \n cout << ans << endl << endl;\n if(ans != 0){\n for(int i = 0 ; i < ans2.size() ; i += 72){\n cout << ans2.substr(i, 72) << endl;\n }\n if(!cin.eof()) cout << endl;\n }\n \n //cout << \"ans_len = \" << len << endl;\n //cout << \"ans_cnt = \" << ans << endl;\n //cout << \"seq = \" << seq << endl;\n //cout << \"sub = \" << sub << endl;\n //cout << endl;\n seq = \"\", sub = \"\";\n continue;\n }\n else if(flag && in.size() != 0){\n seq += in;\n continue;\n }\n else if(flag && in.size() == 0){\n flag = false;\n continue;\n }\n else if(!flag && in.size() != 0){\n sub += in;\n continue;\n }\n \n \n \n }\n \n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":1832,"score_of_the_acc":-0.0474,"final_rank":5},{"submission_id":"aoj_1215_793466","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <map>\n#include <set>\nusing namespace std;\n\n#define FOUND 1\n#define NOT_FOUND -1\n\nbool compare(string s1, string s2){\n if(s1.size() == s2.size()) return s1 < s2;\n return s1.size() < s2.size();\n} \n\nint main(){\n string in, sub;\n string seq;\n bool flag = true;\n while(getline(cin, in)){\n if(!flag && (in.size() == 0 || cin.eof())){\n if(cin.eof()) sub += in; \n flag = true;\n \n map<char, int > mp;\n set<char> data;\n\n for(int i = 0 ; i < sub.size() ; i++) data.insert(sub[i]);\n for(int i = 0 ; i < sub.size() ; i++) mp[ sub[i] ] = NOT_FOUND;\n \n int ans = 0;\n int len = (1<<29);\n string ans2;\n \n for(int i = 0 ; i < seq.size() ; i++){\n\tif(data.find(seq[i]) == data.end()) continue;\n\tmp[ seq[i] ] = i;\n\t\n\tint left = (1<<29);\n\tbool ok = true;\n\tfor(int j = 0 ; j < sub.size() ; j++){\n\t if(mp[ sub[j] ] == NOT_FOUND){\n\t ok = false;\n\t break;\n\t }\n\t left = min(left, mp[ sub[j] ]);\n\t}\n\t\n\tif(!ok) continue;\n\t\n\tif(i - left == len) ans++;\n\tif(i - left < len){\n\t len = i - left;\n\t ans = 1;\n\t //cout << \"i = \" << i << \" left = \" << left << endl;\n\t //cout << i << endl;\n\t ans2 = seq.substr(left, i-left+1);\n\t //cout << seq.substr(left, i-left+1) << endl;\n\t}\n\t\n }\n \n cout << ans << endl << endl;\n if(ans != 0){\n\tfor(int i = 0 ; i < ans2.size() ; i += 72){\n\t cout << ans2.substr(i, 72) << endl;\n\t}\n\tif(!cin.eof()) cout << endl;\n }\n\n //cout << \"ans_len = \" << len << endl;\n //cout << \"ans_cnt = \" << ans << endl;\n //cout << \"seq = \" << seq << endl;\n //cout << \"sub = \" << sub << endl;\n //cout << endl;\n seq = \"\", sub = \"\";\n continue;\n }\n else if(flag && in.size() != 0){\n seq += in;\n continue;\n }\n else if(flag && in.size() == 0){\n flag = false;\n continue;\n }\n else if(!flag && in.size() != 0){\n sub += in;\n continue;\n }\n \n \n\n }\n \n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":1832,"score_of_the_acc":-0.0521,"final_rank":6},{"submission_id":"aoj_1215_793406","code_snippet":"#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<string>\n\n#define INF (1<<29)\n#define all(c) (c).begin(),(c).end()\n\nusing namespace std;\n\n\nint main(void){\n\n string s,t,in;\n bool f=false;\n while(true){\n s.clear();\n t.clear();\n while(true){\n getline(cin,in);\n if(in.size()==0)break;\n s+=in;\n }\n\n while(true){\n getline(cin,in);\n if(in.size()==0)break;\n t+=in;\n }\n\n if(s.size()==0 && t.size()==0)break;\n\n //if(f)cout << endl;\n f=true;\n\n int sl=s.size(),tl=t.size();\n int now[tl],ans=0;\n string res=\"\";\n\n fill(now,now+tl,INF);\n\n int tmp=0;\n for(int i=0;i<sl;i++){\n for(int j=0;j<tl;j++){\n if(s[i]==t[j]){\n now[j]=min(now[j],i);\n }\n }\n }\n\n bool flag=false;\n for(int i=0;i<tl;i++){\n flag|=(now[i]>=INF);\n }\n if(flag){\n cout << 0 << endl << endl;;\n continue;\n }\n\n int left=INF,right=-1,lid,rid;\n for(int i=0;i<tl;i++){\n if(left>now[i])left=now[i],lid=i;\n if(right<now[i])right=now[i],rid=i;\n }\n ans++;\n res=s.substr(left,right-left+1);\n\n while(true){\n int mn=INF,id=0;\n for(int i=0;i<tl;i++){\n if(mn>now[i])mn=now[i],id=i;\n }\n while(now[id]<sl && s[++now[id]]!=t[id]);\n if(s[now[id]]!=t[id])break;\n int l=INF,r=0;\n bool fg=true;\n for(int i=0;i<tl;i++){\n l=min(l,now[i]);\n r=max(r,now[i]);\n fg&=(now[i]>=sl-1);\n }\n if(fg)break;\n if(res.size()>r-l+1){\n ans=0;\n res=s.substr(l,r-l+1);\n }\n if(res.size()==r-l+1)ans++;\n }\n cout << ans << endl << endl;\n for(int i=0;i<res.size();i++){\n cout << res[i];\n if((i+1)%72==0)cout << endl;\n }\n if(res.size()%72>0)cout << endl;\n cout << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":100,"memory_kb":1828,"score_of_the_acc":-0.0654,"final_rank":8},{"submission_id":"aoj_1215_793371","code_snippet":"#include<iostream>\n#include<map>\n#include<cstring>\n\nusing namespace std;\n\nconst int MAX = 51;\n\nstring text, key;\nmap<char,int> M;\nint numKey[MAX];\n\ntypedef long long ll;\n\nbool input(){\n text = \"\";\n\n string s = \"\";\n if(!getline(cin,s)) return false;\n if(s == \"\") return false;\n text = s;\n while(getline(cin,s)&&s!=\"\") text += s;\n getline(cin,s);\n key = s;\n getline(cin,s); // for blank line\n return true;\n}\n\n\n\nvoid solve(){\n\n memset(numKey,0,sizeof(numKey));\n\n M.clear();\n for(int i = 0; i < (int)key.length(); i++)\n M[key[i]] = i;\n\n ll need = (1LL<<key.length())-1;\n\n string first = \"\";\n int num = 0;\n\n int s = 0, t = 0;\n\n while(s <= t && t <= (int)text.length()){\n if(need == 0){\n // if(text.size() > 400 && t-s < 50) cout << text.substr(s,t-s) << endl;\n if(first != \"\" && (int)first.length() == t-s){\n\tnum++;\n }\n if(first == \"\" || (int)first.length() > t-s){\n\tfirst = text.substr(s,t-s);\n\tnum = 1;\n }\n\n if(M.count(text[s]) != 0){\n\tnumKey[M[text[s]]]--;\n\tif(numKey[M[text[s]]] == 0) need |= (1LL<<M[text[s]]);\n }\n s++;\n }else{\n if(M.count(text[t]) != 0){\n\tif(need&(1LL<<M[text[t]])) need -= (1LL<<M[text[t]]);\n\tnumKey[M[text[t]]]++;\n }\n t++;\n }\n }\n // cout << \"min \" << minT << endl;\n if(num == 0) cout << num << endl;\n else{\n cout << num << endl << endl;\n\n for(int i = 0; i < (int)first.length(); i++){\n cout << first[i];\n if((i+1)%72 == 0) cout<<endl;\n }\n if((int)first.size()%72)cout << endl;\n }\n cout << endl;\n}\t \n\nint main(){\n\n // bool isFirst = true;\n while(input()){\n // if(isFirst) isFirst = false;\n // else cout << endl;\n solve();\n }\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":1832,"score_of_the_acc":-0.0521,"final_rank":6},{"submission_id":"aoj_1215_772986","code_snippet":"#include <iostream>\n#include <string>\n#include <algorithm>\nusing namespace std;\n\nstring S,K;\nconst int INF=1<<28;\n\nvoid solve(){\n\tstring ans;\n\tint len=INF, cnt=0;\n\tint left=INF;\n\tint idx[K.length()];\n//\tfill(begin(idx), end(idx), 0);\n\tfor(int i=0; i<K.length(); ++i)idx[i]=-1;\n\n\tfor(int p=0; p<S.length(); ++p){\n\t\tfor(int k=0; k<K.length(); ++k){\n\t\t\tif(S[p]==K[k]){\n\t\t\t\tidx[k]=p;\n\t\t\t\tleft=INF;\n\t\t\t\tfor(int i=0; i<K.length(); ++i)\tleft=min(left, idx[i]);\n\t\t\t\tif(left>=0){\n//\t\t\t\t\tcout << left << \" \" << p << endl;\n\t\t\t\t\tstring cand=S.substr(left, p-left+1);\n\t\t\t\t\tif(len>cand.length()){\n\t\t\t\t\t\tcnt=1;\n\t\t\t\t\t\tlen=cand.length();\n\t\t\t\t\t\tans=cand;\n\t\t\t\t\t}else if(len==cand.length()){\n\t\t\t\t\t\t++cnt;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tif(len>=INF){\n\t\tcout << 0 << endl;\n\t}else{\n\t\tcout << cnt << endl;\n\t\tcout << endl;\n\n\t\tfor(int i=0; i<ans.size(); ++i){\n\t\t\tif(i>0 && i%72==0)\tcout<<endl;\n\t\t\tcout << ans[i];\n\t\t}\n\t\tcout<<endl;\n\t}\n\tcout<<endl;\n}\n\nint main(){\n\tfor(int cnt=0;;++cnt){\n\t\tstring tmp;\n\t\tif(getline(cin,tmp).eof())\tbreak;\n\t\tif(tmp==\"\")\tbreak;\n\t\tS=tmp;\n\t\twhile(true){\n\t\t\tgetline(cin,tmp);\n\t\t\tif(tmp==\"\")\tbreak;\n\t\t\tS+=tmp;\n\t\t}\n\t\tgetline(cin,K);\n\t\tgetline(cin,tmp);\n//\t\tcout<<S<<endl;\n//\t\tcout<<K<<endl;\n//\t\tif(cnt>0)\tcout<<endl;\n\t\tsolve();\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":60,"memory_kb":1828,"score_of_the_acc":-0.0467,"final_rank":4},{"submission_id":"aoj_1215_605320","code_snippet":"#include <iostream>\n#include <sstream>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <set>\n#include <map>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <cassert>\n\nusing namespace std;\n\n#define FOR(i,k,n) for(int i=(k); i<(int)(n); ++i)\n#define REP(i,n) FOR(i,0,n)\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n\ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cerr<<*i<<\" \"; cerr<<endl; }\ninline bool valid(int x, int y, int W, int H){ return (x >= 0 && y >= 0 && x < W && y < H); }\n\ntypedef long long ll;\nconst int INF = 100000000;\nconst double EPS = 1e-8;\nconst int MOD = 1000000007;\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\n\nint main(){\n bool begin = true;\n while(true){\n string s, text, query;\n while(getline(cin, s) && s != \"\"){\n text += s;\n }\n if(text == \"\") break;\n getline(cin, query);\n assert(query != \"\");\n getline(cin, s); // empty\n assert(s == \"\");\n\n /*\n if(begin) begin = false;\n else cout << endl;\n */\n\n int N = text.size();\n int L = query.size();\n\n map<char, int> to_idx;\n REP(i, L) to_idx[query[i]] = i;\n\n vector<int> idx_vec[100];\n REP(i, N) if(to_idx.count(text[i])) idx_vec[to_idx[text[i]]].push_back(i);\n\n bool ok = true;\n REP(i, L) if(idx_vec[i].empty()) ok = false;\n if(!ok){\n cout << 0 << endl;\n cout << endl;\n continue;\n }\n\n map<int, set<int> > cnt;\n int shortest_length = INF;\n vector<int> cur(L);\n while(true){\n int b = idx_vec[0][cur[0]], e = idx_vec[0][cur[0]];\n REP(i, L) {\n b = min(b, idx_vec[i][cur[i]]);\n e = max(e, idx_vec[i][cur[i]]);\n }\n int l = e - b + 1;\n shortest_length = min(shortest_length, l);\n if(shortest_length == l) cnt[l].insert(b);\n\n int idx = -1;\n REP(i, L)if(cur[i] + 1 < idx_vec[i].size()){\n if(idx == -1 || idx_vec[i][cur[i] + 1] < idx_vec[idx][cur[idx] + 1]){\n idx = i;\n }\n }\n if(idx == -1) break;\n cur[idx] += 1;\n }\n cout << cnt[shortest_length].size() << endl;\n cout << endl;\n string ans = text.substr(*cnt[shortest_length].begin(), shortest_length);\n for(int i = 0; i < ans.size(); i += 72){\n if(i + 72 < ans.size()) cout << ans.substr(i, 72) << endl;\n else cout << ans.substr(i) << endl;\n }\n cout << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3712,"score_of_the_acc":-0.366,"final_rank":15},{"submission_id":"aoj_1215_525767","code_snippet":"//47\n#include<iostream>\n#include<sstream>\n#include<string>\n#include<map>\n#include<algorithm>\n#include<set>\n\nusing namespace std;\n\nint main(){\n for(string si;getline(cin,si),si!=\"\";){\n string s;\n do{\n s+=si;\n getline(cin,si);\n }while(si!=\"\");\n string k;\n getline(cin,k);\n cin.ignore();\n map<char,int> m;\n int f=0,l=1<<30;\n int n=0;\n set<long long> st;\n for(int i=0;i<s.size();i++){\n if(k.find(s[i])!=string::npos){\n\tm[s[i]]=i;\n }\n if(m.size()!=k.size())continue;\n int cl=0,cf=1<<30;\n for(int j=0;j<k.size();j++){\n\tcl=max(cl,m[k[j]]);\n\tcf=min(cf,m[k[j]]);\n }\n if(!st.insert((long long)cl<<32|cf).second)continue;\n if(cl-cf<=l-f){\n\tif(cl-cf<l-f){\n\t f=cf;\n\t l=cl;\n\t n=0;\n\t}\n\tn++;\n }\n }\n cout<<n<<endl<<endl;\n if(n){\n string t=s.substr(f,l-f+1);\n for(int i=0;i<t.size();i+=72){\n\tcout<<t.substr(i,72)<<endl;\n }\n cout<<endl;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":280,"memory_kb":3424,"score_of_the_acc":-0.424,"final_rank":18}],"string":"[\n {\n \"submission_id\": \"aoj_1215_2683439\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <set>\\n#include <map>\\n#include <time.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\nstring buf,line,pattern;\\nvector<int> LOC[128];\\n\\n\\nbool check(int start,int end){\\n\\n\\tbool FLG;\\n\\n\\tint left,right,m,tmp_start,tmp_end;\\n\\n\\tfor(int i = 0; i < pattern.length(); i++){\\n\\t\\tint ch = pattern[i];\\n\\n\\t\\tleft = 0,right = LOC[ch].size()-1,m = (left+right)/2;\\n\\t\\ttmp_start = BIG_NUM;\\n\\n\\t\\twhile(left <= right){\\n\\t\\t\\tif(LOC[ch][m] >= start){\\n\\t\\t\\t\\ttmp_start = m;\\n\\t\\t\\t\\tright = m-1;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tleft = m+1;\\n\\t\\t\\t}\\n\\t\\t\\tm = (left+right)/2;\\n\\t\\t}\\n\\t\\tif(tmp_start == BIG_NUM)return false;\\n\\n\\t\\tleft = tmp_start,right = LOC[ch].size()-1,m = (left+right)/2;\\n\\t\\ttmp_end = BIG_NUM;\\n\\n\\t\\twhile(left <= right){\\n\\t\\t\\tif(LOC[ch][m] <= end){\\n\\t\\t\\t\\ttmp_end = m;\\n\\t\\t\\t\\tleft = m+1;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tright = m-1;\\n\\t\\t\\t}\\n\\t\\t\\tm = (left+right)/2;\\n\\t\\t}\\n\\t\\tif(tmp_end == BIG_NUM)return false;\\n\\t}\\n\\treturn true;\\n}\\n\\nvoid func(){\\n\\n\\tfor(int i = 0; i < 128; i++)LOC[i].clear();\\n\\n\\tline += buf;\\n\\twhile(true){\\n\\t\\tgetline(cin,buf);\\n\\t\\tif(buf == \\\"\\\")break;\\n\\t\\tline += buf;\\n\\t}\\n\\tgetline(cin,pattern);\\n\\tgetline(cin,buf);\\n\\n\\tfor(int i = 0; i < line.length(); i++){\\n\\t\\tLOC[line[i]].push_back(i);\\n\\t}\\n\\n\\tfor(int i = 0; i < pattern.length(); i++){\\n\\t\\tif(LOC[pattern[i]].size() == 0){\\n\\t\\t\\tprintf(\\\"0\\\\n\\\\n\\\");\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t}\\n\\n\\tbool FLG;\\n\\tint left,right,m,minimum = BIG_NUM,ans_count = 1,tmp_end;\\n\\tint ans_start,ans_end;\\n\\n\\tfor(int start = 0; start < line.length(); start++){\\n\\n\\t\\tleft = start,right = line.length()-1,m = (left+right)/2;\\n\\t\\ttmp_end = BIG_NUM;\\n\\n\\t\\twhile(left <= right){\\n\\t\\t\\tif(check(start,m)){\\n\\t\\t\\t\\ttmp_end = m;\\n\\t\\t\\t\\tright = m-1;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tleft = m+1;\\n\\t\\t\\t}\\n\\t\\t\\tm = (left+right)/2;\\n\\t\\t}\\n\\t\\tif(tmp_end == BIG_NUM)continue;\\n\\n\\t\\tif(tmp_end-start+1 < minimum){\\n\\n\\t\\t\\tminimum = tmp_end-start+1;\\n\\t\\t\\tans_count = 1;\\n\\t\\t\\tans_start = start;\\n\\t\\t\\tans_end = tmp_end;\\n\\n\\t\\t}else if(tmp_end-start+1 == minimum){\\n\\t\\t\\tans_count++;\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%d\\\\n\\\\n\\\",ans_count);\\n\\tfor(int i = ans_start; i <= ans_end; i += 72){\\n\\t\\tfor(int k = i; k <= min(ans_end,i+71); k++){\\n\\t\\t\\tprintf(\\\"%c\\\",line[k]);\\n\\t\\t}\\n\\t\\tprintf(\\\"\\\\n\\\");\\n\\t}\\n\\tprintf(\\\"\\\\n\\\");\\n\\n\\tline.clear();\\n\\tpattern.clear();\\n}\\n\\n\\nint main(){\\n\\n\\twhile(true){\\n\\t\\tgetline(cin,buf);\\n\\t\\tif(buf == \\\"\\\")break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2150,\n \"memory_kb\": 6068,\n \"score_of_the_acc\": -1.7524,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1215_2198500\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define int long long\\n#define all(v) begin(v), end(v)\\n#define rep(i, n) for(int i = 0; i < (int)(n); i++)\\n#define reps(i, s, n) for(int i = (int)(s); i < (int)(n); i++)\\n#define min(...) min({__VA_ARGS__})\\n#define max(...) max({__VA_ARGS__})\\n\\ntemplate<class T1, class T2> void chmin(T1 &a, T2 b){if(a>b)a=b;}\\ntemplate<class T1, class T2> void chmax(T1 &a, T2 b){if(a<b)a=b;}\\n\\nusing pint = pair<int, int>;\\nusing tint = tuple<int, int, int>;\\nusing vint = vector<int>;\\n\\nconst int inf = 1LL << 55;\\nconst int mod = 1e9 + 7;\\n\\nsigned main()\\n{\\n cin.tie(0);\\n ios_base::sync_with_stdio(0);\\n cout << fixed << setprecision(12);\\n\\n string line;\\n while(getline(cin, line), line != \\\"\\\") {\\n string s = line, a;\\n while(getline(cin, line), line != \\\"\\\") s += line;\\n getline(cin, a);\\n\\n int n = s.size(), k = a.size();\\n vint pos[55];\\n rep(i, n) rep(j, k) {\\n if(s[i] == a[j]) pos[j].push_back(i);\\n }\\n bool imp = false;\\n rep(i, k) if(!pos[i].size()) imp = true;\\n if(imp) {\\n cout << 0 << endl << endl;\\n getline(cin, line);\\n continue;\\n }\\n\\n int idx[55] = {};\\n int ans = 0, head = 0, len = n;\\n rep(i, n) {\\n int tail = i;\\n rep(j, k) chmax(tail, pos[j][idx[j]]);\\n if(tail-i+1 < len) ans = 0, head = i, len = tail-i+1;\\n if(tail-i+1 == len) ans++;\\n int p = a.find(s[i]);\\n if(p != -1) {\\n\\tidx[p]++;\\n\\tif(idx[p] >= pos[p].size()) break;\\n }\\n }\\n\\n string t = s.substr(head, len);\\n cout << ans << endl;\\n rep(i, t.size()) {\\n if(i%72 == 0) cout << endl;\\n cout << t[i];\\n }\\n cout << endl << endl;\\n getline(cin, line);\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3476,\n \"score_of_the_acc\": -0.3254,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1215_2197064\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\nstring S,K;\\nconst int n = 1<<8;\\n\\nint getlen(){\\n int mx[n],res=1e9;\\n memset(mx,-1,sizeof(mx));\\n for(int i=0;i<S.size();i++){\\n int ch = S[i];\\n mx[ch] = max(mx[ch],i);\\n int c=0,l=1e9;\\n for(int j=0;j<K.size();j++)c+=mx[K[j]]>=0,l=min(l,mx[K[j]]);\\n if(c<K.size()) continue;\\n res=min(res,i-l);\\n }\\n return res;\\n}\\n\\nint count(int len){\\n int cnt[n]={},res=0;\\n for(int i=0;i<S.size();i++){\\n cnt[S[i]]++;\\n int c=0;\\n for(int j=0;j<K.size();j++)c+=cnt[K[j]]>0;\\n if(c==K.size())res++;\\n if(i-len>=0) cnt[S[i-len]]--;\\n }\\n return res;\\n}\\n\\nstring getstr(int len){\\n int cnt[n]={},res=0;\\n for(int i=0;i<S.size();i++){\\n cnt[S[i]]++;\\n int c=0;\\n for(int j=0;j<K.size();j++)c+=cnt[K[j]]>0;\\n if(c==K.size()) return S.substr(i-len,len+1);\\n if(i-len>=0) cnt[S[i-len]]--;\\n }\\n return \\\"\\\";\\n}\\n\\nint main(){\\n while(1){\\n S.clear();\\n while(1){\\n string s; \\n getline(cin,s);\\n if(s.empty()) break;\\n S+=s;\\n }\\n if(S.empty())break;\\n getline(cin,K);\\n \\n int len = getlen();\\n cout<<count(len)<<endl;\\n string str = getstr(len);\\n for(int i=0;i<str.size();i++){\\n if(i!=str.size()-1&&i%72==0)cout<<endl;\\n cout<<str[i];\\n }\\n cout<<endl;\\n if(len<1e9)cout<<endl;\\n getline(cin,K); \\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 3376,\n \"score_of_the_acc\": -0.3269,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1215_2196819\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\nint main(){\\n string buf;\\n while(getline(cin,buf),buf!=\\\"\\\"){\\n string s=buf;\\n while(getline(cin,buf),buf!=\\\"\\\") s+=buf;\\n string a;\\n getline(cin,a);\\n //cout<<s<<endl<<a<<endl;\\n \\n int n=a.size();\\n vector<int> pos[n];\\n for(int i=0;i<(int)s.size();i++)\\n for(int j=0;j<n;j++)\\n if(s[i]==a[j]) pos[j].push_back(i);\\n \\n bool f=1;\\n for(int i=0;i<n;i++) f&=!!(pos[i].size());\\n if(!f){\\n cout<<0<<endl<<endl;\\n getline(cin,buf);\\n continue;\\n }\\n \\n int idx[n];\\n memset(idx,0,sizeof(idx));\\n \\n int ans=0,len=s.size()+1,head=0;\\n for(int i=0;i<(int)s.size();i++){\\n int nxt=i;\\n for(int j=0;j<n;j++)\\n nxt=max(nxt,pos[j][idx[j]]);\\n \\n if(nxt-i+1<len) ans=0,len=nxt-i+1,head=i;\\n if(nxt-i+1==len) ans++;\\n \\n for(int j=0;j<n;j++){\\n if(s[i]==a[j]) idx[j]++;\\n if(idx[j]>=(int)pos[j].size()) goto LAB;\\n }\\n }\\n \\n LAB:\\n string str=s.substr(head,len);\\n \\n cout<<ans<<endl;\\n for(int i=0;i<(int)str.size();i++){\\n if(i%72==0) cout<<endl;\\n cout<<str[i];\\n }\\n cout<<endl<<endl;;\\n //ready for next;\\n getline(cin,buf);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3608,\n \"score_of_the_acc\": -0.3621,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1215_2196733\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define M 1000005\\n#define N 300\\nusing namespace std;\\nstring s,t,temp;\\nint scnt[N],tcnt[N],ans[M],B[M],E[M];\\n\\nint main(){\\n while(1){\\n getline(cin,temp);\\n if(temp==\\\"\\\")break;\\n s=\\\"\\\";\\n s+=temp;\\n while(1){\\n getline(cin,temp);\\n s+=temp;\\n if(temp==\\\"\\\")break;\\n }\\n getline(cin,temp);\\n t=temp;\\n getline(cin,temp);\\n int flag=0;\\n memset(tcnt,0,sizeof(tcnt));\\n for(int i=0;i<(int)t.size();i++)\\n tcnt[(int)t[i]]++;\\n int cnt=0,idx=0;\\n memset(scnt,0,sizeof(scnt));\\n memset(ans,0,sizeof(ans)); \\n for(int i=0;i<(int)s.size();i++){\\n if(scnt[(int)s[i]]<tcnt[(int)s[i]])cnt++;\\n scnt[(int)s[i]]++;\\n if(cnt==t.size()){\\n\\tflag=1;\\n\\tif(!ans[i-idx+1]){\\n\\t B[i-idx+1]=idx;\\n\\t E[i-idx+1]=i;\\n\\t ans[i-idx+1]++;\\n\\t}else ans[i-idx+1]++;\\n\\twhile(1){\\n\\t if(scnt[(int)s[idx]]==tcnt[(int)s[idx]]){\\n\\t scnt[(int)s[idx]]--;\\n\\t idx++;\\n\\t cnt--;\\n\\t break;\\n\\t }\\n\\t scnt[(int)s[idx]]--;\\n\\t idx++;\\n\\t if(cnt==t.size()){\\n\\t if(!ans[i-idx+1]){\\n\\t B[i-idx+1]=idx;\\n\\t E[i-idx+1]=i;\\n\\t ans[i-idx+1]++;\\n\\t }else ans[i-idx+1]++;\\n\\t }\\n\\t}\\n }\\n }\\n if(!flag)cout<<0<<endl<<endl;\\n for(int i=0;i<M;i++)\\n if(ans[i]){\\n\\tcout<<ans[i]<<endl<<endl;\\n\\tstring str=s.substr(B[i],E[i]-B[i]+1);\\n\\tfor(int j=0;j<str.size();j++){\\n\\t cout<<str[j];\\n\\t if(!((j+1)%72))cout<<endl;\\n\\t}\\n\\tif(str.size()%72)cout<<endl;\\n\\tcout<<endl;\\n\\tbreak;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 7508,\n \"score_of_the_acc\": -1,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1215_2196625\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\nint main(){\\n string buf;\\n while(getline(cin,buf),buf!=\\\"\\\"){\\n string s=buf;\\n while(getline(cin,buf),buf!=\\\"\\\") s+=buf;\\n string a;\\n getline(cin,a);\\n //cout<<s<<endl<<a<<endl;\\n \\n int n=a.size();\\n vector<int> pos[n];\\n for(int i=0;i<(int)s.size();i++)\\n for(int j=0;j<n;j++)\\n\\tif(s[i]==a[j]) pos[j].push_back(i);\\n\\n bool f=1;\\n for(int i=0;i<n;i++) f&=!!(pos[i].size());\\n if(!f){\\n cout<<0<<endl<<endl;\\n getline(cin,buf);\\n continue;\\n }\\n \\n int idx[n];\\n memset(idx,0,sizeof(idx));\\n \\n int ans=0,len=s.size()+1,head=0;\\n for(int i=0;i<(int)s.size();i++){\\n int nxt=i;\\n for(int j=0;j<n;j++)\\n\\tnxt=max(nxt,pos[j][idx[j]]);\\n\\n if(nxt-i+1<len) ans=0,len=nxt-i+1,head=i;\\n if(nxt-i+1==len) ans++;\\n\\n for(int j=0;j<n;j++){\\n\\tif(s[i]==a[j]) idx[j]++;\\n\\tif(idx[j]>=(int)pos[j].size()) goto LAB;\\n }\\n }\\n \\n LAB:\\n string str=s.substr(head,len);\\n \\n cout<<ans<<endl;\\n for(int i=0;i<(int)str.size();i++){\\n if(i%72==0) cout<<endl;\\n cout<<str[i];\\n }\\n cout<<endl<<endl;;\\n //ready for next;\\n getline(cin,buf);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 3448,\n \"score_of_the_acc\": -0.3393,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1215_1130392\",\n \"code_snippet\": \"/*\\n000000000011111111112222222222333333333344444444\\n012345678901234567890123456789012345678901234567\\nTfefirstemampleistrivivlTfefirstemampleistrifivl\\n . . .\\nlen = 18 sp = 3\\nlen = 15 sp = 11\\nlen = 12 sp = 22\\nlen = 12 sp = 35\\nmfv\\n \\n000000000011111111112222222222\\n012345678901234567890123456789\\naabbccbbccaabbaacceeddffccaabb\\n . ..\\n \\nlen = 4 sp = 1\\n \\nabc\\n \\n*/\\n \\n#include<set>\\n#include<iostream>\\n#include<cmath>\\n#include<cstdio>\\n \\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define inf (1<<29)\\n \\nusing namespace std;\\n \\nvoid compute(string text,string S)\\n{\\n int nt = text.size(),nS = S.size();\\n int mlen = inf;\\n string ans;\\n set<string> all;\\n bool found[nS];\\n int CNT = 0;\\n int fpos[nS];\\n rep(i,nS)found[i] = false;\\n \\n rep(i,nt)\\n {\\n bool update = false;\\n int cnt = 0,mn,mx;\\n mn = inf,mx = -inf;\\n rep(j,nS)\\n {\\n if(S[j] == text[i])\\n {\\n update = true;\\n found[j] = true;\\n fpos[j] = i;\\n }\\n if(found[j])\\n {\\n cnt++;\\n mn = min(mn,fpos[j]);\\n mx = max(mx,fpos[j]);\\n }\\n }\\n if(cnt == nS)\\n {\\n int cost = mx - mn + 1;\\n if(cost < mlen)\\n {\\n mlen = cost;\\n ans = text.substr(mn,cost);\\n all.clear();\\n CNT = 1;\\n all.insert(text.substr(mn,cost));\\n }\\n else if(cost == mlen)\\n {\\n if(update)CNT++;\\n all.insert(text.substr(mn,cost));\\n }\\n }\\n }\\n cout << CNT << endl << endl;\\n //printf(\\\"%d\\\\n\\\\n\\\",(int)all.size());\\n \\n if(all.empty())\\n {\\n return;\\n }\\n \\n rep(i,ans.size())\\n if((i+1)%72 == 0 && i != 0)\\n printf(\\\"%c\\\\n\\\",ans[i]);\\n else\\n printf(\\\"%c\\\",ans[i]);\\n if(ans.size()%72 != 0)puts(\\\"\\\\n\\\");\\n else puts(\\\"\\\");\\n}\\n \\nint main()\\n{\\n string blank;\\n while(getline(cin,blank))\\n {\\n string text,S;\\n text += blank;\\n while(getline(cin,blank))\\n {\\n if(blank.empty())break;\\n text += blank;\\n }\\n if(text.empty())goto Fin;\\n while(getline(cin,blank))\\n if(blank.empty())break;\\n else S += blank;\\n compute(text,S);\\n }\\n Fin:;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 550,\n \"memory_kb\": 2652,\n \"score_of_the_acc\": -0.4174,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1215_1100289\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint main() {\\n while(1) {\\n string s=\\\"\\\",t,r;\\n getline(cin,s);\\n if(s==\\\"\\\") break;\\n while(1) {\\n getline(cin,r);\\n if(r==\\\"\\\") break;\\n s+=r;\\n }\\n getline(cin,t);\\n getline(cin,r);\\n \\n map<char,int> m,d;\\n m.clear();\\n d.clear();\\n for(int i=0; i<t.size(); i++) d[t[i]]=1;\\n vector<int> v;\\n for(int i=0; i<s.size(); i++) {\\n if(d[s[i]]==1) v.push_back(i);\\n }\\n int x=0,cnt=0;\\n string ans=s;\\n for(int i=0; i<v.size(); i++) {\\n char c=s[v[i]];\\n m[c]++;\\n if(m.size()==t.size()) {\\n\\twhile(m[s[v[x]]]>1) {\\n\\t m[s[v[x]]]--;\\n\\t x++;\\n\\t}\\n\\tif(ans.size()==v[i]-v[x]+1) {\\n\\t cnt++;\\n\\t} else if(ans.size()>v[i]-v[x]+1) {\\n\\t cnt=1;\\n\\t ans=s.substr(v[x],v[i]-v[x]+1);\\n\\t}\\n }\\n }\\n \\n if(cnt==0) cout << cnt << endl;\\n else {\\n cout << cnt << endl << endl;\\n for(int i=0; i<ans.size(); i++) {\\n\\tcout << ans[i];\\n\\tif((i+1)%72==0) cout << endl;\\n }\\n if(ans.size()%72) cout << endl;\\n }\\n cout << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 2116,\n \"score_of_the_acc\": -0.0776,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1215_1081269\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#define INF 0x3f3f3f3f\\n\\n#include <iostream>\\n#include <cstdio>\\n#include <sstream>\\n#include <cmath>\\n#include <cstdlib>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <limits>\\n#include <map>\\n#include <string>\\n#include <cstring>\\n#include <set>\\n#include <deque>\\n#include <bitset>\\n#include <list>\\n#include <cctype>\\n#include <utility>\\n#include <assert.h>\\n \\nusing namespace std;\\n \\ntypedef long long ll;\\ntypedef pair <int,int> P;\\ntypedef pair <int,P> PP;\\n \\nstatic const double EPS = 1e-8;\\n\\nvoid print_text(const string& text){\\n int offset = 0;\\n int text_i = 0;\\n while(offset < text.size()){\\n for(text_i = offset; text_i < text.size(); text_i++){\\n if(text_i - offset >= 72) break;\\n printf(\\\"%c\\\",text[text_i]);\\n }\\n printf(\\\"\\\\n\\\");\\n offset += 72;\\n }\\n}\\n\\nvoid print_co_occurrence(const string& text,const string& query){\\n\\n int head = 0;\\n int tail = 0;\\n\\n int include_keys = 0;\\n int freq[256] = {};\\n\\n bool is_key[256];\\n memset(is_key,false,sizeof(is_key));\\n\\n for(int query_i = 0; query_i < query.size(); query_i++){\\n is_key[query[query_i]] = true;\\n }\\n\\n int min_tail = INF;\\n int min_len = INF;\\n int ans_freq = 0;\\n string ans = \\\"\\\";\\n\\n while(tail < text.size()){\\n for(;head < text.size();head++){\\n if(is_key[text[head]] && !freq[text[head]]++){\\n include_keys++;\\n if(include_keys == query.size()){\\n head++;\\n break;\\n }\\n }\\n }\\n\\n for(;tail <= head;tail++){\\n if(is_key[text[tail]] && !--freq[text[tail]]){\\n\\n if(include_keys == query.size()) {\\n if((head -1) - tail + 1 < min_len){\\n min_len = (head -1) - tail + 1;\\n ans = text.substr(tail,(head -1) - tail + 1);\\n ans_freq = 1;\\n }\\n else if((head -1) - tail + 1 == min_len){\\n ans_freq++;\\n }\\n }\\n include_keys--;\\n tail++;\\n break;\\n }\\n }\\n }\\n\\n if(ans_freq == 0){\\n printf(\\\"%d\\\\n\\\",ans_freq);\\n printf(\\\"\\\\n\\\");\\n }\\n else{\\n printf(\\\"%d\\\\n\\\",ans_freq);\\n printf(\\\"\\\\n\\\");\\n print_text(ans);\\n printf(\\\"\\\\n\\\");\\n }\\n}\\n\\nint main(){\\n string str;\\n int phase = 0;\\n string text = \\\"\\\";\\n string query = \\\"\\\";\\n while(getline(cin,str)){\\n if(str.size() == 0){\\n phase++;\\n continue;\\n }\\n if(phase % 2 == 0){\\n text += str;\\n }\\n else{\\n query = str;\\n\\n print_co_occurrence(text,query);\\n \\n query = \\\"\\\";\\n text = \\\"\\\";\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1844,\n \"score_of_the_acc\": -0.0308,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1215_1081268\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#define INF 0x3f3f3f3f\\n\\n#include <iostream>\\n#include <cstdio>\\n#include <sstream>\\n#include <cmath>\\n#include <cstdlib>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <limits>\\n#include <map>\\n#include <string>\\n#include <cstring>\\n#include <set>\\n#include <deque>\\n#include <bitset>\\n#include <list>\\n#include <cctype>\\n#include <utility>\\n#include <assert.h>\\n \\nusing namespace std;\\n \\ntypedef long long ll;\\ntypedef pair <int,int> P;\\ntypedef pair <int,P> PP;\\n \\nstatic const double EPS = 1e-8;\\n\\nvoid print_text(const string& text){\\n int offset = 0;\\n int text_i = 0;\\n while(offset < text.size()){\\n for(text_i = offset; text_i < text.size(); text_i++){\\n if(text_i - offset >= 72) break;\\n printf(\\\"%c\\\",text[text_i]);\\n }\\n printf(\\\"\\\\n\\\");\\n offset += 72;\\n }\\n}\\n\\nvoid print_co_occurrence(const string& text,const string& query){\\n\\n int head = 0;\\n int tail = 0;\\n\\n int include_keys = 0;\\n int freq[1024] = {};\\n\\n bool is_key[1024];\\n memset(is_key,false,sizeof(is_key));\\n\\n for(int query_i = 0; query_i < query.size(); query_i++){\\n is_key[query[query_i]] = true;\\n }\\n\\n int min_tail = INF;\\n int min_len = INF;\\n int ans_freq = 0;\\n string ans = \\\"\\\";\\n\\n while(tail < text.size()){\\n for(;head < text.size();head++){\\n if(is_key[text[head]] && !freq[text[head]]++){\\n include_keys++;\\n if(include_keys == query.size()){\\n head++;\\n break;\\n }\\n }\\n }\\n\\n for(;tail <= head;tail++){\\n if(is_key[text[tail]] && !--freq[text[tail]]){\\n\\n if(include_keys == query.size()) {\\n if((head -1) - tail + 1 < min_len){\\n min_len = (head -1) - tail + 1;\\n ans = text.substr(tail,(head -1) - tail + 1);\\n ans_freq = 1;\\n }\\n else if((head -1) - tail + 1 == min_len){\\n ans_freq++;\\n }\\n }\\n include_keys--;\\n tail++;\\n break;\\n }\\n }\\n }\\n\\n if(ans_freq == 0){\\n printf(\\\"%d\\\\n\\\",ans_freq);\\n printf(\\\"\\\\n\\\");\\n }\\n else{\\n printf(\\\"%d\\\\n\\\",ans_freq);\\n printf(\\\"\\\\n\\\");\\n print_text(ans);\\n printf(\\\"\\\\n\\\");\\n }\\n}\\n\\nint main(){\\n string str;\\n int phase = 0;\\n string text = \\\"\\\";\\n string query = \\\"\\\";\\n while(getline(cin,str)){\\n if(str.size() == 0){\\n phase++;\\n continue;\\n }\\n if(phase % 2 == 0){\\n text += str;\\n }\\n else{\\n query = str;\\n\\n print_co_occurrence(text,query);\\n \\n query = \\\"\\\";\\n text = \\\"\\\";\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1848,\n \"score_of_the_acc\": -0.0315,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1215_902066\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <string>\\n#include <sstream>\\n#include <cstring>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cmath>\\n#include <queue>\\n#include <stack>\\n#include <map>\\n#include <set>\\n#include <numeric>\\n#include <cctype>\\n#include <tuple>\\n\\n#ifdef _MSC_VER\\n#include <agents.h>\\n#endif\\n\\n#define FOR(i, a, b) for(int i = (a); i < (int)(b); ++i)\\n#define rep(i, n) FOR(i, 0, n)\\n#define ALL(v) v.begin(), v.end()\\n#define REV(v) v.rbegin(), v.rend()\\n#define MEMSET(v, s) memset(v, s, sizeof(v))\\n#define X first\\n#define Y second\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef pair<int, int> P;\\n\\nint valid[256];\\nint cnt[256];\\nint kind;\\n\\nvoid add(char c){\\n\\tif (!valid[c]) return;\\n\\tif (cnt[c]++) return;\\n\\t++kind;\\n}\\n\\nvoid sub(char c){\\n\\tif (!valid[c]) return;\\n\\tif (--cnt[c]) return;\\n\\t--kind;\\n}\\n\\nint main(){\\n\\tstring str, key;\\n\\twhile (1){\\n\\t\\tstr.clear();\\n\\t\\tkey.clear();\\n\\n\\t\\twhile (true){\\n\\t\\t\\tgetline(cin, key);\\n\\t\\t\\tif (key.empty() || !cin) break;\\n\\t\\t\\tstr += key;\\n\\t\\t}\\n\\t\\tif (str.empty() || !cin) break;\\n\\n\\t\\tgetline(cin, key);\\n\\t\\tcin.ignore();\\n\\n\\t\\t//cout << str << endl;\\n\\t\\t//cout << key << endl;\\n\\t\\tMEMSET(cnt, 0);\\n\\t\\tMEMSET(valid, 0);\\n\\t\\tkind = 0;\\n\\t\\tfor (auto &c : key) valid[c] = 1;\\n\\t\\tint n = str.size(), m = key.size();\\n\\n\\t\\tint l = 0, r = 0;\\n\\t\\tint ans = n + 1;\\n\\t\\tint anscnt = 0;\\n\\t\\tP p;\\n\\t\\twhile (1){\\n\\t\\t\\twhile (kind < m && r < n){\\n\\t\\t\\t\\tadd(str[r++]);\\n\\t\\t\\t}\\n\\t\\t\\tif (kind == m){\\n\\t\\t\\t\\tif (r - l < ans){\\n\\t\\t\\t\\t\\tans = r - l;\\n\\t\\t\\t\\t\\tp = make_pair(l, r);\\n\\t\\t\\t\\t\\tanscnt = 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (r - l == ans){\\n\\t\\t\\t\\t\\t++anscnt;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (l >= r) break;\\n\\t\\t\\tsub(str[l++]);\\n\\t\\t}\\n\\n\\t\\tcout << anscnt << endl;\\n\\t\\tint chr = 0;\\n\\t\\tif (anscnt){\\n\\t\\t\\tcout << endl;\\n\\t\\t\\tfor (int i = p.first; i < p.second; ++i){\\n\\t\\t\\t\\tcout << str[i];\\n\\t\\t\\t\\t++chr;\\n\\t\\t\\t\\tif (chr % 72 == 0) cout << endl;\\n\\t\\t\\t}\\n\\t\\t\\tif (chr % 72) cout << endl;\\n\\t\\t}\\n\\t\\tcout << endl;\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1692,\n \"score_of_the_acc\": -0.0047,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1215_794481\",\n \"code_snippet\": \"#include<iostream>\\n#include<cmath>\\n#include<cstdio>\\n \\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define inf (1<<29)\\n \\nusing namespace std;\\n \\nvoid compute(string text,string S)\\n{\\n int nt = text.size(),nS = S.size();\\n int mlen = inf;\\n string ans;\\n bool found[nS];\\n int CNT = 0;\\n int fpos[nS];\\n rep(i,nS)found[i] = false;\\n \\n rep(i,nt)\\n {\\n bool update = false;\\n int cnt = 0,mn,mx;\\n mn = inf,mx = -inf;\\n rep(j,nS)\\n\\t{\\n\\t if(S[j] == text[i])\\n\\t {\\n\\t update = true;\\n\\t found[j] = true;\\n\\t fpos[j] = i;\\n\\t }\\n\\t if(found[j])\\n\\t {\\n\\t cnt++;\\n\\t mn = min(mn,fpos[j]);\\n\\t mx = max(mx,fpos[j]);\\n\\t }\\n\\t}\\n if(cnt == nS)\\n\\t{\\n\\t int cost = mx - mn + 1;\\n\\t if(cost < mlen)\\n\\t {\\n\\t mlen = cost;\\n\\t ans = text.substr(mn,cost);\\n\\t CNT = 1;\\n\\t }\\n\\t else if(cost == mlen && update)CNT++;\\t \\n\\t}\\n }\\n cout << CNT << endl << endl;\\n if(!CNT)return;\\n\\n rep(i,ans.size())\\n if((i+1)%72 == 0 && i != 0)\\n printf(\\\"%c\\\\n\\\",ans[i]);\\n else\\n printf(\\\"%c\\\",ans[i]);\\n if(ans.size()%72 != 0)puts(\\\"\\\\n\\\");\\n else puts(\\\"\\\");\\n}\\n \\nint main()\\n{\\n string blank;\\n while(getline(cin,blank))\\n {\\n string text,S;\\n text += blank;\\n while(getline(cin,blank))\\n\\t{\\n\\t if(blank.empty())break;\\n\\t text += blank;\\n\\t}\\n if(text.empty())goto Fin;\\n while(getline(cin,blank))\\n\\tif(blank.empty())break;\\n\\telse S += blank;\\n compute(text,S);\\n }\\n Fin:;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 2384,\n \"score_of_the_acc\": -0.161,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1215_794479\",\n \"code_snippet\": \"/*\\n000000000011111111112222222222333333333344444444\\n012345678901234567890123456789012345678901234567\\nTfefirstemampleistrivivlTfefirstemampleistrifivl\\n . . .\\nlen = 18 sp = 3\\nlen = 15 sp = 11\\nlen = 12 sp = 22\\nlen = 12 sp = 35\\nmfv\\n \\n000000000011111111112222222222\\n012345678901234567890123456789\\naabbccbbccaabbaacceeddffccaabb\\n . ..\\n \\nlen = 4 sp = 1\\n \\nabc\\n \\n*/\\n \\n#include<set>\\n#include<iostream>\\n#include<cmath>\\n#include<cstdio>\\n \\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define inf (1<<29)\\n \\nusing namespace std;\\n \\nvoid compute(string text,string S)\\n{\\n int nt = text.size(),nS = S.size();\\n int mlen = inf;\\n string ans;\\n set<string> all;\\n bool found[nS];\\n int CNT = 0;\\n int fpos[nS];\\n rep(i,nS)found[i] = false;\\n \\n rep(i,nt)\\n {\\n bool update = false;\\n int cnt = 0,mn,mx;\\n mn = inf,mx = -inf;\\n rep(j,nS)\\n\\t{\\n\\t if(S[j] == text[i])\\n\\t {\\n\\t update = true;\\n\\t found[j] = true;\\n\\t fpos[j] = i;\\n\\t }\\n\\t if(found[j])\\n\\t {\\n\\t cnt++;\\n\\t mn = min(mn,fpos[j]);\\n\\t mx = max(mx,fpos[j]);\\n\\t }\\n\\t}\\n if(cnt == nS)\\n\\t{\\n\\t int cost = mx - mn + 1;\\n\\t if(cost < mlen)\\n\\t {\\n\\t mlen = cost;\\n\\t ans = text.substr(mn,cost);\\n\\t all.clear();\\n\\t CNT = 1;\\n\\t all.insert(text.substr(mn,cost));\\n\\t }\\n\\t else if(cost == mlen)\\n\\t {\\n\\t if(update)CNT++;\\n\\t all.insert(text.substr(mn,cost));\\n\\t }\\n\\t}\\n }\\n cout << CNT << endl << endl;\\n //printf(\\\"%d\\\\n\\\\n\\\",(int)all.size());\\n \\n if(all.empty())\\n {\\n return;\\n }\\n\\n rep(i,ans.size())\\n if((i+1)%72 == 0 && i != 0)\\n printf(\\\"%c\\\\n\\\",ans[i]);\\n else\\n printf(\\\"%c\\\",ans[i]);\\n if(ans.size()%72 != 0)puts(\\\"\\\\n\\\");\\n else puts(\\\"\\\");\\n}\\n \\nint main()\\n{\\n string blank;\\n while(getline(cin,blank))\\n {\\n string text,S;\\n text += blank;\\n while(getline(cin,blank))\\n\\t{\\n\\t if(blank.empty())break;\\n\\t text += blank;\\n\\t}\\n if(text.empty())goto Fin;\\n while(getline(cin,blank))\\n\\tif(blank.empty())break;\\n\\telse S += blank;\\n compute(text,S);\\n }\\n Fin:;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 550,\n \"memory_kb\": 2656,\n \"score_of_the_acc\": -0.4181,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1215_793468\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cstring>\\n#include <algorithm>\\n#include <vector>\\n#include <string>\\n#include <map>\\n#include <set>\\nusing namespace std;\\n \\n#define FOUND 1\\n#define NOT_FOUND -1\\n \\nbool compare(string s1, string s2){\\n if(s1.size() == s2.size()) return s1 < s2;\\n return s1.size() < s2.size();\\n} \\n \\nint main(){\\n string in, sub;\\n string seq;\\n bool flag = true;\\n while(getline(cin, in)){\\n if(!flag && (in.size() == 0 || cin.eof())){\\n if(cin.eof()) sub += in; \\n flag = true;\\n \\n map<char, int > mp;\\n set<char> data;\\n \\n for(int i = 0 ; i < sub.size() ; i++) data.insert(sub[i]);\\n for(int i = 0 ; i < sub.size() ; i++) mp[ sub[i] ] = NOT_FOUND;\\n \\n int ans = 0;\\n int len = (1<<29);\\n string ans2;\\n \\n for(int i = 0 ; i < seq.size() ; i++){\\n if(data.find(seq[i]) == data.end()) continue;\\n mp[ seq[i] ] = i;\\n \\n int left = (1<<29);\\n bool ok = true;\\n for(int j = 0 ; j < sub.size() ; j++){\\n if(mp[ sub[j] ] == NOT_FOUND){\\n ok = false;\\n break;\\n }\\n left = min(left, mp[ sub[j] ]);\\n }\\n \\n if(!ok) continue;\\n \\n if(i - left == len) ans++;\\n if(i - left < len){\\n len = i - left;\\n ans = 1;\\n //cout << \\\"i = \\\" << i << \\\" left = \\\" << left << endl;\\n //cout << i << endl;\\n ans2 = seq.substr(left, i-left+1);\\n //cout << seq.substr(left, i-left+1) << endl;\\n }\\n \\n }\\n \\n cout << ans << endl << endl;\\n if(ans != 0){\\n for(int i = 0 ; i < ans2.size() ; i += 72){\\n cout << ans2.substr(i, 72) << endl;\\n }\\n if(!cin.eof()) cout << endl;\\n }\\n \\n //cout << \\\"ans_len = \\\" << len << endl;\\n //cout << \\\"ans_cnt = \\\" << ans << endl;\\n //cout << \\\"seq = \\\" << seq << endl;\\n //cout << \\\"sub = \\\" << sub << endl;\\n //cout << endl;\\n seq = \\\"\\\", sub = \\\"\\\";\\n continue;\\n }\\n else if(flag && in.size() != 0){\\n seq += in;\\n continue;\\n }\\n else if(flag && in.size() == 0){\\n flag = false;\\n continue;\\n }\\n else if(!flag && in.size() != 0){\\n sub += in;\\n continue;\\n }\\n \\n \\n \\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 1832,\n \"score_of_the_acc\": -0.0474,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1215_793466\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cstring>\\n#include <algorithm>\\n#include <vector>\\n#include <string>\\n#include <map>\\n#include <set>\\nusing namespace std;\\n\\n#define FOUND 1\\n#define NOT_FOUND -1\\n\\nbool compare(string s1, string s2){\\n if(s1.size() == s2.size()) return s1 < s2;\\n return s1.size() < s2.size();\\n} \\n\\nint main(){\\n string in, sub;\\n string seq;\\n bool flag = true;\\n while(getline(cin, in)){\\n if(!flag && (in.size() == 0 || cin.eof())){\\n if(cin.eof()) sub += in; \\n flag = true;\\n \\n map<char, int > mp;\\n set<char> data;\\n\\n for(int i = 0 ; i < sub.size() ; i++) data.insert(sub[i]);\\n for(int i = 0 ; i < sub.size() ; i++) mp[ sub[i] ] = NOT_FOUND;\\n \\n int ans = 0;\\n int len = (1<<29);\\n string ans2;\\n \\n for(int i = 0 ; i < seq.size() ; i++){\\n\\tif(data.find(seq[i]) == data.end()) continue;\\n\\tmp[ seq[i] ] = i;\\n\\t\\n\\tint left = (1<<29);\\n\\tbool ok = true;\\n\\tfor(int j = 0 ; j < sub.size() ; j++){\\n\\t if(mp[ sub[j] ] == NOT_FOUND){\\n\\t ok = false;\\n\\t break;\\n\\t }\\n\\t left = min(left, mp[ sub[j] ]);\\n\\t}\\n\\t\\n\\tif(!ok) continue;\\n\\t\\n\\tif(i - left == len) ans++;\\n\\tif(i - left < len){\\n\\t len = i - left;\\n\\t ans = 1;\\n\\t //cout << \\\"i = \\\" << i << \\\" left = \\\" << left << endl;\\n\\t //cout << i << endl;\\n\\t ans2 = seq.substr(left, i-left+1);\\n\\t //cout << seq.substr(left, i-left+1) << endl;\\n\\t}\\n\\t\\n }\\n \\n cout << ans << endl << endl;\\n if(ans != 0){\\n\\tfor(int i = 0 ; i < ans2.size() ; i += 72){\\n\\t cout << ans2.substr(i, 72) << endl;\\n\\t}\\n\\tif(!cin.eof()) cout << endl;\\n }\\n\\n //cout << \\\"ans_len = \\\" << len << endl;\\n //cout << \\\"ans_cnt = \\\" << ans << endl;\\n //cout << \\\"seq = \\\" << seq << endl;\\n //cout << \\\"sub = \\\" << sub << endl;\\n //cout << endl;\\n seq = \\\"\\\", sub = \\\"\\\";\\n continue;\\n }\\n else if(flag && in.size() != 0){\\n seq += in;\\n continue;\\n }\\n else if(flag && in.size() == 0){\\n flag = false;\\n continue;\\n }\\n else if(!flag && in.size() != 0){\\n sub += in;\\n continue;\\n }\\n \\n \\n\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 1832,\n \"score_of_the_acc\": -0.0521,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1215_793406\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<algorithm>\\n#include<string>\\n\\n#define INF (1<<29)\\n#define all(c) (c).begin(),(c).end()\\n\\nusing namespace std;\\n\\n\\nint main(void){\\n\\n string s,t,in;\\n bool f=false;\\n while(true){\\n s.clear();\\n t.clear();\\n while(true){\\n getline(cin,in);\\n if(in.size()==0)break;\\n s+=in;\\n }\\n\\n while(true){\\n getline(cin,in);\\n if(in.size()==0)break;\\n t+=in;\\n }\\n\\n if(s.size()==0 && t.size()==0)break;\\n\\n //if(f)cout << endl;\\n f=true;\\n\\n int sl=s.size(),tl=t.size();\\n int now[tl],ans=0;\\n string res=\\\"\\\";\\n\\n fill(now,now+tl,INF);\\n\\n int tmp=0;\\n for(int i=0;i<sl;i++){\\n for(int j=0;j<tl;j++){\\n if(s[i]==t[j]){\\n now[j]=min(now[j],i);\\n }\\n }\\n }\\n\\n bool flag=false;\\n for(int i=0;i<tl;i++){\\n flag|=(now[i]>=INF);\\n }\\n if(flag){\\n cout << 0 << endl << endl;;\\n continue;\\n }\\n\\n int left=INF,right=-1,lid,rid;\\n for(int i=0;i<tl;i++){\\n if(left>now[i])left=now[i],lid=i;\\n if(right<now[i])right=now[i],rid=i;\\n }\\n ans++;\\n res=s.substr(left,right-left+1);\\n\\n while(true){\\n int mn=INF,id=0;\\n for(int i=0;i<tl;i++){\\n if(mn>now[i])mn=now[i],id=i;\\n }\\n while(now[id]<sl && s[++now[id]]!=t[id]);\\n if(s[now[id]]!=t[id])break;\\n int l=INF,r=0;\\n bool fg=true;\\n for(int i=0;i<tl;i++){\\n l=min(l,now[i]);\\n r=max(r,now[i]);\\n fg&=(now[i]>=sl-1);\\n }\\n if(fg)break;\\n if(res.size()>r-l+1){\\n ans=0;\\n res=s.substr(l,r-l+1);\\n }\\n if(res.size()==r-l+1)ans++;\\n }\\n cout << ans << endl << endl;\\n for(int i=0;i<res.size();i++){\\n cout << res[i];\\n if((i+1)%72==0)cout << endl;\\n }\\n if(res.size()%72>0)cout << endl;\\n cout << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 1828,\n \"score_of_the_acc\": -0.0654,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1215_793371\",\n \"code_snippet\": \"#include<iostream>\\n#include<map>\\n#include<cstring>\\n\\nusing namespace std;\\n\\nconst int MAX = 51;\\n\\nstring text, key;\\nmap<char,int> M;\\nint numKey[MAX];\\n\\ntypedef long long ll;\\n\\nbool input(){\\n text = \\\"\\\";\\n\\n string s = \\\"\\\";\\n if(!getline(cin,s)) return false;\\n if(s == \\\"\\\") return false;\\n text = s;\\n while(getline(cin,s)&&s!=\\\"\\\") text += s;\\n getline(cin,s);\\n key = s;\\n getline(cin,s); // for blank line\\n return true;\\n}\\n\\n\\n\\nvoid solve(){\\n\\n memset(numKey,0,sizeof(numKey));\\n\\n M.clear();\\n for(int i = 0; i < (int)key.length(); i++)\\n M[key[i]] = i;\\n\\n ll need = (1LL<<key.length())-1;\\n\\n string first = \\\"\\\";\\n int num = 0;\\n\\n int s = 0, t = 0;\\n\\n while(s <= t && t <= (int)text.length()){\\n if(need == 0){\\n // if(text.size() > 400 && t-s < 50) cout << text.substr(s,t-s) << endl;\\n if(first != \\\"\\\" && (int)first.length() == t-s){\\n\\tnum++;\\n }\\n if(first == \\\"\\\" || (int)first.length() > t-s){\\n\\tfirst = text.substr(s,t-s);\\n\\tnum = 1;\\n }\\n\\n if(M.count(text[s]) != 0){\\n\\tnumKey[M[text[s]]]--;\\n\\tif(numKey[M[text[s]]] == 0) need |= (1LL<<M[text[s]]);\\n }\\n s++;\\n }else{\\n if(M.count(text[t]) != 0){\\n\\tif(need&(1LL<<M[text[t]])) need -= (1LL<<M[text[t]]);\\n\\tnumKey[M[text[t]]]++;\\n }\\n t++;\\n }\\n }\\n // cout << \\\"min \\\" << minT << endl;\\n if(num == 0) cout << num << endl;\\n else{\\n cout << num << endl << endl;\\n\\n for(int i = 0; i < (int)first.length(); i++){\\n cout << first[i];\\n if((i+1)%72 == 0) cout<<endl;\\n }\\n if((int)first.size()%72)cout << endl;\\n }\\n cout << endl;\\n}\\t \\n\\nint main(){\\n\\n // bool isFirst = true;\\n while(input()){\\n // if(isFirst) isFirst = false;\\n // else cout << endl;\\n solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 1832,\n \"score_of_the_acc\": -0.0521,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1215_772986\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <algorithm>\\nusing namespace std;\\n\\nstring S,K;\\nconst int INF=1<<28;\\n\\nvoid solve(){\\n\\tstring ans;\\n\\tint len=INF, cnt=0;\\n\\tint left=INF;\\n\\tint idx[K.length()];\\n//\\tfill(begin(idx), end(idx), 0);\\n\\tfor(int i=0; i<K.length(); ++i)idx[i]=-1;\\n\\n\\tfor(int p=0; p<S.length(); ++p){\\n\\t\\tfor(int k=0; k<K.length(); ++k){\\n\\t\\t\\tif(S[p]==K[k]){\\n\\t\\t\\t\\tidx[k]=p;\\n\\t\\t\\t\\tleft=INF;\\n\\t\\t\\t\\tfor(int i=0; i<K.length(); ++i)\\tleft=min(left, idx[i]);\\n\\t\\t\\t\\tif(left>=0){\\n//\\t\\t\\t\\t\\tcout << left << \\\" \\\" << p << endl;\\n\\t\\t\\t\\t\\tstring cand=S.substr(left, p-left+1);\\n\\t\\t\\t\\t\\tif(len>cand.length()){\\n\\t\\t\\t\\t\\t\\tcnt=1;\\n\\t\\t\\t\\t\\t\\tlen=cand.length();\\n\\t\\t\\t\\t\\t\\tans=cand;\\n\\t\\t\\t\\t\\t}else if(len==cand.length()){\\n\\t\\t\\t\\t\\t\\t++cnt;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tif(len>=INF){\\n\\t\\tcout << 0 << endl;\\n\\t}else{\\n\\t\\tcout << cnt << endl;\\n\\t\\tcout << endl;\\n\\n\\t\\tfor(int i=0; i<ans.size(); ++i){\\n\\t\\t\\tif(i>0 && i%72==0)\\tcout<<endl;\\n\\t\\t\\tcout << ans[i];\\n\\t\\t}\\n\\t\\tcout<<endl;\\n\\t}\\n\\tcout<<endl;\\n}\\n\\nint main(){\\n\\tfor(int cnt=0;;++cnt){\\n\\t\\tstring tmp;\\n\\t\\tif(getline(cin,tmp).eof())\\tbreak;\\n\\t\\tif(tmp==\\\"\\\")\\tbreak;\\n\\t\\tS=tmp;\\n\\t\\twhile(true){\\n\\t\\t\\tgetline(cin,tmp);\\n\\t\\t\\tif(tmp==\\\"\\\")\\tbreak;\\n\\t\\t\\tS+=tmp;\\n\\t\\t}\\n\\t\\tgetline(cin,K);\\n\\t\\tgetline(cin,tmp);\\n//\\t\\tcout<<S<<endl;\\n//\\t\\tcout<<K<<endl;\\n//\\t\\tif(cnt>0)\\tcout<<endl;\\n\\t\\tsolve();\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 1828,\n \"score_of_the_acc\": -0.0467,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1215_605320\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n#include <string>\\n#include <algorithm>\\n#include <vector>\\n#include <stack>\\n#include <queue>\\n#include <set>\\n#include <map>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <cmath>\\n#include <cassert>\\n\\nusing namespace std;\\n\\n#define FOR(i,k,n) for(int i=(k); i<(int)(n); ++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\\n\\ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cerr<<*i<<\\\" \\\"; cerr<<endl; }\\ninline bool valid(int x, int y, int W, int H){ return (x >= 0 && y >= 0 && x < W && y < H); }\\n\\ntypedef long long ll;\\nconst int INF = 100000000;\\nconst double EPS = 1e-8;\\nconst int MOD = 1000000007;\\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\\n\\nint main(){\\n bool begin = true;\\n while(true){\\n string s, text, query;\\n while(getline(cin, s) && s != \\\"\\\"){\\n text += s;\\n }\\n if(text == \\\"\\\") break;\\n getline(cin, query);\\n assert(query != \\\"\\\");\\n getline(cin, s); // empty\\n assert(s == \\\"\\\");\\n\\n /*\\n if(begin) begin = false;\\n else cout << endl;\\n */\\n\\n int N = text.size();\\n int L = query.size();\\n\\n map<char, int> to_idx;\\n REP(i, L) to_idx[query[i]] = i;\\n\\n vector<int> idx_vec[100];\\n REP(i, N) if(to_idx.count(text[i])) idx_vec[to_idx[text[i]]].push_back(i);\\n\\n bool ok = true;\\n REP(i, L) if(idx_vec[i].empty()) ok = false;\\n if(!ok){\\n cout << 0 << endl;\\n cout << endl;\\n continue;\\n }\\n\\n map<int, set<int> > cnt;\\n int shortest_length = INF;\\n vector<int> cur(L);\\n while(true){\\n int b = idx_vec[0][cur[0]], e = idx_vec[0][cur[0]];\\n REP(i, L) {\\n b = min(b, idx_vec[i][cur[i]]);\\n e = max(e, idx_vec[i][cur[i]]);\\n }\\n int l = e - b + 1;\\n shortest_length = min(shortest_length, l);\\n if(shortest_length == l) cnt[l].insert(b);\\n\\n int idx = -1;\\n REP(i, L)if(cur[i] + 1 < idx_vec[i].size()){\\n if(idx == -1 || idx_vec[i][cur[i] + 1] < idx_vec[idx][cur[idx] + 1]){\\n idx = i;\\n }\\n }\\n if(idx == -1) break;\\n cur[idx] += 1;\\n }\\n cout << cnt[shortest_length].size() << endl;\\n cout << endl;\\n string ans = text.substr(*cnt[shortest_length].begin(), shortest_length);\\n for(int i = 0; i < ans.size(); i += 72){\\n if(i + 72 < ans.size()) cout << ans.substr(i, 72) << endl;\\n else cout << ans.substr(i) << endl;\\n }\\n cout << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3712,\n \"score_of_the_acc\": -0.366,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1215_525767\",\n \"code_snippet\": \"//47\\n#include<iostream>\\n#include<sstream>\\n#include<string>\\n#include<map>\\n#include<algorithm>\\n#include<set>\\n\\nusing namespace std;\\n\\nint main(){\\n for(string si;getline(cin,si),si!=\\\"\\\";){\\n string s;\\n do{\\n s+=si;\\n getline(cin,si);\\n }while(si!=\\\"\\\");\\n string k;\\n getline(cin,k);\\n cin.ignore();\\n map<char,int> m;\\n int f=0,l=1<<30;\\n int n=0;\\n set<long long> st;\\n for(int i=0;i<s.size();i++){\\n if(k.find(s[i])!=string::npos){\\n\\tm[s[i]]=i;\\n }\\n if(m.size()!=k.size())continue;\\n int cl=0,cf=1<<30;\\n for(int j=0;j<k.size();j++){\\n\\tcl=max(cl,m[k[j]]);\\n\\tcf=min(cf,m[k[j]]);\\n }\\n if(!st.insert((long long)cl<<32|cf).second)continue;\\n if(cl-cf<=l-f){\\n\\tif(cl-cf<l-f){\\n\\t f=cf;\\n\\t l=cl;\\n\\t n=0;\\n\\t}\\n\\tn++;\\n }\\n }\\n cout<<n<<endl<<endl;\\n if(n){\\n string t=s.substr(f,l-f+1);\\n for(int i=0;i<t.size();i+=72){\\n\\tcout<<t.substr(i,72)<<endl;\\n }\\n cout<<endl;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 280,\n \"memory_kb\": 3424,\n \"score_of_the_acc\": -0.424,\n \"final_rank\": 18\n }\n]","isConversational":false}}},{"rowIdx":680,"cells":{"group_id":{"kind":"string","value":"aoj_1217_cpp"},"problem_description":{"kind":"string","value":"Problem B:\nFamily Tree\nA professor of anthropology was interested in people living in isolated islands and their history.\nHe collected their family trees to conduct some anthropological experiment. For the experiment,\nhe needed to process the family trees with a computer. For that purpose he translated them\ninto text files. The following is an example of a text file representing a family tree.\nJohn\n Robert\n Frank\n Andrew\n Nancy\n David\nEach line contains the given name of a person. The name in the first line is the oldest ancestor\nin this family tree. The family tree contains only the descendants of the oldest ancestor. Their\nhusbands and wives are not shown in the family tree. The children of a person are indented\nwith one more space than the parent. For example, Robert and Nancy are the children of John,\nand Frank and Andrew are the children of Robert. David is indented with one more space than\nRobert, but he is not a child of Robert, but of Nancy. To represent a family tree in this way,\nthe professor excluded some people from the family trees so that no one had both parents in a\nfamily tree.\nFor the experiment, the professor also collected documents of the families and extracted the\nset of statements about relations of two persons in each family tree. The following are some\nexamples of statements about the family above.\nJohn is the parent of Robert.\nRobert is a sibling of Nancy.\nDavid is a descendant of Robert.\nFor the experiment, he needs to check whether each statement is true or not. For example, the\nfirst two statements above are true and the last statement is false. Since this task is tedious, he\nwould like to check it by a computer program.\nInput\nThe input contains several data sets. Each data set consists of a family tree and a set of\nstatements. The first line of each data set contains two integers\nn\n(0 <\nn\n< 1000) and\nm\n(0 <\nm\n< 1000) which represent the number of names in the family tree and the number of\nstatements, respectively. Each line of the input has less than 70 characters.\nAs a name, we consider any character string consisting of only alphabetic characters. The names\nin a family tree have less than 20 characters. The name in the first line of the family tree has\nno leading spaces. The other names in the family tree are indented with at least one space, i.e.,\nthey are descendants of the person in the first line. You can assume that if a name in the family\ntree is indented with\nk\nspaces, the name in the next line is indented with at most\nk\n+ 1 spaces.\nThis guarantees that each person except the oldest ancestor has his or her parent in the family\ntree. No name appears twice in the same family tree. Each line of the family tree contains no\nredundant spaces at the end.\nEach statement occupies one line and is written in one of the following formats, where\nX\nand\nY\nare different names in the family tree.\nX\nis a child of\nY\n.\nX\nis the parent of\nY\n.\nX\nis a sibling of\nY\n.\nX\nis a descendant of\nY\n.\nX\nis an ancestor of\nY\n.\nNames not appe\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1217_2170790","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint dep[100010];\nint par[100010][19];\nvector<int> g[100010];\nvoid dfs(int v,int u,int d){\n dep[v]=d;\n for(int i=0; i<g[v].size(); i++){\n int w=g[v][i];if(w==u) continue;\n par[w][0]=v;dfs(w,v,d+1);\n }\n}\nint lcp(int a,int b){\n if(dep[a]<dep[b]) swap(a,b);\n for(int i=0; i<19; i++){\n if((dep[a]-dep[b])&(1<<i)) a=par[a][i];\n }\n if(a==b) return a;\n for(int i=18;i>=0;i--){\n if(par[a][i]!=par[b][i]) a=par[a][i],b=par[b][i];\n }\n return par[a][0];\n}\nint n,m;\nvoid init() {\n memset(par,0,sizeof(par));\n dfs(0,-1,0);\n for(int i=0; i<18; i++)for(int j=0; j<n; j++) par[j][i+1]=par[par[j][i]][i];\n}\n\nstring r[111111];\nint main() {\n while(cin >> n >> m && n) {\n for(int i=0; i<n; i++) g[i].clear();\n string s;\n getline(cin,s);\n map<string,int> ma;\n for(int i=0; i<n; i++) {\n getline(cin,s);\n stringstream ss;\n string t;\n ss << s;\n ss >> t;\n ma[t]=i;\n int c=0;\n for(int j=0; j<s.size(); j++) {\n if(s[j]==' ') c++;\n else break;\n }\n if(c) {\n g[ma[t]].push_back(ma[r[c-1]]);\n g[ma[r[c-1]]].push_back(ma[t]);\n }\n r[c]=t;\n }\n init();\n while(m--) {\n getline(cin,s);\n stringstream ss;\n ss << s;\n string x,y,z;\n ss >> x;\n ss >> z;ss >> z;ss >> z;\n ss >> y;ss >> y;\n y=y.substr(0,y.size()-1);\n int xx=ma[x],yy=ma[y];\n bool f=0;\n if(z==\"parent\") {\n if(lcp(xx,yy)==xx&&dep[yy]-dep[xx]==1) f=1;\n } else if(z==\"child\") {\n if(lcp(xx,yy)==yy&&dep[xx]-dep[yy]==1) f=1;\n } else if(z==\"sibling\") {\n if(dep[xx]==dep[yy]&&dep[xx]-dep[lcp(xx,yy)]==1) f=1;\n } else if(z==\"descendant\") {\n if(lcp(xx,yy)==yy&&dep[xx]-dep[yy]>=1) f=1;\n } else {\n if(lcp(xx,yy)==xx&&dep[yy]-dep[xx]>=1) f=1;\n }\n if(f) cout << \"True\" << endl;\n else cout << \"False\" << endl;\n }\n cout << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":13916,"score_of_the_acc":-1,"final_rank":18},{"submission_id":"aoj_1217_2065883","code_snippet":"#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\nusing ld = long double;\nconst ld eps = 1e-9;\n\n//// < \"d:\\d_download\\visual studio 2015\\projects\\programing_contest_c++\\debug\\a.txt\" > \"d:\\d_download\\visual studio 2015\\projects\\programing_contest_c++\\debug\\b.txt\"\n\nstruct tree {\n\tstring name;\n\tint depth;\n\tvector<unique_ptr<tree>>childs;\n\ttree(const string _name,const int _depth) :name(_name),depth(_depth),childs() {\n\n\t}\n};\nunique_ptr<tree> maketree(vector<string>&sts, vector<int>&ns,int depth,int &a) {\n\tunique_ptr<tree> t(std::make_unique<tree>(sts[a],depth));\n\twhile (a+1!=sts.size()&&ns[a+1] > depth) {\n\t\ta++;\n\t\tt->childs.push_back(maketree(sts, ns, depth + 1, a));\n\t\t\n\t}\n\treturn t;\n}\n\nvector<string> split(const string &str, char delim) {\n\tvector<string> res;\n\tsize_t current = 0, found;\n\twhile ((found = str.find_first_of(delim, current)) != string::npos) {\n\t\tres.push_back(string(str, current, found - current));\n\t\tcurrent = found + 1;\n\t}\n\tres.push_back(string(str, current, str.size() - current));\n\treturn res;\n}\nint dfs(const unique_ptr<tree>&tp,int type,string a,string b,bool flag) {\n\t//a is parant of b\n\tif (type == 0) {\n\t\tif (a == tp->name) {\n\t\t\tfor (auto&& c : tp->childs) {\n\t\t\t\tif (c->name == b)return 1;\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\t\telse {\n\t\t\tfor (auto &&c : tp->childs) {\n\t\t\t\tint num=dfs(c, type, a, b,flag);\n\t\t\t\tif (num != -1)return num;\n\t\t\t}\n\t\t\treturn -1;\n\t\t}\n\t}\n\telse if (type == 1) {\n\t\tif (flag) {\n\t\t\tif (tp->name == b)return 1;\n\t\t\tfor (auto &&c : tp->childs) {\n\t\t\t\tint num = dfs(c, type, a, b, flag);\n\t\t\t\tif (num != -1)return num;\n\t\t\t}\n\t\t\treturn -1;\n\t\t}\n\t\telse {\n\t\t\tif (tp->name == a)flag = true;\n\t\t\tfor (auto &&c : tp->childs) {\n\t\t\t\tint num = dfs(c, type, a, b, flag);\n\t\t\t\tif (num != -1)return num;\n\t\t\t}\n\t\t\tif (flag)return 0;\n\t\t\telse return -1;\n\t\t}\n\t}\n\telse {\n\t\tint same = 0;\n\t\tfor (auto&&c : tp->childs) {\n\t\t\tif (c->name == a)same++;\n\t\t\tif (c->name == b)same++;\n\t\t\tint num = dfs(c, type, a, b, flag);\n\t\t\tif (num != -1)return num;\n\t\t}\n\t\tif (same == 2)return 1;\n\t\telse if (same == 1)return 0;\n\t\telse return -1;\n\t}\n}\n\nint main() {\n\twhile (1) {\n\n\t\tint N, M; cin >> N >> M;\n\t\tif (!N)break;\n\t\tunique_ptr<tree> t;\n\t\t{\n\t\t\tvector<string>sts;\n\t\t\tvector<int>ns;\n\t\t\tstring st; getline(cin, st);\n\t\t\tfor (int i = 0; i < N; ++i) {\n\t\t\t\tgetline(cin, st);\n\t\t\t\tint n = st.find_first_not_of(' ');\n\t\t\t\tsts.push_back(st.substr(n));\n\t\t\t\tns.push_back(n);\n\t\t\t}\n\n\t\t\tint a = 0;\n\t\t\tt = maketree(sts, ns, 0, a);\n\t\t}\n\t\t\n\t\twhile (M--) {\n\t\t\tstring st;\n\t\t\tgetline(cin, st);\n\t\t\tvector<string>sts(split(st, ' '));\n\t\t\tstring a = sts[0];\n\t\t\tstring b = sts[5].substr(0, sts[5].size() - 1);\n\t\t\tint ans;\n\t\t\tif (sts[3] == \"child\") {\n\t\t\t\tans = dfs(t, 0, b, a, false);\n\t\t\t}\n\t\t\telse if (sts[3] == \"ancestor\") {\n\t\t\t\tans = dfs(t,1, a, b, false);\n\t\t\t}\n\t\t\telse if (sts[3] == \"sibling\") {\n\t\t\t\tans = dfs(t, 2, a, b, false);\n\t\t\t}\n\t\t\telse if (sts[3] == \"parent\") {\n\t\t\t\tans = dfs(t, 0, a, b, false);\n\t\t\t}\n\t\t\telse if (sts[3] == \"descendant\") {\n\t\t\t\tans = dfs(t, 1, b, a, false);\n\t\t\t}\n\t\t\tif (ans == 1)cout << \"True\" << endl;\n\t\t\telse if (ans == 0)cout << \"False\" << endl;\n\t\t\telse assert(false);\n\t\t}\n\t\tcout << endl;\n\t}\n\t\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3168,"score_of_the_acc":-0.1467,"final_rank":13},{"submission_id":"aoj_1217_1980409","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nmap <string, string> child_parent;\nstring lastname[2000];\n\nbool child(string a, string b){\n\tif (child_parent[a] == b) return true;\n\telse return false;\n}\n\nbool parent(string a, string b){\n\tif (a == child_parent[b]) return true;\n\telse return false;\n}\n\nbool sibling(string a, string b){\n\tif (child_parent[a] == child_parent[b]) return true;\n\telse return false;\n}\n\nbool ancestor(string a, string b){\n\tif (child_parent[b] == \"none\") return false;\n\telse if (parent(a, b)) return true;\n\telse return ancestor(a, child_parent[b]);\n}\n\nbool descendant(string a, string b){\n\treturn ancestor(b, a);\n}\n\nint main(void){\n\n\tint n, m;\n\n\twhile (cin >> n >> m, n, m){\n\n\t\tchild_parent.clear();\n\t\tcin.ignore();\n\n\t\tfor (int i = 0; i < n; i++){\n\t\t\tstring s;\n\t\t\tgetline(cin, s);\n\n\t\t\tint count = 0;\n\t\t\tfor (int j = 0; j < s.size(); j++){\n\t\t\t\tif (s[j] == ' ') count++;\n\t\t\t}\n\n\t\t\tif (count == 0) child_parent[s] = \"none\";\n\t\t\telse child_parent[s.substr(count)] = lastname[count - 1];\n\n\t\t\tlastname[count] = s.substr(count);\n\n\t\t}\n\n\t\tfor (int i = 0; i < m; i++){\n\t\t\tstring a, b,relate, buff;\n\t\t\tcin >> a >> buff >> buff >> relate >> buff;\n\t\t\tchar bb[200];\n\t\t\tscanf(\" %[^.].\", &bb);\n\t\t\tb = bb;\n\n\t\t\tbool flag = false;\n\t\t\tif (relate == \"child\") flag = child(a, b);\n\t\t\telse if (relate == \"parent\") flag = parent(a, b);\n\t\t\telse if (relate == \"sibling\") flag = sibling(a, b);\n\t\t\telse if (relate == \"descendant\") flag = descendant(a, b);\n\t\t\telse if (relate == \"ancestor\") flag = ancestor(a, b);\n\n\t\t\tif (flag) cout << \"True\" << endl;\n\t\t\telse cout << \"False\" << endl;\n\t\t}\n\n\t\t\n\n\t\tcout << endl;\n\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1396,"score_of_the_acc":-0.006,"final_rank":8},{"submission_id":"aoj_1217_1963864","code_snippet":"#include <vector>\n#include <list>\n#include <map>\n#include <set>\n#include <queue>\n#include <deque>\n#include <stack>\n#include <algorithm>\n#include <functional>\n#include <numeric>\n#include <utility>\n#include <sstream>\n#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <cmath>\n#include <cstdlib>\n#include <cctype>\n#include <string>\n#include <cstring>\nusing namespace std;\n#define REP(i,n) for(int i = 0; i < (int)n; i++)\n#define FOR(i,a,b) for(int i = a; i < (int)b; i++)\n#define pb push_back\n#define mp make_pair\ntypedef vector<int> vi;\ntypedef pair<int, int> pi;\ntypedef long long ll;\nconst int INF = 1<<28;\nconst ll MOD = 1000000007;\nconst int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};\n\nbool des(string a, string b, map<string, string> &m) {\n\tstring s = a;\n\twhile(s != \"\") {\n\t\tif(s == b)\n\t\t\treturn true;;\n\t\ts = m[s];\n\t}\n\treturn false;\n}\n\nint main() {\n\tios_base::sync_with_stdio(0);\n\tcin.tie(0);\n\tint n, m;\n\twhile(cin >> n >> m, n|m) {\n\t\tcin.ignore();\n\t\tvector<string> v(1000);\n\t\tmap<string, string> ma;\n\t\tREP(i, n) {\n\t\t\tstring s;\n\t\t\tgetline(cin, s);\n\t\t\tint cnt = 0;\n\t\t\twhile(s[cnt] == ' ')\n\t\t\t\tcnt++;\n\t\t\ts = s.substr(cnt);\n\t\t\tma[s] = cnt ? v[cnt-1] : \"\";\n\t\t\tv[cnt] = s;\n\t\t}\n\t\tREP(i, m) {\n\t\t\tstring in1, in2, in3;\n\t\t\tcin >> in1;\n\t\t\tcin >> in2 >> in2 >> in2;\n\t\t\tcin >> in3 >> in3;\n\t\t\tin3.erase(in3.end() - 1);\n\t\t\tbool ans = false;\n\t\t\tif(in2 == \"child\" && ma[in1] == in3)\n\t\t\t\tans = true;\n\t\t\telse if(in2 == \"parent\" && ma[in3] == in1)\n\t\t\t\tans = true;\n\t\t\telse if(in2 == \"sibling\" && ma[in1] == ma[in3])\n\t\t\t\tans = true;\n\t\t\telse if(in2 == \"descendant\")\n\t\t\t\tans = des(in1, in3, ma);\n\t\t\telse if(in2 == \"ancestor\")\n\t\t\t\tans = des(in3, in1, ma);\n\t\t\tcout << (ans ? \"True\" : \"False\") << endl;\n\t\t}\n\t\tcout << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1348,"score_of_the_acc":-0.0022,"final_rank":4},{"submission_id":"aoj_1217_1963852","code_snippet":"#include <vector>\n#include <list>\n#include <map>\n#include <set>\n#include <queue>\n#include <deque>\n#include <stack>\n#include <algorithm>\n#include <functional>\n#include <numeric>\n#include <utility>\n#include <sstream>\n#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <cmath>\n#include <cstdlib>\n#include <cctype>\n#include <string>\n#include <cstring>\nusing namespace std;\n#define REP(i,n) for(int i = 0; i < (int)n; i++)\n#define FOR(i,a,b) for(int i = a; i < (int)b; i++)\n#define pb push_back\n#define mp make_pair\ntypedef vector<int> vi;\ntypedef pair<int, int> pi;\ntypedef long long ll;\nconst int INF = 1<<28;\nconst ll MOD = 1000000007;\nconst int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};\n\nint main() {\n\tios_base::sync_with_stdio(0);\n\tcin.tie(0);\n\tint n, m;\n\twhile(cin >> n >> m, n|m) {\n\t\tcin.ignore();\n\t\tvector<string> v(1000);\n\t\tmap<string, string> ma;\n\t\tREP(i, n) {\n\t\t\tstring s;\n\t\t\tgetline(cin, s);\n\t\t\tint cnt = 0;\n\t\t\twhile(s[cnt] == ' ')\n\t\t\t\tcnt++;\n\t\t\ts = s.substr(cnt);\n\t\t\tif(!cnt)\n\t\t\t\tma[s] = \"\";\n\t\t\telse\n\t\t\t\tma[s] = v[cnt-1];\n\t\t\tv[cnt] = s;\n\t\t}\n\t\tREP(i, m) {\n\t\t\tstring in1, in2, in3;\n\t\t\tcin >> in1;\n\t\t\tcin >> in2 >> in2 >> in2;\n\t\t\tcin >> in3 >> in3;\n\t\t\tin3.erase(in3.end() - 1);\n\t\t\tbool ans = false;\n\t\t\tif(in2 == \"child\" && ma[in1] == in3)\n\t\t\t\tans = true;\n\t\t\telse if(in2 == \"parent\" && ma[in3] == in1)\n\t\t\t\tans = true;\n\t\t\telse if(in2 == \"sibling\" && ma[in1] == ma[in3])\n\t\t\t\tans = true;\n\t\t\telse if(in2 == \"descendant\") {\n\t\t\t\tstring s = ma[in1];\n\t\t\t\twhile(s != \"\") {\n\t\t\t\t\tif(s == in3)\n\t\t\t\t\t\tans = true;\n\t\t\t\t\ts = ma[s];\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if(in2 == \"ancestor\") {\n\t\t\t\tstring s = ma[in3];\n\t\t\t\twhile(s != \"\") {\n\t\t\t\t\tif(s == in1)\n\t\t\t\t\t\tans = true;\n\t\t\t\t\ts = ma[s];\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(ans)\n\t\t\t\tcout << \"True\" << endl;\n\t\t\telse\n\t\t\t\tcout << \"False\" << endl;\n\t\t}\n\t\tcout << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1344,"score_of_the_acc":-0.0019,"final_rank":3},{"submission_id":"aoj_1217_1418111","code_snippet":"#include <iostream>\n#include <sstream>\n#include <string>\n#include <vector>\n#include <unordered_map>\n#include <functional>\nusing namespace std;\ntypedef unordered_map<string,string> mss;\n\nunordered_map<string,function<bool(const string&,const string&,mss&)>>T={\n\t{\"child\",[](const string &x,const string &y,mss &parent){return parent[x]==y;}},\n\t{\"parent\",[](const string &x,const string &y,mss &parent){return parent[y]==x;}},\n\t{\"sibling\",[](const string &x,const string &y,mss &parent){return parent[x]==parent[y];}},\n\t{\"descendant\",[](const string &x,const string &y,mss &parent){\n\t\tstring z=parent[x];\n\t\tfor(;;){\n\t\t\tif(z==y)return true;\n\t\t\tif(parent[z]==\"\")return false;\n\t\t\tz=parent[z];\n\t\t}\n\t}},\n\t{\"ancestor\",[](const string &x,const string &y,mss &parent){\n\t\tstring z=parent[y];\n\t\tfor(;;){\n\t\t\tif(z==x)return true;\n\t\t\tif(parent[z]==\"\")return false;\n\t\t\tz=parent[z];\n\t\t}\n\t}},\n\n};\nint main(){\n\tint N,Q;\n\tstring line;\n\tfor(;cin>>N>>Q,N;){\n\t\tgetline(cin,line);\n\t\tmss parent;\n\t\tvector<string>stack;\n\t\tgetline(cin,line);\n\t\tparent[line]=\"\";\n\t\tstack.push_back(line);\n\t\tfor(int i=1;i<N;i++){\n\t\t\tgetline(cin,line);\n\t\t\tint idx=0;\n\t\t\tfor(;line[idx]==' ';idx++);\n\t\t\tstring name=line.substr(idx);\n\t\t\tif(idx>stack.size())return 1;\n\t\t\tfor(;idx<stack.size();stack.pop_back());\n\t\t\tparent[name]=stack[stack.size()-1];\n\t\t\tstack.push_back(name);\n\t\t}\n\t\tfor(int i=0;i<Q;i++){\n\t\t\tgetline(cin,line);\n\t\t\tistringstream ss(line);\n\t\t\tstring x,z,y;\n\t\t\tss>>x>>y>>y>>z>>y>>y;\n\t\t\ty=y.substr(0,y.size()-1);\n\t\t\tcout<<(T[z](x,y,parent)?\"True\":\"False\")<<endl;\n\t\t}\n\t\tcout<<endl;\n\t}\n}","accuracy":1,"time_ms":10,"memory_kb":1340,"score_of_the_acc":-0.0016,"final_rank":2},{"submission_id":"aoj_1217_1334247","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define MAX_N 1010\n\nstruct P{\n int p,l;\n};\n\nP p[MAX_N];\nstring s[MAX_N];\nbool used[MAX_N];\nint N;\n\nvoid init(int N){\n for(int i = 0 ; i < N ; i++){\n p[i].p = i;\n }\n}\n\nbool find(int x,int target){\n if(p[x].p == target){\n return true;\n }\n if(p[x].p == x){ return false; }\n return find(p[x].p,target);\n}\n\nvoid make(int n,int parent,int root,int depth){\n set<int> children;\n if(used[n]){ return; }\n used[n] = true;\n p[n].p = parent; p[n].l = depth;\n for(int i = n+1 ; i < N ; i++){\n int len = s[i].size();\n if(depth+1 >= len){ continue; }\n if(s[i][depth] != '.'){ break; }\n if(s[i][depth] == '.' && s[i][depth+1] != '.'){\n children.insert(i);\n make(i,n,root,depth+1);\n }\n }\n}\n\nint main(){\n int M;\n while(cin >> N >> M, N){\n map<string,int> mp;\n int cur = 0;\n init(N); cin.ignore();\n for(int i = 0 ; i < N ; i++){\n getline(cin,s[i]);\n for(int j = 0 ; j < (int)s[i].size() ; j++){\n if(s[i][j] != ' '){\n mp[s[i].substr(j)] = cur++;\n break;\n }\n s[i][j] = '.';\n }\n used[i] = false;\n }\n for(int i = 0 ; i < N ; i++){\n if(used[i]){ continue; }\n if(s[i][0] != '.'){\n make(i,i,i,0);\n }\n }\n string ord,a,b,c;\n for(int i = 0 ; i < M ; i++){\n getline(cin,ord);\n stringstream ss(ord);\n ss >> a;\n ss >> ord; ss >> ord;\n ss >> c;\n ss >> ord;\n ss >> b;\n b.resize(b.size()-1);\n bool ans = false;\n if(c == \"parent\"){\n if(p[mp[b]].p == mp[a]){\n ans = true;\n }\n }else if(c == \"child\"){\n if(p[mp[a]].p == mp[b]){\n ans = true;\n }\n }else if(c == \"ancestor\"){\n if(p[mp[a]].l < p[mp[b]].l && find(mp[b],mp[a])){\n ans = true;\n }\n }else if(c == \"descendant\"){\n if(p[mp[a]].l > p[mp[b]].l && find(mp[a],mp[b])){\n ans = true;\n }\n }else{\n if(p[mp[a]].l == p[mp[b]].l && p[mp[a]].p == p[mp[b]].p){\n ans = true;\n }\n }\n cout << (ans ? \"True\" : \"False\") << endl;\n }\n cout << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1440,"score_of_the_acc":-0.0095,"final_rank":11},{"submission_id":"aoj_1217_1162680","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nstruct node{\n string name;\n int parent;\n vector<int> child;\n\n node(string s=\"\"):name(s){ parent = -1; child.clear(); }\n\n void set_par(int a){ parent = a; }\n void add_child(int a){ child.push_back(a); }\n};\n\nvector<node> tree;\nmap<string,int> id;\n\ninline bool is_par(string my, string your){\n int par = tree[id[my]].parent;\n if(par<0)return false;\n return tree[par].name == your;\n}\n\ninline bool is_child(string my, string your){\n for(int c : tree[ id[my] ].child){\n if(tree[c].name == your)return true;\n }\n return false;\n}\n\ninline bool is_sib(string my, string your){\n int par = tree[id[my]].parent;\n if(par<0)return false;\n return is_child(tree[par].name, your);\n}\n\ninline bool is_anc(string my, string your){\n if(my == your)return true;\n int par = tree[id[my]].parent;\n if(par<0)return false;\n return is_anc(tree[par].name, your);\n}\n\ninline bool is_des(string my, string your){\n if(my == your)return true;\n for(int c : tree[ id[my] ].child){\n if(is_des(tree[c].name,your))return true;\n }\n return false; \n}\n\nint main(){\n int n,m;\n while(cin >> n >> m, n){\n stack< pair<int,int> > s;\n id.clear();\n tree.resize(n);\n\n cin.ignore();\n for(int i=0;i<n;i++){\n string name;\n getline(cin,name);\n //cout << name << endl;\n int indent = 0;\n while(name[indent]==' ')indent++;\n name = name.substr(indent);\n tree[i] = node(name);\n id[name] = i;\n\n while(s.size() && s.top().second+1 != indent)s.pop();\n if(s.size()){\n\ttree[i].set_par( s.top().first );\n\ttree[s.top().first].add_child(i);\n }\n s.push( make_pair(i,indent) );\n }\n\n /*\n for(int i=0;i<n;i++){\n cout << tree[i].name << endl;\n cout << tree[i].parent << endl;\n for(int c : tree[i].child)cout << c << \" \"; cout << endl;\n }\n */\n\n for(int i=0;i<m;i++){\n string my,your,query,dummy;\n cin >> your >> dummy >> dummy >> query >> dummy >> my;\n my = my.substr(0,my.size()-1);\n\n //cout << my << \" \" << your << \" \" << query << endl;\n\n bool f = false;\n if(query == \"child\")f = is_child(my,your);\n else if(query == \"parent\")f = is_par(my,your);\n else if(query == \"sibling\")f = is_sib(my,your);\n else if(query == \"ancestor\")f = is_anc(my,your);\n else f = is_des(my,your);\n\n if(f)cout << \"True\" << endl;\n else cout << \"False\" << endl;\n }\n cout << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":1420,"score_of_the_acc":-0.0079,"final_rank":9},{"submission_id":"aoj_1217_992599","code_snippet":"#include <algorithm>\n#include <sstream>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cassert>\n#include <functional>\n#include <iostream>\n#include <iomanip>\n#include <iterator>\n#include <map>\n#include <queue>\n#include <utility>\n#include <vector>\n\nusing namespace std;\n\ntypedef long long Long;\n#define whole(xs) xs.begin(), xs.end()\n\nstruct Q {\n string Relation, Name1, Name2;\n Q(const string& Relation, const string& Name1, const string& Name2) \n : Relation(Relation), Name1(Name1), Name2(Name2) {}\n};\nostream& operator<<(ostream& os, const Q& q) {\n os << \"(\" << q.Relation << \", \" << q.Name1 << \", \" << q.Name2 << \")\";\n return os;\n}\n\nint N, M;\nvector<int> Parent;\nvector<Q> Queries;\nmap<string, int> Id;\nvector<int> Prev;\n\nint CountPrefixSpaces(const string& s) {\n int i;\n for (i = 0; i < s.size() && s[i] == ' '; i++) ;\n return i;\n}\n\nbool input() {\n string l;\n getline(cin, l);\n istringstream is; is.str(l);\n is >> N >> M;\n is.clear();\n if (N == 0 && M == 0) return false;\n Parent.resize(N, -1);\n Queries.clear();\n Id.clear();\n Prev.resize(N, -1);\n for (int i = 0; i < N; i++) {\n getline(cin, l);\n is.str(l);\n string Name;\n is >> Name;\n is.clear();\n Id[Name] = i;\n int C = CountPrefixSpaces(l);\n Prev[C] = i;\n if (C != 0) {\n Parent[i] = Prev[C - 1];\n }\n }\n for (int i = 0; i < M; i++) {\n getline(cin, l);\n is.str(l);\n string Name1, Relation, Name2;\n string _;\n is >> Name1;\n for (int k = 0; k < 2; k++) is >> _;\n is >> Relation;\n is >> _;\n is >> Name2;\n Name2 = Name2.substr(0, Name2.size() - 1);\n is.clear();\n Queries.push_back(Q(Relation, Name1, Name2));\n }\n return true;\n}\n\nvoid solve() {\n for (int i = 0; i < M; i++) {\n string& Relation = Queries[i].Relation,\n Name1 = Queries[i].Name1,\n Name2 = Queries[i].Name2;\n int x = Id[Name1], y = Id[Name2];\n if (Relation == \"child\") {\n cout << (y == Parent[x] ? \"True\" : \"False\") << endl;\n } else if (Relation == \"parent\") {\n cout << (x == Parent[y] ? \"True\" : \"False\") << endl;\n } else if (Relation == \"sibling\") {\n cout << (Parent[x] == Parent[y] ? \"True\" : \"False\") << endl;\n } else if (Relation == \"descendant\") {\n while (x >= 0) {\n if (y == x) {\n cout << \"True\" << endl;\n goto fin1;\n }\n x = Parent[x];\n }\n cout << \"False\" << endl;\n fin1:;\n } else if (Relation == \"ancestor\") {\n while (y >= 0) {\n if (y == x) {\n cout << \"True\" << endl;\n goto fin2;\n }\n y = Parent[y];\n }\n cout << \"False\" << endl;\n fin2:;\n } else {\n assert(0);\n }\n }\n cout << endl;\n}\n\nint main() {\n while (input()) solve();\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1528,"score_of_the_acc":-0.0165,"final_rank":12},{"submission_id":"aoj_1217_902209","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <string>\n#include <sstream>\n#include <cstring>\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <numeric>\n#include <cctype>\n#include <tuple>\n\n#ifdef _MSC_VER\n#include <agents.h>\n#endif\n\n#define FOR(i, a, b) for(int i = (a); i < (int)(b); ++i)\n#define rep(i, n) FOR(i, 0, n)\n#define ALL(v) v.begin(), v.end()\n#define REV(v) v.rbegin(), v.rend()\n#define MEMSET(v, s) memset(v, s, sizeof(v))\n#define X first\n#define Y second\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int, int> P;\n\nint par[1010];\nint last[100];\nmap<string, int> name;\n\nbool check_ancestor(int a, int d){\n\tif (a < 0 || d < 0) return false;\n\tif (a == par[d]) return true;\n\treturn check_ancestor(a, par[d]);\n}\n\nint main(){\n\tint n, q;\n\twhile (cin >> n >> q, n|q){\n\t\tname.clear();\n\t\tMEMSET(last, -1);\n\t\tMEMSET(par, -1);\n\t\tcin.ignore();\n\t\trep(i, n){\n\t\t\tstring s;\n\t\t\tgetline(cin, s);\n\t\t\tint cnt = count(ALL(s), ' ');\n\t\t\tlast[cnt] = i;\n\t\t\tname[s.substr(cnt)] = i;\n\t\t\tif (!cnt) continue;\n\t\t\tpar[i] = last[cnt - 1];\n\t\t}\n\t\twhile (q--){\n\t\t\tstring a, b, c, d, e, f;\n\t\t\tcin >> a >> b >> c >> d >> e >> f;\n\t\t\t//cout << f.substr(0, f.size() - 1) << endl;\n\t\t\tint x = name[a], y = name[f.substr(0, f.size() - 1)];\n\t\t\tbool ok;\n\t\t\tswitch (d[0]){\n\t\t\tcase 'c':\n\t\t\t\tok = par[x] == y;\n\t\t\t\tbreak;\n\t\t\tcase 'a':\n\t\t\t\tok = check_ancestor(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 's':\n\t\t\t\tok = par[x] == par[y];\n\t\t\t\tbreak;\n\t\t\tcase 'p':\n\t\t\t\tok = x == par[y];\n\t\t\t\tbreak;\n\t\t\tcase 'd':\n\t\t\t\tok = check_ancestor(y, x);\n\t\t\t}\n\t\t\tcout << (ok ? \"True\" : \"False\") << endl;\n\t\t}\n\t\tcout << endl;\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1320,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_1217_786340","code_snippet":"#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<cstring>\n\nusing namespace std;\n\ntypedef pair<int,string> P;\n\n// family tree\nstruct Node{\n vector<Node*> child;\n Node* parent;\n string name;\n Node():name(\"\"){}\n Node(vector<Node*> c, Node* p, string s):child(c),parent(p),name(s){}\n\n void init(){\n for(int i = 0; i < (int)child.size(); i++)\n child[i]->init();\n child.clear();\n }\n\n bool isSibling(const string& A, const string& B){\n return find(A)->parent==find(B)->parent;\n }\n\n bool isChild(const string& A){\n for(int i = 0; i < (int)child.size(); i++)\n if(child[i]->name == A) return true;\n return false;\n }\n\n bool isDecendant(const string& A){\n for(int i = 0; i < (int)child.size(); i++)\n if(child[i]->name == A) return true;\n \n bool res = false;\n for(int i = 0; i < (int)child.size(); i++)\n res = res||child[i]->isDecendant(A);\n return res;\n }\n\n Node* find(const string& name){\n for(int i = 0; i < (int)child.size(); i++)\n if(child[i]->name == name) return child[i];\n\n for(int i = 0; i < (int)child.size(); i++){\n Node* tmp = child[i]->find(name);\n if(tmp != NULL) return tmp;\n }\n return NULL;\n }\n};\n\nint N,M;\nNode* top = new Node(vector<Node*>(), top, \"\");\n\nP devide(const string& s){\n int blank = 0;\n for(int i = 0; i < (int)s.length(); i++) if(s[i] == ' ') blank++;\n return P(blank,s.substr(blank));\n}\n\nvoid input(){\n cin.ignore();\n \n Node* now = top;\n int depth = -1;\n\n for(int i = 0; i < N; i++){\n string s;\n getline(cin,s);\n P p = devide(s);\n \n if(p.first == depth){\n Node* nex = new Node(vector<Node*>(), now->parent, p.second);\n ((now->parent)->child).push_back(nex);\n now = nex;\n }\n\n if(p.first < depth){\n // go up\n int diff = depth-p.first+1;\n for(int i = 0; i < diff; i++) now = now->parent;\n Node* nex = new Node(vector<Node*>(), now, p.second);\n now->child.push_back(nex);\n now = nex;\n depth = p.first;\n }\n \n if(p.first > depth){\n // go down\n Node* nex = new Node(vector<Node*>(), now, p.second);\n now->child.push_back(nex);\n now = nex;\n depth = p.first;\n }\n }\n}\n\nvoid solve(){\n\n for(int i = 0; i < M; i++){\n string X,Y,Q,trash;\n cin >> X >> trash >> trash >> Q >> trash >> Y;\n bool ans = false;\n Y = Y.substr(0,Y.length()-1);\n\n if(Q[0]=='c') ans = (top->find(Y))->isChild(X);\n if(Q[0]=='p') ans = (top->find(X))->isChild(Y);\n if(Q[0]=='s') ans = top->isSibling(X,Y);\n if(Q[0]=='d') ans = (top->find(Y))->isDecendant(X);\n if(Q[0]=='a') ans = (top->find(X))->isDecendant(Y);\n \n cout << (ans?\"True\":\"False\") << endl;\n }\n cout << endl;\n}\n\nint main(){\n \n while(cin >> N >> M && N+M){\n top->init();\n input();\n solve();\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1360,"score_of_the_acc":-0.0032,"final_rank":5},{"submission_id":"aoj_1217_781895","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <algorithm>\n#include <vector>\n#include <map>\n\nusing namespace std;\n\ntypedef pair<int, string> P;\n\nmap<string, P> fam;\n\nvector<string> s;\nvector<string> name;\nint N, Q;\n\nvoid output(){\n string op;\n for(int i = 0 ; i < Q ; i++){\n string relation, X, Y;\n for(int j = 0 ; j < 6 ; j++){\n cin >> op;\n if(j == 0) X = op;\n if(j == 3) relation = op;\n if(j == 5) Y = op;\n }\n Y.erase(Y.end()-1);\n \n if(relation == \"parent\"){\n relation = \"child\";\n swap(X, Y);\n }\n if(relation == \"descendant\"){\n relation = \"ancestor\";\n swap(X, Y);\n }\n \n bool ans = false;\n \n if(relation == \"child\"){\n ans = fam[X].second == Y;\n }\n else if(relation == \"ancestor\"){\n while(fam[Y].first != 0){\n\tif(fam[Y].second == X){\n\t ans = true;\n\t break;\n\t}\n\tY = fam[Y].second;\n }\n }\n else if(relation == \"sibling\"){\n int gen = fam[Y].first;\n string par = fam[Y].second;\n for(map<string, P>::iterator it = fam.begin() ; it != fam.end() ; it++){\n\tif(it->first == X){\n\t if(it->second.first == gen && it->second.second == par){\n\t ans = true;\n\t break;\n\t }\n\t}\n }\n }\n if(ans) cout << \"True\" << endl;\n else cout << \"False\" << endl;\n }\n}\n\nint main(){\n while(cin >> N >> Q, N|Q){\n fam.clear();\n s.clear();\n name.clear();\n cin.ignore();\n string tmp;\n for(int i = 0 ; i < N ; i++){\n getline(cin, tmp);\n s.push_back(tmp);\n }\n \n name = s;\n \n for(int i = 0 ; i < N ; i++){\n while(name[i][0] == ' ') name[i].erase(name[i].begin());\n }\n \n for(int i = 0 ; i < N ; i++){\n int gen = 0;\n for(int j = 0 ; j < (int)s[i].size() ; j++){\n\tif(s[i][j] != ' ') break;\n\tgen++;\n }\n for(int j = i ; j >= 0 ; j--){\n\tif(s[j][gen-1] != ' '){\n\t fam[ name[i] ] = P(gen, name[j]);\n\t break;\n\t}\n }\n }\n \n output();\n cout << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1536,"score_of_the_acc":-0.1838,"final_rank":15},{"submission_id":"aoj_1217_781894","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <algorithm>\n#include <vector>\n#include <map>\n\nusing namespace std;\n\ntypedef pair<int, string> P;\n\nmap<string, P> fam;\n\nvector<string> s;\nvector<string> name;\nint N, Q;\n\nvoid output(){\n string op;\n for(int i = 0 ; i < Q ; i++){\n string relation, X, Y;\n for(int j = 0 ; j < 6 ; j++){\n cin >> op;\n if(j == 0) X = op;\n if(j == 3) relation = op;\n if(j == 5) Y = op;\n }\n Y.erase(Y.end()-1);\n \n if(relation == \"parent\"){\n relation = \"child\";\n swap(X, Y);\n }\n if(relation == \"descendant\"){\n relation = \"ancestor\";\n swap(X, Y);\n }\n \n bool ans = false;\n \n if(relation == \"child\"){\n ans = fam[X].second == Y;\n }\n else if(relation == \"ancestor\"){\n while(fam[Y].first != 0){\n\tif(fam[Y].second == X){\n\t ans = true;\n\t break;\n\t}\n\tY = fam[Y].second;\n }\n }\n else if(relation == \"sibling\"){\n int gen = fam[Y].first;\n string par = fam[Y].second;\n for(map<string, P>::iterator it = fam.begin() ; it != fam.end() ; it++){\n\tif(it->first == X){\n\t if(it->second.first == gen && it->second.second == par){\n\t ans = true;\n\t break;\n\t }\n\t}\n }\n }\n if(ans) cout << \"True\" << endl;\n else cout << \"False\" << endl;\n }\n}\n\nint main(){\n while(cin >> N >> Q, N|Q){\n fam.clear();\n s.clear();\n name.clear();\n cin.ignore();\n string tmp;\n for(int i = 0 ; i < N ; i++){\n getline(cin, tmp);\n s.push_back(tmp);\n }\n \n name = s;\n \n for(int i = 0 ; i < N ; i++){\n while(name[i][0] == ' ') name[i].erase(name[i].begin());\n /*\n for(int j = 0 ; j < (int)name[i].size() ; j++){\n\tif(name[i][j] == ' ') name[i].erase(name[i].begin()+j);\n }\n */\n }\n \n for(int i = 0 ; i < N ; i++){\n int gen = 0;\n for(int j = 0 ; j < (int)s[i].size() ; j++){\n\tif(s[i][j] != ' ') break;\n\tgen++;\n }\n for(int j = i ; j >= 0 ; j--){\n\tif(s[j][gen-1] != ' '){\n\t fam[ name[i] ] = P(gen, name[j]);\n\t break;\n\t}\n }\n }\n \n output();\n cout << endl;\n /*\n for(map<string, P>::iterator it = fam.begin() ; it != fam.end() ; it++){\n cout << it->first << ' ' << it->second.first << ' ' << it->second.second << endl;\n }\n */\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1536,"score_of_the_acc":-0.1838,"final_rank":15},{"submission_id":"aoj_1217_585866","code_snippet":"#include<map>\n#include<sstream>\n#include<cstdlib>\n#include<vector>\n#include<algorithm>\n#include<iostream>\n#include<cassert>\n#define F first\n#define S second\n#define pb push_back\n#define all(n) n.begin(),n.end()\nusing namespace std;\ntypedef pair<string,int> SI;\n \nint oldest,youngest;\n \nvoid split(vector<SI>& vec,string line)\n{\n int space_cnt = 0;\n for(int i=0;line[i] == ' ';i++,space_cnt++){}\n \n vec.push_back(SI(line.substr(space_cnt,line.size()-space_cnt),space_cnt));\n oldest = min(oldest,space_cnt);\n youngest = max(youngest,space_cnt);\n}\n \nvoid ParseAndSolve(vector<SI>& vec,map<string,int>& index_tree,string line)\n{\n vector<string> info;\n stringstream ss(line);\n string mid;\n vector<string> ope; \n \n \n for(int i=0;i<ss.str().size();i++)\n {\n if((ss >> mid).fail())\n goto skip;\n \n ope.push_back(mid);\n \n }\n \n skip:\n \n info.push_back(ope[0]);\n for(int i=1;i<ope.size()-1;i++)\n {\n if(ope[i] == \"child\" || ope[i] == \"parent\" || ope[i] == \"sibling\" || ope[i] == \"descendant\" || ope[i] == \"ancestor\")\n {\n info.push_back(ope[i]);\n break;\n }\n }\n info.push_back(ope[ope.size()-1].substr(0,ope[ope.size()-1].size()));\n \n \n assert(info.size() == 3);\n \n string X,Y;\n X = info[0],Y = info[2];\n \n if(info[1][0] == 'c')\n {\n int Yindex = index_tree[Y]; \n int Xindex = index_tree[X];\n \n if(vec[Xindex].S <= vec[Yindex].S || Yindex+1 >= vec.size() || vec[Yindex+1].S != vec[Xindex].S)\n {\n cout << \"False\" << endl;\n return;\n }\n \n \n int parent_level = vec[Yindex].S;\n \n for(int i=Yindex+1;parent_level < vec[i].S && i < vec.size();i++)\n {\n \n if(vec[i].F == X)\n {\n cout << \"True\" << endl;\n return;\n }\n }\n \n cout << \"False\" << endl;\n return;\n }\n else if(info[1][0] == 'p')\n {\n \n int Xindex = index_tree[X];\n int Yindex = index_tree[Y];\n \n if(vec[Xindex].S >= vec[Yindex].S || Xindex+1 >= vec.size() || vec[Xindex+1].S != vec[Yindex].S )\n {\n cout << \"False\" << endl;\n return;\n }\n \n \n int parent_level = vec[Xindex].S;\n \n for(int i=Xindex+1;parent_level < vec[i].S && i < vec.size();i++ )\n {\n if(vec[i].F == Y)\n {\n cout << \"True\" << endl;\n return;\n }\n }\n \n cout << \"False\" << endl;\n return;\n \n \n }\n else if(info[1][0] == 's')\n {\n int Xindex = index_tree[X];\n int Yindex = index_tree[Y];\n \n if(vec[Xindex].S != vec[Yindex].S || min(Xindex,Yindex)+1 >= vec.size())\n {\n cout << \"False\" << endl;\n return;\n }\n \n int sibling_level = vec[Xindex].S;\n \n int Maxindex,Minindex;\n string Maxname,Minname;\n \n if(Xindex > Yindex)\n {\n Maxindex = Xindex,Minindex = Yindex;\n Maxname = X,Minname = Y;\n }\n else\n {\n Maxindex = Yindex,Minindex = Xindex;\n Maxname = Y,Minname = X;\n }\n \n for(int i=Minindex+1;i<vec.size() && sibling_level <= vec[i].S;i++)\n {\n if(Maxname == vec[i].F)\n {\n cout << \"True\" << endl;\n return;\n }\n }\n cout << \"False\" << endl;\n return;\n \n }\n else if(info[1][0] == 'd')\n {\n int Xindex = index_tree[X];\n int Yindex = index_tree[Y];\n \n if(Yindex+1 >= vec.size() || vec[Xindex].S <= vec[Yindex].S)\n {\n cout << \"False\" << endl;\n return;\n }\n \n for(int i=Yindex+1;i<vec.size() && vec[i].S > vec[Yindex].S;i++)\n {\n if(vec[i].F == vec[Xindex].F)\n {\n cout << \"True\" << endl;\n return;\n }\n }\n \n cout << \"False\" << endl;\n return;\n }\n else if(info[1][0] == 'a')\n {\n int Xindex = index_tree[X];\n int Yindex = index_tree[Y];\n if(Xindex+1 >= vec.size() || vec[Xindex].S >= vec[Yindex].S)\n {\n cout << \"False\" << endl;\n return;\n }\n \n for(int i=Xindex+1;i < vec.size() && vec[i].S > vec[Xindex].S;i++)\n {\n if(vec[i].F == vec[Yindex].F)\n {\n cout << \"True\" << endl;\n return;\n }\n }\n \n cout << \"False\" << endl;\n return;\n }\n else\n assert(false);\n \n \n}\n \nint main()\n{\n int n,m;\n while(true)\n {\n cin >> n >> m;\n \n if(!(n+m))\n break;\n oldest = (1<<28);\n youngest = -1;\n cin.ignore();\n string line;\n vector<SI> vec;\n for(int i=0;i<n;i++)\n {\n getline(cin,line);\n \n split(vec,line);\n }\n \n map<string,int> index_tree;\n for(int i=0;i<n;i++)\n index_tree[vec[i].F] = i;\n \n for(int i=0;i<m;i++)\n {\n getline(cin,line);\n \n ParseAndSolve(vec,index_tree,line.substr(0,line.size()-1));\n \n }\n \n cout << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1360,"score_of_the_acc":-0.0032,"final_rank":5},{"submission_id":"aoj_1217_585862","code_snippet":"#include<map>\n#include<sstream>\n#include<cstdlib>\n#include<vector>\n#include<algorithm>\n#include<iostream>\n#include<cassert>\n#define F first\n#define S second\n#define pb push_back\n#define all(n) n.begin(),n.end()\nusing namespace std;\ntypedef pair<string,int> SI;\n\nint oldest,youngest;\n\nvoid split(vector<SI>& vec,string line)\n{\n int space_cnt = 0;\n for(int i=0;line[i] == ' ';i++,space_cnt++){}\n\n vec.push_back(SI(line.substr(space_cnt,line.size()-space_cnt),space_cnt));\n oldest = min(oldest,space_cnt);\n youngest = max(youngest,space_cnt);\n}\n\nvoid ParseAndSolve(vector<SI>& vec,map<string,int>& index_tree,string line)\n{\n vector<string> info;\n stringstream ss(line);\n string mid;\n vector<string> ope; \n \n\n for(int i=0;i<ss.str().size();i++)\n {\n if((ss >> mid).fail())\n\tgoto skip;\n \n ope.push_back(mid);\n \n }\n\n skip:\n\n info.push_back(ope[0]);\n for(int i=1;i<ope.size()-1;i++)\n {\n if(ope[i] == \"child\" || ope[i] == \"parent\" || ope[i] == \"sibling\" || ope[i] == \"descendant\" || ope[i] == \"ancestor\")\n\t{\n\t info.push_back(ope[i]);\n\t break;\n\t}\n }\n info.push_back(ope[ope.size()-1].substr(0,ope[ope.size()-1].size()));\n\n\n assert(info.size() == 3);\n\n string X,Y;\n X = info[0],Y = info[2];\n\n if(info[1][0] == 'c')\n {\n int Yindex = index_tree[Y]; \n int Xindex = index_tree[X];\n\n if(vec[Xindex].S <= vec[Yindex].S || Yindex+1 >= vec.size() || vec[Yindex+1].S != vec[Xindex].S)\n\t{\n\t cout << \"False\" << endl;\n\t return;\n\t}\n\n \n int parent_level = vec[Yindex].S;\n\n for(int i=Yindex+1;parent_level < vec[i].S && i < vec.size();i++)\n\t{\n\n\t if(vec[i].F == X)\n\t {\n\t cout << \"True\" << endl;\n\t return;\n\t }\n\t}\n\n cout << \"False\" << endl;\n return;\n }\n else if(info[1][0] == 'p')\n {\n\n int Xindex = index_tree[X];\n int Yindex = index_tree[Y];\n\n if(vec[Xindex].S >= vec[Yindex].S || Xindex+1 >= vec.size() || vec[Xindex+1].S != vec[Yindex].S )\n\t{\n\t cout << \"False\" << endl;\n\t return;\n\t}\n\n\n int parent_level = vec[Xindex].S;\n\n for(int i=Xindex+1;parent_level < vec[i].S && i < vec.size();i++ )\n\t{\n\t if(vec[i].F == Y)\n\t {\n\t cout << \"True\" << endl;\n\t return;\n\t }\n\t}\n\n cout << \"False\" << endl;\n return;\n\n\n }\n else if(info[1][0] == 's')\n {\n int Xindex = index_tree[X];\n int Yindex = index_tree[Y];\n\n if(vec[Xindex].S != vec[Yindex].S || min(Xindex,Yindex)+1 >= vec.size())\n\t{\n\t cout << \"False\" << endl;\n\t return;\n\t}\n\n int sibling_level = vec[Xindex].S;\n\n int Maxindex,Minindex;\n string Maxname,Minname;\n\n if(Xindex > Yindex)\n\t{\n\t Maxindex = Xindex,Minindex = Yindex;\n\t Maxname = X,Minname = Y;\n\t}\n else \n\t{\n\t Maxindex = Yindex,Minindex = Xindex;\n\t Maxname = Y,Minname = X;\n\t}\n\n for(int i=Minindex+1;i<vec.size() && sibling_level <= vec[i].S;i++)\n\t{\n\t if(Maxname == vec[i].F)\n\t {\n\t cout << \"True\" << endl;\n\t return;\n\t }\n\t}\n cout << \"False\" << endl;\n return;\n\n }\n else if(info[1][0] == 'd')\n {\n int Xindex = index_tree[X];\n int Yindex = index_tree[Y];\n\n if(Yindex+1 >= vec.size() || vec[Xindex].S <= vec[Yindex].S)\n\t{\n\t cout << \"False\" << endl;\n\t return;\n\t}\n\n for(int i=Yindex+1;i<vec.size() && vec[i].S > vec[Yindex].S;i++)\n\t{\n\t if(vec[i].F == vec[Xindex].F)\n\t {\n\t cout << \"True\" << endl;\n\t return;\n\t }\n\t}\n\n cout << \"False\" << endl;\n return;\n }\n else if(info[1][0] == 'a')\n {\n int Xindex = index_tree[X];\n int Yindex = index_tree[Y];\n if(Xindex+1 >= vec.size() || vec[Xindex].S >= vec[Yindex].S)\n\t{\n\t cout << \"False\" << endl;\n\t return;\n\t}\n\n for(int i=Xindex+1;i < vec.size() && vec[i].S > vec[Xindex].S;i++)\n\t{\n\t if(vec[i].F == vec[Yindex].F)\n\t {\n\t cout << \"True\" << endl;\n\t return;\n\t }\n\t}\n\n cout << \"False\" << endl;\n return;\n }\n else \n assert(false);\n \n\n}\n\nint main()\n{\n int n,m;\n while(true)\n {\n cin >> n >> m;\n \n if(!(n+m))\n\tbreak;\n oldest = (1<<28);\n youngest = -1;\n cin.ignore();\n string line;\n vector<SI> vec;\n for(int i=0;i<n;i++)\n\t{\n\t getline(cin,line);\n\t\n\t split(vec,line);\n\t}\n\n map<string,int> index_tree;\n for(int i=0;i<n;i++)\n\tindex_tree[vec[i].F] = i;\n\n for(int i=0;i<m;i++)\n\t{\n\t getline(cin,line);\n\t \n\t ParseAndSolve(vec,index_tree,line.substr(0,line.size()-1));\n\t \n\t}\n\n cout << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1360,"score_of_the_acc":-0.0032,"final_rank":5},{"submission_id":"aoj_1217_585857","code_snippet":"#include<map>\n#include<sstream>\n#include<cstdlib>\n#include<vector>\n#include<algorithm>\n#include<iostream>\n#include<cassert>\n#define F first\n#define S second\n#define pb push_back\n#define all(n) n.begin(),n.end()\nusing namespace std;\ntypedef pair<string,int> SI;\n\nint oldest,youngest;\n\nvoid split(vector<SI>& vec,string line)\n{\n int space_cnt = 0;\n for(int i=0;line[i] == ' ';i++,space_cnt++){}\n\n vec.push_back(SI(line.substr(space_cnt,line.size()-space_cnt),space_cnt));\n oldest = min(oldest,space_cnt);\n youngest = max(youngest,space_cnt);\n}\n\nvoid ParseAndSolve(vector<SI>& vec,map<string,int>& index_tree,map<int,vector<string> >& space_tree,map<string,int>& level_tree,string line)\n{\n vector<string> info;\n stringstream ss(line);\n string mid;\n vector<string> ope; \n \n\n for(int i=0;i<ss.str().size();i++)\n {\n if((ss >> mid).fail())\n\tgoto skip;\n \n ope.push_back(mid);\n \n }\n\n skip:\n\n info.push_back(ope[0]);\n for(int i=1;i<ope.size()-1;i++)\n {\n if(ope[i] == \"child\" || ope[i] == \"parent\" || ope[i] == \"sibling\" || ope[i] == \"descendant\" || ope[i] == \"ancestor\")\n\t{\n\t info.push_back(ope[i]);\n\t break;\n\t}\n }\n info.push_back(ope[ope.size()-1].substr(0,ope[ope.size()-1].size()));\n\n\n assert(info.size() == 3);\n\n string X,Y;\n X = info[0],Y = info[2];\n\n if(info[1][0] == 'c')\n {\n int Yindex = index_tree[Y]; \n int Xindex = index_tree[X];\n\n if(level_tree[X] <= level_tree[Y] || Yindex+1 >= vec.size() || vec[Yindex+1].S != vec[Xindex].S)\n\t{\n\t cout << \"False\" << endl;\n\t return;\n\t}\n\n \n int parent_level = vec[Yindex].S;\n\n for(int i=Yindex+1;parent_level < vec[i].S && i < vec.size();i++)\n\t{\n\n\t if(vec[i].F == X)\n\t {\n\t cout << \"True\" << endl;\n\t return;\n\t }\n\t}\n\n cout << \"False\" << endl;\n return;\n }\n else if(info[1][0] == 'p')\n {\n\n int Xindex = index_tree[X];\n int Yindex = index_tree[Y];\n\n if(level_tree[X] >= level_tree[Y] || Xindex+1 >= vec.size() || vec[Xindex+1].S != vec[Yindex].S )\n\t{\n\t cout << \"False\" << endl;\n\t return;\n\t}\n\n\n int parent_level = vec[Xindex].S;\n\n for(int i=Xindex+1;parent_level < vec[i].S && i < vec.size();i++ )\n\t{\n\t if(vec[i].F == Y)\n\t {\n\t cout << \"True\" << endl;\n\t return;\n\t }\n\t}\n\n cout << \"False\" << endl;\n return;\n\n\n }\n else if(info[1][0] == 's')\n {\n int Xindex = index_tree[X];\n int Yindex = index_tree[Y];\n\n if(vec[Xindex].S != vec[Yindex].S || min(Xindex,Yindex)+1 >= vec.size())\n\t{\n\t cout << \"False\" << endl;\n\t return;\n\t}\n\n int sibling_level = vec[Xindex].S;\n\n int Maxindex,Minindex;\n string Maxname,Minname;\n\n if(Xindex > Yindex)\n\t{\n\t Maxindex = Xindex,Minindex = Yindex;\n\t Maxname = X,Minname = Y;\n\t}\n else \n\t{\n\t Maxindex = Yindex,Minindex = Xindex;\n\t Maxname = Y,Minname = X;\n\t}\n\n for(int i=Minindex+1;i<vec.size() && sibling_level <= vec[i].S;i++)\n\t{\n\t if(Maxname == vec[i].F)\n\t {\n\t cout << \"True\" << endl;\n\t return;\n\t }\n\t}\n cout << \"False\" << endl;\n return;\n\n }\n else if(info[1][0] == 'd')\n {\n int Xindex = index_tree[X];\n int Yindex = index_tree[Y];\n\n if(Yindex+1 >= vec.size() || vec[Xindex].S <= vec[Yindex].S)\n\t{\n\t cout << \"False\" << endl;\n\t return;\n\t}\n\n for(int i=Yindex+1;i<vec.size() && vec[i].S > vec[Yindex].S;i++)\n\t{\n\t if(vec[i].F == vec[Xindex].F)\n\t {\n\t cout << \"True\" << endl;\n\t return;\n\t }\n\t}\n\n cout << \"False\" << endl;\n return;\n }\n else if(info[1][0] == 'a')\n {\n int Xindex = index_tree[X];\n int Yindex = index_tree[Y];\n if(Xindex+1 >= vec.size() || vec[Xindex].S >= vec[Yindex].S)\n\t{\n\t cout << \"False\" << endl;\n\t return;\n\t}\n\n for(int i=Xindex+1;i < vec.size() && vec[i].S > vec[Xindex].S;i++)\n\t{\n\t if(vec[i].F == vec[Yindex].F)\n\t {\n\t cout << \"True\" << endl;\n\t return;\n\t }\n\t}\n\n cout << \"False\" << endl;\n return;\n }\n else \n assert(false);\n \n\n}\n\nint main()\n{\n int n,m;\n while(true)\n {\n cin >> n >> m;\n //cerr << n << \" \" << m << endl;\n if(!(n+m))\n\tbreak;\n oldest = (1<<28);\n youngest = -1;\n cin.ignore();\n string line;\n vector<SI> vec;\n for(int i=0;i<n;i++)\n\t{\n\t getline(cin,line);\n\t //cerr << line << endl;\n\t split(vec,line);\n\t}\n\n map<int,vector<string> > space_tree;\n map<string,int> level_tree;\n map<string,int> index_tree;\n for(int i=0;i<n;i++)\n\t{\n\t index_tree[vec[i].F] = i;\n\t level_tree[vec[i].F] = vec[i].S;\n\t space_tree[vec[i].S].pb(vec[i].F);\n\t}\n\n for(int i=0;i<m;i++)\n\t{\n\t getline(cin,line);\n\t //cerr << line << endl;\n\t ParseAndSolve(vec,index_tree,space_tree,level_tree,line.substr(0,line.size()-1));\n\t \n\t}\n\n cout << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1428,"score_of_the_acc":-0.0086,"final_rank":10},{"submission_id":"aoj_1217_561684","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <string>\n#include <map>\nusing namespace std;\n\n\nstruct Person {\n string name;\n Person *parent;\n};\n\nconst int MAXN = 1005;\nint N, M;\nmap<string, Person*> conv;\nPerson root, person[MAXN];\n\nvoid init() {\n conv.clear();\n root.name = \"root\";\n root.parent = NULL;\n}\n\nbool child(Person *a, Person *b) { // a is child of b\n return a->parent == b;\n}\n\nbool sibling(Person *a, Person *b) {\n return a->parent == b->parent;\n}\n\nbool descendant(Person *a, Person *b) { // a is descendant of b\n while(a != NULL) {\n if(a->parent == b) return true;\n a = a->parent;\n }\n return false;\n}\n\nint main() {\n while(cin >> N >> M && (N|M)) {\n cin.ignore();\n init();\n Person *cp = &root;\n int depth = -1;\n for(int i = 0; i < N; ++i) {\n string line;\n getline(cin, line);\n int sp = 0;\n for(int j = 0; j < line.size() && line[j] == ' '; ++j, ++sp);\n\n Person &c = person[i];\n c.name = line.substr(sp);\n conv[c.name] = &person[i];\n\n if(sp > depth) {\n c.parent = cp;\n } else {\n for(int j = 0; j < depth-sp; ++j) {\n cp = cp->parent;\n }\n c.parent = cp->parent;\n }\n cp = &c;\n depth = sp;\n }\n\n while(M--) {\n string x, y, type;\n string dumy;\n cin >> x >> dumy >> dumy >> type >> dumy >> y;\n y = y.substr(0, y.size()-1);\n bool output = false;\n if(0) {\n } else if(type == \"child\") {\n output = child(conv[x], conv[y]);\n } else if(type == \"parent\") {\n output = child(conv[y], conv[x]);\n } else if(type == \"sibling\") {\n output = sibling(conv[x], conv[y]);\n } else if(type == \"descendant\") {\n output = descendant(conv[x], conv[y]);\n } else if(type == \"ancestor\") {\n output = descendant(conv[y], conv[x]);\n }\n cout << (output ? \"True\" : \"False\") << endl;\n }\n cout << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1344,"score_of_the_acc":-0.1686,"final_rank":14},{"submission_id":"aoj_1217_539282","code_snippet":"#include <vector>\n#include <list>\n#include <map>\n#include <set>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <algorithm>\n#include <utility>\n#include <functional>\n#include <sstream>\n#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <cstdlib>\n#include <cctype>\n#include <string>\n#include <cstring>\n#include <ctime>\n#include <climits>\n#include <cassert>\nusing namespace std;\ninline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}\ntemplate<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<string> vs;\ntypedef pair<int, int> pii;\ntypedef long long ll;\n#define ALL(a) (a).begin(),(a).end()\n#define RALL(a) (a).rbegin(),(a).rend()\n#define EXIST(s,e) ((s).find(e)!=(s).end())\n#define FOR(i,a,b) for(int i=(a);i<(b);++i)\n#define REP(i,n) FOR(i,0,n)\n#define EACH(t,i,c) for(t::iterator i=(c).begin(); i!=(c).end(); ++i)\nconst double EPS = 1e-10;\nconst double PI = acos(-1.0);\n\nstruct person{\n\tvector<person> children;\n\tstring name;\n\tperson(string name):name(name){}\n\tint construct(vs &names,int indent,int index){\n\t\tFOR(i,index,names.size()){\n\t\t\tint next_indent=count(ALL(names[i]),' ');\n\t\t\tif(next_indent==indent+1){\n\t\t\t\tstring next_name=names[i];\n\t\t\t\tnext_name.erase(next_name.begin(),next_name.begin()+next_indent);\n\t\t\t\tchildren.push_back(person(next_name));\n\t\t\t}else if(next_indent>indent+1){\n\t\t\t\ti=children[children.size()-1].construct(names,indent+1,i)-1;\n\t\t\t}else{\n\t\t\t\treturn i;\n\t\t\t}\n\t\t}\n\t\treturn names.size();\n\t}\n\tbool is_child(string a,string b){\n\t\tif(name==b){\n\t\t\tREP(i,children.size()){\n\t\t\t\tif(children[i].name==a){\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\t\tREP(i,children.size()){\n\t\t\tif(children[i].is_child(a,b)){\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\tbool is_descendant(string a,string b,bool flag=false){\n\t\tif(flag&&name==a){\n\t\t\treturn true;\n\t\t}\n\t\tif(name==b||flag){\n\t\t\tREP(i,children.size()){\n\t\t\t\tif(children[i].is_descendant(a,b,true)){\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\t\tREP(i,children.size()){\n\t\t\tif(children[i].is_descendant(a,b)){\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\tbool is_parent(string a,string b){\n\t\tif(name==a){\n\t\t\tREP(i,children.size()){\n\t\t\t\tif(children[i].name==b){\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\t\tREP(i,children.size()){\n\t\t\tif(children[i].is_parent(a,b)){\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\tbool is_ancestor(string a,string b,bool flag=false){\n\t\tif(flag&&name==b){\n\t\t\treturn true;\n\t\t}\n\t\tif(name==a||flag){\n\t\t\tREP(i,children.size()){\n\t\t\t\tif(children[i].is_ancestor(a,b,true)){\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\t\tREP(i,children.size()){\n\t\t\tif(children[i].is_ancestor(a,b)){\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\tbool is_sibling(string a,string b){\n\t\tbool flag=false;\n\t\tREP(i,children.size()){\n\t\t\tif(children[i].name==a||children[i].name==b){\n\t\t\t\tif(flag){\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t\tflag=true;\n\t\t\t}\n\t\t}\n\t\tREP(i,children.size()){\n\t\t\tif(children[i].is_sibling(a,b)){\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n};\n\nint main(){\n\tint n,m;\n\twhile(cin>>n>>m,n&&m){\n\t\tstring name;\n\t\tgetline(cin,name);\n\t\tgetline(cin,name);\n\t\tperson root=person(name);\n\t\tvs names;\n\t\tREP(i,n-1){\n\t\t\tgetline(cin,name);\n\t\t\tnames.push_back(name);\n\t\t}\n\t\tint index=0;\n\t\troot.construct(names,0,index);\n\t\tREP(i,m){\n\t\t\tstring a,b,rel,trash;\n\t\t\tcin>>a>>trash>>trash>>rel>>trash>>b;\n\t\t\tbool ok;\n\t\t\tb.erase(b.end()-1,b.end());\n\t\t\tif(rel==\"child\"){\n\t\t\t\tok=root.is_child(a,b);\n\t\t\t}else if(rel==\"parent\"){\n\t\t\t\tok=root.is_parent(a,b);\n\t\t\t}else if(rel==\"ancestor\"){\n\t\t\t\tok=root.is_ancestor(a,b);\n\t\t\t}else if(rel==\"descendant\"){\n\t\t\t\tok=root.is_descendant(a,b);\n\t\t\t}else if(rel==\"sibling\"){\n\t\t\t\tok=root.is_sibling(a,b);\n\t\t\t}else{\n\t\t\t\tassert(0);\n\t\t\t}\n\t\t\tcout<<(ok?\"True\":\"False\")<<endl;\n\t\t}\n\t\tcout<<endl;\n\n\t}\n}","accuracy":1,"time_ms":30,"memory_kb":1460,"score_of_the_acc":-0.3444,"final_rank":17},{"submission_id":"aoj_1217_521468","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<queue>\n#include<deque>\n#include<map>\n#include<set>\n#include<string>\n#include<sstream>\n#include<cstdio>\n#include<cmath>\n#include<cstring>\n#include<cctype>\n#include<climits>\nusing namespace std;\n#define REP(i, j) for(int i = 0; i < j; i++)\n#define FOR(i, j, k) for(int i = j; i < k; i++)\n#define P pair<int, string>\nconst int INF = INT_MAX / 2;\nconst int MAX_M = 1010;\n\nP cntSpace(string str){\n int cnt = 0;\n while(str[cnt] == ' ') cnt++;\n return P(cnt, str.substr(cnt));\n}\n\nbool isParent(int x, int y, vector<int> parent){\n if(parent[y] == x) return true;\n else return false;\n}\n\nbool checkQ(string str, map<string, int> list_i, vector<int> parent){\n stringstream ss(str);\n vector<string> vec;\n string tmp;\n while(ss >>tmp) vec.push_back(tmp);\n\n int x = list_i[vec[0]];\n int y = list_i[vec[5].erase(vec[5].size() - 1)];\n\n if(vec[3] == \"child\") return isParent(y, x, parent);\n if(vec[3] == \"parent\") return isParent(x, y, parent);\n if(vec[3] == \"sibling\") return parent[x] == parent[y];\n if(vec[3] == \"descendant\"){\n int now_x = x;\n while(parent[now_x] != -1){\n if(isParent(y, now_x, parent) == true) return true;\n now_x = parent[now_x];\n }\n return false;\n }\n if(vec[3] == \"ancestor\"){\n int now_y = y;\n while(parent[now_y] != -1){\n if(isParent(x, now_y, parent) == true) return true;\n now_y = parent[now_y];\n }\n return false;\n }\n}\n\n\n\nint main(){\n int m, n;\n while(cin >>m >>n && (n && m)){\n string name_line;\n getline(cin, name_line);\n\n vector<int> parent(m);\n int current_parent_i[MAX_M];\n map<string, int> list_i;\n\n parent[0] = -1;\n\n REP(i, m){\n getline(cin, name_line);\n\n P rank_and_name = cntSpace(name_line);\n current_parent_i[rank_and_name.first + 1] = i;\n list_i[rank_and_name.second] = i;\n\n if(i != 0){\n int now_parent = current_parent_i[rank_and_name.first];\n parent[i] = now_parent;\n }\n }\n\n REP(i, n){\n string q;\n getline(cin, q);\n bool ans = checkQ(q, list_i, parent);\n if(ans) cout <<\"True\" <<endl;\n else cout <<\"False\" <<endl;\n }\n cout <<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":1432,"score_of_the_acc":-1.0089,"final_rank":19},{"submission_id":"aoj_1217_521127","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<queue>\n#include<deque>\n#include<map>\n#include<set>\n#include<string>\n#include<sstream>\n#include<cstdio>\n#include<cmath>\n#include<cstring>\n#include<cctype>\n#include<climits>\nusing namespace std;\n#define REP(i, j) for(int i = 0; i < j; i++)\n#define FOR(i, j, k) for(int i = j; i < k; i++)\n#define P pair<int, string>\nconst int INF = INT_MAX / 2;\nconst int MAX_M = 1010;\n\nP cntSpace(string str){\n int cnt = 0;\n while(str[cnt] == ' ') cnt++;\n return P(cnt, str.substr(cnt));\n}\n\nbool isParent(int x, int y, vector<int> parent){\n if(parent[y] == x) return true;\n else return false;\n}\n\nbool checkQ(string str, map<string, int> list_i, vector<int> parent){\n stringstream ss(str);\n vector<string> vec;\n string tmp;\n while(ss >>tmp) vec.push_back(tmp);\n\n int x = list_i[vec[0]];\n int y = list_i[vec[5].erase(vec[5].size() - 1)];\n\n if(vec[3] == \"child\") return isParent(y, x, parent);\n if(vec[3] == \"parent\") return isParent(x, y, parent);\n if(vec[3] == \"sibling\") return parent[x] == parent[y];\n if(vec[3] == \"descendant\"){\n int now_x = x;\n while(parent[now_x] != -1){\n if(isParent(y, now_x, parent) == true) return true;\n now_x = parent[now_x];\n }\n return false;\n }\n if(vec[3] == \"ancestor\"){\n int now_y = y;\n while(parent[now_y] != -1){\n if(isParent(x, now_y, parent) == true) return true;\n now_y = parent[now_y];\n }\n return false;\n }\n}\n\n\n\nint main(){\n while(true){\n string str_m_n;\n getline(cin, str_m_n);\n stringstream ss(str_m_n);\n int m, n;\n ss >>m >>n;\n if(!m && !n) break;\n\n vector<int> parent(m);\n int current_parent_i[MAX_M];\n map<string, int> list_i;\n\n parent[0] = -1;\n\n REP(i, m){\n string name_line;\n getline(cin, name_line);\n stringstream ss(name_line);\n P rank_and_name = cntSpace(name_line);\n current_parent_i[rank_and_name.first + 1] = i;\n list_i[rank_and_name.second] = i;\n if(i != 0){\n int now_parent = current_parent_i[rank_and_name.first];\n parent[i] = now_parent;\n }\n }\n\n REP(i, n){\n string q;\n getline(cin, q);\n bool ans = checkQ(q, list_i, parent);\n if(ans) cout <<\"True\" <<endl;\n else cout <<\"False\" <<endl;\n }\n cout <<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":1432,"score_of_the_acc":-1.0089,"final_rank":19}],"string":"[\n {\n \"submission_id\": \"aoj_1217_2170790\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint dep[100010];\\nint par[100010][19];\\nvector<int> g[100010];\\nvoid dfs(int v,int u,int d){\\n dep[v]=d;\\n for(int i=0; i<g[v].size(); i++){\\n int w=g[v][i];if(w==u) continue;\\n par[w][0]=v;dfs(w,v,d+1);\\n }\\n}\\nint lcp(int a,int b){\\n if(dep[a]<dep[b]) swap(a,b);\\n for(int i=0; i<19; i++){\\n if((dep[a]-dep[b])&(1<<i)) a=par[a][i];\\n }\\n if(a==b) return a;\\n for(int i=18;i>=0;i--){\\n if(par[a][i]!=par[b][i]) a=par[a][i],b=par[b][i];\\n }\\n return par[a][0];\\n}\\nint n,m;\\nvoid init() {\\n memset(par,0,sizeof(par));\\n dfs(0,-1,0);\\n for(int i=0; i<18; i++)for(int j=0; j<n; j++) par[j][i+1]=par[par[j][i]][i];\\n}\\n\\nstring r[111111];\\nint main() {\\n while(cin >> n >> m && n) {\\n for(int i=0; i<n; i++) g[i].clear();\\n string s;\\n getline(cin,s);\\n map<string,int> ma;\\n for(int i=0; i<n; i++) {\\n getline(cin,s);\\n stringstream ss;\\n string t;\\n ss << s;\\n ss >> t;\\n ma[t]=i;\\n int c=0;\\n for(int j=0; j<s.size(); j++) {\\n if(s[j]==' ') c++;\\n else break;\\n }\\n if(c) {\\n g[ma[t]].push_back(ma[r[c-1]]);\\n g[ma[r[c-1]]].push_back(ma[t]);\\n }\\n r[c]=t;\\n }\\n init();\\n while(m--) {\\n getline(cin,s);\\n stringstream ss;\\n ss << s;\\n string x,y,z;\\n ss >> x;\\n ss >> z;ss >> z;ss >> z;\\n ss >> y;ss >> y;\\n y=y.substr(0,y.size()-1);\\n int xx=ma[x],yy=ma[y];\\n bool f=0;\\n if(z==\\\"parent\\\") {\\n if(lcp(xx,yy)==xx&&dep[yy]-dep[xx]==1) f=1;\\n } else if(z==\\\"child\\\") {\\n if(lcp(xx,yy)==yy&&dep[xx]-dep[yy]==1) f=1;\\n } else if(z==\\\"sibling\\\") {\\n if(dep[xx]==dep[yy]&&dep[xx]-dep[lcp(xx,yy)]==1) f=1;\\n } else if(z==\\\"descendant\\\") {\\n if(lcp(xx,yy)==yy&&dep[xx]-dep[yy]>=1) f=1;\\n } else {\\n if(lcp(xx,yy)==xx&&dep[yy]-dep[xx]>=1) f=1;\\n }\\n if(f) cout << \\\"True\\\" << endl;\\n else cout << \\\"False\\\" << endl;\\n }\\n cout << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 13916,\n \"score_of_the_acc\": -1,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1217_2065883\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\nusing ld = long double;\\nconst ld eps = 1e-9;\\n\\n//// < \\\"d:\\\\d_download\\\\visual studio 2015\\\\projects\\\\programing_contest_c++\\\\debug\\\\a.txt\\\" > \\\"d:\\\\d_download\\\\visual studio 2015\\\\projects\\\\programing_contest_c++\\\\debug\\\\b.txt\\\"\\n\\nstruct tree {\\n\\tstring name;\\n\\tint depth;\\n\\tvector<unique_ptr<tree>>childs;\\n\\ttree(const string _name,const int _depth) :name(_name),depth(_depth),childs() {\\n\\n\\t}\\n};\\nunique_ptr<tree> maketree(vector<string>&sts, vector<int>&ns,int depth,int &a) {\\n\\tunique_ptr<tree> t(std::make_unique<tree>(sts[a],depth));\\n\\twhile (a+1!=sts.size()&&ns[a+1] > depth) {\\n\\t\\ta++;\\n\\t\\tt->childs.push_back(maketree(sts, ns, depth + 1, a));\\n\\t\\t\\n\\t}\\n\\treturn t;\\n}\\n\\nvector<string> split(const string &str, char delim) {\\n\\tvector<string> res;\\n\\tsize_t current = 0, found;\\n\\twhile ((found = str.find_first_of(delim, current)) != string::npos) {\\n\\t\\tres.push_back(string(str, current, found - current));\\n\\t\\tcurrent = found + 1;\\n\\t}\\n\\tres.push_back(string(str, current, str.size() - current));\\n\\treturn res;\\n}\\nint dfs(const unique_ptr<tree>&tp,int type,string a,string b,bool flag) {\\n\\t//a is parant of b\\n\\tif (type == 0) {\\n\\t\\tif (a == tp->name) {\\n\\t\\t\\tfor (auto&& c : tp->childs) {\\n\\t\\t\\t\\tif (c->name == b)return 1;\\n\\t\\t\\t}\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tfor (auto &&c : tp->childs) {\\n\\t\\t\\t\\tint num=dfs(c, type, a, b,flag);\\n\\t\\t\\t\\tif (num != -1)return num;\\n\\t\\t\\t}\\n\\t\\t\\treturn -1;\\n\\t\\t}\\n\\t}\\n\\telse if (type == 1) {\\n\\t\\tif (flag) {\\n\\t\\t\\tif (tp->name == b)return 1;\\n\\t\\t\\tfor (auto &&c : tp->childs) {\\n\\t\\t\\t\\tint num = dfs(c, type, a, b, flag);\\n\\t\\t\\t\\tif (num != -1)return num;\\n\\t\\t\\t}\\n\\t\\t\\treturn -1;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tif (tp->name == a)flag = true;\\n\\t\\t\\tfor (auto &&c : tp->childs) {\\n\\t\\t\\t\\tint num = dfs(c, type, a, b, flag);\\n\\t\\t\\t\\tif (num != -1)return num;\\n\\t\\t\\t}\\n\\t\\t\\tif (flag)return 0;\\n\\t\\t\\telse return -1;\\n\\t\\t}\\n\\t}\\n\\telse {\\n\\t\\tint same = 0;\\n\\t\\tfor (auto&&c : tp->childs) {\\n\\t\\t\\tif (c->name == a)same++;\\n\\t\\t\\tif (c->name == b)same++;\\n\\t\\t\\tint num = dfs(c, type, a, b, flag);\\n\\t\\t\\tif (num != -1)return num;\\n\\t\\t}\\n\\t\\tif (same == 2)return 1;\\n\\t\\telse if (same == 1)return 0;\\n\\t\\telse return -1;\\n\\t}\\n}\\n\\nint main() {\\n\\twhile (1) {\\n\\n\\t\\tint N, M; cin >> N >> M;\\n\\t\\tif (!N)break;\\n\\t\\tunique_ptr<tree> t;\\n\\t\\t{\\n\\t\\t\\tvector<string>sts;\\n\\t\\t\\tvector<int>ns;\\n\\t\\t\\tstring st; getline(cin, st);\\n\\t\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\t\\tgetline(cin, st);\\n\\t\\t\\t\\tint n = st.find_first_not_of(' ');\\n\\t\\t\\t\\tsts.push_back(st.substr(n));\\n\\t\\t\\t\\tns.push_back(n);\\n\\t\\t\\t}\\n\\n\\t\\t\\tint a = 0;\\n\\t\\t\\tt = maketree(sts, ns, 0, a);\\n\\t\\t}\\n\\t\\t\\n\\t\\twhile (M--) {\\n\\t\\t\\tstring st;\\n\\t\\t\\tgetline(cin, st);\\n\\t\\t\\tvector<string>sts(split(st, ' '));\\n\\t\\t\\tstring a = sts[0];\\n\\t\\t\\tstring b = sts[5].substr(0, sts[5].size() - 1);\\n\\t\\t\\tint ans;\\n\\t\\t\\tif (sts[3] == \\\"child\\\") {\\n\\t\\t\\t\\tans = dfs(t, 0, b, a, false);\\n\\t\\t\\t}\\n\\t\\t\\telse if (sts[3] == \\\"ancestor\\\") {\\n\\t\\t\\t\\tans = dfs(t,1, a, b, false);\\n\\t\\t\\t}\\n\\t\\t\\telse if (sts[3] == \\\"sibling\\\") {\\n\\t\\t\\t\\tans = dfs(t, 2, a, b, false);\\n\\t\\t\\t}\\n\\t\\t\\telse if (sts[3] == \\\"parent\\\") {\\n\\t\\t\\t\\tans = dfs(t, 0, a, b, false);\\n\\t\\t\\t}\\n\\t\\t\\telse if (sts[3] == \\\"descendant\\\") {\\n\\t\\t\\t\\tans = dfs(t, 1, b, a, false);\\n\\t\\t\\t}\\n\\t\\t\\tif (ans == 1)cout << \\\"True\\\" << endl;\\n\\t\\t\\telse if (ans == 0)cout << \\\"False\\\" << endl;\\n\\t\\t\\telse assert(false);\\n\\t\\t}\\n\\t\\tcout << endl;\\n\\t}\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3168,\n \"score_of_the_acc\": -0.1467,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1217_1980409\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nmap <string, string> child_parent;\\nstring lastname[2000];\\n\\nbool child(string a, string b){\\n\\tif (child_parent[a] == b) return true;\\n\\telse return false;\\n}\\n\\nbool parent(string a, string b){\\n\\tif (a == child_parent[b]) return true;\\n\\telse return false;\\n}\\n\\nbool sibling(string a, string b){\\n\\tif (child_parent[a] == child_parent[b]) return true;\\n\\telse return false;\\n}\\n\\nbool ancestor(string a, string b){\\n\\tif (child_parent[b] == \\\"none\\\") return false;\\n\\telse if (parent(a, b)) return true;\\n\\telse return ancestor(a, child_parent[b]);\\n}\\n\\nbool descendant(string a, string b){\\n\\treturn ancestor(b, a);\\n}\\n\\nint main(void){\\n\\n\\tint n, m;\\n\\n\\twhile (cin >> n >> m, n, m){\\n\\n\\t\\tchild_parent.clear();\\n\\t\\tcin.ignore();\\n\\n\\t\\tfor (int i = 0; i < n; i++){\\n\\t\\t\\tstring s;\\n\\t\\t\\tgetline(cin, s);\\n\\n\\t\\t\\tint count = 0;\\n\\t\\t\\tfor (int j = 0; j < s.size(); j++){\\n\\t\\t\\t\\tif (s[j] == ' ') count++;\\n\\t\\t\\t}\\n\\n\\t\\t\\tif (count == 0) child_parent[s] = \\\"none\\\";\\n\\t\\t\\telse child_parent[s.substr(count)] = lastname[count - 1];\\n\\n\\t\\t\\tlastname[count] = s.substr(count);\\n\\n\\t\\t}\\n\\n\\t\\tfor (int i = 0; i < m; i++){\\n\\t\\t\\tstring a, b,relate, buff;\\n\\t\\t\\tcin >> a >> buff >> buff >> relate >> buff;\\n\\t\\t\\tchar bb[200];\\n\\t\\t\\tscanf(\\\" %[^.].\\\", &bb);\\n\\t\\t\\tb = bb;\\n\\n\\t\\t\\tbool flag = false;\\n\\t\\t\\tif (relate == \\\"child\\\") flag = child(a, b);\\n\\t\\t\\telse if (relate == \\\"parent\\\") flag = parent(a, b);\\n\\t\\t\\telse if (relate == \\\"sibling\\\") flag = sibling(a, b);\\n\\t\\t\\telse if (relate == \\\"descendant\\\") flag = descendant(a, b);\\n\\t\\t\\telse if (relate == \\\"ancestor\\\") flag = ancestor(a, b);\\n\\n\\t\\t\\tif (flag) cout << \\\"True\\\" << endl;\\n\\t\\t\\telse cout << \\\"False\\\" << endl;\\n\\t\\t}\\n\\n\\t\\t\\n\\n\\t\\tcout << endl;\\n\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1396,\n \"score_of_the_acc\": -0.006,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1217_1963864\",\n \"code_snippet\": \"#include <vector>\\n#include <list>\\n#include <map>\\n#include <set>\\n#include <queue>\\n#include <deque>\\n#include <stack>\\n#include <algorithm>\\n#include <functional>\\n#include <numeric>\\n#include <utility>\\n#include <sstream>\\n#include <iostream>\\n#include <iomanip>\\n#include <cstdio>\\n#include <cmath>\\n#include <cstdlib>\\n#include <cctype>\\n#include <string>\\n#include <cstring>\\nusing namespace std;\\n#define REP(i,n) for(int i = 0; i < (int)n; i++)\\n#define FOR(i,a,b) for(int i = a; i < (int)b; i++)\\n#define pb push_back\\n#define mp make_pair\\ntypedef vector<int> vi;\\ntypedef pair<int, int> pi;\\ntypedef long long ll;\\nconst int INF = 1<<28;\\nconst ll MOD = 1000000007;\\nconst int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};\\n\\nbool des(string a, string b, map<string, string> &m) {\\n\\tstring s = a;\\n\\twhile(s != \\\"\\\") {\\n\\t\\tif(s == b)\\n\\t\\t\\treturn true;;\\n\\t\\ts = m[s];\\n\\t}\\n\\treturn false;\\n}\\n\\nint main() {\\n\\tios_base::sync_with_stdio(0);\\n\\tcin.tie(0);\\n\\tint n, m;\\n\\twhile(cin >> n >> m, n|m) {\\n\\t\\tcin.ignore();\\n\\t\\tvector<string> v(1000);\\n\\t\\tmap<string, string> ma;\\n\\t\\tREP(i, n) {\\n\\t\\t\\tstring s;\\n\\t\\t\\tgetline(cin, s);\\n\\t\\t\\tint cnt = 0;\\n\\t\\t\\twhile(s[cnt] == ' ')\\n\\t\\t\\t\\tcnt++;\\n\\t\\t\\ts = s.substr(cnt);\\n\\t\\t\\tma[s] = cnt ? v[cnt-1] : \\\"\\\";\\n\\t\\t\\tv[cnt] = s;\\n\\t\\t}\\n\\t\\tREP(i, m) {\\n\\t\\t\\tstring in1, in2, in3;\\n\\t\\t\\tcin >> in1;\\n\\t\\t\\tcin >> in2 >> in2 >> in2;\\n\\t\\t\\tcin >> in3 >> in3;\\n\\t\\t\\tin3.erase(in3.end() - 1);\\n\\t\\t\\tbool ans = false;\\n\\t\\t\\tif(in2 == \\\"child\\\" && ma[in1] == in3)\\n\\t\\t\\t\\tans = true;\\n\\t\\t\\telse if(in2 == \\\"parent\\\" && ma[in3] == in1)\\n\\t\\t\\t\\tans = true;\\n\\t\\t\\telse if(in2 == \\\"sibling\\\" && ma[in1] == ma[in3])\\n\\t\\t\\t\\tans = true;\\n\\t\\t\\telse if(in2 == \\\"descendant\\\")\\n\\t\\t\\t\\tans = des(in1, in3, ma);\\n\\t\\t\\telse if(in2 == \\\"ancestor\\\")\\n\\t\\t\\t\\tans = des(in3, in1, ma);\\n\\t\\t\\tcout << (ans ? \\\"True\\\" : \\\"False\\\") << endl;\\n\\t\\t}\\n\\t\\tcout << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1348,\n \"score_of_the_acc\": -0.0022,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1217_1963852\",\n \"code_snippet\": \"#include <vector>\\n#include <list>\\n#include <map>\\n#include <set>\\n#include <queue>\\n#include <deque>\\n#include <stack>\\n#include <algorithm>\\n#include <functional>\\n#include <numeric>\\n#include <utility>\\n#include <sstream>\\n#include <iostream>\\n#include <iomanip>\\n#include <cstdio>\\n#include <cmath>\\n#include <cstdlib>\\n#include <cctype>\\n#include <string>\\n#include <cstring>\\nusing namespace std;\\n#define REP(i,n) for(int i = 0; i < (int)n; i++)\\n#define FOR(i,a,b) for(int i = a; i < (int)b; i++)\\n#define pb push_back\\n#define mp make_pair\\ntypedef vector<int> vi;\\ntypedef pair<int, int> pi;\\ntypedef long long ll;\\nconst int INF = 1<<28;\\nconst ll MOD = 1000000007;\\nconst int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};\\n\\nint main() {\\n\\tios_base::sync_with_stdio(0);\\n\\tcin.tie(0);\\n\\tint n, m;\\n\\twhile(cin >> n >> m, n|m) {\\n\\t\\tcin.ignore();\\n\\t\\tvector<string> v(1000);\\n\\t\\tmap<string, string> ma;\\n\\t\\tREP(i, n) {\\n\\t\\t\\tstring s;\\n\\t\\t\\tgetline(cin, s);\\n\\t\\t\\tint cnt = 0;\\n\\t\\t\\twhile(s[cnt] == ' ')\\n\\t\\t\\t\\tcnt++;\\n\\t\\t\\ts = s.substr(cnt);\\n\\t\\t\\tif(!cnt)\\n\\t\\t\\t\\tma[s] = \\\"\\\";\\n\\t\\t\\telse\\n\\t\\t\\t\\tma[s] = v[cnt-1];\\n\\t\\t\\tv[cnt] = s;\\n\\t\\t}\\n\\t\\tREP(i, m) {\\n\\t\\t\\tstring in1, in2, in3;\\n\\t\\t\\tcin >> in1;\\n\\t\\t\\tcin >> in2 >> in2 >> in2;\\n\\t\\t\\tcin >> in3 >> in3;\\n\\t\\t\\tin3.erase(in3.end() - 1);\\n\\t\\t\\tbool ans = false;\\n\\t\\t\\tif(in2 == \\\"child\\\" && ma[in1] == in3)\\n\\t\\t\\t\\tans = true;\\n\\t\\t\\telse if(in2 == \\\"parent\\\" && ma[in3] == in1)\\n\\t\\t\\t\\tans = true;\\n\\t\\t\\telse if(in2 == \\\"sibling\\\" && ma[in1] == ma[in3])\\n\\t\\t\\t\\tans = true;\\n\\t\\t\\telse if(in2 == \\\"descendant\\\") {\\n\\t\\t\\t\\tstring s = ma[in1];\\n\\t\\t\\t\\twhile(s != \\\"\\\") {\\n\\t\\t\\t\\t\\tif(s == in3)\\n\\t\\t\\t\\t\\t\\tans = true;\\n\\t\\t\\t\\t\\ts = ma[s];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse if(in2 == \\\"ancestor\\\") {\\n\\t\\t\\t\\tstring s = ma[in3];\\n\\t\\t\\t\\twhile(s != \\\"\\\") {\\n\\t\\t\\t\\t\\tif(s == in1)\\n\\t\\t\\t\\t\\t\\tans = true;\\n\\t\\t\\t\\t\\ts = ma[s];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(ans)\\n\\t\\t\\t\\tcout << \\\"True\\\" << endl;\\n\\t\\t\\telse\\n\\t\\t\\t\\tcout << \\\"False\\\" << endl;\\n\\t\\t}\\n\\t\\tcout << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1344,\n \"score_of_the_acc\": -0.0019,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1217_1418111\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n#include <string>\\n#include <vector>\\n#include <unordered_map>\\n#include <functional>\\nusing namespace std;\\ntypedef unordered_map<string,string> mss;\\n\\nunordered_map<string,function<bool(const string&,const string&,mss&)>>T={\\n\\t{\\\"child\\\",[](const string &x,const string &y,mss &parent){return parent[x]==y;}},\\n\\t{\\\"parent\\\",[](const string &x,const string &y,mss &parent){return parent[y]==x;}},\\n\\t{\\\"sibling\\\",[](const string &x,const string &y,mss &parent){return parent[x]==parent[y];}},\\n\\t{\\\"descendant\\\",[](const string &x,const string &y,mss &parent){\\n\\t\\tstring z=parent[x];\\n\\t\\tfor(;;){\\n\\t\\t\\tif(z==y)return true;\\n\\t\\t\\tif(parent[z]==\\\"\\\")return false;\\n\\t\\t\\tz=parent[z];\\n\\t\\t}\\n\\t}},\\n\\t{\\\"ancestor\\\",[](const string &x,const string &y,mss &parent){\\n\\t\\tstring z=parent[y];\\n\\t\\tfor(;;){\\n\\t\\t\\tif(z==x)return true;\\n\\t\\t\\tif(parent[z]==\\\"\\\")return false;\\n\\t\\t\\tz=parent[z];\\n\\t\\t}\\n\\t}},\\n\\n};\\nint main(){\\n\\tint N,Q;\\n\\tstring line;\\n\\tfor(;cin>>N>>Q,N;){\\n\\t\\tgetline(cin,line);\\n\\t\\tmss parent;\\n\\t\\tvector<string>stack;\\n\\t\\tgetline(cin,line);\\n\\t\\tparent[line]=\\\"\\\";\\n\\t\\tstack.push_back(line);\\n\\t\\tfor(int i=1;i<N;i++){\\n\\t\\t\\tgetline(cin,line);\\n\\t\\t\\tint idx=0;\\n\\t\\t\\tfor(;line[idx]==' ';idx++);\\n\\t\\t\\tstring name=line.substr(idx);\\n\\t\\t\\tif(idx>stack.size())return 1;\\n\\t\\t\\tfor(;idx<stack.size();stack.pop_back());\\n\\t\\t\\tparent[name]=stack[stack.size()-1];\\n\\t\\t\\tstack.push_back(name);\\n\\t\\t}\\n\\t\\tfor(int i=0;i<Q;i++){\\n\\t\\t\\tgetline(cin,line);\\n\\t\\t\\tistringstream ss(line);\\n\\t\\t\\tstring x,z,y;\\n\\t\\t\\tss>>x>>y>>y>>z>>y>>y;\\n\\t\\t\\ty=y.substr(0,y.size()-1);\\n\\t\\t\\tcout<<(T[z](x,y,parent)?\\\"True\\\":\\\"False\\\")<<endl;\\n\\t\\t}\\n\\t\\tcout<<endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1340,\n \"score_of_the_acc\": -0.0016,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1217_1334247\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define MAX_N 1010\\n\\nstruct P{\\n int p,l;\\n};\\n\\nP p[MAX_N];\\nstring s[MAX_N];\\nbool used[MAX_N];\\nint N;\\n\\nvoid init(int N){\\n for(int i = 0 ; i < N ; i++){\\n p[i].p = i;\\n }\\n}\\n\\nbool find(int x,int target){\\n if(p[x].p == target){\\n return true;\\n }\\n if(p[x].p == x){ return false; }\\n return find(p[x].p,target);\\n}\\n\\nvoid make(int n,int parent,int root,int depth){\\n set<int> children;\\n if(used[n]){ return; }\\n used[n] = true;\\n p[n].p = parent; p[n].l = depth;\\n for(int i = n+1 ; i < N ; i++){\\n int len = s[i].size();\\n if(depth+1 >= len){ continue; }\\n if(s[i][depth] != '.'){ break; }\\n if(s[i][depth] == '.' && s[i][depth+1] != '.'){\\n children.insert(i);\\n make(i,n,root,depth+1);\\n }\\n }\\n}\\n\\nint main(){\\n int M;\\n while(cin >> N >> M, N){\\n map<string,int> mp;\\n int cur = 0;\\n init(N); cin.ignore();\\n for(int i = 0 ; i < N ; i++){\\n getline(cin,s[i]);\\n for(int j = 0 ; j < (int)s[i].size() ; j++){\\n if(s[i][j] != ' '){\\n mp[s[i].substr(j)] = cur++;\\n break;\\n }\\n s[i][j] = '.';\\n }\\n used[i] = false;\\n }\\n for(int i = 0 ; i < N ; i++){\\n if(used[i]){ continue; }\\n if(s[i][0] != '.'){\\n make(i,i,i,0);\\n }\\n }\\n string ord,a,b,c;\\n for(int i = 0 ; i < M ; i++){\\n getline(cin,ord);\\n stringstream ss(ord);\\n ss >> a;\\n ss >> ord; ss >> ord;\\n ss >> c;\\n ss >> ord;\\n ss >> b;\\n b.resize(b.size()-1);\\n bool ans = false;\\n if(c == \\\"parent\\\"){\\n if(p[mp[b]].p == mp[a]){\\n ans = true;\\n }\\n }else if(c == \\\"child\\\"){\\n if(p[mp[a]].p == mp[b]){\\n ans = true;\\n }\\n }else if(c == \\\"ancestor\\\"){\\n if(p[mp[a]].l < p[mp[b]].l && find(mp[b],mp[a])){\\n ans = true;\\n }\\n }else if(c == \\\"descendant\\\"){\\n if(p[mp[a]].l > p[mp[b]].l && find(mp[a],mp[b])){\\n ans = true;\\n }\\n }else{\\n if(p[mp[a]].l == p[mp[b]].l && p[mp[a]].p == p[mp[b]].p){\\n ans = true;\\n }\\n }\\n cout << (ans ? \\\"True\\\" : \\\"False\\\") << endl;\\n }\\n cout << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1440,\n \"score_of_the_acc\": -0.0095,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1217_1162680\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nstruct node{\\n string name;\\n int parent;\\n vector<int> child;\\n\\n node(string s=\\\"\\\"):name(s){ parent = -1; child.clear(); }\\n\\n void set_par(int a){ parent = a; }\\n void add_child(int a){ child.push_back(a); }\\n};\\n\\nvector<node> tree;\\nmap<string,int> id;\\n\\ninline bool is_par(string my, string your){\\n int par = tree[id[my]].parent;\\n if(par<0)return false;\\n return tree[par].name == your;\\n}\\n\\ninline bool is_child(string my, string your){\\n for(int c : tree[ id[my] ].child){\\n if(tree[c].name == your)return true;\\n }\\n return false;\\n}\\n\\ninline bool is_sib(string my, string your){\\n int par = tree[id[my]].parent;\\n if(par<0)return false;\\n return is_child(tree[par].name, your);\\n}\\n\\ninline bool is_anc(string my, string your){\\n if(my == your)return true;\\n int par = tree[id[my]].parent;\\n if(par<0)return false;\\n return is_anc(tree[par].name, your);\\n}\\n\\ninline bool is_des(string my, string your){\\n if(my == your)return true;\\n for(int c : tree[ id[my] ].child){\\n if(is_des(tree[c].name,your))return true;\\n }\\n return false; \\n}\\n\\nint main(){\\n int n,m;\\n while(cin >> n >> m, n){\\n stack< pair<int,int> > s;\\n id.clear();\\n tree.resize(n);\\n\\n cin.ignore();\\n for(int i=0;i<n;i++){\\n string name;\\n getline(cin,name);\\n //cout << name << endl;\\n int indent = 0;\\n while(name[indent]==' ')indent++;\\n name = name.substr(indent);\\n tree[i] = node(name);\\n id[name] = i;\\n\\n while(s.size() && s.top().second+1 != indent)s.pop();\\n if(s.size()){\\n\\ttree[i].set_par( s.top().first );\\n\\ttree[s.top().first].add_child(i);\\n }\\n s.push( make_pair(i,indent) );\\n }\\n\\n /*\\n for(int i=0;i<n;i++){\\n cout << tree[i].name << endl;\\n cout << tree[i].parent << endl;\\n for(int c : tree[i].child)cout << c << \\\" \\\"; cout << endl;\\n }\\n */\\n\\n for(int i=0;i<m;i++){\\n string my,your,query,dummy;\\n cin >> your >> dummy >> dummy >> query >> dummy >> my;\\n my = my.substr(0,my.size()-1);\\n\\n //cout << my << \\\" \\\" << your << \\\" \\\" << query << endl;\\n\\n bool f = false;\\n if(query == \\\"child\\\")f = is_child(my,your);\\n else if(query == \\\"parent\\\")f = is_par(my,your);\\n else if(query == \\\"sibling\\\")f = is_sib(my,your);\\n else if(query == \\\"ancestor\\\")f = is_anc(my,your);\\n else f = is_des(my,your);\\n\\n if(f)cout << \\\"True\\\" << endl;\\n else cout << \\\"False\\\" << endl;\\n }\\n cout << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1420,\n \"score_of_the_acc\": -0.0079,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1217_992599\",\n \"code_snippet\": \"#include <algorithm>\\n#include <sstream>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <cassert>\\n#include <functional>\\n#include <iostream>\\n#include <iomanip>\\n#include <iterator>\\n#include <map>\\n#include <queue>\\n#include <utility>\\n#include <vector>\\n\\nusing namespace std;\\n\\ntypedef long long Long;\\n#define whole(xs) xs.begin(), xs.end()\\n\\nstruct Q {\\n string Relation, Name1, Name2;\\n Q(const string& Relation, const string& Name1, const string& Name2) \\n : Relation(Relation), Name1(Name1), Name2(Name2) {}\\n};\\nostream& operator<<(ostream& os, const Q& q) {\\n os << \\\"(\\\" << q.Relation << \\\", \\\" << q.Name1 << \\\", \\\" << q.Name2 << \\\")\\\";\\n return os;\\n}\\n\\nint N, M;\\nvector<int> Parent;\\nvector<Q> Queries;\\nmap<string, int> Id;\\nvector<int> Prev;\\n\\nint CountPrefixSpaces(const string& s) {\\n int i;\\n for (i = 0; i < s.size() && s[i] == ' '; i++) ;\\n return i;\\n}\\n\\nbool input() {\\n string l;\\n getline(cin, l);\\n istringstream is; is.str(l);\\n is >> N >> M;\\n is.clear();\\n if (N == 0 && M == 0) return false;\\n Parent.resize(N, -1);\\n Queries.clear();\\n Id.clear();\\n Prev.resize(N, -1);\\n for (int i = 0; i < N; i++) {\\n getline(cin, l);\\n is.str(l);\\n string Name;\\n is >> Name;\\n is.clear();\\n Id[Name] = i;\\n int C = CountPrefixSpaces(l);\\n Prev[C] = i;\\n if (C != 0) {\\n Parent[i] = Prev[C - 1];\\n }\\n }\\n for (int i = 0; i < M; i++) {\\n getline(cin, l);\\n is.str(l);\\n string Name1, Relation, Name2;\\n string _;\\n is >> Name1;\\n for (int k = 0; k < 2; k++) is >> _;\\n is >> Relation;\\n is >> _;\\n is >> Name2;\\n Name2 = Name2.substr(0, Name2.size() - 1);\\n is.clear();\\n Queries.push_back(Q(Relation, Name1, Name2));\\n }\\n return true;\\n}\\n\\nvoid solve() {\\n for (int i = 0; i < M; i++) {\\n string& Relation = Queries[i].Relation,\\n Name1 = Queries[i].Name1,\\n Name2 = Queries[i].Name2;\\n int x = Id[Name1], y = Id[Name2];\\n if (Relation == \\\"child\\\") {\\n cout << (y == Parent[x] ? \\\"True\\\" : \\\"False\\\") << endl;\\n } else if (Relation == \\\"parent\\\") {\\n cout << (x == Parent[y] ? \\\"True\\\" : \\\"False\\\") << endl;\\n } else if (Relation == \\\"sibling\\\") {\\n cout << (Parent[x] == Parent[y] ? \\\"True\\\" : \\\"False\\\") << endl;\\n } else if (Relation == \\\"descendant\\\") {\\n while (x >= 0) {\\n if (y == x) {\\n cout << \\\"True\\\" << endl;\\n goto fin1;\\n }\\n x = Parent[x];\\n }\\n cout << \\\"False\\\" << endl;\\n fin1:;\\n } else if (Relation == \\\"ancestor\\\") {\\n while (y >= 0) {\\n if (y == x) {\\n cout << \\\"True\\\" << endl;\\n goto fin2;\\n }\\n y = Parent[y];\\n }\\n cout << \\\"False\\\" << endl;\\n fin2:;\\n } else {\\n assert(0);\\n }\\n }\\n cout << endl;\\n}\\n\\nint main() {\\n while (input()) solve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1528,\n \"score_of_the_acc\": -0.0165,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1217_902209\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <string>\\n#include <sstream>\\n#include <cstring>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cmath>\\n#include <queue>\\n#include <stack>\\n#include <map>\\n#include <set>\\n#include <numeric>\\n#include <cctype>\\n#include <tuple>\\n\\n#ifdef _MSC_VER\\n#include <agents.h>\\n#endif\\n\\n#define FOR(i, a, b) for(int i = (a); i < (int)(b); ++i)\\n#define rep(i, n) FOR(i, 0, n)\\n#define ALL(v) v.begin(), v.end()\\n#define REV(v) v.rbegin(), v.rend()\\n#define MEMSET(v, s) memset(v, s, sizeof(v))\\n#define X first\\n#define Y second\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef pair<int, int> P;\\n\\nint par[1010];\\nint last[100];\\nmap<string, int> name;\\n\\nbool check_ancestor(int a, int d){\\n\\tif (a < 0 || d < 0) return false;\\n\\tif (a == par[d]) return true;\\n\\treturn check_ancestor(a, par[d]);\\n}\\n\\nint main(){\\n\\tint n, q;\\n\\twhile (cin >> n >> q, n|q){\\n\\t\\tname.clear();\\n\\t\\tMEMSET(last, -1);\\n\\t\\tMEMSET(par, -1);\\n\\t\\tcin.ignore();\\n\\t\\trep(i, n){\\n\\t\\t\\tstring s;\\n\\t\\t\\tgetline(cin, s);\\n\\t\\t\\tint cnt = count(ALL(s), ' ');\\n\\t\\t\\tlast[cnt] = i;\\n\\t\\t\\tname[s.substr(cnt)] = i;\\n\\t\\t\\tif (!cnt) continue;\\n\\t\\t\\tpar[i] = last[cnt - 1];\\n\\t\\t}\\n\\t\\twhile (q--){\\n\\t\\t\\tstring a, b, c, d, e, f;\\n\\t\\t\\tcin >> a >> b >> c >> d >> e >> f;\\n\\t\\t\\t//cout << f.substr(0, f.size() - 1) << endl;\\n\\t\\t\\tint x = name[a], y = name[f.substr(0, f.size() - 1)];\\n\\t\\t\\tbool ok;\\n\\t\\t\\tswitch (d[0]){\\n\\t\\t\\tcase 'c':\\n\\t\\t\\t\\tok = par[x] == y;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 'a':\\n\\t\\t\\t\\tok = check_ancestor(x, y);\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 's':\\n\\t\\t\\t\\tok = par[x] == par[y];\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 'p':\\n\\t\\t\\t\\tok = x == par[y];\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 'd':\\n\\t\\t\\t\\tok = check_ancestor(y, x);\\n\\t\\t\\t}\\n\\t\\t\\tcout << (ok ? \\\"True\\\" : \\\"False\\\") << endl;\\n\\t\\t}\\n\\t\\tcout << endl;\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1320,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1217_786340\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<algorithm>\\n#include<cstring>\\n\\nusing namespace std;\\n\\ntypedef pair<int,string> P;\\n\\n// family tree\\nstruct Node{\\n vector<Node*> child;\\n Node* parent;\\n string name;\\n Node():name(\\\"\\\"){}\\n Node(vector<Node*> c, Node* p, string s):child(c),parent(p),name(s){}\\n\\n void init(){\\n for(int i = 0; i < (int)child.size(); i++)\\n child[i]->init();\\n child.clear();\\n }\\n\\n bool isSibling(const string& A, const string& B){\\n return find(A)->parent==find(B)->parent;\\n }\\n\\n bool isChild(const string& A){\\n for(int i = 0; i < (int)child.size(); i++)\\n if(child[i]->name == A) return true;\\n return false;\\n }\\n\\n bool isDecendant(const string& A){\\n for(int i = 0; i < (int)child.size(); i++)\\n if(child[i]->name == A) return true;\\n \\n bool res = false;\\n for(int i = 0; i < (int)child.size(); i++)\\n res = res||child[i]->isDecendant(A);\\n return res;\\n }\\n\\n Node* find(const string& name){\\n for(int i = 0; i < (int)child.size(); i++)\\n if(child[i]->name == name) return child[i];\\n\\n for(int i = 0; i < (int)child.size(); i++){\\n Node* tmp = child[i]->find(name);\\n if(tmp != NULL) return tmp;\\n }\\n return NULL;\\n }\\n};\\n\\nint N,M;\\nNode* top = new Node(vector<Node*>(), top, \\\"\\\");\\n\\nP devide(const string& s){\\n int blank = 0;\\n for(int i = 0; i < (int)s.length(); i++) if(s[i] == ' ') blank++;\\n return P(blank,s.substr(blank));\\n}\\n\\nvoid input(){\\n cin.ignore();\\n \\n Node* now = top;\\n int depth = -1;\\n\\n for(int i = 0; i < N; i++){\\n string s;\\n getline(cin,s);\\n P p = devide(s);\\n \\n if(p.first == depth){\\n Node* nex = new Node(vector<Node*>(), now->parent, p.second);\\n ((now->parent)->child).push_back(nex);\\n now = nex;\\n }\\n\\n if(p.first < depth){\\n // go up\\n int diff = depth-p.first+1;\\n for(int i = 0; i < diff; i++) now = now->parent;\\n Node* nex = new Node(vector<Node*>(), now, p.second);\\n now->child.push_back(nex);\\n now = nex;\\n depth = p.first;\\n }\\n \\n if(p.first > depth){\\n // go down\\n Node* nex = new Node(vector<Node*>(), now, p.second);\\n now->child.push_back(nex);\\n now = nex;\\n depth = p.first;\\n }\\n }\\n}\\n\\nvoid solve(){\\n\\n for(int i = 0; i < M; i++){\\n string X,Y,Q,trash;\\n cin >> X >> trash >> trash >> Q >> trash >> Y;\\n bool ans = false;\\n Y = Y.substr(0,Y.length()-1);\\n\\n if(Q[0]=='c') ans = (top->find(Y))->isChild(X);\\n if(Q[0]=='p') ans = (top->find(X))->isChild(Y);\\n if(Q[0]=='s') ans = top->isSibling(X,Y);\\n if(Q[0]=='d') ans = (top->find(Y))->isDecendant(X);\\n if(Q[0]=='a') ans = (top->find(X))->isDecendant(Y);\\n \\n cout << (ans?\\\"True\\\":\\\"False\\\") << endl;\\n }\\n cout << endl;\\n}\\n\\nint main(){\\n \\n while(cin >> N >> M && N+M){\\n top->init();\\n input();\\n solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1360,\n \"score_of_the_acc\": -0.0032,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1217_781895\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cstring>\\n#include <algorithm>\\n#include <vector>\\n#include <map>\\n\\nusing namespace std;\\n\\ntypedef pair<int, string> P;\\n\\nmap<string, P> fam;\\n\\nvector<string> s;\\nvector<string> name;\\nint N, Q;\\n\\nvoid output(){\\n string op;\\n for(int i = 0 ; i < Q ; i++){\\n string relation, X, Y;\\n for(int j = 0 ; j < 6 ; j++){\\n cin >> op;\\n if(j == 0) X = op;\\n if(j == 3) relation = op;\\n if(j == 5) Y = op;\\n }\\n Y.erase(Y.end()-1);\\n \\n if(relation == \\\"parent\\\"){\\n relation = \\\"child\\\";\\n swap(X, Y);\\n }\\n if(relation == \\\"descendant\\\"){\\n relation = \\\"ancestor\\\";\\n swap(X, Y);\\n }\\n \\n bool ans = false;\\n \\n if(relation == \\\"child\\\"){\\n ans = fam[X].second == Y;\\n }\\n else if(relation == \\\"ancestor\\\"){\\n while(fam[Y].first != 0){\\n\\tif(fam[Y].second == X){\\n\\t ans = true;\\n\\t break;\\n\\t}\\n\\tY = fam[Y].second;\\n }\\n }\\n else if(relation == \\\"sibling\\\"){\\n int gen = fam[Y].first;\\n string par = fam[Y].second;\\n for(map<string, P>::iterator it = fam.begin() ; it != fam.end() ; it++){\\n\\tif(it->first == X){\\n\\t if(it->second.first == gen && it->second.second == par){\\n\\t ans = true;\\n\\t break;\\n\\t }\\n\\t}\\n }\\n }\\n if(ans) cout << \\\"True\\\" << endl;\\n else cout << \\\"False\\\" << endl;\\n }\\n}\\n\\nint main(){\\n while(cin >> N >> Q, N|Q){\\n fam.clear();\\n s.clear();\\n name.clear();\\n cin.ignore();\\n string tmp;\\n for(int i = 0 ; i < N ; i++){\\n getline(cin, tmp);\\n s.push_back(tmp);\\n }\\n \\n name = s;\\n \\n for(int i = 0 ; i < N ; i++){\\n while(name[i][0] == ' ') name[i].erase(name[i].begin());\\n }\\n \\n for(int i = 0 ; i < N ; i++){\\n int gen = 0;\\n for(int j = 0 ; j < (int)s[i].size() ; j++){\\n\\tif(s[i][j] != ' ') break;\\n\\tgen++;\\n }\\n for(int j = i ; j >= 0 ; j--){\\n\\tif(s[j][gen-1] != ' '){\\n\\t fam[ name[i] ] = P(gen, name[j]);\\n\\t break;\\n\\t}\\n }\\n }\\n \\n output();\\n cout << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1536,\n \"score_of_the_acc\": -0.1838,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1217_781894\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cstring>\\n#include <algorithm>\\n#include <vector>\\n#include <map>\\n\\nusing namespace std;\\n\\ntypedef pair<int, string> P;\\n\\nmap<string, P> fam;\\n\\nvector<string> s;\\nvector<string> name;\\nint N, Q;\\n\\nvoid output(){\\n string op;\\n for(int i = 0 ; i < Q ; i++){\\n string relation, X, Y;\\n for(int j = 0 ; j < 6 ; j++){\\n cin >> op;\\n if(j == 0) X = op;\\n if(j == 3) relation = op;\\n if(j == 5) Y = op;\\n }\\n Y.erase(Y.end()-1);\\n \\n if(relation == \\\"parent\\\"){\\n relation = \\\"child\\\";\\n swap(X, Y);\\n }\\n if(relation == \\\"descendant\\\"){\\n relation = \\\"ancestor\\\";\\n swap(X, Y);\\n }\\n \\n bool ans = false;\\n \\n if(relation == \\\"child\\\"){\\n ans = fam[X].second == Y;\\n }\\n else if(relation == \\\"ancestor\\\"){\\n while(fam[Y].first != 0){\\n\\tif(fam[Y].second == X){\\n\\t ans = true;\\n\\t break;\\n\\t}\\n\\tY = fam[Y].second;\\n }\\n }\\n else if(relation == \\\"sibling\\\"){\\n int gen = fam[Y].first;\\n string par = fam[Y].second;\\n for(map<string, P>::iterator it = fam.begin() ; it != fam.end() ; it++){\\n\\tif(it->first == X){\\n\\t if(it->second.first == gen && it->second.second == par){\\n\\t ans = true;\\n\\t break;\\n\\t }\\n\\t}\\n }\\n }\\n if(ans) cout << \\\"True\\\" << endl;\\n else cout << \\\"False\\\" << endl;\\n }\\n}\\n\\nint main(){\\n while(cin >> N >> Q, N|Q){\\n fam.clear();\\n s.clear();\\n name.clear();\\n cin.ignore();\\n string tmp;\\n for(int i = 0 ; i < N ; i++){\\n getline(cin, tmp);\\n s.push_back(tmp);\\n }\\n \\n name = s;\\n \\n for(int i = 0 ; i < N ; i++){\\n while(name[i][0] == ' ') name[i].erase(name[i].begin());\\n /*\\n for(int j = 0 ; j < (int)name[i].size() ; j++){\\n\\tif(name[i][j] == ' ') name[i].erase(name[i].begin()+j);\\n }\\n */\\n }\\n \\n for(int i = 0 ; i < N ; i++){\\n int gen = 0;\\n for(int j = 0 ; j < (int)s[i].size() ; j++){\\n\\tif(s[i][j] != ' ') break;\\n\\tgen++;\\n }\\n for(int j = i ; j >= 0 ; j--){\\n\\tif(s[j][gen-1] != ' '){\\n\\t fam[ name[i] ] = P(gen, name[j]);\\n\\t break;\\n\\t}\\n }\\n }\\n \\n output();\\n cout << endl;\\n /*\\n for(map<string, P>::iterator it = fam.begin() ; it != fam.end() ; it++){\\n cout << it->first << ' ' << it->second.first << ' ' << it->second.second << endl;\\n }\\n */\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1536,\n \"score_of_the_acc\": -0.1838,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1217_585866\",\n \"code_snippet\": \"#include<map>\\n#include<sstream>\\n#include<cstdlib>\\n#include<vector>\\n#include<algorithm>\\n#include<iostream>\\n#include<cassert>\\n#define F first\\n#define S second\\n#define pb push_back\\n#define all(n) n.begin(),n.end()\\nusing namespace std;\\ntypedef pair<string,int> SI;\\n \\nint oldest,youngest;\\n \\nvoid split(vector<SI>& vec,string line)\\n{\\n int space_cnt = 0;\\n for(int i=0;line[i] == ' ';i++,space_cnt++){}\\n \\n vec.push_back(SI(line.substr(space_cnt,line.size()-space_cnt),space_cnt));\\n oldest = min(oldest,space_cnt);\\n youngest = max(youngest,space_cnt);\\n}\\n \\nvoid ParseAndSolve(vector<SI>& vec,map<string,int>& index_tree,string line)\\n{\\n vector<string> info;\\n stringstream ss(line);\\n string mid;\\n vector<string> ope; \\n \\n \\n for(int i=0;i<ss.str().size();i++)\\n {\\n if((ss >> mid).fail())\\n goto skip;\\n \\n ope.push_back(mid);\\n \\n }\\n \\n skip:\\n \\n info.push_back(ope[0]);\\n for(int i=1;i<ope.size()-1;i++)\\n {\\n if(ope[i] == \\\"child\\\" || ope[i] == \\\"parent\\\" || ope[i] == \\\"sibling\\\" || ope[i] == \\\"descendant\\\" || ope[i] == \\\"ancestor\\\")\\n {\\n info.push_back(ope[i]);\\n break;\\n }\\n }\\n info.push_back(ope[ope.size()-1].substr(0,ope[ope.size()-1].size()));\\n \\n \\n assert(info.size() == 3);\\n \\n string X,Y;\\n X = info[0],Y = info[2];\\n \\n if(info[1][0] == 'c')\\n {\\n int Yindex = index_tree[Y]; \\n int Xindex = index_tree[X];\\n \\n if(vec[Xindex].S <= vec[Yindex].S || Yindex+1 >= vec.size() || vec[Yindex+1].S != vec[Xindex].S)\\n {\\n cout << \\\"False\\\" << endl;\\n return;\\n }\\n \\n \\n int parent_level = vec[Yindex].S;\\n \\n for(int i=Yindex+1;parent_level < vec[i].S && i < vec.size();i++)\\n {\\n \\n if(vec[i].F == X)\\n {\\n cout << \\\"True\\\" << endl;\\n return;\\n }\\n }\\n \\n cout << \\\"False\\\" << endl;\\n return;\\n }\\n else if(info[1][0] == 'p')\\n {\\n \\n int Xindex = index_tree[X];\\n int Yindex = index_tree[Y];\\n \\n if(vec[Xindex].S >= vec[Yindex].S || Xindex+1 >= vec.size() || vec[Xindex+1].S != vec[Yindex].S )\\n {\\n cout << \\\"False\\\" << endl;\\n return;\\n }\\n \\n \\n int parent_level = vec[Xindex].S;\\n \\n for(int i=Xindex+1;parent_level < vec[i].S && i < vec.size();i++ )\\n {\\n if(vec[i].F == Y)\\n {\\n cout << \\\"True\\\" << endl;\\n return;\\n }\\n }\\n \\n cout << \\\"False\\\" << endl;\\n return;\\n \\n \\n }\\n else if(info[1][0] == 's')\\n {\\n int Xindex = index_tree[X];\\n int Yindex = index_tree[Y];\\n \\n if(vec[Xindex].S != vec[Yindex].S || min(Xindex,Yindex)+1 >= vec.size())\\n {\\n cout << \\\"False\\\" << endl;\\n return;\\n }\\n \\n int sibling_level = vec[Xindex].S;\\n \\n int Maxindex,Minindex;\\n string Maxname,Minname;\\n \\n if(Xindex > Yindex)\\n {\\n Maxindex = Xindex,Minindex = Yindex;\\n Maxname = X,Minname = Y;\\n }\\n else\\n {\\n Maxindex = Yindex,Minindex = Xindex;\\n Maxname = Y,Minname = X;\\n }\\n \\n for(int i=Minindex+1;i<vec.size() && sibling_level <= vec[i].S;i++)\\n {\\n if(Maxname == vec[i].F)\\n {\\n cout << \\\"True\\\" << endl;\\n return;\\n }\\n }\\n cout << \\\"False\\\" << endl;\\n return;\\n \\n }\\n else if(info[1][0] == 'd')\\n {\\n int Xindex = index_tree[X];\\n int Yindex = index_tree[Y];\\n \\n if(Yindex+1 >= vec.size() || vec[Xindex].S <= vec[Yindex].S)\\n {\\n cout << \\\"False\\\" << endl;\\n return;\\n }\\n \\n for(int i=Yindex+1;i<vec.size() && vec[i].S > vec[Yindex].S;i++)\\n {\\n if(vec[i].F == vec[Xindex].F)\\n {\\n cout << \\\"True\\\" << endl;\\n return;\\n }\\n }\\n \\n cout << \\\"False\\\" << endl;\\n return;\\n }\\n else if(info[1][0] == 'a')\\n {\\n int Xindex = index_tree[X];\\n int Yindex = index_tree[Y];\\n if(Xindex+1 >= vec.size() || vec[Xindex].S >= vec[Yindex].S)\\n {\\n cout << \\\"False\\\" << endl;\\n return;\\n }\\n \\n for(int i=Xindex+1;i < vec.size() && vec[i].S > vec[Xindex].S;i++)\\n {\\n if(vec[i].F == vec[Yindex].F)\\n {\\n cout << \\\"True\\\" << endl;\\n return;\\n }\\n }\\n \\n cout << \\\"False\\\" << endl;\\n return;\\n }\\n else\\n assert(false);\\n \\n \\n}\\n \\nint main()\\n{\\n int n,m;\\n while(true)\\n {\\n cin >> n >> m;\\n \\n if(!(n+m))\\n break;\\n oldest = (1<<28);\\n youngest = -1;\\n cin.ignore();\\n string line;\\n vector<SI> vec;\\n for(int i=0;i<n;i++)\\n {\\n getline(cin,line);\\n \\n split(vec,line);\\n }\\n \\n map<string,int> index_tree;\\n for(int i=0;i<n;i++)\\n index_tree[vec[i].F] = i;\\n \\n for(int i=0;i<m;i++)\\n {\\n getline(cin,line);\\n \\n ParseAndSolve(vec,index_tree,line.substr(0,line.size()-1));\\n \\n }\\n \\n cout << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1360,\n \"score_of_the_acc\": -0.0032,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1217_585862\",\n \"code_snippet\": \"#include<map>\\n#include<sstream>\\n#include<cstdlib>\\n#include<vector>\\n#include<algorithm>\\n#include<iostream>\\n#include<cassert>\\n#define F first\\n#define S second\\n#define pb push_back\\n#define all(n) n.begin(),n.end()\\nusing namespace std;\\ntypedef pair<string,int> SI;\\n\\nint oldest,youngest;\\n\\nvoid split(vector<SI>& vec,string line)\\n{\\n int space_cnt = 0;\\n for(int i=0;line[i] == ' ';i++,space_cnt++){}\\n\\n vec.push_back(SI(line.substr(space_cnt,line.size()-space_cnt),space_cnt));\\n oldest = min(oldest,space_cnt);\\n youngest = max(youngest,space_cnt);\\n}\\n\\nvoid ParseAndSolve(vector<SI>& vec,map<string,int>& index_tree,string line)\\n{\\n vector<string> info;\\n stringstream ss(line);\\n string mid;\\n vector<string> ope; \\n \\n\\n for(int i=0;i<ss.str().size();i++)\\n {\\n if((ss >> mid).fail())\\n\\tgoto skip;\\n \\n ope.push_back(mid);\\n \\n }\\n\\n skip:\\n\\n info.push_back(ope[0]);\\n for(int i=1;i<ope.size()-1;i++)\\n {\\n if(ope[i] == \\\"child\\\" || ope[i] == \\\"parent\\\" || ope[i] == \\\"sibling\\\" || ope[i] == \\\"descendant\\\" || ope[i] == \\\"ancestor\\\")\\n\\t{\\n\\t info.push_back(ope[i]);\\n\\t break;\\n\\t}\\n }\\n info.push_back(ope[ope.size()-1].substr(0,ope[ope.size()-1].size()));\\n\\n\\n assert(info.size() == 3);\\n\\n string X,Y;\\n X = info[0],Y = info[2];\\n\\n if(info[1][0] == 'c')\\n {\\n int Yindex = index_tree[Y]; \\n int Xindex = index_tree[X];\\n\\n if(vec[Xindex].S <= vec[Yindex].S || Yindex+1 >= vec.size() || vec[Yindex+1].S != vec[Xindex].S)\\n\\t{\\n\\t cout << \\\"False\\\" << endl;\\n\\t return;\\n\\t}\\n\\n \\n int parent_level = vec[Yindex].S;\\n\\n for(int i=Yindex+1;parent_level < vec[i].S && i < vec.size();i++)\\n\\t{\\n\\n\\t if(vec[i].F == X)\\n\\t {\\n\\t cout << \\\"True\\\" << endl;\\n\\t return;\\n\\t }\\n\\t}\\n\\n cout << \\\"False\\\" << endl;\\n return;\\n }\\n else if(info[1][0] == 'p')\\n {\\n\\n int Xindex = index_tree[X];\\n int Yindex = index_tree[Y];\\n\\n if(vec[Xindex].S >= vec[Yindex].S || Xindex+1 >= vec.size() || vec[Xindex+1].S != vec[Yindex].S )\\n\\t{\\n\\t cout << \\\"False\\\" << endl;\\n\\t return;\\n\\t}\\n\\n\\n int parent_level = vec[Xindex].S;\\n\\n for(int i=Xindex+1;parent_level < vec[i].S && i < vec.size();i++ )\\n\\t{\\n\\t if(vec[i].F == Y)\\n\\t {\\n\\t cout << \\\"True\\\" << endl;\\n\\t return;\\n\\t }\\n\\t}\\n\\n cout << \\\"False\\\" << endl;\\n return;\\n\\n\\n }\\n else if(info[1][0] == 's')\\n {\\n int Xindex = index_tree[X];\\n int Yindex = index_tree[Y];\\n\\n if(vec[Xindex].S != vec[Yindex].S || min(Xindex,Yindex)+1 >= vec.size())\\n\\t{\\n\\t cout << \\\"False\\\" << endl;\\n\\t return;\\n\\t}\\n\\n int sibling_level = vec[Xindex].S;\\n\\n int Maxindex,Minindex;\\n string Maxname,Minname;\\n\\n if(Xindex > Yindex)\\n\\t{\\n\\t Maxindex = Xindex,Minindex = Yindex;\\n\\t Maxname = X,Minname = Y;\\n\\t}\\n else \\n\\t{\\n\\t Maxindex = Yindex,Minindex = Xindex;\\n\\t Maxname = Y,Minname = X;\\n\\t}\\n\\n for(int i=Minindex+1;i<vec.size() && sibling_level <= vec[i].S;i++)\\n\\t{\\n\\t if(Maxname == vec[i].F)\\n\\t {\\n\\t cout << \\\"True\\\" << endl;\\n\\t return;\\n\\t }\\n\\t}\\n cout << \\\"False\\\" << endl;\\n return;\\n\\n }\\n else if(info[1][0] == 'd')\\n {\\n int Xindex = index_tree[X];\\n int Yindex = index_tree[Y];\\n\\n if(Yindex+1 >= vec.size() || vec[Xindex].S <= vec[Yindex].S)\\n\\t{\\n\\t cout << \\\"False\\\" << endl;\\n\\t return;\\n\\t}\\n\\n for(int i=Yindex+1;i<vec.size() && vec[i].S > vec[Yindex].S;i++)\\n\\t{\\n\\t if(vec[i].F == vec[Xindex].F)\\n\\t {\\n\\t cout << \\\"True\\\" << endl;\\n\\t return;\\n\\t }\\n\\t}\\n\\n cout << \\\"False\\\" << endl;\\n return;\\n }\\n else if(info[1][0] == 'a')\\n {\\n int Xindex = index_tree[X];\\n int Yindex = index_tree[Y];\\n if(Xindex+1 >= vec.size() || vec[Xindex].S >= vec[Yindex].S)\\n\\t{\\n\\t cout << \\\"False\\\" << endl;\\n\\t return;\\n\\t}\\n\\n for(int i=Xindex+1;i < vec.size() && vec[i].S > vec[Xindex].S;i++)\\n\\t{\\n\\t if(vec[i].F == vec[Yindex].F)\\n\\t {\\n\\t cout << \\\"True\\\" << endl;\\n\\t return;\\n\\t }\\n\\t}\\n\\n cout << \\\"False\\\" << endl;\\n return;\\n }\\n else \\n assert(false);\\n \\n\\n}\\n\\nint main()\\n{\\n int n,m;\\n while(true)\\n {\\n cin >> n >> m;\\n \\n if(!(n+m))\\n\\tbreak;\\n oldest = (1<<28);\\n youngest = -1;\\n cin.ignore();\\n string line;\\n vector<SI> vec;\\n for(int i=0;i<n;i++)\\n\\t{\\n\\t getline(cin,line);\\n\\t\\n\\t split(vec,line);\\n\\t}\\n\\n map<string,int> index_tree;\\n for(int i=0;i<n;i++)\\n\\tindex_tree[vec[i].F] = i;\\n\\n for(int i=0;i<m;i++)\\n\\t{\\n\\t getline(cin,line);\\n\\t \\n\\t ParseAndSolve(vec,index_tree,line.substr(0,line.size()-1));\\n\\t \\n\\t}\\n\\n cout << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1360,\n \"score_of_the_acc\": -0.0032,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1217_585857\",\n \"code_snippet\": \"#include<map>\\n#include<sstream>\\n#include<cstdlib>\\n#include<vector>\\n#include<algorithm>\\n#include<iostream>\\n#include<cassert>\\n#define F first\\n#define S second\\n#define pb push_back\\n#define all(n) n.begin(),n.end()\\nusing namespace std;\\ntypedef pair<string,int> SI;\\n\\nint oldest,youngest;\\n\\nvoid split(vector<SI>& vec,string line)\\n{\\n int space_cnt = 0;\\n for(int i=0;line[i] == ' ';i++,space_cnt++){}\\n\\n vec.push_back(SI(line.substr(space_cnt,line.size()-space_cnt),space_cnt));\\n oldest = min(oldest,space_cnt);\\n youngest = max(youngest,space_cnt);\\n}\\n\\nvoid ParseAndSolve(vector<SI>& vec,map<string,int>& index_tree,map<int,vector<string> >& space_tree,map<string,int>& level_tree,string line)\\n{\\n vector<string> info;\\n stringstream ss(line);\\n string mid;\\n vector<string> ope; \\n \\n\\n for(int i=0;i<ss.str().size();i++)\\n {\\n if((ss >> mid).fail())\\n\\tgoto skip;\\n \\n ope.push_back(mid);\\n \\n }\\n\\n skip:\\n\\n info.push_back(ope[0]);\\n for(int i=1;i<ope.size()-1;i++)\\n {\\n if(ope[i] == \\\"child\\\" || ope[i] == \\\"parent\\\" || ope[i] == \\\"sibling\\\" || ope[i] == \\\"descendant\\\" || ope[i] == \\\"ancestor\\\")\\n\\t{\\n\\t info.push_back(ope[i]);\\n\\t break;\\n\\t}\\n }\\n info.push_back(ope[ope.size()-1].substr(0,ope[ope.size()-1].size()));\\n\\n\\n assert(info.size() == 3);\\n\\n string X,Y;\\n X = info[0],Y = info[2];\\n\\n if(info[1][0] == 'c')\\n {\\n int Yindex = index_tree[Y]; \\n int Xindex = index_tree[X];\\n\\n if(level_tree[X] <= level_tree[Y] || Yindex+1 >= vec.size() || vec[Yindex+1].S != vec[Xindex].S)\\n\\t{\\n\\t cout << \\\"False\\\" << endl;\\n\\t return;\\n\\t}\\n\\n \\n int parent_level = vec[Yindex].S;\\n\\n for(int i=Yindex+1;parent_level < vec[i].S && i < vec.size();i++)\\n\\t{\\n\\n\\t if(vec[i].F == X)\\n\\t {\\n\\t cout << \\\"True\\\" << endl;\\n\\t return;\\n\\t }\\n\\t}\\n\\n cout << \\\"False\\\" << endl;\\n return;\\n }\\n else if(info[1][0] == 'p')\\n {\\n\\n int Xindex = index_tree[X];\\n int Yindex = index_tree[Y];\\n\\n if(level_tree[X] >= level_tree[Y] || Xindex+1 >= vec.size() || vec[Xindex+1].S != vec[Yindex].S )\\n\\t{\\n\\t cout << \\\"False\\\" << endl;\\n\\t return;\\n\\t}\\n\\n\\n int parent_level = vec[Xindex].S;\\n\\n for(int i=Xindex+1;parent_level < vec[i].S && i < vec.size();i++ )\\n\\t{\\n\\t if(vec[i].F == Y)\\n\\t {\\n\\t cout << \\\"True\\\" << endl;\\n\\t return;\\n\\t }\\n\\t}\\n\\n cout << \\\"False\\\" << endl;\\n return;\\n\\n\\n }\\n else if(info[1][0] == 's')\\n {\\n int Xindex = index_tree[X];\\n int Yindex = index_tree[Y];\\n\\n if(vec[Xindex].S != vec[Yindex].S || min(Xindex,Yindex)+1 >= vec.size())\\n\\t{\\n\\t cout << \\\"False\\\" << endl;\\n\\t return;\\n\\t}\\n\\n int sibling_level = vec[Xindex].S;\\n\\n int Maxindex,Minindex;\\n string Maxname,Minname;\\n\\n if(Xindex > Yindex)\\n\\t{\\n\\t Maxindex = Xindex,Minindex = Yindex;\\n\\t Maxname = X,Minname = Y;\\n\\t}\\n else \\n\\t{\\n\\t Maxindex = Yindex,Minindex = Xindex;\\n\\t Maxname = Y,Minname = X;\\n\\t}\\n\\n for(int i=Minindex+1;i<vec.size() && sibling_level <= vec[i].S;i++)\\n\\t{\\n\\t if(Maxname == vec[i].F)\\n\\t {\\n\\t cout << \\\"True\\\" << endl;\\n\\t return;\\n\\t }\\n\\t}\\n cout << \\\"False\\\" << endl;\\n return;\\n\\n }\\n else if(info[1][0] == 'd')\\n {\\n int Xindex = index_tree[X];\\n int Yindex = index_tree[Y];\\n\\n if(Yindex+1 >= vec.size() || vec[Xindex].S <= vec[Yindex].S)\\n\\t{\\n\\t cout << \\\"False\\\" << endl;\\n\\t return;\\n\\t}\\n\\n for(int i=Yindex+1;i<vec.size() && vec[i].S > vec[Yindex].S;i++)\\n\\t{\\n\\t if(vec[i].F == vec[Xindex].F)\\n\\t {\\n\\t cout << \\\"True\\\" << endl;\\n\\t return;\\n\\t }\\n\\t}\\n\\n cout << \\\"False\\\" << endl;\\n return;\\n }\\n else if(info[1][0] == 'a')\\n {\\n int Xindex = index_tree[X];\\n int Yindex = index_tree[Y];\\n if(Xindex+1 >= vec.size() || vec[Xindex].S >= vec[Yindex].S)\\n\\t{\\n\\t cout << \\\"False\\\" << endl;\\n\\t return;\\n\\t}\\n\\n for(int i=Xindex+1;i < vec.size() && vec[i].S > vec[Xindex].S;i++)\\n\\t{\\n\\t if(vec[i].F == vec[Yindex].F)\\n\\t {\\n\\t cout << \\\"True\\\" << endl;\\n\\t return;\\n\\t }\\n\\t}\\n\\n cout << \\\"False\\\" << endl;\\n return;\\n }\\n else \\n assert(false);\\n \\n\\n}\\n\\nint main()\\n{\\n int n,m;\\n while(true)\\n {\\n cin >> n >> m;\\n //cerr << n << \\\" \\\" << m << endl;\\n if(!(n+m))\\n\\tbreak;\\n oldest = (1<<28);\\n youngest = -1;\\n cin.ignore();\\n string line;\\n vector<SI> vec;\\n for(int i=0;i<n;i++)\\n\\t{\\n\\t getline(cin,line);\\n\\t //cerr << line << endl;\\n\\t split(vec,line);\\n\\t}\\n\\n map<int,vector<string> > space_tree;\\n map<string,int> level_tree;\\n map<string,int> index_tree;\\n for(int i=0;i<n;i++)\\n\\t{\\n\\t index_tree[vec[i].F] = i;\\n\\t level_tree[vec[i].F] = vec[i].S;\\n\\t space_tree[vec[i].S].pb(vec[i].F);\\n\\t}\\n\\n for(int i=0;i<m;i++)\\n\\t{\\n\\t getline(cin,line);\\n\\t //cerr << line << endl;\\n\\t ParseAndSolve(vec,index_tree,space_tree,level_tree,line.substr(0,line.size()-1));\\n\\t \\n\\t}\\n\\n cout << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1428,\n \"score_of_the_acc\": -0.0086,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1217_561684\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <string>\\n#include <map>\\nusing namespace std;\\n\\n\\nstruct Person {\\n string name;\\n Person *parent;\\n};\\n\\nconst int MAXN = 1005;\\nint N, M;\\nmap<string, Person*> conv;\\nPerson root, person[MAXN];\\n\\nvoid init() {\\n conv.clear();\\n root.name = \\\"root\\\";\\n root.parent = NULL;\\n}\\n\\nbool child(Person *a, Person *b) { // a is child of b\\n return a->parent == b;\\n}\\n\\nbool sibling(Person *a, Person *b) {\\n return a->parent == b->parent;\\n}\\n\\nbool descendant(Person *a, Person *b) { // a is descendant of b\\n while(a != NULL) {\\n if(a->parent == b) return true;\\n a = a->parent;\\n }\\n return false;\\n}\\n\\nint main() {\\n while(cin >> N >> M && (N|M)) {\\n cin.ignore();\\n init();\\n Person *cp = &root;\\n int depth = -1;\\n for(int i = 0; i < N; ++i) {\\n string line;\\n getline(cin, line);\\n int sp = 0;\\n for(int j = 0; j < line.size() && line[j] == ' '; ++j, ++sp);\\n\\n Person &c = person[i];\\n c.name = line.substr(sp);\\n conv[c.name] = &person[i];\\n\\n if(sp > depth) {\\n c.parent = cp;\\n } else {\\n for(int j = 0; j < depth-sp; ++j) {\\n cp = cp->parent;\\n }\\n c.parent = cp->parent;\\n }\\n cp = &c;\\n depth = sp;\\n }\\n\\n while(M--) {\\n string x, y, type;\\n string dumy;\\n cin >> x >> dumy >> dumy >> type >> dumy >> y;\\n y = y.substr(0, y.size()-1);\\n bool output = false;\\n if(0) {\\n } else if(type == \\\"child\\\") {\\n output = child(conv[x], conv[y]);\\n } else if(type == \\\"parent\\\") {\\n output = child(conv[y], conv[x]);\\n } else if(type == \\\"sibling\\\") {\\n output = sibling(conv[x], conv[y]);\\n } else if(type == \\\"descendant\\\") {\\n output = descendant(conv[x], conv[y]);\\n } else if(type == \\\"ancestor\\\") {\\n output = descendant(conv[y], conv[x]);\\n }\\n cout << (output ? \\\"True\\\" : \\\"False\\\") << endl;\\n }\\n cout << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1344,\n \"score_of_the_acc\": -0.1686,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1217_539282\",\n \"code_snippet\": \"#include <vector>\\n#include <list>\\n#include <map>\\n#include <set>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n#include <algorithm>\\n#include <utility>\\n#include <functional>\\n#include <sstream>\\n#include <iostream>\\n#include <cstdio>\\n#include <cmath>\\n#include <cstdlib>\\n#include <cctype>\\n#include <string>\\n#include <cstring>\\n#include <ctime>\\n#include <climits>\\n#include <cassert>\\nusing namespace std;\\ninline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}\\ntemplate<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\ntypedef vector<string> vs;\\ntypedef pair<int, int> pii;\\ntypedef long long ll;\\n#define ALL(a) (a).begin(),(a).end()\\n#define RALL(a) (a).rbegin(),(a).rend()\\n#define EXIST(s,e) ((s).find(e)!=(s).end())\\n#define FOR(i,a,b) for(int i=(a);i<(b);++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define EACH(t,i,c) for(t::iterator i=(c).begin(); i!=(c).end(); ++i)\\nconst double EPS = 1e-10;\\nconst double PI = acos(-1.0);\\n\\nstruct person{\\n\\tvector<person> children;\\n\\tstring name;\\n\\tperson(string name):name(name){}\\n\\tint construct(vs &names,int indent,int index){\\n\\t\\tFOR(i,index,names.size()){\\n\\t\\t\\tint next_indent=count(ALL(names[i]),' ');\\n\\t\\t\\tif(next_indent==indent+1){\\n\\t\\t\\t\\tstring next_name=names[i];\\n\\t\\t\\t\\tnext_name.erase(next_name.begin(),next_name.begin()+next_indent);\\n\\t\\t\\t\\tchildren.push_back(person(next_name));\\n\\t\\t\\t}else if(next_indent>indent+1){\\n\\t\\t\\t\\ti=children[children.size()-1].construct(names,indent+1,i)-1;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\treturn i;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn names.size();\\n\\t}\\n\\tbool is_child(string a,string b){\\n\\t\\tif(name==b){\\n\\t\\t\\tREP(i,children.size()){\\n\\t\\t\\t\\tif(children[i].name==a){\\n\\t\\t\\t\\t\\treturn true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t\\tREP(i,children.size()){\\n\\t\\t\\tif(children[i].is_child(a,b)){\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn false;\\n\\t}\\n\\tbool is_descendant(string a,string b,bool flag=false){\\n\\t\\tif(flag&&name==a){\\n\\t\\t\\treturn true;\\n\\t\\t}\\n\\t\\tif(name==b||flag){\\n\\t\\t\\tREP(i,children.size()){\\n\\t\\t\\t\\tif(children[i].is_descendant(a,b,true)){\\n\\t\\t\\t\\t\\treturn true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t\\tREP(i,children.size()){\\n\\t\\t\\tif(children[i].is_descendant(a,b)){\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn false;\\n\\t}\\n\\tbool is_parent(string a,string b){\\n\\t\\tif(name==a){\\n\\t\\t\\tREP(i,children.size()){\\n\\t\\t\\t\\tif(children[i].name==b){\\n\\t\\t\\t\\t\\treturn true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t\\tREP(i,children.size()){\\n\\t\\t\\tif(children[i].is_parent(a,b)){\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn false;\\n\\t}\\n\\tbool is_ancestor(string a,string b,bool flag=false){\\n\\t\\tif(flag&&name==b){\\n\\t\\t\\treturn true;\\n\\t\\t}\\n\\t\\tif(name==a||flag){\\n\\t\\t\\tREP(i,children.size()){\\n\\t\\t\\t\\tif(children[i].is_ancestor(a,b,true)){\\n\\t\\t\\t\\t\\treturn true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t\\tREP(i,children.size()){\\n\\t\\t\\tif(children[i].is_ancestor(a,b)){\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn false;\\n\\t}\\n\\tbool is_sibling(string a,string b){\\n\\t\\tbool flag=false;\\n\\t\\tREP(i,children.size()){\\n\\t\\t\\tif(children[i].name==a||children[i].name==b){\\n\\t\\t\\t\\tif(flag){\\n\\t\\t\\t\\t\\treturn true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tflag=true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tREP(i,children.size()){\\n\\t\\t\\tif(children[i].is_sibling(a,b)){\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn false;\\n\\t}\\n};\\n\\nint main(){\\n\\tint n,m;\\n\\twhile(cin>>n>>m,n&&m){\\n\\t\\tstring name;\\n\\t\\tgetline(cin,name);\\n\\t\\tgetline(cin,name);\\n\\t\\tperson root=person(name);\\n\\t\\tvs names;\\n\\t\\tREP(i,n-1){\\n\\t\\t\\tgetline(cin,name);\\n\\t\\t\\tnames.push_back(name);\\n\\t\\t}\\n\\t\\tint index=0;\\n\\t\\troot.construct(names,0,index);\\n\\t\\tREP(i,m){\\n\\t\\t\\tstring a,b,rel,trash;\\n\\t\\t\\tcin>>a>>trash>>trash>>rel>>trash>>b;\\n\\t\\t\\tbool ok;\\n\\t\\t\\tb.erase(b.end()-1,b.end());\\n\\t\\t\\tif(rel==\\\"child\\\"){\\n\\t\\t\\t\\tok=root.is_child(a,b);\\n\\t\\t\\t}else if(rel==\\\"parent\\\"){\\n\\t\\t\\t\\tok=root.is_parent(a,b);\\n\\t\\t\\t}else if(rel==\\\"ancestor\\\"){\\n\\t\\t\\t\\tok=root.is_ancestor(a,b);\\n\\t\\t\\t}else if(rel==\\\"descendant\\\"){\\n\\t\\t\\t\\tok=root.is_descendant(a,b);\\n\\t\\t\\t}else if(rel==\\\"sibling\\\"){\\n\\t\\t\\t\\tok=root.is_sibling(a,b);\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tassert(0);\\n\\t\\t\\t}\\n\\t\\t\\tcout<<(ok?\\\"True\\\":\\\"False\\\")<<endl;\\n\\t\\t}\\n\\t\\tcout<<endl;\\n\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 1460,\n \"score_of_the_acc\": -0.3444,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1217_521468\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<vector>\\n#include<queue>\\n#include<deque>\\n#include<map>\\n#include<set>\\n#include<string>\\n#include<sstream>\\n#include<cstdio>\\n#include<cmath>\\n#include<cstring>\\n#include<cctype>\\n#include<climits>\\nusing namespace std;\\n#define REP(i, j) for(int i = 0; i < j; i++)\\n#define FOR(i, j, k) for(int i = j; i < k; i++)\\n#define P pair<int, string>\\nconst int INF = INT_MAX / 2;\\nconst int MAX_M = 1010;\\n\\nP cntSpace(string str){\\n int cnt = 0;\\n while(str[cnt] == ' ') cnt++;\\n return P(cnt, str.substr(cnt));\\n}\\n\\nbool isParent(int x, int y, vector<int> parent){\\n if(parent[y] == x) return true;\\n else return false;\\n}\\n\\nbool checkQ(string str, map<string, int> list_i, vector<int> parent){\\n stringstream ss(str);\\n vector<string> vec;\\n string tmp;\\n while(ss >>tmp) vec.push_back(tmp);\\n\\n int x = list_i[vec[0]];\\n int y = list_i[vec[5].erase(vec[5].size() - 1)];\\n\\n if(vec[3] == \\\"child\\\") return isParent(y, x, parent);\\n if(vec[3] == \\\"parent\\\") return isParent(x, y, parent);\\n if(vec[3] == \\\"sibling\\\") return parent[x] == parent[y];\\n if(vec[3] == \\\"descendant\\\"){\\n int now_x = x;\\n while(parent[now_x] != -1){\\n if(isParent(y, now_x, parent) == true) return true;\\n now_x = parent[now_x];\\n }\\n return false;\\n }\\n if(vec[3] == \\\"ancestor\\\"){\\n int now_y = y;\\n while(parent[now_y] != -1){\\n if(isParent(x, now_y, parent) == true) return true;\\n now_y = parent[now_y];\\n }\\n return false;\\n }\\n}\\n\\n\\n\\nint main(){\\n int m, n;\\n while(cin >>m >>n && (n && m)){\\n string name_line;\\n getline(cin, name_line);\\n\\n vector<int> parent(m);\\n int current_parent_i[MAX_M];\\n map<string, int> list_i;\\n\\n parent[0] = -1;\\n\\n REP(i, m){\\n getline(cin, name_line);\\n\\n P rank_and_name = cntSpace(name_line);\\n current_parent_i[rank_and_name.first + 1] = i;\\n list_i[rank_and_name.second] = i;\\n\\n if(i != 0){\\n int now_parent = current_parent_i[rank_and_name.first];\\n parent[i] = now_parent;\\n }\\n }\\n\\n REP(i, n){\\n string q;\\n getline(cin, q);\\n bool ans = checkQ(q, list_i, parent);\\n if(ans) cout <<\\\"True\\\" <<endl;\\n else cout <<\\\"False\\\" <<endl;\\n }\\n cout <<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 1432,\n \"score_of_the_acc\": -1.0089,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1217_521127\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<vector>\\n#include<queue>\\n#include<deque>\\n#include<map>\\n#include<set>\\n#include<string>\\n#include<sstream>\\n#include<cstdio>\\n#include<cmath>\\n#include<cstring>\\n#include<cctype>\\n#include<climits>\\nusing namespace std;\\n#define REP(i, j) for(int i = 0; i < j; i++)\\n#define FOR(i, j, k) for(int i = j; i < k; i++)\\n#define P pair<int, string>\\nconst int INF = INT_MAX / 2;\\nconst int MAX_M = 1010;\\n\\nP cntSpace(string str){\\n int cnt = 0;\\n while(str[cnt] == ' ') cnt++;\\n return P(cnt, str.substr(cnt));\\n}\\n\\nbool isParent(int x, int y, vector<int> parent){\\n if(parent[y] == x) return true;\\n else return false;\\n}\\n\\nbool checkQ(string str, map<string, int> list_i, vector<int> parent){\\n stringstream ss(str);\\n vector<string> vec;\\n string tmp;\\n while(ss >>tmp) vec.push_back(tmp);\\n\\n int x = list_i[vec[0]];\\n int y = list_i[vec[5].erase(vec[5].size() - 1)];\\n\\n if(vec[3] == \\\"child\\\") return isParent(y, x, parent);\\n if(vec[3] == \\\"parent\\\") return isParent(x, y, parent);\\n if(vec[3] == \\\"sibling\\\") return parent[x] == parent[y];\\n if(vec[3] == \\\"descendant\\\"){\\n int now_x = x;\\n while(parent[now_x] != -1){\\n if(isParent(y, now_x, parent) == true) return true;\\n now_x = parent[now_x];\\n }\\n return false;\\n }\\n if(vec[3] == \\\"ancestor\\\"){\\n int now_y = y;\\n while(parent[now_y] != -1){\\n if(isParent(x, now_y, parent) == true) return true;\\n now_y = parent[now_y];\\n }\\n return false;\\n }\\n}\\n\\n\\n\\nint main(){\\n while(true){\\n string str_m_n;\\n getline(cin, str_m_n);\\n stringstream ss(str_m_n);\\n int m, n;\\n ss >>m >>n;\\n if(!m && !n) break;\\n\\n vector<int> parent(m);\\n int current_parent_i[MAX_M];\\n map<string, int> list_i;\\n\\n parent[0] = -1;\\n\\n REP(i, m){\\n string name_line;\\n getline(cin, name_line);\\n stringstream ss(name_line);\\n P rank_and_name = cntSpace(name_line);\\n current_parent_i[rank_and_name.first + 1] = i;\\n list_i[rank_and_name.second] = i;\\n if(i != 0){\\n int now_parent = current_parent_i[rank_and_name.first];\\n parent[i] = now_parent;\\n }\\n }\\n\\n REP(i, n){\\n string q;\\n getline(cin, q);\\n bool ans = checkQ(q, list_i, parent);\\n if(ans) cout <<\\\"True\\\" <<endl;\\n else cout <<\\\"False\\\" <<endl;\\n }\\n cout <<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 1432,\n \"score_of_the_acc\": -1.0089,\n \"final_rank\": 19\n }\n]","isConversational":false}}},{"rowIdx":681,"cells":{"group_id":{"kind":"string","value":"aoj_1221_cpp"},"problem_description":{"kind":"string","value":"Problem F:\nNumoeba\nA scientist discovered a strange variation of amoeba. The scientist named it\nnumoeba\n. A numoeba, though it looks like an amoeba, is actually a community of cells, which always forms a tree.\nThe scientist called the cell\nleader\nthat is at the root position of the tree. For example, in Fig. 1, the leader is\nA\n. In a numoeba, its leader may change time to time. For example, if\nE\ngets new leadership, the tree in Fig. 1 becomes one in Fig. 2. We will use the terms root, leaf, parent, child and subtree for a numoeba as defined in the graph theory.\nNumoeba changes its physical structure at every biological clock by cell division and cell death. The leader may change depending on this physical change.\nThe most astonishing fact about the numoeba cell is that it contains an organic unit called\nnumbosome\n, which represents an odd integer within the range from 1 to 12,345,677. At every biological clock, the value of a numbosome changes from n to a new value as follows:\nThe maximum odd factor of 3\nn\n+ 1 is calculated. This value can be obtained from 3\nn\n+ 1 by repeating division by 2 while even.\nIf the resulting integer is greater than 12,345,678, then it is subtracted by 12,345,678.\nFor example, if the numbosome value of a cell is 13, 13 × 3 + 1 = 40 is divided by 2\n3\n= 8 and a new numbosome value 5 is obtained. If the numbosome value of a cell is 11,111,111, it changes to 4,320,989, instead of 16,666,667. If 3\nn\n+ 1 is a power of 2, yielding 1 as the result, it signifies the death of the cell as will be described below.\nAt every biological clock, the next numbosome value of every cell is calculated and the fate of the cell and thereby the fate of numoeba is determined according to the following steps.\nA cell that is a leaf and increases its numbosome value is designated as a\ncandidate\nleaf.\nA cell dies if its numbosome value becomes 1. If the dying cell is the leader of the numoeba, the numoeba dies as a whole. Otherwise, all the cells in the subtree from the dying cell (including itself) die. However, there is an exceptional case where the cells in the subtree do not necessarily die; if there is only one child cell of the dying non-leader cell, the child cell will replace the dying cell. Thus, a straight chain simply shrinks if its non-leader constituent dies.\nFor example, consider a numoeba with the leader A below.\nIf the leader A dies in (1), the numoeba dies.\nIf the cell D dies in (1), (1) will be as follows.\nAnd, if the cell E dies in (1), (1) will be as follows.\nNote that this procedure is executed sequentially, top-down from the root of the numoeba to leaves. If the cells\nE\nand\nF\nwill die in (1), the death of\nF\nis not detected at the time the procedure examines the cell\nE\n. The numoeba, therefore, becomes (3). One should not consider in such a way that the death of\nF\nmakes\nG\nthe only child of\nE\n, and, therefore,\nG\nwill replace the dying\nE\n.\nIf a\ncandidate\nleaf survives with the numbosome value of\nn\n, it spawns a cell as its child,\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1221_1092280","code_snippet":"#include<iostream>\n#include<vector>\n#include<tuple>\n#include<algorithm>\nusing namespace std;\n\nconst int MOD = 12345678;\nconst int NIL = -1;\n\nclass Numoeba {\npublic:\n Numoeba(const int n) :max_cell_(1), root_(0) {create_cell(n);}\n tuple<int, int> die() {\n for(int step = 1; step <= 500; ++step) {\n int t = dead_.size() - count(dead_.begin(), dead_.end(), true);\n max_cell_ = max(max_cell_, t);\n vector<int> candidate;\n int new_leader_id, new_leader_n = NIL;\n// cout<<step<<endl;\n// cout<<\"root: \"<<root_<<endl;\n// cout<<\"dead: \";for(const auto&d:dead_)cout<<\" \"<<d;cout<<endl;\n// cout<<\"numb: \";for(const auto&d:numbosome_)cout<<\" \"<<d;cout<<endl;\n if(traverse(root_, NIL, candidate, new_leader_id, new_leader_n)) return tuple<int, int>(step, max_cell_);\n for(auto& e: edge_) for(int i = 0; i < e.size(); ++i) if(dead_[e[i]]) e.erase(e.begin() + i--);\n// cout<<\"candidate: \";for(const auto&d:candidate)cout<<\" \"<<d;cout<<endl;\n for(const auto& c: candidate) {\n int n = (numbosome_[c] + 1) / 2;\n if(!(n & 1)) ++n;\n// if(n <= 1) continue;\n// if(dead_[c]) continue;\n add_child(c, create_cell(n));\n }\n if(new_leader_id == NIL) continue;\n root_ = new_leader_id;\n int n = (numbosome_[root_] + 1) / 2;\n if(!(n & 1)) --n;\n// if(n <= 1) continue;\n add_child(root_, create_cell(n));\n }\n return tuple<int, int>(NIL, max_cell_);\n }\nprivate:\n bool traverse(const int current, const int previous, vector<int>& candidate, int& new_leader_id, int& new_leader_n) {\n int pn = numbosome_[current];\n if(update(current) == 1) {\n dead_[current] = true;\n if(current == root_) return true;\n if(edge_[current].size() == 2) {\n int next = edge_[current][0];\n if(next == previous) next = edge_[current][1];\n for(auto& id: edge_[previous]) if(id == current) id = next;\n for(auto& id: edge_[next]) if(id == current) id = previous;\n return traverse(next, previous, candidate, new_leader_id, new_leader_n);\n }\n for(const auto& next: edge_[current]) if(next != previous) erase(next, current);\n return false;\n }\n if(numbosome_[current] > pn && edge_[current].size() <= 1) candidate.push_back(current);\n if(numbosome_[current] == new_leader_n) new_leader_id = NIL;\n if(numbosome_[current] > new_leader_n) {\n new_leader_n = numbosome_[current];\n new_leader_id = current;\n }\n for(const auto& next: edge_[current]) {\n if(next == previous) continue;\n if(traverse(next, current, candidate, new_leader_id, new_leader_n)) return true;\n }\n return false;\n }\n void erase(const int current, const int previous) {\n dead_[current] = true;\n for(const auto& next: edge_[current]) if(next != previous) erase(next, current);\n }\n int create_cell(const int n) {\n numbosome_.push_back(n);\n dead_.push_back(false);\n edge_.push_back(vector<int>());\n return (dead_.size() - 1);\n }\n void add_child(const int pid, const int cid) {\n edge_[pid].push_back(cid);\n edge_[cid].push_back(pid);\n }\n int update(const int id) {\n numbosome_[id] = numbosome_[id] * 3 + 1;\n while(!(numbosome_[id] & 1)) numbosome_[id] >>= 1;\n if(numbosome_[id] > MOD) numbosome_[id] -= MOD;\n// while(numbosome_[id] > MOD) numbosome_[id] -= MOD;\n return numbosome_[id];\n }\n int root_;\n int max_cell_;\n vector<int> numbosome_;\n vector<bool> dead_;\n vector<vector<int>> edge_;\npublic:\nvoid print(){\ncout<<\"root: \"<<root_<<endl;\ncout<<\"dead: \";for(const auto&d:dead_)cout<<\" \"<<d;cout<<endl;\ncout<<\"numb: \";for(const auto&d:numbosome_)cout<<\" \"<<d;cout<<endl;\ncout<<dead_.size()<<endl;\n}\n};\n\n\nint main() {\n int k;\n while(cin >> k, k) {\n Numoeba n(k);\n int step, numbosome;\n tie(step, numbosome) = n.die();\n cout << step << \" \" << numbosome << endl;\n// n.print();\n }\n}","accuracy":1,"time_ms":10,"memory_kb":1484,"score_of_the_acc":-1,"final_rank":4},{"submission_id":"aoj_1221_568200","code_snippet":"#include<cstdio>\n#include<vector>\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\n\nint idx,val[5000];\nbool cand[5000]; // candidate leaf かどうか\nvector<int> G[5000];\n\n// u を根とする部分木を削除\nvoid destroy(int u,int pre){\n\trep(i,G[u].size()) if(G[u][i]!=pre) destroy(G[u][i],u);\n\tG[u].clear();\n}\n\n// numbosome の計算\nvoid dfs0(int u,int pre){\n\tint a=3*val[u]+1;\n\twhile(a%2==0) a/=2;\n\tif(a>12345678) a-=12345678;\n\tcand[u]=(G[u].size()<=1&&val[u]<a);\n\tval[u]=a;\n\trep(i,G[u].size()) if(G[u][i]!=pre) dfs0(G[u][i],u);\n}\n\n// val==1 の頂点を削除\nbool dfs1(int u,int pre){\n\tif(val[u]==1){\n\t\tif(pre!=-1 && G[u].size()==2){ // special case\n\t\t\tint v=(G[u][0]==pre?G[u][1]:G[u][0]);\n\t\t\tG[u].clear();\n\t\t\trep(i,G[v].size()) if(G[v][i]==u) G[v].erase(G[v].begin()+i);\n\t\t\tG[pre].push_back( v );\n\t\t\tG[ v ].push_back(pre);\n\t\t\tdfs1(v,pre);\n\t\t\treturn false;\n\t\t}\n\t\telse{\n\t\t\tdestroy(u,pre);\n\t\t\treturn pre==-1;\n\t\t}\n\t}\n\telse{\n\t\trep(i,G[u].size()) if(G[u][i]!=pre) {\n\t\t\tint v=G[u][i];\n\t\t\tif(val[v]==1) G[u].erase(G[u].begin()+i--);\n\t\t\tdfs1(v,u);\n\t\t}\n\t\treturn false;\n\t}\n}\n\n// leaf bonus の処理\nvoid dfs2(int u,int pre){\n\tif(cand[u]){\n\t\tG[ u ].push_back(idx);\n\t\tG[idx].push_back( u );\n\t\tval[idx]=(val[u]+1)/2;\n\t\tif(val[idx]%2==0) val[idx]++;\n\t\tidx++;\n\t}\n\telse{\n\t\trep(i,G[u].size()) if(G[u][i]!=pre) dfs2(G[u][i],u);\n\t}\n}\n\n// 生きている頂点のリストを求める\nvoid dfs3(int u,int pre,vector<int> &res){\n\tres.push_back(u);\n\trep(i,G[u].size()) if(G[u][i]!=pre) dfs3(G[u][i],u,res);\n}\n\nint main(){\n\twhile(scanf(\"%d\",val),val[0]){\n\t\tidx=1;\n\t\tint t,leader=0,sz=1;\n\t\tfor(t=1;;t++){\n\t\t\t// step 0\n\t\t\tdfs0(leader,-1);\n\n\t\t\t// step 1\n\t\t\tif(dfs1(leader,-1)) break;\n\n\t\t\t// step 2\n\t\t\tdfs2(leader,-1);\n\n\t\t\t// step 3\n\t\t\tvector<int> seq;\n\t\t\tdfs3(leader,-1,seq);\n\t\t\tint next=-1;\n\t\t\tbool dup=false;\n\t\t\trep(i,seq.size()){\n\t\t\t\tif(next==-1 || val[seq[i]]>val[next]){\n\t\t\t\t\tnext=seq[i];\n\t\t\t\t\tdup=false;\n\t\t\t\t}\n\t\t\t\telse if(val[seq[i]]==val[next]){\n\t\t\t\t\tdup=true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(!dup){ // leader bonus\n\t\t\t\tleader=next;\n\t\t\t\tG[leader].push_back(idx);\n\t\t\t\tG[idx].push_back(leader);\n\t\t\t\tval[idx]=(val[leader]+1)/2;\n\t\t\t\tif(val[idx]%2==0) val[idx]--;\n\t\t\t\tseq.push_back(idx);\n\t\t\t\tidx++;\n\t\t\t}\n\n\t\t\tsz=max(sz,(int)seq.size());\n\t\t}\n\n\t\tprintf(\"%d %d\\n\",t,sz);\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1344,"score_of_the_acc":-1.0307,"final_rank":5},{"submission_id":"aoj_1221_412802","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <functional>\nusing namespace std;\n\nconst int MOD = 12345678;\n\n\nclass Cell\n{\npublic:\n int v;\n Cell* parent;\n bool visited, candidate,leaf;\n vector<Cell*> child;\n\n Cell(int v, Cell* parent)\n :v(v),parent(parent),visited(false),candidate(false),leaf(false)\n {}\n\n void update() {\n int p = v;\n\tv = 3*v + 1;\n\n while(v%2!=1) {\n v/=2;\n }\n\n v %= MOD;\n\tif(p < v) candidate = true;\n }\n};\n\nint count(Cell* cell)\n{\n\tint res = 1;\n\tfor(int i=0; i<cell->child.size(); i++)\n\t\tres += count(cell->child[i]);\n\n\treturn res;\n}\n\nvoid getValues(Cell* cell, vector<int>& res)\n{\n\tres.push_back(cell->v);\n\tfor(int i=0; i<cell->child.size(); i++) {\n\t\tgetValues(cell->child[i], res);\n\t}\n}\n\nCell* getNewLeader(Cell* cell, int v)\n{\n\tif(cell->v == v) return cell;\n\n\tfor(int i=0; i<cell->child.size(); i++){\n\t\tCell* res = getNewLeader(cell->child[i], v);\n\t\tif(res != NULL) return res;\n\t}\n\n\treturn NULL;\n}\n\nvoid checkLeaf(Cell* cell)\n{\n\tif(cell->child.size() == 0) cell->leaf = true;\n\tfor(int i=0; i<cell->child.size(); i++) {\n\t\tcheckLeaf(cell->child[i]);\n\t}\n}\n\nCell* selectLeader(Cell* root, bool& uniq)\n{\n\tvector<int> values;\n\tgetValues(root, values);\n\n\tsort(values.begin(), values.end(), greater<int>());\n\n\tif(values[0] == values[1]) {\n\t\tuniq = false;\n\t\treturn root->child[0];\n\t}\n\n\tuniq = true;\n\tCell* newleader = getNewLeader(root, values[0]);\n\n\treturn newleader;\n}\n\nvoid add(Cell* parent, int v)\n{\n\tparent->child.push_back(new Cell(v, parent));\n}\n\nvoid leaderBonus(Cell* leader)\n{\n int v = (leader->v+1)/2;\n if(v%2==0) v -= 1;\n\n add(leader, v);\n}\n\nvoid leafBonus(Cell* cell)\n{\n\tif(cell->leaf){\n int v = (cell->v+1)/2;\n if(v%2==0) v += 1;\n\n if(cell->candidate) {\n\t\t add(cell, v);\n\t }\n }\n\telse{\n for(int i=0; i<cell->child.size(); i++)\n\t\tleafBonus(cell->child[i]);\n }\n}\n\nvoid newTree(Cell* prev, Cell* next)\n{\n prev->visited = true;\n Cell* c = new Cell(prev->v, next);\n next->child.push_back(c);\n\n if(prev->parent) {\n if(!prev->parent->visited) {\n if(prev->parent->v != -1) {\n\t\tprev->parent->visited = true;\n\t\tnewTree(prev->parent, c);\n }\n }\n \n for(int i=0; i<prev->child.size(); i++) {\n if(!prev->child[i]->visited) {\n\t\tprev->child[i]->visited = true;\n\t\tnewTree(prev->child[i], c);\n }\n }\n }\n}\n\nvoid remove(Cell *cell)\n{\n\tfor(int i=0; i<cell->child.size(); i++) {\n\t\tremove(cell->child[i]);\n\t}\n\n\tdelete cell;\n}\n\nbool died(Cell *cell, bool leader)\n{\n\tif(cell->v == 1) {\n\t\tif(leader) {\n\t\t\tremove(cell);\n\t\t}\n\t\telse {\n\t\t\tCell* parent = cell->parent;\n\t\t\tint n=-1;\n\t\t\tfor(int i=0; i<parent->child.size(); i++) {\n\t\t\t\tif(parent->child[i] == cell) \n\t\t\t\t\tn = i;\n\t\t\t}\n\n\t\t\tparent->child.erase(parent->child.begin()+n);\n\t\t\t\n\t\t\tif(cell->child.size() != 1)\n\t\t\t{\n\t\t\t\tremove(cell);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tCell* grandchild = cell->child[0];\n\n\t\t\t\tparent->child.push_back(grandchild);\n\t\t\t\tgrandchild->parent = parent;\n\t\t\n\t\t\t\tdelete cell;\n\t\t\t\tcell = NULL;\n\t\t\t}\n\n\t\t\tdied(parent, false);\n\t\t\treturn true;\n\t\t}\n\t}\n\telse {\n\t\tfor(int i=0; i<cell->child.size(); i++) \n\t\t\tif(died(cell->child[i], false)) break;\n\t}\n\t\n\n return false;\n}\n\nvoid update(Cell* cell)\n{\n\tcell->update();\n\tfor(int i = 0; i < cell->child.size(); i++) {\n\t\tupdate(cell->child[i]);\n\t}\n}\n\nvoid solve(int v)\n{\n Cell* root = new Cell(-1, NULL);\n root->visited = true;\n add(root, v);\n\n Cell* leader = root->child[0];\n \n int cycle = 0, m = 1;\n while(1) {\n cycle++;\n\n update(leader);\n\tcheckLeaf(leader);\n\n\tdied(root, true);\n\tif(root->child.size() == 0) break;\n\n\tleafBonus(leader);\n\n Cell* newroot = new Cell(-1, NULL);\n\tnewroot->visited = true;\n\n\tbool uniq;\n leader = selectLeader(root, uniq);\n newTree(leader, newroot);\n\n\tleader = newroot->child[0]; \n\n if(uniq) leaderBonus(leader);\n\n m = max(m, count(leader));\n\n remove(root->child[0]);\n\n root = newroot;\n }\n\n cout << cycle << \" \" << m << endl;\n}\n\nint main()\n{\n int N;\n while(cin >> N, N)\n {\n solve(N);\n }\n}","accuracy":1,"time_ms":90,"memory_kb":1008,"score_of_the_acc":-1.6792,"final_rank":8},{"submission_id":"aoj_1221_366863","code_snippet":"#include<cstdio>\n#include<vector>\n#include<algorithm>\n#include<set>\n#include<map>\nusing namespace std;\ntypedef set<int> Edge;\nstruct Cell\n{\n\tint v;\n\tEdge edge;\n\tCell(int v):v(v),edge(){}\n\tCell():v(-1),edge(){}\n};\ntypedef map<int,Cell>Numoeba;\ntypedef Numoeba::value_type Pair;\n\nNumoeba numoeba;\nint makeIndex;\n\nint Collatz(int x)\n{\n\tx=3*x+1;\n\twhile(x%2==0)\n\t\tx/=2;\n\tif(x>=12345678)\n\t\tx-=12345678;\n\treturn x;\n}\nvoid ConnectEdge(int x,int y)\n{\n\tnumoeba.find(x)->second.edge.insert(y);\n\tnumoeba.find(y)->second.edge.insert(x);\n}\nvoid EraseEdge(int controlIndex,int erasedIndex)\n{\n\tnumoeba.find(controlIndex)->second.edge.erase(erasedIndex);\n}\nvoid Spawn(int K,int fromID)\n{\n\tnumoeba.insert( Pair(makeIndex,Cell(K)) );\n\tConnectEdge(fromID, makeIndex);\n\t++makeIndex;\n}\nvoid Kill(int id,int fromID,bool willDie)\n{\n\tconst Cell &cell=numoeba.find(id)->second;\n\tif(cell.v==1 || willDie)\n\t{\n\t\tif(!willDie && fromID>=0 && cell.edge.size()==2)\n\t\t{\n\t\t\tEdge::iterator ite=cell.edge.begin();\n\t\t\tif(*ite==fromID)\n\t\t\t\t++ite;\n\t\t\tint childID = *ite;\n\t\t\tEraseEdge(fromID, id);\n\t\t\tEraseEdge(childID,id);\n\t\t\tConnectEdge(childID,fromID);\n\t\t\tnumoeba.erase(id);\n\t\t\tKill(childID,fromID,false);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tfor(Edge::iterator ite=cell.edge.begin(); ite!=cell.edge.end();)\n\t\t\t{\n\t\t\t\tif(*ite!=fromID)\n\t\t\t\t\tKill(*(ite++), id, true);\n\t\t\t\telse ++ite;\n\t\t\t}\n\t\t\tif(fromID>=0)\n\t\t\t\tEraseEdge(fromID,id);\n\t\t\tnumoeba.erase(id);\n\t\t}\n\t}\n\telse\n\t{\n\t\tfor(Edge::iterator ite=cell.edge.begin(); ite!=cell.edge.end();)\n\t\t\tif(*ite!=fromID)\n\t\t\t\tKill(*(ite++),id,false);\n\t\t\telse ++ite;\n\t}\n}\n\nint main()\n{\n\tvector<int>candidate;\n\tint K,T,maxCell,rootIndex, i;\n\twhile(scanf(\"%d\",&K),K)\n\t{\n\t\tmaxCell=1;\n\t\trootIndex = makeIndex = 0;\n\t\tnumoeba.clear();\n\t\tnumoeba.insert(Pair(makeIndex++,Cell(K)));\n\t\tfor(T=1;;++T)\n\t\t{\n\t\t\tcandidate.clear();\n\t\t\tfor(Numoeba::iterator ite=numoeba.begin(); ite!=numoeba.end(); ++ite)\n\t\t\t{\n\t\t\t\tint x=Collatz(ite->second.v);\n\t\t\t\tif(x>ite->second.v && (ite->second.edge.size()==1&&ite->first!=rootIndex || numoeba.size()==1))\n\t\t\t\t\tcandidate.push_back(ite->first);\n\t\t\t\tite->second.v = x;\n\t\t\t}\n\t\t\tKill(rootIndex,-1,false);\n\t\t\tif(numoeba.empty())\n\t\t\t\tbreak;\n\n\t\t\tfor(i=0; i<candidate.size(); ++i)\n\t\t\t{\n\t\t\t\tNumoeba::iterator ite=numoeba.find(candidate[i]);\n\t\t\t\tif(ite!=numoeba.end())\n\t\t\t\t{\n\t\t\t\t\tint v=(ite->second.v+1)/2;\n\t\t\t\t\tif(v%2==0)++v;\n\t\t\t\t\tSpawn(v,candidate[i]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tint maxV=0, count=0, index=-1;\n\t\t\tfor(Numoeba::iterator ite=numoeba.begin(); ite!=numoeba.end(); ++ite)\n\t\t\t{\n\t\t\t\tint v=ite->second.v;\n\t\t\t\tif(maxV < v)\n\t\t\t\t{\n\t\t\t\t\tmaxV = v;\n\t\t\t\t\tindex=ite->first;\n\t\t\t\t\tcount=1;\n\t\t\t\t}\n\t\t\t\telse if(maxV == v)\n\t\t\t\t\t++count;\n\t\t\t}\n\t\t\tif(count==1)\n\t\t\t{\n\t\t\t\tint v=(maxV+1)/2;\n\t\t\t\tif(v%2==0)--v;\n\t\t\t\tSpawn(v,index);\n\t\t\t\trootIndex = index;\n\t\t\t}\n\t\t\tmaxCell = max<int>(maxCell, numoeba.size());\n\t\t}\n\t\tprintf(\"%d %d\\n\",T,maxCell);\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":30,"memory_kb":868,"score_of_the_acc":-0.8349,"final_rank":3},{"submission_id":"aoj_1221_260254","code_snippet":"#include <iostream>\n#include <sstream>\n#include <iomanip>\n#include <algorithm>\n#include <cmath>\n#include <string>\n#include <vector>\n#include <list>\n#include <queue>\n#include <stack>\n#include <set>\n#include <map>\n#include <bitset>\n#include <numeric>\n#include <climits>\n#include <cfloat>\nusing namespace std;\n\nclass Cell\n{\npublic:\n int value;\n list<Cell*> to;\n bool candidate;\n\n Cell(int value0){\n value = value0;\n }\n ~Cell(){\n list<Cell*>::iterator it = to.begin();\n while(it != to.end()){\n (*it)->to.erase(find((*it)->to.begin(), (*it)->to.end(), this));\n delete *it;\n ++ it;\n }\n }\n\n void updateValue()\n {\n long long a = value;\n a *= 3;\n ++ a;\n while(a % 2 == 0)\n a /= 2;\n -- a;\n a %= 12345678;\n ++ a;\n candidate = (a > value);\n value = a;\n }\n\n void update(Cell* prev)\n {\n updateValue();\n candidate &= (to.size() == 0 || (prev != NULL && to.size() == 1));\n\n if(value == 1){\n if(prev != NULL && to.size() == 2){\n list<Cell*>::iterator it = to.begin();\n if(*it == prev)\n ++ it;\n prev->to.push_back(*it);\n *find((*it)->to.begin(), (*it)->to.end(), this) = prev;\n to.erase(it);\n }\n return;\n }\n\n list<Cell*>::iterator it = to.begin();\n while(it != to.end()){\n if(*it != prev){\n (*it)->update(this);\n if((*it)->value == 1){\n (*it)->to.erase(find((*it)->to.begin(), (*it)->to.end(), this));\n delete *it;\n it = to.erase(it);\n }else{\n ++ it;\n }\n }else{\n ++ it;\n }\n }\n\n if(candidate){\n int a = (value + 1) / 2;\n if(a % 2 == 0)\n ++ a;\n Cell* c = new Cell(a);\n c->to.push_back(this);\n to.push_back(c);\n }\n }\n\n static Cell* maxCell;\n static int maxValue;\n static bool ng;\n int findMax(Cell* prev)\n {\n if(value > maxValue){\n maxValue = value;\n maxCell = this;\n ng = false;\n }else if(value == maxValue){\n ng = true;\n }\n\n int num = 1;\n list<Cell*>::iterator it = to.begin();\n while(it != to.end()){\n if(*it != prev){\n num += (*it)->findMax(this);\n }\n ++ it;\n }\n\n return num;\n }\n\n void addLeaderBonus()\n {\n int a = (value + 1) / 2;\n if(a % 2 == 0)\n -- a;\n Cell* c = new Cell(a);\n c->to.push_back(this);\n to.push_back(c);\n }\n};\nCell* Cell::maxCell;\nint Cell::maxValue;\nbool Cell::ng;\n\nCell* leader;\n\nint main()\n{\n for(;;){\n int n;\n cin >> n;\n if(n == 0)\n return 0;\n\n leader = new Cell(n);\n int t = 0;\n int ret = 1;\n for(;;){\n ++ t;\n leader->update(NULL);\n if(leader->value == 1)\n break;\n\n Cell::maxValue = -1;\n int num = leader->findMax(NULL);\n if(!Cell::ng){\n leader = Cell::maxCell;\n leader->addLeaderBonus();\n ++ num;\n }\n ret = max(ret, num);\n }\n\n cout << t << ' ' << ret << endl;\n\n delete leader;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":0,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_1221_90736","code_snippet":"#include<cstdlib>\n#include<cstdio>\n#include<iostream>\n#include<vector>\nusing namespace std;\n#define REP(i,b,n) for(int i=b;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define ALL(C) (C).begin(),(C).end()\n#define pb push_back\n\nclass Tree{\npublic:\n int value;\n vector<Tree*> child;\n Tree *parent;\n bool iscand;\n Tree(){};\n Tree(int tv,Tree *tp){\n child.clear();\n parent=tp;\n value=tv;\n iscand=false;\n child.pb(tp);\n }\n bool isvalid(int i){\n if (child[i] == NULL || child[i] == parent)return false;\n return true;\n }\n void del(Tree *now){\n rep(i,child.size()){\n if (now == child[i]){\n\tchild.erase(child.begin()+i);\n\ti--;\n }\n }\n }\n int count_valid(){\n int cnt=0;\n rep(i,child.size()){\n if (isvalid(i))cnt++;\n }\n return cnt;\n }\n};\n\nint compute(int n){\n n = 3*n+1;\n while(n%2 == 0)n/=2;\n if (n > 12345678)n-=12345678;\n return n;\n}\n\nvoid update(Tree *now){\n rep(i,now->child.size()){\n if (!now->isvalid(i))continue;\n update(now->child[i]);\n }\n int tmp=now->value;\n now->value=compute(now->value);\n if (now->count_valid() ==0 && tmp < now->value)now->iscand=true;\n else now->iscand=false;\n}\n\n\nvoid get_all_death(Tree *now,vector<Tree*> &wildel){\n rep(i,now->child.size()){\n if (!now->isvalid(i))continue;\n get_all_death(now->child[i],wildel);\n }\n wildel.pb(now);\n}\n\nbool death(Tree *now,vector<Tree*> &wildel){\n if (now->value == 1){\n int cnt = 0;//count child\n Tree *ins=NULL;\n rep(i,now->child.size()){\n if (now->isvalid(i)){\n\tcnt++;\n\tins=now->child[i];\n }\n }\n if (cnt == 1 && now->parent != NULL){\n now->parent->child.pb(ins);//because of chain\n ins->parent=now->parent;\n ins->del(now);\n ins->child.pb(now->parent);\n\n wildel.pb(now);\n }else get_all_death(now,wildel);\n return true;\n }\n\n rep(i,now->child.size()){\n if (!now->isvalid(i))continue;\n if (death(now->child[i],wildel)){\n now->child.erase(now->child.begin()+i);\n i--;\n }\n }\n return false;//survive\n}\n\nvoid make_child(Tree *now){\n rep(i,now->child.size()){\n if (!now->isvalid(i))continue;\n make_child(now->child[i]);\n }\n \n if (now->iscand){\n int newvalue = (now->value+1)/2;\n if (newvalue%2 == 0)newvalue++;\n Tree *newnode;\n newnode = new Tree(newvalue,now);\n now->child.pb(newnode);\n }\n}\n\nvoid find_new_leader(Tree *now,int &maxval,int &maxcnt,Tree* &who){\n rep(i,now->child.size()){\n if (!now->isvalid(i))continue;\n find_new_leader(now->child[i],maxval,maxcnt,who);\n }\n \n if (now->value > maxval){\n maxval=now->value;\n maxcnt=1;\n who=now;\n }else if (now->value == maxval)maxcnt++;\n}\n\nvoid replace(Tree *now,Tree *parent){\n if (now == NULL)return;\n replace(now->parent,now);\n now->parent=parent;\n}\n\nTree* find_leader(Tree *root){\n int maxval=0,maxcnt=0;\n Tree *who=NULL;\n find_new_leader(root,maxval,maxcnt,who);\n if (maxcnt == 1){\n replace(who,NULL);\n int newvalue = (who->value+1)/2;\n if (newvalue %2 == 0)newvalue--;\n\n Tree *bonus;\n bonus=new Tree(newvalue,who);\n who->child.pb(bonus);\n return who;\n }else return root;\n}\n\nvoid del_travarse(Tree *now,vector<Tree*> &wildel){\n rep(i,now->child.size()){\n if (!now->isvalid(i))continue;\n del_travarse(now->child[i],wildel);\n }\n\n rep(i,wildel.size()){\n now->del(wildel[i]);\n }\n}\n\nbool operation_death(Tree *root){\n bool ret=false;\n vector<Tree*> wildel;\n if (death(root,wildel))ret=true;\n del_travarse(root,wildel);\n rep(i,wildel.size())free(wildel[i]);\n return ret;\n}\n\nvoid count_node(Tree *now,int &cnt){\n cnt++;\n rep(i,now->child.size()){\n if (!now->isvalid(i))continue;\n count_node(now->child[i],cnt);\n }\n}\n\nvoid solve(int val){\n Tree *root;\n root=new Tree(val,NULL);\n int cnt=1;\n int maxnum=1;\n while(true){\n update(root);\n if (operation_death(root))break;\n make_child(root);\n root = find_leader(root);\n int tmp = 0;\n count_node(root,tmp);\n maxnum=max(maxnum,tmp);\n cnt++;\n }\n \n cout << cnt <<\" \" << maxnum << endl;\n return;\n}\n\nmain(){\n int n;\n while(cin>>n && n){\n solve(n);\n }\n}","accuracy":1,"time_ms":40,"memory_kb":0,"score_of_the_acc":-0.375,"final_rank":2},{"submission_id":"aoj_1221_90731","code_snippet":"#include<cstdlib>\n#include<cstdio>\n#include<iostream>\n#include<vector>\nusing namespace std;\n#define REP(i,b,n) for(int i=b;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define ALL(C) (C).begin(),(C).end()\n#define pb push_back\n\nclass Tree{\npublic:\n int value;\n vector<Tree*> child;\n Tree *parent;\n bool iscand;\n Tree(){};\n Tree(int tv,Tree *tp){\n child.clear();\n parent=tp;\n value=tv;\n iscand=false;\n child.pb(tp);\n }\n bool isvalid(int i){\n if (child[i] == NULL || child[i] == parent)return false;\n return true;\n }\n void del(Tree *now){\n rep(i,child.size()){\n if (now == child[i]){\n\tchild.erase(child.begin()+i);\n\ti--;\n }\n }\n }\n int count_valid(){\n int cnt=0;\n rep(i,child.size()){\n if (isvalid(i))cnt++;\n }\n return cnt;\n }\n};\n\nint compute(int n){\n n = 3*n+1;\n while(n%2 == 0)n/=2;\n if (n > 12345678)n-=12345678;\n return n;\n}\n\nvoid update(Tree *now){\n rep(i,now->child.size()){\n if (!now->isvalid(i))continue;\n update(now->child[i]);\n }\n int tmp=now->value;\n now->value=compute(now->value);\n if (now->count_valid() ==0 && tmp < now->value)now->iscand=true;\n else now->iscand=false;\n}\n\n\nvoid get_all_death(Tree *now,vector<Tree*> &wildel){\n rep(i,now->child.size()){\n if (!now->isvalid(i))continue;\n get_all_death(now->child[i],wildel);\n }\n wildel.pb(now);\n}\n\nbool death(Tree *now,vector<Tree*> &wildel){\n if (now->value == 1){\n int cnt = 0;//count child\n Tree *ins=NULL;\n rep(i,now->child.size()){\n if (now->isvalid(i)){\n\tcnt++;\n\tins=now->child[i];\n }\n }\n if (cnt == 1 && now->parent != NULL){\n now->parent->child.pb(ins);//because of chain\n ins->parent=now->parent;\n ins->del(now);\n ins->child.pb(now->parent);\n\n wildel.pb(now);\n }else get_all_death(now,wildel);\n return true;\n }\n\n rep(i,now->child.size()){\n if (!now->isvalid(i))continue;\n if (death(now->child[i],wildel)){\n now->child.erase(now->child.begin()+i);\n i--;\n }\n }\n return false;//survive\n}\n\nvoid make_child(Tree *now){\n rep(i,now->child.size()){\n if (!now->isvalid(i))continue;\n make_child(now->child[i]);\n }\n \n if (now->iscand){\n int newvalue = (now->value+1)/2;\n if (newvalue%2 == 0)newvalue++;\n Tree *newnode;\n newnode = new Tree(newvalue,now);\n now->child.pb(newnode);\n }\n}\n\nvoid find_new_leader(Tree *now,int &maxval,int &maxcnt,Tree* &who){\n rep(i,now->child.size()){\n if (!now->isvalid(i))continue;\n find_new_leader(now->child[i],maxval,maxcnt,who);\n }\n \n if (now->value > maxval){\n maxval=now->value;\n maxcnt=1;\n who=now;\n }else if (now->value == maxval)maxcnt++;\n}\n\nvoid replace(Tree *now,Tree *parent){\n if (now == NULL)return;\n replace(now->parent,now);\n now->parent=parent;\n}\n\nTree* find_leader(Tree *root){\n int maxval=0,maxcnt=0;\n Tree *who=NULL;\n find_new_leader(root,maxval,maxcnt,who);\n if (maxcnt == 1){\n replace(who,NULL);\n int newvalue = (who->value+1)/2;\n if (newvalue %2 == 0)newvalue--;\n\n Tree *bonus;\n bonus=new Tree(newvalue,who);\n who->child.pb(bonus);\n return who;\n }else return root;\n}\n\nvoid del_travarse(Tree *now,vector<Tree*> &wildel){\n rep(i,now->child.size()){\n if (!now->isvalid(i))continue;\n del_travarse(now->child[i],wildel);\n }\n\n rep(i,wildel.size()){\n now->del(wildel[i]);\n }\n}\n\nbool operation_death(Tree *root){\n bool ret=false;\n vector<Tree*> wildel;\n if (death(root,wildel))ret=true;\n // del_travarse(root,wildel);\n // rep(i,wildel.size())free(wildel[i]);\n return ret;\n}\n\nvoid count_node(Tree *now,int &cnt){\n cnt++;\n rep(i,now->child.size()){\n if (!now->isvalid(i))continue;\n count_node(now->child[i],cnt);\n }\n}\n\nvoid solve(int val){\n Tree *root;\n root=new Tree(val,NULL);\n int cnt=1;\n int maxnum=1;\n while(true){\n update(root);\n if (operation_death(root))break;\n make_child(root);\n root = find_leader(root);\n int tmp = 0;\n count_node(root,tmp);\n maxnum=max(maxnum,tmp);\n cnt++;\n }\n \n cout << cnt <<\" \" << maxnum << endl;\n return;\n}\n\nmain(){\n int n;\n while(cin>>n && n){\n solve(n);\n }\n}","accuracy":1,"time_ms":20,"memory_kb":1436,"score_of_the_acc":-1.0927,"final_rank":6},{"submission_id":"aoj_1221_90728","code_snippet":"#include<cstdlib>\n#include<cstdio>\n#include<iostream>\n#include<vector>\nusing namespace std;\n#define REP(i,b,n) for(int i=b;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define ALL(C) (C).begin(),(C).end()\n#define pb push_back\n\nclass Tree{\npublic:\n int value;\n vector<Tree*> child;\n Tree *parent;\n bool iscand;\n Tree(){};\n Tree(int tv,Tree *tp){\n child.clear();\n parent=tp;\n value=tv;\n iscand=false;\n child.pb(tp);\n }\n bool isvalid(int i){\n if (child[i] == NULL || child[i] == parent)return false;\n return true;\n }\n void del(Tree *now){\n rep(i,child.size()){\n if (now == child[i]){\n\tchild.erase(child.begin()+i);\n\ti--;\n }\n }\n }\n int count_valid(){\n int cnt=0;\n rep(i,child.size()){\n if (isvalid(i))cnt++;\n }\n return cnt;\n }\n};\n\nint compute(int n){\n n = 3*n+1;\n while(n%2 == 0)n/=2;\n if (n > 12345678)n-=12345678;\n return n;\n}\n\nvoid update(Tree *now){\n rep(i,now->child.size()){\n if (!now->isvalid(i))continue;\n update(now->child[i]);\n }\n int tmp=now->value;\n now->value=compute(now->value);\n if (now->count_valid() ==0 && tmp < now->value)now->iscand=true;\n else now->iscand=false;\n}\n\n\nvoid get_all_death(Tree *now,vector<Tree*> &wildel){\n rep(i,now->child.size()){\n if (!now->isvalid(i))continue;\n get_all_death(now->child[i],wildel);\n }\n wildel.pb(now);\n}\n\nbool death(Tree *now,vector<Tree*> &wildel){\n if (now->value == 1){\n int cnt = 0;//count child\n Tree *ins=NULL;\n rep(i,now->child.size()){\n if (now->isvalid(i)){\n\tcnt++;\n\tins=now->child[i];\n }\n }\n if (cnt == 1 && now->parent != NULL){\n now->parent->child.pb(ins);//because of chain\n ins->parent=now->parent;\n ins->del(now);\n ins->child.pb(now->parent);\n\n wildel.pb(now);\n }else get_all_death(now,wildel);\n return true;\n }\n\n rep(i,now->child.size()){\n if (!now->isvalid(i))continue;\n if (death(now->child[i],wildel)){\n now->child.erase(now->child.begin()+i);\n i--;\n }\n }\n return false;//survive\n}\n\nvoid make_child(Tree *now){\n rep(i,now->child.size()){\n if (!now->isvalid(i))continue;\n make_child(now->child[i]);\n }\n \n if (now->iscand){\n int newvalue = (now->value+1)/2;\n if (newvalue%2 == 0)newvalue++;\n Tree *newnode;\n newnode = new Tree(newvalue,now);\n now->child.pb(newnode);\n }\n}\n\nvoid find_new_leader(Tree *now,int &maxval,int &maxcnt,Tree* &who){\n rep(i,now->child.size()){\n if (!now->isvalid(i))continue;\n find_new_leader(now->child[i],maxval,maxcnt,who);\n }\n \n if (now->value > maxval){\n maxval=now->value;\n maxcnt=1;\n who=now;\n }else if (now->value == maxval)maxcnt++;\n}\n\nvoid replace(Tree *now,Tree *parent){\n if (now == NULL)return;\n replace(now->parent,now);\n now->parent=parent;\n}\n\nTree* find_leader(Tree *root){\n int maxval=0,maxcnt=0;\n Tree *who=NULL;\n find_new_leader(root,maxval,maxcnt,who);\n if (maxcnt == 1){\n replace(who,NULL);\n int newvalue = (who->value+1)/2;\n if (newvalue %2 == 0)newvalue--;\n\n Tree *bonus;\n bonus=new Tree(newvalue,who);\n who->child.pb(bonus);\n return who;\n }else return root;\n}\n\nvoid travarse(Tree *now){\n cout <<\"I'm \" << now->value <<\" : \" <<now <<\" \" << now->parent<<\" : \";\n rep(i,now->child.size()){\n //if (!now->isvalid(i))continue;\n if (now->child[i] == now)continue;\n else if (now->child[i] != NULL)cout << now->child[i]->value <<\",\";\n else cout << now->child[i]<<\",\";\n }\n cout << endl;\n rep(i,now->child.size()){\n if (!now->isvalid(i))continue;\n travarse(now->child[i]);\n }\n}\n\n\nvoid del_travarse(Tree *now,vector<Tree*> &wildel){\n rep(i,now->child.size()){\n if (!now->isvalid(i))continue;\n del_travarse(now->child[i],wildel);\n }\n\n rep(i,wildel.size()){\n now->del(wildel[i]);\n }\n}\n\nbool operation_death(Tree *root){\n bool ret=false;\n vector<Tree*> wildel;\n if (death(root,wildel))ret=true;\n // cout << wildel.size() << endl;\n del_travarse(root,wildel);\n rep(i,wildel.size())free(wildel[i]);\n return ret;\n}\n\nvoid count_node(Tree *now,int &cnt){\n cnt++;\n rep(i,now->child.size()){\n if (!now->isvalid(i))continue;\n count_node(now->child[i],cnt);\n }\n}\n\nvoid solve(int val){\n Tree *root;\n root=new Tree(val,NULL);\n int cnt=1;\n int maxnum=1;\n while(true){\n update(root);\n\n // cout <<\"update end\"<<endl;\n // travarse(root);cout << endl;\n\n if (operation_death(root))break;\n\n //cout <<\"death end\" << endl;\n // travarse(root);cout << endl;\n\n make_child(root);\n //cout << \"make_child end\" << endl;\n //travarse(root);\n\n root = find_leader(root);\n\n\n int tmp = 0;\n count_node(root,tmp);\n maxnum=max(maxnum,tmp);\n // cout <<\"find leader end\" << endl;\n // travarse(root);cout << endl;\n //break;\n //if (cnt+1 == 105)travarse(root);\n cnt++;\n }\n \n cout << cnt <<\" \" << maxnum << endl;\n return;\n}\n\nmain(){\n int n;\n while(cin>>n && n){\n // cout <<\"initial value is \" << n << endl;\n solve(n);\n }\n}","accuracy":1,"time_ms":50,"memory_kb":1172,"score_of_the_acc":-1.2898,"final_rank":7}],"string":"[\n {\n \"submission_id\": \"aoj_1221_1092280\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<tuple>\\n#include<algorithm>\\nusing namespace std;\\n\\nconst int MOD = 12345678;\\nconst int NIL = -1;\\n\\nclass Numoeba {\\npublic:\\n Numoeba(const int n) :max_cell_(1), root_(0) {create_cell(n);}\\n tuple<int, int> die() {\\n for(int step = 1; step <= 500; ++step) {\\n int t = dead_.size() - count(dead_.begin(), dead_.end(), true);\\n max_cell_ = max(max_cell_, t);\\n vector<int> candidate;\\n int new_leader_id, new_leader_n = NIL;\\n// cout<<step<<endl;\\n// cout<<\\\"root: \\\"<<root_<<endl;\\n// cout<<\\\"dead: \\\";for(const auto&d:dead_)cout<<\\\" \\\"<<d;cout<<endl;\\n// cout<<\\\"numb: \\\";for(const auto&d:numbosome_)cout<<\\\" \\\"<<d;cout<<endl;\\n if(traverse(root_, NIL, candidate, new_leader_id, new_leader_n)) return tuple<int, int>(step, max_cell_);\\n for(auto& e: edge_) for(int i = 0; i < e.size(); ++i) if(dead_[e[i]]) e.erase(e.begin() + i--);\\n// cout<<\\\"candidate: \\\";for(const auto&d:candidate)cout<<\\\" \\\"<<d;cout<<endl;\\n for(const auto& c: candidate) {\\n int n = (numbosome_[c] + 1) / 2;\\n if(!(n & 1)) ++n;\\n// if(n <= 1) continue;\\n// if(dead_[c]) continue;\\n add_child(c, create_cell(n));\\n }\\n if(new_leader_id == NIL) continue;\\n root_ = new_leader_id;\\n int n = (numbosome_[root_] + 1) / 2;\\n if(!(n & 1)) --n;\\n// if(n <= 1) continue;\\n add_child(root_, create_cell(n));\\n }\\n return tuple<int, int>(NIL, max_cell_);\\n }\\nprivate:\\n bool traverse(const int current, const int previous, vector<int>& candidate, int& new_leader_id, int& new_leader_n) {\\n int pn = numbosome_[current];\\n if(update(current) == 1) {\\n dead_[current] = true;\\n if(current == root_) return true;\\n if(edge_[current].size() == 2) {\\n int next = edge_[current][0];\\n if(next == previous) next = edge_[current][1];\\n for(auto& id: edge_[previous]) if(id == current) id = next;\\n for(auto& id: edge_[next]) if(id == current) id = previous;\\n return traverse(next, previous, candidate, new_leader_id, new_leader_n);\\n }\\n for(const auto& next: edge_[current]) if(next != previous) erase(next, current);\\n return false;\\n }\\n if(numbosome_[current] > pn && edge_[current].size() <= 1) candidate.push_back(current);\\n if(numbosome_[current] == new_leader_n) new_leader_id = NIL;\\n if(numbosome_[current] > new_leader_n) {\\n new_leader_n = numbosome_[current];\\n new_leader_id = current;\\n }\\n for(const auto& next: edge_[current]) {\\n if(next == previous) continue;\\n if(traverse(next, current, candidate, new_leader_id, new_leader_n)) return true;\\n }\\n return false;\\n }\\n void erase(const int current, const int previous) {\\n dead_[current] = true;\\n for(const auto& next: edge_[current]) if(next != previous) erase(next, current);\\n }\\n int create_cell(const int n) {\\n numbosome_.push_back(n);\\n dead_.push_back(false);\\n edge_.push_back(vector<int>());\\n return (dead_.size() - 1);\\n }\\n void add_child(const int pid, const int cid) {\\n edge_[pid].push_back(cid);\\n edge_[cid].push_back(pid);\\n }\\n int update(const int id) {\\n numbosome_[id] = numbosome_[id] * 3 + 1;\\n while(!(numbosome_[id] & 1)) numbosome_[id] >>= 1;\\n if(numbosome_[id] > MOD) numbosome_[id] -= MOD;\\n// while(numbosome_[id] > MOD) numbosome_[id] -= MOD;\\n return numbosome_[id];\\n }\\n int root_;\\n int max_cell_;\\n vector<int> numbosome_;\\n vector<bool> dead_;\\n vector<vector<int>> edge_;\\npublic:\\nvoid print(){\\ncout<<\\\"root: \\\"<<root_<<endl;\\ncout<<\\\"dead: \\\";for(const auto&d:dead_)cout<<\\\" \\\"<<d;cout<<endl;\\ncout<<\\\"numb: \\\";for(const auto&d:numbosome_)cout<<\\\" \\\"<<d;cout<<endl;\\ncout<<dead_.size()<<endl;\\n}\\n};\\n\\n\\nint main() {\\n int k;\\n while(cin >> k, k) {\\n Numoeba n(k);\\n int step, numbosome;\\n tie(step, numbosome) = n.die();\\n cout << step << \\\" \\\" << numbosome << endl;\\n// n.print();\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1484,\n \"score_of_the_acc\": -1,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1221_568200\",\n \"code_snippet\": \"#include<cstdio>\\n#include<vector>\\n\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n\\nusing namespace std;\\n\\nint idx,val[5000];\\nbool cand[5000]; // candidate leaf かどうか\\nvector<int> G[5000];\\n\\n// u を根とする部分木を削除\\nvoid destroy(int u,int pre){\\n\\trep(i,G[u].size()) if(G[u][i]!=pre) destroy(G[u][i],u);\\n\\tG[u].clear();\\n}\\n\\n// numbosome の計算\\nvoid dfs0(int u,int pre){\\n\\tint a=3*val[u]+1;\\n\\twhile(a%2==0) a/=2;\\n\\tif(a>12345678) a-=12345678;\\n\\tcand[u]=(G[u].size()<=1&&val[u]<a);\\n\\tval[u]=a;\\n\\trep(i,G[u].size()) if(G[u][i]!=pre) dfs0(G[u][i],u);\\n}\\n\\n// val==1 の頂点を削除\\nbool dfs1(int u,int pre){\\n\\tif(val[u]==1){\\n\\t\\tif(pre!=-1 && G[u].size()==2){ // special case\\n\\t\\t\\tint v=(G[u][0]==pre?G[u][1]:G[u][0]);\\n\\t\\t\\tG[u].clear();\\n\\t\\t\\trep(i,G[v].size()) if(G[v][i]==u) G[v].erase(G[v].begin()+i);\\n\\t\\t\\tG[pre].push_back( v );\\n\\t\\t\\tG[ v ].push_back(pre);\\n\\t\\t\\tdfs1(v,pre);\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\tdestroy(u,pre);\\n\\t\\t\\treturn pre==-1;\\n\\t\\t}\\n\\t}\\n\\telse{\\n\\t\\trep(i,G[u].size()) if(G[u][i]!=pre) {\\n\\t\\t\\tint v=G[u][i];\\n\\t\\t\\tif(val[v]==1) G[u].erase(G[u].begin()+i--);\\n\\t\\t\\tdfs1(v,u);\\n\\t\\t}\\n\\t\\treturn false;\\n\\t}\\n}\\n\\n// leaf bonus の処理\\nvoid dfs2(int u,int pre){\\n\\tif(cand[u]){\\n\\t\\tG[ u ].push_back(idx);\\n\\t\\tG[idx].push_back( u );\\n\\t\\tval[idx]=(val[u]+1)/2;\\n\\t\\tif(val[idx]%2==0) val[idx]++;\\n\\t\\tidx++;\\n\\t}\\n\\telse{\\n\\t\\trep(i,G[u].size()) if(G[u][i]!=pre) dfs2(G[u][i],u);\\n\\t}\\n}\\n\\n// 生きている頂点のリストを求める\\nvoid dfs3(int u,int pre,vector<int> &res){\\n\\tres.push_back(u);\\n\\trep(i,G[u].size()) if(G[u][i]!=pre) dfs3(G[u][i],u,res);\\n}\\n\\nint main(){\\n\\twhile(scanf(\\\"%d\\\",val),val[0]){\\n\\t\\tidx=1;\\n\\t\\tint t,leader=0,sz=1;\\n\\t\\tfor(t=1;;t++){\\n\\t\\t\\t// step 0\\n\\t\\t\\tdfs0(leader,-1);\\n\\n\\t\\t\\t// step 1\\n\\t\\t\\tif(dfs1(leader,-1)) break;\\n\\n\\t\\t\\t// step 2\\n\\t\\t\\tdfs2(leader,-1);\\n\\n\\t\\t\\t// step 3\\n\\t\\t\\tvector<int> seq;\\n\\t\\t\\tdfs3(leader,-1,seq);\\n\\t\\t\\tint next=-1;\\n\\t\\t\\tbool dup=false;\\n\\t\\t\\trep(i,seq.size()){\\n\\t\\t\\t\\tif(next==-1 || val[seq[i]]>val[next]){\\n\\t\\t\\t\\t\\tnext=seq[i];\\n\\t\\t\\t\\t\\tdup=false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if(val[seq[i]]==val[next]){\\n\\t\\t\\t\\t\\tdup=true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(!dup){ // leader bonus\\n\\t\\t\\t\\tleader=next;\\n\\t\\t\\t\\tG[leader].push_back(idx);\\n\\t\\t\\t\\tG[idx].push_back(leader);\\n\\t\\t\\t\\tval[idx]=(val[leader]+1)/2;\\n\\t\\t\\t\\tif(val[idx]%2==0) val[idx]--;\\n\\t\\t\\t\\tseq.push_back(idx);\\n\\t\\t\\t\\tidx++;\\n\\t\\t\\t}\\n\\n\\t\\t\\tsz=max(sz,(int)seq.size());\\n\\t\\t}\\n\\n\\t\\tprintf(\\\"%d %d\\\\n\\\",t,sz);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1344,\n \"score_of_the_acc\": -1.0307,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1221_412802\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <functional>\\nusing namespace std;\\n\\nconst int MOD = 12345678;\\n\\n\\nclass Cell\\n{\\npublic:\\n int v;\\n Cell* parent;\\n bool visited, candidate,leaf;\\n vector<Cell*> child;\\n\\n Cell(int v, Cell* parent)\\n :v(v),parent(parent),visited(false),candidate(false),leaf(false)\\n {}\\n\\n void update() {\\n int p = v;\\n\\tv = 3*v + 1;\\n\\n while(v%2!=1) {\\n v/=2;\\n }\\n\\n v %= MOD;\\n\\tif(p < v) candidate = true;\\n }\\n};\\n\\nint count(Cell* cell)\\n{\\n\\tint res = 1;\\n\\tfor(int i=0; i<cell->child.size(); i++)\\n\\t\\tres += count(cell->child[i]);\\n\\n\\treturn res;\\n}\\n\\nvoid getValues(Cell* cell, vector<int>& res)\\n{\\n\\tres.push_back(cell->v);\\n\\tfor(int i=0; i<cell->child.size(); i++) {\\n\\t\\tgetValues(cell->child[i], res);\\n\\t}\\n}\\n\\nCell* getNewLeader(Cell* cell, int v)\\n{\\n\\tif(cell->v == v) return cell;\\n\\n\\tfor(int i=0; i<cell->child.size(); i++){\\n\\t\\tCell* res = getNewLeader(cell->child[i], v);\\n\\t\\tif(res != NULL) return res;\\n\\t}\\n\\n\\treturn NULL;\\n}\\n\\nvoid checkLeaf(Cell* cell)\\n{\\n\\tif(cell->child.size() == 0) cell->leaf = true;\\n\\tfor(int i=0; i<cell->child.size(); i++) {\\n\\t\\tcheckLeaf(cell->child[i]);\\n\\t}\\n}\\n\\nCell* selectLeader(Cell* root, bool& uniq)\\n{\\n\\tvector<int> values;\\n\\tgetValues(root, values);\\n\\n\\tsort(values.begin(), values.end(), greater<int>());\\n\\n\\tif(values[0] == values[1]) {\\n\\t\\tuniq = false;\\n\\t\\treturn root->child[0];\\n\\t}\\n\\n\\tuniq = true;\\n\\tCell* newleader = getNewLeader(root, values[0]);\\n\\n\\treturn newleader;\\n}\\n\\nvoid add(Cell* parent, int v)\\n{\\n\\tparent->child.push_back(new Cell(v, parent));\\n}\\n\\nvoid leaderBonus(Cell* leader)\\n{\\n int v = (leader->v+1)/2;\\n if(v%2==0) v -= 1;\\n\\n add(leader, v);\\n}\\n\\nvoid leafBonus(Cell* cell)\\n{\\n\\tif(cell->leaf){\\n int v = (cell->v+1)/2;\\n if(v%2==0) v += 1;\\n\\n if(cell->candidate) {\\n\\t\\t add(cell, v);\\n\\t }\\n }\\n\\telse{\\n for(int i=0; i<cell->child.size(); i++)\\n\\t\\tleafBonus(cell->child[i]);\\n }\\n}\\n\\nvoid newTree(Cell* prev, Cell* next)\\n{\\n prev->visited = true;\\n Cell* c = new Cell(prev->v, next);\\n next->child.push_back(c);\\n\\n if(prev->parent) {\\n if(!prev->parent->visited) {\\n if(prev->parent->v != -1) {\\n\\t\\tprev->parent->visited = true;\\n\\t\\tnewTree(prev->parent, c);\\n }\\n }\\n \\n for(int i=0; i<prev->child.size(); i++) {\\n if(!prev->child[i]->visited) {\\n\\t\\tprev->child[i]->visited = true;\\n\\t\\tnewTree(prev->child[i], c);\\n }\\n }\\n }\\n}\\n\\nvoid remove(Cell *cell)\\n{\\n\\tfor(int i=0; i<cell->child.size(); i++) {\\n\\t\\tremove(cell->child[i]);\\n\\t}\\n\\n\\tdelete cell;\\n}\\n\\nbool died(Cell *cell, bool leader)\\n{\\n\\tif(cell->v == 1) {\\n\\t\\tif(leader) {\\n\\t\\t\\tremove(cell);\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tCell* parent = cell->parent;\\n\\t\\t\\tint n=-1;\\n\\t\\t\\tfor(int i=0; i<parent->child.size(); i++) {\\n\\t\\t\\t\\tif(parent->child[i] == cell) \\n\\t\\t\\t\\t\\tn = i;\\n\\t\\t\\t}\\n\\n\\t\\t\\tparent->child.erase(parent->child.begin()+n);\\n\\t\\t\\t\\n\\t\\t\\tif(cell->child.size() != 1)\\n\\t\\t\\t{\\n\\t\\t\\t\\tremove(cell);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tCell* grandchild = cell->child[0];\\n\\n\\t\\t\\t\\tparent->child.push_back(grandchild);\\n\\t\\t\\t\\tgrandchild->parent = parent;\\n\\t\\t\\n\\t\\t\\t\\tdelete cell;\\n\\t\\t\\t\\tcell = NULL;\\n\\t\\t\\t}\\n\\n\\t\\t\\tdied(parent, false);\\n\\t\\t\\treturn true;\\n\\t\\t}\\n\\t}\\n\\telse {\\n\\t\\tfor(int i=0; i<cell->child.size(); i++) \\n\\t\\t\\tif(died(cell->child[i], false)) break;\\n\\t}\\n\\t\\n\\n return false;\\n}\\n\\nvoid update(Cell* cell)\\n{\\n\\tcell->update();\\n\\tfor(int i = 0; i < cell->child.size(); i++) {\\n\\t\\tupdate(cell->child[i]);\\n\\t}\\n}\\n\\nvoid solve(int v)\\n{\\n Cell* root = new Cell(-1, NULL);\\n root->visited = true;\\n add(root, v);\\n\\n Cell* leader = root->child[0];\\n \\n int cycle = 0, m = 1;\\n while(1) {\\n cycle++;\\n\\n update(leader);\\n\\tcheckLeaf(leader);\\n\\n\\tdied(root, true);\\n\\tif(root->child.size() == 0) break;\\n\\n\\tleafBonus(leader);\\n\\n Cell* newroot = new Cell(-1, NULL);\\n\\tnewroot->visited = true;\\n\\n\\tbool uniq;\\n leader = selectLeader(root, uniq);\\n newTree(leader, newroot);\\n\\n\\tleader = newroot->child[0]; \\n\\n if(uniq) leaderBonus(leader);\\n\\n m = max(m, count(leader));\\n\\n remove(root->child[0]);\\n\\n root = newroot;\\n }\\n\\n cout << cycle << \\\" \\\" << m << endl;\\n}\\n\\nint main()\\n{\\n int N;\\n while(cin >> N, N)\\n {\\n solve(N);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 1008,\n \"score_of_the_acc\": -1.6792,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1221_366863\",\n \"code_snippet\": \"#include<cstdio>\\n#include<vector>\\n#include<algorithm>\\n#include<set>\\n#include<map>\\nusing namespace std;\\ntypedef set<int> Edge;\\nstruct Cell\\n{\\n\\tint v;\\n\\tEdge edge;\\n\\tCell(int v):v(v),edge(){}\\n\\tCell():v(-1),edge(){}\\n};\\ntypedef map<int,Cell>Numoeba;\\ntypedef Numoeba::value_type Pair;\\n\\nNumoeba numoeba;\\nint makeIndex;\\n\\nint Collatz(int x)\\n{\\n\\tx=3*x+1;\\n\\twhile(x%2==0)\\n\\t\\tx/=2;\\n\\tif(x>=12345678)\\n\\t\\tx-=12345678;\\n\\treturn x;\\n}\\nvoid ConnectEdge(int x,int y)\\n{\\n\\tnumoeba.find(x)->second.edge.insert(y);\\n\\tnumoeba.find(y)->second.edge.insert(x);\\n}\\nvoid EraseEdge(int controlIndex,int erasedIndex)\\n{\\n\\tnumoeba.find(controlIndex)->second.edge.erase(erasedIndex);\\n}\\nvoid Spawn(int K,int fromID)\\n{\\n\\tnumoeba.insert( Pair(makeIndex,Cell(K)) );\\n\\tConnectEdge(fromID, makeIndex);\\n\\t++makeIndex;\\n}\\nvoid Kill(int id,int fromID,bool willDie)\\n{\\n\\tconst Cell &cell=numoeba.find(id)->second;\\n\\tif(cell.v==1 || willDie)\\n\\t{\\n\\t\\tif(!willDie && fromID>=0 && cell.edge.size()==2)\\n\\t\\t{\\n\\t\\t\\tEdge::iterator ite=cell.edge.begin();\\n\\t\\t\\tif(*ite==fromID)\\n\\t\\t\\t\\t++ite;\\n\\t\\t\\tint childID = *ite;\\n\\t\\t\\tEraseEdge(fromID, id);\\n\\t\\t\\tEraseEdge(childID,id);\\n\\t\\t\\tConnectEdge(childID,fromID);\\n\\t\\t\\tnumoeba.erase(id);\\n\\t\\t\\tKill(childID,fromID,false);\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tfor(Edge::iterator ite=cell.edge.begin(); ite!=cell.edge.end();)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif(*ite!=fromID)\\n\\t\\t\\t\\t\\tKill(*(ite++), id, true);\\n\\t\\t\\t\\telse ++ite;\\n\\t\\t\\t}\\n\\t\\t\\tif(fromID>=0)\\n\\t\\t\\t\\tEraseEdge(fromID,id);\\n\\t\\t\\tnumoeba.erase(id);\\n\\t\\t}\\n\\t}\\n\\telse\\n\\t{\\n\\t\\tfor(Edge::iterator ite=cell.edge.begin(); ite!=cell.edge.end();)\\n\\t\\t\\tif(*ite!=fromID)\\n\\t\\t\\t\\tKill(*(ite++),id,false);\\n\\t\\t\\telse ++ite;\\n\\t}\\n}\\n\\nint main()\\n{\\n\\tvector<int>candidate;\\n\\tint K,T,maxCell,rootIndex, i;\\n\\twhile(scanf(\\\"%d\\\",&K),K)\\n\\t{\\n\\t\\tmaxCell=1;\\n\\t\\trootIndex = makeIndex = 0;\\n\\t\\tnumoeba.clear();\\n\\t\\tnumoeba.insert(Pair(makeIndex++,Cell(K)));\\n\\t\\tfor(T=1;;++T)\\n\\t\\t{\\n\\t\\t\\tcandidate.clear();\\n\\t\\t\\tfor(Numoeba::iterator ite=numoeba.begin(); ite!=numoeba.end(); ++ite)\\n\\t\\t\\t{\\n\\t\\t\\t\\tint x=Collatz(ite->second.v);\\n\\t\\t\\t\\tif(x>ite->second.v && (ite->second.edge.size()==1&&ite->first!=rootIndex || numoeba.size()==1))\\n\\t\\t\\t\\t\\tcandidate.push_back(ite->first);\\n\\t\\t\\t\\tite->second.v = x;\\n\\t\\t\\t}\\n\\t\\t\\tKill(rootIndex,-1,false);\\n\\t\\t\\tif(numoeba.empty())\\n\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\tfor(i=0; i<candidate.size(); ++i)\\n\\t\\t\\t{\\n\\t\\t\\t\\tNumoeba::iterator ite=numoeba.find(candidate[i]);\\n\\t\\t\\t\\tif(ite!=numoeba.end())\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tint v=(ite->second.v+1)/2;\\n\\t\\t\\t\\t\\tif(v%2==0)++v;\\n\\t\\t\\t\\t\\tSpawn(v,candidate[i]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tint maxV=0, count=0, index=-1;\\n\\t\\t\\tfor(Numoeba::iterator ite=numoeba.begin(); ite!=numoeba.end(); ++ite)\\n\\t\\t\\t{\\n\\t\\t\\t\\tint v=ite->second.v;\\n\\t\\t\\t\\tif(maxV < v)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tmaxV = v;\\n\\t\\t\\t\\t\\tindex=ite->first;\\n\\t\\t\\t\\t\\tcount=1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if(maxV == v)\\n\\t\\t\\t\\t\\t++count;\\n\\t\\t\\t}\\n\\t\\t\\tif(count==1)\\n\\t\\t\\t{\\n\\t\\t\\t\\tint v=(maxV+1)/2;\\n\\t\\t\\t\\tif(v%2==0)--v;\\n\\t\\t\\t\\tSpawn(v,index);\\n\\t\\t\\t\\trootIndex = index;\\n\\t\\t\\t}\\n\\t\\t\\tmaxCell = max<int>(maxCell, numoeba.size());\\n\\t\\t}\\n\\t\\tprintf(\\\"%d %d\\\\n\\\",T,maxCell);\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 868,\n \"score_of_the_acc\": -0.8349,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1221_260254\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n#include <iomanip>\\n#include <algorithm>\\n#include <cmath>\\n#include <string>\\n#include <vector>\\n#include <list>\\n#include <queue>\\n#include <stack>\\n#include <set>\\n#include <map>\\n#include <bitset>\\n#include <numeric>\\n#include <climits>\\n#include <cfloat>\\nusing namespace std;\\n\\nclass Cell\\n{\\npublic:\\n int value;\\n list<Cell*> to;\\n bool candidate;\\n\\n Cell(int value0){\\n value = value0;\\n }\\n ~Cell(){\\n list<Cell*>::iterator it = to.begin();\\n while(it != to.end()){\\n (*it)->to.erase(find((*it)->to.begin(), (*it)->to.end(), this));\\n delete *it;\\n ++ it;\\n }\\n }\\n\\n void updateValue()\\n {\\n long long a = value;\\n a *= 3;\\n ++ a;\\n while(a % 2 == 0)\\n a /= 2;\\n -- a;\\n a %= 12345678;\\n ++ a;\\n candidate = (a > value);\\n value = a;\\n }\\n\\n void update(Cell* prev)\\n {\\n updateValue();\\n candidate &= (to.size() == 0 || (prev != NULL && to.size() == 1));\\n\\n if(value == 1){\\n if(prev != NULL && to.size() == 2){\\n list<Cell*>::iterator it = to.begin();\\n if(*it == prev)\\n ++ it;\\n prev->to.push_back(*it);\\n *find((*it)->to.begin(), (*it)->to.end(), this) = prev;\\n to.erase(it);\\n }\\n return;\\n }\\n\\n list<Cell*>::iterator it = to.begin();\\n while(it != to.end()){\\n if(*it != prev){\\n (*it)->update(this);\\n if((*it)->value == 1){\\n (*it)->to.erase(find((*it)->to.begin(), (*it)->to.end(), this));\\n delete *it;\\n it = to.erase(it);\\n }else{\\n ++ it;\\n }\\n }else{\\n ++ it;\\n }\\n }\\n\\n if(candidate){\\n int a = (value + 1) / 2;\\n if(a % 2 == 0)\\n ++ a;\\n Cell* c = new Cell(a);\\n c->to.push_back(this);\\n to.push_back(c);\\n }\\n }\\n\\n static Cell* maxCell;\\n static int maxValue;\\n static bool ng;\\n int findMax(Cell* prev)\\n {\\n if(value > maxValue){\\n maxValue = value;\\n maxCell = this;\\n ng = false;\\n }else if(value == maxValue){\\n ng = true;\\n }\\n\\n int num = 1;\\n list<Cell*>::iterator it = to.begin();\\n while(it != to.end()){\\n if(*it != prev){\\n num += (*it)->findMax(this);\\n }\\n ++ it;\\n }\\n\\n return num;\\n }\\n\\n void addLeaderBonus()\\n {\\n int a = (value + 1) / 2;\\n if(a % 2 == 0)\\n -- a;\\n Cell* c = new Cell(a);\\n c->to.push_back(this);\\n to.push_back(c);\\n }\\n};\\nCell* Cell::maxCell;\\nint Cell::maxValue;\\nbool Cell::ng;\\n\\nCell* leader;\\n\\nint main()\\n{\\n for(;;){\\n int n;\\n cin >> n;\\n if(n == 0)\\n return 0;\\n\\n leader = new Cell(n);\\n int t = 0;\\n int ret = 1;\\n for(;;){\\n ++ t;\\n leader->update(NULL);\\n if(leader->value == 1)\\n break;\\n\\n Cell::maxValue = -1;\\n int num = leader->findMax(NULL);\\n if(!Cell::ng){\\n leader = Cell::maxCell;\\n leader->addLeaderBonus();\\n ++ num;\\n }\\n ret = max(ret, num);\\n }\\n\\n cout << t << ' ' << ret << endl;\\n\\n delete leader;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 0,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1221_90736\",\n \"code_snippet\": \"#include<cstdlib>\\n#include<cstdio>\\n#include<iostream>\\n#include<vector>\\nusing namespace std;\\n#define REP(i,b,n) for(int i=b;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define ALL(C) (C).begin(),(C).end()\\n#define pb push_back\\n\\nclass Tree{\\npublic:\\n int value;\\n vector<Tree*> child;\\n Tree *parent;\\n bool iscand;\\n Tree(){};\\n Tree(int tv,Tree *tp){\\n child.clear();\\n parent=tp;\\n value=tv;\\n iscand=false;\\n child.pb(tp);\\n }\\n bool isvalid(int i){\\n if (child[i] == NULL || child[i] == parent)return false;\\n return true;\\n }\\n void del(Tree *now){\\n rep(i,child.size()){\\n if (now == child[i]){\\n\\tchild.erase(child.begin()+i);\\n\\ti--;\\n }\\n }\\n }\\n int count_valid(){\\n int cnt=0;\\n rep(i,child.size()){\\n if (isvalid(i))cnt++;\\n }\\n return cnt;\\n }\\n};\\n\\nint compute(int n){\\n n = 3*n+1;\\n while(n%2 == 0)n/=2;\\n if (n > 12345678)n-=12345678;\\n return n;\\n}\\n\\nvoid update(Tree *now){\\n rep(i,now->child.size()){\\n if (!now->isvalid(i))continue;\\n update(now->child[i]);\\n }\\n int tmp=now->value;\\n now->value=compute(now->value);\\n if (now->count_valid() ==0 && tmp < now->value)now->iscand=true;\\n else now->iscand=false;\\n}\\n\\n\\nvoid get_all_death(Tree *now,vector<Tree*> &wildel){\\n rep(i,now->child.size()){\\n if (!now->isvalid(i))continue;\\n get_all_death(now->child[i],wildel);\\n }\\n wildel.pb(now);\\n}\\n\\nbool death(Tree *now,vector<Tree*> &wildel){\\n if (now->value == 1){\\n int cnt = 0;//count child\\n Tree *ins=NULL;\\n rep(i,now->child.size()){\\n if (now->isvalid(i)){\\n\\tcnt++;\\n\\tins=now->child[i];\\n }\\n }\\n if (cnt == 1 && now->parent != NULL){\\n now->parent->child.pb(ins);//because of chain\\n ins->parent=now->parent;\\n ins->del(now);\\n ins->child.pb(now->parent);\\n\\n wildel.pb(now);\\n }else get_all_death(now,wildel);\\n return true;\\n }\\n\\n rep(i,now->child.size()){\\n if (!now->isvalid(i))continue;\\n if (death(now->child[i],wildel)){\\n now->child.erase(now->child.begin()+i);\\n i--;\\n }\\n }\\n return false;//survive\\n}\\n\\nvoid make_child(Tree *now){\\n rep(i,now->child.size()){\\n if (!now->isvalid(i))continue;\\n make_child(now->child[i]);\\n }\\n \\n if (now->iscand){\\n int newvalue = (now->value+1)/2;\\n if (newvalue%2 == 0)newvalue++;\\n Tree *newnode;\\n newnode = new Tree(newvalue,now);\\n now->child.pb(newnode);\\n }\\n}\\n\\nvoid find_new_leader(Tree *now,int &maxval,int &maxcnt,Tree* &who){\\n rep(i,now->child.size()){\\n if (!now->isvalid(i))continue;\\n find_new_leader(now->child[i],maxval,maxcnt,who);\\n }\\n \\n if (now->value > maxval){\\n maxval=now->value;\\n maxcnt=1;\\n who=now;\\n }else if (now->value == maxval)maxcnt++;\\n}\\n\\nvoid replace(Tree *now,Tree *parent){\\n if (now == NULL)return;\\n replace(now->parent,now);\\n now->parent=parent;\\n}\\n\\nTree* find_leader(Tree *root){\\n int maxval=0,maxcnt=0;\\n Tree *who=NULL;\\n find_new_leader(root,maxval,maxcnt,who);\\n if (maxcnt == 1){\\n replace(who,NULL);\\n int newvalue = (who->value+1)/2;\\n if (newvalue %2 == 0)newvalue--;\\n\\n Tree *bonus;\\n bonus=new Tree(newvalue,who);\\n who->child.pb(bonus);\\n return who;\\n }else return root;\\n}\\n\\nvoid del_travarse(Tree *now,vector<Tree*> &wildel){\\n rep(i,now->child.size()){\\n if (!now->isvalid(i))continue;\\n del_travarse(now->child[i],wildel);\\n }\\n\\n rep(i,wildel.size()){\\n now->del(wildel[i]);\\n }\\n}\\n\\nbool operation_death(Tree *root){\\n bool ret=false;\\n vector<Tree*> wildel;\\n if (death(root,wildel))ret=true;\\n del_travarse(root,wildel);\\n rep(i,wildel.size())free(wildel[i]);\\n return ret;\\n}\\n\\nvoid count_node(Tree *now,int &cnt){\\n cnt++;\\n rep(i,now->child.size()){\\n if (!now->isvalid(i))continue;\\n count_node(now->child[i],cnt);\\n }\\n}\\n\\nvoid solve(int val){\\n Tree *root;\\n root=new Tree(val,NULL);\\n int cnt=1;\\n int maxnum=1;\\n while(true){\\n update(root);\\n if (operation_death(root))break;\\n make_child(root);\\n root = find_leader(root);\\n int tmp = 0;\\n count_node(root,tmp);\\n maxnum=max(maxnum,tmp);\\n cnt++;\\n }\\n \\n cout << cnt <<\\\" \\\" << maxnum << endl;\\n return;\\n}\\n\\nmain(){\\n int n;\\n while(cin>>n && n){\\n solve(n);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 0,\n \"score_of_the_acc\": -0.375,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1221_90731\",\n \"code_snippet\": \"#include<cstdlib>\\n#include<cstdio>\\n#include<iostream>\\n#include<vector>\\nusing namespace std;\\n#define REP(i,b,n) for(int i=b;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define ALL(C) (C).begin(),(C).end()\\n#define pb push_back\\n\\nclass Tree{\\npublic:\\n int value;\\n vector<Tree*> child;\\n Tree *parent;\\n bool iscand;\\n Tree(){};\\n Tree(int tv,Tree *tp){\\n child.clear();\\n parent=tp;\\n value=tv;\\n iscand=false;\\n child.pb(tp);\\n }\\n bool isvalid(int i){\\n if (child[i] == NULL || child[i] == parent)return false;\\n return true;\\n }\\n void del(Tree *now){\\n rep(i,child.size()){\\n if (now == child[i]){\\n\\tchild.erase(child.begin()+i);\\n\\ti--;\\n }\\n }\\n }\\n int count_valid(){\\n int cnt=0;\\n rep(i,child.size()){\\n if (isvalid(i))cnt++;\\n }\\n return cnt;\\n }\\n};\\n\\nint compute(int n){\\n n = 3*n+1;\\n while(n%2 == 0)n/=2;\\n if (n > 12345678)n-=12345678;\\n return n;\\n}\\n\\nvoid update(Tree *now){\\n rep(i,now->child.size()){\\n if (!now->isvalid(i))continue;\\n update(now->child[i]);\\n }\\n int tmp=now->value;\\n now->value=compute(now->value);\\n if (now->count_valid() ==0 && tmp < now->value)now->iscand=true;\\n else now->iscand=false;\\n}\\n\\n\\nvoid get_all_death(Tree *now,vector<Tree*> &wildel){\\n rep(i,now->child.size()){\\n if (!now->isvalid(i))continue;\\n get_all_death(now->child[i],wildel);\\n }\\n wildel.pb(now);\\n}\\n\\nbool death(Tree *now,vector<Tree*> &wildel){\\n if (now->value == 1){\\n int cnt = 0;//count child\\n Tree *ins=NULL;\\n rep(i,now->child.size()){\\n if (now->isvalid(i)){\\n\\tcnt++;\\n\\tins=now->child[i];\\n }\\n }\\n if (cnt == 1 && now->parent != NULL){\\n now->parent->child.pb(ins);//because of chain\\n ins->parent=now->parent;\\n ins->del(now);\\n ins->child.pb(now->parent);\\n\\n wildel.pb(now);\\n }else get_all_death(now,wildel);\\n return true;\\n }\\n\\n rep(i,now->child.size()){\\n if (!now->isvalid(i))continue;\\n if (death(now->child[i],wildel)){\\n now->child.erase(now->child.begin()+i);\\n i--;\\n }\\n }\\n return false;//survive\\n}\\n\\nvoid make_child(Tree *now){\\n rep(i,now->child.size()){\\n if (!now->isvalid(i))continue;\\n make_child(now->child[i]);\\n }\\n \\n if (now->iscand){\\n int newvalue = (now->value+1)/2;\\n if (newvalue%2 == 0)newvalue++;\\n Tree *newnode;\\n newnode = new Tree(newvalue,now);\\n now->child.pb(newnode);\\n }\\n}\\n\\nvoid find_new_leader(Tree *now,int &maxval,int &maxcnt,Tree* &who){\\n rep(i,now->child.size()){\\n if (!now->isvalid(i))continue;\\n find_new_leader(now->child[i],maxval,maxcnt,who);\\n }\\n \\n if (now->value > maxval){\\n maxval=now->value;\\n maxcnt=1;\\n who=now;\\n }else if (now->value == maxval)maxcnt++;\\n}\\n\\nvoid replace(Tree *now,Tree *parent){\\n if (now == NULL)return;\\n replace(now->parent,now);\\n now->parent=parent;\\n}\\n\\nTree* find_leader(Tree *root){\\n int maxval=0,maxcnt=0;\\n Tree *who=NULL;\\n find_new_leader(root,maxval,maxcnt,who);\\n if (maxcnt == 1){\\n replace(who,NULL);\\n int newvalue = (who->value+1)/2;\\n if (newvalue %2 == 0)newvalue--;\\n\\n Tree *bonus;\\n bonus=new Tree(newvalue,who);\\n who->child.pb(bonus);\\n return who;\\n }else return root;\\n}\\n\\nvoid del_travarse(Tree *now,vector<Tree*> &wildel){\\n rep(i,now->child.size()){\\n if (!now->isvalid(i))continue;\\n del_travarse(now->child[i],wildel);\\n }\\n\\n rep(i,wildel.size()){\\n now->del(wildel[i]);\\n }\\n}\\n\\nbool operation_death(Tree *root){\\n bool ret=false;\\n vector<Tree*> wildel;\\n if (death(root,wildel))ret=true;\\n // del_travarse(root,wildel);\\n // rep(i,wildel.size())free(wildel[i]);\\n return ret;\\n}\\n\\nvoid count_node(Tree *now,int &cnt){\\n cnt++;\\n rep(i,now->child.size()){\\n if (!now->isvalid(i))continue;\\n count_node(now->child[i],cnt);\\n }\\n}\\n\\nvoid solve(int val){\\n Tree *root;\\n root=new Tree(val,NULL);\\n int cnt=1;\\n int maxnum=1;\\n while(true){\\n update(root);\\n if (operation_death(root))break;\\n make_child(root);\\n root = find_leader(root);\\n int tmp = 0;\\n count_node(root,tmp);\\n maxnum=max(maxnum,tmp);\\n cnt++;\\n }\\n \\n cout << cnt <<\\\" \\\" << maxnum << endl;\\n return;\\n}\\n\\nmain(){\\n int n;\\n while(cin>>n && n){\\n solve(n);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1436,\n \"score_of_the_acc\": -1.0927,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1221_90728\",\n \"code_snippet\": \"#include<cstdlib>\\n#include<cstdio>\\n#include<iostream>\\n#include<vector>\\nusing namespace std;\\n#define REP(i,b,n) for(int i=b;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define ALL(C) (C).begin(),(C).end()\\n#define pb push_back\\n\\nclass Tree{\\npublic:\\n int value;\\n vector<Tree*> child;\\n Tree *parent;\\n bool iscand;\\n Tree(){};\\n Tree(int tv,Tree *tp){\\n child.clear();\\n parent=tp;\\n value=tv;\\n iscand=false;\\n child.pb(tp);\\n }\\n bool isvalid(int i){\\n if (child[i] == NULL || child[i] == parent)return false;\\n return true;\\n }\\n void del(Tree *now){\\n rep(i,child.size()){\\n if (now == child[i]){\\n\\tchild.erase(child.begin()+i);\\n\\ti--;\\n }\\n }\\n }\\n int count_valid(){\\n int cnt=0;\\n rep(i,child.size()){\\n if (isvalid(i))cnt++;\\n }\\n return cnt;\\n }\\n};\\n\\nint compute(int n){\\n n = 3*n+1;\\n while(n%2 == 0)n/=2;\\n if (n > 12345678)n-=12345678;\\n return n;\\n}\\n\\nvoid update(Tree *now){\\n rep(i,now->child.size()){\\n if (!now->isvalid(i))continue;\\n update(now->child[i]);\\n }\\n int tmp=now->value;\\n now->value=compute(now->value);\\n if (now->count_valid() ==0 && tmp < now->value)now->iscand=true;\\n else now->iscand=false;\\n}\\n\\n\\nvoid get_all_death(Tree *now,vector<Tree*> &wildel){\\n rep(i,now->child.size()){\\n if (!now->isvalid(i))continue;\\n get_all_death(now->child[i],wildel);\\n }\\n wildel.pb(now);\\n}\\n\\nbool death(Tree *now,vector<Tree*> &wildel){\\n if (now->value == 1){\\n int cnt = 0;//count child\\n Tree *ins=NULL;\\n rep(i,now->child.size()){\\n if (now->isvalid(i)){\\n\\tcnt++;\\n\\tins=now->child[i];\\n }\\n }\\n if (cnt == 1 && now->parent != NULL){\\n now->parent->child.pb(ins);//because of chain\\n ins->parent=now->parent;\\n ins->del(now);\\n ins->child.pb(now->parent);\\n\\n wildel.pb(now);\\n }else get_all_death(now,wildel);\\n return true;\\n }\\n\\n rep(i,now->child.size()){\\n if (!now->isvalid(i))continue;\\n if (death(now->child[i],wildel)){\\n now->child.erase(now->child.begin()+i);\\n i--;\\n }\\n }\\n return false;//survive\\n}\\n\\nvoid make_child(Tree *now){\\n rep(i,now->child.size()){\\n if (!now->isvalid(i))continue;\\n make_child(now->child[i]);\\n }\\n \\n if (now->iscand){\\n int newvalue = (now->value+1)/2;\\n if (newvalue%2 == 0)newvalue++;\\n Tree *newnode;\\n newnode = new Tree(newvalue,now);\\n now->child.pb(newnode);\\n }\\n}\\n\\nvoid find_new_leader(Tree *now,int &maxval,int &maxcnt,Tree* &who){\\n rep(i,now->child.size()){\\n if (!now->isvalid(i))continue;\\n find_new_leader(now->child[i],maxval,maxcnt,who);\\n }\\n \\n if (now->value > maxval){\\n maxval=now->value;\\n maxcnt=1;\\n who=now;\\n }else if (now->value == maxval)maxcnt++;\\n}\\n\\nvoid replace(Tree *now,Tree *parent){\\n if (now == NULL)return;\\n replace(now->parent,now);\\n now->parent=parent;\\n}\\n\\nTree* find_leader(Tree *root){\\n int maxval=0,maxcnt=0;\\n Tree *who=NULL;\\n find_new_leader(root,maxval,maxcnt,who);\\n if (maxcnt == 1){\\n replace(who,NULL);\\n int newvalue = (who->value+1)/2;\\n if (newvalue %2 == 0)newvalue--;\\n\\n Tree *bonus;\\n bonus=new Tree(newvalue,who);\\n who->child.pb(bonus);\\n return who;\\n }else return root;\\n}\\n\\nvoid travarse(Tree *now){\\n cout <<\\\"I'm \\\" << now->value <<\\\" : \\\" <<now <<\\\" \\\" << now->parent<<\\\" : \\\";\\n rep(i,now->child.size()){\\n //if (!now->isvalid(i))continue;\\n if (now->child[i] == now)continue;\\n else if (now->child[i] != NULL)cout << now->child[i]->value <<\\\",\\\";\\n else cout << now->child[i]<<\\\",\\\";\\n }\\n cout << endl;\\n rep(i,now->child.size()){\\n if (!now->isvalid(i))continue;\\n travarse(now->child[i]);\\n }\\n}\\n\\n\\nvoid del_travarse(Tree *now,vector<Tree*> &wildel){\\n rep(i,now->child.size()){\\n if (!now->isvalid(i))continue;\\n del_travarse(now->child[i],wildel);\\n }\\n\\n rep(i,wildel.size()){\\n now->del(wildel[i]);\\n }\\n}\\n\\nbool operation_death(Tree *root){\\n bool ret=false;\\n vector<Tree*> wildel;\\n if (death(root,wildel))ret=true;\\n // cout << wildel.size() << endl;\\n del_travarse(root,wildel);\\n rep(i,wildel.size())free(wildel[i]);\\n return ret;\\n}\\n\\nvoid count_node(Tree *now,int &cnt){\\n cnt++;\\n rep(i,now->child.size()){\\n if (!now->isvalid(i))continue;\\n count_node(now->child[i],cnt);\\n }\\n}\\n\\nvoid solve(int val){\\n Tree *root;\\n root=new Tree(val,NULL);\\n int cnt=1;\\n int maxnum=1;\\n while(true){\\n update(root);\\n\\n // cout <<\\\"update end\\\"<<endl;\\n // travarse(root);cout << endl;\\n\\n if (operation_death(root))break;\\n\\n //cout <<\\\"death end\\\" << endl;\\n // travarse(root);cout << endl;\\n\\n make_child(root);\\n //cout << \\\"make_child end\\\" << endl;\\n //travarse(root);\\n\\n root = find_leader(root);\\n\\n\\n int tmp = 0;\\n count_node(root,tmp);\\n maxnum=max(maxnum,tmp);\\n // cout <<\\\"find leader end\\\" << endl;\\n // travarse(root);cout << endl;\\n //break;\\n //if (cnt+1 == 105)travarse(root);\\n cnt++;\\n }\\n \\n cout << cnt <<\\\" \\\" << maxnum << endl;\\n return;\\n}\\n\\nmain(){\\n int n;\\n while(cin>>n && n){\\n // cout <<\\\"initial value is \\\" << n << endl;\\n solve(n);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 1172,\n \"score_of_the_acc\": -1.2898,\n \"final_rank\": 7\n }\n]","isConversational":false}}},{"rowIdx":682,"cells":{"group_id":{"kind":"string","value":"aoj_1227_cpp"},"problem_description":{"kind":"string","value":"Problem D:\n77377\nAt the risk of its future, International Cellular Phones Corporation (ICPC) invests its resources in developing new mobile phones, which are planned to be equipped with Web browser, mailer, instant messenger, and many other advanced communication tools. Unless members of ICPC can complete this stiff job, it will eventually lose its market share.\nYou are now requested to help ICPC to develop intriguing text input software for small mobile terminals. As you may know, most phones today have twelve buttons, namely, ten number buttons from \"\n0\n\" to \"\n9\n\" and two special buttons \"\n*\n\" and \"\n#\n\". Although the company is very ambitious, it has decided to follow today's standards and conventions. You should not change the standard button layout, and should also pay attention to the following standard button assignment.\nbutton\nletters\nbutton\nletters\n2\na, b, c\n6\nm, n, o\n3\nd, e, f\n7\np, q, r, s\n4\ng, h, i\n8\nt, u, v\n5\nj, k, l\n9\nw, x, y, z\nThis means that you can only use eight buttons for text input.\nMost users of current ICPC phones are rushed enough to grudge wasting time on even a single button press. Your text input software should be economical of users' time so that a single button press is suffcient for each character input. In consequence, for instance, your program should accept a sequence of button presses \"\n77377\n\" and produce the word \"\npress\n\". Similarly, it should translate \"\n77377843288866\n\" into \"press the button\".\nUmmm... It seems impossible to build such text input software since more than one English letter is represented by a digit!. For instance, \"\n77377\n\" may represent not only \"press\" but also any one of 768 (= 4 × 4 × 3 × 4 × 4) character strings. However, we have the good news that the new model of ICPC mobile phones has enough memory to keep a dictionary. You may be able to write a program that filters out\nfalse words\n, i.e., strings not listed in the dictionary.\nInput\nThe input consists of multiple data sets, each of which represents a dictionary and a sequence of button presses in the following format.\nn\nword\n1\n.\n.\n.\nword\nn\nsequence\nn\nin the first line is a positive integer, representing the number of words in the dictionary. The next\nn\nlines, each representing a word in the dictionary, only contain lower case letters from `\na\n' to `\nz\n'. The order of words in the dictionary is arbitrary (not necessarily in the lexicographic order). No words occur more than once in the dictionary. The last line, sequence, is the sequence of button presses, and only contains digits from `\n2\n' to `\n9\n'.\nYou may assume that a dictionary has at most one hundred words and that the length of each word is between one and fifty, inclusive. You may also assume that the number of input digits in the\nsequence\nis between one and three hundred, inclusive.\nA line containing a zero indicates the end of the input.\nOutput\nFor each data set, your program should print all sequences that can be represented by the input sequence of button presses. Each s\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1227_746368","code_snippet":"// start: 10:34\n// stop: 10:43\n// start: 10:50\n// stop: 11:22\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <climits>\n#include <cctype>\n#include <algorithm>\n#include <numeric>\n#include <iostream>\n#include <string>\n#include <vector>\n#include <queue>\n#include <set>\n#include <map>\n#include <complex>\n#include <sstream>\n#include <deque>\n\n#define REP(i, n) for ( int i = 0; i < n; i++ )\n\nusing namespace std;\n\nmap<char, vector<char> > table;\n// map<string, int> close;\n\nstruct input {\n int idx;\n string str;\n string current;\n vector<string> words;\n};\n\n// なければ空文字列を返す？\nbool in_dictionary(vector<string> &dict, string word) {\n REP(i, dict.size()) {\n if ( dict[i] == word ) {\n return true;\n }\n }\n return false;\n}\n\nbool dict_match(vector<string> &dict, string word) {\n REP(i, dict.size()) {\n int match = 0;\n REP(j, word.size()) {\n if(dict[i][j] == word[j]) match++;\n else break;\n }\n if(match == word.size()) {\n // cout << word << \" match: \" << dict[i] << endl;\n return true;\n }\n }\n // cout << word << \" is not match.\" << endl;\n return false;\n}\n\nvoid dump(vector<string> &arr) {\n REP(i, arr.size()) {\n cout << arr[i] << \" \";\n }\n cout << endl;\n}\n\nstring join(vector<string> &arr, string glue = \" \") {\n string ret = arr[0];\n for(int i = 1; i < arr.size(); i++) {\n ret += glue + arr[i];\n }\n return ret;\n}\n\nvector<string> decode(vector<string> &dict, string line) {\n vector<string> ret(1);\n\n queue<input> inputs;\n struct input init = {0, \"\", \"\", vector<string>()};\n\n inputs.push(init);\n\n while(!inputs.empty()) {\n struct input inp = inputs.front(); inputs.pop();\n\n string key = inp.str + inp.current;\n // if(close[key]) continue;\n // close[key] = 1;\n\n if(inp.idx >= line.size() && inp.current == \"\") {\n ret.push_back(join(inp.words));\n // cout << \"end of parse!!!!! \" << ret.size() << endl;\n // dump(ret);\n // break;\n }\n\n REP(i, table[line[inp.idx]].size()) {\n string tmp_current = inp.current, tmp_str = inp.str;\n vector<string> tmp_words = inp.words;\n\n tmp_current += table[line[inp.idx]][i];\n tmp_str += table[line[inp.idx]][i];\n\n // cout << tmp_current << \" in-dic:\" << in_dictionary(dict, tmp_current) << endl;\n if(in_dictionary(dict, tmp_current)) {\n string match_current = tmp_current;\n vector<string> match_words = tmp_words;\n\n match_words.push_back(match_current);\n match_current = \"\";\n // cout << inp.idx+1 << \" add dump: \";\n // dump(match_words);\n\n struct input match_inp = {inp.idx+1, tmp_str, match_current, match_words};\n inputs.push(match_inp);\n }\n\n // cout << tmp_current << \" \" << dict_match(dict, tmp_current) << endl;\n if(inp.idx <= line.size() && dict_match(dict, tmp_current)) {\n struct input new_inp = {inp.idx+1, tmp_str, tmp_current, tmp_words};\n inputs.push(new_inp);\n }\n }\n }\n\n return ret;\n}\n\n// vector<string> convert(input inp) {\n\n// }\n\nint main() {\n int n;\n table['2'] = vector<char>(3);\n table['3'] = vector<char>(3);\n table['4'] = vector<char>(3);\n table['5'] = vector<char>(3);\n table['6'] = vector<char>(3);\n table['7'] = vector<char>(4);\n table['8'] = vector<char>(3);\n table['9'] = vector<char>(4);\n\n table['2'][0] = 'a';\n table['2'][1] = 'b';\n table['2'][2] = 'c';\n table['3'][0] = 'd';\n table['3'][1] = 'e';\n table['3'][2] = 'f';\n table['4'][0] = 'g';\n table['4'][1] = 'h';\n table['4'][2] = 'i';\n table['5'][0] = 'j';\n table['5'][1] = 'k';\n table['5'][2] = 'l';\n table['6'][0] = 'm';\n table['6'][1] = 'n';\n table['6'][2] = 'o';\n table['7'][0] = 'p';\n table['7'][1] = 'q';\n table['7'][2] = 'r';\n table['7'][3] = 's';\n table['8'][0] = 't';\n table['8'][1] = 'u';\n table['8'][2] = 'v';\n table['9'][0] = 'w';\n table['9'][1] = 'x';\n table['9'][2] = 'y';\n table['9'][3] = 'z';\n\n while(cin >> n, n) {\n vector<string> dict(n);\n string line;\n\n // close.clear();\n\n REP(i, n) {\n cin >> dict[i];\n }\n\n cin >> line;\n\n vector<string> results = decode(dict, line);\n REP(i, results.size()) {\n if ( results[i] != \"\" ) cout << results[i] << \".\" << endl;\n }\n cout << \"--\" << endl;\n } \n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1308,"score_of_the_acc":-1,"final_rank":3},{"submission_id":"aoj_1227_261577","code_snippet":"#include <iostream>\n#include <sstream>\n#include <iomanip>\n#include <algorithm>\n#include <cmath>\n#include <string>\n#include <vector>\n#include <list>\n#include <queue>\n#include <stack>\n#include <set>\n#include <map>\n#include <bitset>\n#include <numeric>\n#include <climits>\n#include <cfloat>\nusing namespace std;\n\nint main()\n{\n int num[] = {3, 3, 3, 3, 3, 4, 3, 4};\n char x = 'a';\n vector<char> button(256);\n for(int i=0; i<8; ++i){\n for(int j=0; j<num[i]; ++j){\n button[x] = '2' + i;\n ++ x;\n }\n }\n\n for(;;){\n int n;\n cin >> n;\n if(n == 0)\n return 0;\n\n map<string, vector<string> > dic;\n for(int i=0; i<n; ++i){\n string s;\n cin >> s;\n int m = s.size();\n string b(m, ' ');\n for(int i=0; i<m; ++i)\n b[i] = button[s[i]];\n dic[b].push_back(s);\n }\n\n string press;\n cin >> press;\n n = press.size();\n vector<vector<string> > ret(n+1);\n ret[0].push_back(\"\");\n for(int i=0; i<n; ++i){\n for(int j=max(0, i-49); j<=i; ++j){\n string s = press.substr(j, i-j+1);\n map<string, vector<string> >::iterator it = dic.find(s);\n if(it != dic.end()){\n for(unsigned k=0; k<ret[j].size(); ++k){\n for(unsigned l=0; l<it->second.size(); ++l){\n ret[i+1].push_back(ret[j][k] + it->second[l] + ' ');\n }\n }\n }\n }\n }\n\n for(unsigned k=0; k<ret[n].size(); ++k){\n ret[n][k][ret[n][k].size()-1] = '.';\n cout << ret[n][k] << endl;\n }\n cout << \"--\" << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":0,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_1227_188154","code_snippet":"#include <iostream>\n#include <map>\n#include <string>\nusing namespace std;\n\nconst string ButtonTable = \"22233344455566677778889999\";\n\nstring hash(const string& s)\n{\n string t = \"\";\n for (unsigned int i = 0; i < s.size(); ++i)\n t += ButtonTable[s[i] - 'a'];\n return t;\n}\n\nvoid solve(multimap<string, string>& dic, string seq, string ans)\n{\n for (unsigned int i = 1; i <= seq.size(); ++i) {\n string h = seq.substr(0, i), rem = seq.substr(i);\n for (multimap<string, string>::iterator it = dic.find(h); it != dic.end() && (*it).first == h; ++it) {\n if (rem.empty()) \n\tcout << ans << (*it).second << \".\" << endl;\n else\n\tsolve(dic, rem, ans + (*it).second + \" \");\n }\n }\n return;\n}\n\nint main()\n{\n int n;\n while (cin >> n) {\n if (n == 0)\n break;\n\n multimap<string, string> dic;\n for (int i = 0; i < n; ++i) {\n string s;\n cin >> s;\n dic.insert(multimap<string, string>::value_type(hash(s), s));\n }\n\n string seq;\n cin >> seq;\n solve(dic, seq, \"\");\n\n cout << \"--\" << endl;\n\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":0,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_1227_121290","code_snippet":"#include <iostream>\n#include <map>\n#include <queue>\n#include <algorithm>\n#include <set>\n#include <vector>\nusing namespace std;\n\nstruct NODE{\n\tstring now;\n\tvector<string> words;\n};\n\nint main(){\n\tint table[26]={2,2,2,3,3,3,4,4,4,5,5,5,6,6,6,7,7,7,7,8,8,8,9,9,9,9};\n\tint n;\n\twhile(cin >> n ,n ){\n\t\tvector< pair<string,string> > data;\n\t\tstring s;\n\t\tset< vector<string> > ret;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tcin >> s;\n\t\t\tstring tmp = s;\n\t\t\tfor(int j=0;j<s.length();j++){\n\t\t\t\ts[j] = table[s[j]-'a']+'0';\n\t\t\t}\n\t\t\tdata.push_back( make_pair(tmp,s) );\n\t\t}\n\t\tstring hoge;\n\t\tcin >> hoge;\n\t\t\n\t\tqueue<NODE> Q;\n\t\tNODE t;\n\t\tQ.push(t);\n\t\t\n\t\t//set<string> done;\n\t\t\n\t\twhile(Q.size()){\n\t\t\tNODE q = Q.front();Q.pop();\n\t\t\t//cout << q.now << endl;\n\t\t\tif( q.now == hoge){\n\t\t\t\tret.insert(q.words);\n\t\t\t}\n\t\t\t\n\t\t\tfor(int i=0;i<data.size();i++){\n\t\t\t\tNODE next = {q.now + data[i].second,q.words};\n\t\t\t\tnext.words.push_back(data[i].first);\n\t\t\t\tif( hoge.find(next.now) != 0)continue;\n\t\t\t\t//if( done.find(next.now) != done.end() )continue;\n\t\t\t\t//done.insert(next.now);\n\t\t\t\tQ.push(next);\n\t\t\t}\n\t\t}\n\t\t//sort(ret.begin(),ret.end(),greater<string>());\n\t\tfor( set<vector<string> >::iterator it = ret.begin(); it != ret.end(); ++it){\n\t\t\tfor(int i=0; i<(*it).size();i++)\n\t\t\t\tcout << (*it)[i] << (i == (*it).size()-1?\".\\n\":\" \");\n\t\t}\n\t\tcout << \"--\" << endl;\n\t}\n}","accuracy":1,"time_ms":20,"memory_kb":944,"score_of_the_acc":-1.7217,"final_rank":4}],"string":"[\n {\n \"submission_id\": \"aoj_1227_746368\",\n \"code_snippet\": \"// start: 10:34\\n// stop: 10:43\\n// start: 10:50\\n// stop: 11:22\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cmath>\\n#include <climits>\\n#include <cctype>\\n#include <algorithm>\\n#include <numeric>\\n#include <iostream>\\n#include <string>\\n#include <vector>\\n#include <queue>\\n#include <set>\\n#include <map>\\n#include <complex>\\n#include <sstream>\\n#include <deque>\\n\\n#define REP(i, n) for ( int i = 0; i < n; i++ )\\n\\nusing namespace std;\\n\\nmap<char, vector<char> > table;\\n// map<string, int> close;\\n\\nstruct input {\\n int idx;\\n string str;\\n string current;\\n vector<string> words;\\n};\\n\\n// なければ空文字列を返す？\\nbool in_dictionary(vector<string> &dict, string word) {\\n REP(i, dict.size()) {\\n if ( dict[i] == word ) {\\n return true;\\n }\\n }\\n return false;\\n}\\n\\nbool dict_match(vector<string> &dict, string word) {\\n REP(i, dict.size()) {\\n int match = 0;\\n REP(j, word.size()) {\\n if(dict[i][j] == word[j]) match++;\\n else break;\\n }\\n if(match == word.size()) {\\n // cout << word << \\\" match: \\\" << dict[i] << endl;\\n return true;\\n }\\n }\\n // cout << word << \\\" is not match.\\\" << endl;\\n return false;\\n}\\n\\nvoid dump(vector<string> &arr) {\\n REP(i, arr.size()) {\\n cout << arr[i] << \\\" \\\";\\n }\\n cout << endl;\\n}\\n\\nstring join(vector<string> &arr, string glue = \\\" \\\") {\\n string ret = arr[0];\\n for(int i = 1; i < arr.size(); i++) {\\n ret += glue + arr[i];\\n }\\n return ret;\\n}\\n\\nvector<string> decode(vector<string> &dict, string line) {\\n vector<string> ret(1);\\n\\n queue<input> inputs;\\n struct input init = {0, \\\"\\\", \\\"\\\", vector<string>()};\\n\\n inputs.push(init);\\n\\n while(!inputs.empty()) {\\n struct input inp = inputs.front(); inputs.pop();\\n\\n string key = inp.str + inp.current;\\n // if(close[key]) continue;\\n // close[key] = 1;\\n\\n if(inp.idx >= line.size() && inp.current == \\\"\\\") {\\n ret.push_back(join(inp.words));\\n // cout << \\\"end of parse!!!!! \\\" << ret.size() << endl;\\n // dump(ret);\\n // break;\\n }\\n\\n REP(i, table[line[inp.idx]].size()) {\\n string tmp_current = inp.current, tmp_str = inp.str;\\n vector<string> tmp_words = inp.words;\\n\\n tmp_current += table[line[inp.idx]][i];\\n tmp_str += table[line[inp.idx]][i];\\n\\n // cout << tmp_current << \\\" in-dic:\\\" << in_dictionary(dict, tmp_current) << endl;\\n if(in_dictionary(dict, tmp_current)) {\\n string match_current = tmp_current;\\n vector<string> match_words = tmp_words;\\n\\n match_words.push_back(match_current);\\n match_current = \\\"\\\";\\n // cout << inp.idx+1 << \\\" add dump: \\\";\\n // dump(match_words);\\n\\n struct input match_inp = {inp.idx+1, tmp_str, match_current, match_words};\\n inputs.push(match_inp);\\n }\\n\\n // cout << tmp_current << \\\" \\\" << dict_match(dict, tmp_current) << endl;\\n if(inp.idx <= line.size() && dict_match(dict, tmp_current)) {\\n struct input new_inp = {inp.idx+1, tmp_str, tmp_current, tmp_words};\\n inputs.push(new_inp);\\n }\\n }\\n }\\n\\n return ret;\\n}\\n\\n// vector<string> convert(input inp) {\\n\\n// }\\n\\nint main() {\\n int n;\\n table['2'] = vector<char>(3);\\n table['3'] = vector<char>(3);\\n table['4'] = vector<char>(3);\\n table['5'] = vector<char>(3);\\n table['6'] = vector<char>(3);\\n table['7'] = vector<char>(4);\\n table['8'] = vector<char>(3);\\n table['9'] = vector<char>(4);\\n\\n table['2'][0] = 'a';\\n table['2'][1] = 'b';\\n table['2'][2] = 'c';\\n table['3'][0] = 'd';\\n table['3'][1] = 'e';\\n table['3'][2] = 'f';\\n table['4'][0] = 'g';\\n table['4'][1] = 'h';\\n table['4'][2] = 'i';\\n table['5'][0] = 'j';\\n table['5'][1] = 'k';\\n table['5'][2] = 'l';\\n table['6'][0] = 'm';\\n table['6'][1] = 'n';\\n table['6'][2] = 'o';\\n table['7'][0] = 'p';\\n table['7'][1] = 'q';\\n table['7'][2] = 'r';\\n table['7'][3] = 's';\\n table['8'][0] = 't';\\n table['8'][1] = 'u';\\n table['8'][2] = 'v';\\n table['9'][0] = 'w';\\n table['9'][1] = 'x';\\n table['9'][2] = 'y';\\n table['9'][3] = 'z';\\n\\n while(cin >> n, n) {\\n vector<string> dict(n);\\n string line;\\n\\n // close.clear();\\n\\n REP(i, n) {\\n cin >> dict[i];\\n }\\n\\n cin >> line;\\n\\n vector<string> results = decode(dict, line);\\n REP(i, results.size()) {\\n if ( results[i] != \\\"\\\" ) cout << results[i] << \\\".\\\" << endl;\\n }\\n cout << \\\"--\\\" << endl;\\n } \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1308,\n \"score_of_the_acc\": -1,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1227_261577\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n#include <iomanip>\\n#include <algorithm>\\n#include <cmath>\\n#include <string>\\n#include <vector>\\n#include <list>\\n#include <queue>\\n#include <stack>\\n#include <set>\\n#include <map>\\n#include <bitset>\\n#include <numeric>\\n#include <climits>\\n#include <cfloat>\\nusing namespace std;\\n\\nint main()\\n{\\n int num[] = {3, 3, 3, 3, 3, 4, 3, 4};\\n char x = 'a';\\n vector<char> button(256);\\n for(int i=0; i<8; ++i){\\n for(int j=0; j<num[i]; ++j){\\n button[x] = '2' + i;\\n ++ x;\\n }\\n }\\n\\n for(;;){\\n int n;\\n cin >> n;\\n if(n == 0)\\n return 0;\\n\\n map<string, vector<string> > dic;\\n for(int i=0; i<n; ++i){\\n string s;\\n cin >> s;\\n int m = s.size();\\n string b(m, ' ');\\n for(int i=0; i<m; ++i)\\n b[i] = button[s[i]];\\n dic[b].push_back(s);\\n }\\n\\n string press;\\n cin >> press;\\n n = press.size();\\n vector<vector<string> > ret(n+1);\\n ret[0].push_back(\\\"\\\");\\n for(int i=0; i<n; ++i){\\n for(int j=max(0, i-49); j<=i; ++j){\\n string s = press.substr(j, i-j+1);\\n map<string, vector<string> >::iterator it = dic.find(s);\\n if(it != dic.end()){\\n for(unsigned k=0; k<ret[j].size(); ++k){\\n for(unsigned l=0; l<it->second.size(); ++l){\\n ret[i+1].push_back(ret[j][k] + it->second[l] + ' ');\\n }\\n }\\n }\\n }\\n }\\n\\n for(unsigned k=0; k<ret[n].size(); ++k){\\n ret[n][k][ret[n][k].size()-1] = '.';\\n cout << ret[n][k] << endl;\\n }\\n cout << \\\"--\\\" << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 0,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1227_188154\",\n \"code_snippet\": \"#include <iostream>\\n#include <map>\\n#include <string>\\nusing namespace std;\\n\\nconst string ButtonTable = \\\"22233344455566677778889999\\\";\\n\\nstring hash(const string& s)\\n{\\n string t = \\\"\\\";\\n for (unsigned int i = 0; i < s.size(); ++i)\\n t += ButtonTable[s[i] - 'a'];\\n return t;\\n}\\n\\nvoid solve(multimap<string, string>& dic, string seq, string ans)\\n{\\n for (unsigned int i = 1; i <= seq.size(); ++i) {\\n string h = seq.substr(0, i), rem = seq.substr(i);\\n for (multimap<string, string>::iterator it = dic.find(h); it != dic.end() && (*it).first == h; ++it) {\\n if (rem.empty()) \\n\\tcout << ans << (*it).second << \\\".\\\" << endl;\\n else\\n\\tsolve(dic, rem, ans + (*it).second + \\\" \\\");\\n }\\n }\\n return;\\n}\\n\\nint main()\\n{\\n int n;\\n while (cin >> n) {\\n if (n == 0)\\n break;\\n\\n multimap<string, string> dic;\\n for (int i = 0; i < n; ++i) {\\n string s;\\n cin >> s;\\n dic.insert(multimap<string, string>::value_type(hash(s), s));\\n }\\n\\n string seq;\\n cin >> seq;\\n solve(dic, seq, \\\"\\\");\\n\\n cout << \\\"--\\\" << endl;\\n\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 0,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1227_121290\",\n \"code_snippet\": \"#include <iostream>\\n#include <map>\\n#include <queue>\\n#include <algorithm>\\n#include <set>\\n#include <vector>\\nusing namespace std;\\n\\nstruct NODE{\\n\\tstring now;\\n\\tvector<string> words;\\n};\\n\\nint main(){\\n\\tint table[26]={2,2,2,3,3,3,4,4,4,5,5,5,6,6,6,7,7,7,7,8,8,8,9,9,9,9};\\n\\tint n;\\n\\twhile(cin >> n ,n ){\\n\\t\\tvector< pair<string,string> > data;\\n\\t\\tstring s;\\n\\t\\tset< vector<string> > ret;\\n\\t\\tfor(int i=0;i<n;i++){\\n\\t\\t\\tcin >> s;\\n\\t\\t\\tstring tmp = s;\\n\\t\\t\\tfor(int j=0;j<s.length();j++){\\n\\t\\t\\t\\ts[j] = table[s[j]-'a']+'0';\\n\\t\\t\\t}\\n\\t\\t\\tdata.push_back( make_pair(tmp,s) );\\n\\t\\t}\\n\\t\\tstring hoge;\\n\\t\\tcin >> hoge;\\n\\t\\t\\n\\t\\tqueue<NODE> Q;\\n\\t\\tNODE t;\\n\\t\\tQ.push(t);\\n\\t\\t\\n\\t\\t//set<string> done;\\n\\t\\t\\n\\t\\twhile(Q.size()){\\n\\t\\t\\tNODE q = Q.front();Q.pop();\\n\\t\\t\\t//cout << q.now << endl;\\n\\t\\t\\tif( q.now == hoge){\\n\\t\\t\\t\\tret.insert(q.words);\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tfor(int i=0;i<data.size();i++){\\n\\t\\t\\t\\tNODE next = {q.now + data[i].second,q.words};\\n\\t\\t\\t\\tnext.words.push_back(data[i].first);\\n\\t\\t\\t\\tif( hoge.find(next.now) != 0)continue;\\n\\t\\t\\t\\t//if( done.find(next.now) != done.end() )continue;\\n\\t\\t\\t\\t//done.insert(next.now);\\n\\t\\t\\t\\tQ.push(next);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//sort(ret.begin(),ret.end(),greater<string>());\\n\\t\\tfor( set<vector<string> >::iterator it = ret.begin(); it != ret.end(); ++it){\\n\\t\\t\\tfor(int i=0; i<(*it).size();i++)\\n\\t\\t\\t\\tcout << (*it)[i] << (i == (*it).size()-1?\\\".\\\\n\\\":\\\" \\\");\\n\\t\\t}\\n\\t\\tcout << \\\"--\\\" << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 944,\n \"score_of_the_acc\": -1.7217,\n \"final_rank\": 4\n }\n]","isConversational":false}}},{"rowIdx":683,"cells":{"group_id":{"kind":"string","value":"aoj_1219_cpp"},"problem_description":{"kind":"string","value":"Problem D:\nPump up Batteries\nBill is a boss of security guards. He has pride in that his men put on wearable computers on their\nduty. At the same time, it is his headache that capacities of commercially available batteries are\nfar too small to support those computers all day long. His men come back to the office to charge\nup their batteries and spend idle time until its completion. Bill has only one battery charger in\nthe office because it is very expensive.\nBill suspects that his men spend much idle time waiting in a queue for the charger. If it is the\ncase, Bill had better introduce another charger. Bill knows that his men are honest in some\nsense and blindly follow any given instructions or rules. Such a simple-minded way of life may\nlead to longer waiting time, but they cannot change their behavioral pattern.\nEach battery has a data sheet attached on it that indicates the best pattern of charging and\nconsuming cycle. The pattern is given as a sequence of pairs of consuming time and charging\ntime. The data sheet says the pattern should be followed cyclically to keep the battery in quality.\nA guard, trying to follow the suggested cycle strictly, will come back to the office exactly when\nthe consuming time passes out, stay there until the battery has been charged for the exact time\nperiod indicated, and then go back to his beat.\nThe guards are quite punctual. They spend not a second more in the office than the time\nnecessary for charging up their batteries. They will wait in a queue, however, if the charger is\noccupied by another guard, exactly on first-come-first-served basis. When two or more guards\ncome back to the office at the same instance of time, they line up in the order of their identifi-\ncation numbers, and, each of them, one by one in the order of that line, judges if he can use the\ncharger and, if not, goes into the queue. They do these actions in an instant.\nYour mission is to write a program that simulates those situations like Bill’s and reports how\nmuch time is wasted in waiting for the charger.\nInput\nThe input consists of one or more data sets for simulation.\nThe first line of a data set consists of two positive integers separated by a space character: the\nnumber of guards and the simulation duration. The number of guards does not exceed one\nhundred. The guards have their identification numbers starting from one up to the number of\nguards. The simulation duration is measured in minutes, and is at most one week, i.e., 10080\n(min.).\nPatterns for batteries possessed by the guards follow the first line. For each guard, in the order\nof identification number, appears the pattern indicated on the data sheet attached to his battery.\nA pattern is a sequence of positive integers, whose length is a multiple of two and does not exceed\nfifty. The numbers in the sequence show consuming time and charging time alternately. Those\ntimes are also given in minutes and are at most one day, i.e., 1440 (min.). A space character or\na newline follows e\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1219_7227174","code_snippet":"#include <iostream>\n#include <queue>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nstruct E{\n\tint ot;\n\tint nt;\n\tint t;\n\tint no;\n\tint s;\n\tbool operator<(const E& e)const{\n\t\tif(t!=e.t)return t>e.t;\n\t\treturn no>e.no;\n\t}\n};\n\nvoid f(int n,int m){\n\tvector<vector<int> > ds;\n\tvector<int> v;\n\tvector<int> ss;\n\tpriority_queue<E> pqw;\n\tqueue<E> qs;\n\t\n\tfor(int i=0;i<n;i++){\n\t\tint t;\n\t\tds.push_back(v);\n\t\twhile(true){\n\t\t\tcin>>t;\n\t\t\tif(t==0)break;\n\t\t\tds[i].push_back(t);\n\t\t}\n\t\tss.push_back(ds[i].size());\n\t\tE e;\n\t\te.t=ds[i][0];\n\t\te.ot=0;\n\t\te.no=i;\n\t\te.s=0;\n\t\tpqw.push(e);\n\t}\n\t\n\tint t=0;\n\tint z=0;\n\tlong long int ans=0;\n\tbool addo=true;\n\twhile(pqw.size()>0 || qs.size()>0){\n\t\tz++;\n\t\tE e1;\n\t\tif(qs.size()==0 && pqw.size()>0){\n\t\t\te1=pqw.top();\n\t\t\tpqw.pop();\n\t\t\taddo=true;\n\t\t}else if(pqw.size()==0 && qs.size()>0){\n\t\t\te1=qs.front();\n\t\t\tqs.pop();\n\t\t\tif(qs.size()>0){\n\t\t\t\tE e2=qs.front();\n\t\t\t\tqs.front().nt=e1.t;\n\t\t\t\tqs.front().t=e1.t+ds[e2.no][e2.s];\n\t\t\t}\n\t\t\taddo=false;\n\t\t}else{\n\t\t\tE eq=qs.front();\n\t\t\tE ep=pqw.top();\n\t\t\t\n\t\t\tif(eq.t<=ep.t){\n\t\t\t\te1=qs.front();\n\t\t\t\tqs.pop();\n\t\t\t\tif(qs.size()>0){\n\t\t\t\t\tE e2=qs.front();\n\t\t\t\t\tqs.front().nt=e1.t;\n\t\t\t\t\tqs.front().t=e1.t+ds[e2.no][e2.s];\n\t\t\t\t}\n\t\t\t\taddo=false;\n\t\t\t}else{\n\t\t\t\te1=pqw.top();\n\t\t\t\tpqw.pop();\n\t\t\t\taddo=true;\n\t\t\t}\n\t\t}\n\t\t//cout<<e1.no<<\" \"<<e1.t<<\" \"<<t<<\" \"<<e1.ot<<\" \"<<ds[e1.no][e1.s]<<\" \"<<addo<<\" \"<<ans;\n\t\t//if(qs.size()>0){\n\t\t//\tcout<<\" \"<<qs.front().t;\n\t\t//}\n\t\t//cout<<endl;\n\t\tif(addo==false){\n\t\t\tans+=min(m,e1.nt)-e1.ot;\n\t\t}\n\t\t\n\t\tif(e1.t>=m){\n\t\t\tcontinue;\n\t\t}\n\t\tt=e1.t;\n\t\t\n\t\te1.s=(e1.s+1)%ss[e1.no];\n\t\tif(addo==true){\n\t\t\te1.ot=t;\n\t\t\tif(qs.size()==0){\n\t\t\t\te1.t=t+ds[e1.no][e1.s];\n\t\t\t\te1.nt=e1.ot;\n\t\t\t}\n\t\t\tqs.push(e1);\n\t\t}else{\n\t\t\t\n\t\t\te1.t=t+ds[e1.no][e1.s];\n\t\t\tpqw.push(e1);\n\t\t}\n\t\n\t}\n\tcout<<ans<<endl;\n}\n\nint main() {\n\twhile(true){\n\t\tint n,m;\n\t\tcin>>n>>m;\n\t\tif(n==0 && m==0)break;\n\t\tf(n,m);\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3168,"score_of_the_acc":-0.467,"final_rank":13},{"submission_id":"aoj_1219_3807639","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <string>\n#include <numeric>\n\n#define REP(i, a, b) for (int i = int(a); i < int(b); i++)\nusing namespace std;\ntypedef long long int ll;\n\n// clang-format off\n#ifdef _DEBUG_\n#define dump(...) do{ cerr << __LINE__ << \":\\t\" << #__VA_ARGS__ << \" = \"; PPPPP(__VA_ARGS__); cerr << endl; } while(false)\ntemplate<typename T> void PPPPP(T t) { cerr << t; }\ntemplate<typename T, typename... S> void PPPPP(T t, S... s) { cerr << t << \", \"; PPPPP(s...); }\n#else\n#define dump(...)\n#endif\ntemplate<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }\ntemplate<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }\ntemplate<typename T>\nbool chmin(T &a, T b) { if (a > b) {a = b; return true; } return false;}\ntemplate<typename T>\nbool chmax(T &a, T b) { if (a < b) {a = b; return true; } return false;}\n// clang-format on\n\n#include <utility>\nusing Bat = pair<int, int>;\n#include <queue>\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int n, t;\n while (cin >> n >> t, n + t) {\n vector<vector<Bat>> v(n);\n REP(i, 0, n) {\n for (;;) {\n int a, b;\n cin >> a;\n if (a == 0) break;\n cin >> b;\n v[i].emplace_back(a, b);\n }\n }\n queue<int> q;\n vector<int> cur(n), pat(n, 0);\n REP(i, 0, n) {\n cur[i] = v[i][0].first;\n }\n ll ans = 0;\n int rem = 0, irem = -1;\n REP(T, 0, t) {\n REP(i, 0, n) {\n if (cur[i] == -1) continue;\n if (cur[i]-- == 0) {\n q.emplace(i);\n }\n }\n if (irem == -1 && q.size()) {\n irem = q.front();\n rem = v[irem][pat[irem]].second;\n q.pop();\n }\n if (irem != -1 && --rem == 0) {\n pat[irem] = (pat[irem] + 1) % v[irem].size();\n cur[irem] = v[irem][pat[irem]].first;\n irem = -1;\n rem = -1;\n }\n ans += q.size();\n /*\n REP(i, 0, n) {\n cout << cur[i] << \" \";\n }\n cout << q.size() << endl;\n */\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3164,"score_of_the_acc":-0.5461,"final_rank":14},{"submission_id":"aoj_1219_3807450","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\n\nconstexpr long double EPS = 1e-15;\nconst long double PI = acos(-1);\nconstexpr int inf = 2e9;\nconstexpr ll INF = 2e18;\nconstexpr ll MOD = 1e9+7;\nconstexpr ll MOD1 = 998244353;\ntypedef pair<ll,ll> P;\n\n//#define all(v) (v).begin(), (v).end()\n#define rep(i,a,b) for (int i = (a); i < (b); i++)\n#define REP(i,n) rep(i,0,n)\n#define sz(s) (s).size()\n#define pb push_back\n#define fi first\n#define se second\n//#define mp make_pair\n\nbool pattern[110][10100];\nint pos[110];\nint n,m;\n\nvoid solve() {\nwhile (cin >> n >> m) {\n if (n == 0 && m == 0) break;\n \n for (int i = 0; i < n; i++) {\n pos[i] = 0;\n vector<int> v;\n int k;\n while (cin >> k, k) {\n v.pb(k);\n }\n int p = 0;\n bool status = 0;\n int vv = 0;\n while (p <= 10090) {\n int kk = v[vv];\n REP(j,kk) {\n if (p + 1 >= 10100) break;\n pattern[i][p++] = status;\n }\n vv = (vv + 1) % sz(v);\n status = !status;\n }\n }\n\n ll ans = 0;\n bool inque[110] = {};\n queue<int> que;\n for (int i = 0; i < m; i++) {\n for (int j = 0; j < n; j++) {\n if (!pattern[j][pos[j]]) pos[j]++;\n else {\n if (!inque[j]) {\n que.push(j);\n inque[j] = 1;\n }\n }\n }\n if (!que.empty()) {\n pos[que.front()]++;\n ans += que.size() - 1;\n if (pattern[que.front()][pos[que.front()]] == 0) {\n inque[que.front()] = 0;\n que.pop();\n }\n }\n // REP(j,n) {\n // cout << pos[j] << \" \";\n // }\n // cout << endl;\n }\n cout << ans << endl;\n}\n}\n\n\nint main(int argc, char *argv[]){\n\n // /* Regular */\n // int case_num = 1;\n // if (argc > 1 && stoi(argv[1])) cin >> case_num;\n // REP(case_no, case_num) {\n // cerr << endl << \"case \" << case_no + 1 << endl;\n // solve();\n // }\n\n /* AOJ */\n solve();\n\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":4036,"score_of_the_acc":-0.8207,"final_rank":17},{"submission_id":"aoj_1219_2589731","code_snippet":"#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\nstruct Info{\n\tint cicle[51],cicile_index,cicle_num,wait_time,tmp_time;\n\tbool is_queue;\n};\n\nint N,Time_Limit;\nInfo info[100];\n\nvoid func(){\n\n\tint tmp;\n\n\tfor(int i = 0; i < N; i++){\n\t\tinfo[i].cicile_index = 0;\n\t\tinfo[i].wait_time = 0;\n\t\tinfo[i].tmp_time = 0;\n\t\tinfo[i].is_queue = false;\n\n\t\tfor(int k = 0; ;k++){\n\t\t\tscanf(\"%d\",&tmp);\n\t\t\tif(tmp != 0){\n\t\t\t\tinfo[i].cicle[k] = tmp;\n\t\t\t}else{\n\t\t\t\tinfo[i].cicle_num = k;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\tqueue<int> Q;\n\tbool Finished;\n\n\tfor(int time = 0; time < Time_Limit; time++){\n\t\tFinished = false;\n\t\tfor(int i = 0; i < N; i++){\n\t\t\tif(info[i].is_queue == false){\n\t\t\t\tinfo[i].tmp_time++;\n\t\t\t\tif(info[i].tmp_time == info[i].cicle[info[i].cicile_index]){\n\t\t\t\t\tinfo[i].tmp_time = 0;\n\t\t\t\t\tinfo[i].cicile_index++;\n\t\t\t\t\tQ.push(i);\n\t\t\t\t\tinfo[i].is_queue = true;\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\tif(i == Q.front()){\n\t\t\t\t\tinfo[i].tmp_time++;\n\t\t\t\t\tif(info[i].tmp_time == info[i].cicle[info[i].cicile_index]){\n\t\t\t\t\t\tinfo[i].tmp_time = 0;\n\t\t\t\t\t\tif(info[i].cicile_index == info[i].cicle_num-1){\n\t\t\t\t\t\t\tinfo[i].cicile_index = 0;\n\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\tinfo[i].cicile_index++;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tinfo[i].is_queue = false;\n\t\t\t\t\t\tFinished = true;\n\t\t\t\t\t}\n\t\t\t\t}else{\n\t\t\t\t\tinfo[i].wait_time++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(Finished)Q.pop();\n\t}\n\n\tint ans = 0;\n\n\tfor(int i = 0; i < N; i++){\n\t\tans += info[i].wait_time;\n\t}\n\n\tprintf(\"%d\\n\",ans);\n}\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%d %d\",&N,&Time_Limit);\n\t\tif(N == 0 && Time_Limit == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3236,"score_of_the_acc":-0.5621,"final_rank":16},{"submission_id":"aoj_1219_2309658","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define F first\n#define S second\ntypedef pair<int,int> P;\n \nint main() {\n int n,t;\n while(cin>>n>>t&&n) {\n vector<P> v[n];\n int c[n],d=0;\n memset(c,0,sizeof(c));\n priority_queue<P,vector<P>,greater<P> > que;\n for(int i=0; i<n; i++) {\n int x,y;\n while(cin>>x&&x) {\n cin>>y;\n v[i].push_back(P(x,y));\n }\n if(v[i].size()) que.push(P(v[i][0].F,i));\n }\n int ans=0;\n for(int i=0; i<t; i++) {\n if(que.top().F<=i&&!d) {\n P p=que.top();que.pop();\n ans+=max(0,i-p.F);\n int k=p.S;\n d+=v[k][c[k]].S;\n c[k]=(c[k]+1)%v[k].size();\n que.push(P(i+v[k][c[k]].F+d,k));\n }\n if(d) d--;\n }\n while(!que.empty()) {\n P p=que.top();que.pop();\n ans+=max(0,t-p.F);\n }\n cout<<ans<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3124,"score_of_the_acc":-0.4571,"final_rank":12},{"submission_id":"aoj_1219_2134138","code_snippet":"#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\nusing ld = long double;\nconst ld eps = 1e-9;\n\n//// < \"d:\\d_download\\visual studio 2015\\projects\\programing_contest_c++\\debug\\a.txt\" > \"d:\\d_download\\visual studio 2015\\projects\\programing_contest_c++\\debug\\b.txt\"\n\n\nint main() {\n\twhile (1) {\n\t\tint N, T; cin >> N >> T;\n\t\tif (!N)break;\n\t\tint num = 0;\n\t\tvector<int>v;\n\t\tvector<vector<int>>guards(N);\n\t\twhile (num < N) {\n\t\t\tint a; cin >> a;\n\t\t\tif (a != 0) {\n\t\t\t\tguards[num].push_back(a);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tnum++;\n\t\t\t}\n\t\t}\n\t\tvector<pair<int, int>>status(N,make_pair(0,0));\n\t\tdeque<int>que;\n\t\tint ans = 0;\n\t\tfor (int t = 0; t < T; ++t) {\n\t\t\tint nbat = -1;\n\t\t\tif (!que.empty()) {\n\t\t\t\tans += que.size() - 1;\n\t\t\t\tnbat = que.front();\n\t\t\t}\n\t\t\tfor (int i = 0; i < N; ++i) {\n\t\t\t\t\n\t\t\t\tbool nowbat = status[i].first % 2;\n\t\t\t\tif (nowbat) {\n\t\t\t\t\tif (i ==nbat) {\n\t\t\t\t\t\tstatus[i].second++;\n\t\t\t\t\t\tif (status[i].second == guards[i][status[i].first]) {\n\t\t\t\t\t\t\tstatus[i].second = 0;\n\t\t\t\t\t\t\tstatus[i].first = (status[i].first + 1) % guards[i].size();\n\t\t\t\t\t\t\tque.pop_front();\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tstatus[i].second++;\n\t\t\t\t\tif (status[i].second == guards[i][status[i].first]) {\n\t\t\t\t\t\tstatus[i].second = 0;\n\t\t\t\t\t\tstatus[i].first = (status[i].first+1) % guards[i].size();\n\t\t\t\t\t\tque.push_back(i);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3184,"score_of_the_acc":-0.5505,"final_rank":15},{"submission_id":"aoj_1219_1964425","code_snippet":"#include <vector>\n#include <list>\n#include <map>\n#include <set>\n#include <queue>\n#include <deque>\n#include <stack>\n#include <algorithm>\n#include <functional>\n#include <numeric>\n#include <utility>\n#include <sstream>\n#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <cmath>\n#include <cstdlib>\n#include <cctype>\n#include <string>\n#include <cstring>\nusing namespace std;\n#define REP(i,n) for(int i = 0; i < (int)n; i++)\n#define FOR(i,a,b) for(int i = a; i < (int)b; i++)\n#define pb push_back\n#define mp make_pair\ntypedef vector<int> vi;\ntypedef pair<int, int> pi;\ntypedef long long ll;\nconst int INF = 1<<28;\nconst ll MOD = 1000000007;\nconst int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};\n\nstruct guard {\n\tvector<bool> cycle;\n\tint cnt;\n};\n\nint main() {\n\tios_base::sync_with_stdio(0);\n\tcin.tie(0);\n\n\tint g, d;\n\twhile(cin >> g >> d, g|d) {\n\t\tvector<guard> v(g);\n\t\tREP(i, g) {\n\t\t\tint in, in2 = 1;\n\t\t\twhile(cin >> in, in) {\n\t\t\t\tREP(j, in)\n\t\t\t\t\tv[i].cycle.pb(in2);\n\t\t\t\tin2 = (in2 + 1) % 2;\n\t\t\t}\n\t\t}\n\n\t\tqueue<int> q;\n\t\tset<int> s;\n\t\tREP(i, d) {\n\t\t\tREP(j, g) {\n\t\t\t\tif(v[j].cycle[v[j].cnt % v[j].cycle.size()])\n\t\t\t\t\tv[j].cnt++;\n\t\t\t\telse {\n\t\t\t\t\tif(!s.count(j)) {\n\t\t\t\t\t\tq.push(j);\n\t\t\t\t\t\ts.insert(j);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(q.size()) {\n\t\t\t\tint top = q.front();\n\t\t\t\tv[top].cnt++;\n\t\t\t\tif(v[top].cycle[v[top].cnt % v[top].cycle.size()]) {\n\t\t\t\t\tq.pop(); s.erase(top);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint ans = 0;\n\t\tREP(i, g)\n\t\t\tans += d - v[i].cnt;\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":260,"memory_kb":1388,"score_of_the_acc":-1.0696,"final_rank":18},{"submission_id":"aoj_1219_1162858","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n cin.tie(0); ios::sync_with_stdio(0);\n int n,T;\n while(cin >> n >> T, n){\n vector< vector<int> > cycle(n);\n for(int i=0;i<n;i++){\n int tmp;\n while(cin >> tmp, tmp)cycle[i].push_back(tmp);\n }\n vector<int> pos(n,0), end_time(n);\n for(int i=0;i<n;i++){\n end_time[i] = cycle[i][0];\n (pos[i] += 1) %= cycle[i].size();\n }\n\n queue<int> q;\n int charge = -1, charge_id = -1;\n int ans = 0;\n\n for(int t=0;t<T;t++){\n for(int i=0;i<n;i++){\n\tif(t==end_time[i]){\n\t end_time[i] = -1;\n\t q.push(i);\n\t}\n }\n \n if(charge <= t){\n\tif(charge_id>=0){\n\t end_time[charge_id] = t + cycle[charge_id][pos[charge_id]];\n\t (pos[charge_id] += 1) %= cycle[charge_id].size();\n\t charge = charge_id = -1;\n\t}\n\n\tif(q.size()){\n\t int nxt = q.front(); q.pop();\n\t charge = t + cycle[nxt][pos[nxt]];\n\t (pos[nxt] += 1) %= cycle[nxt].size();\n\t charge_id = nxt;\n\t}\n }\n\n ans += q.size();\n }\n\t \n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":20,"memory_kb":1240,"score_of_the_acc":-0.0766,"final_rank":1},{"submission_id":"aoj_1219_1159232","code_snippet":"#include <string> \n#include <algorithm> \n#include <cfloat> \n#include <climits> \n#include <cmath> \n#include <complex> \n#include <cstdio> \n#include <cstdlib> \n#include <cstring> \n#include <functional> \n#include <iostream> \n#include <map> \n#include <memory> \n#include <queue> \n#include <set> \n#include <sstream> \n#include <stack> \n#include <utility> \n#include <vector> \n\n#define EACH(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)\n#define ALL(x) (x).begin(),(x).end() \ntypedef long long ll;\nusing namespace std; \nconst double eps = 1e-10;\n\nstruct E{\n int id, time;\n E(){}\n E(int id, int time) : id(id), time(time) { }\n};\nbool operator<(const E &a, const E &b){\n if(a.time == b.time) return a.id > b.id;\n else return a.time > b.time;\n}\n\nint main(){\n for(;;){\n int n, m;\n cin >> n >> m;\n if(n == 0 && m == 0) return 0;\n vector<vector<int> > v(n);\n for(int i = 0; i < n; ++i){\n for(;;){\n int t;\n cin >> t;\n if(t == 0) break;\n v[i].push_back(t);\n }\n }\n\n vector<int> idx(n);\n priority_queue<E> eve;\n queue<int> Q;\n\n int res = 0;\n for(int i = 0; i < n; ++i){\n eve.push(E(i, v[i][0]));\n }\n eve.push(E(n, m));\n int lt = 0;\n while(!eve.empty()){\n int ct = eve.top().time;\n int id = eve.top().id;\n eve.pop();\n // cout << ct << \",\" << id << \",\" << max(0, (int)Q.size()-1) * (ct - lt) << endl;\n res += max(0, (int)Q.size()-1) * (ct - lt);\n if(id == n) break;\n else if(id < 0){\n int id = Q.front(); Q.pop();\n idx[id] = (idx[id] + 1) % v[id].size();\n eve.push(E(id, ct + v[id][idx[id]]));\n if(!Q.empty()){\n eve.push(E(-1, ct + v[Q.front()][idx[Q.front()]]));\n }\n }\n else if(idx[id] % 2 == 0){\n idx[id] = (idx[id] + 1) % v[id].size();\n if(Q.empty()){\n Q.push(id);\n eve.push(E(-1, ct + v[id][idx[id]]));\n }\n else{\n Q.push(id);\n }\n }\n lt = ct;\n }\n cout << res << endl;\n }\n}","accuracy":1,"time_ms":20,"memory_kb":1248,"score_of_the_acc":-0.0784,"final_rank":2},{"submission_id":"aoj_1219_1081141","code_snippet":"#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n\n#include <iostream>\n#include <cstdio>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cctype>\n#include <utility>\n#include <assert.h>\n \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <int,int> P;\ntypedef pair <int,P> PP;\n \nstatic const double EPS = 1e-8;\n\nclass State {\npublic:\n int _id;\n int _time;\n int _occupy;\n State(int id,int time,int occupy) : _id(id),_time(time), _occupy(occupy) {}\n bool operator<(const State& s) const {\n if(_time == s._time) return _id < s._id;\n return _time < s._time;\n }\n bool operator>(const State& s) const {\n if(_time == s._time) return _id > s._id;\n return _time > s._time;\n }\n};\n\nint main(){\n int num_of_guards;\n int simulation_duration;\n while(~scanf(\"%d %d\",&num_of_guards,&simulation_duration)){\n if(num_of_guards == 0 && simulation_duration == 0) break;\n\n vector<int> time_table[101];\n for(int guard_i = 0; guard_i < num_of_guards; guard_i++){\n int consuming_duration;\n int charging_duration;\n while(~scanf(\"%d\",&consuming_duration)){\n if(consuming_duration == 0) break;\n scanf(\"%d\",&charging_duration);\n time_table[guard_i].push_back(consuming_duration);\n time_table[guard_i].push_back(charging_duration);\n }\n }\n \n int for_queue[101];\n int next_process[101];\n bool is_inque[101];\n memset(next_process,0,sizeof(next_process));\n memset(for_queue,0,sizeof(for_queue));\n memset(is_inque,false,sizeof(is_inque));\n\n priority_queue<State,vector<State>,greater<State> > que;\n int res = 0;\n for(int time = 0; time < simulation_duration;time++){\n char action[101];\n memset(action,'-',sizeof(action));\n for(int guard_i = 0; guard_i < num_of_guards; guard_i++){\n if(next_process[guard_i] % 2 == 0){ // to consume\n if(is_inque[guard_i]){\n continue;\n }\n for_queue[guard_i] = time_table[guard_i][next_process[guard_i] % time_table[guard_i].size()] - 1;\n next_process[guard_i]++;\n action[guard_i] = '*';\n }\n else{ //to charge\n if(for_queue[guard_i] > 0){\n action[guard_i] = '*';\n for_queue[guard_i]--;\n continue;\n }\n\n que.push(State(guard_i,time,time_table[guard_i][next_process[guard_i] % time_table[guard_i].size()]));\n next_process[guard_i]++;\n is_inque[guard_i] = true;\n }\n }\n if(!que.empty()){\n State s = que.top();\n que.pop();\n action[s._id] = '.';\n if(s._occupy - 1 > 0){\n que.push(State(s._id,s._time,s._occupy-1));\n }\n else{\n is_inque[s._id] = false;\n }\n }\n\n res += count(action,action+num_of_guards,'-');\n\n // for debug\n // printf(\"time:%d\\n\",time);\n // for(int guard_i = 0; guard_i < num_of_guards; guard_i++){\n // printf(\"%c\\n\",action[guard_i]);\n // }\n // printf(\"\\n\");\n }\n\n printf(\"%d\\n\",res);\n }\n}","accuracy":1,"time_ms":60,"memory_kb":1228,"score_of_the_acc":-0.2339,"final_rank":10},{"submission_id":"aoj_1219_1078664","code_snippet":"#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n\n#include <iostream>\n#include <cstdio>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cctype>\n#include <utility>\n#include <assert.h>\n \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <int,int> P;\ntypedef pair <int,P> PP;\n \nstatic const double EPS = 1e-8;\n\nclass State {\npublic:\n int _id;\n int _time;\n int _occupy;\n State(int id,int time,int occupy) : _id(id),_time(time), _occupy(occupy) {}\n bool operator<(const State& s) const {\n if(_time == s._time) return _id < s._id;\n return _time < s._time;\n }\n bool operator>(const State& s) const {\n if(_time == s._time) return _id > s._id;\n return _time > s._time;\n }\n};\n\nint main(){\n int num_of_guards;\n int simulation_duration;\n while(~scanf(\"%d %d\",&num_of_guards,&simulation_duration)){\n if(num_of_guards == 0 && simulation_duration == 0) break;\n\n vector<int> time_table[101];\n for(int guard_i = 0; guard_i < num_of_guards; guard_i++){\n int comsuming_duration;\n int charging_duration;\n while(~scanf(\"%d\",&comsuming_duration)){\n if(comsuming_duration == 0) break;\n scanf(\"%d\",&charging_duration);\n time_table[guard_i].push_back(comsuming_duration);\n time_table[guard_i].push_back(charging_duration);\n }\n }\n \n int for_queue[101];\n int next_process[101];\n bool is_inque[101];\n memset(next_process,0,sizeof(next_process));\n memset(for_queue,0,sizeof(for_queue));\n memset(is_inque,false,sizeof(is_inque));\n\n priority_queue<State,vector<State>,greater<State> > que;\n int res = 0;\n for(int time = 0; time < simulation_duration;time++){\n char action[101];\n memset(action,'-',sizeof(action));\n for(int guard_i = 0; guard_i < num_of_guards; guard_i++){\n if(next_process[guard_i] % 2 == 0){ // to consume\n if(is_inque[guard_i]){\n continue;\n }\n for_queue[guard_i] = time_table[guard_i][next_process[guard_i] % time_table[guard_i].size()] - 1;\n next_process[guard_i]++;\n action[guard_i] = '*';\n }\n else{ //to charge\n if(for_queue[guard_i] > 0){\n action[guard_i] = '*';\n for_queue[guard_i]--;\n continue;\n }\n\n que.push(State(guard_i,time,time_table[guard_i][next_process[guard_i] % time_table[guard_i].size()]));\n next_process[guard_i]++;\n is_inque[guard_i] = true;\n }\n }\n if(!que.empty()){\n State s = que.top();\n que.pop();\n action[s._id] = '.';\n if(s._occupy - 1 > 0){\n que.push(State(s._id,s._time,s._occupy-1));\n }\n else{\n is_inque[s._id] = false;\n }\n }\n\n res += count(action,action+num_of_guards,'-');\n\n // for debug\n // printf(\"time:%d\\n\",time);\n // for(int guard_i = 0; guard_i < num_of_guards; guard_i++){\n // printf(\"%c\\n\",action[guard_i]);\n // }\n // printf(\"\\n\");\n }\n\n printf(\"%d\\n\",res);\n }\n}","accuracy":1,"time_ms":60,"memory_kb":1232,"score_of_the_acc":-0.2348,"final_rank":11},{"submission_id":"aoj_1219_1030907","code_snippet":"#include<iostream>\n#include<vector>\n#include<queue>\n\nusing namespace std;\n\nint main(){\n for(int g,d;cin>>g>>d,g|d;){\n vector<char> t[100];\n for(int i=0;i<g;i++){\n bool on=true;\n for(int ti;cin>>ti,ti;){\n\tvector<char> v(ti,on);\n\tt[i].insert(end(t[i]),begin(v),end(v));\n\ton=!on;\n }\n }\n bool inque[100]={};\n queue<int> que;\n int a=0;\n int x[100]={};\n for(int i=0;i<d;i++){\n a+=max<int>(0,que.size()-1);\n for(int j=0;j<g;j++){\n\tif(!inque[j]){\n\t x[j]=(x[j]+1)%t[j].size();\n\t}\n }\n if(!que.empty()){\n\tint id=que.front();\n\tx[id]=(x[id]+1)%t[id].size();\n\tif(t[id][x[id]]){\n\t que.pop();\n\t inque[id]=false;\n\t}\n }\n for(int j=0;j<g;j++){\n\tif(!inque[j]&&!t[j][x[j]]){\n\t que.push(j);\n\t inque[j]=true;\n\t}\n }\n }\n cout<<a<<endl;\n }\n}","accuracy":1,"time_ms":200,"memory_kb":2572,"score_of_the_acc":-1.0939,"final_rank":19},{"submission_id":"aoj_1219_991398","code_snippet":"#include<bits/stdc++.h>\n\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n\nusing namespace std;\n\ntypedef pair<int,int> ii;\n\nstruct Data{\n int id,stamp;\n bool operator < ( const Data& data ) const {\n if( stamp != data.stamp ) return stamp > data.stamp;\n return id > data.id;\n }\n};\n\nvector<ii> cycle[110];\nint n,m,run_time[110],indices[110],charger,charge_id;\nbool inQueue[110];\n\nint simulate(){\n\n rep(i,n) run_time[i] = cycle[i][0].first, indices[i] = 0, inQueue[i] = false;\n charger = 0, charge_id = -1;\n priority_queue<Data> Q;\n int ret = 0;\n rep(_,m){\n\n rep(i,n) {\n if( run_time[i] <= 0 && !inQueue[i] ) {\n Q.push((Data){i,_});\n inQueue[i] = true;\n }\n run_time[i]--;\n }\n\n if( charger == 0 && !Q.empty() ) {\n charge_id = Q.top().id; Q.pop();\n charger = cycle[charge_id][indices[charge_id]].second;\n } \n\n if( charger ) {\n --charger;\n if( charger <= 0 ) {\n inQueue[charge_id] = false;\n ( indices[charge_id] += 1 ) %= (int)cycle[charge_id].size();\n run_time[charge_id] = cycle[charge_id][indices[charge_id]].first;\n }\n } \n\n ret += (int)Q.size();\n\n }\n\n return ret;\n}\n\nint main(){\n while( cin >> n >> m, n | m ){\n rep(i,n) {\n int a,b;\n cycle[i].clear();\n while( cin >> a , a ){\n cin >> b;\n cycle[i].push_back(ii(a,b));\n }\n }\n\n cout << simulate() << endl;\n\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":1252,"score_of_the_acc":-0.1193,"final_rank":3},{"submission_id":"aoj_1219_991396","code_snippet":"#include<bits/stdc++.h>\n\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n\nusing namespace std;\n\ntypedef pair<int,int> ii;\n\nstruct Data{\n int id,stamp;\n bool operator < ( const Data& data ) const {\n if( stamp != data.stamp ) return stamp > data.stamp;\n return id > data.id;\n }\n};\n\nvector<ii> cycle[110];\nint n,m,run_time[110],indices[110],charger,charge_id;\nbool inQueue[110];\n\n//char debug[110][1000000];\n\nint simulate(){\n\n //rep(i,110) rep(j,1000000) debug[i][j] = '?';\n\n rep(i,n) run_time[i] = cycle[i][0].first, indices[i] = 0, inQueue[i] = false;\n charger = 0, charge_id = -1;\n priority_queue<Data> Q;\n int ret = 0;\n rep(_,m){\n\n rep(i,n) {\n if( run_time[i] <= 0 && !inQueue[i] ) {\n Q.push((Data){i,_});\n inQueue[i] = true;\n }\n run_time[i]--;\n }\n\n if( charger == 0 && !Q.empty() ) {\n charge_id = Q.top().id; Q.pop();\n charger = cycle[charge_id][indices[charge_id]].second;\n } \n\n if( charger ) {\n --charger;\n if( charger <= 0 ) {\n inQueue[charge_id] = false;\n ( indices[charge_id] += 1 ) %= (int)cycle[charge_id].size();\n run_time[charge_id] = cycle[charge_id][indices[charge_id]].first;\n charge_id = -1;\n }\n } \n\n /*\n rep(i,n) if( inQueue[i] ) {\n debug[i][_] = '-';\n if( i == charge_id ) debug[i][_] = '.';\n } else debug[i][_] = '*';\n */\n\n ret += (int)Q.size();\n\n }\n /*\n rep(i,n){\n rep(j,m){\n cout << debug[i][j];\n }\n cout << endl;\n }\n */\n\n return ret;\n}\n\nint main(){\n while( cin >> n >> m, n | m ){\n rep(i,n) {\n int a,b;\n cycle[i].clear();\n while( cin >> a , a ){\n cin >> b;\n cycle[i].push_back(ii(a,b));\n }\n }\n\n cout << simulate() << endl;\n\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":1252,"score_of_the_acc":-0.1193,"final_rank":3},{"submission_id":"aoj_1219_902277","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <string>\n#include <sstream>\n#include <cstring>\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <numeric>\n#include <cctype>\n#include <tuple>\n\n#ifdef _MSC_VER\n#include <agents.h>\n#endif\n\n#define FOR(i, a, b) for(int i = (a); i < (int)(b); ++i)\n#define rep(i, n) FOR(i, 0, n)\n#define ALL(v) v.begin(), v.end()\n#define REV(v) v.rbegin(), v.rend()\n#define MEMSET(v, s) memset(v, s, sizeof(v))\n#define X first\n#define Y second\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int, int> P;\n\nint sch[110][10100];\nint inq[110];\n\nint main(){\n\tint n, t;\n\twhile (cin >> n >> t, n | t){\n\t\tMEMSET(sch, 0);\n\t\tvector<int> cur(n), len(n);\n\t\trep(i, n){\n\t\t\tint x;\n\t\t\tint y = 0;\n\t\t\twhile (cin >> x, x){\n\t\t\t\tfor (int j = len[i]; j < len[i] + x; ++j){\n\t\t\t\t\tsch[i][j] = y;\n\t\t\t\t}\n\t\t\t\tlen[i] += x;\n\t\t\t\ty ^= 1;\n\t\t\t}\n\t\t}\n\t\t//rep(i, n){\n\t\t//\trep(j, t){\n\t\t//\t\tcout << (sch[i][j%len[i]] ? \".\" : \"*\");\n\t\t//\t}\n\t\t//\tcout << endl;\n\t\t//}\n\n\t\tqueue<int> q;\n\t\tMEMSET(inq, 0);\n\t\tint ans = 0;\n\t\trep(i, t){\n\t\t\trep(j, n){\n\t\t\t\tif (inq[j]) continue;\n\t\t\t\tif (sch[j][cur[j] % len[j]]){\n\t\t\t\t\tq.push(j);\n\t\t\t\t\tinq[j] = 1;\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\t++cur[j];\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (q.empty()) continue;\n\t\t\tans += q.size() - 1;\n\t\t\tint use = q.front();\n\t\t\t++cur[use];\n\t\t\tif (!sch[use][cur[use] % len[use]]){\n\t\t\t\tq.pop();\n\t\t\t\tinq[use] = 0;\n\t\t\t}\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":100,"memory_kb":5556,"score_of_the_acc":-1.36,"final_rank":20},{"submission_id":"aoj_1219_846037","code_snippet":"#include <iostream>\n#include <complex>\n#include <sstream>\n#include <string>\n#include <algorithm>\n#include <deque>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <vector>\n#include <set>\n#include <limits>\n#include <cstdio>\n#include <cctype>\n#include <cmath>\n#include <cstdlib>\n#include <ctime>\nusing namespace std;\n#define REP(i, j) for(int i = 0; i < j; ++i)\n#define FOR(i, j, k) for(int i = j; i < k; ++i)\n#define P pair<int, int>\n\nclass C{\n public:\n int now, cnt, num, stay_num;\n vector<int> v;\n C(){ now = 0; cnt = 0; stay_num = 0; }\n};\n\nint main() {\n int n, time;\n while(cin >>n >>time && n){\n vector<C> v(n);\n REP(i, n){\n int tmp;\n while(cin >>tmp && tmp) v[i].v.push_back(tmp);\n v[i].num = i;\n }\n\n int ans = 0, next = 0, last = 0;\n REP(t, time){\n bool stay_end = false;\n REP(i, n){\n //稼働中\n if(v[i].now % 2 == 0){\n v[i].cnt += 1;\n if(v[i].cnt >= v[i].v[ v[i].now ]){\n v[i].cnt = 0;\n v[i].now = (v[i].now + 1 >= v[i].v.size() ? 0 : v[i].now + 1);\n v[i].stay_num = last;\n last += 1;\n }\n }\n //待ち番号 == next\n else if(v[i].stay_num == next){\n v[i].cnt += 1;\n if(v[i].cnt >= v[i].v[ v[i].now ]){\n v[i].cnt = 0;\n v[i].now = (v[i].now + 1 >= v[i].v.size() ? 0 : v[i].now + 1);\n stay_end = true;\n }\n }\n //待ち番号 > next\n else{\n ans += 1;\n }\n }\n if(stay_end) next += 1;\n }\n cout <<ans <<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":1240,"score_of_the_acc":-0.1966,"final_rank":8},{"submission_id":"aoj_1219_605262","code_snippet":"#include <iostream>\n#include <sstream>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <set>\n#include <map>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <cassert>\n\nusing namespace std;\n\n#define FOR(i,k,n) for(int i=(k); i<(int)(n); ++i)\n#define REP(i,n) FOR(i,0,n)\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n\ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cerr<<*i<<\" \"; cerr<<endl; }\ninline bool valid(int x, int y, int W, int H){ return (x >= 0 && y >= 0 && x < W && y < H); }\n\ntypedef long long ll;\nconst int INF = 100000000;\nconst double EPS = 1e-8;\nconst int MOD = 1000000007;\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\n\nint main(){\n int N, T;\n while(cin >> N >> T && N){\n vector<int> v[100];\n REP(i, N){\n int t; \n while(cin >> t && t) v[i].push_back(t);\n }\n vector<int> cur(N);\n vector<int> rest(N);\n REP(i, N) rest[i] = v[i][0];\n int now_use = -1;\n queue<int> que;\n int ans = 0;\n REP(t, T){\n if(now_use == -1 && !que.empty()){\n now_use = que.front();\n que.pop();\n }\n ans += que.size();\n REP(i, N){\n if(now_use == i || cur[i] % 2 == 0){\n rest[i]--;\n if(rest[i] == 0){\n cur[i] = (cur[i] + 1) % v[i].size();\n rest[i] = v[i][cur[i]];\n if(now_use == i) now_use = -1;\n if(cur[i] % 2 == 1){\n que.push(i);\n }\n }\n }\n }\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":1240,"score_of_the_acc":-0.1566,"final_rank":5},{"submission_id":"aoj_1219_556949","code_snippet":"#include<queue>\n#include<cstdio>\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\n\nint main(){\n\tfor(int n,T;scanf(\"%d%d\",&n,&T),n;){\n\t\tvector<int> pttn[100];\n\t\trep(i,n){\n\t\t\twhile(1){\n\t\t\t\tint t; scanf(\"%d\",&t);\n\t\t\t\tif(t==0) break;\n\t\t\t\tpttn[i].push_back(t);\n\t\t\t}\n\t\t}\n\n\t\tint ans=0;\n\t\tint idx[100]={},cons[100]={},charge=-1;\n\t\tqueue<int> wait;\n\t\twhile(T--){\n\t\t\tif(charge==-1 && !wait.empty()){\n\t\t\t\tcharge=wait.front();\n\t\t\t\twait.pop();\n\t\t\t}\n\n\t\t\trep(i,n){\n\t\t\t\tif(idx[i]%2==0 || i==charge){\n\t\t\t\t\tcons[i]++;\n\t\t\t\t\tif(cons[i]==pttn[i][idx[i]]){ // 充電したくなる or 充電が終わる\n\t\t\t\t\t\tif(idx[i]%2==0) wait.push(i);\n\t\t\t\t\t\telse charge=-1;\n\t\t\t\t\t\tidx[i]=(idx[i]+1)%pttn[i].size();\n\t\t\t\t\t\tcons[i]=0;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse{ // 充電器が空くのを待つ\n\t\t\t\t\tans++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tprintf(\"%d\\n\",ans);\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":60,"memory_kb":1076,"score_of_the_acc":-0.2,"final_rank":9},{"submission_id":"aoj_1219_540803","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <queue>\nusing namespace std;\n\nconst int MAXN = 101;\nconst int MAXM = 10080;\nint N, M;\nvector<int> T[MAXN];\n\nint main() {\n while(cin >> N >> M && (N|M)) {\n for(int i = 0; i < MAXN; ++i) T[i].clear();\n for(int i = 0; i < N; ++i) {\n int a;\n while(cin >> a && a) {\n\tT[i].push_back(a);\n }\n }\n queue<int> que;\n int ju_den = -1;\n int p[MAXN];\n int t[MAXN];\n fill(p,p+MAXN, 0);\n for(int j = 0; j < N; ++j) t[j] = T[j][0];\n int ans = 0;\n for(int i = 0; i < M; ++i) {\n for(int j = 0; j < N; ++j) {\n\tif(p[j]%2 == 0) {\n\t --t[j];\n\t if(t[j] == 0) {\n\t p[j] = (p[j]+1)%T[j].size();\n\t t[j] = T[j][p[j]];\n\t que.push(j);\n\t }\n\t} else {\n\t if(ju_den == j) {\n\t --t[j];\n\t if(t[j] == 0) {\n\t p[j] = (p[j]+1)%T[j].size();\n\t t[j] = T[j][p[j]];\n\t ju_den = -1;\n\t }\n\t } else {\n\t ++ans;\n\t }\n\t}\n }\n if(que.size() && ju_den == -1) {\n\tju_den = que.front();\n\tque.pop();\n }\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":1248,"score_of_the_acc":-0.1584,"final_rank":6},{"submission_id":"aoj_1219_539025","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <queue>\n \nusing namespace std;\n\nconst int N = 100;\nint n, m;\nvector<int> data[N];\n \nint main(){\n while(cin >> n >> m && (n|m)){\n for(int i=0;i<n;i++){\n data[i].clear();\n while(1){\n int in;\n cin >> in;\n if(in == 0) break;\n data[i].push_back(in);\n }\n }\n int ans = 0, rem[N], idx[N];\n priority_queue<pair<int, int> > q;\n bool flag[N];\n for(int i=0;i<n;i++) rem[i] = data[i][0];\n fill(idx, idx+n, 0);\n fill(flag, flag+n, false);\n for(int k=0;k<m;k++){\n pair<int, int> tmp = make_pair(1, 1);\n if(q.size()){ tmp = q.top(); q.pop(); }\n for(int i=0;i<n;i++){\n if(!flag[i]){\n rem[i]--;\n if(rem[i] == 0){\n idx[i] = (idx[i] + 1) % data[i].size();\n rem[i] = data[i][idx[i]];\n flag[i] = true;\n q.push(make_pair(-k, -i));\n }\n }else{\n if(-tmp.second == i){\n rem[i]--;\n if(rem[i] == 0){\n idx[i] = (idx[i] + 1) % data[i].size();\n rem[i] = data[i][idx[i]];\n flag[i] = false;\n }else q.push(tmp);\n }else ans++;\n }\n }\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":1248,"score_of_the_acc":-0.1584,"final_rank":6}],"string":"[\n {\n \"submission_id\": \"aoj_1219_7227174\",\n \"code_snippet\": \"#include <iostream>\\n#include <queue>\\n#include <vector>\\n#include <algorithm>\\nusing namespace std;\\n\\nstruct E{\\n\\tint ot;\\n\\tint nt;\\n\\tint t;\\n\\tint no;\\n\\tint s;\\n\\tbool operator<(const E& e)const{\\n\\t\\tif(t!=e.t)return t>e.t;\\n\\t\\treturn no>e.no;\\n\\t}\\n};\\n\\nvoid f(int n,int m){\\n\\tvector<vector<int> > ds;\\n\\tvector<int> v;\\n\\tvector<int> ss;\\n\\tpriority_queue<E> pqw;\\n\\tqueue<E> qs;\\n\\t\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tint t;\\n\\t\\tds.push_back(v);\\n\\t\\twhile(true){\\n\\t\\t\\tcin>>t;\\n\\t\\t\\tif(t==0)break;\\n\\t\\t\\tds[i].push_back(t);\\n\\t\\t}\\n\\t\\tss.push_back(ds[i].size());\\n\\t\\tE e;\\n\\t\\te.t=ds[i][0];\\n\\t\\te.ot=0;\\n\\t\\te.no=i;\\n\\t\\te.s=0;\\n\\t\\tpqw.push(e);\\n\\t}\\n\\t\\n\\tint t=0;\\n\\tint z=0;\\n\\tlong long int ans=0;\\n\\tbool addo=true;\\n\\twhile(pqw.size()>0 || qs.size()>0){\\n\\t\\tz++;\\n\\t\\tE e1;\\n\\t\\tif(qs.size()==0 && pqw.size()>0){\\n\\t\\t\\te1=pqw.top();\\n\\t\\t\\tpqw.pop();\\n\\t\\t\\taddo=true;\\n\\t\\t}else if(pqw.size()==0 && qs.size()>0){\\n\\t\\t\\te1=qs.front();\\n\\t\\t\\tqs.pop();\\n\\t\\t\\tif(qs.size()>0){\\n\\t\\t\\t\\tE e2=qs.front();\\n\\t\\t\\t\\tqs.front().nt=e1.t;\\n\\t\\t\\t\\tqs.front().t=e1.t+ds[e2.no][e2.s];\\n\\t\\t\\t}\\n\\t\\t\\taddo=false;\\n\\t\\t}else{\\n\\t\\t\\tE eq=qs.front();\\n\\t\\t\\tE ep=pqw.top();\\n\\t\\t\\t\\n\\t\\t\\tif(eq.t<=ep.t){\\n\\t\\t\\t\\te1=qs.front();\\n\\t\\t\\t\\tqs.pop();\\n\\t\\t\\t\\tif(qs.size()>0){\\n\\t\\t\\t\\t\\tE e2=qs.front();\\n\\t\\t\\t\\t\\tqs.front().nt=e1.t;\\n\\t\\t\\t\\t\\tqs.front().t=e1.t+ds[e2.no][e2.s];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\taddo=false;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\te1=pqw.top();\\n\\t\\t\\t\\tpqw.pop();\\n\\t\\t\\t\\taddo=true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//cout<<e1.no<<\\\" \\\"<<e1.t<<\\\" \\\"<<t<<\\\" \\\"<<e1.ot<<\\\" \\\"<<ds[e1.no][e1.s]<<\\\" \\\"<<addo<<\\\" \\\"<<ans;\\n\\t\\t//if(qs.size()>0){\\n\\t\\t//\\tcout<<\\\" \\\"<<qs.front().t;\\n\\t\\t//}\\n\\t\\t//cout<<endl;\\n\\t\\tif(addo==false){\\n\\t\\t\\tans+=min(m,e1.nt)-e1.ot;\\n\\t\\t}\\n\\t\\t\\n\\t\\tif(e1.t>=m){\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tt=e1.t;\\n\\t\\t\\n\\t\\te1.s=(e1.s+1)%ss[e1.no];\\n\\t\\tif(addo==true){\\n\\t\\t\\te1.ot=t;\\n\\t\\t\\tif(qs.size()==0){\\n\\t\\t\\t\\te1.t=t+ds[e1.no][e1.s];\\n\\t\\t\\t\\te1.nt=e1.ot;\\n\\t\\t\\t}\\n\\t\\t\\tqs.push(e1);\\n\\t\\t}else{\\n\\t\\t\\t\\n\\t\\t\\te1.t=t+ds[e1.no][e1.s];\\n\\t\\t\\tpqw.push(e1);\\n\\t\\t}\\n\\t\\n\\t}\\n\\tcout<<ans<<endl;\\n}\\n\\nint main() {\\n\\twhile(true){\\n\\t\\tint n,m;\\n\\t\\tcin>>n>>m;\\n\\t\\tif(n==0 && m==0)break;\\n\\t\\tf(n,m);\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3168,\n \"score_of_the_acc\": -0.467,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1219_3807639\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <string>\\n#include <numeric>\\n\\n#define REP(i, a, b) for (int i = int(a); i < int(b); i++)\\nusing namespace std;\\ntypedef long long int ll;\\n\\n// clang-format off\\n#ifdef _DEBUG_\\n#define dump(...) do{ cerr << __LINE__ << \\\":\\\\t\\\" << #__VA_ARGS__ << \\\" = \\\"; PPPPP(__VA_ARGS__); cerr << endl; } while(false)\\ntemplate<typename T> void PPPPP(T t) { cerr << t; }\\ntemplate<typename T, typename... S> void PPPPP(T t, S... s) { cerr << t << \\\", \\\"; PPPPP(s...); }\\n#else\\n#define dump(...)\\n#endif\\ntemplate<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }\\ntemplate<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }\\ntemplate<typename T>\\nbool chmin(T &a, T b) { if (a > b) {a = b; return true; } return false;}\\ntemplate<typename T>\\nbool chmax(T &a, T b) { if (a < b) {a = b; return true; } return false;}\\n// clang-format on\\n\\n#include <utility>\\nusing Bat = pair<int, int>;\\n#include <queue>\\n\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int n, t;\\n while (cin >> n >> t, n + t) {\\n vector<vector<Bat>> v(n);\\n REP(i, 0, n) {\\n for (;;) {\\n int a, b;\\n cin >> a;\\n if (a == 0) break;\\n cin >> b;\\n v[i].emplace_back(a, b);\\n }\\n }\\n queue<int> q;\\n vector<int> cur(n), pat(n, 0);\\n REP(i, 0, n) {\\n cur[i] = v[i][0].first;\\n }\\n ll ans = 0;\\n int rem = 0, irem = -1;\\n REP(T, 0, t) {\\n REP(i, 0, n) {\\n if (cur[i] == -1) continue;\\n if (cur[i]-- == 0) {\\n q.emplace(i);\\n }\\n }\\n if (irem == -1 && q.size()) {\\n irem = q.front();\\n rem = v[irem][pat[irem]].second;\\n q.pop();\\n }\\n if (irem != -1 && --rem == 0) {\\n pat[irem] = (pat[irem] + 1) % v[irem].size();\\n cur[irem] = v[irem][pat[irem]].first;\\n irem = -1;\\n rem = -1;\\n }\\n ans += q.size();\\n /*\\n REP(i, 0, n) {\\n cout << cur[i] << \\\" \\\";\\n }\\n cout << q.size() << endl;\\n */\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3164,\n \"score_of_the_acc\": -0.5461,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1219_3807450\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ull = unsigned long long;\\n\\nconstexpr long double EPS = 1e-15;\\nconst long double PI = acos(-1);\\nconstexpr int inf = 2e9;\\nconstexpr ll INF = 2e18;\\nconstexpr ll MOD = 1e9+7;\\nconstexpr ll MOD1 = 998244353;\\ntypedef pair<ll,ll> P;\\n\\n//#define all(v) (v).begin(), (v).end()\\n#define rep(i,a,b) for (int i = (a); i < (b); i++)\\n#define REP(i,n) rep(i,0,n)\\n#define sz(s) (s).size()\\n#define pb push_back\\n#define fi first\\n#define se second\\n//#define mp make_pair\\n\\nbool pattern[110][10100];\\nint pos[110];\\nint n,m;\\n\\nvoid solve() {\\nwhile (cin >> n >> m) {\\n if (n == 0 && m == 0) break;\\n \\n for (int i = 0; i < n; i++) {\\n pos[i] = 0;\\n vector<int> v;\\n int k;\\n while (cin >> k, k) {\\n v.pb(k);\\n }\\n int p = 0;\\n bool status = 0;\\n int vv = 0;\\n while (p <= 10090) {\\n int kk = v[vv];\\n REP(j,kk) {\\n if (p + 1 >= 10100) break;\\n pattern[i][p++] = status;\\n }\\n vv = (vv + 1) % sz(v);\\n status = !status;\\n }\\n }\\n\\n ll ans = 0;\\n bool inque[110] = {};\\n queue<int> que;\\n for (int i = 0; i < m; i++) {\\n for (int j = 0; j < n; j++) {\\n if (!pattern[j][pos[j]]) pos[j]++;\\n else {\\n if (!inque[j]) {\\n que.push(j);\\n inque[j] = 1;\\n }\\n }\\n }\\n if (!que.empty()) {\\n pos[que.front()]++;\\n ans += que.size() - 1;\\n if (pattern[que.front()][pos[que.front()]] == 0) {\\n inque[que.front()] = 0;\\n que.pop();\\n }\\n }\\n // REP(j,n) {\\n // cout << pos[j] << \\\" \\\";\\n // }\\n // cout << endl;\\n }\\n cout << ans << endl;\\n}\\n}\\n\\n\\nint main(int argc, char *argv[]){\\n\\n // /* Regular */\\n // int case_num = 1;\\n // if (argc > 1 && stoi(argv[1])) cin >> case_num;\\n // REP(case_no, case_num) {\\n // cerr << endl << \\\"case \\\" << case_no + 1 << endl;\\n // solve();\\n // }\\n\\n /* AOJ */\\n solve();\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 4036,\n \"score_of_the_acc\": -0.8207,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1219_2589731\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <set>\\n#include <map>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\nstruct Info{\\n\\tint cicle[51],cicile_index,cicle_num,wait_time,tmp_time;\\n\\tbool is_queue;\\n};\\n\\nint N,Time_Limit;\\nInfo info[100];\\n\\nvoid func(){\\n\\n\\tint tmp;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tinfo[i].cicile_index = 0;\\n\\t\\tinfo[i].wait_time = 0;\\n\\t\\tinfo[i].tmp_time = 0;\\n\\t\\tinfo[i].is_queue = false;\\n\\n\\t\\tfor(int k = 0; ;k++){\\n\\t\\t\\tscanf(\\\"%d\\\",&tmp);\\n\\t\\t\\tif(tmp != 0){\\n\\t\\t\\t\\tinfo[i].cicle[k] = tmp;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tinfo[i].cicle_num = k;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tqueue<int> Q;\\n\\tbool Finished;\\n\\n\\tfor(int time = 0; time < Time_Limit; time++){\\n\\t\\tFinished = false;\\n\\t\\tfor(int i = 0; i < N; i++){\\n\\t\\t\\tif(info[i].is_queue == false){\\n\\t\\t\\t\\tinfo[i].tmp_time++;\\n\\t\\t\\t\\tif(info[i].tmp_time == info[i].cicle[info[i].cicile_index]){\\n\\t\\t\\t\\t\\tinfo[i].tmp_time = 0;\\n\\t\\t\\t\\t\\tinfo[i].cicile_index++;\\n\\t\\t\\t\\t\\tQ.push(i);\\n\\t\\t\\t\\t\\tinfo[i].is_queue = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tif(i == Q.front()){\\n\\t\\t\\t\\t\\tinfo[i].tmp_time++;\\n\\t\\t\\t\\t\\tif(info[i].tmp_time == info[i].cicle[info[i].cicile_index]){\\n\\t\\t\\t\\t\\t\\tinfo[i].tmp_time = 0;\\n\\t\\t\\t\\t\\t\\tif(info[i].cicile_index == info[i].cicle_num-1){\\n\\t\\t\\t\\t\\t\\t\\tinfo[i].cicile_index = 0;\\n\\t\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\t\\tinfo[i].cicile_index++;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tinfo[i].is_queue = false;\\n\\t\\t\\t\\t\\t\\tFinished = true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\tinfo[i].wait_time++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(Finished)Q.pop();\\n\\t}\\n\\n\\tint ans = 0;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tans += info[i].wait_time;\\n\\t}\\n\\n\\tprintf(\\\"%d\\\\n\\\",ans);\\n}\\n\\nint main(){\\n\\n\\twhile(true){\\n\\t\\tscanf(\\\"%d %d\\\",&N,&Time_Limit);\\n\\t\\tif(N == 0 && Time_Limit == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3236,\n \"score_of_the_acc\": -0.5621,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1219_2309658\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define F first\\n#define S second\\ntypedef pair<int,int> P;\\n \\nint main() {\\n int n,t;\\n while(cin>>n>>t&&n) {\\n vector<P> v[n];\\n int c[n],d=0;\\n memset(c,0,sizeof(c));\\n priority_queue<P,vector<P>,greater<P> > que;\\n for(int i=0; i<n; i++) {\\n int x,y;\\n while(cin>>x&&x) {\\n cin>>y;\\n v[i].push_back(P(x,y));\\n }\\n if(v[i].size()) que.push(P(v[i][0].F,i));\\n }\\n int ans=0;\\n for(int i=0; i<t; i++) {\\n if(que.top().F<=i&&!d) {\\n P p=que.top();que.pop();\\n ans+=max(0,i-p.F);\\n int k=p.S;\\n d+=v[k][c[k]].S;\\n c[k]=(c[k]+1)%v[k].size();\\n que.push(P(i+v[k][c[k]].F+d,k));\\n }\\n if(d) d--;\\n }\\n while(!que.empty()) {\\n P p=que.top();que.pop();\\n ans+=max(0,t-p.F);\\n }\\n cout<<ans<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3124,\n \"score_of_the_acc\": -0.4571,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1219_2134138\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\nusing ld = long double;\\nconst ld eps = 1e-9;\\n\\n//// < \\\"d:\\\\d_download\\\\visual studio 2015\\\\projects\\\\programing_contest_c++\\\\debug\\\\a.txt\\\" > \\\"d:\\\\d_download\\\\visual studio 2015\\\\projects\\\\programing_contest_c++\\\\debug\\\\b.txt\\\"\\n\\n\\nint main() {\\n\\twhile (1) {\\n\\t\\tint N, T; cin >> N >> T;\\n\\t\\tif (!N)break;\\n\\t\\tint num = 0;\\n\\t\\tvector<int>v;\\n\\t\\tvector<vector<int>>guards(N);\\n\\t\\twhile (num < N) {\\n\\t\\t\\tint a; cin >> a;\\n\\t\\t\\tif (a != 0) {\\n\\t\\t\\t\\tguards[num].push_back(a);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tnum++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvector<pair<int, int>>status(N,make_pair(0,0));\\n\\t\\tdeque<int>que;\\n\\t\\tint ans = 0;\\n\\t\\tfor (int t = 0; t < T; ++t) {\\n\\t\\t\\tint nbat = -1;\\n\\t\\t\\tif (!que.empty()) {\\n\\t\\t\\t\\tans += que.size() - 1;\\n\\t\\t\\t\\tnbat = que.front();\\n\\t\\t\\t}\\n\\t\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tbool nowbat = status[i].first % 2;\\n\\t\\t\\t\\tif (nowbat) {\\n\\t\\t\\t\\t\\tif (i ==nbat) {\\n\\t\\t\\t\\t\\t\\tstatus[i].second++;\\n\\t\\t\\t\\t\\t\\tif (status[i].second == guards[i][status[i].first]) {\\n\\t\\t\\t\\t\\t\\t\\tstatus[i].second = 0;\\n\\t\\t\\t\\t\\t\\t\\tstatus[i].first = (status[i].first + 1) % guards[i].size();\\n\\t\\t\\t\\t\\t\\t\\tque.pop_front();\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tstatus[i].second++;\\n\\t\\t\\t\\t\\tif (status[i].second == guards[i][status[i].first]) {\\n\\t\\t\\t\\t\\t\\tstatus[i].second = 0;\\n\\t\\t\\t\\t\\t\\tstatus[i].first = (status[i].first+1) % guards[i].size();\\n\\t\\t\\t\\t\\t\\tque.push_back(i);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << ans << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3184,\n \"score_of_the_acc\": -0.5505,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1219_1964425\",\n \"code_snippet\": \"#include <vector>\\n#include <list>\\n#include <map>\\n#include <set>\\n#include <queue>\\n#include <deque>\\n#include <stack>\\n#include <algorithm>\\n#include <functional>\\n#include <numeric>\\n#include <utility>\\n#include <sstream>\\n#include <iostream>\\n#include <iomanip>\\n#include <cstdio>\\n#include <cmath>\\n#include <cstdlib>\\n#include <cctype>\\n#include <string>\\n#include <cstring>\\nusing namespace std;\\n#define REP(i,n) for(int i = 0; i < (int)n; i++)\\n#define FOR(i,a,b) for(int i = a; i < (int)b; i++)\\n#define pb push_back\\n#define mp make_pair\\ntypedef vector<int> vi;\\ntypedef pair<int, int> pi;\\ntypedef long long ll;\\nconst int INF = 1<<28;\\nconst ll MOD = 1000000007;\\nconst int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};\\n\\nstruct guard {\\n\\tvector<bool> cycle;\\n\\tint cnt;\\n};\\n\\nint main() {\\n\\tios_base::sync_with_stdio(0);\\n\\tcin.tie(0);\\n\\n\\tint g, d;\\n\\twhile(cin >> g >> d, g|d) {\\n\\t\\tvector<guard> v(g);\\n\\t\\tREP(i, g) {\\n\\t\\t\\tint in, in2 = 1;\\n\\t\\t\\twhile(cin >> in, in) {\\n\\t\\t\\t\\tREP(j, in)\\n\\t\\t\\t\\t\\tv[i].cycle.pb(in2);\\n\\t\\t\\t\\tin2 = (in2 + 1) % 2;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tqueue<int> q;\\n\\t\\tset<int> s;\\n\\t\\tREP(i, d) {\\n\\t\\t\\tREP(j, g) {\\n\\t\\t\\t\\tif(v[j].cycle[v[j].cnt % v[j].cycle.size()])\\n\\t\\t\\t\\t\\tv[j].cnt++;\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tif(!s.count(j)) {\\n\\t\\t\\t\\t\\t\\tq.push(j);\\n\\t\\t\\t\\t\\t\\ts.insert(j);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(q.size()) {\\n\\t\\t\\t\\tint top = q.front();\\n\\t\\t\\t\\tv[top].cnt++;\\n\\t\\t\\t\\tif(v[top].cycle[v[top].cnt % v[top].cycle.size()]) {\\n\\t\\t\\t\\t\\tq.pop(); s.erase(top);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tint ans = 0;\\n\\t\\tREP(i, g)\\n\\t\\t\\tans += d - v[i].cnt;\\n\\t\\tcout << ans << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 260,\n \"memory_kb\": 1388,\n \"score_of_the_acc\": -1.0696,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1219_1162858\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nint main(){\\n cin.tie(0); ios::sync_with_stdio(0);\\n int n,T;\\n while(cin >> n >> T, n){\\n vector< vector<int> > cycle(n);\\n for(int i=0;i<n;i++){\\n int tmp;\\n while(cin >> tmp, tmp)cycle[i].push_back(tmp);\\n }\\n vector<int> pos(n,0), end_time(n);\\n for(int i=0;i<n;i++){\\n end_time[i] = cycle[i][0];\\n (pos[i] += 1) %= cycle[i].size();\\n }\\n\\n queue<int> q;\\n int charge = -1, charge_id = -1;\\n int ans = 0;\\n\\n for(int t=0;t<T;t++){\\n for(int i=0;i<n;i++){\\n\\tif(t==end_time[i]){\\n\\t end_time[i] = -1;\\n\\t q.push(i);\\n\\t}\\n }\\n \\n if(charge <= t){\\n\\tif(charge_id>=0){\\n\\t end_time[charge_id] = t + cycle[charge_id][pos[charge_id]];\\n\\t (pos[charge_id] += 1) %= cycle[charge_id].size();\\n\\t charge = charge_id = -1;\\n\\t}\\n\\n\\tif(q.size()){\\n\\t int nxt = q.front(); q.pop();\\n\\t charge = t + cycle[nxt][pos[nxt]];\\n\\t (pos[nxt] += 1) %= cycle[nxt].size();\\n\\t charge_id = nxt;\\n\\t}\\n }\\n\\n ans += q.size();\\n }\\n\\t \\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1240,\n \"score_of_the_acc\": -0.0766,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1219_1159232\",\n \"code_snippet\": \"#include <string> \\n#include <algorithm> \\n#include <cfloat> \\n#include <climits> \\n#include <cmath> \\n#include <complex> \\n#include <cstdio> \\n#include <cstdlib> \\n#include <cstring> \\n#include <functional> \\n#include <iostream> \\n#include <map> \\n#include <memory> \\n#include <queue> \\n#include <set> \\n#include <sstream> \\n#include <stack> \\n#include <utility> \\n#include <vector> \\n\\n#define EACH(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)\\n#define ALL(x) (x).begin(),(x).end() \\ntypedef long long ll;\\nusing namespace std; \\nconst double eps = 1e-10;\\n\\nstruct E{\\n int id, time;\\n E(){}\\n E(int id, int time) : id(id), time(time) { }\\n};\\nbool operator<(const E &a, const E &b){\\n if(a.time == b.time) return a.id > b.id;\\n else return a.time > b.time;\\n}\\n\\nint main(){\\n for(;;){\\n int n, m;\\n cin >> n >> m;\\n if(n == 0 && m == 0) return 0;\\n vector<vector<int> > v(n);\\n for(int i = 0; i < n; ++i){\\n for(;;){\\n int t;\\n cin >> t;\\n if(t == 0) break;\\n v[i].push_back(t);\\n }\\n }\\n\\n vector<int> idx(n);\\n priority_queue<E> eve;\\n queue<int> Q;\\n\\n int res = 0;\\n for(int i = 0; i < n; ++i){\\n eve.push(E(i, v[i][0]));\\n }\\n eve.push(E(n, m));\\n int lt = 0;\\n while(!eve.empty()){\\n int ct = eve.top().time;\\n int id = eve.top().id;\\n eve.pop();\\n // cout << ct << \\\",\\\" << id << \\\",\\\" << max(0, (int)Q.size()-1) * (ct - lt) << endl;\\n res += max(0, (int)Q.size()-1) * (ct - lt);\\n if(id == n) break;\\n else if(id < 0){\\n int id = Q.front(); Q.pop();\\n idx[id] = (idx[id] + 1) % v[id].size();\\n eve.push(E(id, ct + v[id][idx[id]]));\\n if(!Q.empty()){\\n eve.push(E(-1, ct + v[Q.front()][idx[Q.front()]]));\\n }\\n }\\n else if(idx[id] % 2 == 0){\\n idx[id] = (idx[id] + 1) % v[id].size();\\n if(Q.empty()){\\n Q.push(id);\\n eve.push(E(-1, ct + v[id][idx[id]]));\\n }\\n else{\\n Q.push(id);\\n }\\n }\\n lt = ct;\\n }\\n cout << res << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1248,\n \"score_of_the_acc\": -0.0784,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1219_1081141\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#define INF 0x3f3f3f3f\\n\\n#include <iostream>\\n#include <cstdio>\\n#include <sstream>\\n#include <cmath>\\n#include <cstdlib>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <limits>\\n#include <map>\\n#include <string>\\n#include <cstring>\\n#include <set>\\n#include <deque>\\n#include <bitset>\\n#include <list>\\n#include <cctype>\\n#include <utility>\\n#include <assert.h>\\n \\nusing namespace std;\\n \\ntypedef long long ll;\\ntypedef pair <int,int> P;\\ntypedef pair <int,P> PP;\\n \\nstatic const double EPS = 1e-8;\\n\\nclass State {\\npublic:\\n int _id;\\n int _time;\\n int _occupy;\\n State(int id,int time,int occupy) : _id(id),_time(time), _occupy(occupy) {}\\n bool operator<(const State& s) const {\\n if(_time == s._time) return _id < s._id;\\n return _time < s._time;\\n }\\n bool operator>(const State& s) const {\\n if(_time == s._time) return _id > s._id;\\n return _time > s._time;\\n }\\n};\\n\\nint main(){\\n int num_of_guards;\\n int simulation_duration;\\n while(~scanf(\\\"%d %d\\\",&num_of_guards,&simulation_duration)){\\n if(num_of_guards == 0 && simulation_duration == 0) break;\\n\\n vector<int> time_table[101];\\n for(int guard_i = 0; guard_i < num_of_guards; guard_i++){\\n int consuming_duration;\\n int charging_duration;\\n while(~scanf(\\\"%d\\\",&consuming_duration)){\\n if(consuming_duration == 0) break;\\n scanf(\\\"%d\\\",&charging_duration);\\n time_table[guard_i].push_back(consuming_duration);\\n time_table[guard_i].push_back(charging_duration);\\n }\\n }\\n \\n int for_queue[101];\\n int next_process[101];\\n bool is_inque[101];\\n memset(next_process,0,sizeof(next_process));\\n memset(for_queue,0,sizeof(for_queue));\\n memset(is_inque,false,sizeof(is_inque));\\n\\n priority_queue<State,vector<State>,greater<State> > que;\\n int res = 0;\\n for(int time = 0; time < simulation_duration;time++){\\n char action[101];\\n memset(action,'-',sizeof(action));\\n for(int guard_i = 0; guard_i < num_of_guards; guard_i++){\\n if(next_process[guard_i] % 2 == 0){ // to consume\\n if(is_inque[guard_i]){\\n continue;\\n }\\n for_queue[guard_i] = time_table[guard_i][next_process[guard_i] % time_table[guard_i].size()] - 1;\\n next_process[guard_i]++;\\n action[guard_i] = '*';\\n }\\n else{ //to charge\\n if(for_queue[guard_i] > 0){\\n action[guard_i] = '*';\\n for_queue[guard_i]--;\\n continue;\\n }\\n\\n que.push(State(guard_i,time,time_table[guard_i][next_process[guard_i] % time_table[guard_i].size()]));\\n next_process[guard_i]++;\\n is_inque[guard_i] = true;\\n }\\n }\\n if(!que.empty()){\\n State s = que.top();\\n que.pop();\\n action[s._id] = '.';\\n if(s._occupy - 1 > 0){\\n que.push(State(s._id,s._time,s._occupy-1));\\n }\\n else{\\n is_inque[s._id] = false;\\n }\\n }\\n\\n res += count(action,action+num_of_guards,'-');\\n\\n // for debug\\n // printf(\\\"time:%d\\\\n\\\",time);\\n // for(int guard_i = 0; guard_i < num_of_guards; guard_i++){\\n // printf(\\\"%c\\\\n\\\",action[guard_i]);\\n // }\\n // printf(\\\"\\\\n\\\");\\n }\\n\\n printf(\\\"%d\\\\n\\\",res);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 1228,\n \"score_of_the_acc\": -0.2339,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1219_1078664\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#define INF 0x3f3f3f3f\\n\\n#include <iostream>\\n#include <cstdio>\\n#include <sstream>\\n#include <cmath>\\n#include <cstdlib>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <limits>\\n#include <map>\\n#include <string>\\n#include <cstring>\\n#include <set>\\n#include <deque>\\n#include <bitset>\\n#include <list>\\n#include <cctype>\\n#include <utility>\\n#include <assert.h>\\n \\nusing namespace std;\\n \\ntypedef long long ll;\\ntypedef pair <int,int> P;\\ntypedef pair <int,P> PP;\\n \\nstatic const double EPS = 1e-8;\\n\\nclass State {\\npublic:\\n int _id;\\n int _time;\\n int _occupy;\\n State(int id,int time,int occupy) : _id(id),_time(time), _occupy(occupy) {}\\n bool operator<(const State& s) const {\\n if(_time == s._time) return _id < s._id;\\n return _time < s._time;\\n }\\n bool operator>(const State& s) const {\\n if(_time == s._time) return _id > s._id;\\n return _time > s._time;\\n }\\n};\\n\\nint main(){\\n int num_of_guards;\\n int simulation_duration;\\n while(~scanf(\\\"%d %d\\\",&num_of_guards,&simulation_duration)){\\n if(num_of_guards == 0 && simulation_duration == 0) break;\\n\\n vector<int> time_table[101];\\n for(int guard_i = 0; guard_i < num_of_guards; guard_i++){\\n int comsuming_duration;\\n int charging_duration;\\n while(~scanf(\\\"%d\\\",&comsuming_duration)){\\n if(comsuming_duration == 0) break;\\n scanf(\\\"%d\\\",&charging_duration);\\n time_table[guard_i].push_back(comsuming_duration);\\n time_table[guard_i].push_back(charging_duration);\\n }\\n }\\n \\n int for_queue[101];\\n int next_process[101];\\n bool is_inque[101];\\n memset(next_process,0,sizeof(next_process));\\n memset(for_queue,0,sizeof(for_queue));\\n memset(is_inque,false,sizeof(is_inque));\\n\\n priority_queue<State,vector<State>,greater<State> > que;\\n int res = 0;\\n for(int time = 0; time < simulation_duration;time++){\\n char action[101];\\n memset(action,'-',sizeof(action));\\n for(int guard_i = 0; guard_i < num_of_guards; guard_i++){\\n if(next_process[guard_i] % 2 == 0){ // to consume\\n if(is_inque[guard_i]){\\n continue;\\n }\\n for_queue[guard_i] = time_table[guard_i][next_process[guard_i] % time_table[guard_i].size()] - 1;\\n next_process[guard_i]++;\\n action[guard_i] = '*';\\n }\\n else{ //to charge\\n if(for_queue[guard_i] > 0){\\n action[guard_i] = '*';\\n for_queue[guard_i]--;\\n continue;\\n }\\n\\n que.push(State(guard_i,time,time_table[guard_i][next_process[guard_i] % time_table[guard_i].size()]));\\n next_process[guard_i]++;\\n is_inque[guard_i] = true;\\n }\\n }\\n if(!que.empty()){\\n State s = que.top();\\n que.pop();\\n action[s._id] = '.';\\n if(s._occupy - 1 > 0){\\n que.push(State(s._id,s._time,s._occupy-1));\\n }\\n else{\\n is_inque[s._id] = false;\\n }\\n }\\n\\n res += count(action,action+num_of_guards,'-');\\n\\n // for debug\\n // printf(\\\"time:%d\\\\n\\\",time);\\n // for(int guard_i = 0; guard_i < num_of_guards; guard_i++){\\n // printf(\\\"%c\\\\n\\\",action[guard_i]);\\n // }\\n // printf(\\\"\\\\n\\\");\\n }\\n\\n printf(\\\"%d\\\\n\\\",res);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 1232,\n \"score_of_the_acc\": -0.2348,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1219_1030907\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<queue>\\n\\nusing namespace std;\\n\\nint main(){\\n for(int g,d;cin>>g>>d,g|d;){\\n vector<char> t[100];\\n for(int i=0;i<g;i++){\\n bool on=true;\\n for(int ti;cin>>ti,ti;){\\n\\tvector<char> v(ti,on);\\n\\tt[i].insert(end(t[i]),begin(v),end(v));\\n\\ton=!on;\\n }\\n }\\n bool inque[100]={};\\n queue<int> que;\\n int a=0;\\n int x[100]={};\\n for(int i=0;i<d;i++){\\n a+=max<int>(0,que.size()-1);\\n for(int j=0;j<g;j++){\\n\\tif(!inque[j]){\\n\\t x[j]=(x[j]+1)%t[j].size();\\n\\t}\\n }\\n if(!que.empty()){\\n\\tint id=que.front();\\n\\tx[id]=(x[id]+1)%t[id].size();\\n\\tif(t[id][x[id]]){\\n\\t que.pop();\\n\\t inque[id]=false;\\n\\t}\\n }\\n for(int j=0;j<g;j++){\\n\\tif(!inque[j]&&!t[j][x[j]]){\\n\\t que.push(j);\\n\\t inque[j]=true;\\n\\t}\\n }\\n }\\n cout<<a<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 2572,\n \"score_of_the_acc\": -1.0939,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1219_991398\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n\\nusing namespace std;\\n\\ntypedef pair<int,int> ii;\\n\\nstruct Data{\\n int id,stamp;\\n bool operator < ( const Data& data ) const {\\n if( stamp != data.stamp ) return stamp > data.stamp;\\n return id > data.id;\\n }\\n};\\n\\nvector<ii> cycle[110];\\nint n,m,run_time[110],indices[110],charger,charge_id;\\nbool inQueue[110];\\n\\nint simulate(){\\n\\n rep(i,n) run_time[i] = cycle[i][0].first, indices[i] = 0, inQueue[i] = false;\\n charger = 0, charge_id = -1;\\n priority_queue<Data> Q;\\n int ret = 0;\\n rep(_,m){\\n\\n rep(i,n) {\\n if( run_time[i] <= 0 && !inQueue[i] ) {\\n Q.push((Data){i,_});\\n inQueue[i] = true;\\n }\\n run_time[i]--;\\n }\\n\\n if( charger == 0 && !Q.empty() ) {\\n charge_id = Q.top().id; Q.pop();\\n charger = cycle[charge_id][indices[charge_id]].second;\\n } \\n\\n if( charger ) {\\n --charger;\\n if( charger <= 0 ) {\\n inQueue[charge_id] = false;\\n ( indices[charge_id] += 1 ) %= (int)cycle[charge_id].size();\\n run_time[charge_id] = cycle[charge_id][indices[charge_id]].first;\\n }\\n } \\n\\n ret += (int)Q.size();\\n\\n }\\n\\n return ret;\\n}\\n\\nint main(){\\n while( cin >> n >> m, n | m ){\\n rep(i,n) {\\n int a,b;\\n cycle[i].clear();\\n while( cin >> a , a ){\\n cin >> b;\\n cycle[i].push_back(ii(a,b));\\n }\\n }\\n\\n cout << simulate() << endl;\\n\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 1252,\n \"score_of_the_acc\": -0.1193,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1219_991396\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n\\nusing namespace std;\\n\\ntypedef pair<int,int> ii;\\n\\nstruct Data{\\n int id,stamp;\\n bool operator < ( const Data& data ) const {\\n if( stamp != data.stamp ) return stamp > data.stamp;\\n return id > data.id;\\n }\\n};\\n\\nvector<ii> cycle[110];\\nint n,m,run_time[110],indices[110],charger,charge_id;\\nbool inQueue[110];\\n\\n//char debug[110][1000000];\\n\\nint simulate(){\\n\\n //rep(i,110) rep(j,1000000) debug[i][j] = '?';\\n\\n rep(i,n) run_time[i] = cycle[i][0].first, indices[i] = 0, inQueue[i] = false;\\n charger = 0, charge_id = -1;\\n priority_queue<Data> Q;\\n int ret = 0;\\n rep(_,m){\\n\\n rep(i,n) {\\n if( run_time[i] <= 0 && !inQueue[i] ) {\\n Q.push((Data){i,_});\\n inQueue[i] = true;\\n }\\n run_time[i]--;\\n }\\n\\n if( charger == 0 && !Q.empty() ) {\\n charge_id = Q.top().id; Q.pop();\\n charger = cycle[charge_id][indices[charge_id]].second;\\n } \\n\\n if( charger ) {\\n --charger;\\n if( charger <= 0 ) {\\n inQueue[charge_id] = false;\\n ( indices[charge_id] += 1 ) %= (int)cycle[charge_id].size();\\n run_time[charge_id] = cycle[charge_id][indices[charge_id]].first;\\n charge_id = -1;\\n }\\n } \\n\\n /*\\n rep(i,n) if( inQueue[i] ) {\\n debug[i][_] = '-';\\n if( i == charge_id ) debug[i][_] = '.';\\n } else debug[i][_] = '*';\\n */\\n\\n ret += (int)Q.size();\\n\\n }\\n /*\\n rep(i,n){\\n rep(j,m){\\n cout << debug[i][j];\\n }\\n cout << endl;\\n }\\n */\\n\\n return ret;\\n}\\n\\nint main(){\\n while( cin >> n >> m, n | m ){\\n rep(i,n) {\\n int a,b;\\n cycle[i].clear();\\n while( cin >> a , a ){\\n cin >> b;\\n cycle[i].push_back(ii(a,b));\\n }\\n }\\n\\n cout << simulate() << endl;\\n\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 1252,\n \"score_of_the_acc\": -0.1193,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1219_902277\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <string>\\n#include <sstream>\\n#include <cstring>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cmath>\\n#include <queue>\\n#include <stack>\\n#include <map>\\n#include <set>\\n#include <numeric>\\n#include <cctype>\\n#include <tuple>\\n\\n#ifdef _MSC_VER\\n#include <agents.h>\\n#endif\\n\\n#define FOR(i, a, b) for(int i = (a); i < (int)(b); ++i)\\n#define rep(i, n) FOR(i, 0, n)\\n#define ALL(v) v.begin(), v.end()\\n#define REV(v) v.rbegin(), v.rend()\\n#define MEMSET(v, s) memset(v, s, sizeof(v))\\n#define X first\\n#define Y second\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef pair<int, int> P;\\n\\nint sch[110][10100];\\nint inq[110];\\n\\nint main(){\\n\\tint n, t;\\n\\twhile (cin >> n >> t, n | t){\\n\\t\\tMEMSET(sch, 0);\\n\\t\\tvector<int> cur(n), len(n);\\n\\t\\trep(i, n){\\n\\t\\t\\tint x;\\n\\t\\t\\tint y = 0;\\n\\t\\t\\twhile (cin >> x, x){\\n\\t\\t\\t\\tfor (int j = len[i]; j < len[i] + x; ++j){\\n\\t\\t\\t\\t\\tsch[i][j] = y;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tlen[i] += x;\\n\\t\\t\\t\\ty ^= 1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//rep(i, n){\\n\\t\\t//\\trep(j, t){\\n\\t\\t//\\t\\tcout << (sch[i][j%len[i]] ? \\\".\\\" : \\\"*\\\");\\n\\t\\t//\\t}\\n\\t\\t//\\tcout << endl;\\n\\t\\t//}\\n\\n\\t\\tqueue<int> q;\\n\\t\\tMEMSET(inq, 0);\\n\\t\\tint ans = 0;\\n\\t\\trep(i, t){\\n\\t\\t\\trep(j, n){\\n\\t\\t\\t\\tif (inq[j]) continue;\\n\\t\\t\\t\\tif (sch[j][cur[j] % len[j]]){\\n\\t\\t\\t\\t\\tq.push(j);\\n\\t\\t\\t\\t\\tinq[j] = 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\t++cur[j];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (q.empty()) continue;\\n\\t\\t\\tans += q.size() - 1;\\n\\t\\t\\tint use = q.front();\\n\\t\\t\\t++cur[use];\\n\\t\\t\\tif (!sch[use][cur[use] % len[use]]){\\n\\t\\t\\t\\tq.pop();\\n\\t\\t\\t\\tinq[use] = 0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << ans << endl;\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 5556,\n \"score_of_the_acc\": -1.36,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1219_846037\",\n \"code_snippet\": \"#include <iostream>\\n#include <complex>\\n#include <sstream>\\n#include <string>\\n#include <algorithm>\\n#include <deque>\\n#include <list>\\n#include <map>\\n#include <numeric>\\n#include <queue>\\n#include <vector>\\n#include <set>\\n#include <limits>\\n#include <cstdio>\\n#include <cctype>\\n#include <cmath>\\n#include <cstdlib>\\n#include <ctime>\\nusing namespace std;\\n#define REP(i, j) for(int i = 0; i < j; ++i)\\n#define FOR(i, j, k) for(int i = j; i < k; ++i)\\n#define P pair<int, int>\\n\\nclass C{\\n public:\\n int now, cnt, num, stay_num;\\n vector<int> v;\\n C(){ now = 0; cnt = 0; stay_num = 0; }\\n};\\n\\nint main() {\\n int n, time;\\n while(cin >>n >>time && n){\\n vector<C> v(n);\\n REP(i, n){\\n int tmp;\\n while(cin >>tmp && tmp) v[i].v.push_back(tmp);\\n v[i].num = i;\\n }\\n\\n int ans = 0, next = 0, last = 0;\\n REP(t, time){\\n bool stay_end = false;\\n REP(i, n){\\n //稼働中\\n if(v[i].now % 2 == 0){\\n v[i].cnt += 1;\\n if(v[i].cnt >= v[i].v[ v[i].now ]){\\n v[i].cnt = 0;\\n v[i].now = (v[i].now + 1 >= v[i].v.size() ? 0 : v[i].now + 1);\\n v[i].stay_num = last;\\n last += 1;\\n }\\n }\\n //待ち番号 == next\\n else if(v[i].stay_num == next){\\n v[i].cnt += 1;\\n if(v[i].cnt >= v[i].v[ v[i].now ]){\\n v[i].cnt = 0;\\n v[i].now = (v[i].now + 1 >= v[i].v.size() ? 0 : v[i].now + 1);\\n stay_end = true;\\n }\\n }\\n //待ち番号 > next\\n else{\\n ans += 1;\\n }\\n }\\n if(stay_end) next += 1;\\n }\\n cout <<ans <<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 1240,\n \"score_of_the_acc\": -0.1966,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1219_605262\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n#include <string>\\n#include <algorithm>\\n#include <vector>\\n#include <stack>\\n#include <queue>\\n#include <set>\\n#include <map>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <cmath>\\n#include <cassert>\\n\\nusing namespace std;\\n\\n#define FOR(i,k,n) for(int i=(k); i<(int)(n); ++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\\n\\ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cerr<<*i<<\\\" \\\"; cerr<<endl; }\\ninline bool valid(int x, int y, int W, int H){ return (x >= 0 && y >= 0 && x < W && y < H); }\\n\\ntypedef long long ll;\\nconst int INF = 100000000;\\nconst double EPS = 1e-8;\\nconst int MOD = 1000000007;\\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\\n\\nint main(){\\n int N, T;\\n while(cin >> N >> T && N){\\n vector<int> v[100];\\n REP(i, N){\\n int t; \\n while(cin >> t && t) v[i].push_back(t);\\n }\\n vector<int> cur(N);\\n vector<int> rest(N);\\n REP(i, N) rest[i] = v[i][0];\\n int now_use = -1;\\n queue<int> que;\\n int ans = 0;\\n REP(t, T){\\n if(now_use == -1 && !que.empty()){\\n now_use = que.front();\\n que.pop();\\n }\\n ans += que.size();\\n REP(i, N){\\n if(now_use == i || cur[i] % 2 == 0){\\n rest[i]--;\\n if(rest[i] == 0){\\n cur[i] = (cur[i] + 1) % v[i].size();\\n rest[i] = v[i][cur[i]];\\n if(now_use == i) now_use = -1;\\n if(cur[i] % 2 == 1){\\n que.push(i);\\n }\\n }\\n }\\n }\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 1240,\n \"score_of_the_acc\": -0.1566,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1219_556949\",\n \"code_snippet\": \"#include<queue>\\n#include<cstdio>\\n\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n\\nusing namespace std;\\n\\nint main(){\\n\\tfor(int n,T;scanf(\\\"%d%d\\\",&n,&T),n;){\\n\\t\\tvector<int> pttn[100];\\n\\t\\trep(i,n){\\n\\t\\t\\twhile(1){\\n\\t\\t\\t\\tint t; scanf(\\\"%d\\\",&t);\\n\\t\\t\\t\\tif(t==0) break;\\n\\t\\t\\t\\tpttn[i].push_back(t);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tint ans=0;\\n\\t\\tint idx[100]={},cons[100]={},charge=-1;\\n\\t\\tqueue<int> wait;\\n\\t\\twhile(T--){\\n\\t\\t\\tif(charge==-1 && !wait.empty()){\\n\\t\\t\\t\\tcharge=wait.front();\\n\\t\\t\\t\\twait.pop();\\n\\t\\t\\t}\\n\\n\\t\\t\\trep(i,n){\\n\\t\\t\\t\\tif(idx[i]%2==0 || i==charge){\\n\\t\\t\\t\\t\\tcons[i]++;\\n\\t\\t\\t\\t\\tif(cons[i]==pttn[i][idx[i]]){ // 充電したくなる or 充電が終わる\\n\\t\\t\\t\\t\\t\\tif(idx[i]%2==0) wait.push(i);\\n\\t\\t\\t\\t\\t\\telse charge=-1;\\n\\t\\t\\t\\t\\t\\tidx[i]=(idx[i]+1)%pttn[i].size();\\n\\t\\t\\t\\t\\t\\tcons[i]=0;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse{ // 充電器が空くのを待つ\\n\\t\\t\\t\\t\\tans++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tprintf(\\\"%d\\\\n\\\",ans);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 1076,\n \"score_of_the_acc\": -0.2,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1219_540803\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <vector>\\n#include <queue>\\nusing namespace std;\\n\\nconst int MAXN = 101;\\nconst int MAXM = 10080;\\nint N, M;\\nvector<int> T[MAXN];\\n\\nint main() {\\n while(cin >> N >> M && (N|M)) {\\n for(int i = 0; i < MAXN; ++i) T[i].clear();\\n for(int i = 0; i < N; ++i) {\\n int a;\\n while(cin >> a && a) {\\n\\tT[i].push_back(a);\\n }\\n }\\n queue<int> que;\\n int ju_den = -1;\\n int p[MAXN];\\n int t[MAXN];\\n fill(p,p+MAXN, 0);\\n for(int j = 0; j < N; ++j) t[j] = T[j][0];\\n int ans = 0;\\n for(int i = 0; i < M; ++i) {\\n for(int j = 0; j < N; ++j) {\\n\\tif(p[j]%2 == 0) {\\n\\t --t[j];\\n\\t if(t[j] == 0) {\\n\\t p[j] = (p[j]+1)%T[j].size();\\n\\t t[j] = T[j][p[j]];\\n\\t que.push(j);\\n\\t }\\n\\t} else {\\n\\t if(ju_den == j) {\\n\\t --t[j];\\n\\t if(t[j] == 0) {\\n\\t p[j] = (p[j]+1)%T[j].size();\\n\\t t[j] = T[j][p[j]];\\n\\t ju_den = -1;\\n\\t }\\n\\t } else {\\n\\t ++ans;\\n\\t }\\n\\t}\\n }\\n if(que.size() && ju_den == -1) {\\n\\tju_den = que.front();\\n\\tque.pop();\\n }\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 1248,\n \"score_of_the_acc\": -0.1584,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1219_539025\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <vector>\\n#include <queue>\\n \\nusing namespace std;\\n\\nconst int N = 100;\\nint n, m;\\nvector<int> data[N];\\n \\nint main(){\\n while(cin >> n >> m && (n|m)){\\n for(int i=0;i<n;i++){\\n data[i].clear();\\n while(1){\\n int in;\\n cin >> in;\\n if(in == 0) break;\\n data[i].push_back(in);\\n }\\n }\\n int ans = 0, rem[N], idx[N];\\n priority_queue<pair<int, int> > q;\\n bool flag[N];\\n for(int i=0;i<n;i++) rem[i] = data[i][0];\\n fill(idx, idx+n, 0);\\n fill(flag, flag+n, false);\\n for(int k=0;k<m;k++){\\n pair<int, int> tmp = make_pair(1, 1);\\n if(q.size()){ tmp = q.top(); q.pop(); }\\n for(int i=0;i<n;i++){\\n if(!flag[i]){\\n rem[i]--;\\n if(rem[i] == 0){\\n idx[i] = (idx[i] + 1) % data[i].size();\\n rem[i] = data[i][idx[i]];\\n flag[i] = true;\\n q.push(make_pair(-k, -i));\\n }\\n }else{\\n if(-tmp.second == i){\\n rem[i]--;\\n if(rem[i] == 0){\\n idx[i] = (idx[i] + 1) % data[i].size();\\n rem[i] = data[i][idx[i]];\\n flag[i] = false;\\n }else q.push(tmp);\\n }else ans++;\\n }\\n }\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 1248,\n \"score_of_the_acc\": -0.1584,\n \"final_rank\": 6\n }\n]","isConversational":false}}},{"rowIdx":684,"cells":{"group_id":{"kind":"string","value":"aoj_1225_cpp"},"problem_description":{"kind":"string","value":"Problem B:\ne-Market\nThe city of Hakodate recently established a commodity exchange market. To participate in the market, each dealer transmits through the Internet an order consisting of his or her name, the type of the order (buy or sell), the name of the commodity, and the quoted price.\nIn this market a deal can be made only if the price of a sell order is lower than or equal to the price of a buy order. The price of the deal is the mean of the prices of the buy and sell orders, where the mean price is rounded downward to the nearest integer. To exclude dishonest deals, no deal is made between a pair of sell and buy orders from the same dealer. The system of the market maintains the list of orders for which a deal has not been made and processes a new order in the following manner.\nFor a new sell order, a deal is made with the buy order with the highest price in the list satisfying the conditions. If there is more than one buy order with the same price, the deal is made with the earliest of them.\nFor a new buy order, a deal is made with the sell order with the lowest price in the list satisfying the conditions. If there is more than one sell order with the same price, the deal is made with the earliest of them.\nThe market opens at 7:00 and closes at 22:00 everyday. When the market closes, all the remaining orders are cancelled. To keep complete record of the market, the system of the market saves all the orders it received everyday.\nThe manager of the market asked the system administrator to make a program which reports the activity of the market. The report must contain two kinds of information. For each commodity the report must contain informationon the lowest, the average and the highest prices of successful deals. For each dealer, the report must contain information on the amounts the dealer paid and received for commodities.\nInput\nThe input contains several data sets. Each data set represents the record of the market on one day. The first line of each data set contains an integer\nn\n(\nn\n< 1000) which is the number of orders in the record. Each line of the record describes an order, consisting of the name of the dealer, the type of the order, the name of the commodity, and the quoted price. They are separated by a single space character.\nThe name of a dealer consists of capital alphabetical letters and is less than 10 characters in length. The type of an order is indicated by a string, \"\nBUY\n\" or \"\nSELL\n\". The name of a commodity is a single capital letter. The quoted price is a positive integer less than 1000.\nThe orders in a record are arranged according to time when they were received and the first line of the record corresponds to the oldest order.\nThe end of the input is indicated by a line containing a zero.\nOutput\nThe output for each data set consists of two parts separated by a line containing two hyphen (`\n-\n') characters.\nThe first part is output for commodities. For each commodity, your program should output the name of the comm\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1225_1083098","code_snippet":"#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n\n#include <iostream>\n#include <cstdio>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cctype>\n#include <utility>\n#include <assert.h>\n \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <int,int> P;\ntypedef pair <int,P> PP;\n \nstatic const double EPS = 1e-8;\n\nclass Deal {\npublic:\n string _dealer_name;\n string _type;\n string _commodity_name;\n int _price;\n int _id;\n Deal(string dealer_name,string type,string commodity_name,int price,int id) \n : _dealer_name(dealer_name), _type(type), _commodity_name(commodity_name), _price(price), _id(id) {}\n};\n\nclass DealerResult {\npublic:\n int _paid;\n int _received;\n DealerResult() : _paid(0),_received(0) {}\n};\n\nclass CommodityResult {\npublic:\n int _lowest;\n int _mean;\n int _highest;\n vector<int> _purchase_history;\n void init(){\n if(_purchase_history.size() > 0){\n sort(_purchase_history.begin(),_purchase_history.end());\n _highest = *(_purchase_history.end()-1);\n _lowest = *(_purchase_history.begin());\n \n int sum = 0;\n for(int i=0;i<_purchase_history.size();i++){\n sum += _purchase_history[i];\n }\n _mean = sum / _purchase_history.size();\n }\n }\n CommodityResult() : _lowest(0), _mean(0), _highest(0) {}\n};\n\nint main(){\n int total_dealers;\n while(~scanf(\"%d\",&total_dealers)){\n if(total_dealers == 0) break;\n\n vector<Deal> deals;\n for(int dealer_i = 0; dealer_i < total_dealers; dealer_i++){\n string dealer_name,type,commodity_name;\n int price;\n cin >> dealer_name >> type >> commodity_name >> price;\n deals.push_back(Deal(dealer_name,type,commodity_name,price,dealer_i));\n }\n\n bool used[1001];\n memset(used,false,sizeof(used));\n\n map<string,CommodityResult> commodity_result;\n map<string,DealerResult> dealer_result;\n\n for(int dealer_i = 0; dealer_i < total_dealers; dealer_i++){\n dealer_result[deals[dealer_i]._dealer_name] = DealerResult();\n }\n\n for(int dealer_i = 0; dealer_i < total_dealers; dealer_i++){\n if(used[dealer_i]) continue;\n int current_sell_price = INF; // lowest\n int current_buy_price = -INF; // highest\n int target_id = -1;\n\n for(int dealer_j = 0; dealer_j < dealer_i; dealer_j++){\n if(used[dealer_j]) continue;\n if(deals[dealer_i]._type == deals[dealer_j]._type) continue;\n if(deals[dealer_i]._dealer_name == deals[dealer_j]._dealer_name) continue;\n if(deals[dealer_i]._commodity_name != deals[dealer_j]._commodity_name) continue;\n\n if(deals[dealer_i]._type == \"BUY\"){\n if(deals[dealer_j]._price <= deals[dealer_i]._price){\n if(current_sell_price > deals[dealer_j]._price){\n current_sell_price = deals[dealer_j]._price;\n target_id = dealer_j;\n }\n }\n }\n else if(deals[dealer_i]._type == \"SELL\"){\n if(deals[dealer_j]._price >= deals[dealer_i]._price){\n if(current_buy_price < deals[dealer_j]._price){\n current_buy_price = deals[dealer_j]._price;\n target_id = dealer_j;\n }\n }\n }\n }\n\n if(target_id != -1){\n if(deals[dealer_i]._type == \"BUY\"){\n dealer_result[deals[dealer_i]._dealer_name]._paid += (current_sell_price + deals[dealer_i]._price) / 2;\n dealer_result[deals[target_id]._dealer_name]._received += (current_sell_price + deals[dealer_i]._price) / 2;\n commodity_result[deals[dealer_i]._commodity_name]._purchase_history\n .push_back((current_sell_price + deals[dealer_i]._price) / 2);\n }\n\n if(deals[dealer_i]._type == \"SELL\"){\n dealer_result[deals[dealer_i]._dealer_name]._received += (current_buy_price + deals[dealer_i]._price) / 2;\n dealer_result[deals[target_id]._dealer_name]._paid += (current_buy_price + deals[dealer_i]._price) / 2;\n commodity_result[deals[dealer_i]._commodity_name]._purchase_history\n .push_back((current_buy_price + deals[dealer_i]._price) / 2);\n }\n \n used[dealer_i] = true;\n used[target_id] = true;\n }\n }\n\n for(map<string,CommodityResult>::iterator it = commodity_result.begin();\n it != commodity_result.end();\n it++){\n it->second.init();\n printf(\"%s %d %d %d\\n\",it->first.c_str(),it->second._lowest,it->second._mean,it->second._highest);\n }\n\n printf(\"--\\n\");\n for(map<string,DealerResult>::iterator it = dealer_result.begin();\n it != dealer_result.end();\n it++){\n\n printf(\"%s %d %d\\n\",it->first.c_str(),it->second._paid,it->second._received);\n }\n printf(\"----------\\n\");\n }\n}","accuracy":1,"time_ms":10,"memory_kb":1496,"score_of_the_acc":-1,"final_rank":6},{"submission_id":"aoj_1225_997494","code_snippet":"//#include <bits/stdc++.h>\n//#define _ ios_base::sync_with_stdio(0);cin.tie(0);\n#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <cmath>\n#include <cstdlib>\n#include <queue>\n#include <vector>\n#include <algorithm>\n#include <cctype>\n#include <fstream>\n#include <map>\n#include <list>\n#include <set>\n#include <string>\n#include <stack>\n#include <bitset>\n\n#define sz 50005\n#define pb(a) push_back(a)\n#define pp pop_back()\n#define ll long long\n#define fread freopen(\"input.txt\",\"r\",stdin)\n#define fwrite freopen(\"output.txt\",\"w\",stdout)\n#define inf (1e9)\n#define chng(a,b) a^=b^=a^=b;\n#define clr(abc,z) memset(abc,z,sizeof(abc))\n#define PI acos(-1)\n#define fr(i,a,b) for(i=a;i<=b;i++)\n#define print1(a) cout<<a<<endl\n#define print2(a,b) cout<<a<<\" \"<<b<<endl\n#define print3(a,b,c) cout<<a<<\" \"<<b<<\" \"<<c<<endl\n#define mod 1000000007\nusing namespace std;\n\nstruct person\n{\n char name[15];\n int buy, sell;\n person(char line[])\n {\n strcpy(name, line);\n buy=sell=0;\n }\n};\n\nstruct commodity\n{\n char name[5];\n int n, sum, mn, mx;\n commodity(char line[])\n {\n sum = n = 0;\n mn = inf;\n mx = -inf;\n strcpy(name,line );\n }\n};\n\nstruct product\n{\n char name[15];\n char prod[5];\n int price;\n int cnt;\n\n product(char line1[], char line2[], int p, int c)\n {\n strcpy(name, line1);\n strcpy(prod, line2);\n price = p;\n cnt = c;\n }\n};\n\n\nvector<person>per;\nvector<commodity>thing;\nvector<product>buys, sells;\n\nbool compbuy(const product &a, const product &b)\n{\n if(a.price==b.price) return a.cnt<b.cnt;\n return a.price>b.price;\n}\nbool compsell(const product &a, const product &b)\n{\n if(a.price==b.price) return a.cnt<b.cnt;\n return a.price<b.price;\n}\n\nbool printCompThing(const commodity &a, const commodity &b)\n{\n return strcmp(a.name,b.name)<0;\n}\n\nbool printCompPerson(const person &a, const person &b)\n{\n return strcmp(a.name,b.name)<0;\n}\n\nvoid printall()\n{\n sort(thing.begin(), thing.end(), printCompThing);\n for (int i = 0; i<thing.size(); i++)\n printf(\"%s %d %d %d\\n\", thing[i].name, thing[i].mn, thing[i].sum/thing[i].n, thing[i].mx);\n puts(\"--\");\n\n sort(per.begin(), per.end(), printCompPerson);\n for (int i = 0; i<per.size(); i++)\n printf(\"%s %d %d\\n\", per[i].name, per[i].buy, per[i].sell);\n puts(\"----------\");\n\n return;\n}\n\nvoid printBuyList()\n{\n cout<<\"Buy ---------------\"<<endl;\n for (int i = 0; i<buys.size(); i++)\n cout<<\"N: \"<<buys[i].name<<\" Prod: \"<<buys[i].prod<<\" Price: \"<<buys[i].price<<\" cnt: \"<<buys[i].cnt<<endl;\n cout<<\"-------------------\"<<endl;\n return;\n}\n\nvoid printSellList()\n{\n cout<<\"Sell---------------\"<<endl;\n for (int i = 0; i<sells.size(); i++)\n cout<<\"N: \"<<sells[i].name<<\" Prod: \"<<sells[i].prod<<\" Price: \"<<sells[i].price<<\" cnt: \"<<sells[i].cnt<<endl;\n cout<<\"-------------------\"<<endl;\n return;\n}\n\n\n\n\nint main()\n{\n#ifdef ENAM\n fread;\n fwrite;\n#endif // ENAM\n int t, n, m, cas=1, price, x,y, dealprice;\n char name[20], type[10], com[5];\n\n\n while(~scanf(\"%d\", &n)&&n)\n {\n per.clear();\n thing.clear();\n buys.clear();\n sells.clear();\n\n for (int i = 0; i<n; i++)\n {\n// printBuyList();\n// printSellList();\n scanf(\" %s %s %s %d\", name, type, com, &price);\n int j;\n for (j = 0; j<per.size(); j++)\n if(!strcmp(per[j].name, name)) break;\n\n if(j==per.size()) per.pb(person(name));\n\n// printf(\"::>> %s %s %s %d\\n\", name, type, com, price);\n\n if(!strcmp(type, \"SELL\"))\n {\n if(!buys.empty())\n {\n sort(buys.begin(), buys.end(), compbuy);\n for (j = 0; j<buys.size(); j++)\n {\n if(strcmp(buys[j].name, name) && !strcmp(com,buys[j].prod) && price<= buys[j].price)\n {\n dealprice = (price+buys[j].price)/2;\n\n int ii;\n //selling person update\n for (ii = 0; ii<per.size(); ii++ )\n if(!strcmp(per[ii].name, name)) break;\n per[ii].sell+=dealprice;\n\n //buying person update\n for (ii = 0; ii<per.size(); ii++ )\n if(!strcmp(per[ii].name, buys[j].name)) break;\n per[ii].buy+=dealprice;\n\n //commodity update\n for (ii = 0; ii<thing.size(); ii++ )\n if(!strcmp(thing[ii].name, com)) break;\n\n if(ii==thing.size()) thing.pb(commodity(com));\n\n thing[ii].n++;\n thing[ii].sum+=dealprice;\n thing[ii].mn = min(thing[ii].mn, dealprice);\n thing[ii].mx = max(thing[ii].mx, dealprice);\n\n break;\n }\n }\n\n if(j==buys.size()) sells.pb(product(name,com, price,i));\n else buys.erase(buys.begin()+j);\n }\n else sells.pb(product(name,com, price,i));\n }\n else\n {\n// printf(\":->%s %s %s %d\\n\", name, type, com, price);\n if(!sells.empty())\n {\n sort(sells.begin(), sells.end(), compsell);\n int j;\n for (j = 0; j<sells.size(); j++)\n {\n if(strcmp(sells[j].name, name) && !strcmp(com,sells[j].prod) && sells[j].price <= price)\n {\n dealprice = (price+sells[j].price)/2;\n\n int ii;\n //buying person update\n for (ii = 0; ii<per.size(); ii++ )\n if(!strcmp(per[ii].name, name)) break;\n per[ii].buy+=dealprice;\n\n //selling person update\n for (ii = 0; ii<per.size(); ii++ )\n if(!strcmp(per[ii].name, sells[j].name)) break;\n per[ii].sell+=dealprice;\n\n //commodity update\n for (ii = 0; ii<thing.size(); ii++ )\n if(!strcmp(thing[ii].name, com)) break;\n\n if(ii==thing.size()) thing.pb(commodity(com));\n\n thing[ii].n++;\n thing[ii].sum+=dealprice;\n thing[ii].mn = min(thing[ii].mn, dealprice);\n thing[ii].mx = max(thing[ii].mx, dealprice);\n\n break;\n }\n }\n\n if(j==sells.size()) buys.pb(product(name,com, price,i));\n else sells.erase(sells.begin()+j);\n }\n else buys.pb(product(name,com, price,i));\n }\n }\n printall();\n }\n return 0;\n}\n\n/*\n3\nPERLIS SELL A 300\nMILKES BUY A 200\nHAMMING SELL A 100\n4\nBACKUS SELL A 10\nFLOYD BUY A 20\nIVERSON SELL B 30\nBACKUS BUY B 40\n7\nMILKINSON SELL A 500\nMCCARTHY BUY C 300\nMILKINSON SELL C 200\nDIJKSTRA SELL B 100\nBACHMAN BUY A 400\nDIJKSTRA BUY A 600\nMILKINSON SELL A 300\n2\nABCD SELL X 10\nABC BUY X 15\n2\nA SELL M 100\nA BUY M 100\n0\n*/","accuracy":1,"time_ms":10,"memory_kb":1256,"score_of_the_acc":-0.8396,"final_rank":3},{"submission_id":"aoj_1225_955139","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <string>\n#include <vector>\n#include <tuple>\n#include <map>\n\nusing namespace std;\n\nint main(){\n\tint n;\n\twhile (cin >> n, n){\n\t\tvector<tuple<string, char, string, int>> v(n);\n\t\tvector<int> used(n);\n\n\t\tmap<string, pair<int, int>> comm_minmax;\n\t\tmap<string, pair<int, int>> comm_sumcnt;\n\t\tmap<string, pair<int, int>> dealer;\n\n\t\tfor (int i = 0; i < n; ++i){\n\t\t\tstring a, b, c;\n\t\t\tint x;\n\t\t\tcin >> a >> b >> c >> x;\n\t\t\tv[i] = make_tuple(a, b[0], c, x);\n\t\t\tdealer[a];\n\t\t\tint idx = -1, opt = x;\n\t\t\tbool buy = b[0] == 'B';\n\t\t\tfor (int j = 0; j < i; ++j){\n\t\t\t\tif (used[j]) continue;\n\t\t\t\tif (a != get<0>(v[j]) && b[0] != get<1>(v[j]) && c == get<2>(v[j])){\n\t\t\t\t\tint y = get<3>(v[j]);\n\t\t\t\t\tif (buy && y <= opt){\n\t\t\t\t\t\topt = y - 1, idx = j;\n\t\t\t\t\t}\n\t\t\t\t\tif (!buy && y >= opt){\n\t\t\t\t\t\topt = y + 1, idx = j;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (idx < 0) continue;\n\t\t\tused[i] = used[idx] = 1;\n\t\t\tstring buyer = a, seller = get<0>(v[idx]);\n\t\t\tif (!buy) swap(buyer, seller);\n\n\t\t\tif (buyer == seller) continue;\n\t\t\tauto &c1 = comm_minmax[c], &c2 = comm_sumcnt[c], &db = dealer[buyer], &ds = dealer[seller];\n\t\t\tint val = (x + get<3>(v[idx])) / 2;\n\t\t\tc1.first = c1.first ? min(c1.first, val) : val, c1.second = c1.second ? max(c1.second, val) : val;\n\t\t\tc2.first += val, ++c2.second;\n\t\t\tdb.first += val, ds.second += val;\n\t\t}\n\n\t\tfor (auto &c : comm_minmax){\n\t\t\tint mean = comm_sumcnt[c.first].first / comm_sumcnt[c.first].second;\n\t\t\tcout << c.first << ' ' << c.second.first << ' ' << mean << ' ' << c.second.second << '\\n';\n\t\t}\n\t\tcout << \"--\\n\";\n\t\tfor (auto &d : dealer){\n\t\t\tcout << d.first << ' ' << d.second.first << ' ' << d.second.second << '\\n';\n\t\t}\n\t\tcout << \"----------\\n\";\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1356,"score_of_the_acc":-0.9064,"final_rank":4},{"submission_id":"aoj_1225_812171","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <algorithm>\n#include <vector>\n#include <map>\nusing namespace std;\n\n#define INF (1<<29)\n\ntypedef pair<int, int> P;\ntypedef pair<P, P> PP;\n\nstruct Order{\n string pname, dname;\n string order;\n int price;\n Order(string pname, string dname, string order, int price) :\n pname(pname), dname(dname), order(order), price(price){}\n};\n \n\nint main(){\n int n;\n while(cin >> n, n){\n bool used[1010];\n memset(used, false, sizeof(used));\n vector<Order> market;\n map<string, P> person;\n map<string, PP> item;\n \n string pname, dname, order;\n int price;\n for(int i = 0 ; i < n ; i++){\n cin >> pname >> order >> dname >> price;\n market.push_back(Order(pname, dname, order, price));\n if(person.find(pname) == person.end()) person[pname] = P(0, 0);\n if(order == \"SELL\"){\n\tint number = -1;\n\tint p = -1;\n\tfor(int j = 0 ; j < (int)market.size() ; j++){\n\t if(market[j].order == \"BUY\" && market[j].pname != pname &&\n\t market[j].dname == dname && market[j].price >= price &&\n\t !used[j]){\n\t if(p < market[j].price){\n\t number = j;\n\t p = market[j].price;\n\t }\n\t }\n\t}\n\tif(number == -1) continue;\n\tint deal = (price + p) / 2;\n\tperson[pname].second += deal;\n\tperson[market[number].pname].first += deal;\n\titem[dname].first.first += deal;\n\titem[dname].first.second++;\n\titem[dname].second.first = max(item[dname].second.first, deal);\n\tif(item[dname].first.second == 1) item[dname].second.second = deal;\n\telse item[dname].second.second = min(item[dname].second.second, deal);\n\tused[i] = used[number] = true;\n }\n\n if(order == \"BUY\"){\n\tint number = -1;\n\tint p = INF;\n\tfor(int j = 0 ; j < (int)market.size() ; j++){\n\t if(market[j].order == \"SELL\" && market[j].pname != pname &&\n\t market[j].dname == dname && market[j].price <= price &&\n\t !used[j]){\n\t if(p > market[j].price){\n\t number = j;\n\t p = market[j].price;\n\t }\n\t }\n\t}\n\tif(number == -1) continue;\n\tint deal = (price + p) / 2;\n\tperson[pname].first += deal;\n\tperson[market[number].pname].second += deal;\t \n\tused[i] = used[number] = true;\n\titem[dname].first.first += deal;\n\titem[dname].first.second++;\n\titem[dname].second.first = max(item[dname].second.first, deal);\n\tif(item[dname].first.second == 1) item[dname].second.second = deal;\n\telse item[dname].second.second = min(item[dname].second.second, deal); \n }\n }\n \n for(map<string, PP>::iterator it = item.begin() ; it != item.end() ; it++){\n cout << it->first << ' '\n\t << it->second.second.second << ' '\n\t << it->second.first.first / it->second.first.second << ' '\n\t << it->second.second.first << endl;\t \n\n }\n cout << \"--\" << endl;\n \n for(map<string, P>::iterator it = person.begin() ; it != person.end() ; it++){\n cout << it->first << ' '\n\t << it->second.first << ' '\n\t << it->second.second << endl;\n }\n cout << \"----------\" << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1416,"score_of_the_acc":-0.9465,"final_rank":5},{"submission_id":"aoj_1225_744846","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<map>\n#include<cmath>\n#include<vector>\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define inf (1<<29)\n#define all(n) (n).begin(),(n).end()\nusing namespace std;\ntypedef pair<int,int> ii;//first -> paid, received\nstruct P\n{\n int low,avg,hig,total,cnt;\n P(int low=inf,int avg=0,int hig=-inf):low(low),avg(avg),hig(hig){total = cnt = 0;}\n};\nstruct Merchandise\n{\n int index,price;\n string name,dealer;\n bool completed;\n Merchandise(int index=-inf,string dealer=\"x\",string name=\"x\",int price=-inf):index(index),price(price),name(name),dealer(dealer){completed = false;}\n bool operator < (const Merchandise &a)const\n {\n if(price == a.price)return index < a.index;\n return price < a.price;\n }\n};\nint n;\n\nbool cmp(const Merchandise &a,const Merchandise &b)//use this method to sort the vector Buy\n{\n if(a.price == b.price)return a.index < b.index;\n return a.price > b.price;\n}\n\nint main()\n{\n while(cin >> n,n)\n {\n map<string,ii> dealer;\n map<string,P> commodity;\n vector<Merchandise> Sell,Buy;\n rep(i,n)\n\t{\n\t string sdealer,name,order;\n\t int price;\n\t cin >> sdealer >> order >> name >> price;\n\t dealer[sdealer] = dealer[sdealer];\n\t if(order[0] == 'S')\n\t {\n\t Sell.push_back(Merchandise(i,sdealer,name,price));\n\t int index = Sell.size()-1;\n\t int bsize = Buy.size();\n\t rep(j,bsize)\n\t\t{\n\t\t if(Buy[j].completed)continue;\n\t\t if(Buy[j].dealer == sdealer)continue;\n\t\t if(Buy[j].name == name && Buy[j].price >= price)\n\t\t {\n\t\t //cout << \"Sell \" << sdealer << \" the commodity \" << name << \" to \" << Buy[j].dealer << endl;\n\t\t Buy[j].completed = true;\n\t\t Sell[index].completed = true;\n\t\t int value = (int)floor((Buy[j].price+price)/2.0);\n\t\t dealer[Buy[j].dealer].first += value;\n\t\t dealer[sdealer].second += value;\n\t\t commodity[name].low = min(commodity[name].low,value);\n\t\t commodity[name].hig = max(commodity[name].hig,value);\n\t\t commodity[name].total += value;\n\t\t commodity[name].cnt++;\n\t\t break;\n\t\t }\n\t\t}\n\t sort(all(Sell));\n\t }\n\t else\n\t {\n\t Buy.push_back(Merchandise(i,sdealer,name,price));\n\t int index = Buy.size()-1;\n\t int ssize = Sell.size();\n\t rep(j,ssize)\n\t\t{\n\t\t if(Sell[j].completed)continue;\n\t\t if(Sell[j].dealer == sdealer)continue;\n\t\t if(Sell[j].name == name && Sell[j].price <= price)\n\t\t {\n\t\t //cout << \"Buy \" << sdealer << \" the commodity \" << name << \" from \" << Sell[j].dealer << endl;\n\t\t Sell[j].completed = true;\n\t\t Buy[index].completed = true;\n\t\t int value = (int)floor((Sell[j].price+price)/2.0);\n\t\t dealer[Sell[j].dealer].second += value;\n\t\t dealer[sdealer].first += value;\n\t\t commodity[name].low = min(commodity[name].low,value);\n\t\t commodity[name].hig = max(commodity[name].hig,value);\n\t\t commodity[name].total += value;\n\t\t commodity[name].cnt++;\n\t\t break;\n\t\t }\n\t\t}\n\t sort(all(Buy),cmp);\n\t }\n\t}\n\n for(map<string,P>::iterator it = commodity.begin(); it != commodity.end(); it++)\n\t{\n\t cout << (it->first) << \" \" << (it->second.low) << \" \" << (int)floor((it->second.total)/(it->second.cnt)) << \" \" << (it->second.hig) << endl;\n\t}\n cout << \"--\" << endl;\n\n for(map<string,ii>::iterator it = dealer.begin();it != dealer.end();it++)\n\t{\n\t cout << (it->first) << \" \" << (it->second.first) << \" \" << (it->second.second) << endl; \n\t}\n cout << \"----------\" << endl;\n\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":1376,"score_of_the_acc":-1.1506,"final_rank":7},{"submission_id":"aoj_1225_225825","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <string>\n#include <map>\nusing namespace std;\n\n#define MAX (1<<24)\n#define MIN (-1)\n\nclass State\n{\npublic:\n\tstring n,t;\n\tchar c;\n\tint p,r;\n\tState(string n, string t, char c, int p, int r)\n\t\t:n(n),t(t),c(c),p(p),r(r)\n\t{}\n\n\tbool operator<(const State& s) const\n\t{\n\t\tif(t!=s.t) return t<s.t;\n\t\tif(t==\"SELL\" && p!=s.p) return p<s.p;\n\t\tif(t==\"BUY\" && p!=s.p) return p>s.p;\n\n\t\treturn r<s.r;\n\t}\n};\n\nclass Dealer\n{\npublic:\n\tstring n;\n\tint s,b;\n\tDealer(string n, int s, int b)\n\t\t:n(n),s(s),b(b)\n\t{}\n\n\tbool operator<(const Dealer& d) const\n\t{\n\t\treturn n<d.n;\n\t}\n};\n\nint main()\n{\n\tint N;\n\twhile(cin >> N, N)\n\t{\n\t\tint mi[30], ma[30], tt[30], nm[30];\n\t\tfor(int i=0; i<30; i++)\n\t\t{\n\t\t\tmi[i]=MAX;\n\t\t\tma[i]=MIN;\n\t\t\ttt[i]=0;\n\t\t\tnm[i]=0;\n\t\t}\n\n\t\tint n=0;\n\t\tmap<string, int> d;\n\t\tvector<State> st;\n\t\tvector<Dealer> dr;\n\t\tfor(int i=0; i<N; i++)\n\t\t{\n\t\t\tbool dealed=0;\n\t\t\tstring a,b;\n\t\t\tchar c;\n\t\t\tint p;\n\t\t\t\n\t\t\tcin >> a >> b >> c >> p;\n\t\t\tif(!d.count(a))\n\t\t\t{\n\t\t\t\td[a]=dr.size();\n\t\t\t\tdr.push_back(Dealer(a,0,0));\n\t\t\t}\n\n\t\t\tfor(int j=0; j<st.size(); j++)\n\t\t\t{\n\t\t\t\tif(st[j].t==b) continue;\n\t\t\t\tif(st[j].c!=c) continue;\n\n\t\t\t\tif(st[j].n==a) continue;\n\n\t\t\t\tif(b==\"SELL\")\n\t\t\t\t{\n\t\t\t\t\tif(p<=st[j].p)\n\t\t\t\t\t{\n\t\t\t\t\t\tint np=(p+st[j].p)/2;\n\t\t\t\t\t\tint z=st[j].c-'A';\n\t\t\t\t\t\tmi[z]=min(mi[z], np);\n\t\t\t\t\t\tma[z]=max(ma[z], np);\n\t\t\t\t\t\ttt[z]+=np;\n\t\t\t\t\t\tnm[z]++;\n\n\t\t\t\t\t\tdr[d[a]].s+=np;\n\t\t\t\t\t\tdr[d[st[j].n]].b+=np;\n\n\t\t\t\t\t\tdealed=true;\n\t\t\t\t\t\tst.erase(st.begin()+j);\n\t\t\t\t\t}\n\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tif(p>=st[j].p)\n\t\t\t\t\t{\n\t\t\t\t\t\tint np=(p+st[j].p)/2;\n\t\t\t\t\t\tint z=st[j].c-'A';\n\t\t\t\t\t\tmi[z]=min(mi[z], np);\n\t\t\t\t\t\tma[z]=max(ma[z], np);\n\t\t\t\t\t\ttt[z]+=np;\n\t\t\t\t\t\tnm[z]++;\n\n\t\t\t\t\t\tdr[d[a]].b+=np;\n\t\t\t\t\t\tdr[d[st[j].n]].s+=np;\n\n\t\t\t\t\t\tdealed=true;\n\t\t\t\t\t\tst.erase(st.begin()+j);\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tif(!dealed) st.push_back(State(a,b,c,p,i));\n\t\t\tsort(st.begin(), st.end());\n\t\t}\n\n\t\tfor(int i=0; i<26; i++)\n\t\t{\n\t\t\tif(nm[i]==0) continue;\n\t\t\tcout << (char)(i+'A') << \" \" << mi[i] << \" \" << (int)(tt[i]/nm[i]) << \" \"<< ma[i] << endl;\n\t\t}\n\t\tcout << \"--\" << endl;\n\n\t\tsort(dr.begin(), dr.end());\n\n\t\tfor(int i=0; i<dr.size(); i++)\n\t\t{\n\t\t\tcout << dr[i].n << \" \" << dr[i].b << \" \" << dr[i].s << endl;\n\t\t}\n\t\tcout << \"----------\" << endl;\n\t}\n\n}","accuracy":1,"time_ms":140,"memory_kb":992,"score_of_the_acc":-1.6631,"final_rank":8},{"submission_id":"aoj_1225_178446","code_snippet":"#include <iostream>\n#include <vector>\n#include <map>\n#include <algorithm>\nusing namespace std;\n\nclass P{\npublic:\n\tint price,id;\n\tstring name,com;\n\tbool flg; //true:wü, false:p\n\n\tP(string _name,bool _flg,string _com,int _price,int _id){\n\t\tname = _name;\n\t\tflg = _flg;\n\t\tcom = _com;\n\t\tprice = _price;\n\t\tid = _id;\n\t}\n\n\tbool operator<(const P &p)const{\n\t\tif(price == p.price) return id < p.id;\n\t\tif(flg) return price > p.price;\n\t\treturn price < p.price;\n\t}\n};\n\ntypedef struct{int min,sum,max,n;}Com;\ntypedef struct{int pay,recv;}Dealer;\n\nint main(void){\n\tint n;\n\n\twhile(cin>>n,n){\n\t\tvector<P> buy,sell;\n\t\tmap<string,Com> mc;\n\t\tmap<string,Dealer> md;\n\n\t\tfor(int i=0;i<n;i++){\n\t\t\tstring name,flg,com;\n\t\t\tint price;\n\t\t\tcin>>name>>flg>>com>>price;\n\n\t\t\tmd[name].pay += 0; //L[o^̽ß\n\n\t\t\tif(flg == \"BUY\"){\n\t\t\t\tbool buyFlg = false;\n\t\t\t\tfor(int j=0;j<sell.size();j++){\n\t\t\t\t\tif(com == sell[j].com && name != sell[j].name && price >= sell[j].price){\n\t\t\t\t\t\tint deal = (price + sell[j].price) / 2;\n\n\t\t\t\t\t\tif(mc[com].min == 0){\n\t\t\t\t\t\t\tCom tmp = {deal,deal,deal,1};\n\t\t\t\t\t\t\tmc[com] = tmp;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse{\n\t\t\t\t\t\t\tif(mc[com].max < deal) mc[com].max = deal;\n\t\t\t\t\t\t\tif(mc[com].min > deal) mc[com].min = deal;\n\t\t\t\t\t\t\tmc[com].sum += deal;\n\t\t\t\t\t\t\tmc[com].n++;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tmd[name].pay += deal;\n\t\t\t\t\t\tmd[sell[j].name].recv += deal;\n\t\t\t\t\t\tsell.erase(sell.begin()+j);\n\t\t\t\t\t\tbuyFlg = true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif(!buyFlg){\n\t\t\t\t\tbuy.push_back(P(name,true,com,price,i));\n\t\t\t\t\tsort(buy.begin(),buy.end());\n\t\t\t\t}\n\t\t\t}\n\t\t\telse{\n\t\t\t\tbool sellFlg = false;\n\t\t\t\tfor(int j=0;j<buy.size();j++){\n\t\t\t\t\tif(com == buy[j].com && name != buy[j].name && buy[j].price >= price){\n\t\t\t\t\t\tint deal = (price + buy[j].price) / 2;\n\n\t\t\t\t\t\tif(mc[com].min == 0){\n\t\t\t\t\t\t\tCom tmp = {deal,deal,deal,1};\n\t\t\t\t\t\t\tmc[com] = tmp;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse{\n\t\t\t\t\t\t\tif(mc[com].max < deal) mc[com].max = deal;\n\t\t\t\t\t\t\tif(mc[com].min > deal) mc[com].min = deal;\n\t\t\t\t\t\t\tmc[com].sum += deal;\n\t\t\t\t\t\t\tmc[com].n++;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tmd[buy[j].name].pay += deal;\n\t\t\t\t\t\tmd[name].recv += deal;\n\t\t\t\t\t\tbuy.erase(buy.begin()+j);\n\t\t\t\t\t\tsellFlg = true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif(!sellFlg){\n\t\t\t\t\tsell.push_back(P(name,false,com,price,i));\n\t\t\t\t\tsort(sell.begin(),sell.end());\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\n\t\tfor(map<string,Com>::iterator i=mc.begin();i!=mc.end();i++){\n\t\t\tcout<<(i->first)<<\" \"<<(i->second).min<<\" \"<<(i->second).sum / (i->second).n<<\" \"<<(i->second).max<<endl;\n\t\t}\n\t\tcout<<\"--\\n\";\n\n\t\tfor(map<string,Dealer>::iterator i=md.begin();i!=md.end();i++){\n\t\t\tcout<<(i->first)<<\" \"<<(i->second).pay<<\" \"<<(i->second).recv<<endl;\n\t\t}\n\t\tcout<<\"----------\\n\";\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":980,"score_of_the_acc":-0.732,"final_rank":2},{"submission_id":"aoj_1225_178410","code_snippet":"#include<iostream>\n#include<string>\n#include<map>\n#include<vector>\n\nusing namespace std;\nconst int infty = 100000;\n\nstruct order{\n string who;\n string does;\n string item;\n int val;\n};\n\nstruct item{\n vector<int> v;\n};\n\nstruct dealer{\n int sell;\n int buy;\n};\n\n#define SELL 0\n#define BUY 1\n\nint minimumValue(const vector<int> &v){\n int ret = infty;\n for(int i = 0; i < (int)v.size(); ++i) ret = min(ret, v[i] );\n return ret;\n}\nint maximumValue(const vector<int> &v){\n int ret = 0;\n for(int i = 0; i < (int)v.size(); ++i) ret = max(ret, v[i] );\n return ret;\n}\nint meanValue(const vector<int> &v){\n int sum = 0;\n for(int i = 0; i < (int)v.size(); ++i)sum+=v[i];\n return sum / v.size();\n}\n\nint main()\n{\n while(true){\n int records;\n cin >> records;\n if(records==0)break;\n vector<order> os;\n map<string,item> items;\n map<string,dealer> dealers;\n bool dealed[records];\n for(int i = 0; i < records; ++i){\n order o;\n cin >> o.who >> o.does >> o.item >> o.val;\n items[o.item] = item();\n dealers[o.who] = dealer();\n os.push_back(o);\n dealed[i] = false;\n }\n for(int i = 0; i < (int)os.size(); ++i){\n int max_deal_val = 0;\n int min_deal_val = infty;\n int anti_dealer = infty;\n for(int j = i-1; j >= 0; --j){\n\tif( os[j].who != os[i].who && os[j].does != os[i].does && os[j].item == os[i].item &&\n\t !dealed[i] && !dealed[j] ){\n\t if( os[i].does == \"SELL\" ){\n\t if( os[i].val <= os[j].val ){\n\t if( os[j].val > max_deal_val ){\n\t\tmax_deal_val = os[j].val;\n\t\tanti_dealer = j;\n\t }else if( os[j].val == max_deal_val ){\n\t\tanti_dealer = min( anti_dealer, j );\n\t }\n\t }\n\t }else{\n\t if( os[j].val <= os[i].val ){\n\t if( os[j].val < min_deal_val ){\n\t\tmin_deal_val = os[j].val;\n\t\tanti_dealer = j;\n\t }else if( os[j].val == min_deal_val ){\n\t\tanti_dealer = min( anti_dealer, j );\n\t }\n\t }\n\t }\n\t}\n }\n if( anti_dealer < infty ){\n\t// deal occured\n\tdealed[i] = true;\n\tdealed[anti_dealer] = true;\n\tint deal_val = (os[anti_dealer].val + os[i].val) /2;\n\titems[ os[i].item ].v.push_back( deal_val );\n\tif( os[i].does == \"SELL\" ){\n\t dealers[ os[i].who ].sell += deal_val;\n\t dealers[ os[anti_dealer].who ].buy += deal_val;\n\t}else{\n\t dealers[ os[i].who ].buy += deal_val;\n\t dealers[ os[anti_dealer].who ].sell += deal_val;\n\t}\n }\n }\n\n for(map<string,item>::iterator it = items.begin(); it != items.end(); ++it){\n if( it->second.v.size() > 0 ){\n\tint minv = minimumValue( it->second.v );\n\tint maxv = maximumValue( it->second.v );\n\tint avgv = meanValue( it->second.v );\n\tcout << it->first << ' ' << minv << ' ' << avgv << ' ' << maxv << endl;\n }\n }\n cout << \"--\" << endl;\n for(map<string,dealer>::iterator it = dealers.begin(); it != dealers.end(); ++it){\n cout << it->first << ' ' << it->second.buy << ' ' << it->second.sell << endl;\n }\n cout << \"----------\" << endl;\n \n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":0,"score_of_the_acc":0,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_1225_1083098\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#define INF 0x3f3f3f3f\\n\\n#include <iostream>\\n#include <cstdio>\\n#include <sstream>\\n#include <cmath>\\n#include <cstdlib>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <limits>\\n#include <map>\\n#include <string>\\n#include <cstring>\\n#include <set>\\n#include <deque>\\n#include <bitset>\\n#include <list>\\n#include <cctype>\\n#include <utility>\\n#include <assert.h>\\n \\nusing namespace std;\\n \\ntypedef long long ll;\\ntypedef pair <int,int> P;\\ntypedef pair <int,P> PP;\\n \\nstatic const double EPS = 1e-8;\\n\\nclass Deal {\\npublic:\\n string _dealer_name;\\n string _type;\\n string _commodity_name;\\n int _price;\\n int _id;\\n Deal(string dealer_name,string type,string commodity_name,int price,int id) \\n : _dealer_name(dealer_name), _type(type), _commodity_name(commodity_name), _price(price), _id(id) {}\\n};\\n\\nclass DealerResult {\\npublic:\\n int _paid;\\n int _received;\\n DealerResult() : _paid(0),_received(0) {}\\n};\\n\\nclass CommodityResult {\\npublic:\\n int _lowest;\\n int _mean;\\n int _highest;\\n vector<int> _purchase_history;\\n void init(){\\n if(_purchase_history.size() > 0){\\n sort(_purchase_history.begin(),_purchase_history.end());\\n _highest = *(_purchase_history.end()-1);\\n _lowest = *(_purchase_history.begin());\\n \\n int sum = 0;\\n for(int i=0;i<_purchase_history.size();i++){\\n sum += _purchase_history[i];\\n }\\n _mean = sum / _purchase_history.size();\\n }\\n }\\n CommodityResult() : _lowest(0), _mean(0), _highest(0) {}\\n};\\n\\nint main(){\\n int total_dealers;\\n while(~scanf(\\\"%d\\\",&total_dealers)){\\n if(total_dealers == 0) break;\\n\\n vector<Deal> deals;\\n for(int dealer_i = 0; dealer_i < total_dealers; dealer_i++){\\n string dealer_name,type,commodity_name;\\n int price;\\n cin >> dealer_name >> type >> commodity_name >> price;\\n deals.push_back(Deal(dealer_name,type,commodity_name,price,dealer_i));\\n }\\n\\n bool used[1001];\\n memset(used,false,sizeof(used));\\n\\n map<string,CommodityResult> commodity_result;\\n map<string,DealerResult> dealer_result;\\n\\n for(int dealer_i = 0; dealer_i < total_dealers; dealer_i++){\\n dealer_result[deals[dealer_i]._dealer_name] = DealerResult();\\n }\\n\\n for(int dealer_i = 0; dealer_i < total_dealers; dealer_i++){\\n if(used[dealer_i]) continue;\\n int current_sell_price = INF; // lowest\\n int current_buy_price = -INF; // highest\\n int target_id = -1;\\n\\n for(int dealer_j = 0; dealer_j < dealer_i; dealer_j++){\\n if(used[dealer_j]) continue;\\n if(deals[dealer_i]._type == deals[dealer_j]._type) continue;\\n if(deals[dealer_i]._dealer_name == deals[dealer_j]._dealer_name) continue;\\n if(deals[dealer_i]._commodity_name != deals[dealer_j]._commodity_name) continue;\\n\\n if(deals[dealer_i]._type == \\\"BUY\\\"){\\n if(deals[dealer_j]._price <= deals[dealer_i]._price){\\n if(current_sell_price > deals[dealer_j]._price){\\n current_sell_price = deals[dealer_j]._price;\\n target_id = dealer_j;\\n }\\n }\\n }\\n else if(deals[dealer_i]._type == \\\"SELL\\\"){\\n if(deals[dealer_j]._price >= deals[dealer_i]._price){\\n if(current_buy_price < deals[dealer_j]._price){\\n current_buy_price = deals[dealer_j]._price;\\n target_id = dealer_j;\\n }\\n }\\n }\\n }\\n\\n if(target_id != -1){\\n if(deals[dealer_i]._type == \\\"BUY\\\"){\\n dealer_result[deals[dealer_i]._dealer_name]._paid += (current_sell_price + deals[dealer_i]._price) / 2;\\n dealer_result[deals[target_id]._dealer_name]._received += (current_sell_price + deals[dealer_i]._price) / 2;\\n commodity_result[deals[dealer_i]._commodity_name]._purchase_history\\n .push_back((current_sell_price + deals[dealer_i]._price) / 2);\\n }\\n\\n if(deals[dealer_i]._type == \\\"SELL\\\"){\\n dealer_result[deals[dealer_i]._dealer_name]._received += (current_buy_price + deals[dealer_i]._price) / 2;\\n dealer_result[deals[target_id]._dealer_name]._paid += (current_buy_price + deals[dealer_i]._price) / 2;\\n commodity_result[deals[dealer_i]._commodity_name]._purchase_history\\n .push_back((current_buy_price + deals[dealer_i]._price) / 2);\\n }\\n \\n used[dealer_i] = true;\\n used[target_id] = true;\\n }\\n }\\n\\n for(map<string,CommodityResult>::iterator it = commodity_result.begin();\\n it != commodity_result.end();\\n it++){\\n it->second.init();\\n printf(\\\"%s %d %d %d\\\\n\\\",it->first.c_str(),it->second._lowest,it->second._mean,it->second._highest);\\n }\\n\\n printf(\\\"--\\\\n\\\");\\n for(map<string,DealerResult>::iterator it = dealer_result.begin();\\n it != dealer_result.end();\\n it++){\\n\\n printf(\\\"%s %d %d\\\\n\\\",it->first.c_str(),it->second._paid,it->second._received);\\n }\\n printf(\\\"----------\\\\n\\\");\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1496,\n \"score_of_the_acc\": -1,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1225_997494\",\n \"code_snippet\": \"//#include <bits/stdc++.h>\\n//#define _ ios_base::sync_with_stdio(0);cin.tie(0);\\n#include <iostream>\\n#include <cstdio>\\n#include <cstring>\\n#include <cmath>\\n#include <cstdlib>\\n#include <queue>\\n#include <vector>\\n#include <algorithm>\\n#include <cctype>\\n#include <fstream>\\n#include <map>\\n#include <list>\\n#include <set>\\n#include <string>\\n#include <stack>\\n#include <bitset>\\n\\n#define sz 50005\\n#define pb(a) push_back(a)\\n#define pp pop_back()\\n#define ll long long\\n#define fread freopen(\\\"input.txt\\\",\\\"r\\\",stdin)\\n#define fwrite freopen(\\\"output.txt\\\",\\\"w\\\",stdout)\\n#define inf (1e9)\\n#define chng(a,b) a^=b^=a^=b;\\n#define clr(abc,z) memset(abc,z,sizeof(abc))\\n#define PI acos(-1)\\n#define fr(i,a,b) for(i=a;i<=b;i++)\\n#define print1(a) cout<<a<<endl\\n#define print2(a,b) cout<<a<<\\\" \\\"<<b<<endl\\n#define print3(a,b,c) cout<<a<<\\\" \\\"<<b<<\\\" \\\"<<c<<endl\\n#define mod 1000000007\\nusing namespace std;\\n\\nstruct person\\n{\\n char name[15];\\n int buy, sell;\\n person(char line[])\\n {\\n strcpy(name, line);\\n buy=sell=0;\\n }\\n};\\n\\nstruct commodity\\n{\\n char name[5];\\n int n, sum, mn, mx;\\n commodity(char line[])\\n {\\n sum = n = 0;\\n mn = inf;\\n mx = -inf;\\n strcpy(name,line );\\n }\\n};\\n\\nstruct product\\n{\\n char name[15];\\n char prod[5];\\n int price;\\n int cnt;\\n\\n product(char line1[], char line2[], int p, int c)\\n {\\n strcpy(name, line1);\\n strcpy(prod, line2);\\n price = p;\\n cnt = c;\\n }\\n};\\n\\n\\nvector<person>per;\\nvector<commodity>thing;\\nvector<product>buys, sells;\\n\\nbool compbuy(const product &a, const product &b)\\n{\\n if(a.price==b.price) return a.cnt<b.cnt;\\n return a.price>b.price;\\n}\\nbool compsell(const product &a, const product &b)\\n{\\n if(a.price==b.price) return a.cnt<b.cnt;\\n return a.price<b.price;\\n}\\n\\nbool printCompThing(const commodity &a, const commodity &b)\\n{\\n return strcmp(a.name,b.name)<0;\\n}\\n\\nbool printCompPerson(const person &a, const person &b)\\n{\\n return strcmp(a.name,b.name)<0;\\n}\\n\\nvoid printall()\\n{\\n sort(thing.begin(), thing.end(), printCompThing);\\n for (int i = 0; i<thing.size(); i++)\\n printf(\\\"%s %d %d %d\\\\n\\\", thing[i].name, thing[i].mn, thing[i].sum/thing[i].n, thing[i].mx);\\n puts(\\\"--\\\");\\n\\n sort(per.begin(), per.end(), printCompPerson);\\n for (int i = 0; i<per.size(); i++)\\n printf(\\\"%s %d %d\\\\n\\\", per[i].name, per[i].buy, per[i].sell);\\n puts(\\\"----------\\\");\\n\\n return;\\n}\\n\\nvoid printBuyList()\\n{\\n cout<<\\\"Buy ---------------\\\"<<endl;\\n for (int i = 0; i<buys.size(); i++)\\n cout<<\\\"N: \\\"<<buys[i].name<<\\\" Prod: \\\"<<buys[i].prod<<\\\" Price: \\\"<<buys[i].price<<\\\" cnt: \\\"<<buys[i].cnt<<endl;\\n cout<<\\\"-------------------\\\"<<endl;\\n return;\\n}\\n\\nvoid printSellList()\\n{\\n cout<<\\\"Sell---------------\\\"<<endl;\\n for (int i = 0; i<sells.size(); i++)\\n cout<<\\\"N: \\\"<<sells[i].name<<\\\" Prod: \\\"<<sells[i].prod<<\\\" Price: \\\"<<sells[i].price<<\\\" cnt: \\\"<<sells[i].cnt<<endl;\\n cout<<\\\"-------------------\\\"<<endl;\\n return;\\n}\\n\\n\\n\\n\\nint main()\\n{\\n#ifdef ENAM\\n fread;\\n fwrite;\\n#endif // ENAM\\n int t, n, m, cas=1, price, x,y, dealprice;\\n char name[20], type[10], com[5];\\n\\n\\n while(~scanf(\\\"%d\\\", &n)&&n)\\n {\\n per.clear();\\n thing.clear();\\n buys.clear();\\n sells.clear();\\n\\n for (int i = 0; i<n; i++)\\n {\\n// printBuyList();\\n// printSellList();\\n scanf(\\\" %s %s %s %d\\\", name, type, com, &price);\\n int j;\\n for (j = 0; j<per.size(); j++)\\n if(!strcmp(per[j].name, name)) break;\\n\\n if(j==per.size()) per.pb(person(name));\\n\\n// printf(\\\"::>> %s %s %s %d\\\\n\\\", name, type, com, price);\\n\\n if(!strcmp(type, \\\"SELL\\\"))\\n {\\n if(!buys.empty())\\n {\\n sort(buys.begin(), buys.end(), compbuy);\\n for (j = 0; j<buys.size(); j++)\\n {\\n if(strcmp(buys[j].name, name) && !strcmp(com,buys[j].prod) && price<= buys[j].price)\\n {\\n dealprice = (price+buys[j].price)/2;\\n\\n int ii;\\n //selling person update\\n for (ii = 0; ii<per.size(); ii++ )\\n if(!strcmp(per[ii].name, name)) break;\\n per[ii].sell+=dealprice;\\n\\n //buying person update\\n for (ii = 0; ii<per.size(); ii++ )\\n if(!strcmp(per[ii].name, buys[j].name)) break;\\n per[ii].buy+=dealprice;\\n\\n //commodity update\\n for (ii = 0; ii<thing.size(); ii++ )\\n if(!strcmp(thing[ii].name, com)) break;\\n\\n if(ii==thing.size()) thing.pb(commodity(com));\\n\\n thing[ii].n++;\\n thing[ii].sum+=dealprice;\\n thing[ii].mn = min(thing[ii].mn, dealprice);\\n thing[ii].mx = max(thing[ii].mx, dealprice);\\n\\n break;\\n }\\n }\\n\\n if(j==buys.size()) sells.pb(product(name,com, price,i));\\n else buys.erase(buys.begin()+j);\\n }\\n else sells.pb(product(name,com, price,i));\\n }\\n else\\n {\\n// printf(\\\":->%s %s %s %d\\\\n\\\", name, type, com, price);\\n if(!sells.empty())\\n {\\n sort(sells.begin(), sells.end(), compsell);\\n int j;\\n for (j = 0; j<sells.size(); j++)\\n {\\n if(strcmp(sells[j].name, name) && !strcmp(com,sells[j].prod) && sells[j].price <= price)\\n {\\n dealprice = (price+sells[j].price)/2;\\n\\n int ii;\\n //buying person update\\n for (ii = 0; ii<per.size(); ii++ )\\n if(!strcmp(per[ii].name, name)) break;\\n per[ii].buy+=dealprice;\\n\\n //selling person update\\n for (ii = 0; ii<per.size(); ii++ )\\n if(!strcmp(per[ii].name, sells[j].name)) break;\\n per[ii].sell+=dealprice;\\n\\n //commodity update\\n for (ii = 0; ii<thing.size(); ii++ )\\n if(!strcmp(thing[ii].name, com)) break;\\n\\n if(ii==thing.size()) thing.pb(commodity(com));\\n\\n thing[ii].n++;\\n thing[ii].sum+=dealprice;\\n thing[ii].mn = min(thing[ii].mn, dealprice);\\n thing[ii].mx = max(thing[ii].mx, dealprice);\\n\\n break;\\n }\\n }\\n\\n if(j==sells.size()) buys.pb(product(name,com, price,i));\\n else sells.erase(sells.begin()+j);\\n }\\n else buys.pb(product(name,com, price,i));\\n }\\n }\\n printall();\\n }\\n return 0;\\n}\\n\\n/*\\n3\\nPERLIS SELL A 300\\nMILKES BUY A 200\\nHAMMING SELL A 100\\n4\\nBACKUS SELL A 10\\nFLOYD BUY A 20\\nIVERSON SELL B 30\\nBACKUS BUY B 40\\n7\\nMILKINSON SELL A 500\\nMCCARTHY BUY C 300\\nMILKINSON SELL C 200\\nDIJKSTRA SELL B 100\\nBACHMAN BUY A 400\\nDIJKSTRA BUY A 600\\nMILKINSON SELL A 300\\n2\\nABCD SELL X 10\\nABC BUY X 15\\n2\\nA SELL M 100\\nA BUY M 100\\n0\\n*/\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1256,\n \"score_of_the_acc\": -0.8396,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1225_955139\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <string>\\n#include <vector>\\n#include <tuple>\\n#include <map>\\n\\nusing namespace std;\\n\\nint main(){\\n\\tint n;\\n\\twhile (cin >> n, n){\\n\\t\\tvector<tuple<string, char, string, int>> v(n);\\n\\t\\tvector<int> used(n);\\n\\n\\t\\tmap<string, pair<int, int>> comm_minmax;\\n\\t\\tmap<string, pair<int, int>> comm_sumcnt;\\n\\t\\tmap<string, pair<int, int>> dealer;\\n\\n\\t\\tfor (int i = 0; i < n; ++i){\\n\\t\\t\\tstring a, b, c;\\n\\t\\t\\tint x;\\n\\t\\t\\tcin >> a >> b >> c >> x;\\n\\t\\t\\tv[i] = make_tuple(a, b[0], c, x);\\n\\t\\t\\tdealer[a];\\n\\t\\t\\tint idx = -1, opt = x;\\n\\t\\t\\tbool buy = b[0] == 'B';\\n\\t\\t\\tfor (int j = 0; j < i; ++j){\\n\\t\\t\\t\\tif (used[j]) continue;\\n\\t\\t\\t\\tif (a != get<0>(v[j]) && b[0] != get<1>(v[j]) && c == get<2>(v[j])){\\n\\t\\t\\t\\t\\tint y = get<3>(v[j]);\\n\\t\\t\\t\\t\\tif (buy && y <= opt){\\n\\t\\t\\t\\t\\t\\topt = y - 1, idx = j;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif (!buy && y >= opt){\\n\\t\\t\\t\\t\\t\\topt = y + 1, idx = j;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (idx < 0) continue;\\n\\t\\t\\tused[i] = used[idx] = 1;\\n\\t\\t\\tstring buyer = a, seller = get<0>(v[idx]);\\n\\t\\t\\tif (!buy) swap(buyer, seller);\\n\\n\\t\\t\\tif (buyer == seller) continue;\\n\\t\\t\\tauto &c1 = comm_minmax[c], &c2 = comm_sumcnt[c], &db = dealer[buyer], &ds = dealer[seller];\\n\\t\\t\\tint val = (x + get<3>(v[idx])) / 2;\\n\\t\\t\\tc1.first = c1.first ? min(c1.first, val) : val, c1.second = c1.second ? max(c1.second, val) : val;\\n\\t\\t\\tc2.first += val, ++c2.second;\\n\\t\\t\\tdb.first += val, ds.second += val;\\n\\t\\t}\\n\\n\\t\\tfor (auto &c : comm_minmax){\\n\\t\\t\\tint mean = comm_sumcnt[c.first].first / comm_sumcnt[c.first].second;\\n\\t\\t\\tcout << c.first << ' ' << c.second.first << ' ' << mean << ' ' << c.second.second << '\\\\n';\\n\\t\\t}\\n\\t\\tcout << \\\"--\\\\n\\\";\\n\\t\\tfor (auto &d : dealer){\\n\\t\\t\\tcout << d.first << ' ' << d.second.first << ' ' << d.second.second << '\\\\n';\\n\\t\\t}\\n\\t\\tcout << \\\"----------\\\\n\\\";\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1356,\n \"score_of_the_acc\": -0.9064,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1225_812171\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cstring>\\n#include <algorithm>\\n#include <vector>\\n#include <map>\\nusing namespace std;\\n\\n#define INF (1<<29)\\n\\ntypedef pair<int, int> P;\\ntypedef pair<P, P> PP;\\n\\nstruct Order{\\n string pname, dname;\\n string order;\\n int price;\\n Order(string pname, string dname, string order, int price) :\\n pname(pname), dname(dname), order(order), price(price){}\\n};\\n \\n\\nint main(){\\n int n;\\n while(cin >> n, n){\\n bool used[1010];\\n memset(used, false, sizeof(used));\\n vector<Order> market;\\n map<string, P> person;\\n map<string, PP> item;\\n \\n string pname, dname, order;\\n int price;\\n for(int i = 0 ; i < n ; i++){\\n cin >> pname >> order >> dname >> price;\\n market.push_back(Order(pname, dname, order, price));\\n if(person.find(pname) == person.end()) person[pname] = P(0, 0);\\n if(order == \\\"SELL\\\"){\\n\\tint number = -1;\\n\\tint p = -1;\\n\\tfor(int j = 0 ; j < (int)market.size() ; j++){\\n\\t if(market[j].order == \\\"BUY\\\" && market[j].pname != pname &&\\n\\t market[j].dname == dname && market[j].price >= price &&\\n\\t !used[j]){\\n\\t if(p < market[j].price){\\n\\t number = j;\\n\\t p = market[j].price;\\n\\t }\\n\\t }\\n\\t}\\n\\tif(number == -1) continue;\\n\\tint deal = (price + p) / 2;\\n\\tperson[pname].second += deal;\\n\\tperson[market[number].pname].first += deal;\\n\\titem[dname].first.first += deal;\\n\\titem[dname].first.second++;\\n\\titem[dname].second.first = max(item[dname].second.first, deal);\\n\\tif(item[dname].first.second == 1) item[dname].second.second = deal;\\n\\telse item[dname].second.second = min(item[dname].second.second, deal);\\n\\tused[i] = used[number] = true;\\n }\\n\\n if(order == \\\"BUY\\\"){\\n\\tint number = -1;\\n\\tint p = INF;\\n\\tfor(int j = 0 ; j < (int)market.size() ; j++){\\n\\t if(market[j].order == \\\"SELL\\\" && market[j].pname != pname &&\\n\\t market[j].dname == dname && market[j].price <= price &&\\n\\t !used[j]){\\n\\t if(p > market[j].price){\\n\\t number = j;\\n\\t p = market[j].price;\\n\\t }\\n\\t }\\n\\t}\\n\\tif(number == -1) continue;\\n\\tint deal = (price + p) / 2;\\n\\tperson[pname].first += deal;\\n\\tperson[market[number].pname].second += deal;\\t \\n\\tused[i] = used[number] = true;\\n\\titem[dname].first.first += deal;\\n\\titem[dname].first.second++;\\n\\titem[dname].second.first = max(item[dname].second.first, deal);\\n\\tif(item[dname].first.second == 1) item[dname].second.second = deal;\\n\\telse item[dname].second.second = min(item[dname].second.second, deal); \\n }\\n }\\n \\n for(map<string, PP>::iterator it = item.begin() ; it != item.end() ; it++){\\n cout << it->first << ' '\\n\\t << it->second.second.second << ' '\\n\\t << it->second.first.first / it->second.first.second << ' '\\n\\t << it->second.second.first << endl;\\t \\n\\n }\\n cout << \\\"--\\\" << endl;\\n \\n for(map<string, P>::iterator it = person.begin() ; it != person.end() ; it++){\\n cout << it->first << ' '\\n\\t << it->second.first << ' '\\n\\t << it->second.second << endl;\\n }\\n cout << \\\"----------\\\" << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1416,\n \"score_of_the_acc\": -0.9465,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1225_744846\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<map>\\n#include<cmath>\\n#include<vector>\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define inf (1<<29)\\n#define all(n) (n).begin(),(n).end()\\nusing namespace std;\\ntypedef pair<int,int> ii;//first -> paid, received\\nstruct P\\n{\\n int low,avg,hig,total,cnt;\\n P(int low=inf,int avg=0,int hig=-inf):low(low),avg(avg),hig(hig){total = cnt = 0;}\\n};\\nstruct Merchandise\\n{\\n int index,price;\\n string name,dealer;\\n bool completed;\\n Merchandise(int index=-inf,string dealer=\\\"x\\\",string name=\\\"x\\\",int price=-inf):index(index),price(price),name(name),dealer(dealer){completed = false;}\\n bool operator < (const Merchandise &a)const\\n {\\n if(price == a.price)return index < a.index;\\n return price < a.price;\\n }\\n};\\nint n;\\n\\nbool cmp(const Merchandise &a,const Merchandise &b)//use this method to sort the vector Buy\\n{\\n if(a.price == b.price)return a.index < b.index;\\n return a.price > b.price;\\n}\\n\\nint main()\\n{\\n while(cin >> n,n)\\n {\\n map<string,ii> dealer;\\n map<string,P> commodity;\\n vector<Merchandise> Sell,Buy;\\n rep(i,n)\\n\\t{\\n\\t string sdealer,name,order;\\n\\t int price;\\n\\t cin >> sdealer >> order >> name >> price;\\n\\t dealer[sdealer] = dealer[sdealer];\\n\\t if(order[0] == 'S')\\n\\t {\\n\\t Sell.push_back(Merchandise(i,sdealer,name,price));\\n\\t int index = Sell.size()-1;\\n\\t int bsize = Buy.size();\\n\\t rep(j,bsize)\\n\\t\\t{\\n\\t\\t if(Buy[j].completed)continue;\\n\\t\\t if(Buy[j].dealer == sdealer)continue;\\n\\t\\t if(Buy[j].name == name && Buy[j].price >= price)\\n\\t\\t {\\n\\t\\t //cout << \\\"Sell \\\" << sdealer << \\\" the commodity \\\" << name << \\\" to \\\" << Buy[j].dealer << endl;\\n\\t\\t Buy[j].completed = true;\\n\\t\\t Sell[index].completed = true;\\n\\t\\t int value = (int)floor((Buy[j].price+price)/2.0);\\n\\t\\t dealer[Buy[j].dealer].first += value;\\n\\t\\t dealer[sdealer].second += value;\\n\\t\\t commodity[name].low = min(commodity[name].low,value);\\n\\t\\t commodity[name].hig = max(commodity[name].hig,value);\\n\\t\\t commodity[name].total += value;\\n\\t\\t commodity[name].cnt++;\\n\\t\\t break;\\n\\t\\t }\\n\\t\\t}\\n\\t sort(all(Sell));\\n\\t }\\n\\t else\\n\\t {\\n\\t Buy.push_back(Merchandise(i,sdealer,name,price));\\n\\t int index = Buy.size()-1;\\n\\t int ssize = Sell.size();\\n\\t rep(j,ssize)\\n\\t\\t{\\n\\t\\t if(Sell[j].completed)continue;\\n\\t\\t if(Sell[j].dealer == sdealer)continue;\\n\\t\\t if(Sell[j].name == name && Sell[j].price <= price)\\n\\t\\t {\\n\\t\\t //cout << \\\"Buy \\\" << sdealer << \\\" the commodity \\\" << name << \\\" from \\\" << Sell[j].dealer << endl;\\n\\t\\t Sell[j].completed = true;\\n\\t\\t Buy[index].completed = true;\\n\\t\\t int value = (int)floor((Sell[j].price+price)/2.0);\\n\\t\\t dealer[Sell[j].dealer].second += value;\\n\\t\\t dealer[sdealer].first += value;\\n\\t\\t commodity[name].low = min(commodity[name].low,value);\\n\\t\\t commodity[name].hig = max(commodity[name].hig,value);\\n\\t\\t commodity[name].total += value;\\n\\t\\t commodity[name].cnt++;\\n\\t\\t break;\\n\\t\\t }\\n\\t\\t}\\n\\t sort(all(Buy),cmp);\\n\\t }\\n\\t}\\n\\n for(map<string,P>::iterator it = commodity.begin(); it != commodity.end(); it++)\\n\\t{\\n\\t cout << (it->first) << \\\" \\\" << (it->second.low) << \\\" \\\" << (int)floor((it->second.total)/(it->second.cnt)) << \\\" \\\" << (it->second.hig) << endl;\\n\\t}\\n cout << \\\"--\\\" << endl;\\n\\n for(map<string,ii>::iterator it = dealer.begin();it != dealer.end();it++)\\n\\t{\\n\\t cout << (it->first) << \\\" \\\" << (it->second.first) << \\\" \\\" << (it->second.second) << endl; \\n\\t}\\n cout << \\\"----------\\\" << endl;\\n\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 1376,\n \"score_of_the_acc\": -1.1506,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1225_225825\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <string>\\n#include <map>\\nusing namespace std;\\n\\n#define MAX (1<<24)\\n#define MIN (-1)\\n\\nclass State\\n{\\npublic:\\n\\tstring n,t;\\n\\tchar c;\\n\\tint p,r;\\n\\tState(string n, string t, char c, int p, int r)\\n\\t\\t:n(n),t(t),c(c),p(p),r(r)\\n\\t{}\\n\\n\\tbool operator<(const State& s) const\\n\\t{\\n\\t\\tif(t!=s.t) return t<s.t;\\n\\t\\tif(t==\\\"SELL\\\" && p!=s.p) return p<s.p;\\n\\t\\tif(t==\\\"BUY\\\" && p!=s.p) return p>s.p;\\n\\n\\t\\treturn r<s.r;\\n\\t}\\n};\\n\\nclass Dealer\\n{\\npublic:\\n\\tstring n;\\n\\tint s,b;\\n\\tDealer(string n, int s, int b)\\n\\t\\t:n(n),s(s),b(b)\\n\\t{}\\n\\n\\tbool operator<(const Dealer& d) const\\n\\t{\\n\\t\\treturn n<d.n;\\n\\t}\\n};\\n\\nint main()\\n{\\n\\tint N;\\n\\twhile(cin >> N, N)\\n\\t{\\n\\t\\tint mi[30], ma[30], tt[30], nm[30];\\n\\t\\tfor(int i=0; i<30; i++)\\n\\t\\t{\\n\\t\\t\\tmi[i]=MAX;\\n\\t\\t\\tma[i]=MIN;\\n\\t\\t\\ttt[i]=0;\\n\\t\\t\\tnm[i]=0;\\n\\t\\t}\\n\\n\\t\\tint n=0;\\n\\t\\tmap<string, int> d;\\n\\t\\tvector<State> st;\\n\\t\\tvector<Dealer> dr;\\n\\t\\tfor(int i=0; i<N; i++)\\n\\t\\t{\\n\\t\\t\\tbool dealed=0;\\n\\t\\t\\tstring a,b;\\n\\t\\t\\tchar c;\\n\\t\\t\\tint p;\\n\\t\\t\\t\\n\\t\\t\\tcin >> a >> b >> c >> p;\\n\\t\\t\\tif(!d.count(a))\\n\\t\\t\\t{\\n\\t\\t\\t\\td[a]=dr.size();\\n\\t\\t\\t\\tdr.push_back(Dealer(a,0,0));\\n\\t\\t\\t}\\n\\n\\t\\t\\tfor(int j=0; j<st.size(); j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif(st[j].t==b) continue;\\n\\t\\t\\t\\tif(st[j].c!=c) continue;\\n\\n\\t\\t\\t\\tif(st[j].n==a) continue;\\n\\n\\t\\t\\t\\tif(b==\\\"SELL\\\")\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif(p<=st[j].p)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tint np=(p+st[j].p)/2;\\n\\t\\t\\t\\t\\t\\tint z=st[j].c-'A';\\n\\t\\t\\t\\t\\t\\tmi[z]=min(mi[z], np);\\n\\t\\t\\t\\t\\t\\tma[z]=max(ma[z], np);\\n\\t\\t\\t\\t\\t\\ttt[z]+=np;\\n\\t\\t\\t\\t\\t\\tnm[z]++;\\n\\n\\t\\t\\t\\t\\t\\tdr[d[a]].s+=np;\\n\\t\\t\\t\\t\\t\\tdr[d[st[j].n]].b+=np;\\n\\n\\t\\t\\t\\t\\t\\tdealed=true;\\n\\t\\t\\t\\t\\t\\tst.erase(st.begin()+j);\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif(p>=st[j].p)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tint np=(p+st[j].p)/2;\\n\\t\\t\\t\\t\\t\\tint z=st[j].c-'A';\\n\\t\\t\\t\\t\\t\\tmi[z]=min(mi[z], np);\\n\\t\\t\\t\\t\\t\\tma[z]=max(ma[z], np);\\n\\t\\t\\t\\t\\t\\ttt[z]+=np;\\n\\t\\t\\t\\t\\t\\tnm[z]++;\\n\\n\\t\\t\\t\\t\\t\\tdr[d[a]].b+=np;\\n\\t\\t\\t\\t\\t\\tdr[d[st[j].n]].s+=np;\\n\\n\\t\\t\\t\\t\\t\\tdealed=true;\\n\\t\\t\\t\\t\\t\\tst.erase(st.begin()+j);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(!dealed) st.push_back(State(a,b,c,p,i));\\n\\t\\t\\tsort(st.begin(), st.end());\\n\\t\\t}\\n\\n\\t\\tfor(int i=0; i<26; i++)\\n\\t\\t{\\n\\t\\t\\tif(nm[i]==0) continue;\\n\\t\\t\\tcout << (char)(i+'A') << \\\" \\\" << mi[i] << \\\" \\\" << (int)(tt[i]/nm[i]) << \\\" \\\"<< ma[i] << endl;\\n\\t\\t}\\n\\t\\tcout << \\\"--\\\" << endl;\\n\\n\\t\\tsort(dr.begin(), dr.end());\\n\\n\\t\\tfor(int i=0; i<dr.size(); i++)\\n\\t\\t{\\n\\t\\t\\tcout << dr[i].n << \\\" \\\" << dr[i].b << \\\" \\\" << dr[i].s << endl;\\n\\t\\t}\\n\\t\\tcout << \\\"----------\\\" << endl;\\n\\t}\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 992,\n \"score_of_the_acc\": -1.6631,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1225_178446\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <map>\\n#include <algorithm>\\nusing namespace std;\\n\\nclass P{\\npublic:\\n\\tint price,id;\\n\\tstring name,com;\\n\\tbool flg; //true:wü, false:p\\n\\n\\tP(string _name,bool _flg,string _com,int _price,int _id){\\n\\t\\tname = _name;\\n\\t\\tflg = _flg;\\n\\t\\tcom = _com;\\n\\t\\tprice = _price;\\n\\t\\tid = _id;\\n\\t}\\n\\n\\tbool operator<(const P &p)const{\\n\\t\\tif(price == p.price) return id < p.id;\\n\\t\\tif(flg) return price > p.price;\\n\\t\\treturn price < p.price;\\n\\t}\\n};\\n\\ntypedef struct{int min,sum,max,n;}Com;\\ntypedef struct{int pay,recv;}Dealer;\\n\\nint main(void){\\n\\tint n;\\n\\n\\twhile(cin>>n,n){\\n\\t\\tvector<P> buy,sell;\\n\\t\\tmap<string,Com> mc;\\n\\t\\tmap<string,Dealer> md;\\n\\n\\t\\tfor(int i=0;i<n;i++){\\n\\t\\t\\tstring name,flg,com;\\n\\t\\t\\tint price;\\n\\t\\t\\tcin>>name>>flg>>com>>price;\\n\\n\\t\\t\\tmd[name].pay += 0; //L[o^̽ß\\n\\n\\t\\t\\tif(flg == \\\"BUY\\\"){\\n\\t\\t\\t\\tbool buyFlg = false;\\n\\t\\t\\t\\tfor(int j=0;j<sell.size();j++){\\n\\t\\t\\t\\t\\tif(com == sell[j].com && name != sell[j].name && price >= sell[j].price){\\n\\t\\t\\t\\t\\t\\tint deal = (price + sell[j].price) / 2;\\n\\n\\t\\t\\t\\t\\t\\tif(mc[com].min == 0){\\n\\t\\t\\t\\t\\t\\t\\tCom tmp = {deal,deal,deal,1};\\n\\t\\t\\t\\t\\t\\t\\tmc[com] = tmp;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\t\\t\\tif(mc[com].max < deal) mc[com].max = deal;\\n\\t\\t\\t\\t\\t\\t\\tif(mc[com].min > deal) mc[com].min = deal;\\n\\t\\t\\t\\t\\t\\t\\tmc[com].sum += deal;\\n\\t\\t\\t\\t\\t\\t\\tmc[com].n++;\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tmd[name].pay += deal;\\n\\t\\t\\t\\t\\t\\tmd[sell[j].name].recv += deal;\\n\\t\\t\\t\\t\\t\\tsell.erase(sell.begin()+j);\\n\\t\\t\\t\\t\\t\\tbuyFlg = true;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(!buyFlg){\\n\\t\\t\\t\\t\\tbuy.push_back(P(name,true,com,price,i));\\n\\t\\t\\t\\t\\tsort(buy.begin(),buy.end());\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse{\\n\\t\\t\\t\\tbool sellFlg = false;\\n\\t\\t\\t\\tfor(int j=0;j<buy.size();j++){\\n\\t\\t\\t\\t\\tif(com == buy[j].com && name != buy[j].name && buy[j].price >= price){\\n\\t\\t\\t\\t\\t\\tint deal = (price + buy[j].price) / 2;\\n\\n\\t\\t\\t\\t\\t\\tif(mc[com].min == 0){\\n\\t\\t\\t\\t\\t\\t\\tCom tmp = {deal,deal,deal,1};\\n\\t\\t\\t\\t\\t\\t\\tmc[com] = tmp;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\t\\t\\tif(mc[com].max < deal) mc[com].max = deal;\\n\\t\\t\\t\\t\\t\\t\\tif(mc[com].min > deal) mc[com].min = deal;\\n\\t\\t\\t\\t\\t\\t\\tmc[com].sum += deal;\\n\\t\\t\\t\\t\\t\\t\\tmc[com].n++;\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tmd[buy[j].name].pay += deal;\\n\\t\\t\\t\\t\\t\\tmd[name].recv += deal;\\n\\t\\t\\t\\t\\t\\tbuy.erase(buy.begin()+j);\\n\\t\\t\\t\\t\\t\\tsellFlg = true;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(!sellFlg){\\n\\t\\t\\t\\t\\tsell.push_back(P(name,false,com,price,i));\\n\\t\\t\\t\\t\\tsort(sell.begin(),sell.end());\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t\\tfor(map<string,Com>::iterator i=mc.begin();i!=mc.end();i++){\\n\\t\\t\\tcout<<(i->first)<<\\\" \\\"<<(i->second).min<<\\\" \\\"<<(i->second).sum / (i->second).n<<\\\" \\\"<<(i->second).max<<endl;\\n\\t\\t}\\n\\t\\tcout<<\\\"--\\\\n\\\";\\n\\n\\t\\tfor(map<string,Dealer>::iterator i=md.begin();i!=md.end();i++){\\n\\t\\t\\tcout<<(i->first)<<\\\" \\\"<<(i->second).pay<<\\\" \\\"<<(i->second).recv<<endl;\\n\\t\\t}\\n\\t\\tcout<<\\\"----------\\\\n\\\";\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 980,\n \"score_of_the_acc\": -0.732,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1225_178410\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<map>\\n#include<vector>\\n\\nusing namespace std;\\nconst int infty = 100000;\\n\\nstruct order{\\n string who;\\n string does;\\n string item;\\n int val;\\n};\\n\\nstruct item{\\n vector<int> v;\\n};\\n\\nstruct dealer{\\n int sell;\\n int buy;\\n};\\n\\n#define SELL 0\\n#define BUY 1\\n\\nint minimumValue(const vector<int> &v){\\n int ret = infty;\\n for(int i = 0; i < (int)v.size(); ++i) ret = min(ret, v[i] );\\n return ret;\\n}\\nint maximumValue(const vector<int> &v){\\n int ret = 0;\\n for(int i = 0; i < (int)v.size(); ++i) ret = max(ret, v[i] );\\n return ret;\\n}\\nint meanValue(const vector<int> &v){\\n int sum = 0;\\n for(int i = 0; i < (int)v.size(); ++i)sum+=v[i];\\n return sum / v.size();\\n}\\n\\nint main()\\n{\\n while(true){\\n int records;\\n cin >> records;\\n if(records==0)break;\\n vector<order> os;\\n map<string,item> items;\\n map<string,dealer> dealers;\\n bool dealed[records];\\n for(int i = 0; i < records; ++i){\\n order o;\\n cin >> o.who >> o.does >> o.item >> o.val;\\n items[o.item] = item();\\n dealers[o.who] = dealer();\\n os.push_back(o);\\n dealed[i] = false;\\n }\\n for(int i = 0; i < (int)os.size(); ++i){\\n int max_deal_val = 0;\\n int min_deal_val = infty;\\n int anti_dealer = infty;\\n for(int j = i-1; j >= 0; --j){\\n\\tif( os[j].who != os[i].who && os[j].does != os[i].does && os[j].item == os[i].item &&\\n\\t !dealed[i] && !dealed[j] ){\\n\\t if( os[i].does == \\\"SELL\\\" ){\\n\\t if( os[i].val <= os[j].val ){\\n\\t if( os[j].val > max_deal_val ){\\n\\t\\tmax_deal_val = os[j].val;\\n\\t\\tanti_dealer = j;\\n\\t }else if( os[j].val == max_deal_val ){\\n\\t\\tanti_dealer = min( anti_dealer, j );\\n\\t }\\n\\t }\\n\\t }else{\\n\\t if( os[j].val <= os[i].val ){\\n\\t if( os[j].val < min_deal_val ){\\n\\t\\tmin_deal_val = os[j].val;\\n\\t\\tanti_dealer = j;\\n\\t }else if( os[j].val == min_deal_val ){\\n\\t\\tanti_dealer = min( anti_dealer, j );\\n\\t }\\n\\t }\\n\\t }\\n\\t}\\n }\\n if( anti_dealer < infty ){\\n\\t// deal occured\\n\\tdealed[i] = true;\\n\\tdealed[anti_dealer] = true;\\n\\tint deal_val = (os[anti_dealer].val + os[i].val) /2;\\n\\titems[ os[i].item ].v.push_back( deal_val );\\n\\tif( os[i].does == \\\"SELL\\\" ){\\n\\t dealers[ os[i].who ].sell += deal_val;\\n\\t dealers[ os[anti_dealer].who ].buy += deal_val;\\n\\t}else{\\n\\t dealers[ os[i].who ].buy += deal_val;\\n\\t dealers[ os[anti_dealer].who ].sell += deal_val;\\n\\t}\\n }\\n }\\n\\n for(map<string,item>::iterator it = items.begin(); it != items.end(); ++it){\\n if( it->second.v.size() > 0 ){\\n\\tint minv = minimumValue( it->second.v );\\n\\tint maxv = maximumValue( it->second.v );\\n\\tint avgv = meanValue( it->second.v );\\n\\tcout << it->first << ' ' << minv << ' ' << avgv << ' ' << maxv << endl;\\n }\\n }\\n cout << \\\"--\\\" << endl;\\n for(map<string,dealer>::iterator it = dealers.begin(); it != dealers.end(); ++it){\\n cout << it->first << ' ' << it->second.buy << ' ' << it->second.sell << endl;\\n }\\n cout << \\\"----------\\\" << endl;\\n \\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 0,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":685,"cells":{"group_id":{"kind":"string","value":"aoj_1222_cpp"},"problem_description":{"kind":"string","value":"Problem G:\nTelescope\nDr. Extreme experimentally made an extremely precise telescope to investigate extremely curi- ous phenomena at an extremely distant place. In order to make the telescope so precise as to investigate phenomena at such an extremely distant place, even quite a small distortion is not allowed. However, he forgot the influence of the internal gas affected by low-frequency vibration of magnetic flux passing through the telescope. The cylinder of the telescope is not affected by the low-frequency vibration, but the internal gas is.\nThe cross section of the telescope forms a perfect circle. If he forms a coil by putting extremely thin wire along the (inner) circumference, he can measure (the average vertical component of) the temporal variation of magnetic flux:such measurement would be useful to estimate the influence. But points on the circumference at which the wire can be fixed are limited; furthermore, the number of special clips to fix the wire is also limited. To obtain the highest sensitivity, he wishes to form a coil of a polygon shape with the largest area by stringing the wire among carefully selected points on the circumference.\nYour job is to write a program which reports the maximum area of all possible\nm\n-polygons (polygons with exactly\nm\nvertices) each of whose vertices is one of the\nn\npoints given on a circumference with a radius of 1. An example of the case\nn\n= 4 and\nm\n= 3 is illustrated below.\nIn the figure above, the equations such as \"\np\n1\n= 0.0\" indicate the locations of the\nn\ngiven points, and the decimals such as \"1.000000\" on\nm\n-polygons indicate the areas of\nm\n-polygons.\nParameter\np\ni\ndenotes the location of the\ni\n-th given point on the circumference (1 ≤\ni\n≤\nn\n). The location\np\nof a point on the circumference is in the range 0 ≤\np\n< 1, corresponding to the range of rotation angles from 0 to 2\nπ\nradians. That is, the rotation angle of a point at\np\nto the point at 0 equals 2\nπ\nradians. (\nπ\nis the circular constant 3.14159265358979323846....)\nYou may rely on the fact that the area of an isosceles triangle ABC (AB = AC = 1) with an interior angle BAC of\nα\nradians (0 <\nα\n<\nπ\n) is (1/2)sin\nα\n, and the area of a polygon inside a circle with a radius of 1 is less than\nπ\n.\nInput\nThe input consists of multiple subproblems followed by a line containing two zeros that indicates the end of the input. Each subproblem is given in the following format.\nn m\np\n1\np\n2\n...\np\nn\nn\nis the number of points on the circumference (3 ≤\nn\n≤ 40).\nm\nis the number of vertices to form\nm\n-polygons (3 ≤\nm\n≤\nn\n). The locations of\nn\npoints,\np\n1\n,\np\n2\n,...,\np\nn\n, are given as decimals and they are separated by either a space character or a newline. In addition, you may assume that 0 ≤\np\n1\n<\np\n2\n< ... <\np\nn\n< 1.\nOutput\nFor each subproblem, the maximum area should be output, each in a separate line. Each value in the output may not have an error greater than 0.000001 and its fractional part should be represented by 6 decimal digits after the decim\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1222_3709885","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\n// #define int ll\nusing PII = pair<ll, ll>;\n\n#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define ALL(x) x.begin(), x.end()\n\ntemplate<typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }\ntemplate<typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }\ntemplate<typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }\ntemplate<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }\n\ntemplate<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }\ntemplate<typename T,typename... Ts>\nauto make_v(size_t a,Ts... ts) {\n return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));\n}\ntemplate<typename T,typename V> typename enable_if<is_class<T>::value==0>::type\nfill_v(T &t, const V &v) { t=v; }\ntemplate<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type\nfill_v(T &t, const V &v ) { for(auto &e:t) fill_v(e,v); }\n\ntemplate<class S,class T>\nostream &operator <<(ostream& out,const pair<S,T>& a) {\n out<<'('<<a.first<<','<<a.second<<')'; return out;\n}\ntemplate<class T>\nostream &operator <<(ostream& out,const vector<T>& a){\n out<<'[';\n for(const T &i: a) out<<i<<',';\n out<<']';\n return out;\n}\ntemplate<class T>\nostream &operator <<(ostream& out, const set<T>& a) {\n out<<'{';\n for(const T &i: a) out<<i<<',';\n out<<'}';\n return out;\n}\ntemplate<class T, class S>\nostream &operator <<(ostream& out, const map<T,S>& a) {\n out<<'{';\n for(auto &i: a) out<<i<<',';\n out<<'}';\n return out;\n}\n\nint dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; // DRUL\nconst int INF = 1<<30;\nconst ll LLINF = 1LL<<60;\nconst ll MOD = 1000000007;\n\nusing R = double;\nR x[41][41][41], dp[41][41][41], area[41][41][41];\nsigned main(void)\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n constexpr R PI = acos(-1);\n\n while(1) {\n ll n, m;\n cin >> n >> m;\n if(!n) break;\n vector<R> p(n);\n REP(i, n) cin >> p[i], p[i] *= 2*PI;\n\n REP(i, n) FOR(j, i, n) FOR(k, j, n) {\n area[i][j][k] = (sin(p[j]-p[i]) + sin(p[k]-p[j]) + sin(p[i]-p[k]))/2;\n }\n\n REP(i, 41) REP(j, 41) REP(k, 41) dp[i][j][k] = -LLINF;\n REP(i, 41) REP(j, 41) dp[i][j][2] = 0;\n\n R ans = -LLINF;\n REP(l, n) FOR(cnt, 2, m) FOR(r, l+1, n) FOR(i, r+1, n) {\n if(dp[l][r][cnt] == -LLINF) continue;\n chmax(dp[l][i][cnt+1], dp[l][r][cnt] + area[l][r][i]);\n if(cnt+1 <= m) chmax(ans, dp[l][i][cnt+1]);\n }\n\n cout << fixed << setprecision(6) << ans << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":4548,"score_of_the_acc":-0.1548,"final_rank":8},{"submission_id":"aoj_1222_3709729","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\n// #define int ll\nusing PII = pair<ll, ll>;\n\n#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define ALL(x) x.begin(), x.end()\n\ntemplate<typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }\ntemplate<typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }\ntemplate<typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }\ntemplate<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }\n\ntemplate<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }\ntemplate<typename T,typename... Ts>\nauto make_v(size_t a,Ts... ts) {\n return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));\n}\ntemplate<typename T,typename V> typename enable_if<is_class<T>::value==0>::type\nfill_v(T &t, const V &v) { t=v; }\ntemplate<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type\nfill_v(T &t, const V &v ) { for(auto &e:t) fill_v(e,v); }\n\ntemplate<class S,class T>\nostream &operator <<(ostream& out,const pair<S,T>& a) {\n out<<'('<<a.first<<','<<a.second<<')'; return out;\n}\ntemplate<class T>\nostream &operator <<(ostream& out,const vector<T>& a){\n out<<'[';\n for(const T &i: a) out<<i<<',';\n out<<']';\n return out;\n}\ntemplate<class T>\nostream &operator <<(ostream& out, const set<T>& a) {\n out<<'{';\n for(const T &i: a) out<<i<<',';\n out<<'}';\n return out;\n}\ntemplate<class T, class S>\nostream &operator <<(ostream& out, const map<T,S>& a) {\n out<<'{';\n for(auto &i: a) out<<i<<',';\n out<<'}';\n return out;\n}\n\nint dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; // DRUL\nconst int INF = 1<<30;\nconst ll LLINF = 1LL<<60;\nconst ll MOD = 1000000007;\n\nusing R = double;\nR x[41][41][41], dp[41][41][41], area[41][41][41];\nsigned main(void)\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n constexpr R PI = acos(-1);\n\n while(1) {\n ll n, m;\n cin >> n >> m;\n if(!n) break;\n vector<R> p(n);\n REP(i, n) cin >> p[i], p[i] *= 2*PI;\n\n REP(i, n) FOR(j, i, n) FOR(k, j, n) {\n area[i][j][k] = (sin(p[j]-p[i]) + sin(p[k]-p[j]) + sin(p[i]-p[k]))/2;\n }\n\n REP(i, 41) REP(j, 41) REP(k, 41) dp[i][j][k] = -LLINF;\n REP(i, 41) REP(j, 41) dp[i][j][2] = 0;\n\n R ans = -LLINF;\n REP(sp, n) FOR(cnt, 2, m) FOR(lp, sp+1, n) FOR(np, lp+1, n) {\n if(dp[sp][lp][cnt] == -LLINF) continue;\n chmax(dp[sp][np][cnt+1], dp[sp][lp][cnt] + area[sp][lp][np]);\n if(cnt+1 <= m) chmax(ans, dp[sp][np][cnt+1]);\n }\n\n cout << fixed << setprecision(6) << ans << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":4536,"score_of_the_acc":-0.1543,"final_rank":7},{"submission_id":"aoj_1222_3699589","code_snippet":"#include <iostream>\n#include <vector>\n#include <complex>\n#include <cmath>\nusing namespace std;\nusing D = double;\nusing P = complex<D>;\nconstexpr D pi = acos(-1);\n\nD cross(const P &a, const P &b){ return a.real()*b.imag()-a.imag()*b.real();}\n\nint main(){\n int n, m;\n while(cin >> n >> m, n){\n vector<D> A(n);\n for(int i = 0; i < n; ++i){\n cin >> A[i];\n }\n D ans = 0;\n for(int i = 0; i < n; ++i){\n vector<vector<D>> dp(n,vector<D>(m+1,0));\n for(int j = i+1; j < n; ++j){\n for(int k = i+1; k < j; ++k){\n for(int l = 2; l < m; ++l){\n P a = polar(1.,2*pi*A[i]), b = polar(1.,2*pi*A[k]), c = polar(1.,2*pi*A[j]);\n D s = abs(cross(b-a,c-a))/2;\n dp[j][l+1] = max(dp[k][l] + s, dp[j][l+1]);\n if(l+1 == m) ans = max(ans,dp[j][l+1]);\n }\n }\n }\n }\n printf(\"%.6f\\n\",ans);\n }\n}","accuracy":1,"time_ms":290,"memory_kb":3632,"score_of_the_acc":-0.3345,"final_rank":14},{"submission_id":"aoj_1222_3644675","code_snippet":"#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<complex>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<utility>\n#include<cassert>\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef unsigned long long ul;\ntypedef unsigned int ui;\nconst ll mod = 998244353;\ntypedef long double ld;\ntypedef complex<ld> Point;\nconst ll INF = mod * mod;\ntypedef pair<int, int> P;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\nconst ld eps = 1e-8;\nconst ld pi = acos(-1.0);\ntypedef pair<ld, ld> LDP;\ntypedef pair<ll, ll> LP;\ntypedef vector<int> vec;\ntypedef vector<string> svec;\n\nbool eq(ld a, ld b) {\n\treturn (abs(a - b) < eps);\n}\n\nclass Line {\npublic:\n\tPoint a, b;\n};\nclass Circle {\npublic:\n\tPoint p; ld r;\n};\n\nld dot(Point a, Point b) {\n\treturn real(conj(a)*b);\n}\nld cross(Point a, Point b) {\n\treturn imag(conj(a)*b);\n}\nnamespace std {\n\tbool operator<(const Point &lhs, const Point &rhs) {\n\t\treturn lhs.real() == rhs.real() ? lhs.imag() < rhs.imag() : lhs.real() < rhs.real();\n\t}\n}\nPoint proj(Line l, Point p) {\n\tld t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + t * (l.a - l.b);\n}\n\nld dist_lp(Line l, Point p) {\n\treturn abs(p - proj(l, p));\n}\n\nint ccw(Point a, Point b, Point c) {\n\tb -= a; c -= a;\n\tif (cross(b, c) > eps)return 1;//a,b,cが反時計回り\n\tif (cross(b, c) < -eps)return -1;//a,b,cが時計回り\n\tif (dot(b, c) < 0)return 2;//c,a,bの順に一直線\n\tif (norm(b) < norm(c))return -2;//a,b,cの順に一直線\n\treturn 0;//a,c,bの順に一直線\n}\nbool isis_ll(Line l, Line m) {\n\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\n}\nPoint is_ll(Line s, Line t) {\n\tPoint sv = s.b - s.a; Point tv = t.b - t.a;\n\treturn s.a + sv * cross(tv, t.a - s.a) / cross(tv, sv);\n}\n\n//直線lに幅dをつける\nvector<Line> make_w(Line l, ld d) {\n\tPoint dif = l.b - l.a;\n\tdif = dif*Point{0, 1};\n\tdif = dif * (d / abs(dif));\n\tvector<Line> ret;\n\tfor (int id = 1; id >= -1; id -= 2) {\n\t\tPoint a = l.a + dif * (ld)id;\n\t\tPoint b = l.b + dif * (ld)id;\n\t\tret.push_back({ a,b });\n\t}\n\treturn ret;\n}\n\ntypedef vector<Point> polygon;\npolygon ConvexHull(polygon p) {\n\tint n = p.size();\n\tint k = 0;\n\tsort(p.begin(), p.end());\n\tpolygon ch(2 * n);\n\tfor (int i = 0; i < n; ch[k++] = p[i++]) {\n\t\twhile (k >= 2 && ccw(ch[k - 2], ch[k - 1], p[i]) <= 0)--k;\n\t}\n\tfor (int i = n - 2, t = k + 1; i >= 0; ch[k++] = p[i--]) {\n\t\twhile (k >= t && ccw(ch[k - 2], ch[k - 1], p[i]) <= 0)--k;\n\t}\n\tch.resize(k - 1);\n\treturn ch;\n}\npolygon convex_cut(const polygon &p, Line l) {\n\tvector<Point> ret;\n\trep(i, p.size()) {\n\t\tPoint a = p[i], b = p[(i + 1) % p.size()];\n\t\tif (ccw(l.a, l.b, a) != -1)ret.push_back(a);\n\t\tif (ccw(l.a, l.b, a)*ccw(l.a, l.b, b)<0) {\n\t\t\tret.push_back(is_ll({ a,b }, l));\n\t\t}\n\t}\n\treturn ret;\n}\nld area(const polygon &p){\n\tld ret = 0;\n\tint n = p.size();\n\trep(j, n)ret += cross(p[j], p[(j + 1) % n]);\n\treturn ret / 2.0;\n}\nld max_distance(const polygon &p) {\n\t//assert(p.size()>1);\n\tpolygon g = ConvexHull(p);\n\tint n = g.size(), a = 0, b = 1;\n\tld ret = abs(g[0] - g[1]);\n\twhile (a < n) {\n\t\tPoint p1 = g[a%n], p2 = g[(a + 1) % n];\n\t\tPoint q1 = g[b%n], q2 = g[(b + 1) % n];\n\t\tif (arg((p2 - p1) / (q1 - q2)) > 0)++b; else ++a;\n\t\tret = max(ret, abs(p1 - q1));\n\t}\n\treturn ret;\n}\n\nvector<Point> is_cc(Circle c1, Circle c2) {\n\tvector<Point> res;\n\tld d = abs(c1.p - c2.p);\n\tld rc = (d*d + c1.r*c1.r - c2.r*c2.r) / (2 * d);\n\tld dfr = c1.r*c1.r - rc * rc;\n\tif (abs(dfr) < eps)dfr = 0.0;\n\tif (dfr < 0.0)return res;\n\tld rs = sqrt(dfr);\n\tPoint diff = (c2.p - c1.p) / d;\n\tres.push_back(c1.p + diff * Point(rc, rs));\n\tif (dfr != 0.0)res.push_back(c1.p + diff * Point(rc, -rs));\n\treturn res;\n}\nbool in_Circle(Circle a, Circle b) {\n\tld dist = abs(b.p - a.p);\n\treturn dist < b.r - a.r+eps;\n}\n\nld calc(ld t) {\n\tld theta = pi*t;\n\treturn sin(theta)*cos(theta);\n}\nint n, m;\nvoid solve() {\n\tvector<ld> p(n);\n\trep(i, n)cin >> p[i];\n\tld ans = -mod;\n\trep(i, n) {\n\t\tvector<vector<ld>> dp(n);\n\t\trep(j, n)dp[j].resize(m,-mod);\n\t\tdp[0][0] = 0;\n\t\trep1(j, n - 1) {\n\t\t\tint id = (i + j)%n;\n\t\t\trep(k, j) {\n\t\t\t\tint pid = (i + k) % n;\n\t\t\t\trep(l, m-1) {\n\t\t\t\t\tld dif = p[id] - p[pid];\n\t\t\t\t\tif (dif < 0)dif += 1;\n\t\t\t\t\tdp[j][l + 1] = max(dp[j][l + 1], dp[k][l] + calc(dif));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\trep(j, n) {\n\t\t\tint id = (i + j) % n;\n\t\t\tld dif = p[i] - p[id];\n\t\t\tif (dif < 0)dif += 1;\n\t\t\tld sum = calc(dif) + dp[j][m - 1];\n\t\t\tans = max(ans, sum);\n\t\t\t/*if (sum > 0.731010) {\n\t\t\t\tcout << i << \" \" << j << \" \" << dp[j][m-1]<<\" \"<<calc(dif) << endl;\n\t\t\t}*/\n\t\t}\n\t}\n\tcout << ans << endl;\n\t//cout << calc(0.24) << endl;\n\t/*rep(i, 40) {\n\t\tld u = 0.002*i;\n\t\t\tcout << u << \" \" << calc(u) << endl;\n\t}*/\n}\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\tcout << fixed << setprecision(6);\n\tint t = 1;\n\twhile (cin >> n>>m, n) {\n\t\tsolve();\n\t}\n\t//solve();\n\t//stop\n\treturn 0;\n}","accuracy":1,"time_ms":1050,"memory_kb":3564,"score_of_the_acc":-0.9755,"final_rank":18},{"submission_id":"aoj_1222_3641949","code_snippet":"#include<iomanip>\n#include<limits>\n#include<thread>\n#include<utility>\n#include<iostream>\n#include<string>\n#include<algorithm>\n#include<set>\n#include<map>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<cmath>\n#include<numeric>\n#include<cassert>\n#include<random>\n#include<chrono>\n#include<unordered_set>\n#include<unordered_map>\n#include<fstream>\n#include<list>\n#include<functional>\n#include<bitset>\n#include<complex>\n#include<tuple>\nusing namespace std;\ntypedef unsigned long long int ull;\ntypedef long long int ll;\ntypedef pair<ll,ll> pll;\ntypedef long double D;\ntypedef complex<D> P;\n#define F first\n#define S second\nconst ll E=1e18+7;\nconst ll MOD=1000000007;\n\n\ntemplate<typename T,typename U>istream & operator >> (istream &i,pair<T,U> &A){i>>A.F>>A.S; return i;}\ntemplate<typename T>istream & operator >> (istream &i,vector<T> &A){for(auto &I:A){i>>I;} return i;}\ntemplate<typename T,typename U>ostream & operator << (ostream &o,pair<T,U> &A){o<<A.F<<\" \"<<A.S; return o;}\ntemplate<typename T>ostream & operator << (ostream &o,vector<T> &A){ll i=A.size(); for(auto &I:A){o<<I<<(--i?\" \":\"\");} return o;}\ntemplate<typename T>vector<T> & cset(vector<T> &A,T e=T()){for(auto &I:A){I=e;} return A;}\n\nnamespace Geometry{\n typedef long double D;\n typedef complex<long double> P;\n typedef pair<P,D> C;\n \n const D EPS=1e-9;\n const D PI=asin(1)*2;\n const D INF=1e18;\n \n const static bool comp(const P &p1,const P &p2){return p1.real()==p2.real()?p1.imag()<p2.imag():p1.real()<p2.real();}\n \n D dot(P p1,P p2){return p1.real()*p2.real()+p1.imag()*p2.imag();}\n \n D cross(P p1,P p2){return p1.real()*p2.imag()-p1.imag()*p2.real();}\n \n P project(P vec,P x){return vec*(x/vec).real();}\n \n P project(P p1,P p2,P x){return p1+project(p2-p1,x-p1);}\n \n P reflect(P vec,P x){return vec*conj(x/vec);}\n \n P reflect(P p1,P p2,P x){return p1+reflect(p2-p1,x-p1);}\n \n bool intersectSL(P p1,P p2,P vec){vec/=abs(vec); p1/=vec; p2/=vec; return (p1.imag()<EPS && p2.imag()>-EPS) || (p1.imag()>-EPS && p2.imag()<EPS);}\n \n bool intersectSL(P p1,P p2,P p3,P p4){return intersectSL(p1-p4,p2-p4,p3-p4);}\n \n bool intersectSS(P p1,P p2,P p3,P p4){return (dot(p2-p1,p3-p1)<-EPS && dot(p2-p1,p4-p1)<-EPS) || (dot(p1-p2,p3-p2)<-EPS && dot(p1-p2,p4-p2)<-EPS)?false:intersectSL(p1,p2,p3,p4) && intersectSL(p3,p4,p1,p2);}\n \n D distLP(P vec,P x){return abs((x/vec).imag())*abs(vec);}\n \n D distLP(P p1,P p2,P x){return distLP(p2-p1,x-p1);}\n \n D distSP(P p1,P p2,P x){return dot(p2-p1,x-p1)<-EPS?abs(x-p1):dot(p1-p2,x-p2)<-EPS?abs(x-p2):distLP(p1,p2,x);}\n \n D distSS(P p1,P p2,P p3,P p4){return intersectSS(p1,p2,p3,p4)?0.0:min(min(distSP(p1,p2,p3),distSP(p1,p2,p4)),min(distSP(p3,p4,p1),distSP(p3,p4,p2)));}\n \n P crosspointLL(P p1,P p2,P vec){return abs(cross(p2-p1,vec))<EPS?vec:vec*cross(p2-p1,p2)/cross(p2-p1,vec);}\n \n P crosspointLL(P p1,P p2,P p3,P p4){return p4+crosspointLL(p1-p4,p2-p4,p3-p4);}\n \n P crosspointSS(P p1,P p2,P p3,P p4){return distSP(p1,p2,p3)<EPS?p3:distSP(p1,p2,p4)<EPS?p4:crosspointLL(p1,p2,p3,p4);}\n \n bool intersectShL(P p1,P p2,P vec){vec/=abs(vec); return intersectSL(p1,p2,vec) && crosspointLL(p1/vec,p2/vec,vec/vec).real()>-EPS;}\n \n bool intersectShL(P p1,P p2,P p3,P p4){return intersectShL(p1-p3,p2-p3,p4-p3);}\n \n //1::in,0::on edge,-1::out\n int contain(const vector<P> &poly,const P &p){\n vector<P> A={{65537,96847},{-24061,6701},{56369,-86509},{-93763,-78049},{56957,10007}};\n vector<bool> cnt(5,false);\n for(int i=1;i<=poly.size();i++){\n if(distSP(poly[i-1],poly[i%poly.size()],p)<EPS){return 0;}\n for(int j=0;j<5;j++){\n if(intersectShL(poly[i-1],poly[i%poly.size()],p,p+A[j])){cnt[j]=!cnt[j];}\n }\n }\n int in=0;\n for(int j=0;j<5;j++){if(cnt[j]){in++;}}\n return in>=3?1:-1;\n }\n \n vector<P> convexcut(const vector<P> &poly,P p1,P p2){\n vector<P> ret;\n for(int i=1;i<=poly.size();i++){\n if(cross(p2-p1,poly[i-1]-p1)>-EPS){ret.push_back(poly[i-1]);}\n if(intersectSL(poly[i-1],poly[i%poly.size()],p1,p2) && distLP(p1,p2,poly[i-1])>EPS && distLP(p1,p2,poly[i%poly.size()])>EPS){ret.push_back(crosspointLL(poly[i-1],poly[i%poly.size()],p1,p2));}\n }\n return ret;\n }\n \n D area(const vector<P> &poly){\n D ans=0;\n for(int i=2;i<poly.size();i++){ans+=cross(poly[i-1]-poly[0],poly[i]-poly[0]);}\n return abs(ans)/2;\n }\n \n vector<P> convexhull(vector<P> pts){\n vector<P> ret;\n sort(pts.begin(),pts.end(),comp);\n for(auto &I:pts){\n if(!ret.empty() && I==ret.back()){continue;}\n while(ret.size()>=2 && cross(ret.back()-ret[ret.size()-2],I-ret.back())<-EPS){ret.pop_back();}\n ret.push_back(I);\n }\n reverse(pts.begin(),pts.end());\n for(auto &I:pts){\n if(!ret.empty() && I==ret.back()){continue;}\n while(ret.size()>=2 && cross(ret.back()-ret[ret.size()-2],I-ret.back())<-EPS){ret.pop_back();}\n ret.push_back(I);\n }\n if(ret[0]==ret.back()){ret.pop_back();}\n return ret;\n }\n \n //4::seperate,3::circumscribe,2::intersect,1::inscribe,0::contain,-1::same\n int intersectCC(C c1,C c2){\n D d=abs(c1.F-c2.F),r=c1.S+c2.S,dif=abs(c2.S-c1.S);\n if(d<EPS && dif<EPS){return -1;}\n if(d-r>EPS){return 4;}\n if(d-r>-EPS){return 3;}\n if(d-dif>EPS){return 2;}\n if(d-dif>-EPS){return 1;}\n return 0;\n }\n \n vector<P> crosspointLC(P p1,P p2,C c){\n vector<P> ret;\n P pr=project(p1,p2,c.F);\n D d=distLP(p1,p2,c.F);\n if(d-c.S>EPS){return ret;}\n if(d-c.S>-EPS){ret.push_back(pr); return ret;}\n P vec=p2-p1; vec*=sqrt(c.S*c.S-d*d)/abs(vec);\n ret.push_back(pr-vec);\n ret.push_back(pr+vec);\n return ret;\n }\n \n vector<P> crosspointSC(P p1,P p2,C c){\n vector<P> ret;\n for(auto &I:crosspointLC(p1,p2,c)){if(distSP(p1,p2,I)<EPS){ret.push_back(I);}}\n return ret;\n }\n \n vector<P> crosspointCC(C c1,C c2){\n vector<P> ret;\n P vec=c2.F-c1.F;\n D base=(c1.S*c1.S+norm(vec)-c2.S*c2.S)/(2*abs(vec));\n D h=sqrt(c1.S*c1.S-base*base);\n vec/=abs(vec);\n ret.push_back(c1.F+vec*P(base,-h));\n ret.push_back(c1.F+vec*P(base,h));\n return ret;\n }\n \n vector<P> tangentCP(C c,P p){return crosspointCC(c,C(p,sqrt(norm(c.F-p)-c.S*c.S)));}\n \n vector<pair<P,P>> tangentCC(C c1,C c2){\n vector<pair<P,P>> ret;\n P d=c2.F-c1.F;\n for(D i:{-1,1}){\n D r=c1.S+c2.S*i;\n if(intersectCC(c1,c2)>i+1){\n for(P s:{-1i,1i}){\n P p=r+s*sqrt(norm(d)-norm(r));\n ret.push_back({c1.F+d*c1.S/norm(d)*p,c2.F-d*i*c2.S/norm(d)*p});\n }\n }\n }\n return ret;\n }\n \n D area(const vector<P> &poly,C c){\n D ret=0;\n for(int i=0;i<poly.size();i++){\n P a=poly[i]-c.F,b=poly[(i+1)%poly.size()]-c.F;\n if(abs(a)<c.S+EPS && abs(b)<c.S+EPS){ret+=cross(a,b);}\n else{\n vector<P> A=crosspointSC(a,b,{0,c.S});\n if(A.empty()){ret+=c.S*c.S*arg(b/a);}\n else{\n ret+=(abs(a)<c.S?cross(a,A[0]):c.S*c.S*arg(A[0]/a));\n ret+=(abs(b)<c.S?cross(A.back(),b):c.S*c.S*arg(b/A.back()));\n ret+=cross(A[0],A.back());\n }\n }\n }\n return abs(ret)/2;\n }\n \n //反時計回り\n D diameter(const vector<P> &poly){\n D ret=0;\n ll l=0,r=0,n=poly.size();\n if(n==2){return abs(poly[0]-poly[1]);}\n for(int i=0;i<n;i++){\n if(comp(poly[l],poly[i])){l=i;}\n if(comp(poly[i],poly[r])){r=i;}\n }\n ll sl=r,sr=l;\n while(sl!=l || sr!=r){\n ret=max(ret,abs(poly[r]-poly[l]));\n if(cross(poly[(l+1)%n]-poly[l],poly[(r+1)%n]-poly[r])<0){(++l)%=n;}\n else{(++r)%=n;}\n }\n return ret;\n }\n \n D closestpair(vector<P> pt){\n sort(pt.begin(),pt.end(),comp);\n D ret=INF;\n for(ll i=1;i<pt.size();i<<=1){\n for(ll j=0;i+j<pt.size();j+=i*2){\n ll m=i+j;\n vector<P> R;\n D l=-INF,r=INF;\n for(ll k=j;k<m;k++){l=max(l,pt[k].real());}\n for(ll k=0;m+k<pt.size() && k<i;k++){r=min(r,pt[m+k].real());}\n for(ll k=0;m+k<pt.size() && k<i;k++){if(pt[m+k].real()-l<ret){R.push_back(pt[m+k]);}}\n ll idx=0;\n for(ll k=j;k<m;k++){\n if(r-pt[k].real()>ret){continue;}\n while(idx<R.size() && pt[k].imag()-R[idx].imag()>ret){idx++;}\n for(ll n=idx;n<R.size() && R[n].imag()-pt[k].imag()<ret;n++){ret=min(ret,abs(R[n]-pt[k]));}\n }\n inplace_merge(pt.begin()+j,pt.begin()+m,j+i*2<pt.size()?pt.begin()+j+2*i:pt.end(),[](const P &a,const P &b){return a.imag()==b.imag()?a.real()<b.real():a.imag()<b.imag();});\n }\n }\n return ret;\n }\n \n istream & operator >> (istream &i,P &p){D x,y; i>>x>>y; p={x,y}; return i;}\n istream & operator >> (istream &i,C &p){D x,y; i>>x>>y>>p.S; p.F={x,y}; return i;}\n};\n\nusing namespace Geometry;\n\n\nD cul(const vector<P> &A,ll s,ll n,ll m){\n vector<vector<D>> dp(n,vector<D>(m,-E));\n dp[s][0]=0;\n for(ll i=s+1;i<n;i++){\n for(int j=1;j<m;j++){\n for(int k=0;k<i;k++){dp[i][j]=max(dp[i][j],dp[k][j-1]+cross(A[k],A[i]));}\n }\n }\n D ret=-E;\n for(ll i=s+1;i<n;i++){ret=max(ret,dp[i].back()+cross(A[i],A[s]));}\n return ret;\n}\n\n\nint main(){\n ll n,m;\n while(cin>>n>>m,n){\n vector<D> R(n);\n cin>>R;\n vector<P> A(n);\n for(int i=0;i<n;i++){A[i]=polar((D)1,R[i]*2*PI);}\n D ret=0;\n for(int i=0;i<n;i++){ret=max(ret,cul(A,i,n,m));}\n cout<<fixed<<setprecision(6)<<ret/2<<endl;\n }\n \n \n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3632,"score_of_the_acc":-0.1141,"final_rank":4},{"submission_id":"aoj_1222_3047541","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <complex>\n#include <iomanip>\n#include <cmath>\nusing namespace std;\nconst double EPS = 1e-8;\nconst double INF = 1e18;\nconst double PI = acos(-1);\ntypedef complex<double> P;\ntypedef vector<P> VP;\n#define X real()\n#define Y imag()\n\ndouble cross(P a, P b){\n return (conj(a)*b).Y;\n}\ndouble gettriarea(P a, P b, P c){\n return abs(cross(b-a, c-a)) /2;\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 d;\n cin >> d;\n p[i] = P(1, 0) *P(cos(d*2*PI), sin(d*2*PI));\n }\n double ans = 0;\n for(int sp=0; sp<n; sp++){\n p.push_back(p[0]);\n p.erase(p.begin());\n vector<vector<double> > dp(n+1, vector<double>(n+1, 0));\n for(int cp=2; cp<n; cp++){\n for(int cn=3; cn<=cp +1; cn++){\n for(int lp=cn-2; lp<cp; lp++){\n dp[cp][cn] = max(dp[cp][cn], dp[lp][cn-1] +gettriarea(p[0], p[lp], p[cp]));\n }\n }\n }\n for(int i=0; i<n; i++){\n ans = max(ans, dp[i][m]);\n }\n }\n cout << fixed << setprecision(6);\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3488,"score_of_the_acc":-0.1077,"final_rank":3},{"submission_id":"aoj_1222_2669299","code_snippet":"#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\nusing ld = long double;\nconst ld eps = 1e-9;\nconst ld pi=acos(-1.0);\n\nld solve(int N, int M, vector<ld>ps) {\n\tvector<vector<vector<ld>>>dp(N+1,vector<vector<ld>>(M+1,vector<ld>(N,-1e8)));\n\tdp[1][1][0]=0;\n\tfor (int now = 1; now < N; ++now) {\n\t\tfor (int used_cnt = 0; used_cnt <= M; ++used_cnt) {\n\t\t\tfor (int pre_use_id = 0; pre_use_id < now; ++pre_use_id) {\n\t\t\t\tdp[now+1][used_cnt][pre_use_id]=max(dp[now+1][used_cnt][pre_use_id],\n\t\t\t\t\tdp[now][used_cnt][pre_use_id]);\n\n\t\t\t\tif (used_cnt != M) {\n\n\t\t\t\t\tld plus = 0.5*(sin(2 * pi*(ps[now] - ps[pre_use_id])));\n\t\t\t\t\tdp[now + 1][used_cnt + 1][now] = max(\n\t\t\t\t\t\tdp[now + 1][used_cnt + 1][now],\n\t\t\t\t\t\tdp[now][used_cnt][pre_use_id] + plus);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tld ans=0;\n\tfor (int pre_use_id = 0; pre_use_id < N; ++pre_use_id) {\n\n\t\tld plus = 0.5*(sin(2 * pi*(ps[0] - ps[pre_use_id])));\n\t\tans=max(ans,dp[N][M][pre_use_id]+plus);\n\t}\n\treturn ans;\n}\n\nint main() {\n\twhile (true) {\n\t\tint N, M; cin >> N >> M;\n\t\tif(!N)break;\n\t\tvector<ld>ps;\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tld theta; cin >> theta;\n\t\t\tps.push_back(theta);\n\t\t}\n\n\t\tld ans = 0;\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\trotate(ps.begin(), ps.begin() + 1, ps.end());\n\t\t\tans = max(ans, solve(N, M, ps));\n\t\t}\n\t\tcout<<setprecision(6)<<fixed<<ans<<endl;\n\t}\n\t\n\n\treturn 0;\n}","accuracy":1,"time_ms":1200,"memory_kb":3768,"score_of_the_acc":-1.1117,"final_rank":20},{"submission_id":"aoj_1222_2599425","code_snippet":"#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\n#include <time.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\nstruct Point{\n\tdouble x,y;\n};\n\nint N,M;\n\nPoint point[40];\ndouble dp[40][40][41];\n\ndouble calc(int start,int last,int next){\n return fabs((point[start].x*point[last].y-point[last].x*point[start].y)+(point[last].x*point[next].y-point[next].x*point[last].y)+\n \t\t(point[next].x*point[start].y-point[start].x*point[next].y))/2;\n}\n\nvoid func(){\n\n\tdouble tmp;\n\n\tfor(int i = 0; i < N; i++){\n\t\tscanf(\"%lf\",&tmp);\n\t\tpoint[i].x = cos(tmp*2.0*M_PI);\n\t\tpoint[i].y = sin(tmp*2.0*M_PI);\n\t}\n\n\tfor(int a = 0; a < 40; a++){\n\t\tfor(int b = 0; b < 40; b++){\n\t\t\tfor(int c = 0; c <= 40; c++)dp[a][b][c] = 0.0;\n\t\t}\n\t}\n\n\tdouble ans = 0.0;\n\n\tfor(int start = 0; start < N; start++){\n\t\tfor(int count = 2; count < M; count++){\n\t\t\tfor(int last = start; last < N; last++){\n\t\t\t\tfor(int next = last+1; next < N; next++){\n\t\t\t\t\tdp[start][next][count+1] = max(dp[start][next][count+1],dp[start][last][count]+calc(start,last,next));\n\n\t\t\t\t\tif(count+1 == M)ans = max(ans,dp[start][next][count+1]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"%.6lf\\n\",ans);\n}\n\nint main(){\n\n\twhile(true){\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}","accuracy":1,"time_ms":20,"memory_kb":4092,"score_of_the_acc":-0.1261,"final_rank":5},{"submission_id":"aoj_1222_2548402","code_snippet":"#include <bits/stdc++.h>\n \nusing namespace std;\n \n#define MAX_N 41\n \nconst double Pi = acos(-1);\n \ndouble getAngle(double p, double q) {\n // assert(p < q);\n \n return (p-q)*2*Pi;\n}\n \n#define eps 1e-8\n \ndouble getArea(double p, double q) {\n //cout<<getAngle(p,q)<<endl;\n //if(getAngle(p,q) > 0.5) return fabs(sin(1-getAngle(p, q))/2);\n return (sin(getAngle(p, q))/2);\n}\n \nint n, m;\ndouble p[MAX_N];\n \ndouble dp[MAX_N][MAX_N][MAX_N];\n \ndouble solve(int idx, int curr, int start) {\n if(idx == m) {\n //if((1+p[start]-p[curr])-0.5 > 0) return -getArea(p[curr], p[start]);\n return getArea(p[start], p[curr]);\n }\n if(curr+1 == n) return -1e9;\n double &res = dp[idx][curr][start];\n if(res != -1) return res;\n for(int i = curr+1; i < n; i++) {\n res = max(res, solve(idx+1, i, start) + getArea(p[i], p[curr]));\n }\n return res;\n}\n \nint main() {\n while(cin >> n >> m, n || m) {\n for(int i = 0; i < n; i++) cin >> p[i];\n \n double ans = 0;\n for(int i = 0; i < MAX_N; i++)\n for(int j = 0; j < MAX_N; j++)\n for(int k = 0; k < MAX_N; k++)\n dp[i][j][k] = -1;\n \n for(int i = 0; i < n; i++) {\n ans = max(ans, solve(1, i, i));\n }\n printf(\"%.6f\\n\", ans);\n }\n \n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":4004,"score_of_the_acc":-0.1561,"final_rank":11},{"submission_id":"aoj_1222_2548307","code_snippet":"#include<bits/stdc++.h>\n \nusing namespace std;\n \ntypedef complex<double> P;\n \nint n,m;\ndouble p[50];\n \ndouble cal(int a,int b,int c){\n \n double res;\n \n P s=P(cos(p[a]),sin(p[a])),t=P(cos(p[b]),sin(p[b])),u=P(cos(p[c]),sin(p[c]));\n \n double aa=abs(s-t),bb=abs(t-u),cc=abs(u-s);\n double ss=(aa+bb+cc)/2;\n \n res=sqrt(ss*(ss-aa)*(ss-bb)*(ss-cc));\n \n return res;\n}\n \nint main(){\n \n \n while(cin>>n>>m,n){\n \n for(int i=0;i<n;i++){\n cin>>p[i];\n p[i]*=2*M_PI;\n }\n \n double dp[50][50][50]={};\n \n for(int i=0;i<n;i++)\n for(int j=i+1;j<n;j++)\n for(int k=2;k<m;k++)\n for(int l=j+1;l<n;l++){\n dp[i][l][k+1]=max(dp[i][l][k+1],dp[i][j][k]+cal(i,j,l));\n }\n \n double ans=0;\n for(int i=0;i<n;i++)\n for(int j=i+1;j<n;j++)ans=max(ans,dp[i][j][m]);\n \n printf(\"%.6f\\n\",ans);\n \n }\n \n \n \n return 0;\n}","accuracy":1,"time_ms":410,"memory_kb":4560,"score_of_the_acc":-0.4774,"final_rank":15},{"submission_id":"aoj_1222_2547962","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define MAX_N 41\n\nconst double Pi = acos(-1);\n\ndouble getAngle(double p, double q) {\n // assert(p < q);\n \n return (p-q)*2*Pi;\n}\n\n#define eps 1e-8\n\ndouble getArea(double p, double q) {\n //cout<<getAngle(p,q)<<endl;\n //if(getAngle(p,q) > 0.5) return fabs(sin(1-getAngle(p, q))/2);\n return (sin(getAngle(p, q))/2);\n}\n\nint n, m;\ndouble p[MAX_N];\n\ndouble dp[MAX_N][MAX_N][MAX_N];\n\ndouble solve(int idx, int curr, int start) {\n if(idx == m) {\n //if((1+p[start]-p[curr])-0.5 > 0) return -getArea(p[curr], p[start]);\n return getArea(p[start], p[curr]);\n }\n if(curr+1 == n) return -1e9;\n double &res = dp[idx][curr][start];\n if(res != -1) return res;\n for(int i = curr+1; i < n; i++) {\n res = max(res, solve(idx+1, i, start) + getArea(p[i], p[curr]));\n }\n return res;\n}\n\nint main() {\n while(cin >> n >> m, n || m) {\n for(int i = 0; i < n; i++) cin >> p[i];\n\n double ans = 0;\n for(int i = 0; i < MAX_N; i++)\n for(int j = 0; j < MAX_N; j++)\n\tfor(int k = 0; k < MAX_N; k++)\n\t dp[i][j][k] = -1;\n \n for(int i = 0; i < n; i++) {\n ans = max(ans, solve(1, i, i));\n }\n printf(\"%.6f\\n\", ans);\n }\n \n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":4000,"score_of_the_acc":-0.1559,"final_rank":10},{"submission_id":"aoj_1222_2547866","code_snippet":"#include<bits/stdc++.h>\n\nusing namespace std;\n\ntypedef complex<double> P;\n\nint n,m;\ndouble p[50];\n\ndouble cal(int a,int b,int c){\n\n double res;\n\n P s=P(cos(p[a]),sin(p[a])),t=P(cos(p[b]),sin(p[b])),u=P(cos(p[c]),sin(p[c]));\n\n double aa=abs(s-t),bb=abs(t-u),cc=abs(u-s);\n double ss=(aa+bb+cc)/2;\n\n res=sqrt(ss*(ss-aa)*(ss-bb)*(ss-cc));\n\n return res;\n}\n\nint main(){\n\n\n while(cin>>n>>m,n){\n\n for(int i=0;i<n;i++){\n cin>>p[i];\n p[i]*=2*M_PI;\n }\n\n double dp[50][50][50]={};\n \n for(int i=0;i<n;i++)\n for(int j=i+1;j<n;j++)\n for(int k=2;k<m;k++)\n\tfor(int l=j+1;l<n;l++){\n\t dp[i][l][k+1]=max(dp[i][l][k+1],dp[i][j][k]+cal(i,j,l));\n\t}\n\n double ans=0;\n for(int i=0;i<n;i++)\n for(int j=i+1;j<n;j++)ans=max(ans,dp[i][j][m]);\n \n printf(\"%.6f\\n\",ans);\n \n }\n\n\n \n return 0;\n}","accuracy":1,"time_ms":410,"memory_kb":4572,"score_of_the_acc":-0.4779,"final_rank":16},{"submission_id":"aoj_1222_2340584","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define int long long\n#define all(v) begin(v), end(v)\n#define reps(i, m, n) for(int i = (int)(m); i < (int)(n); i++)\n#define rep(i, n) reps(i, 0, n)\n\ntemplate<class T1, class T2> void chmin(T1 &a, T2 b){if(a>b)a=b;}\ntemplate<class T1, class T2> void chmax(T1 &a, T2 b){if(a<b)a=b;}\n\nusing pint = pair<int, int>;\nusing tint = tuple<int, int, int>;\nusing vint = vector<int>;\n\nconst int inf = 1LL << 55;\nconst int mod = 1e9 + 7;\n\nint n, m;\ndouble p[88];\ndouble dp[44][44][44];\n\nconst double Pi = acos(-1);\ndouble area(int a, int b) {\n return sin((p[b]-p[a])*2*Pi)/2;\n}\n\ndouble solve(int fr, int la, int cnt) {\n if(cnt == m) return (la-fr < 0.5 ? -1 : 1)*area(la, n+fr);\n if(la == n-1) return -DBL_MAX/3;\n double &res = dp[fr][la][cnt];\n if(res != -DBL_MAX/3) return res;\n res = -DBL_MAX/5;\n reps(i, la+1, n) {\n chmax(res, solve(fr, i, cnt+1)+area(la, i));\n }\n return res;\n}\n\nsigned main()\n{\n cin.tie(0);\n ios_base::sync_with_stdio(0);\n cout << fixed << setprecision(6);\n\n while(cin >> n >> m, n || m) {\n rep(i, n) cin >> p[i];\n rep(i, n) p[n+i] = p[i]+1;\n rep(i, 44) rep(j, 44) rep(k, 44) dp[i][j][k] = -DBL_MAX/3;\n double ans = 0;\n rep(i, n) chmax(ans, solve(i, i, 1));\n cout << ans << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":4172,"score_of_the_acc":-0.1551,"final_rank":9},{"submission_id":"aoj_1222_2340418","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define int long long\nstruct Point{\n double x,y;\n Point(){}\n Point(double x,double y):x(x),y(y){}\n Point operator+(Point a){return Point(x+a.x,y+a.y);}\n Point operator-(Point a){return Point(x-a.x,y-a.y);}\n Point operator*(double k){return Point(x*k,y*k);}\n Point operator/(double k){return Point(x/k,y/k);}\n};\ntypedef Point Vector;\ntypedef vector<Point> Polygon;\ndouble norm(Point a){\n return a.x*a.x+a.y*a.y;\n}\ndouble abs(Point a){\n return sqrt(norm(a));\n}\ndouble dot(Point a,Point b){\n return a.x*b.x+a.y*b.y;\n}\ndouble cross(Point a,Point b){\n return a.x*b.y-a.y*b.x;\n}\nconst double PI=3.141592653589793238;\nPoint trans(double k){\n return Point(cos(k*2*PI),sin(k*2*PI));\n}\nint n,m;\nPolygon p;\ndouble dp[50][50][50];\ndouble dfs(int b,int c,int d){\n if(d==m) return 0;\n if(dp[b][c][d]>=0) return dp[b][c][d];\n double res=0;\n for(int a=c;a!=b;a=(a+1)%n){\n res=max(res,dfs(b,a,d+1)+abs(cross(p[a]-p[b],p[c]-p[b])));\n }\n return dp[b][c][d]=res;\n}\nsigned main(){\n while(cin>>n>>m,n||m){\n p.clear();\n p.resize(n);\n for(int i=0;i<n;i++){\n double k;\n cin>>k;\n p[i]=trans(k);\n //cout<<p[i].x<<\" \"<<p[i].y<<endl;\n }\n for(int i=0;i<50;i++)\n for(int j=0;j<50;j++)\n\tfor(int k=0;k<50;k++)\n\t dp[i][j][k]=-1;\n double ans=0;\n for(int i=0;i<n;i++){\n for(int j=0;j<n;j++){\n\tif(i==j) continue;\n\tans=max(ans,dfs(i,j,2));\n }\n }\n printf(\"%.6f\\n\",ans/2.0);\n }\n return 0;\n}","accuracy":1,"time_ms":160,"memory_kb":4396,"score_of_the_acc":-0.2582,"final_rank":13},{"submission_id":"aoj_1222_1977735","code_snippet":"#include <vector>\n#include <list>\n#include <map>\n#include <set>\n#include <queue>\n#include <deque>\n#include <stack>\n#include <algorithm>\n#include <functional>\n#include <numeric>\n#include <utility>\n#include <sstream>\n#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <cmath>\n#include <cstdlib>\n#include <cctype>\n#include <string>\n#include <cstring>\nusing namespace std;\n#define REP(i,n) for(int i = 0; i < (int)n; i++)\n#define FOR(i,a,b) for(int i = a; i < (int)b; i++)\n#define pb push_back\n#define mp make_pair\ntypedef vector<int> vi;\ntypedef pair<int, int> pi;\ntypedef long long ll;\nconst int INF = 1<<28;\nconst ll MOD = 1000000007;\nconst int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};\n\ndouble area(double a, double b, double c) {\n\treturn sin((b-a)*2*M_PI)/2 + sin((c-b)*2*M_PI)/2 + sin((a-c)*2*M_PI)/2;\n}\n\nint main() {\n\tios_base::sync_with_stdio(0);\n\tcin.tie(0);\n\n\tint n, m;\n\twhile(cin >> n >> m, n|m) {\n\t\tdouble dp[40][40][40] = {};\n\t\tdouble p[n];\n\t\tREP(i, n)\n\t\t\tcin >> p[i];\n\t\tREP(i, m-2) {\n\t\t\tREP(j, n-2) {\n\t\t\t\tFOR(k, j+2, n) {\n\t\t\t\t\tFOR(l, j+1, k) {\n\t\t\t\t\t\tif(i)\n\t\t\t\t\t\t\tdp[i][j][k] = max(dp[i][j][k], dp[i-1][j][l] + area(p[j], p[l], p[k]));\n\t\t\t\t\t\telse\n\t\t\t\t\t\t\tdp[i][j][k] = max(dp[i][j][k], area(p[j], p[l], p[k]));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tdouble ans = -1;\n\t\tREP(i, n) REP(j, n)\n\t\t\tans = max(ans, dp[m-3][i][j]);\n\t\tcout << fixed << setprecision(6) << ans << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":210,"memory_kb":1864,"score_of_the_acc":-0.188,"final_rank":12},{"submission_id":"aoj_1222_1876158","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define MAX 45\n#define PI acos(-1)\n#define INF (1<<29)\ntypedef pair<double, double> P;\n\nint N, M;\ndouble memo[MAX][MAX][MAX];\nvector<double> x, y;\n\ndouble area(int a, int b, int c)\n{\n vector<P> p(3);\n p[0] = P(x[a], y[a]);\n p[1] = P(x[b], y[b]);\n p[2] = P(x[c], y[c]); \n \n double res = 0;\n for (int i = 1; i < 4; i++) {\n\tres += (p[i%3].first - p[i-1].first) * (p[i%3].second + p[i-1].second);\n }\n res /= 2.0;\n return abs(res);\n}\n\ndouble get_max_area(int L, int R, int m)\n{\n if (m == M) {\n return 0;\n } \n double &res = memo[L][R][m];\n if (res != -1) {\n return res;\n }\n for (int i = R+1; i < N; i++) {\n res = max(res, get_max_area(L, i, m+1) + area(L, R, i));\n }\n return res;\n}\n\nint main()\n{\n double p;\n while (cin >> N >> M, N) {\n x.clear(); y.clear();\n x.resize(N); y.resize(N);\n for (int i = 0; i < N; i++) {\n cin >> p;\n p *= (2.0 * PI);\n x[i] = cos(p); y[i] = sin(p);\n }\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n for (int k = 0; k < N; k++) {\n memo[i][j][k] = -1;\n }\n }\n }\n\n double mx = 0;\n for (int i = 0; i < N; i++) {\n for (int j = i+1; j < N; j++) {\n for (int k = j+1; k < N; k++) {\n mx = max(mx, get_max_area(i, k, 3) + area(i, j, k));\n }\n }\n }\n printf(\"%.6f\\n\", mx);\n }\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":4076,"score_of_the_acc":-0.1508,"final_rank":6},{"submission_id":"aoj_1222_1751496","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define REP(i,a,b) for(int i=a;i<(int)b;i++)\n#define rep(i,n) REP(i,0,n)\n\n///double dp[44][44];\nvector<double> ps;\nint N, M;\n\ndouble const pi = acos(-1);\n\ndouble triangle(int s, int t, int k) {\n vector<int> idxs = {s, t, k};\n sort(idxs.begin(), idxs.end());\n\n double a = 2 * pi * ps[idxs[0]];\n double b = 2 * pi * ps[idxs[1]];\n double c = 2 * pi * ps[idxs[2]];\n\n double ba = b - a;\n double cb = c - b;\n double ac = a - c;\n\n while(ba < 0) { ba += 2 * pi; }\n while(cb < 0) { cb += 2 * pi; }\n while(ac < 0) { ac += 2 * pi; }\n\n return (sin(ba) + sin(cb) + sin(ac)) / 2.0;\n}\n\nint st;\nmap<pair<int, int>, double> mp;\n\ndouble dfs(int curr, int rem) {\n if(rem == 0) { return 0.0; }\n if(N + st - curr + 1 <= 1) { return -100000000; }\n if(mp.find({curr, rem}) != mp.end()) { return mp[{curr, rem}]; }\n auto& ret = mp[{curr, rem}];\n\n REP(i, curr + 1, N + st) {\n double d = triangle(st % N, curr % N, i % N);\n d += dfs(i, rem-1);\n ret = max(ret, d);\n }\n return ret;\n}\n\nint main() {\n\n for(;cin >> N >> M && (N|M);) {\n ps.clear();\n ps.resize(N);\n rep(i, N) cin >> ps[i];\n sort(ps.begin(), ps.end());\n double ans = -10000000000;\n rep(i, N) {\n mp.clear();\n st = i;\n ans = max(ans, dfs(i, M-1));\n }\n\n printf(\"%.6f\\n\", ans);\n\n }\n\n return 0;\n}","accuracy":1,"time_ms":720,"memory_kb":3592,"score_of_the_acc":-0.6971,"final_rank":17},{"submission_id":"aoj_1222_1751313","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef pair<double,double> P;\ndouble S(double a,double b,double c) {\n double s=(a+b+c)/2;\n return sqrt(s*(s-a)*(s-b)*(s-c));\n}\ndouble D(P a,P b) {\n return sqrt((a.first-b.first)*(a.first-b.first)+(a.second-b.second)*(a.second-b.second));\n}\ndouble calc(P a,P b, P c) {\n return S(D(a,b),D(a,c),D(b,c));\n}\n \ndouble toRad(double agl) {\n return agl*M_PI/180.0;\n}\nP Q(double e) {\n double w=toRad(360*e);\n return P(sin(w),cos(w));\n}\n\nint main() {\n int n,m;\n while(cin >> n >> m && n) {\n P p[n];\n for(int i=0; i<n; i++) {\n double x;\n cin >> x;\n p[i]=Q(x);\n }\n double ans=0;\n for(int i=0; i<n; i++) {\n double dp[n][m+1];\n for(int j=0;j<n;j++)for(int k=0;k<=m;k++)dp[j][k]=-1; \n for(int j=i+1; j<n; j++) dp[j][2]=0;\n for(int j=i+1; j<n; j++) {\n for(int k=2; k<m; k++) {\n if(dp[j][k]<0) continue;\n for(int l=j+1; l<n; l++) {\n dp[l][k+1]=max(dp[l][k+1],dp[j][k]+calc(p[i],p[j],p[l]));\n if(k+1==m) ans=max(ans,dp[l][k+1]);\n }\n }\n } \n }\n printf(\"%.6f\\n\",ans);\n }\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":1256,"score_of_the_acc":-0.0254,"final_rank":1},{"submission_id":"aoj_1222_1751304","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\ntypedef complex<double> P;\n\ndouble dp[41][41][41][41];\ndouble getA[41][41][41];\nint nx[41];\nconst double INF = 1e100;\n\ndouble cross( P a, P b ){ return a.real() * b.imag() - a.imag() * b.real(); }\n\nint N,M;\n\nP getpos(double p){\n double a = 2*M_PI*p;\n return P( cos(a), sin(a) );\n}\n\nvoid init(const vector<P> pos){\n for(int i=0;i<N;i++) nx[i] = (i+1)%N;\n for(int i=0;i<N;i++)\n for(int j=0;j<N;j++)\n for(int k=0;k<N;k++)\n for(int l=0;l<=M;l++)\n dp[i][j][k][l] = -1.0;\n\n for(int i=0;i<N;i++)\n for(int j=0;j<N;j++)\n for(int k=0;k<N;k++)\n getA[i][j][k] = cross( pos[j]-pos[i], pos[k]-pos[i] )/2.0;\n \n}\n\n\ndouble solve(int a,int b,int c,int m){\n if( abs(dp[a][b][c][m]+1.0) > 0.5 ) return dp[a][b][c][m];\n if( m == M ) return dp[a][b][c][m] = 0.0;\n if( c == a ) return dp[a][b][c][m] = -INF;\n int nc = nx[c];\n return dp[a][b][c][m] = max( solve( a, c, nc, m+1 ) + getA[a][b][c],\n solve( a, b, nc, m ) ); \n}\n\nint main(){\n while( cin >> N >> M && (N||M) ){\n vector<P> pos;\n for(int i=0;i<N;i++){\n double p; cin >> p;\n pos.push_back( getpos(p) );\n }\n init(pos);\n double res = 0.0;\n for(int i=0;i<N;i++){\n for(int j=0;j<N;j++){\n if( i == j ) continue;\n res = max( res, solve( i, j, nx[j], 2 ) );\n }\n }\n printf(\"%.6lf\\n\",res);\n }\n}","accuracy":1,"time_ms":110,"memory_kb":23748,"score_of_the_acc":-1.0763,"final_rank":19},{"submission_id":"aoj_1222_1751295","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef complex<double> P;\n#define MAX_N 45\ndouble PI = acos(-1.0);\ndouble INF = 1e9;\n\nint n,m;\nP t[MAX_N];\ndouble dp[MAX_N][MAX_N];\n\ndouble calc(P s,P t){\n return imag(t*conj(s))/2.0;\n}\n\ndouble solve(int si){\n P a[MAX_N];\n for(int i=0;i<n;i++){\n a[i]=t[(i+si)%n];\n }\n\n for(int i=0;i<MAX_N;i++)\n for(int j=0;j<MAX_N;j++)\n\tdp[i][j]=-INF;\n dp[0][1]=0;\n\n double res=0;\n\n for(int i=0;i<n;i++){\n for(int j=1;j<m;j++){\n for(int k=i+1;k<n;k++){\n\tdp[k][j+1]=max(dp[k][j+1],dp[i][j]+calc(a[i],a[k]));\n }\n }\n res=max(res, dp[i][m]+calc(a[i],a[0]));\n }\n return res;\n}\n\nint main(){\n while(1){\n cin>>n>>m;\n if(n==0&&m==0)break;\n for(int i=0;i<n;i++){\n double d;\n cin>>d;\n t[i]=P(cos(d*2.0*PI),sin(d*2.0*PI));\n }\n double ans=0;\n for(int i=0;i<n;i++)ans=max(ans,solve(i));\n printf(\"%.6f\\n\",ans);\n }\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":1276,"score_of_the_acc":-0.0433,"final_rank":2}],"string":"[\n {\n \"submission_id\": \"aoj_1222_3709885\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\nusing ll = long long;\\n// #define int ll\\nusing PII = pair<ll, ll>;\\n\\n#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)\\n#define REP(i, n) FOR(i, 0, n)\\n#define ALL(x) x.begin(), x.end()\\n\\ntemplate<typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }\\ntemplate<typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }\\ntemplate<typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }\\ntemplate<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }\\n\\ntemplate<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }\\ntemplate<typename T,typename... Ts>\\nauto make_v(size_t a,Ts... ts) {\\n return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));\\n}\\ntemplate<typename T,typename V> typename enable_if<is_class<T>::value==0>::type\\nfill_v(T &t, const V &v) { t=v; }\\ntemplate<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type\\nfill_v(T &t, const V &v ) { for(auto &e:t) fill_v(e,v); }\\n\\ntemplate<class S,class T>\\nostream &operator <<(ostream& out,const pair<S,T>& a) {\\n out<<'('<<a.first<<','<<a.second<<')'; return out;\\n}\\ntemplate<class T>\\nostream &operator <<(ostream& out,const vector<T>& a){\\n out<<'[';\\n for(const T &i: a) out<<i<<',';\\n out<<']';\\n return out;\\n}\\ntemplate<class T>\\nostream &operator <<(ostream& out, const set<T>& a) {\\n out<<'{';\\n for(const T &i: a) out<<i<<',';\\n out<<'}';\\n return out;\\n}\\ntemplate<class T, class S>\\nostream &operator <<(ostream& out, const map<T,S>& a) {\\n out<<'{';\\n for(auto &i: a) out<<i<<',';\\n out<<'}';\\n return out;\\n}\\n\\nint dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; // DRUL\\nconst int INF = 1<<30;\\nconst ll LLINF = 1LL<<60;\\nconst ll MOD = 1000000007;\\n\\nusing R = double;\\nR x[41][41][41], dp[41][41][41], area[41][41][41];\\nsigned main(void)\\n{\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n constexpr R PI = acos(-1);\\n\\n while(1) {\\n ll n, m;\\n cin >> n >> m;\\n if(!n) break;\\n vector<R> p(n);\\n REP(i, n) cin >> p[i], p[i] *= 2*PI;\\n\\n REP(i, n) FOR(j, i, n) FOR(k, j, n) {\\n area[i][j][k] = (sin(p[j]-p[i]) + sin(p[k]-p[j]) + sin(p[i]-p[k]))/2;\\n }\\n\\n REP(i, 41) REP(j, 41) REP(k, 41) dp[i][j][k] = -LLINF;\\n REP(i, 41) REP(j, 41) dp[i][j][2] = 0;\\n\\n R ans = -LLINF;\\n REP(l, n) FOR(cnt, 2, m) FOR(r, l+1, n) FOR(i, r+1, n) {\\n if(dp[l][r][cnt] == -LLINF) continue;\\n chmax(dp[l][i][cnt+1], dp[l][r][cnt] + area[l][r][i]);\\n if(cnt+1 <= m) chmax(ans, dp[l][i][cnt+1]);\\n }\\n\\n cout << fixed << setprecision(6) << ans << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 4548,\n \"score_of_the_acc\": -0.1548,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1222_3709729\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\nusing ll = long long;\\n// #define int ll\\nusing PII = pair<ll, ll>;\\n\\n#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)\\n#define REP(i, n) FOR(i, 0, n)\\n#define ALL(x) x.begin(), x.end()\\n\\ntemplate<typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }\\ntemplate<typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }\\ntemplate<typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }\\ntemplate<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }\\n\\ntemplate<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }\\ntemplate<typename T,typename... Ts>\\nauto make_v(size_t a,Ts... ts) {\\n return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));\\n}\\ntemplate<typename T,typename V> typename enable_if<is_class<T>::value==0>::type\\nfill_v(T &t, const V &v) { t=v; }\\ntemplate<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type\\nfill_v(T &t, const V &v ) { for(auto &e:t) fill_v(e,v); }\\n\\ntemplate<class S,class T>\\nostream &operator <<(ostream& out,const pair<S,T>& a) {\\n out<<'('<<a.first<<','<<a.second<<')'; return out;\\n}\\ntemplate<class T>\\nostream &operator <<(ostream& out,const vector<T>& a){\\n out<<'[';\\n for(const T &i: a) out<<i<<',';\\n out<<']';\\n return out;\\n}\\ntemplate<class T>\\nostream &operator <<(ostream& out, const set<T>& a) {\\n out<<'{';\\n for(const T &i: a) out<<i<<',';\\n out<<'}';\\n return out;\\n}\\ntemplate<class T, class S>\\nostream &operator <<(ostream& out, const map<T,S>& a) {\\n out<<'{';\\n for(auto &i: a) out<<i<<',';\\n out<<'}';\\n return out;\\n}\\n\\nint dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; // DRUL\\nconst int INF = 1<<30;\\nconst ll LLINF = 1LL<<60;\\nconst ll MOD = 1000000007;\\n\\nusing R = double;\\nR x[41][41][41], dp[41][41][41], area[41][41][41];\\nsigned main(void)\\n{\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n constexpr R PI = acos(-1);\\n\\n while(1) {\\n ll n, m;\\n cin >> n >> m;\\n if(!n) break;\\n vector<R> p(n);\\n REP(i, n) cin >> p[i], p[i] *= 2*PI;\\n\\n REP(i, n) FOR(j, i, n) FOR(k, j, n) {\\n area[i][j][k] = (sin(p[j]-p[i]) + sin(p[k]-p[j]) + sin(p[i]-p[k]))/2;\\n }\\n\\n REP(i, 41) REP(j, 41) REP(k, 41) dp[i][j][k] = -LLINF;\\n REP(i, 41) REP(j, 41) dp[i][j][2] = 0;\\n\\n R ans = -LLINF;\\n REP(sp, n) FOR(cnt, 2, m) FOR(lp, sp+1, n) FOR(np, lp+1, n) {\\n if(dp[sp][lp][cnt] == -LLINF) continue;\\n chmax(dp[sp][np][cnt+1], dp[sp][lp][cnt] + area[sp][lp][np]);\\n if(cnt+1 <= m) chmax(ans, dp[sp][np][cnt+1]);\\n }\\n\\n cout << fixed << setprecision(6) << ans << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 4536,\n \"score_of_the_acc\": -0.1543,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1222_3699589\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <complex>\\n#include <cmath>\\nusing namespace std;\\nusing D = double;\\nusing P = complex<D>;\\nconstexpr D pi = acos(-1);\\n\\nD cross(const P &a, const P &b){ return a.real()*b.imag()-a.imag()*b.real();}\\n\\nint main(){\\n int n, m;\\n while(cin >> n >> m, n){\\n vector<D> A(n);\\n for(int i = 0; i < n; ++i){\\n cin >> A[i];\\n }\\n D ans = 0;\\n for(int i = 0; i < n; ++i){\\n vector<vector<D>> dp(n,vector<D>(m+1,0));\\n for(int j = i+1; j < n; ++j){\\n for(int k = i+1; k < j; ++k){\\n for(int l = 2; l < m; ++l){\\n P a = polar(1.,2*pi*A[i]), b = polar(1.,2*pi*A[k]), c = polar(1.,2*pi*A[j]);\\n D s = abs(cross(b-a,c-a))/2;\\n dp[j][l+1] = max(dp[k][l] + s, dp[j][l+1]);\\n if(l+1 == m) ans = max(ans,dp[j][l+1]);\\n }\\n }\\n }\\n }\\n printf(\\\"%.6f\\\\n\\\",ans);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 290,\n \"memory_kb\": 3632,\n \"score_of_the_acc\": -0.3345,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1222_3644675\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<complex>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<utility>\\n#include<cassert>\\nusing namespace std;\\n\\ntypedef long long ll;\\n\\ntypedef unsigned long long ul;\\ntypedef unsigned int ui;\\nconst ll mod = 998244353;\\ntypedef long double ld;\\ntypedef complex<ld> Point;\\nconst ll INF = mod * mod;\\ntypedef pair<int, int> P;\\n#define stop char nyaa;cin>>nyaa;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\nconst ld eps = 1e-8;\\nconst ld pi = acos(-1.0);\\ntypedef pair<ld, ld> LDP;\\ntypedef pair<ll, ll> LP;\\ntypedef vector<int> vec;\\ntypedef vector<string> svec;\\n\\nbool eq(ld a, ld b) {\\n\\treturn (abs(a - b) < eps);\\n}\\n\\nclass Line {\\npublic:\\n\\tPoint a, b;\\n};\\nclass Circle {\\npublic:\\n\\tPoint p; ld r;\\n};\\n\\nld dot(Point a, Point b) {\\n\\treturn real(conj(a)*b);\\n}\\nld cross(Point a, Point b) {\\n\\treturn imag(conj(a)*b);\\n}\\nnamespace std {\\n\\tbool operator<(const Point &lhs, const Point &rhs) {\\n\\t\\treturn lhs.real() == rhs.real() ? lhs.imag() < rhs.imag() : lhs.real() < rhs.real();\\n\\t}\\n}\\nPoint proj(Line l, Point p) {\\n\\tld t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + t * (l.a - l.b);\\n}\\n\\nld dist_lp(Line l, Point p) {\\n\\treturn abs(p - proj(l, p));\\n}\\n\\nint ccw(Point a, Point b, Point c) {\\n\\tb -= a; c -= a;\\n\\tif (cross(b, c) > eps)return 1;//a,b,cが反時計回り\\n\\tif (cross(b, c) < -eps)return -1;//a,b,cが時計回り\\n\\tif (dot(b, c) < 0)return 2;//c,a,bの順に一直線\\n\\tif (norm(b) < norm(c))return -2;//a,b,cの順に一直線\\n\\treturn 0;//a,c,bの順に一直線\\n}\\nbool isis_ll(Line l, Line m) {\\n\\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\\n}\\nPoint is_ll(Line s, Line t) {\\n\\tPoint sv = s.b - s.a; Point tv = t.b - t.a;\\n\\treturn s.a + sv * cross(tv, t.a - s.a) / cross(tv, sv);\\n}\\n\\n//直線lに幅dをつける\\nvector<Line> make_w(Line l, ld d) {\\n\\tPoint dif = l.b - l.a;\\n\\tdif = dif*Point{0, 1};\\n\\tdif = dif * (d / abs(dif));\\n\\tvector<Line> ret;\\n\\tfor (int id = 1; id >= -1; id -= 2) {\\n\\t\\tPoint a = l.a + dif * (ld)id;\\n\\t\\tPoint b = l.b + dif * (ld)id;\\n\\t\\tret.push_back({ a,b });\\n\\t}\\n\\treturn ret;\\n}\\n\\ntypedef vector<Point> polygon;\\npolygon ConvexHull(polygon p) {\\n\\tint n = p.size();\\n\\tint k = 0;\\n\\tsort(p.begin(), p.end());\\n\\tpolygon ch(2 * n);\\n\\tfor (int i = 0; i < n; ch[k++] = p[i++]) {\\n\\t\\twhile (k >= 2 && ccw(ch[k - 2], ch[k - 1], p[i]) <= 0)--k;\\n\\t}\\n\\tfor (int i = n - 2, t = k + 1; i >= 0; ch[k++] = p[i--]) {\\n\\t\\twhile (k >= t && ccw(ch[k - 2], ch[k - 1], p[i]) <= 0)--k;\\n\\t}\\n\\tch.resize(k - 1);\\n\\treturn ch;\\n}\\npolygon convex_cut(const polygon &p, Line l) {\\n\\tvector<Point> ret;\\n\\trep(i, p.size()) {\\n\\t\\tPoint a = p[i], b = p[(i + 1) % p.size()];\\n\\t\\tif (ccw(l.a, l.b, a) != -1)ret.push_back(a);\\n\\t\\tif (ccw(l.a, l.b, a)*ccw(l.a, l.b, b)<0) {\\n\\t\\t\\tret.push_back(is_ll({ a,b }, l));\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\nld area(const polygon &p){\\n\\tld ret = 0;\\n\\tint n = p.size();\\n\\trep(j, n)ret += cross(p[j], p[(j + 1) % n]);\\n\\treturn ret / 2.0;\\n}\\nld max_distance(const polygon &p) {\\n\\t//assert(p.size()>1);\\n\\tpolygon g = ConvexHull(p);\\n\\tint n = g.size(), a = 0, b = 1;\\n\\tld ret = abs(g[0] - g[1]);\\n\\twhile (a < n) {\\n\\t\\tPoint p1 = g[a%n], p2 = g[(a + 1) % n];\\n\\t\\tPoint q1 = g[b%n], q2 = g[(b + 1) % n];\\n\\t\\tif (arg((p2 - p1) / (q1 - q2)) > 0)++b; else ++a;\\n\\t\\tret = max(ret, abs(p1 - q1));\\n\\t}\\n\\treturn ret;\\n}\\n\\nvector<Point> is_cc(Circle c1, Circle c2) {\\n\\tvector<Point> res;\\n\\tld d = abs(c1.p - c2.p);\\n\\tld rc = (d*d + c1.r*c1.r - c2.r*c2.r) / (2 * d);\\n\\tld dfr = c1.r*c1.r - rc * rc;\\n\\tif (abs(dfr) < eps)dfr = 0.0;\\n\\tif (dfr < 0.0)return res;\\n\\tld rs = sqrt(dfr);\\n\\tPoint diff = (c2.p - c1.p) / d;\\n\\tres.push_back(c1.p + diff * Point(rc, rs));\\n\\tif (dfr != 0.0)res.push_back(c1.p + diff * Point(rc, -rs));\\n\\treturn res;\\n}\\nbool in_Circle(Circle a, Circle b) {\\n\\tld dist = abs(b.p - a.p);\\n\\treturn dist < b.r - a.r+eps;\\n}\\n\\nld calc(ld t) {\\n\\tld theta = pi*t;\\n\\treturn sin(theta)*cos(theta);\\n}\\nint n, m;\\nvoid solve() {\\n\\tvector<ld> p(n);\\n\\trep(i, n)cin >> p[i];\\n\\tld ans = -mod;\\n\\trep(i, n) {\\n\\t\\tvector<vector<ld>> dp(n);\\n\\t\\trep(j, n)dp[j].resize(m,-mod);\\n\\t\\tdp[0][0] = 0;\\n\\t\\trep1(j, n - 1) {\\n\\t\\t\\tint id = (i + j)%n;\\n\\t\\t\\trep(k, j) {\\n\\t\\t\\t\\tint pid = (i + k) % n;\\n\\t\\t\\t\\trep(l, m-1) {\\n\\t\\t\\t\\t\\tld dif = p[id] - p[pid];\\n\\t\\t\\t\\t\\tif (dif < 0)dif += 1;\\n\\t\\t\\t\\t\\tdp[j][l + 1] = max(dp[j][l + 1], dp[k][l] + calc(dif));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\trep(j, n) {\\n\\t\\t\\tint id = (i + j) % n;\\n\\t\\t\\tld dif = p[i] - p[id];\\n\\t\\t\\tif (dif < 0)dif += 1;\\n\\t\\t\\tld sum = calc(dif) + dp[j][m - 1];\\n\\t\\t\\tans = max(ans, sum);\\n\\t\\t\\t/*if (sum > 0.731010) {\\n\\t\\t\\t\\tcout << i << \\\" \\\" << j << \\\" \\\" << dp[j][m-1]<<\\\" \\\"<<calc(dif) << endl;\\n\\t\\t\\t}*/\\n\\t\\t}\\n\\t}\\n\\tcout << ans << endl;\\n\\t//cout << calc(0.24) << endl;\\n\\t/*rep(i, 40) {\\n\\t\\tld u = 0.002*i;\\n\\t\\t\\tcout << u << \\\" \\\" << calc(u) << endl;\\n\\t}*/\\n}\\n\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\tcout << fixed << setprecision(6);\\n\\tint t = 1;\\n\\twhile (cin >> n>>m, n) {\\n\\t\\tsolve();\\n\\t}\\n\\t//solve();\\n\\t//stop\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1050,\n \"memory_kb\": 3564,\n \"score_of_the_acc\": -0.9755,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1222_3641949\",\n \"code_snippet\": \"#include<iomanip>\\n#include<limits>\\n#include<thread>\\n#include<utility>\\n#include<iostream>\\n#include<string>\\n#include<algorithm>\\n#include<set>\\n#include<map>\\n#include<vector>\\n#include<stack>\\n#include<queue>\\n#include<cmath>\\n#include<numeric>\\n#include<cassert>\\n#include<random>\\n#include<chrono>\\n#include<unordered_set>\\n#include<unordered_map>\\n#include<fstream>\\n#include<list>\\n#include<functional>\\n#include<bitset>\\n#include<complex>\\n#include<tuple>\\nusing namespace std;\\ntypedef unsigned long long int ull;\\ntypedef long long int ll;\\ntypedef pair<ll,ll> pll;\\ntypedef long double D;\\ntypedef complex<D> P;\\n#define F first\\n#define S second\\nconst ll E=1e18+7;\\nconst ll MOD=1000000007;\\n\\n\\ntemplate<typename T,typename U>istream & operator >> (istream &i,pair<T,U> &A){i>>A.F>>A.S; return i;}\\ntemplate<typename T>istream & operator >> (istream &i,vector<T> &A){for(auto &I:A){i>>I;} return i;}\\ntemplate<typename T,typename U>ostream & operator << (ostream &o,pair<T,U> &A){o<<A.F<<\\\" \\\"<<A.S; return o;}\\ntemplate<typename T>ostream & operator << (ostream &o,vector<T> &A){ll i=A.size(); for(auto &I:A){o<<I<<(--i?\\\" \\\":\\\"\\\");} return o;}\\ntemplate<typename T>vector<T> & cset(vector<T> &A,T e=T()){for(auto &I:A){I=e;} return A;}\\n\\nnamespace Geometry{\\n typedef long double D;\\n typedef complex<long double> P;\\n typedef pair<P,D> C;\\n \\n const D EPS=1e-9;\\n const D PI=asin(1)*2;\\n const D INF=1e18;\\n \\n const static bool comp(const P &p1,const P &p2){return p1.real()==p2.real()?p1.imag()<p2.imag():p1.real()<p2.real();}\\n \\n D dot(P p1,P p2){return p1.real()*p2.real()+p1.imag()*p2.imag();}\\n \\n D cross(P p1,P p2){return p1.real()*p2.imag()-p1.imag()*p2.real();}\\n \\n P project(P vec,P x){return vec*(x/vec).real();}\\n \\n P project(P p1,P p2,P x){return p1+project(p2-p1,x-p1);}\\n \\n P reflect(P vec,P x){return vec*conj(x/vec);}\\n \\n P reflect(P p1,P p2,P x){return p1+reflect(p2-p1,x-p1);}\\n \\n bool intersectSL(P p1,P p2,P vec){vec/=abs(vec); p1/=vec; p2/=vec; return (p1.imag()<EPS && p2.imag()>-EPS) || (p1.imag()>-EPS && p2.imag()<EPS);}\\n \\n bool intersectSL(P p1,P p2,P p3,P p4){return intersectSL(p1-p4,p2-p4,p3-p4);}\\n \\n bool intersectSS(P p1,P p2,P p3,P p4){return (dot(p2-p1,p3-p1)<-EPS && dot(p2-p1,p4-p1)<-EPS) || (dot(p1-p2,p3-p2)<-EPS && dot(p1-p2,p4-p2)<-EPS)?false:intersectSL(p1,p2,p3,p4) && intersectSL(p3,p4,p1,p2);}\\n \\n D distLP(P vec,P x){return abs((x/vec).imag())*abs(vec);}\\n \\n D distLP(P p1,P p2,P x){return distLP(p2-p1,x-p1);}\\n \\n D distSP(P p1,P p2,P x){return dot(p2-p1,x-p1)<-EPS?abs(x-p1):dot(p1-p2,x-p2)<-EPS?abs(x-p2):distLP(p1,p2,x);}\\n \\n D distSS(P p1,P p2,P p3,P p4){return intersectSS(p1,p2,p3,p4)?0.0:min(min(distSP(p1,p2,p3),distSP(p1,p2,p4)),min(distSP(p3,p4,p1),distSP(p3,p4,p2)));}\\n \\n P crosspointLL(P p1,P p2,P vec){return abs(cross(p2-p1,vec))<EPS?vec:vec*cross(p2-p1,p2)/cross(p2-p1,vec);}\\n \\n P crosspointLL(P p1,P p2,P p3,P p4){return p4+crosspointLL(p1-p4,p2-p4,p3-p4);}\\n \\n P crosspointSS(P p1,P p2,P p3,P p4){return distSP(p1,p2,p3)<EPS?p3:distSP(p1,p2,p4)<EPS?p4:crosspointLL(p1,p2,p3,p4);}\\n \\n bool intersectShL(P p1,P p2,P vec){vec/=abs(vec); return intersectSL(p1,p2,vec) && crosspointLL(p1/vec,p2/vec,vec/vec).real()>-EPS;}\\n \\n bool intersectShL(P p1,P p2,P p3,P p4){return intersectShL(p1-p3,p2-p3,p4-p3);}\\n \\n //1::in,0::on edge,-1::out\\n int contain(const vector<P> &poly,const P &p){\\n vector<P> A={{65537,96847},{-24061,6701},{56369,-86509},{-93763,-78049},{56957,10007}};\\n vector<bool> cnt(5,false);\\n for(int i=1;i<=poly.size();i++){\\n if(distSP(poly[i-1],poly[i%poly.size()],p)<EPS){return 0;}\\n for(int j=0;j<5;j++){\\n if(intersectShL(poly[i-1],poly[i%poly.size()],p,p+A[j])){cnt[j]=!cnt[j];}\\n }\\n }\\n int in=0;\\n for(int j=0;j<5;j++){if(cnt[j]){in++;}}\\n return in>=3?1:-1;\\n }\\n \\n vector<P> convexcut(const vector<P> &poly,P p1,P p2){\\n vector<P> ret;\\n for(int i=1;i<=poly.size();i++){\\n if(cross(p2-p1,poly[i-1]-p1)>-EPS){ret.push_back(poly[i-1]);}\\n if(intersectSL(poly[i-1],poly[i%poly.size()],p1,p2) && distLP(p1,p2,poly[i-1])>EPS && distLP(p1,p2,poly[i%poly.size()])>EPS){ret.push_back(crosspointLL(poly[i-1],poly[i%poly.size()],p1,p2));}\\n }\\n return ret;\\n }\\n \\n D area(const vector<P> &poly){\\n D ans=0;\\n for(int i=2;i<poly.size();i++){ans+=cross(poly[i-1]-poly[0],poly[i]-poly[0]);}\\n return abs(ans)/2;\\n }\\n \\n vector<P> convexhull(vector<P> pts){\\n vector<P> ret;\\n sort(pts.begin(),pts.end(),comp);\\n for(auto &I:pts){\\n if(!ret.empty() && I==ret.back()){continue;}\\n while(ret.size()>=2 && cross(ret.back()-ret[ret.size()-2],I-ret.back())<-EPS){ret.pop_back();}\\n ret.push_back(I);\\n }\\n reverse(pts.begin(),pts.end());\\n for(auto &I:pts){\\n if(!ret.empty() && I==ret.back()){continue;}\\n while(ret.size()>=2 && cross(ret.back()-ret[ret.size()-2],I-ret.back())<-EPS){ret.pop_back();}\\n ret.push_back(I);\\n }\\n if(ret[0]==ret.back()){ret.pop_back();}\\n return ret;\\n }\\n \\n //4::seperate,3::circumscribe,2::intersect,1::inscribe,0::contain,-1::same\\n int intersectCC(C c1,C c2){\\n D d=abs(c1.F-c2.F),r=c1.S+c2.S,dif=abs(c2.S-c1.S);\\n if(d<EPS && dif<EPS){return -1;}\\n if(d-r>EPS){return 4;}\\n if(d-r>-EPS){return 3;}\\n if(d-dif>EPS){return 2;}\\n if(d-dif>-EPS){return 1;}\\n return 0;\\n }\\n \\n vector<P> crosspointLC(P p1,P p2,C c){\\n vector<P> ret;\\n P pr=project(p1,p2,c.F);\\n D d=distLP(p1,p2,c.F);\\n if(d-c.S>EPS){return ret;}\\n if(d-c.S>-EPS){ret.push_back(pr); return ret;}\\n P vec=p2-p1; vec*=sqrt(c.S*c.S-d*d)/abs(vec);\\n ret.push_back(pr-vec);\\n ret.push_back(pr+vec);\\n return ret;\\n }\\n \\n vector<P> crosspointSC(P p1,P p2,C c){\\n vector<P> ret;\\n for(auto &I:crosspointLC(p1,p2,c)){if(distSP(p1,p2,I)<EPS){ret.push_back(I);}}\\n return ret;\\n }\\n \\n vector<P> crosspointCC(C c1,C c2){\\n vector<P> ret;\\n P vec=c2.F-c1.F;\\n D base=(c1.S*c1.S+norm(vec)-c2.S*c2.S)/(2*abs(vec));\\n D h=sqrt(c1.S*c1.S-base*base);\\n vec/=abs(vec);\\n ret.push_back(c1.F+vec*P(base,-h));\\n ret.push_back(c1.F+vec*P(base,h));\\n return ret;\\n }\\n \\n vector<P> tangentCP(C c,P p){return crosspointCC(c,C(p,sqrt(norm(c.F-p)-c.S*c.S)));}\\n \\n vector<pair<P,P>> tangentCC(C c1,C c2){\\n vector<pair<P,P>> ret;\\n P d=c2.F-c1.F;\\n for(D i:{-1,1}){\\n D r=c1.S+c2.S*i;\\n if(intersectCC(c1,c2)>i+1){\\n for(P s:{-1i,1i}){\\n P p=r+s*sqrt(norm(d)-norm(r));\\n ret.push_back({c1.F+d*c1.S/norm(d)*p,c2.F-d*i*c2.S/norm(d)*p});\\n }\\n }\\n }\\n return ret;\\n }\\n \\n D area(const vector<P> &poly,C c){\\n D ret=0;\\n for(int i=0;i<poly.size();i++){\\n P a=poly[i]-c.F,b=poly[(i+1)%poly.size()]-c.F;\\n if(abs(a)<c.S+EPS && abs(b)<c.S+EPS){ret+=cross(a,b);}\\n else{\\n vector<P> A=crosspointSC(a,b,{0,c.S});\\n if(A.empty()){ret+=c.S*c.S*arg(b/a);}\\n else{\\n ret+=(abs(a)<c.S?cross(a,A[0]):c.S*c.S*arg(A[0]/a));\\n ret+=(abs(b)<c.S?cross(A.back(),b):c.S*c.S*arg(b/A.back()));\\n ret+=cross(A[0],A.back());\\n }\\n }\\n }\\n return abs(ret)/2;\\n }\\n \\n //反時計回り\\n D diameter(const vector<P> &poly){\\n D ret=0;\\n ll l=0,r=0,n=poly.size();\\n if(n==2){return abs(poly[0]-poly[1]);}\\n for(int i=0;i<n;i++){\\n if(comp(poly[l],poly[i])){l=i;}\\n if(comp(poly[i],poly[r])){r=i;}\\n }\\n ll sl=r,sr=l;\\n while(sl!=l || sr!=r){\\n ret=max(ret,abs(poly[r]-poly[l]));\\n if(cross(poly[(l+1)%n]-poly[l],poly[(r+1)%n]-poly[r])<0){(++l)%=n;}\\n else{(++r)%=n;}\\n }\\n return ret;\\n }\\n \\n D closestpair(vector<P> pt){\\n sort(pt.begin(),pt.end(),comp);\\n D ret=INF;\\n for(ll i=1;i<pt.size();i<<=1){\\n for(ll j=0;i+j<pt.size();j+=i*2){\\n ll m=i+j;\\n vector<P> R;\\n D l=-INF,r=INF;\\n for(ll k=j;k<m;k++){l=max(l,pt[k].real());}\\n for(ll k=0;m+k<pt.size() && k<i;k++){r=min(r,pt[m+k].real());}\\n for(ll k=0;m+k<pt.size() && k<i;k++){if(pt[m+k].real()-l<ret){R.push_back(pt[m+k]);}}\\n ll idx=0;\\n for(ll k=j;k<m;k++){\\n if(r-pt[k].real()>ret){continue;}\\n while(idx<R.size() && pt[k].imag()-R[idx].imag()>ret){idx++;}\\n for(ll n=idx;n<R.size() && R[n].imag()-pt[k].imag()<ret;n++){ret=min(ret,abs(R[n]-pt[k]));}\\n }\\n inplace_merge(pt.begin()+j,pt.begin()+m,j+i*2<pt.size()?pt.begin()+j+2*i:pt.end(),[](const P &a,const P &b){return a.imag()==b.imag()?a.real()<b.real():a.imag()<b.imag();});\\n }\\n }\\n return ret;\\n }\\n \\n istream & operator >> (istream &i,P &p){D x,y; i>>x>>y; p={x,y}; return i;}\\n istream & operator >> (istream &i,C &p){D x,y; i>>x>>y>>p.S; p.F={x,y}; return i;}\\n};\\n\\nusing namespace Geometry;\\n\\n\\nD cul(const vector<P> &A,ll s,ll n,ll m){\\n vector<vector<D>> dp(n,vector<D>(m,-E));\\n dp[s][0]=0;\\n for(ll i=s+1;i<n;i++){\\n for(int j=1;j<m;j++){\\n for(int k=0;k<i;k++){dp[i][j]=max(dp[i][j],dp[k][j-1]+cross(A[k],A[i]));}\\n }\\n }\\n D ret=-E;\\n for(ll i=s+1;i<n;i++){ret=max(ret,dp[i].back()+cross(A[i],A[s]));}\\n return ret;\\n}\\n\\n\\nint main(){\\n ll n,m;\\n while(cin>>n>>m,n){\\n vector<D> R(n);\\n cin>>R;\\n vector<P> A(n);\\n for(int i=0;i<n;i++){A[i]=polar((D)1,R[i]*2*PI);}\\n D ret=0;\\n for(int i=0;i<n;i++){ret=max(ret,cul(A,i,n,m));}\\n cout<<fixed<<setprecision(6)<<ret/2<<endl;\\n }\\n \\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3632,\n \"score_of_the_acc\": -0.1141,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1222_3047541\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <complex>\\n#include <iomanip>\\n#include <cmath>\\nusing namespace std;\\nconst double EPS = 1e-8;\\nconst double INF = 1e18;\\nconst double PI = acos(-1);\\ntypedef complex<double> P;\\ntypedef vector<P> VP;\\n#define X real()\\n#define Y imag()\\n\\ndouble cross(P a, P b){\\n return (conj(a)*b).Y;\\n}\\ndouble gettriarea(P a, P b, P c){\\n return abs(cross(b-a, c-a)) /2;\\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 d;\\n cin >> d;\\n p[i] = P(1, 0) *P(cos(d*2*PI), sin(d*2*PI));\\n }\\n double ans = 0;\\n for(int sp=0; sp<n; sp++){\\n p.push_back(p[0]);\\n p.erase(p.begin());\\n vector<vector<double> > dp(n+1, vector<double>(n+1, 0));\\n for(int cp=2; cp<n; cp++){\\n for(int cn=3; cn<=cp +1; cn++){\\n for(int lp=cn-2; lp<cp; lp++){\\n dp[cp][cn] = max(dp[cp][cn], dp[lp][cn-1] +gettriarea(p[0], p[lp], p[cp]));\\n }\\n }\\n }\\n for(int i=0; i<n; i++){\\n ans = max(ans, dp[i][m]);\\n }\\n }\\n cout << fixed << setprecision(6);\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3488,\n \"score_of_the_acc\": -0.1077,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1222_2669299\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\nusing ld = long double;\\nconst ld eps = 1e-9;\\nconst ld pi=acos(-1.0);\\n\\nld solve(int N, int M, vector<ld>ps) {\\n\\tvector<vector<vector<ld>>>dp(N+1,vector<vector<ld>>(M+1,vector<ld>(N,-1e8)));\\n\\tdp[1][1][0]=0;\\n\\tfor (int now = 1; now < N; ++now) {\\n\\t\\tfor (int used_cnt = 0; used_cnt <= M; ++used_cnt) {\\n\\t\\t\\tfor (int pre_use_id = 0; pre_use_id < now; ++pre_use_id) {\\n\\t\\t\\t\\tdp[now+1][used_cnt][pre_use_id]=max(dp[now+1][used_cnt][pre_use_id],\\n\\t\\t\\t\\t\\tdp[now][used_cnt][pre_use_id]);\\n\\n\\t\\t\\t\\tif (used_cnt != M) {\\n\\n\\t\\t\\t\\t\\tld plus = 0.5*(sin(2 * pi*(ps[now] - ps[pre_use_id])));\\n\\t\\t\\t\\t\\tdp[now + 1][used_cnt + 1][now] = max(\\n\\t\\t\\t\\t\\t\\tdp[now + 1][used_cnt + 1][now],\\n\\t\\t\\t\\t\\t\\tdp[now][used_cnt][pre_use_id] + plus);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tld ans=0;\\n\\tfor (int pre_use_id = 0; pre_use_id < N; ++pre_use_id) {\\n\\n\\t\\tld plus = 0.5*(sin(2 * pi*(ps[0] - ps[pre_use_id])));\\n\\t\\tans=max(ans,dp[N][M][pre_use_id]+plus);\\n\\t}\\n\\treturn ans;\\n}\\n\\nint main() {\\n\\twhile (true) {\\n\\t\\tint N, M; cin >> N >> M;\\n\\t\\tif(!N)break;\\n\\t\\tvector<ld>ps;\\n\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\tld theta; cin >> theta;\\n\\t\\t\\tps.push_back(theta);\\n\\t\\t}\\n\\n\\t\\tld ans = 0;\\n\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\trotate(ps.begin(), ps.begin() + 1, ps.end());\\n\\t\\t\\tans = max(ans, solve(N, M, ps));\\n\\t\\t}\\n\\t\\tcout<<setprecision(6)<<fixed<<ans<<endl;\\n\\t}\\n\\t\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1200,\n \"memory_kb\": 3768,\n \"score_of_the_acc\": -1.1117,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1222_2599425\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <set>\\n#include <map>\\n#include <time.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\nstruct Point{\\n\\tdouble x,y;\\n};\\n\\nint N,M;\\n\\nPoint point[40];\\ndouble dp[40][40][41];\\n\\ndouble calc(int start,int last,int next){\\n return fabs((point[start].x*point[last].y-point[last].x*point[start].y)+(point[last].x*point[next].y-point[next].x*point[last].y)+\\n \\t\\t(point[next].x*point[start].y-point[start].x*point[next].y))/2;\\n}\\n\\nvoid func(){\\n\\n\\tdouble tmp;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tscanf(\\\"%lf\\\",&tmp);\\n\\t\\tpoint[i].x = cos(tmp*2.0*M_PI);\\n\\t\\tpoint[i].y = sin(tmp*2.0*M_PI);\\n\\t}\\n\\n\\tfor(int a = 0; a < 40; a++){\\n\\t\\tfor(int b = 0; b < 40; b++){\\n\\t\\t\\tfor(int c = 0; c <= 40; c++)dp[a][b][c] = 0.0;\\n\\t\\t}\\n\\t}\\n\\n\\tdouble ans = 0.0;\\n\\n\\tfor(int start = 0; start < N; start++){\\n\\t\\tfor(int count = 2; count < M; count++){\\n\\t\\t\\tfor(int last = start; last < N; last++){\\n\\t\\t\\t\\tfor(int next = last+1; next < N; next++){\\n\\t\\t\\t\\t\\tdp[start][next][count+1] = max(dp[start][next][count+1],dp[start][last][count]+calc(start,last,next));\\n\\n\\t\\t\\t\\t\\tif(count+1 == M)ans = max(ans,dp[start][next][count+1]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tprintf(\\\"%.6lf\\\\n\\\",ans);\\n}\\n\\nint main(){\\n\\n\\twhile(true){\\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\": 20,\n \"memory_kb\": 4092,\n \"score_of_the_acc\": -0.1261,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1222_2548402\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n \\nusing namespace std;\\n \\n#define MAX_N 41\\n \\nconst double Pi = acos(-1);\\n \\ndouble getAngle(double p, double q) {\\n // assert(p < q);\\n \\n return (p-q)*2*Pi;\\n}\\n \\n#define eps 1e-8\\n \\ndouble getArea(double p, double q) {\\n //cout<<getAngle(p,q)<<endl;\\n //if(getAngle(p,q) > 0.5) return fabs(sin(1-getAngle(p, q))/2);\\n return (sin(getAngle(p, q))/2);\\n}\\n \\nint n, m;\\ndouble p[MAX_N];\\n \\ndouble dp[MAX_N][MAX_N][MAX_N];\\n \\ndouble solve(int idx, int curr, int start) {\\n if(idx == m) {\\n //if((1+p[start]-p[curr])-0.5 > 0) return -getArea(p[curr], p[start]);\\n return getArea(p[start], p[curr]);\\n }\\n if(curr+1 == n) return -1e9;\\n double &res = dp[idx][curr][start];\\n if(res != -1) return res;\\n for(int i = curr+1; i < n; i++) {\\n res = max(res, solve(idx+1, i, start) + getArea(p[i], p[curr]));\\n }\\n return res;\\n}\\n \\nint main() {\\n while(cin >> n >> m, n || m) {\\n for(int i = 0; i < n; i++) cin >> p[i];\\n \\n double ans = 0;\\n for(int i = 0; i < MAX_N; i++)\\n for(int j = 0; j < MAX_N; j++)\\n for(int k = 0; k < MAX_N; k++)\\n dp[i][j][k] = -1;\\n \\n for(int i = 0; i < n; i++) {\\n ans = max(ans, solve(1, i, i));\\n }\\n printf(\\\"%.6f\\\\n\\\", ans);\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 4004,\n \"score_of_the_acc\": -0.1561,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1222_2548307\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n \\nusing namespace std;\\n \\ntypedef complex<double> P;\\n \\nint n,m;\\ndouble p[50];\\n \\ndouble cal(int a,int b,int c){\\n \\n double res;\\n \\n P s=P(cos(p[a]),sin(p[a])),t=P(cos(p[b]),sin(p[b])),u=P(cos(p[c]),sin(p[c]));\\n \\n double aa=abs(s-t),bb=abs(t-u),cc=abs(u-s);\\n double ss=(aa+bb+cc)/2;\\n \\n res=sqrt(ss*(ss-aa)*(ss-bb)*(ss-cc));\\n \\n return res;\\n}\\n \\nint main(){\\n \\n \\n while(cin>>n>>m,n){\\n \\n for(int i=0;i<n;i++){\\n cin>>p[i];\\n p[i]*=2*M_PI;\\n }\\n \\n double dp[50][50][50]={};\\n \\n for(int i=0;i<n;i++)\\n for(int j=i+1;j<n;j++)\\n for(int k=2;k<m;k++)\\n for(int l=j+1;l<n;l++){\\n dp[i][l][k+1]=max(dp[i][l][k+1],dp[i][j][k]+cal(i,j,l));\\n }\\n \\n double ans=0;\\n for(int i=0;i<n;i++)\\n for(int j=i+1;j<n;j++)ans=max(ans,dp[i][j][m]);\\n \\n printf(\\\"%.6f\\\\n\\\",ans);\\n \\n }\\n \\n \\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 410,\n \"memory_kb\": 4560,\n \"score_of_the_acc\": -0.4774,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1222_2547962\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define MAX_N 41\\n\\nconst double Pi = acos(-1);\\n\\ndouble getAngle(double p, double q) {\\n // assert(p < q);\\n \\n return (p-q)*2*Pi;\\n}\\n\\n#define eps 1e-8\\n\\ndouble getArea(double p, double q) {\\n //cout<<getAngle(p,q)<<endl;\\n //if(getAngle(p,q) > 0.5) return fabs(sin(1-getAngle(p, q))/2);\\n return (sin(getAngle(p, q))/2);\\n}\\n\\nint n, m;\\ndouble p[MAX_N];\\n\\ndouble dp[MAX_N][MAX_N][MAX_N];\\n\\ndouble solve(int idx, int curr, int start) {\\n if(idx == m) {\\n //if((1+p[start]-p[curr])-0.5 > 0) return -getArea(p[curr], p[start]);\\n return getArea(p[start], p[curr]);\\n }\\n if(curr+1 == n) return -1e9;\\n double &res = dp[idx][curr][start];\\n if(res != -1) return res;\\n for(int i = curr+1; i < n; i++) {\\n res = max(res, solve(idx+1, i, start) + getArea(p[i], p[curr]));\\n }\\n return res;\\n}\\n\\nint main() {\\n while(cin >> n >> m, n || m) {\\n for(int i = 0; i < n; i++) cin >> p[i];\\n\\n double ans = 0;\\n for(int i = 0; i < MAX_N; i++)\\n for(int j = 0; j < MAX_N; j++)\\n\\tfor(int k = 0; k < MAX_N; k++)\\n\\t dp[i][j][k] = -1;\\n \\n for(int i = 0; i < n; i++) {\\n ans = max(ans, solve(1, i, i));\\n }\\n printf(\\\"%.6f\\\\n\\\", ans);\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 4000,\n \"score_of_the_acc\": -0.1559,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1222_2547866\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\nusing namespace std;\\n\\ntypedef complex<double> P;\\n\\nint n,m;\\ndouble p[50];\\n\\ndouble cal(int a,int b,int c){\\n\\n double res;\\n\\n P s=P(cos(p[a]),sin(p[a])),t=P(cos(p[b]),sin(p[b])),u=P(cos(p[c]),sin(p[c]));\\n\\n double aa=abs(s-t),bb=abs(t-u),cc=abs(u-s);\\n double ss=(aa+bb+cc)/2;\\n\\n res=sqrt(ss*(ss-aa)*(ss-bb)*(ss-cc));\\n\\n return res;\\n}\\n\\nint main(){\\n\\n\\n while(cin>>n>>m,n){\\n\\n for(int i=0;i<n;i++){\\n cin>>p[i];\\n p[i]*=2*M_PI;\\n }\\n\\n double dp[50][50][50]={};\\n \\n for(int i=0;i<n;i++)\\n for(int j=i+1;j<n;j++)\\n for(int k=2;k<m;k++)\\n\\tfor(int l=j+1;l<n;l++){\\n\\t dp[i][l][k+1]=max(dp[i][l][k+1],dp[i][j][k]+cal(i,j,l));\\n\\t}\\n\\n double ans=0;\\n for(int i=0;i<n;i++)\\n for(int j=i+1;j<n;j++)ans=max(ans,dp[i][j][m]);\\n \\n printf(\\\"%.6f\\\\n\\\",ans);\\n \\n }\\n\\n\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 410,\n \"memory_kb\": 4572,\n \"score_of_the_acc\": -0.4779,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1222_2340584\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define int long long\\n#define all(v) begin(v), end(v)\\n#define reps(i, m, n) for(int i = (int)(m); i < (int)(n); i++)\\n#define rep(i, n) reps(i, 0, n)\\n\\ntemplate<class T1, class T2> void chmin(T1 &a, T2 b){if(a>b)a=b;}\\ntemplate<class T1, class T2> void chmax(T1 &a, T2 b){if(a<b)a=b;}\\n\\nusing pint = pair<int, int>;\\nusing tint = tuple<int, int, int>;\\nusing vint = vector<int>;\\n\\nconst int inf = 1LL << 55;\\nconst int mod = 1e9 + 7;\\n\\nint n, m;\\ndouble p[88];\\ndouble dp[44][44][44];\\n\\nconst double Pi = acos(-1);\\ndouble area(int a, int b) {\\n return sin((p[b]-p[a])*2*Pi)/2;\\n}\\n\\ndouble solve(int fr, int la, int cnt) {\\n if(cnt == m) return (la-fr < 0.5 ? -1 : 1)*area(la, n+fr);\\n if(la == n-1) return -DBL_MAX/3;\\n double &res = dp[fr][la][cnt];\\n if(res != -DBL_MAX/3) return res;\\n res = -DBL_MAX/5;\\n reps(i, la+1, n) {\\n chmax(res, solve(fr, i, cnt+1)+area(la, i));\\n }\\n return res;\\n}\\n\\nsigned main()\\n{\\n cin.tie(0);\\n ios_base::sync_with_stdio(0);\\n cout << fixed << setprecision(6);\\n\\n while(cin >> n >> m, n || m) {\\n rep(i, n) cin >> p[i];\\n rep(i, n) p[n+i] = p[i]+1;\\n rep(i, 44) rep(j, 44) rep(k, 44) dp[i][j][k] = -DBL_MAX/3;\\n double ans = 0;\\n rep(i, n) chmax(ans, solve(i, i, 1));\\n cout << ans << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 4172,\n \"score_of_the_acc\": -0.1551,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1222_2340418\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define int long long\\nstruct Point{\\n double x,y;\\n Point(){}\\n Point(double x,double y):x(x),y(y){}\\n Point operator+(Point a){return Point(x+a.x,y+a.y);}\\n Point operator-(Point a){return Point(x-a.x,y-a.y);}\\n Point operator*(double k){return Point(x*k,y*k);}\\n Point operator/(double k){return Point(x/k,y/k);}\\n};\\ntypedef Point Vector;\\ntypedef vector<Point> Polygon;\\ndouble norm(Point a){\\n return a.x*a.x+a.y*a.y;\\n}\\ndouble abs(Point a){\\n return sqrt(norm(a));\\n}\\ndouble dot(Point a,Point b){\\n return a.x*b.x+a.y*b.y;\\n}\\ndouble cross(Point a,Point b){\\n return a.x*b.y-a.y*b.x;\\n}\\nconst double PI=3.141592653589793238;\\nPoint trans(double k){\\n return Point(cos(k*2*PI),sin(k*2*PI));\\n}\\nint n,m;\\nPolygon p;\\ndouble dp[50][50][50];\\ndouble dfs(int b,int c,int d){\\n if(d==m) return 0;\\n if(dp[b][c][d]>=0) return dp[b][c][d];\\n double res=0;\\n for(int a=c;a!=b;a=(a+1)%n){\\n res=max(res,dfs(b,a,d+1)+abs(cross(p[a]-p[b],p[c]-p[b])));\\n }\\n return dp[b][c][d]=res;\\n}\\nsigned main(){\\n while(cin>>n>>m,n||m){\\n p.clear();\\n p.resize(n);\\n for(int i=0;i<n;i++){\\n double k;\\n cin>>k;\\n p[i]=trans(k);\\n //cout<<p[i].x<<\\\" \\\"<<p[i].y<<endl;\\n }\\n for(int i=0;i<50;i++)\\n for(int j=0;j<50;j++)\\n\\tfor(int k=0;k<50;k++)\\n\\t dp[i][j][k]=-1;\\n double ans=0;\\n for(int i=0;i<n;i++){\\n for(int j=0;j<n;j++){\\n\\tif(i==j) continue;\\n\\tans=max(ans,dfs(i,j,2));\\n }\\n }\\n printf(\\\"%.6f\\\\n\\\",ans/2.0);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 4396,\n \"score_of_the_acc\": -0.2582,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1222_1977735\",\n \"code_snippet\": \"#include <vector>\\n#include <list>\\n#include <map>\\n#include <set>\\n#include <queue>\\n#include <deque>\\n#include <stack>\\n#include <algorithm>\\n#include <functional>\\n#include <numeric>\\n#include <utility>\\n#include <sstream>\\n#include <iostream>\\n#include <iomanip>\\n#include <cstdio>\\n#include <cmath>\\n#include <cstdlib>\\n#include <cctype>\\n#include <string>\\n#include <cstring>\\nusing namespace std;\\n#define REP(i,n) for(int i = 0; i < (int)n; i++)\\n#define FOR(i,a,b) for(int i = a; i < (int)b; i++)\\n#define pb push_back\\n#define mp make_pair\\ntypedef vector<int> vi;\\ntypedef pair<int, int> pi;\\ntypedef long long ll;\\nconst int INF = 1<<28;\\nconst ll MOD = 1000000007;\\nconst int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};\\n\\ndouble area(double a, double b, double c) {\\n\\treturn sin((b-a)*2*M_PI)/2 + sin((c-b)*2*M_PI)/2 + sin((a-c)*2*M_PI)/2;\\n}\\n\\nint main() {\\n\\tios_base::sync_with_stdio(0);\\n\\tcin.tie(0);\\n\\n\\tint n, m;\\n\\twhile(cin >> n >> m, n|m) {\\n\\t\\tdouble dp[40][40][40] = {};\\n\\t\\tdouble p[n];\\n\\t\\tREP(i, n)\\n\\t\\t\\tcin >> p[i];\\n\\t\\tREP(i, m-2) {\\n\\t\\t\\tREP(j, n-2) {\\n\\t\\t\\t\\tFOR(k, j+2, n) {\\n\\t\\t\\t\\t\\tFOR(l, j+1, k) {\\n\\t\\t\\t\\t\\t\\tif(i)\\n\\t\\t\\t\\t\\t\\t\\tdp[i][j][k] = max(dp[i][j][k], dp[i-1][j][l] + area(p[j], p[l], p[k]));\\n\\t\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\t\\tdp[i][j][k] = max(dp[i][j][k], area(p[j], p[l], p[k]));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tdouble ans = -1;\\n\\t\\tREP(i, n) REP(j, n)\\n\\t\\t\\tans = max(ans, dp[m-3][i][j]);\\n\\t\\tcout << fixed << setprecision(6) << ans << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 1864,\n \"score_of_the_acc\": -0.188,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1222_1876158\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define MAX 45\\n#define PI acos(-1)\\n#define INF (1<<29)\\ntypedef pair<double, double> P;\\n\\nint N, M;\\ndouble memo[MAX][MAX][MAX];\\nvector<double> x, y;\\n\\ndouble area(int a, int b, int c)\\n{\\n vector<P> p(3);\\n p[0] = P(x[a], y[a]);\\n p[1] = P(x[b], y[b]);\\n p[2] = P(x[c], y[c]); \\n \\n double res = 0;\\n for (int i = 1; i < 4; i++) {\\n\\tres += (p[i%3].first - p[i-1].first) * (p[i%3].second + p[i-1].second);\\n }\\n res /= 2.0;\\n return abs(res);\\n}\\n\\ndouble get_max_area(int L, int R, int m)\\n{\\n if (m == M) {\\n return 0;\\n } \\n double &res = memo[L][R][m];\\n if (res != -1) {\\n return res;\\n }\\n for (int i = R+1; i < N; i++) {\\n res = max(res, get_max_area(L, i, m+1) + area(L, R, i));\\n }\\n return res;\\n}\\n\\nint main()\\n{\\n double p;\\n while (cin >> N >> M, N) {\\n x.clear(); y.clear();\\n x.resize(N); y.resize(N);\\n for (int i = 0; i < N; i++) {\\n cin >> p;\\n p *= (2.0 * PI);\\n x[i] = cos(p); y[i] = sin(p);\\n }\\n for (int i = 0; i < N; i++) {\\n for (int j = 0; j < N; j++) {\\n for (int k = 0; k < N; k++) {\\n memo[i][j][k] = -1;\\n }\\n }\\n }\\n\\n double mx = 0;\\n for (int i = 0; i < N; i++) {\\n for (int j = i+1; j < N; j++) {\\n for (int k = j+1; k < N; k++) {\\n mx = max(mx, get_max_area(i, k, 3) + area(i, j, k));\\n }\\n }\\n }\\n printf(\\\"%.6f\\\\n\\\", mx);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 4076,\n \"score_of_the_acc\": -0.1508,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1222_1751496\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define REP(i,a,b) for(int i=a;i<(int)b;i++)\\n#define rep(i,n) REP(i,0,n)\\n\\n///double dp[44][44];\\nvector<double> ps;\\nint N, M;\\n\\ndouble const pi = acos(-1);\\n\\ndouble triangle(int s, int t, int k) {\\n vector<int> idxs = {s, t, k};\\n sort(idxs.begin(), idxs.end());\\n\\n double a = 2 * pi * ps[idxs[0]];\\n double b = 2 * pi * ps[idxs[1]];\\n double c = 2 * pi * ps[idxs[2]];\\n\\n double ba = b - a;\\n double cb = c - b;\\n double ac = a - c;\\n\\n while(ba < 0) { ba += 2 * pi; }\\n while(cb < 0) { cb += 2 * pi; }\\n while(ac < 0) { ac += 2 * pi; }\\n\\n return (sin(ba) + sin(cb) + sin(ac)) / 2.0;\\n}\\n\\nint st;\\nmap<pair<int, int>, double> mp;\\n\\ndouble dfs(int curr, int rem) {\\n if(rem == 0) { return 0.0; }\\n if(N + st - curr + 1 <= 1) { return -100000000; }\\n if(mp.find({curr, rem}) != mp.end()) { return mp[{curr, rem}]; }\\n auto& ret = mp[{curr, rem}];\\n\\n REP(i, curr + 1, N + st) {\\n double d = triangle(st % N, curr % N, i % N);\\n d += dfs(i, rem-1);\\n ret = max(ret, d);\\n }\\n return ret;\\n}\\n\\nint main() {\\n\\n for(;cin >> N >> M && (N|M);) {\\n ps.clear();\\n ps.resize(N);\\n rep(i, N) cin >> ps[i];\\n sort(ps.begin(), ps.end());\\n double ans = -10000000000;\\n rep(i, N) {\\n mp.clear();\\n st = i;\\n ans = max(ans, dfs(i, M-1));\\n }\\n\\n printf(\\\"%.6f\\\\n\\\", ans);\\n\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 720,\n \"memory_kb\": 3592,\n \"score_of_the_acc\": -0.6971,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1222_1751313\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef pair<double,double> P;\\ndouble S(double a,double b,double c) {\\n double s=(a+b+c)/2;\\n return sqrt(s*(s-a)*(s-b)*(s-c));\\n}\\ndouble D(P a,P b) {\\n return sqrt((a.first-b.first)*(a.first-b.first)+(a.second-b.second)*(a.second-b.second));\\n}\\ndouble calc(P a,P b, P c) {\\n return S(D(a,b),D(a,c),D(b,c));\\n}\\n \\ndouble toRad(double agl) {\\n return agl*M_PI/180.0;\\n}\\nP Q(double e) {\\n double w=toRad(360*e);\\n return P(sin(w),cos(w));\\n}\\n\\nint main() {\\n int n,m;\\n while(cin >> n >> m && n) {\\n P p[n];\\n for(int i=0; i<n; i++) {\\n double x;\\n cin >> x;\\n p[i]=Q(x);\\n }\\n double ans=0;\\n for(int i=0; i<n; i++) {\\n double dp[n][m+1];\\n for(int j=0;j<n;j++)for(int k=0;k<=m;k++)dp[j][k]=-1; \\n for(int j=i+1; j<n; j++) dp[j][2]=0;\\n for(int j=i+1; j<n; j++) {\\n for(int k=2; k<m; k++) {\\n if(dp[j][k]<0) continue;\\n for(int l=j+1; l<n; l++) {\\n dp[l][k+1]=max(dp[l][k+1],dp[j][k]+calc(p[i],p[j],p[l]));\\n if(k+1==m) ans=max(ans,dp[l][k+1]);\\n }\\n }\\n } \\n }\\n printf(\\\"%.6f\\\\n\\\",ans);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 1256,\n \"score_of_the_acc\": -0.0254,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1222_1751304\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef complex<double> P;\\n\\ndouble dp[41][41][41][41];\\ndouble getA[41][41][41];\\nint nx[41];\\nconst double INF = 1e100;\\n\\ndouble cross( P a, P b ){ return a.real() * b.imag() - a.imag() * b.real(); }\\n\\nint N,M;\\n\\nP getpos(double p){\\n double a = 2*M_PI*p;\\n return P( cos(a), sin(a) );\\n}\\n\\nvoid init(const vector<P> pos){\\n for(int i=0;i<N;i++) nx[i] = (i+1)%N;\\n for(int i=0;i<N;i++)\\n for(int j=0;j<N;j++)\\n for(int k=0;k<N;k++)\\n for(int l=0;l<=M;l++)\\n dp[i][j][k][l] = -1.0;\\n\\n for(int i=0;i<N;i++)\\n for(int j=0;j<N;j++)\\n for(int k=0;k<N;k++)\\n getA[i][j][k] = cross( pos[j]-pos[i], pos[k]-pos[i] )/2.0;\\n \\n}\\n\\n\\ndouble solve(int a,int b,int c,int m){\\n if( abs(dp[a][b][c][m]+1.0) > 0.5 ) return dp[a][b][c][m];\\n if( m == M ) return dp[a][b][c][m] = 0.0;\\n if( c == a ) return dp[a][b][c][m] = -INF;\\n int nc = nx[c];\\n return dp[a][b][c][m] = max( solve( a, c, nc, m+1 ) + getA[a][b][c],\\n solve( a, b, nc, m ) ); \\n}\\n\\nint main(){\\n while( cin >> N >> M && (N||M) ){\\n vector<P> pos;\\n for(int i=0;i<N;i++){\\n double p; cin >> p;\\n pos.push_back( getpos(p) );\\n }\\n init(pos);\\n double res = 0.0;\\n for(int i=0;i<N;i++){\\n for(int j=0;j<N;j++){\\n if( i == j ) continue;\\n res = max( res, solve( i, j, nx[j], 2 ) );\\n }\\n }\\n printf(\\\"%.6lf\\\\n\\\",res);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 23748,\n \"score_of_the_acc\": -1.0763,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1222_1751295\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef complex<double> P;\\n#define MAX_N 45\\ndouble PI = acos(-1.0);\\ndouble INF = 1e9;\\n\\nint n,m;\\nP t[MAX_N];\\ndouble dp[MAX_N][MAX_N];\\n\\ndouble calc(P s,P t){\\n return imag(t*conj(s))/2.0;\\n}\\n\\ndouble solve(int si){\\n P a[MAX_N];\\n for(int i=0;i<n;i++){\\n a[i]=t[(i+si)%n];\\n }\\n\\n for(int i=0;i<MAX_N;i++)\\n for(int j=0;j<MAX_N;j++)\\n\\tdp[i][j]=-INF;\\n dp[0][1]=0;\\n\\n double res=0;\\n\\n for(int i=0;i<n;i++){\\n for(int j=1;j<m;j++){\\n for(int k=i+1;k<n;k++){\\n\\tdp[k][j+1]=max(dp[k][j+1],dp[i][j]+calc(a[i],a[k]));\\n }\\n }\\n res=max(res, dp[i][m]+calc(a[i],a[0]));\\n }\\n return res;\\n}\\n\\nint main(){\\n while(1){\\n cin>>n>>m;\\n if(n==0&&m==0)break;\\n for(int i=0;i<n;i++){\\n double d;\\n cin>>d;\\n t[i]=P(cos(d*2.0*PI),sin(d*2.0*PI));\\n }\\n double ans=0;\\n for(int i=0;i<n;i++)ans=max(ans,solve(i));\\n printf(\\\"%.6f\\\\n\\\",ans);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 1276,\n \"score_of_the_acc\": -0.0433,\n \"final_rank\": 2\n }\n]","isConversational":false}}},{"rowIdx":686,"cells":{"group_id":{"kind":"string","value":"aoj_1226_cpp"},"problem_description":{"kind":"string","value":"Problem C:\nFishnet\nA fisherman named Etadokah awoke in a very small island. He could see calm, beautiful and blue sea around the island. The previous night he had encountered a terrible storm and had reached this uninhabited island. Some wrecks of his ship were spread around him. He found a square wood-frame and a long thread among the wrecks. He had to survive in this island until someone came and saved him.\nIn order to catch fish, he began to make a kind of fishnet by cutting the long thread into short threads and fixing them at pegs on the square wood-frame (Figure 1). He wanted to know the sizes of the meshes of the fishnet to see whether he could catch small fish as well as large ones.\nThe wood-frame is perfectly square with four thin edges one meter long.. a bottom edge, a top edge, a left edge, and a right edge. There are\nn\npegs on each edge, and thus there are 4\nn\npegs in total. The positions ofpegs are represented by their (\nx\n,\ny\n)-coordinates. Those of an example case with\nn\n= 2 are depicted in Figures 2 and 3. The position of the\ni\nth peg on the bottom edge is represented by (\na\ni\n, 0) . That on the top edge, on the left edge and on the right edge are represented by (\nb\ni\n, 1) , (0,\nc\ni\n), and (1,\nd\ni\n), respectively. The long thread is cut into 2\nn\nthreads with appropriate lengths. The threads are strained between (\na\ni\n, 0) and (\nb\ni\n, 1) , and between (0,\nc\ni\n) and (1,\nd\ni\n) (\ni\n= 1,...,\nn\n) .\nYou should write a program that reports the size of the largest mesh among the (\nn\n+ 1)\n2\nmeshes of the fishnet made by fixing the threads at the pegs. You may assume that the thread he found is long enough to make the fishnet and that the wood-frame is thin enough for neglecting its thickness.\nFigure 1. A wood-frame with 8 pegs.\nFigure 2. Positions of pegs (indicated by small black circles)\nFigure 3. A fishnet and the largest mesh (shaded)\nInput\nThe input consists of multiple subproblems followed by a line containing a zero that indicates the end of input. Each subproblem is given in the following format.\nn\na\n1\na\n2\n...\na\nn\nb\n1\nb\n2\n...\nb\nn\nc\n1\nc\n2\n...\nc\nn\nd\n1\nd\n2\n...\nd\nn\nAn integer\nn\nfollowed by a newline is the number of pegs on each edge.\na\n1\n,...,\na\nn\n,\nb\n1\n,...,\nb\nn\n,\nc\n1\n,...,\nc\nn\n,\nd\n1\n,...,\nd\nn\nare decimal fractions, and they are separated by a space character except that\na\nn\n,\nb\nn\n,\nc\nn\nand\nd\nn\nare followed by a new line. Each\na\ni\n(\ni\n= 1,...,\nn\n) indicates the\nx\n-coordinate of the\ni\nth peg on the bottom edge. Each\nb\ni\n(\ni\n= 1,...,\nn\n) indicates the\nx\n-coordinate of the\ni\nth peg on the top edge. Each\nc\ni\n(\ni\n= 1,...,\nn\n) indicates the\ny\n-coordinate of the\ni\nth peg on the left edge. Each\nd\ni\n(\ni\n= 1,...,\nn\n) indicates the\ny\n-coordinate of the\ni\nth peg on the right edge. The decimal fractions are represented by 7 digits after the decimal point. In addition you may assume that 0 <\nn\n≤ 30 , 0 <\na\n1\n<\na\n2\n< ... <\na\nn\n< 1, 0 <\nb\n1\n<\nb\n2\n< ... <\nb\nn\n< 1 , 0 <\nc\n1\n<\nc\n2\n< ... <\nc\nn\n< 1 and 0 <\nd\n1\n≤\nd\n2\n< ... <\nd\nn\n< 1 .\nOutput\nFor each subpr\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1226_3043409","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-10;\nconst double INF = 1e12;\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};\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}\n\nP crosspointLL(const L &l, const L &m) {\n double A = cross(l[1]-l[0], m[1]-m[0]);\n double B = cross(l[1]-l[0], l[1]-m[0]);\n return m[0] + B/A *(m[1]-m[0]);\n}\ndouble getarea(const VP &poly){\n double ret = 0;\n for (int i=0; i<(int)poly.size(); i++){ \n ret += cross(poly[i], poly[(i+1)%poly.size()]);\n }\n return ret*0.5;\n}\nVP convex_cut(const VP& p, const L& l){\n VP ret;\n int n = p.size();\n for(int i=0; i<n; i++){\n P curr = p[i];\n P next = p[(i+1)%n];\n if(ccw(l[0], l[1], curr) != -1) ret.push_back(curr);\n if(ccw(l[0], l[1], curr) *ccw(l[0], l[1], next) == -1){\n ret.push_back(crosspointLL(L(curr, next), l));\n }\n }\n return ret;\n}\n\n\nint main(){\n while(1){\n int n;\n cin >> n;\n if(n==0) break;\n\n double in;\n VP a(n+2),b(n+2),c(n+2),d(n+2);\n for(int i=1; i<=n; i++){ cin >> in; a[i] = P(in, 0); }\n for(int i=1; i<=n; i++){ cin >> in; b[i] = P(in, 1); }\n for(int i=1; i<=n; i++){ cin >> in; c[i] = P(0, in); }\n for(int i=1; i<=n; i++){ cin >> in; d[i] = P(1, in); }\n VP sq{P(0,0),P(1,0),P(1,1),P(0,1)};\n a[0] = c[0] = sq[0];\n a[n+1] = d[0] = sq[1];\n b[n+1] = d[n+1] = sq[2];\n b[0] = c[n+1] = sq[3];\n\n double ans = 0;\n for(int i=0; i<n+1; i++){\n for(int j=0; j<n+1; j++){\n L cut[4] = {L(b[i], a[i]), L(a[i+1], b[i+1]), L(c[j], d[j]), L(d[j+1], c[j+1])};\n VP poly = sq;\n for(int t=0; t<4; t++){\n poly = convex_cut(poly, cut[t]);\n }\n ans = max(ans, getarea(poly));\n }\n }\n cout << fixed << setprecision(6);\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3296,"score_of_the_acc":-0.9258,"final_rank":5},{"submission_id":"aoj_1226_2669485","code_snippet":"#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\nusing ld = long double;\nconst ld eps = 1e-9;\n\n\n/* 幾何の基本 */\n\n#include <complex>\n\ntypedef complex<ld> Point;\n\n\nconst ld pi = acos(-1.0);\nconst ld dtop = pi / 180.;\nconst ld ptod = 1. / dtop;\n\nnamespace std {\n\tbool operator<(const Point &lhs, const Point &rhs) {\n\t\tif (lhs.real() < rhs.real() - eps) return true;\n\t\tif (lhs.real() > rhs.real() + eps) return false;\n\t\treturn lhs.imag() < rhs.imag();\n\t}\n}\n\n// 点の入力\nPoint input_Point() {\n\tld x, y;\n\tcin >> x >> y;\n\treturn Point(x, y);\n}\n\n// 誤差つき等号判定\nbool eq(const ld a, const ld b) {\n\treturn (abs(a - b) < eps);\n}\n\n// 内積\nld dot(const Point& a, const Point& b) {\n\treturn real(conj(a) * b);\n}\n\n// 外積\nld cross(const Point& a, const Point& b) {\n\treturn imag(conj(a) * b);\n}\n\n// 直線の定義\nclass Line {\npublic:\n\tPoint a, b;\n\tLine() : a(Point(0, 0)), b(Point(0, 0)) {}\n\tLine(Point a, Point b) : a(a), b(b) {}\n\tPoint operator[](const int _num)const {\n\t\tif (_num == 0)return a;\n\t\telse if (_num == 1)return b;\n\t\telse {\n\t\t\tassert(false);\n\t\t\treturn Point();\n\t\t}\n\t}\n};\n\n// 円の定義\nclass Circle {\npublic:\n\tPoint p;\n\tld r;\n\tCircle() : p(Point(0, 0)), r(0) {}\n\tCircle(Point p, ld r) : p(p), r(r) {}\n};\n\n// ccw\n// 1: a,b,cが反時計周りの順に並ぶ\n//-1: a,b,cが時計周りの順に並ぶ\n// 2: c,a,bの順に直線に並ぶ\n//-2: a,b,cの順に直線に並ぶ\n// 0: a,c,bの順に直線に並ぶ\nint ccw(const Point& a, const Point &b, const Point &c) {\n\tconst Point nb(b - a);\n\tconst Point nc(c - a);\n\tif (cross(nb, nc) > eps) return 1; // a,b,cが反時計周りの順に並ぶ\n\tif (cross(nb, nc) < -eps) return -1; // a,b,cが時計周りの順に並ぶ\n\tif (dot(nb, nc) < 0) return 2; // c,a,bの順に直線に並ぶ\n\tif (norm(nb) < norm(nc)) return -2; // a,b,cの順に直線に並ぶ\n\treturn 0; // a,c,bの順に直線に並ぶ\n}\n\n\n/* 交差判定 */\n\n// 直線と直線の交差判定\nbool isis_ll(const Line& l, const Line& m) {\n\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\n}\n\n// 直線と線分の交差判定\nbool isis_ls(const Line& l, const Line& s) {\n\treturn isis_ll(l, s) &&\n\t\t(cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < eps);\n}\n\n// 線分と線分の交差判定\nbool isis_ss(const Line& s, const Line& t) {\n\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\n\t\tccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\n}\n\n// 点の直線上判定\nbool isis_lp(const Line& l, const Point& p) {\n\treturn (abs(cross(l.b - p, l.a - p)) < eps);\n}\n\n// 点の線分上判定\nbool isis_sp(const Line& s, const Point& p) {\n\treturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\n}\n\n// 垂線の足\nPoint proj(const Line &l, const Point& p) {\n\tld t = dot(p - l.a, l.b - l.a) / norm(l.a - l.b);\n\treturn l.a + t * (l.b - l.a);\n}\n\n//線対象の位置にある点\nPoint reflect(const Line &l, const Point &p) {\n\tPoint pr = proj(l, p);\n\treturn pr * 2.l - p;\n}\n\n// 直線と直線の交点\nPoint is_ll(const Line &s, const Line& t) {\n\tPoint sv = s.b - s.a, tv = t.b - t.a;\n\tassert(cross(sv, tv) != 0);\n\treturn s.a + sv * cross(tv, t.a - s.a) / cross(tv, sv);\n}\n// 直線と直線の交点\nvector<Point> is_ll2(const Line &s, const Line& t) {\n\tPoint sv = s.b - s.a, tv = t.b - t.a;\n\tif (cross(sv, tv) != 0)return vector<Point>(1, is_ll(s, t));\n\telse {\n\t\tvector<Point>ans;\n\t\tfor (int k = 0; k < 2; ++k) {\n\t\t\tif (isis_sp(s, t[k]) && find(ans.begin(), ans.end(), t[k]) == ans.end())ans.push_back(t[k]);\n\t\t\tif (isis_sp(t, s[k]) && find(ans.begin(), ans.end(), s[k]) == ans.end())ans.push_back(s[k]);\n\t\t}\n\t\treturn ans;\n\t}\n}\n// 線分と線分の交点\n// 重なってる部分あるとassert(false)\nPoint is_ss(const Line &s, const Line& t) {\n\tif (isis_ss(s, t)) {\n\t\tfor (int k = 0; k < 2; ++k) {\n\t\t\tfor (int l = 0; l < 2; ++l) {\n\t\t\t\tif (s[k] == t[l])return s[k];\n\t\t\t}\n\t\t}\n\t\treturn is_ll(s, t);\n\t}\n\telse {\n\t\t//先にisis_ssしてね\n\t\tassert(false);\n\t\treturn Point(0, 0);\n\t}\n}\n// 線分と線分の交点\nvector<Point> is_ss2(const Line &s, const Line& t) {\n\tvector<Point> kouho(is_ll2(s, t));\n\tvector<Point>ans;\n\tfor (auto p : kouho) {\n\t\tif (isis_sp(s, p) && isis_sp(t, p))ans.emplace_back(p);\n\t}\n\treturn ans;\n}\n// 直線と点の距離\nld dist_lp(const Line& l, const Point& p) {\n\treturn abs(p - proj(l, p));\n}\n\n//直線と直線の距離\nld dist_ll(const Line& l, const Line& m) {\n\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\n}\n\n// 直線と線分の距離\nld dist_ls(const Line& l, const Line& s) {\n\treturn isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));\n}\n\n// 線分と点の距離\nld dist_sp(const Line& s, const Point& p) {\n\tPoint r = proj(s, p);\n\treturn isis_sp(s, r) ? abs(r - p) : min(abs(s.a - p), abs(s.b - p));\n}\n\n// 線分と線分の距離\nld dist_ss(const Line& s, const Line& t) {\n\tif (isis_ss(s, t)) return 0;\n\treturn min({ dist_sp(s, t.a), dist_sp(s, t.b), dist_sp(t, s.a), dist_sp(t, s.b) });\n}\n\n\n//直線と直線の二等分線のベクトル\nLine line_bisection(const Line &s, const Line &t) {\n\tconst Point laglanju(is_ll(s, t));\n\tconst Point avec = !(abs(laglanju - s[0])<eps) ? s[0] - laglanju : s[1] - laglanju;\n\tconst Point bvec = !(abs(laglanju - t[0])<eps) ? t[0] - laglanju : t[1] - laglanju;\n\n\treturn Line(laglanju, laglanju + (abs(bvec)*avec + abs(avec)*bvec) / (abs(avec) + abs(bvec)));\n}\n//点と点の垂直二等分線 aを左に見ながら\nLine point_bisection(const Point&a, const Point&b) {\n\tconst Point cen((a + b) / 2.l);\n\tconst Point vec = (b - a)*Point(0, 1);\n\treturn Line(cen, cen + vec);\n}\n\n//三つの点からなる外心\nPoint outer_center(const vector<Point>&ps) {\n\tassert(ps.size() == 3);\n\tLine l1 = point_bisection(ps[0], ps[1]);\n\tLine l2 = point_bisection(ps[1], ps[2]);\n\treturn is_ll(l1, l2);\n}\n\n\n//三つの直線からなる内心\n//三つの直線が並行でないことは確かめといてね\nPoint inner_center(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tfor (int i = 0; i <static_cast<int>(ls.size()); ++i) {\n\t\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\n\t}\n\tif (vertics[0] == vertics[1] || vertics[1] == vertics[2] || vertics[2] == vertics[0])return vertics[0];\n\tLine bi1(line_bisection(Line(vertics[0], vertics[1]), Line(vertics[0], vertics[2])));\n\tLine bi2(line_bisection(Line(vertics[1], vertics[2]), Line(vertics[1], vertics[0])));\n\tif (bi1[0] == bi2[0])return bi1[0];\n\telse {\n\t\treturn is_ll(bi1, bi2);\n\t}\n}\n\n//三つの直線からなる傍心\n//三つの直線が並行でないことは確かめといてね\nvector<Point> ex_center(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tfor (int i = 0; i < static_cast<int>(ls.size()); ++i) {\n\t\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\n\t}\n\tif (abs(vertics[0] - vertics[1])<eps || abs(vertics[1] - vertics[2])<eps || (abs(vertics[2] - vertics[0])<eps))return vector<Point>();\n\tvector<Point>ecs;\n\tfor (int i = 0; i < 3; ++i) {\n\t\tLine bi1(line_bisection(Line(vertics[i], vertics[i] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[i], vertics[(i + 1) % 3])));\n\t\tLine bi2(line_bisection(Line(vertics[(i + 1) % 3], vertics[(i + 1) % 3] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[(i + 1) % 3], vertics[i])));\n\t\tecs.push_back(is_ll(bi1, bi2));\n\t}\n\treturn ecs;\n}\n\n\n//a,b:並行\n//c:並行でない\n//三つの直線から同距離の位置を求める。\nvector<Point> same_dis(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tvertics.push_back(is_ll(ls[0], ls[2]));\n\tvertics.push_back(is_ll(ls[1], ls[2]));\n\n\tif (abs(vertics[0] - vertics[1]) < eps)return vector<Point>{vertics[0]};\n\tLine bis(line_bisection(ls[0], ls[1]));\n\tvector<Point>ecs;\n\n\tLine abi(line_bisection(Line(vertics[0], vertics[1]), ls[0]));\n\tecs.push_back(is_ll(bis, abi));\n\n\n\tLine bbi(line_bisection(Line(vertics[0], 2.l*vertics[0] - vertics[1]), ls[0]));\n\tecs.push_back(is_ll(bis, bbi));\n\n\treturn ecs;\n}\n/* 円 */\n\n// 円と円の交点\nvector<Point> is_cc(const Circle& c1, const Circle& c2) {\n\tvector<Point> res;\n\tld d = abs(c1.p - c2.p);\n\tld rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\n\tld dfr = c1.r * c1.r - rc * rc;\n\tif (abs(dfr) < eps) dfr = 0.0;\n\telse if (dfr < 0.0) return res; // no intersection\n\tld rs = sqrt(dfr);\n\tPoint diff = (c2.p - c1.p) / d;\n\tres.push_back(c1.p + diff * Point(rc, rs));\n\tif (dfr != 0.0) res.push_back(c1.p + diff * Point(rc, -rs));\n\treturn res;\n}\n\n/*\n点が円の中にいるか\n0 => out\n1 => on\n2 => in*/\nint is_in_Circle(const Point& p, const Circle &cir) {\n\tld dis = abs(cir.p - p);\n\tif (dis > cir.r + eps)return 0;\n\telse if (dis < cir.r - eps)return 2;\n\telse return 1;\n}\nint is_in_Circle(const Circle &cir, const Point& p) {\n\tld dis = abs(cir.p - p);\n\tif (dis > cir.r + eps)return 0;\n\telse if (dis < cir.r - eps)return 2;\n\telse return 1;\n}\n/*\n円lcが円rcの中にいるか\n0 => out\n1 => on\n2 => in*/\nint Circle_in_Circle(const Circle &lc, const Circle&rc) {\n\tld dis = abs(lc.p - rc.p);\n\tif (dis < rc.r - lc.r - eps)return 2;\n\telse if (dis>rc.r - lc.r + eps)return 0;\n\telse return 1;\n}\n\n// 円と直線の交点\nvector<Point> is_lc(const Circle& c, const Line& l) {\n\tvector<Point> res;\n\tld d = dist_lp(l, c.p);\n\tif (d < c.r + eps) {\n\t\tld len = (d > c.r) ? 0.0 : sqrt(c.r * c.r - d * d); //safety;\n\t\tPoint nor = (l.a - l.b) / abs(l.a - l.b);\n\t\tres.push_back(proj(l, c.p) + len * nor);\n\t\tres.push_back(proj(l, c.p) - len * nor);\n\t}\n\treturn res;\n}\n\n// 円と線分の距離\nvector<Point> is_sc(const Circle& c, const Line& l) {\n\tvector<Point> v = is_lc(c, l), res;\n\tfor (Point p : v)\n\t\tif (isis_sp(l, p)) res.push_back(p);\n\treturn res;\n}\n\n// 円と点の接線\nvector<Line> tangent_cp(const Circle& c, const Point& p) {\n\tvector<Line> ret;\n\tPoint v = c.p - p;\n\tld d = abs(v);\n\tld l = sqrt(norm(v) - c.r * c.r);\n\tif (isnan(l)) { return ret; }\n\tPoint v1 = v * Point(l / d, c.r / d);\n\tPoint v2 = v * Point(l / d, -c.r / d);\n\tret.push_back(Line(p, p + v1));\n\tif (l < eps) return ret;\n\tret.push_back(Line(p, p + v2));\n\treturn ret;\n}\n\n// 円と円の接線\nvector<Line> tangent_cc(const Circle& c1, const Circle& c2) {\n\tvector<Line> ret;\n\tif (abs(c1.p - c2.p) - (c1.r + c2.r) > -eps) {\n\t\tPoint center = (c1.p * c2.r + c2.p * c1.r) / (c1.r + c2.r);\n\t\tret = tangent_cp(c1, center);\n\t}\n\tif (abs(c1.r - c2.r) > eps) {\n\t\tPoint out = (-c1.p * c2.r + c2.p * c1.r) / (c1.r - c2.r);\n\t\tvector<Line> nret = tangent_cp(c1, out);\n\t\tret.insert(ret.end(), nret.begin(), nret.end());\n\t}\n\telse {\n\t\tPoint v = c2.p - c1.p;\n\t\tv /= abs(v);\n\t\tPoint q1 = c1.p + v * Point(0, 1) * c1.r;\n\t\tPoint q2 = c1.p + v * Point(0, -1) * c1.r;\n\t\tret.push_back(Line(q1, q1 + v));\n\t\tret.push_back(Line(q2, q2 + v));\n\t}\n\treturn ret;\n}\n//二つの円の重なり面積\nld two_Circle_area(const Circle&l, const Circle&r) {\n\tld dis = abs(l.p - r.p);\n\tif (dis > l.r + r.r)return 0;\n\telse if (dis + r.r < l.r) {\n\t\treturn r.r*r.r*pi;\n\t}\n\telse if (dis + l.r < r.r) {\n\t\treturn l.r*l.r*pi;\n\t}\n\telse {\n\t\tld ans = (l.r)*(l.r)*acos((dis*dis + l.r*l.r - r.r*r.r) / (2 * dis*l.r)) +\n\t\t\t(r.r)*(r.r)*acos((dis*dis + r.r*r.r - l.r*l.r) / (2 * dis*r.r)) -\n\t\t\tsqrt(4 * dis*dis*l.r*l.r - (dis*dis + l.r*l.r - r.r*r.r)*(dis*dis + l.r*l.r - r.r*r.r)) / 2;\n\t\treturn ans;\n\t}\n\n}\n\n/* 多角形 */\n\ntypedef vector<Point> Polygon;\n\n\n\n//多角形(複数の点)の最小包含円をO(N=頂点数)で求めるアルゴリズム\n//同一直線上に三つの点がないこと\n#include<random>\nCircle welzl(vector<Point>ps) {\n\tstruct solver {\n\t\tCircle solve(vector<Point>&ps, vector<Point>&rs) {\n\t\t\tif (ps.empty() || rs.size() == 3) {\n\t\t\t\tif (rs.size() == 1) {\n\t\t\t\t\treturn Circle(Point(rs[0]), 0);\n\t\t\t\t}\n\t\t\t\telse if (rs.size() == 2) {\n\t\t\t\t\treturn Circle((rs[0] + rs[1]) / 2.0l, abs(rs[1] - rs[0]) / 2);\n\t\t\t\t}\n\t\t\t\telse if (rs.size() == 3) {\n\t\t\t\t\tvector<Line> ls(3);\n\t\t\t\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\t\t\t\tls[i] = Line(rs[i], rs[(i + 1) % 3]);\n\t\t\t\t\t}\n\t\t\t\t\tPoint center = outer_center(rs);\n\t\t\t\t\treturn Circle(center, abs(center - rs[0]));\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\treturn Circle(Point(), 0);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\n\t\t\t\tPoint p_ba = ps.back();\n\t\t\t\tps.pop_back();\n\t\t\t\tCircle d = solve(ps, rs);\n\t\t\t\tps.push_back(p_ba);\n\t\t\t\tif (is_in_Circle(d, p_ba)) {\n\t\t\t\t\treturn d;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\trs.push_back(p_ba);\n\t\t\t\t\tps.pop_back();\n\t\t\t\t\tauto ans = solve(ps, rs);\n\t\t\t\t\tps.push_back(p_ba);\n\t\t\t\t\trs.pop_back();\n\t\t\t\t\treturn ans;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}so;\n\tstd::random_device rd;\n\tstd::mt19937 mt(rd());\n\tshuffle(ps.begin(), ps.end(), mt);\n\tvector<Point>rs;\n\tCircle ans = so.solve(ps, rs);\n\treturn ans;\n}\n// 面積\nld get_area(const Polygon &p) {\n\tld res = 0;\n\tint n = p.size();\n\tfor (int j = 0; j<n; ++j) res += cross(p[j], p[(j + 1) % n]);\n\treturn res / 2;\n}\n\n//多角形の回転方向\nbool is_counter_clockwise(const Polygon &poly) {\n\tld angle = 0;\n\tint n = poly.size();\n\tfor(int i=0;i<n;++i) {\n\t\tPoint a = poly[i], b = poly[(i + 1) % n], c = poly[(i + 2) % n];\n\t\tangle += arg((c - b) / (b - a));\n\t}\n\treturn angle > eps;\n}\n\n// 円の内外判定\n/*0 => out\n1 => on\n2 => in*/\nint is_in_Polygon(const Polygon &poly, const Point& p) {\n\tld angle = 0;\n\tint n = poly.size();\n\tfor(int i=0;i<n;++i) {\n\t\tPoint a = poly[i], b = poly[(i + 1) % n];\n\t\tif (isis_sp(Line(a, b), p)) return 1;\n\t\tangle += arg((b - p) / (a - p));\n\t}\n\treturn eq(angle, 0) ? 0 : 2;\n}\n//円の内外判定2 高速\nenum { out, on, in };\nint convex_contains(const Polygon &P, const Point &p) {\n\tconst int n = P.size();\n\tPoint g = (P[0] + P[n / 3] + P[2 * n / 3]) / 3.0l; // inner-point\n\tint a = 0, b = n;\n\twhile (a + 1 < b) { // invariant: c is in fan g-P[a]-P[b]\n\t\tint c = (a + b) / 2;\n\t\tif (cross(P[a] - g, P[c] - g) > 0) { // angle < 180 deg\n\t\t\tif (cross(P[a] - g, p - g) > 0 && cross(P[c] - g, p - g) < 0) b = c;\n\t\t\telse a = c;\n\t\t}\n\t\telse {\n\t\t\tif (cross(P[a] - g, p - g) < 0 && cross(P[c] - g, p - g) > 0) a = c;\n\t\t\telse b = c;\n\t\t}\n\t}\n\tb %= n;\n\tif (cross(P[a] - p, P[b] - p) < 0) return 0;\n\tif (cross(P[a] - p, P[b] - p) > 0) return 2;\n\treturn 1;\n}\n\n// 凸包\n//点や線を返すことも有り得るので注意\nPolygon convex_hull(vector<Point> ps) {\n\tint n = ps.size();\n\tint k = 0;\n\tsort(ps.begin(), ps.end());\n\tPolygon ch(2 * n);\n\tfor (int i = 0; i < n; ch[k++] = ps[i++])\n\t\twhile (k >= 2 && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\n\tfor (int i = n - 2, t = k + 1; i >= 0; ch[k++] = ps[i--])\n\t\twhile (k >= t && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\n\tch.resize(k - 1);\n\treturn ch;\n}\n\n\n\n//凸カット\nvector<Polygon> convex_cut(const Polygon &ps, const Line& l) {\n\tint n = ps.size();\n\tPolygon q;\n\tPolygon r;\n\tfor(int i=0;i<n;++i) {\n\t\tPoint a = ps[i], b = ps[(i + 1) % n];\n\t\tLine m = Line(a, b);\n\t\tif (ccw(l.a, l.b, a) != -1) q.push_back(a);\n\t\tif (ccw(l.a, l.b, a) != 1) r.push_back(a);\n\t\tif (ccw(l.a, l.b, a) * ccw(l.a, l.b, b) < 0 && isis_ll(l, m)) {\n\t\t\tq.push_back(is_ll(l, m));\n\t\t\tr.push_back(is_ll(l, m));\n\t\t}\n\t}\n\tconst vector<Polygon>polys{ q,r };\n\treturn polys;\n}\n\nint main() {\n\twhile (true) {\n\t\tint N;cin>>N;\n\t\tif(!N)break;\n\t\tvector<ld>us,ds,ls,rs;\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tld n;cin>>n;\n\t\t\tds.push_back(n);\n\t\t}\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tld n; cin >> n;\n\t\t\tus.push_back(n);\n\t\t}\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tld n; cin >> n;\n\t\t\tls.push_back(n);\n\t\t}\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tld n; cin >> n;\n\t\t\trs.push_back(n);\n\t\t}\n\n\t\tPolygon start_poly{\n\t\t\tPoint(0,0),\n\t\t\tPoint(1,0),\n\t\t\tPoint(1,1),\n\t\t\tPoint(0,1)\n\t\t};\n\n\t\tvector<Polygon>polys{ start_poly };\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tvector<Polygon>nextpolys;\n\t\t\tfor (auto po : polys) {\n\t\t\t\tLine l(Point(ds[i],0),Point(us[i],1));\n\t\t\t\tauto pos=convex_cut(po,l);\n\n\t\t\t\tfor (auto aa : pos) {\n\t\t\t\t\tif (abs(get_area(aa)) > eps) {\n\n\t\t\t\t\t\tnextpolys.push_back(aa);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tpolys=nextpolys;\n\t\t}\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tvector<Polygon>nextpolys;\n\t\t\tfor (auto po : polys) {\n\t\t\t\tLine l(Point(0,ls[i]), Point(1,rs[i]));\n\t\t\t\tauto pos = convex_cut(po, l);\n\n\t\t\t\tfor (auto aa : pos) {\n\t\t\t\t\tif (abs(get_area(aa)) > eps) {\n\n\t\t\t\t\t\tnextpolys.push_back(aa);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tpolys = nextpolys;\n\t\t}\n\t\tld ans=0;\n\t\tfor (auto poly : polys) {\n\t\t\tans=max(ans,abs(get_area(poly)));\n\t\t}\n\t\tcout<<setprecision(6)<<fixed<<ans<<endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":240,"memory_kb":3560,"score_of_the_acc":-2,"final_rank":6},{"submission_id":"aoj_1226_2340439","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define int long long\n#define EPS (1e-10)\nstruct Point{\n double x,y;\n Point(){}\n Point(double x,double y):x(x),y(y){}\n Point operator+(Point a){return Point(x+a.x,y+a.y);}\n Point operator-(Point a){return Point(x-a.x,y-a.y);}\n Point operator*(double k){return Point(x*k,y*k);}\n Point operator/(double k){return Point(x/k,y/k);}\n};\ntypedef Point Vector;\ntypedef vector<Point> Polygon;\nstruct Segment{\n Point p1,p2;\n Segment(){}\n Segment(Point p1,Point p2):p1(p1),p2(p2){}\n};\ntypedef Segment Line;\ndouble norm(Point a){\n return a.x*a.x+a.y*a.y;\n}\ndouble abs(Point a){\n return sqrt(norm(a));\n}\ndouble dot(Point a,Point b){\n return a.x*b.x+a.y*b.y;\n}\ndouble cross(Point a,Point b){\n return a.x*b.y-a.y*b.x;\n}\nconst double PI=3.141592653589793238;\nPoint trans(double k){\n return Point(cos(k*2*PI),sin(k*2*PI));\n}\nint ccw(Point p0,Point p1,Point p2){\n Vector a=p1-p0;\n Vector b=p2-p0;\n if(cross(a,b)>EPS) return 1;\n if(cross(a,b)<-EPS) return -1;\n if(dot(a,b)<-EPS) return 2;\n if(norm(a)<norm(b)) return -2;\n return 0;\n}\nPoint getCrossPointLL(Line l1,Line l2){\n double a=cross(l1.p2-l1.p1,l2.p2-l2.p1);\n double b=cross(l1.p2-l1.p1,l1.p2-l2.p1);\n if(abs(a)<EPS&&abs(b)<EPS) return l2.p1;\n return l2.p1+(l2.p2-l2.p1)*(b/a);\n}\nPolygon convexCut(Polygon p,Line l){\n Polygon q;\n for(int i=0;i<(int)p.size();i++){\n Point a=p[i],b=p[(i+1)%p.size()];\n if(ccw(l.p1,l.p2,a)!=-1) q.push_back(a);\n if(ccw(l.p1,l.p2,a)*ccw(l.p1,l.p2,b)<0)\n q.push_back(getCrossPointLL(Line(a,b),l));\n }\n return q;\n}\ndouble area(Polygon s){\n double res=0;\n for(int i=0;i<(int)s.size();i++){\n res+=cross(s[i],s[(i+1)%s.size()])/2.0;\n }\n return abs(res);\n}\nint n,m;\nPolygon a,b,c,d;\nsigned main(){\n while(cin>>n,n){\n a.clear();\n b.clear();\n c.clear();\n d.clear();\n double k;\n a.push_back(Point(0,0));\n b.push_back(Point(0,1));\n c.push_back(Point(0,0));\n d.push_back(Point(1,0));\n for(int i=0;i<n&&cin>>k;i++) a.push_back(Point(k,0));\n for(int i=0;i<n&&cin>>k;i++) b.push_back(Point(k,1));\n for(int i=0;i<n&&cin>>k;i++) c.push_back(Point(0,k));\n for(int i=0;i<n&&cin>>k;i++) d.push_back(Point(1,k));\n a.push_back(Point(1,0));\n b.push_back(Point(1,1));\n c.push_back(Point(0,1));\n d.push_back(Point(1,1));\n double ans=0;\n Polygon ba(4);\n ba[0]=Point(0,0);\n ba[1]=Point(1,0);\n ba[2]=Point(1,1);\n ba[3]=Point(0,1);\n for(int i=0;i<n+1;i++){\n for(int j=0;j<n+1;j++){\n\tPolygon t(ba);\n\tt=convexCut(t,Line(b[i],a[i]));\n\tt=convexCut(t,Line(a[i+1],b[i+1]));\n\tt=convexCut(t,Line(c[j],d[j]));\n\tt=convexCut(t,Line(d[j+1],c[j+1]));\n\tans=max(ans,area(t));\n }\n } \n printf(\"%.6f\\n\",ans);\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3068,"score_of_the_acc":-0.8618,"final_rank":4},{"submission_id":"aoj_1226_1983926","code_snippet":"#include <vector>\n#include <list>\n#include <map>\n#include <set>\n#include <queue>\n#include <deque>\n#include <stack>\n#include <algorithm>\n#include <functional>\n#include <numeric>\n#include <utility>\n#include <sstream>\n#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <cmath>\n#include <cstdlib>\n#include <cctype>\n#include <string>\n#include <cstring>\nusing namespace std;\n#define REP(i,n) for(int i = 0; i < (int)n; i++)\n#define FOR(i,a,b) for(int i = a; i < (int)b; i++)\n#define pb push_back\n#define mp make_pair\ntypedef vector<int> vi;\ntypedef pair<int, int> pi;\ntypedef long long ll;\ntypedef unsigned long long ull;\nconst int IINF = 1<<28;\nconst ll MOD = 1000000007;\nconst int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};\n\n// Geometric Library\n#include <complex>\n#define curr(P, i) P[i]\n#define next(P, i) P[(i+1)%P.size()]\ntypedef complex<double> P;\ntypedef vector<P> G;\nconst double EPS = 1e-8;\nconst double INF = 1e12;\nnamespace std {\n\tbool operator < (const P& a, const P& b) {\n\t\t//return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n\t\tif(imag(a) < imag(b))\n\t\t\treturn true;\n\t\tif(imag(a) == imag(b) && real(a) < real(b))\n\t\t\treturn true;\n\t\treturn false;\n\t}\n}\ndouble cross(const P& a, const P& b) { return imag(conj(a)*b); }\ndouble dot(const P& a, const P& b) { return real(conj(a)*b); }\nstruct L : public vector<P> {\n\tL(const P &a, const P &b) {\n\t\tpush_back(a); push_back(b);\n\t}\n};\nint ccw(P a, P b, P c) {\n\tb -= a; c -= a;\n\tif (cross(b, c) > 0) return +1; // counter clockwise\n\tif (cross(b, c) < 0) return -1; // clockwise\n\tif (dot(b, c) < 0) return +2; // c--a--b on line\n\tif (norm(b) < norm(c)) return -2; // a--b--c on line\n\treturn 0;\n}\nP crosspoint(const L &l, const L &m) {\n\tdouble A = cross(l[1] - l[0], m[1] - m[0]);\n\tdouble B = cross(l[1] - l[0], l[1] - m[0]);\n\tif (abs(A) < EPS && abs(B) < EPS) return m[0]; // same line\n\treturn m[0] + B / A * (m[1] - m[0]);\n}\nG convex_cut(const G& g, const L& l) {\n\tG Q;\n\tfor (int i = 0; i < g.size(); ++i) {\n\t\tP A = curr(g, i), B = next(g, i);\n\t\tif (ccw(l[0], l[1], A) != -1) Q.push_back(A);\n\t\tif (ccw(l[0], l[1], A)*ccw(l[0], l[1], B) < 0)\n\t\tQ.push_back(crosspoint(L(A, B), l));\n\t}\n\treturn Q;\n}\ndouble area2(const G& g) {\n\tdouble A = 0;\n\tfor (int i = 0; i < g.size(); ++i) \n\t\tA += cross(curr(g, i), next(g, i));\n\treturn A / 2.0;\n}\n\nint main() {\n\tios_base::sync_with_stdio(0);\n\tcin.tie(0);\n\n\n\tint n;\n\twhile(cin >> n, n) {\n\t\tvector<G> v(n+2);\n\t\tREP(i, 4) {\n\t\t\tREP(j, n) {\n\t\t\t\tdouble in; cin >> in;\n\t\t\t\tif(i == 0)\n\t\t\t\t\tv[0].pb(P(0, in));\n\t\t\t\telse if(i == 1)\n\t\t\t\t\tv[n+1].pb(P(1, in));\n\t\t\t\telse if(i == 2)\n\t\t\t\t\tv[j+1].pb(P(in, 0));\n\t\t\t\telse if(i == 3)\n\t\t\t\t\tv[j+1].pb(P(in, 1));\n\t\t\t}\n\t\t}\n\t\tREP(i, n)\n\t\t\tREP(j, n)\n\t\t\t\tv[i+1].pb(crosspoint(L(v[i+1][0], v[i+1][1]), L(v[0][j], v[n+1][j])));\n\t\tv[0].pb(P(0, 0)); v[0].pb(P(0, 1));\n\t\tv[n+1].pb(P(1, 0)); v[n+1].pb(P(1, 1));\n\t\tREP(i, n+2)\n\t\t\tsort(v[i].begin(), v[i].end());\n\t\tdouble ans = 0;\n\t\tREP(i, n+1) {\n\t\t\tREP(j, n+1) {\n\t\t\t\tG g;\n\t\t\t\tg.pb(v[i][j]);\n\t\t\t\tg.pb(v[i+1][j]);\n\t\t\t\tg.pb(v[i+1][j+1]);\n\t\t\t\tg.pb(v[i][j+1]);\n\t\t\t\tans = max(ans, area2(g));\n\t\t\t}\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1328,"score_of_the_acc":-0.373,"final_rank":3},{"submission_id":"aoj_1226_331877","code_snippet":"#include <string> \n#include <algorithm> \n#include <cfloat> \n#include <climits> \n#include <cmath> \n#include <complex> \n#include <cstdio> \n#include <cstdlib> \n#include <cstring> \n#include <functional> \n#include <iostream> \n#include <map> \n#include <memory> \n#include <queue> \n#include <set> \n#include <sstream> \n#include <stack> \n#include <utility> \n#include <vector> \n\n#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)\n#define ALL(x) (x).begin(),(x).end() \ntypedef long long ll;\nusing namespace std; \nconst double eps = 1e-10;\n\nconst int MAX_N = 30;\n\ntypedef complex<double> P;\n\nbool operator < (const P &a, const P &b){\n return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag();\n}\ndouble dot(const P &a, const P &b){\n return real(conj(a) * b);\n}\ndouble cross(const P &a, const P &b){\n return imag(conj(a) * b);\n}\n\nstruct Line : public vector<P> {\n Line(const P &a, const P &b) {\n push_back(a); push_back(b);\n }\n Line(double x1, double y1, double x2, double y2){\n push_back(P(x1, y1));\n push_back(P(x2, y2));\n }\n};\n\ntypedef vector<P> Polygon;\n\nstruct Circle{\n P p; double r;\n Circle(const P &p, double r) : p(p), r(r) { }\n};\n\nP intersection_ls(const Line &a, const Line &b){\n P vb = b[1] - b[0];\n double d1 = abs(cross(vb, a[0] - b[0]));\n double d2 = abs(cross(vb, a[1] - b[0]));\n double t = d1 / (d1 + d2);\n return a[0] + (a[1] - a[0]) * t;\n}\n\nint n;\ndouble a[MAX_N], b[MAX_N], c[MAX_N], d[MAX_N];\nvoid solve(){\n double res = 0.0;\n a[0] = b[0] = c[0] = d[0] = 0.0;\n a[n + 1] = b[n + 1] = c[n + 1] = d[n + 1] = 1.0;\n for(int i = 0; i <= n; ++i){\n for(int j = 0; j <= n; ++j){\n Line l1 = Line(a[i], 0, b[i], 1);\n Line l2 = Line(a[i + 1], 0, b[i + 1], 1);\n Line l3 = Line(0, c[j], 1, d[j]);\n Line l4 = Line(0, c[j + 1], 1, d[j + 1]);\n P p1 = intersection_ls(l1, l3);\n P p2 = intersection_ls(l1, l4);\n P p3 = intersection_ls(l2, l3);\n P p4 = intersection_ls(l2, l4);\n double tmp = (abs(cross(p2 - p1, p3 - p1)) + abs(cross(p3 - p4, p2 - p4))) / 2.0;\n res = max(res, tmp);\n }\n }\n printf(\"%.9f\\n\", res);\n}\nint main(){\n while(cin >> n, n){\n for(int i = 1; i <= n; ++i) cin >> a[i];\n for(int i = 1; i <= n; ++i) cin >> b[i];\n for(int i = 1; i <= n; ++i) cin >> c[i];\n for(int i = 1; i <= n; ++i) cin >> d[i];\n solve();\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":0,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_1226_27311","code_snippet":"#include<iostream>\n#include<cfloat>\n#include<cassert>\n#include<cmath>\n#include<vector>\n\nusing namespace std;\n\n#define EPS (1e-10)\n#define equals(a, b) (fabs((a) - (b)) < EPS )\n#define dle(a, b) (equals(a, b) || a < b )\nstatic const double PI = acos(-1);\n\nclass Point{\n public:\n double x, y;\n \n Point ( double x = 0, double y = 0): x(x), y(y){}\n \n Point operator + ( Point p ){ return Point(x + p.x, y + p.y); }\n Point operator - ( Point p ){ return Point(x - p.x, y - p.y); }\n Point operator * ( double a ){ return Point(x*a, y*a); }\n Point operator / ( double a ){ return Point(x/a, y/a); }\n\n double abs() { return sqrt(norm());}\n double norm() { return x*x + y*y; }\n\n bool operator < ( const Point &p ) const {\n\treturn x != p.x ? x < p.x : y < p.y;\n }\n\n bool operator == ( const Point &p ) const {\n\treturn fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\n }\n};\n\ntypedef Point Vector;\n\nclass Segment{\n public:\n Point p1, p2;\n Segment(Point s = Point(), Point t = Point()): p1(s), p2(t){}\n};\n\ntypedef vector<Point> Polygon;\n\ndouble norm( Vector a ){ return a.x*a.x + a.y*a.y; }\ndouble abs( Vector a ){ return sqrt(norm(a)); }\nPoint polar( double a, double r ){ return Point(cos(r)*a, sin(r)*a);}\ndouble getDistance( Vector a, Vector b ){ return abs(a - b); }\ndouble dot( Vector a, Vector b ){ return a.x*b.x + a.y*b.y; }\ndouble cross( Vector a, Vector b ){ return a.x*b.y - a.y*b.x; }\n\nstatic const int COUNTER_CLOCKWISE = 1;\nstatic const int CLOCKWISE = -1;\nstatic const int ONLINE_BACK = 2;\nstatic const int ONLINE_FRONT = -2;\nstatic const int ON_SEGMENT = 0;\n\nint ccw( Point p0, Point p1, Point p2 ){\n Vector a = p1 - p0;\n Vector b = p2 - p0;\n if ( cross(a, b) > EPS ) return COUNTER_CLOCKWISE;\n if ( cross(a, b) < -EPS ) return CLOCKWISE;\n if ( dot(a, b) < -EPS ) return ONLINE_BACK;\n if ( norm(a) < norm(b) ) return ONLINE_FRONT;\n return ON_SEGMENT;\n}\n\nbool isIntersect(Point p1, Point p2, Point p3, Point p4){\n return ( ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 &&\n\t ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0 );\n}\n\nbool isIntersect(Segment s1, Segment s2){\n return isIntersect(s1.p1, s1.p2, s2.p1, s2.p2);\n}\n\nPoint getCrossPoint(Segment s1, Segment s2){\n assert( isIntersect(s1, s2) );\n Vector base = s2.p2 - s2.p1;\n double d1 = abs(cross(base, s1.p1 - s2.p1));\n double d2 = abs(cross(base, s1.p2 - s2.p1));\n double t = d1/(d1 + d2);\n return s1.p1 + (s1.p2 - s1.p1)*t;\n}\n\ndouble getArea(Polygon p){\n double sum = 0.0;\n for(int i = 0; i < p.size(); i++){\n\tsum += cross(p[i], p[(i+1)%p.size()]);\n }\n return abs(sum/2);\n}\n\n#define MAX 30\n\nint main(){\n double a[MAX+2], b[MAX+2], c[MAX+2], d[MAX+2];\n int n;\n Segment V[MAX+2], H[MAX+2];\n\n Point P[MAX+2][MAX+2];\n\n while( cin >> n && n ){\n\tfor ( int i = 1; i <= n; i++ ) cin >> a[i];\n\tfor ( int i = 1; i <= n; i++ ) cin >> b[i];\n\tfor ( int i = 1; i <= n; i++ ) cin >> c[i];\n\tfor ( int i = 1; i <= n; i++ ) cin >> d[i];\n\n\tV[0] = Segment(Point(0, 0), Point(0, 1));\n\tfor ( int i = 1; i <= n; i++ ){\n\t V[i] = Segment(Point(a[i], 0), Point(b[i], 1));\n\t}\n\tV[n+1] = Segment(Point(1, 0), Point(1, 1));\n\n\tH[0] = Segment(Point(0, 0), Point(1, 0));\n\tfor ( int i = 1; i <= n; i++ ){\n\t H[i] = Segment(Point(0, c[i]), Point(1, d[i]));\n\t}\n\tH[n+1] = Segment(Point(0, 1), Point(1, 1));\n\n\t\n\tfor ( int y = 0; y < n+2; y++ ){\n\t for ( int x = 0; x < n+2; x++ ){\n\t\tP[y][x] = getCrossPoint(H[y], V[x]);\n\t }\n\t}\n\n\tdouble maxa = 0;\n\n\tfor ( int y = 1; y < n+2; y++ ){\n\t for ( int x = 1; x < n+2; x++ ){\n\t\tPolygon S;\n\t\tS.push_back(P[y][x]);\n\t\tS.push_back(P[y][x-1]);\n\t\tS.push_back(P[y-1][x-1]);\n\t\tS.push_back(P[y-1][x]);\n\t\tmaxa = max( maxa, getArea(S) );\n\t }\n\t}\n\n\tprintf(\"%.12lf\\n\", maxa);\n }\n\n\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":0,"score_of_the_acc":0,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_1226_3043409\",\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-10;\\nconst double INF = 1e12;\\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};\\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}\\n\\nP crosspointLL(const L &l, const L &m) {\\n double A = cross(l[1]-l[0], m[1]-m[0]);\\n double B = cross(l[1]-l[0], l[1]-m[0]);\\n return m[0] + B/A *(m[1]-m[0]);\\n}\\ndouble getarea(const VP &poly){\\n double ret = 0;\\n for (int i=0; i<(int)poly.size(); i++){ \\n ret += cross(poly[i], poly[(i+1)%poly.size()]);\\n }\\n return ret*0.5;\\n}\\nVP convex_cut(const VP& p, const L& l){\\n VP ret;\\n int n = p.size();\\n for(int i=0; i<n; i++){\\n P curr = p[i];\\n P next = p[(i+1)%n];\\n if(ccw(l[0], l[1], curr) != -1) ret.push_back(curr);\\n if(ccw(l[0], l[1], curr) *ccw(l[0], l[1], next) == -1){\\n ret.push_back(crosspointLL(L(curr, next), l));\\n }\\n }\\n return ret;\\n}\\n\\n\\nint main(){\\n while(1){\\n int n;\\n cin >> n;\\n if(n==0) break;\\n\\n double in;\\n VP a(n+2),b(n+2),c(n+2),d(n+2);\\n for(int i=1; i<=n; i++){ cin >> in; a[i] = P(in, 0); }\\n for(int i=1; i<=n; i++){ cin >> in; b[i] = P(in, 1); }\\n for(int i=1; i<=n; i++){ cin >> in; c[i] = P(0, in); }\\n for(int i=1; i<=n; i++){ cin >> in; d[i] = P(1, in); }\\n VP sq{P(0,0),P(1,0),P(1,1),P(0,1)};\\n a[0] = c[0] = sq[0];\\n a[n+1] = d[0] = sq[1];\\n b[n+1] = d[n+1] = sq[2];\\n b[0] = c[n+1] = sq[3];\\n\\n double ans = 0;\\n for(int i=0; i<n+1; i++){\\n for(int j=0; j<n+1; j++){\\n L cut[4] = {L(b[i], a[i]), L(a[i+1], b[i+1]), L(c[j], d[j]), L(d[j+1], c[j+1])};\\n VP poly = sq;\\n for(int t=0; t<4; t++){\\n poly = convex_cut(poly, cut[t]);\\n }\\n ans = max(ans, getarea(poly));\\n }\\n }\\n cout << fixed << setprecision(6);\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3296,\n \"score_of_the_acc\": -0.9258,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1226_2669485\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\nusing ld = long double;\\nconst ld eps = 1e-9;\\n\\n\\n/* 幾何の基本 */\\n\\n#include <complex>\\n\\ntypedef complex<ld> Point;\\n\\n\\nconst ld pi = acos(-1.0);\\nconst ld dtop = pi / 180.;\\nconst ld ptod = 1. / dtop;\\n\\nnamespace std {\\n\\tbool operator<(const Point &lhs, const Point &rhs) {\\n\\t\\tif (lhs.real() < rhs.real() - eps) return true;\\n\\t\\tif (lhs.real() > rhs.real() + eps) return false;\\n\\t\\treturn lhs.imag() < rhs.imag();\\n\\t}\\n}\\n\\n// 点の入力\\nPoint input_Point() {\\n\\tld x, y;\\n\\tcin >> x >> y;\\n\\treturn Point(x, y);\\n}\\n\\n// 誤差つき等号判定\\nbool eq(const ld a, const ld b) {\\n\\treturn (abs(a - b) < eps);\\n}\\n\\n// 内積\\nld dot(const Point& a, const Point& b) {\\n\\treturn real(conj(a) * b);\\n}\\n\\n// 外積\\nld cross(const Point& a, const Point& b) {\\n\\treturn imag(conj(a) * b);\\n}\\n\\n// 直線の定義\\nclass Line {\\npublic:\\n\\tPoint a, b;\\n\\tLine() : a(Point(0, 0)), b(Point(0, 0)) {}\\n\\tLine(Point a, Point b) : a(a), b(b) {}\\n\\tPoint operator[](const int _num)const {\\n\\t\\tif (_num == 0)return a;\\n\\t\\telse if (_num == 1)return b;\\n\\t\\telse {\\n\\t\\t\\tassert(false);\\n\\t\\t\\treturn Point();\\n\\t\\t}\\n\\t}\\n};\\n\\n// 円の定義\\nclass Circle {\\npublic:\\n\\tPoint p;\\n\\tld r;\\n\\tCircle() : p(Point(0, 0)), r(0) {}\\n\\tCircle(Point p, ld r) : p(p), r(r) {}\\n};\\n\\n// ccw\\n// 1: a,b,cが反時計周りの順に並ぶ\\n//-1: a,b,cが時計周りの順に並ぶ\\n// 2: c,a,bの順に直線に並ぶ\\n//-2: a,b,cの順に直線に並ぶ\\n// 0: a,c,bの順に直線に並ぶ\\nint ccw(const Point& a, const Point &b, const Point &c) {\\n\\tconst Point nb(b - a);\\n\\tconst Point nc(c - a);\\n\\tif (cross(nb, nc) > eps) return 1; // a,b,cが反時計周りの順に並ぶ\\n\\tif (cross(nb, nc) < -eps) return -1; // a,b,cが時計周りの順に並ぶ\\n\\tif (dot(nb, nc) < 0) return 2; // c,a,bの順に直線に並ぶ\\n\\tif (norm(nb) < norm(nc)) return -2; // a,b,cの順に直線に並ぶ\\n\\treturn 0; // a,c,bの順に直線に並ぶ\\n}\\n\\n\\n/* 交差判定 */\\n\\n// 直線と直線の交差判定\\nbool isis_ll(const Line& l, const Line& m) {\\n\\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\\n}\\n\\n// 直線と線分の交差判定\\nbool isis_ls(const Line& l, const Line& s) {\\n\\treturn isis_ll(l, s) &&\\n\\t\\t(cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < eps);\\n}\\n\\n// 線分と線分の交差判定\\nbool isis_ss(const Line& s, const Line& t) {\\n\\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\\n\\t\\tccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\\n}\\n\\n// 点の直線上判定\\nbool isis_lp(const Line& l, const Point& p) {\\n\\treturn (abs(cross(l.b - p, l.a - p)) < eps);\\n}\\n\\n// 点の線分上判定\\nbool isis_sp(const Line& s, const Point& p) {\\n\\treturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\\n}\\n\\n// 垂線の足\\nPoint proj(const Line &l, const Point& p) {\\n\\tld t = dot(p - l.a, l.b - l.a) / norm(l.a - l.b);\\n\\treturn l.a + t * (l.b - l.a);\\n}\\n\\n//線対象の位置にある点\\nPoint reflect(const Line &l, const Point &p) {\\n\\tPoint pr = proj(l, p);\\n\\treturn pr * 2.l - p;\\n}\\n\\n// 直線と直線の交点\\nPoint is_ll(const Line &s, const Line& t) {\\n\\tPoint sv = s.b - s.a, tv = t.b - t.a;\\n\\tassert(cross(sv, tv) != 0);\\n\\treturn s.a + sv * cross(tv, t.a - s.a) / cross(tv, sv);\\n}\\n// 直線と直線の交点\\nvector<Point> is_ll2(const Line &s, const Line& t) {\\n\\tPoint sv = s.b - s.a, tv = t.b - t.a;\\n\\tif (cross(sv, tv) != 0)return vector<Point>(1, is_ll(s, t));\\n\\telse {\\n\\t\\tvector<Point>ans;\\n\\t\\tfor (int k = 0; k < 2; ++k) {\\n\\t\\t\\tif (isis_sp(s, t[k]) && find(ans.begin(), ans.end(), t[k]) == ans.end())ans.push_back(t[k]);\\n\\t\\t\\tif (isis_sp(t, s[k]) && find(ans.begin(), ans.end(), s[k]) == ans.end())ans.push_back(s[k]);\\n\\t\\t}\\n\\t\\treturn ans;\\n\\t}\\n}\\n// 線分と線分の交点\\n// 重なってる部分あるとassert(false)\\nPoint is_ss(const Line &s, const Line& t) {\\n\\tif (isis_ss(s, t)) {\\n\\t\\tfor (int k = 0; k < 2; ++k) {\\n\\t\\t\\tfor (int l = 0; l < 2; ++l) {\\n\\t\\t\\t\\tif (s[k] == t[l])return s[k];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn is_ll(s, t);\\n\\t}\\n\\telse {\\n\\t\\t//先にisis_ssしてね\\n\\t\\tassert(false);\\n\\t\\treturn Point(0, 0);\\n\\t}\\n}\\n// 線分と線分の交点\\nvector<Point> is_ss2(const Line &s, const Line& t) {\\n\\tvector<Point> kouho(is_ll2(s, t));\\n\\tvector<Point>ans;\\n\\tfor (auto p : kouho) {\\n\\t\\tif (isis_sp(s, p) && isis_sp(t, p))ans.emplace_back(p);\\n\\t}\\n\\treturn ans;\\n}\\n// 直線と点の距離\\nld dist_lp(const Line& l, const Point& p) {\\n\\treturn abs(p - proj(l, p));\\n}\\n\\n//直線と直線の距離\\nld dist_ll(const Line& l, const Line& m) {\\n\\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\\n}\\n\\n// 直線と線分の距離\\nld dist_ls(const Line& l, const Line& s) {\\n\\treturn isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));\\n}\\n\\n// 線分と点の距離\\nld dist_sp(const Line& s, const Point& p) {\\n\\tPoint r = proj(s, p);\\n\\treturn isis_sp(s, r) ? abs(r - p) : min(abs(s.a - p), abs(s.b - p));\\n}\\n\\n// 線分と線分の距離\\nld dist_ss(const Line& s, const Line& t) {\\n\\tif (isis_ss(s, t)) return 0;\\n\\treturn min({ dist_sp(s, t.a), dist_sp(s, t.b), dist_sp(t, s.a), dist_sp(t, s.b) });\\n}\\n\\n\\n//直線と直線の二等分線のベクトル\\nLine line_bisection(const Line &s, const Line &t) {\\n\\tconst Point laglanju(is_ll(s, t));\\n\\tconst Point avec = !(abs(laglanju - s[0])<eps) ? s[0] - laglanju : s[1] - laglanju;\\n\\tconst Point bvec = !(abs(laglanju - t[0])<eps) ? t[0] - laglanju : t[1] - laglanju;\\n\\n\\treturn Line(laglanju, laglanju + (abs(bvec)*avec + abs(avec)*bvec) / (abs(avec) + abs(bvec)));\\n}\\n//点と点の垂直二等分線 aを左に見ながら\\nLine point_bisection(const Point&a, const Point&b) {\\n\\tconst Point cen((a + b) / 2.l);\\n\\tconst Point vec = (b - a)*Point(0, 1);\\n\\treturn Line(cen, cen + vec);\\n}\\n\\n//三つの点からなる外心\\nPoint outer_center(const vector<Point>&ps) {\\n\\tassert(ps.size() == 3);\\n\\tLine l1 = point_bisection(ps[0], ps[1]);\\n\\tLine l2 = point_bisection(ps[1], ps[2]);\\n\\treturn is_ll(l1, l2);\\n}\\n\\n\\n//三つの直線からなる内心\\n//三つの直線が並行でないことは確かめといてね\\nPoint inner_center(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tfor (int i = 0; i <static_cast<int>(ls.size()); ++i) {\\n\\t\\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\\n\\t}\\n\\tif (vertics[0] == vertics[1] || vertics[1] == vertics[2] || vertics[2] == vertics[0])return vertics[0];\\n\\tLine bi1(line_bisection(Line(vertics[0], vertics[1]), Line(vertics[0], vertics[2])));\\n\\tLine bi2(line_bisection(Line(vertics[1], vertics[2]), Line(vertics[1], vertics[0])));\\n\\tif (bi1[0] == bi2[0])return bi1[0];\\n\\telse {\\n\\t\\treturn is_ll(bi1, bi2);\\n\\t}\\n}\\n\\n//三つの直線からなる傍心\\n//三つの直線が並行でないことは確かめといてね\\nvector<Point> ex_center(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tfor (int i = 0; i < static_cast<int>(ls.size()); ++i) {\\n\\t\\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\\n\\t}\\n\\tif (abs(vertics[0] - vertics[1])<eps || abs(vertics[1] - vertics[2])<eps || (abs(vertics[2] - vertics[0])<eps))return vector<Point>();\\n\\tvector<Point>ecs;\\n\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\tLine bi1(line_bisection(Line(vertics[i], vertics[i] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[i], vertics[(i + 1) % 3])));\\n\\t\\tLine bi2(line_bisection(Line(vertics[(i + 1) % 3], vertics[(i + 1) % 3] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[(i + 1) % 3], vertics[i])));\\n\\t\\tecs.push_back(is_ll(bi1, bi2));\\n\\t}\\n\\treturn ecs;\\n}\\n\\n\\n//a,b:並行\\n//c:並行でない\\n//三つの直線から同距離の位置を求める。\\nvector<Point> same_dis(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tvertics.push_back(is_ll(ls[0], ls[2]));\\n\\tvertics.push_back(is_ll(ls[1], ls[2]));\\n\\n\\tif (abs(vertics[0] - vertics[1]) < eps)return vector<Point>{vertics[0]};\\n\\tLine bis(line_bisection(ls[0], ls[1]));\\n\\tvector<Point>ecs;\\n\\n\\tLine abi(line_bisection(Line(vertics[0], vertics[1]), ls[0]));\\n\\tecs.push_back(is_ll(bis, abi));\\n\\n\\n\\tLine bbi(line_bisection(Line(vertics[0], 2.l*vertics[0] - vertics[1]), ls[0]));\\n\\tecs.push_back(is_ll(bis, bbi));\\n\\n\\treturn ecs;\\n}\\n/* 円 */\\n\\n// 円と円の交点\\nvector<Point> is_cc(const Circle& c1, const Circle& c2) {\\n\\tvector<Point> res;\\n\\tld d = abs(c1.p - c2.p);\\n\\tld rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\\n\\tld dfr = c1.r * c1.r - rc * rc;\\n\\tif (abs(dfr) < eps) dfr = 0.0;\\n\\telse if (dfr < 0.0) return res; // no intersection\\n\\tld rs = sqrt(dfr);\\n\\tPoint diff = (c2.p - c1.p) / d;\\n\\tres.push_back(c1.p + diff * Point(rc, rs));\\n\\tif (dfr != 0.0) res.push_back(c1.p + diff * Point(rc, -rs));\\n\\treturn res;\\n}\\n\\n/*\\n点が円の中にいるか\\n0 => out\\n1 => on\\n2 => in*/\\nint is_in_Circle(const Point& p, const Circle &cir) {\\n\\tld dis = abs(cir.p - p);\\n\\tif (dis > cir.r + eps)return 0;\\n\\telse if (dis < cir.r - eps)return 2;\\n\\telse return 1;\\n}\\nint is_in_Circle(const Circle &cir, const Point& p) {\\n\\tld dis = abs(cir.p - p);\\n\\tif (dis > cir.r + eps)return 0;\\n\\telse if (dis < cir.r - eps)return 2;\\n\\telse return 1;\\n}\\n/*\\n円lcが円rcの中にいるか\\n0 => out\\n1 => on\\n2 => in*/\\nint Circle_in_Circle(const Circle &lc, const Circle&rc) {\\n\\tld dis = abs(lc.p - rc.p);\\n\\tif (dis < rc.r - lc.r - eps)return 2;\\n\\telse if (dis>rc.r - lc.r + eps)return 0;\\n\\telse return 1;\\n}\\n\\n// 円と直線の交点\\nvector<Point> is_lc(const Circle& c, const Line& l) {\\n\\tvector<Point> res;\\n\\tld d = dist_lp(l, c.p);\\n\\tif (d < c.r + eps) {\\n\\t\\tld len = (d > c.r) ? 0.0 : sqrt(c.r * c.r - d * d); //safety;\\n\\t\\tPoint nor = (l.a - l.b) / abs(l.a - l.b);\\n\\t\\tres.push_back(proj(l, c.p) + len * nor);\\n\\t\\tres.push_back(proj(l, c.p) - len * nor);\\n\\t}\\n\\treturn res;\\n}\\n\\n// 円と線分の距離\\nvector<Point> is_sc(const Circle& c, const Line& l) {\\n\\tvector<Point> v = is_lc(c, l), res;\\n\\tfor (Point p : v)\\n\\t\\tif (isis_sp(l, p)) res.push_back(p);\\n\\treturn res;\\n}\\n\\n// 円と点の接線\\nvector<Line> tangent_cp(const Circle& c, const Point& p) {\\n\\tvector<Line> ret;\\n\\tPoint v = c.p - p;\\n\\tld d = abs(v);\\n\\tld l = sqrt(norm(v) - c.r * c.r);\\n\\tif (isnan(l)) { return ret; }\\n\\tPoint v1 = v * Point(l / d, c.r / d);\\n\\tPoint v2 = v * Point(l / d, -c.r / d);\\n\\tret.push_back(Line(p, p + v1));\\n\\tif (l < eps) return ret;\\n\\tret.push_back(Line(p, p + v2));\\n\\treturn ret;\\n}\\n\\n// 円と円の接線\\nvector<Line> tangent_cc(const Circle& c1, const Circle& c2) {\\n\\tvector<Line> ret;\\n\\tif (abs(c1.p - c2.p) - (c1.r + c2.r) > -eps) {\\n\\t\\tPoint center = (c1.p * c2.r + c2.p * c1.r) / (c1.r + c2.r);\\n\\t\\tret = tangent_cp(c1, center);\\n\\t}\\n\\tif (abs(c1.r - c2.r) > eps) {\\n\\t\\tPoint out = (-c1.p * c2.r + c2.p * c1.r) / (c1.r - c2.r);\\n\\t\\tvector<Line> nret = tangent_cp(c1, out);\\n\\t\\tret.insert(ret.end(), nret.begin(), nret.end());\\n\\t}\\n\\telse {\\n\\t\\tPoint v = c2.p - c1.p;\\n\\t\\tv /= abs(v);\\n\\t\\tPoint q1 = c1.p + v * Point(0, 1) * c1.r;\\n\\t\\tPoint q2 = c1.p + v * Point(0, -1) * c1.r;\\n\\t\\tret.push_back(Line(q1, q1 + v));\\n\\t\\tret.push_back(Line(q2, q2 + v));\\n\\t}\\n\\treturn ret;\\n}\\n//二つの円の重なり面積\\nld two_Circle_area(const Circle&l, const Circle&r) {\\n\\tld dis = abs(l.p - r.p);\\n\\tif (dis > l.r + r.r)return 0;\\n\\telse if (dis + r.r < l.r) {\\n\\t\\treturn r.r*r.r*pi;\\n\\t}\\n\\telse if (dis + l.r < r.r) {\\n\\t\\treturn l.r*l.r*pi;\\n\\t}\\n\\telse {\\n\\t\\tld ans = (l.r)*(l.r)*acos((dis*dis + l.r*l.r - r.r*r.r) / (2 * dis*l.r)) +\\n\\t\\t\\t(r.r)*(r.r)*acos((dis*dis + r.r*r.r - l.r*l.r) / (2 * dis*r.r)) -\\n\\t\\t\\tsqrt(4 * dis*dis*l.r*l.r - (dis*dis + l.r*l.r - r.r*r.r)*(dis*dis + l.r*l.r - r.r*r.r)) / 2;\\n\\t\\treturn ans;\\n\\t}\\n\\n}\\n\\n/* 多角形 */\\n\\ntypedef vector<Point> Polygon;\\n\\n\\n\\n//多角形(複数の点)の最小包含円をO(N=頂点数)で求めるアルゴリズム\\n//同一直線上に三つの点がないこと\\n#include<random>\\nCircle welzl(vector<Point>ps) {\\n\\tstruct solver {\\n\\t\\tCircle solve(vector<Point>&ps, vector<Point>&rs) {\\n\\t\\t\\tif (ps.empty() || rs.size() == 3) {\\n\\t\\t\\t\\tif (rs.size() == 1) {\\n\\t\\t\\t\\t\\treturn Circle(Point(rs[0]), 0);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (rs.size() == 2) {\\n\\t\\t\\t\\t\\treturn Circle((rs[0] + rs[1]) / 2.0l, abs(rs[1] - rs[0]) / 2);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (rs.size() == 3) {\\n\\t\\t\\t\\t\\tvector<Line> ls(3);\\n\\t\\t\\t\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\t\\t\\t\\tls[i] = Line(rs[i], rs[(i + 1) % 3]);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tPoint center = outer_center(rs);\\n\\t\\t\\t\\t\\treturn Circle(center, abs(center - rs[0]));\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\treturn Circle(Point(), 0);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\n\\t\\t\\t\\tPoint p_ba = ps.back();\\n\\t\\t\\t\\tps.pop_back();\\n\\t\\t\\t\\tCircle d = solve(ps, rs);\\n\\t\\t\\t\\tps.push_back(p_ba);\\n\\t\\t\\t\\tif (is_in_Circle(d, p_ba)) {\\n\\t\\t\\t\\t\\treturn d;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\trs.push_back(p_ba);\\n\\t\\t\\t\\t\\tps.pop_back();\\n\\t\\t\\t\\t\\tauto ans = solve(ps, rs);\\n\\t\\t\\t\\t\\tps.push_back(p_ba);\\n\\t\\t\\t\\t\\trs.pop_back();\\n\\t\\t\\t\\t\\treturn ans;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}so;\\n\\tstd::random_device rd;\\n\\tstd::mt19937 mt(rd());\\n\\tshuffle(ps.begin(), ps.end(), mt);\\n\\tvector<Point>rs;\\n\\tCircle ans = so.solve(ps, rs);\\n\\treturn ans;\\n}\\n// 面積\\nld get_area(const Polygon &p) {\\n\\tld res = 0;\\n\\tint n = p.size();\\n\\tfor (int j = 0; j<n; ++j) res += cross(p[j], p[(j + 1) % n]);\\n\\treturn res / 2;\\n}\\n\\n//多角形の回転方向\\nbool is_counter_clockwise(const Polygon &poly) {\\n\\tld angle = 0;\\n\\tint n = poly.size();\\n\\tfor(int i=0;i<n;++i) {\\n\\t\\tPoint a = poly[i], b = poly[(i + 1) % n], c = poly[(i + 2) % n];\\n\\t\\tangle += arg((c - b) / (b - a));\\n\\t}\\n\\treturn angle > eps;\\n}\\n\\n// 円の内外判定\\n/*0 => out\\n1 => on\\n2 => in*/\\nint is_in_Polygon(const Polygon &poly, const Point& p) {\\n\\tld angle = 0;\\n\\tint n = poly.size();\\n\\tfor(int i=0;i<n;++i) {\\n\\t\\tPoint a = poly[i], b = poly[(i + 1) % n];\\n\\t\\tif (isis_sp(Line(a, b), p)) return 1;\\n\\t\\tangle += arg((b - p) / (a - p));\\n\\t}\\n\\treturn eq(angle, 0) ? 0 : 2;\\n}\\n//円の内外判定2 高速\\nenum { out, on, in };\\nint convex_contains(const Polygon &P, const Point &p) {\\n\\tconst int n = P.size();\\n\\tPoint g = (P[0] + P[n / 3] + P[2 * n / 3]) / 3.0l; // inner-point\\n\\tint a = 0, b = n;\\n\\twhile (a + 1 < b) { // invariant: c is in fan g-P[a]-P[b]\\n\\t\\tint c = (a + b) / 2;\\n\\t\\tif (cross(P[a] - g, P[c] - g) > 0) { // angle < 180 deg\\n\\t\\t\\tif (cross(P[a] - g, p - g) > 0 && cross(P[c] - g, p - g) < 0) b = c;\\n\\t\\t\\telse a = c;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tif (cross(P[a] - g, p - g) < 0 && cross(P[c] - g, p - g) > 0) a = c;\\n\\t\\t\\telse b = c;\\n\\t\\t}\\n\\t}\\n\\tb %= n;\\n\\tif (cross(P[a] - p, P[b] - p) < 0) return 0;\\n\\tif (cross(P[a] - p, P[b] - p) > 0) return 2;\\n\\treturn 1;\\n}\\n\\n// 凸包\\n//点や線を返すことも有り得るので注意\\nPolygon convex_hull(vector<Point> ps) {\\n\\tint n = ps.size();\\n\\tint k = 0;\\n\\tsort(ps.begin(), ps.end());\\n\\tPolygon ch(2 * n);\\n\\tfor (int i = 0; i < n; ch[k++] = ps[i++])\\n\\t\\twhile (k >= 2 && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\\n\\tfor (int i = n - 2, t = k + 1; i >= 0; ch[k++] = ps[i--])\\n\\t\\twhile (k >= t && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\\n\\tch.resize(k - 1);\\n\\treturn ch;\\n}\\n\\n\\n\\n//凸カット\\nvector<Polygon> convex_cut(const Polygon &ps, const Line& l) {\\n\\tint n = ps.size();\\n\\tPolygon q;\\n\\tPolygon r;\\n\\tfor(int i=0;i<n;++i) {\\n\\t\\tPoint a = ps[i], b = ps[(i + 1) % n];\\n\\t\\tLine m = Line(a, b);\\n\\t\\tif (ccw(l.a, l.b, a) != -1) q.push_back(a);\\n\\t\\tif (ccw(l.a, l.b, a) != 1) r.push_back(a);\\n\\t\\tif (ccw(l.a, l.b, a) * ccw(l.a, l.b, b) < 0 && isis_ll(l, m)) {\\n\\t\\t\\tq.push_back(is_ll(l, m));\\n\\t\\t\\tr.push_back(is_ll(l, m));\\n\\t\\t}\\n\\t}\\n\\tconst vector<Polygon>polys{ q,r };\\n\\treturn polys;\\n}\\n\\nint main() {\\n\\twhile (true) {\\n\\t\\tint N;cin>>N;\\n\\t\\tif(!N)break;\\n\\t\\tvector<ld>us,ds,ls,rs;\\n\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\tld n;cin>>n;\\n\\t\\t\\tds.push_back(n);\\n\\t\\t}\\n\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\tld n; cin >> n;\\n\\t\\t\\tus.push_back(n);\\n\\t\\t}\\n\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\tld n; cin >> n;\\n\\t\\t\\tls.push_back(n);\\n\\t\\t}\\n\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\tld n; cin >> n;\\n\\t\\t\\trs.push_back(n);\\n\\t\\t}\\n\\n\\t\\tPolygon start_poly{\\n\\t\\t\\tPoint(0,0),\\n\\t\\t\\tPoint(1,0),\\n\\t\\t\\tPoint(1,1),\\n\\t\\t\\tPoint(0,1)\\n\\t\\t};\\n\\n\\t\\tvector<Polygon>polys{ start_poly };\\n\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\tvector<Polygon>nextpolys;\\n\\t\\t\\tfor (auto po : polys) {\\n\\t\\t\\t\\tLine l(Point(ds[i],0),Point(us[i],1));\\n\\t\\t\\t\\tauto pos=convex_cut(po,l);\\n\\n\\t\\t\\t\\tfor (auto aa : pos) {\\n\\t\\t\\t\\t\\tif (abs(get_area(aa)) > eps) {\\n\\n\\t\\t\\t\\t\\t\\tnextpolys.push_back(aa);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tpolys=nextpolys;\\n\\t\\t}\\n\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\tvector<Polygon>nextpolys;\\n\\t\\t\\tfor (auto po : polys) {\\n\\t\\t\\t\\tLine l(Point(0,ls[i]), Point(1,rs[i]));\\n\\t\\t\\t\\tauto pos = convex_cut(po, l);\\n\\n\\t\\t\\t\\tfor (auto aa : pos) {\\n\\t\\t\\t\\t\\tif (abs(get_area(aa)) > eps) {\\n\\n\\t\\t\\t\\t\\t\\tnextpolys.push_back(aa);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tpolys = nextpolys;\\n\\t\\t}\\n\\t\\tld ans=0;\\n\\t\\tfor (auto poly : polys) {\\n\\t\\t\\tans=max(ans,abs(get_area(poly)));\\n\\t\\t}\\n\\t\\tcout<<setprecision(6)<<fixed<<ans<<endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 3560,\n \"score_of_the_acc\": -2,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1226_2340439\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define int long long\\n#define EPS (1e-10)\\nstruct Point{\\n double x,y;\\n Point(){}\\n Point(double x,double y):x(x),y(y){}\\n Point operator+(Point a){return Point(x+a.x,y+a.y);}\\n Point operator-(Point a){return Point(x-a.x,y-a.y);}\\n Point operator*(double k){return Point(x*k,y*k);}\\n Point operator/(double k){return Point(x/k,y/k);}\\n};\\ntypedef Point Vector;\\ntypedef vector<Point> Polygon;\\nstruct Segment{\\n Point p1,p2;\\n Segment(){}\\n Segment(Point p1,Point p2):p1(p1),p2(p2){}\\n};\\ntypedef Segment Line;\\ndouble norm(Point a){\\n return a.x*a.x+a.y*a.y;\\n}\\ndouble abs(Point a){\\n return sqrt(norm(a));\\n}\\ndouble dot(Point a,Point b){\\n return a.x*b.x+a.y*b.y;\\n}\\ndouble cross(Point a,Point b){\\n return a.x*b.y-a.y*b.x;\\n}\\nconst double PI=3.141592653589793238;\\nPoint trans(double k){\\n return Point(cos(k*2*PI),sin(k*2*PI));\\n}\\nint ccw(Point p0,Point p1,Point p2){\\n Vector a=p1-p0;\\n Vector b=p2-p0;\\n if(cross(a,b)>EPS) return 1;\\n if(cross(a,b)<-EPS) return -1;\\n if(dot(a,b)<-EPS) return 2;\\n if(norm(a)<norm(b)) return -2;\\n return 0;\\n}\\nPoint getCrossPointLL(Line l1,Line l2){\\n double a=cross(l1.p2-l1.p1,l2.p2-l2.p1);\\n double b=cross(l1.p2-l1.p1,l1.p2-l2.p1);\\n if(abs(a)<EPS&&abs(b)<EPS) return l2.p1;\\n return l2.p1+(l2.p2-l2.p1)*(b/a);\\n}\\nPolygon convexCut(Polygon p,Line l){\\n Polygon q;\\n for(int i=0;i<(int)p.size();i++){\\n Point a=p[i],b=p[(i+1)%p.size()];\\n if(ccw(l.p1,l.p2,a)!=-1) q.push_back(a);\\n if(ccw(l.p1,l.p2,a)*ccw(l.p1,l.p2,b)<0)\\n q.push_back(getCrossPointLL(Line(a,b),l));\\n }\\n return q;\\n}\\ndouble area(Polygon s){\\n double res=0;\\n for(int i=0;i<(int)s.size();i++){\\n res+=cross(s[i],s[(i+1)%s.size()])/2.0;\\n }\\n return abs(res);\\n}\\nint n,m;\\nPolygon a,b,c,d;\\nsigned main(){\\n while(cin>>n,n){\\n a.clear();\\n b.clear();\\n c.clear();\\n d.clear();\\n double k;\\n a.push_back(Point(0,0));\\n b.push_back(Point(0,1));\\n c.push_back(Point(0,0));\\n d.push_back(Point(1,0));\\n for(int i=0;i<n&&cin>>k;i++) a.push_back(Point(k,0));\\n for(int i=0;i<n&&cin>>k;i++) b.push_back(Point(k,1));\\n for(int i=0;i<n&&cin>>k;i++) c.push_back(Point(0,k));\\n for(int i=0;i<n&&cin>>k;i++) d.push_back(Point(1,k));\\n a.push_back(Point(1,0));\\n b.push_back(Point(1,1));\\n c.push_back(Point(0,1));\\n d.push_back(Point(1,1));\\n double ans=0;\\n Polygon ba(4);\\n ba[0]=Point(0,0);\\n ba[1]=Point(1,0);\\n ba[2]=Point(1,1);\\n ba[3]=Point(0,1);\\n for(int i=0;i<n+1;i++){\\n for(int j=0;j<n+1;j++){\\n\\tPolygon t(ba);\\n\\tt=convexCut(t,Line(b[i],a[i]));\\n\\tt=convexCut(t,Line(a[i+1],b[i+1]));\\n\\tt=convexCut(t,Line(c[j],d[j]));\\n\\tt=convexCut(t,Line(d[j+1],c[j+1]));\\n\\tans=max(ans,area(t));\\n }\\n } \\n printf(\\\"%.6f\\\\n\\\",ans);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3068,\n \"score_of_the_acc\": -0.8618,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1226_1983926\",\n \"code_snippet\": \"#include <vector>\\n#include <list>\\n#include <map>\\n#include <set>\\n#include <queue>\\n#include <deque>\\n#include <stack>\\n#include <algorithm>\\n#include <functional>\\n#include <numeric>\\n#include <utility>\\n#include <sstream>\\n#include <iostream>\\n#include <iomanip>\\n#include <cstdio>\\n#include <cmath>\\n#include <cstdlib>\\n#include <cctype>\\n#include <string>\\n#include <cstring>\\nusing namespace std;\\n#define REP(i,n) for(int i = 0; i < (int)n; i++)\\n#define FOR(i,a,b) for(int i = a; i < (int)b; i++)\\n#define pb push_back\\n#define mp make_pair\\ntypedef vector<int> vi;\\ntypedef pair<int, int> pi;\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\nconst int IINF = 1<<28;\\nconst ll MOD = 1000000007;\\nconst int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};\\n\\n// Geometric Library\\n#include <complex>\\n#define curr(P, i) P[i]\\n#define next(P, i) P[(i+1)%P.size()]\\ntypedef complex<double> P;\\ntypedef vector<P> G;\\nconst double EPS = 1e-8;\\nconst double INF = 1e12;\\nnamespace std {\\n\\tbool operator < (const P& a, const P& b) {\\n\\t\\t//return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\\n\\t\\tif(imag(a) < imag(b))\\n\\t\\t\\treturn true;\\n\\t\\tif(imag(a) == imag(b) && real(a) < real(b))\\n\\t\\t\\treturn true;\\n\\t\\treturn false;\\n\\t}\\n}\\ndouble cross(const P& a, const P& b) { return imag(conj(a)*b); }\\ndouble dot(const P& a, const P& b) { return real(conj(a)*b); }\\nstruct L : public vector<P> {\\n\\tL(const P &a, const P &b) {\\n\\t\\tpush_back(a); push_back(b);\\n\\t}\\n};\\nint ccw(P a, P b, P c) {\\n\\tb -= a; c -= a;\\n\\tif (cross(b, c) > 0) return +1; // counter clockwise\\n\\tif (cross(b, c) < 0) return -1; // clockwise\\n\\tif (dot(b, c) < 0) return +2; // c--a--b on line\\n\\tif (norm(b) < norm(c)) return -2; // a--b--c on line\\n\\treturn 0;\\n}\\nP crosspoint(const L &l, const L &m) {\\n\\tdouble A = cross(l[1] - l[0], m[1] - m[0]);\\n\\tdouble B = cross(l[1] - l[0], l[1] - m[0]);\\n\\tif (abs(A) < EPS && abs(B) < EPS) return m[0]; // same line\\n\\treturn m[0] + B / A * (m[1] - m[0]);\\n}\\nG convex_cut(const G& g, const L& l) {\\n\\tG Q;\\n\\tfor (int i = 0; i < g.size(); ++i) {\\n\\t\\tP A = curr(g, i), B = next(g, i);\\n\\t\\tif (ccw(l[0], l[1], A) != -1) Q.push_back(A);\\n\\t\\tif (ccw(l[0], l[1], A)*ccw(l[0], l[1], B) < 0)\\n\\t\\tQ.push_back(crosspoint(L(A, B), l));\\n\\t}\\n\\treturn Q;\\n}\\ndouble area2(const G& g) {\\n\\tdouble A = 0;\\n\\tfor (int i = 0; i < g.size(); ++i) \\n\\t\\tA += cross(curr(g, i), next(g, i));\\n\\treturn A / 2.0;\\n}\\n\\nint main() {\\n\\tios_base::sync_with_stdio(0);\\n\\tcin.tie(0);\\n\\n\\n\\tint n;\\n\\twhile(cin >> n, n) {\\n\\t\\tvector<G> v(n+2);\\n\\t\\tREP(i, 4) {\\n\\t\\t\\tREP(j, n) {\\n\\t\\t\\t\\tdouble in; cin >> in;\\n\\t\\t\\t\\tif(i == 0)\\n\\t\\t\\t\\t\\tv[0].pb(P(0, in));\\n\\t\\t\\t\\telse if(i == 1)\\n\\t\\t\\t\\t\\tv[n+1].pb(P(1, in));\\n\\t\\t\\t\\telse if(i == 2)\\n\\t\\t\\t\\t\\tv[j+1].pb(P(in, 0));\\n\\t\\t\\t\\telse if(i == 3)\\n\\t\\t\\t\\t\\tv[j+1].pb(P(in, 1));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tREP(i, n)\\n\\t\\t\\tREP(j, n)\\n\\t\\t\\t\\tv[i+1].pb(crosspoint(L(v[i+1][0], v[i+1][1]), L(v[0][j], v[n+1][j])));\\n\\t\\tv[0].pb(P(0, 0)); v[0].pb(P(0, 1));\\n\\t\\tv[n+1].pb(P(1, 0)); v[n+1].pb(P(1, 1));\\n\\t\\tREP(i, n+2)\\n\\t\\t\\tsort(v[i].begin(), v[i].end());\\n\\t\\tdouble ans = 0;\\n\\t\\tREP(i, n+1) {\\n\\t\\t\\tREP(j, n+1) {\\n\\t\\t\\t\\tG g;\\n\\t\\t\\t\\tg.pb(v[i][j]);\\n\\t\\t\\t\\tg.pb(v[i+1][j]);\\n\\t\\t\\t\\tg.pb(v[i+1][j+1]);\\n\\t\\t\\t\\tg.pb(v[i][j+1]);\\n\\t\\t\\t\\tans = max(ans, area2(g));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << ans << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1328,\n \"score_of_the_acc\": -0.373,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1226_331877\",\n \"code_snippet\": \"#include <string> \\n#include <algorithm> \\n#include <cfloat> \\n#include <climits> \\n#include <cmath> \\n#include <complex> \\n#include <cstdio> \\n#include <cstdlib> \\n#include <cstring> \\n#include <functional> \\n#include <iostream> \\n#include <map> \\n#include <memory> \\n#include <queue> \\n#include <set> \\n#include <sstream> \\n#include <stack> \\n#include <utility> \\n#include <vector> \\n\\n#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)\\n#define ALL(x) (x).begin(),(x).end() \\ntypedef long long ll;\\nusing namespace std; \\nconst double eps = 1e-10;\\n\\nconst int MAX_N = 30;\\n\\ntypedef complex<double> P;\\n\\nbool operator < (const P &a, const P &b){\\n return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag();\\n}\\ndouble dot(const P &a, const P &b){\\n return real(conj(a) * b);\\n}\\ndouble cross(const P &a, const P &b){\\n return imag(conj(a) * b);\\n}\\n\\nstruct Line : public vector<P> {\\n Line(const P &a, const P &b) {\\n push_back(a); push_back(b);\\n }\\n Line(double x1, double y1, double x2, double y2){\\n push_back(P(x1, y1));\\n push_back(P(x2, y2));\\n }\\n};\\n\\ntypedef vector<P> Polygon;\\n\\nstruct Circle{\\n P p; double r;\\n Circle(const P &p, double r) : p(p), r(r) { }\\n};\\n\\nP intersection_ls(const Line &a, const Line &b){\\n P vb = b[1] - b[0];\\n double d1 = abs(cross(vb, a[0] - b[0]));\\n double d2 = abs(cross(vb, a[1] - b[0]));\\n double t = d1 / (d1 + d2);\\n return a[0] + (a[1] - a[0]) * t;\\n}\\n\\nint n;\\ndouble a[MAX_N], b[MAX_N], c[MAX_N], d[MAX_N];\\nvoid solve(){\\n double res = 0.0;\\n a[0] = b[0] = c[0] = d[0] = 0.0;\\n a[n + 1] = b[n + 1] = c[n + 1] = d[n + 1] = 1.0;\\n for(int i = 0; i <= n; ++i){\\n for(int j = 0; j <= n; ++j){\\n Line l1 = Line(a[i], 0, b[i], 1);\\n Line l2 = Line(a[i + 1], 0, b[i + 1], 1);\\n Line l3 = Line(0, c[j], 1, d[j]);\\n Line l4 = Line(0, c[j + 1], 1, d[j + 1]);\\n P p1 = intersection_ls(l1, l3);\\n P p2 = intersection_ls(l1, l4);\\n P p3 = intersection_ls(l2, l3);\\n P p4 = intersection_ls(l2, l4);\\n double tmp = (abs(cross(p2 - p1, p3 - p1)) + abs(cross(p3 - p4, p2 - p4))) / 2.0;\\n res = max(res, tmp);\\n }\\n }\\n printf(\\\"%.9f\\\\n\\\", res);\\n}\\nint main(){\\n while(cin >> n, n){\\n for(int i = 1; i <= n; ++i) cin >> a[i];\\n for(int i = 1; i <= n; ++i) cin >> b[i];\\n for(int i = 1; i <= n; ++i) cin >> c[i];\\n for(int i = 1; i <= n; ++i) cin >> d[i];\\n solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 0,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1226_27311\",\n \"code_snippet\": \"#include<iostream>\\n#include<cfloat>\\n#include<cassert>\\n#include<cmath>\\n#include<vector>\\n\\nusing namespace std;\\n\\n#define EPS (1e-10)\\n#define equals(a, b) (fabs((a) - (b)) < EPS )\\n#define dle(a, b) (equals(a, b) || a < b )\\nstatic const double PI = acos(-1);\\n\\nclass Point{\\n public:\\n double x, y;\\n \\n Point ( double x = 0, double y = 0): x(x), y(y){}\\n \\n Point operator + ( Point p ){ return Point(x + p.x, y + p.y); }\\n Point operator - ( Point p ){ return Point(x - p.x, y - p.y); }\\n Point operator * ( double a ){ return Point(x*a, y*a); }\\n Point operator / ( double a ){ return Point(x/a, y/a); }\\n\\n double abs() { return sqrt(norm());}\\n double norm() { return x*x + y*y; }\\n\\n bool operator < ( const Point &p ) const {\\n\\treturn x != p.x ? x < p.x : y < p.y;\\n }\\n\\n bool operator == ( const Point &p ) const {\\n\\treturn fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\\n }\\n};\\n\\ntypedef Point Vector;\\n\\nclass Segment{\\n public:\\n Point p1, p2;\\n Segment(Point s = Point(), Point t = Point()): p1(s), p2(t){}\\n};\\n\\ntypedef vector<Point> Polygon;\\n\\ndouble norm( Vector a ){ return a.x*a.x + a.y*a.y; }\\ndouble abs( Vector a ){ return sqrt(norm(a)); }\\nPoint polar( double a, double r ){ return Point(cos(r)*a, sin(r)*a);}\\ndouble getDistance( Vector a, Vector b ){ return abs(a - b); }\\ndouble dot( Vector a, Vector b ){ return a.x*b.x + a.y*b.y; }\\ndouble cross( Vector a, Vector b ){ return a.x*b.y - a.y*b.x; }\\n\\nstatic const int COUNTER_CLOCKWISE = 1;\\nstatic const int CLOCKWISE = -1;\\nstatic const int ONLINE_BACK = 2;\\nstatic const int ONLINE_FRONT = -2;\\nstatic const int ON_SEGMENT = 0;\\n\\nint ccw( Point p0, Point p1, Point p2 ){\\n Vector a = p1 - p0;\\n Vector b = p2 - p0;\\n if ( cross(a, b) > EPS ) return COUNTER_CLOCKWISE;\\n if ( cross(a, b) < -EPS ) return CLOCKWISE;\\n if ( dot(a, b) < -EPS ) return ONLINE_BACK;\\n if ( norm(a) < norm(b) ) return ONLINE_FRONT;\\n return ON_SEGMENT;\\n}\\n\\nbool isIntersect(Point p1, Point p2, Point p3, Point p4){\\n return ( ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 &&\\n\\t ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0 );\\n}\\n\\nbool isIntersect(Segment s1, Segment s2){\\n return isIntersect(s1.p1, s1.p2, s2.p1, s2.p2);\\n}\\n\\nPoint getCrossPoint(Segment s1, Segment s2){\\n assert( isIntersect(s1, s2) );\\n Vector base = s2.p2 - s2.p1;\\n double d1 = abs(cross(base, s1.p1 - s2.p1));\\n double d2 = abs(cross(base, s1.p2 - s2.p1));\\n double t = d1/(d1 + d2);\\n return s1.p1 + (s1.p2 - s1.p1)*t;\\n}\\n\\ndouble getArea(Polygon p){\\n double sum = 0.0;\\n for(int i = 0; i < p.size(); i++){\\n\\tsum += cross(p[i], p[(i+1)%p.size()]);\\n }\\n return abs(sum/2);\\n}\\n\\n#define MAX 30\\n\\nint main(){\\n double a[MAX+2], b[MAX+2], c[MAX+2], d[MAX+2];\\n int n;\\n Segment V[MAX+2], H[MAX+2];\\n\\n Point P[MAX+2][MAX+2];\\n\\n while( cin >> n && n ){\\n\\tfor ( int i = 1; i <= n; i++ ) cin >> a[i];\\n\\tfor ( int i = 1; i <= n; i++ ) cin >> b[i];\\n\\tfor ( int i = 1; i <= n; i++ ) cin >> c[i];\\n\\tfor ( int i = 1; i <= n; i++ ) cin >> d[i];\\n\\n\\tV[0] = Segment(Point(0, 0), Point(0, 1));\\n\\tfor ( int i = 1; i <= n; i++ ){\\n\\t V[i] = Segment(Point(a[i], 0), Point(b[i], 1));\\n\\t}\\n\\tV[n+1] = Segment(Point(1, 0), Point(1, 1));\\n\\n\\tH[0] = Segment(Point(0, 0), Point(1, 0));\\n\\tfor ( int i = 1; i <= n; i++ ){\\n\\t H[i] = Segment(Point(0, c[i]), Point(1, d[i]));\\n\\t}\\n\\tH[n+1] = Segment(Point(0, 1), Point(1, 1));\\n\\n\\t\\n\\tfor ( int y = 0; y < n+2; y++ ){\\n\\t for ( int x = 0; x < n+2; x++ ){\\n\\t\\tP[y][x] = getCrossPoint(H[y], V[x]);\\n\\t }\\n\\t}\\n\\n\\tdouble maxa = 0;\\n\\n\\tfor ( int y = 1; y < n+2; y++ ){\\n\\t for ( int x = 1; x < n+2; x++ ){\\n\\t\\tPolygon S;\\n\\t\\tS.push_back(P[y][x]);\\n\\t\\tS.push_back(P[y][x-1]);\\n\\t\\tS.push_back(P[y-1][x-1]);\\n\\t\\tS.push_back(P[y-1][x]);\\n\\t\\tmaxa = max( maxa, getArea(S) );\\n\\t }\\n\\t}\\n\\n\\tprintf(\\\"%.12lf\\\\n\\\", maxa);\\n }\\n\\n\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 0,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":687,"cells":{"group_id":{"kind":"string","value":"aoj_1224_cpp"},"problem_description":{"kind":"string","value":"Problem A:\nStarship Hakodate-maru\nThe surveyor starship Hakodate-maru is famous for her two fuel containers with unbounded capacities. They hold the same type of atomic fuel balls.\nThere, however, is an inconvenience. The shapes of the fuel containers\n#\n1 and\n#\n2 are always cubic and regular tetrahedral respectively. Both of the fuel containers should be either empty or filled according to their shapes. Otherwise, the fuel balls become extremely unstable and may explode in the fuel containers. Thus, the number of fuel balls for the container\n#\n1 should be a cubic number (\nn\n3\nfor some\nn\n= 0, 1, 2, 3,... ) and that for the container\n#\n2 should be a tetrahedral number (\nn\n(\nn\n+ 1)(\nn\n+ 2)/6 for some\nn\n= 0, 1, 2, 3,... ).\nHakodate-maru is now at the star base Goryokaku preparing for the next mission to create a precise and detailed chart of stars and interstellar matters. Both of the fuel containers are now empty. Commander Parus of Goryokaku will soon send a message to Captain Future of Hakodate-maru on how many fuel balls Goryokaku can supply. Captain Future should quickly answer to Commander Parus on how many fuel balls she requests before her ship leaves Goryokaku. Of course, Captain Future and her omcers want as many fuel balls as possible.\nFor example, consider the case Commander Parus offers 151200 fuel balls. If only the fuel container\n#\n1 were available (i.e. ifthe fuel container\n#\n2 were unavailable), at most 148877 fuel balls could be put into the fuel container since 148877 = 53 × 53 × 53 < 151200 < 54 × 54 × 54 . If only the fuel container\n#\n2 were available, at most 147440 fuel balls could be put into the fuel container since 147440 = 95 × 96 × 97/6 < 151200 < 96 × 97 × 98/6 . Using both of the fuel containers\n#\n1 and\n#\n2, 151200 fuel balls can be put into the fuel containers since 151200 = 39 × 39 × 39 + 81 × 82 × 83/6 . In this case, Captain Future's answer should be \"151200\".\nCommander Parus's offer cannot be greater than 151200 because of the capacity of the fuel storages of Goryokaku. Captain Future and her omcers know that well.\nYou are a fuel engineer assigned to Hakodate-maru. Your duty today is to help Captain Future with calculating the number of fuel balls she should request.\nInput\nThe input is a sequence of at most 1024 positive integers. Each line contains a single integer. The sequence is followed by a zero, which indicates the end of data and should not be treated as input. You may assume that none of the input integers is greater than 151200.\nOutput\nThe output is composed of lines, each containing a single integer. Each output integer should be the greatest integer that is the sum of a nonnegative cubic number and a nonnegative tetrahedral number and that is not greater than the corresponding input number. No other characters should appear in the output.\nSample Input\n100\n64\n50\n20\n151200\n0\nOutput for the Sample Input\n99\n64\n47\n20\n151200"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1224_4858248","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n int n;\n while(cin >>n,n){\n int ans = 0;\n for(int i=0;i*i*i<151200; i++){\n int sum = 0;\n for(int j=0; sum <= n ;j++){\n ans = max(ans, sum);\n sum = i*i*i + (j*(j+1)*(j+2))/6.0;\n }\n }cout << ans << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3060,"score_of_the_acc":-0.9129,"final_rank":16},{"submission_id":"aoj_1224_4477120","code_snippet":"#define _GLIBCXX_DEBUG\n#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int n; cin>>n;\n while(n != 0){\n int ans = 0;\n for(int i=0;i*i*i<151200; i++){\n int s = 0;\n for(int j=0; s <= n ;j++){\n ans = max(ans, s);\n s = pow(i, 3) + (j*(j+1)*(j+2))/6.0;\n }\n }\n cout << ans << endl;\n cin >> n;\n }\n}","accuracy":1,"time_ms":140,"memory_kb":3172,"score_of_the_acc":-1.9463,"final_rank":19},{"submission_id":"aoj_1224_2779554","code_snippet":"#include \"bits/stdc++.h\"\n/*\n#include <iostream>\n#include <vector>\n#include <map>\n#include <utility>\n#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <stack>\n#include <queue>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n#include <numeric>\n#include <complex>\n#include <bitset>\n#include <functional>\n#include <stack>\n#include <regex>\n#include <tuple>\n*/\n#define int long long\n#define REP(i,a,n) for(int i=a;i<n;++i)\n#define rep(i,n) REP(i,0,n)\n#define REV(i,a,n) for(int i=n;i>=a;--i)\n#define all(e) e.begin(),e.end()\n#define rall(e) e.rbegin(),e.rend()\n#define pb push_back\n#define mp make_pair\n#define fs first\n#define sc second\n#define mod 1000000007\n#define show(n) cerr<<#n<<\" = \"<<n<<endl\n#define showp(n) cerr<<n.fs<<\", \"<<n.sc<<endl\n#define shows(n) for(auto z:n){cerr<<z<<\", \";}cerr<<endl\n#define showsp(n) for(auto z:n){cerr<<z.fs<<\" \"<<z.sc<<\", \"}cerr<<endl\n\n#define yes printf(\"Yes\\n\")\n#define no printf(\"No\\n\")\n#define case(i) printf(\"Case #%lld: \",i)\n\nusing namespace std;\n\nusing ull=unsigned long long;\nusing vi=vector<int>;\nusing pint=pair<int,int>;\n\nconst int INF=1LL<<55;\n\nint tf;\nint ans=0;\n\nvoid solve(){\n ans = 0;\n int t;\n int i=1;\n while(true){\n t=pow(i,3);\n if(t>tf) break;\n ans=max(ans,t);\n i++;\n }\n int maxA=i;\n i=1;\n while(true){\n t=i*(i+1)*(i+2)/6;\n if(t>tf) break;\n ans=max(ans,t);\n i++;\n }\n int maxB=i;\n rep(i,maxA){\n rep(j,maxB){\n t=pow(i,3)+j*(j+1)*(j+2)/6;\n if(t>tf) break;\n ans=max(ans,t);\n }\n }\n cout<<ans<<endl;\n return;\n}\n\nsigned main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n int i=1;\n int t;\n \n while(cin>>tf,tf){\n solve();\n }\n\n return 0;\n}","accuracy":1,"time_ms":140,"memory_kb":3352,"score_of_the_acc":-2,"final_rank":20},{"submission_id":"aoj_1224_2779543","code_snippet":"#include <iostream>\n#include <cstring>\n#include <cstdlib>\n#include <cmath>\n#include <algorithm>\n#include <functional>\n#include <vector>\n#include <list>\n#include <queue>\n#include <deque>\n#include <stack>\n#include <map>\n#include <set>\n#include <bitset>\n#include <tuple>\n#include <cassert>\n#include <exception>\n#include <iomanip>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<ll,ll> P;\ntypedef vector<int> vi;\ntypedef vector<ll> vll;\ntypedef vector<char> vc;\ntypedef vector<string> vs;\ntypedef vector<P> vp;\n#define rep(i,a,n) for(ll i = (a);i < (n);i++)\n#define per(i,a,n) for(ll i = (a);i > (n);i--)\n#define lep(i,a,n) for(ll i = (a);i <= (n);i++)\n#define pel(i,a,n) for(ll i = (a);i >= (n);i--)\n#define clr(a,b) memset((a),(b),sizeof(a))\n#define pb push_back\n#define mp make_pair\n#define all(c) (c).begin(),(c).end()\n#define sz size()\n#define print(X) cout << (X) << endl\nstatic const int INF = 1e+9+7;\nll n,m,l;\nstring s,t;\nint d[200010],dp[1010][1010];\ndouble w[1000],v[1000];\ndouble box[200010];\nchar field[200][200];\n\nint main(){\n while(1){\n cin >> n;\n if(!n)break;\n ll ans = 0;\n lep(i,1,96){\n l = pow(i,3);\n if(l <= n)ans = max(ans,l);\n }\n lep(i,1,96){\n l = i * (i+1)*(i+2)/6;\n if(l <= n)ans = max(ans,l);\n }\n lep(i,1,96){\n l = pow(i,3);\n lep(j,1,96){\n m = j*(j+1)*(j+2)/6;\n if(l + m <= n)ans = max(ans,l+m);\n }\n }\n print(ans);\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3288,"score_of_the_acc":-1.0578,"final_rank":18},{"submission_id":"aoj_1224_2122304","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define MAX 151200\ntypedef long long ll;\n \nint main(void){\n ll N;\n while(cin >> N, N){\n int ans = 0;\n for(int cube = 0; cube * cube * cube <= MAX; cube++){\n for(int tr = 0; tr * (tr+1) * (tr+2) / 6 <= MAX; tr++){\n int cuben = cube * cube * cube;\n int trn = tr*(tr+1)*(tr+2)/6;\n if(cuben <= N){\n ans = max(ans, cuben);\n }\n if(trn <= N){\n ans = max(ans, trn);\n }\n if(cuben + trn <= N){\n ans = max(ans, cuben + trn);\n }\n }\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3060,"score_of_the_acc":-0.9129,"final_rank":16},{"submission_id":"aoj_1224_2116802","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define MAX 151200\ntypedef long long ll;\n\nint main(void){\n ll N;\n while(cin >> N, N){\n int ans = 0;\n for(int cube = 0; cube * cube * cube <= MAX; cube++){\n for(int tr = 0; tr * (tr+1) * (tr+2) / 6 <= MAX; tr++){\n\tint cuben = cube * cube * cube;\n\tint trn = tr*(tr+1)*(tr+2)/6;\n\tif(cuben <= N){\n\t ans = max(ans, cuben);\n\t}\n\tif(trn <= N){\n\t ans = max(ans, trn);\n\t}\n\tif(cuben + trn <= N){\n\t ans = max(ans, cuben + trn);\n\t}\n }\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3056,"score_of_the_acc":-0.9117,"final_rank":15},{"submission_id":"aoj_1224_1955793","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <string>\n#include <vector>\n#include <deque>\n#include <list>\n#include <algorithm>\n#include <numeric>\n#include <functional>\n#include <cmath>\n#include <cstring>\n#include <cctype>\n#include <sstream>\n#include <set>\n#include <map>\n#include <stack>\n#include <queue>\n#include <complex>\nusing namespace std;\n#define REP(i,n) for(int i = 0; i < (int)n; i++)\n#define FOR(i,a,b) for(int i = a; i < (int)b; i++)\n#define pb push_back\n#define mp make_pair\ntypedef vector<int> vi;\ntypedef pair<int, int> pi;\ntypedef long long ll;\nconst int INF = 1<<28;\nconst ll MOD = 1000000007;\nconst int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};\n\nint main() {\n\tios_base::sync_with_stdio(0);\n\tcin.tie(0);\n\n\tvi v1, v2;\n\tfor(int i=0; i*i*i <= 151200; i++)\n\t\tv1.pb(i*i*i);\n\tfor(int i=0; i*(i+1)*(i+2)/6 <= 151200; i++)\n\t\tv2.pb(i*(i+1)*(i+2)/6);\n\n\tint n;\n\twhile(cin >> n, n) {\n\t\tint ans = 0;\n\t\tREP(i, v1.size())\n\t\t\tREP(j, v2.size())\n\t\t\t\tif(v1[i] + v2[j] <= n && v1[i] + v2[j] > ans) {\n\t\t\t\t\tans = v1[i] + v2[j];\n\t\t\t\t}\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1220,"score_of_the_acc":-0.364,"final_rank":11},{"submission_id":"aoj_1224_1851549","code_snippet":"#include<iostream>\nusing namespace std;\nint g[60], h[100];\nint main() {\n\tfor (int i = 0; i < 60; i++)g[i] = i*i*i;\n\tfor (int i = 0; i < 100; i++)h[i] = i*(i + 1)*(i + 2) / 6;\n\twhile (true) {\n\t\tint p, q = 0; cin >> p; if (p == 0)break;\n\t\tfor (int i = 0; i < 60; i++) {\n\t\t\tfor (int j = 0; j < 100; j++) {\n\t\t\t\tint t = g[i] + h[j];\n\t\t\t\tif (t <= p && q < t)q = t;\n\t\t\t}\n\t\t}\n\t\tcout << q << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1160,"score_of_the_acc":-0.3461,"final_rank":5},{"submission_id":"aoj_1224_1546400","code_snippet":"#include <algorithm>\n#include <functional>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <string>\n#include <sstream>\n#include <iostream>\n#include <iomanip>\n#include <vector>\n#include <list>\n#include <stack>\n#include <queue>\n#include <map>\n#include <set>\n#include <bitset>\n#include <climits>\n\n#define all(c) (c).begin(), (c).end()\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define pb(e) push_back(e)\n#define mp(a, b) make_pair(a, b)\n#define fr first\n#define sc second\n\nconst int INF=100000000;\nint dx[4]={1,0,-1,0};\nint dy[4]={0,1,0,-1};\nusing namespace std;\ntypedef pair<int ,int > P;\ntypedef long long ll;\n\nint N;\nint cubic(int n) {\n return n*n*n;\n}\nint tetrahedral(int n) {\n return n*(n+1)*(n+2)/6;\n}\nvoid solve() {\n int ans=0;\n rep(n1,100) rep(n2,100) {\n if(cubic(n1)+tetrahedral(n2)<=N) {\n ans=max(ans,cubic(n1)+tetrahedral(n2));\n }\n }\n\n cout<<ans<<endl;\n}\n\nint main() {\n while(cin>>N) {\n if(!N) break;\n solve();\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1160,"score_of_the_acc":-0.423,"final_rank":13},{"submission_id":"aoj_1224_1168335","code_snippet":"#include <functional>\n#include <algorithm>\n#include <iostream>\n#include <numeric>\n#include <iomanip>\n#include <utility>\n#include <cstdlib>\n#include <sstream>\n#include <bitset>\n#include <vector>\n#include <cstdio>\n#include <ctime>\n#include <queue>\n#include <deque>\n#include <cmath>\n#include <stack>\n#include <list>\n#include <map>\n#include <set>\n\nusing namespace std;\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nint main(){\n int n;\n while(cin>>n){\n if(n==0)break;\n\n int ma=-1;\n \n rep(i,55){\n rep(j,100){\n int calc= i*i*i + (int)(j*(j+1)*(j+2)/6);\n if( calc <=n ){\n ma=max( ma , calc );\n }\n else break;\n }\n }\n cout<<ma<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1160,"score_of_the_acc":-0.3461,"final_rank":5},{"submission_id":"aoj_1224_1012178","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint main()\n{\n int n, ans;\n vector<int> c1, c2;\n for (int i = 0; i <= 53; i++) {\n c1.push_back(i * i * i);\n }\n for (int i = 0; i <= 95; i++) {\n c2.push_back(i * (i + 1) * (i + 2) / 6);\n }\n while (cin >> n && n) {\n ans = 0;\n for (int i = 0; i < c1.size(); i++) {\n for (int j = 0; j < c2.size(); j++) {\n if (c1[i] + c2[j] > n) {\n continue;\n }\n ans = max(ans, c1[i] + c2[j]);\n }\n }\n cout << ans << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1216,"score_of_the_acc":-0.3628,"final_rank":10},{"submission_id":"aoj_1224_842044","code_snippet":"#include <iostream>\n#include <algorithm>\nusing namespace std;\nconst int MAX_C = 60;\nconst int MAX_T = 150;\n\nint c[MAX_C],t[MAX_T];\n\nvoid init_c(){\n for(int i = 0 ; i < MAX_C ; i++){\n c[i] = i*i*i;\n }\n}\n\nvoid init_t(){\n for(int i = 2 ; i < MAX_T ; i++){\n t[i-2] = i*(i-1)*(i-2)/6;\n }\n}\n\nint main(){\n int n;\n\n init_c();\n init_t();\n\n while(cin >> n ,n){\n int ans = 0;\n\n for(int i = 0 ; i < MAX_C ; i++){\n for(int j = 0 ; j < MAX_T-2 ; j++){\n\tif(c[i]+t[j] <= n){\n\t ans = max(ans , c[i] + t[j]);\n\t}\n }\n }\n cout << ans << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1160,"score_of_the_acc":-0.3461,"final_rank":5},{"submission_id":"aoj_1224_835311","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<map>\nusing namespace std;\nint main(){\n int n;\n while(cin >> n , n){\n int ret = 0, RIPPO = 0;\n for(int i = 0 ; (RIPPO = i * i * i) <= n ; i++ ){\n int SANKAKU = 0;\n for(int j = 0 ; RIPPO + ( SANKAKU = j * ( j + 1 ) * ( j + 2 ) / 6 ) <= n ; j++ ){\n\tret = max( ret, RIPPO + SANKAKU);\n }\n }\n cout << ret << endl;\n } \n}","accuracy":1,"time_ms":10,"memory_kb":1160,"score_of_the_acc":-0.3461,"final_rank":5},{"submission_id":"aoj_1224_751012","code_snippet":"#include <iostream>\n#include <algorithm>\nusing namespace std;\n\n\n\nint A(int num){\n\treturn num*num*num;\n}\n\nint B(int num){\n\treturn (num*(num+1)*(num+2))/6;\n}\n\n\nint main(){\n\tfor(int n,ans=0;cin>>n,n;ans=0){\n\t\tfor(int i=0;i<54;i++){\n\t\t\tfor(int j=0;j<96;j++){\n\t\t\t\tif(A(i)+B(j)<=n)ans=max(ans,A(i)+B(j));\n\t\t\t}\n\t\t}\n\t\tcout<<ans<<endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1160,"score_of_the_acc":-0.3461,"final_rank":5},{"submission_id":"aoj_1224_594562","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\n\n#define M (151200)\n\nvector<int> p, q;\nvoid init() {\n p.push_back(0);\n for (int i = 1; i * i * i <= M; i++) {\n p.push_back(i * i * i);\n }\n q.push_back(0);\n for (int i = 1; i * (i + 1) * (i + 2) / 6 <= M; i++) {\n q.push_back(i * (i + 1) * (i + 2) / 6);\n }\n}\n\nint solve(int n) {\n int ret = 0;\n for (int i = 0; i < p.size(); i++) {\n for (int j = 0; j < q.size(); j++) {\n if (p[i] + q[j] > n) continue;\n ret = max(ret, p[i] + q[j]);\n }\n }\n return ret;\n}\n\nint main() {\n init();\n int n;\n while (cin >> n, n) {\n cout << solve(n) << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1216,"score_of_the_acc":-0.4397,"final_rank":14},{"submission_id":"aoj_1224_528000","code_snippet":"#include <iostream>\n#include <vector>\nusing namespace std;\n\n#define MAX 151200\n\nint main(){\n vector<int> cubic;\n vector<int> tetra;\n\n cubic.push_back(0);\n for(int i = 1; i * i * i <= MAX; i++){\n cubic.push_back(i * i * i);\n }\n tetra.push_back(0);\n for(int i = 1; i * (i + 1) * (i + 2) / 6 <= MAX; i++){\n tetra.push_back(i * (i + 1) * (i + 2) / 6);\n }\n\n int n;\n\n while(cin >> n, n){\n int ans = 0;\n\n for(int i = 0; i < cubic.size(); i++){\n for(int j = 0; j < tetra.size(); j++){\n\tint sum = cubic[i] + tetra[j];\n\n\tif(sum <= n){\n\t ans = max(ans, sum);\n\t}\n }\n }\n\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":1220,"score_of_the_acc":-0.364,"final_rank":11},{"submission_id":"aoj_1224_464177","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<cmath>\nusing namespace std;\nconst int INF = (1 << 21);\n\nint a(int x){\n return x * x * x;\n}\n\nint b(int x){\n return (x * (x - 1) * (x - 2)) / 6;\n}\n\nint c(int n, int x){\n return n - x;\n}\n\nint main(){\n int n;\n while(cin >>n){\n if(n == 0) break;\n int ans = INF, tmp;\n for(int i = 1; i < 100; i++){\n tmp = c(n, a(i));\n if(tmp < 0) break;\n else ans = min(ans, tmp);\n for(int j = 1; j < 100; j++){\n tmp = c(n, a(i) + b(j));\n if(tmp < 0) break;\n else ans = min(ans, tmp);\n }\n\n }\n for(int i = 1; i < 100; i++){\n tmp = c(n, b(i));\n if(tmp < 0) break;\n else ans = min(ans, tmp);\n }\n cout <<n - ans <<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":0,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_1224_464095","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<cmath>\nusing namespace std;\nconst int DEF = (1 << 21);\n\nint a(int x){\n return x * x * x;\n}\n\nint b(int x){\n return (x * (x - 1) * (x - 2)) / 6;\n}\n\nint c(int n, int x){\n return n - x;\n}\n\nint main(){\n int n;\n while(cin >>n){\n if(n == 0) break;\n int ans = DEF, tmp;\n for(int i = 1; i < 100; i++){\n tmp = c(n, a(i));\n if(tmp < 0) break;\n else ans = min(ans, tmp);\n for(int j = 1; j < 100; j++){\n tmp = c(n, a(i) + b(j));\n if(tmp < 0) break;\n else ans = min(ans, tmp);\n }\n\n }\n for(int i = 1; i < 100; i++){\n tmp = c(n, b(i));\n if(tmp < 0) break;\n else ans = min(ans, tmp);\n }\n cout <<n - ans <<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":0,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_1224_392357","code_snippet":"#include <iostream>\n#include <sstream>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <set>\n#include <map>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <cassert>\n\nusing namespace std;\n\n#define FOR(i,k,n) for(int i=(k); i<(int)n; ++i)\n#define REP(i,n) FOR(i,0,n)\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n\ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cout<<*i<<\" \"; cout<<endl; }\n\ntypedef long long ll;\nconst int INF = 100000000;\nconst double EPS = 1e-8;\nconst int MOD = 1000000007;\n\nint main(){\n int n;\n while(cin>>n && n){\n int ans = 0;\n REP(x, 55)REP(y, 96){\n int l = x * x * x + y * (y + 1) * (y + 2) / 6;\n if(l <= n) ans = max(ans, l);\n }\n cout<<ans<<endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":868,"score_of_the_acc":-0.3359,"final_rank":4},{"submission_id":"aoj_1224_354633","code_snippet":"#include <iostream>\n#include <sstream>\n#include <vector>\n#include <list>\n#include <string>\n#include <set>\n#include <map>\n#include <stack>\n#include <queue>\n#include <algorithm>\n#include <numeric>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <climits>\nusing namespace std;\n\nint main() {\n int n;\n while ( cin >> n && n ) {\n int res = 0;\n for ( int i = 0; i < 54; ++ i ) {\n for ( int j = 0; j < 100; ++ j ) {\n int sum = i * i * i + j * ( j + 1 ) * ( j + 2 ) / 6;\n if ( sum <= n ) res = max( res, sum );\n }\n }\n cout << res << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":0,"score_of_the_acc":-0.0769,"final_rank":3}],"string":"[\n {\n \"submission_id\": \"aoj_1224_4858248\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint main() {\\n int n;\\n while(cin >>n,n){\\n int ans = 0;\\n for(int i=0;i*i*i<151200; i++){\\n int sum = 0;\\n for(int j=0; sum <= n ;j++){\\n ans = max(ans, sum);\\n sum = i*i*i + (j*(j+1)*(j+2))/6.0;\\n }\\n }cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3060,\n \"score_of_the_acc\": -0.9129,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1224_4477120\",\n \"code_snippet\": \"#define _GLIBCXX_DEBUG\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint main() {\\n int n; cin>>n;\\n while(n != 0){\\n int ans = 0;\\n for(int i=0;i*i*i<151200; i++){\\n int s = 0;\\n for(int j=0; s <= n ;j++){\\n ans = max(ans, s);\\n s = pow(i, 3) + (j*(j+1)*(j+2))/6.0;\\n }\\n }\\n cout << ans << endl;\\n cin >> n;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 3172,\n \"score_of_the_acc\": -1.9463,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1224_2779554\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n/*\\n#include <iostream>\\n#include <vector>\\n#include <map>\\n#include <utility>\\n#include <algorithm>\\n#include <cmath>\\n#include <cstdio>\\n#include <cstring>\\n#include <stack>\\n#include <queue>\\n#include <set>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <numeric>\\n#include <complex>\\n#include <bitset>\\n#include <functional>\\n#include <stack>\\n#include <regex>\\n#include <tuple>\\n*/\\n#define int long long\\n#define REP(i,a,n) for(int i=a;i<n;++i)\\n#define rep(i,n) REP(i,0,n)\\n#define REV(i,a,n) for(int i=n;i>=a;--i)\\n#define all(e) e.begin(),e.end()\\n#define rall(e) e.rbegin(),e.rend()\\n#define pb push_back\\n#define mp make_pair\\n#define fs first\\n#define sc second\\n#define mod 1000000007\\n#define show(n) cerr<<#n<<\\\" = \\\"<<n<<endl\\n#define showp(n) cerr<<n.fs<<\\\", \\\"<<n.sc<<endl\\n#define shows(n) for(auto z:n){cerr<<z<<\\\", \\\";}cerr<<endl\\n#define showsp(n) for(auto z:n){cerr<<z.fs<<\\\" \\\"<<z.sc<<\\\", \\\"}cerr<<endl\\n\\n#define yes printf(\\\"Yes\\\\n\\\")\\n#define no printf(\\\"No\\\\n\\\")\\n#define case(i) printf(\\\"Case #%lld: \\\",i)\\n\\nusing namespace std;\\n\\nusing ull=unsigned long long;\\nusing vi=vector<int>;\\nusing pint=pair<int,int>;\\n\\nconst int INF=1LL<<55;\\n\\nint tf;\\nint ans=0;\\n\\nvoid solve(){\\n ans = 0;\\n int t;\\n int i=1;\\n while(true){\\n t=pow(i,3);\\n if(t>tf) break;\\n ans=max(ans,t);\\n i++;\\n }\\n int maxA=i;\\n i=1;\\n while(true){\\n t=i*(i+1)*(i+2)/6;\\n if(t>tf) break;\\n ans=max(ans,t);\\n i++;\\n }\\n int maxB=i;\\n rep(i,maxA){\\n rep(j,maxB){\\n t=pow(i,3)+j*(j+1)*(j+2)/6;\\n if(t>tf) break;\\n ans=max(ans,t);\\n }\\n }\\n cout<<ans<<endl;\\n return;\\n}\\n\\nsigned main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int i=1;\\n int t;\\n \\n while(cin>>tf,tf){\\n solve();\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 3352,\n \"score_of_the_acc\": -2,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1224_2779543\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstring>\\n#include <cstdlib>\\n#include <cmath>\\n#include <algorithm>\\n#include <functional>\\n#include <vector>\\n#include <list>\\n#include <queue>\\n#include <deque>\\n#include <stack>\\n#include <map>\\n#include <set>\\n#include <bitset>\\n#include <tuple>\\n#include <cassert>\\n#include <exception>\\n#include <iomanip>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef pair<ll,ll> P;\\ntypedef vector<int> vi;\\ntypedef vector<ll> vll;\\ntypedef vector<char> vc;\\ntypedef vector<string> vs;\\ntypedef vector<P> vp;\\n#define rep(i,a,n) for(ll i = (a);i < (n);i++)\\n#define per(i,a,n) for(ll i = (a);i > (n);i--)\\n#define lep(i,a,n) for(ll i = (a);i <= (n);i++)\\n#define pel(i,a,n) for(ll i = (a);i >= (n);i--)\\n#define clr(a,b) memset((a),(b),sizeof(a))\\n#define pb push_back\\n#define mp make_pair\\n#define all(c) (c).begin(),(c).end()\\n#define sz size()\\n#define print(X) cout << (X) << endl\\nstatic const int INF = 1e+9+7;\\nll n,m,l;\\nstring s,t;\\nint d[200010],dp[1010][1010];\\ndouble w[1000],v[1000];\\ndouble box[200010];\\nchar field[200][200];\\n\\nint main(){\\n while(1){\\n cin >> n;\\n if(!n)break;\\n ll ans = 0;\\n lep(i,1,96){\\n l = pow(i,3);\\n if(l <= n)ans = max(ans,l);\\n }\\n lep(i,1,96){\\n l = i * (i+1)*(i+2)/6;\\n if(l <= n)ans = max(ans,l);\\n }\\n lep(i,1,96){\\n l = pow(i,3);\\n lep(j,1,96){\\n m = j*(j+1)*(j+2)/6;\\n if(l + m <= n)ans = max(ans,l+m);\\n }\\n }\\n print(ans);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3288,\n \"score_of_the_acc\": -1.0578,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1224_2122304\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define MAX 151200\\ntypedef long long ll;\\n \\nint main(void){\\n ll N;\\n while(cin >> N, N){\\n int ans = 0;\\n for(int cube = 0; cube * cube * cube <= MAX; cube++){\\n for(int tr = 0; tr * (tr+1) * (tr+2) / 6 <= MAX; tr++){\\n int cuben = cube * cube * cube;\\n int trn = tr*(tr+1)*(tr+2)/6;\\n if(cuben <= N){\\n ans = max(ans, cuben);\\n }\\n if(trn <= N){\\n ans = max(ans, trn);\\n }\\n if(cuben + trn <= N){\\n ans = max(ans, cuben + trn);\\n }\\n }\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3060,\n \"score_of_the_acc\": -0.9129,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1224_2116802\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define MAX 151200\\ntypedef long long ll;\\n\\nint main(void){\\n ll N;\\n while(cin >> N, N){\\n int ans = 0;\\n for(int cube = 0; cube * cube * cube <= MAX; cube++){\\n for(int tr = 0; tr * (tr+1) * (tr+2) / 6 <= MAX; tr++){\\n\\tint cuben = cube * cube * cube;\\n\\tint trn = tr*(tr+1)*(tr+2)/6;\\n\\tif(cuben <= N){\\n\\t ans = max(ans, cuben);\\n\\t}\\n\\tif(trn <= N){\\n\\t ans = max(ans, trn);\\n\\t}\\n\\tif(cuben + trn <= N){\\n\\t ans = max(ans, cuben + trn);\\n\\t}\\n }\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3056,\n \"score_of_the_acc\": -0.9117,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1224_1955793\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <string>\\n#include <vector>\\n#include <deque>\\n#include <list>\\n#include <algorithm>\\n#include <numeric>\\n#include <functional>\\n#include <cmath>\\n#include <cstring>\\n#include <cctype>\\n#include <sstream>\\n#include <set>\\n#include <map>\\n#include <stack>\\n#include <queue>\\n#include <complex>\\nusing namespace std;\\n#define REP(i,n) for(int i = 0; i < (int)n; i++)\\n#define FOR(i,a,b) for(int i = a; i < (int)b; i++)\\n#define pb push_back\\n#define mp make_pair\\ntypedef vector<int> vi;\\ntypedef pair<int, int> pi;\\ntypedef long long ll;\\nconst int INF = 1<<28;\\nconst ll MOD = 1000000007;\\nconst int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};\\n\\nint main() {\\n\\tios_base::sync_with_stdio(0);\\n\\tcin.tie(0);\\n\\n\\tvi v1, v2;\\n\\tfor(int i=0; i*i*i <= 151200; i++)\\n\\t\\tv1.pb(i*i*i);\\n\\tfor(int i=0; i*(i+1)*(i+2)/6 <= 151200; i++)\\n\\t\\tv2.pb(i*(i+1)*(i+2)/6);\\n\\n\\tint n;\\n\\twhile(cin >> n, n) {\\n\\t\\tint ans = 0;\\n\\t\\tREP(i, v1.size())\\n\\t\\t\\tREP(j, v2.size())\\n\\t\\t\\t\\tif(v1[i] + v2[j] <= n && v1[i] + v2[j] > ans) {\\n\\t\\t\\t\\t\\tans = v1[i] + v2[j];\\n\\t\\t\\t\\t}\\n\\t\\tcout << ans << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1220,\n \"score_of_the_acc\": -0.364,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1224_1851549\",\n \"code_snippet\": \"#include<iostream>\\nusing namespace std;\\nint g[60], h[100];\\nint main() {\\n\\tfor (int i = 0; i < 60; i++)g[i] = i*i*i;\\n\\tfor (int i = 0; i < 100; i++)h[i] = i*(i + 1)*(i + 2) / 6;\\n\\twhile (true) {\\n\\t\\tint p, q = 0; cin >> p; if (p == 0)break;\\n\\t\\tfor (int i = 0; i < 60; i++) {\\n\\t\\t\\tfor (int j = 0; j < 100; j++) {\\n\\t\\t\\t\\tint t = g[i] + h[j];\\n\\t\\t\\t\\tif (t <= p && q < t)q = t;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << q << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1160,\n \"score_of_the_acc\": -0.3461,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1224_1546400\",\n \"code_snippet\": \"#include <algorithm>\\n#include <functional>\\n#include <cmath>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <string>\\n#include <sstream>\\n#include <iostream>\\n#include <iomanip>\\n#include <vector>\\n#include <list>\\n#include <stack>\\n#include <queue>\\n#include <map>\\n#include <set>\\n#include <bitset>\\n#include <climits>\\n\\n#define all(c) (c).begin(), (c).end()\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n#define pb(e) push_back(e)\\n#define mp(a, b) make_pair(a, b)\\n#define fr first\\n#define sc second\\n\\nconst int INF=100000000;\\nint dx[4]={1,0,-1,0};\\nint dy[4]={0,1,0,-1};\\nusing namespace std;\\ntypedef pair<int ,int > P;\\ntypedef long long ll;\\n\\nint N;\\nint cubic(int n) {\\n return n*n*n;\\n}\\nint tetrahedral(int n) {\\n return n*(n+1)*(n+2)/6;\\n}\\nvoid solve() {\\n int ans=0;\\n rep(n1,100) rep(n2,100) {\\n if(cubic(n1)+tetrahedral(n2)<=N) {\\n ans=max(ans,cubic(n1)+tetrahedral(n2));\\n }\\n }\\n\\n cout<<ans<<endl;\\n}\\n\\nint main() {\\n while(cin>>N) {\\n if(!N) break;\\n solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1160,\n \"score_of_the_acc\": -0.423,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1224_1168335\",\n \"code_snippet\": \"#include <functional>\\n#include <algorithm>\\n#include <iostream>\\n#include <numeric>\\n#include <iomanip>\\n#include <utility>\\n#include <cstdlib>\\n#include <sstream>\\n#include <bitset>\\n#include <vector>\\n#include <cstdio>\\n#include <ctime>\\n#include <queue>\\n#include <deque>\\n#include <cmath>\\n#include <stack>\\n#include <list>\\n#include <map>\\n#include <set>\\n\\nusing namespace std;\\n\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n\\nint main(){\\n int n;\\n while(cin>>n){\\n if(n==0)break;\\n\\n int ma=-1;\\n \\n rep(i,55){\\n rep(j,100){\\n int calc= i*i*i + (int)(j*(j+1)*(j+2)/6);\\n if( calc <=n ){\\n ma=max( ma , calc );\\n }\\n else break;\\n }\\n }\\n cout<<ma<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1160,\n \"score_of_the_acc\": -0.3461,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1224_1012178\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\nusing namespace std;\\n\\nint main()\\n{\\n int n, ans;\\n vector<int> c1, c2;\\n for (int i = 0; i <= 53; i++) {\\n c1.push_back(i * i * i);\\n }\\n for (int i = 0; i <= 95; i++) {\\n c2.push_back(i * (i + 1) * (i + 2) / 6);\\n }\\n while (cin >> n && n) {\\n ans = 0;\\n for (int i = 0; i < c1.size(); i++) {\\n for (int j = 0; j < c2.size(); j++) {\\n if (c1[i] + c2[j] > n) {\\n continue;\\n }\\n ans = max(ans, c1[i] + c2[j]);\\n }\\n }\\n cout << ans << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1216,\n \"score_of_the_acc\": -0.3628,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1224_842044\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\nusing namespace std;\\nconst int MAX_C = 60;\\nconst int MAX_T = 150;\\n\\nint c[MAX_C],t[MAX_T];\\n\\nvoid init_c(){\\n for(int i = 0 ; i < MAX_C ; i++){\\n c[i] = i*i*i;\\n }\\n}\\n\\nvoid init_t(){\\n for(int i = 2 ; i < MAX_T ; i++){\\n t[i-2] = i*(i-1)*(i-2)/6;\\n }\\n}\\n\\nint main(){\\n int n;\\n\\n init_c();\\n init_t();\\n\\n while(cin >> n ,n){\\n int ans = 0;\\n\\n for(int i = 0 ; i < MAX_C ; i++){\\n for(int j = 0 ; j < MAX_T-2 ; j++){\\n\\tif(c[i]+t[j] <= n){\\n\\t ans = max(ans , c[i] + t[j]);\\n\\t}\\n }\\n }\\n cout << ans << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1160,\n \"score_of_the_acc\": -0.3461,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1224_835311\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<map>\\nusing namespace std;\\nint main(){\\n int n;\\n while(cin >> n , n){\\n int ret = 0, RIPPO = 0;\\n for(int i = 0 ; (RIPPO = i * i * i) <= n ; i++ ){\\n int SANKAKU = 0;\\n for(int j = 0 ; RIPPO + ( SANKAKU = j * ( j + 1 ) * ( j + 2 ) / 6 ) <= n ; j++ ){\\n\\tret = max( ret, RIPPO + SANKAKU);\\n }\\n }\\n cout << ret << endl;\\n } \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1160,\n \"score_of_the_acc\": -0.3461,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1224_751012\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\nusing namespace std;\\n\\n\\n\\nint A(int num){\\n\\treturn num*num*num;\\n}\\n\\nint B(int num){\\n\\treturn (num*(num+1)*(num+2))/6;\\n}\\n\\n\\nint main(){\\n\\tfor(int n,ans=0;cin>>n,n;ans=0){\\n\\t\\tfor(int i=0;i<54;i++){\\n\\t\\t\\tfor(int j=0;j<96;j++){\\n\\t\\t\\t\\tif(A(i)+B(j)<=n)ans=max(ans,A(i)+B(j));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout<<ans<<endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1160,\n \"score_of_the_acc\": -0.3461,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1224_594562\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n\\nusing namespace std;\\n\\n#define M (151200)\\n\\nvector<int> p, q;\\nvoid init() {\\n p.push_back(0);\\n for (int i = 1; i * i * i <= M; i++) {\\n p.push_back(i * i * i);\\n }\\n q.push_back(0);\\n for (int i = 1; i * (i + 1) * (i + 2) / 6 <= M; i++) {\\n q.push_back(i * (i + 1) * (i + 2) / 6);\\n }\\n}\\n\\nint solve(int n) {\\n int ret = 0;\\n for (int i = 0; i < p.size(); i++) {\\n for (int j = 0; j < q.size(); j++) {\\n if (p[i] + q[j] > n) continue;\\n ret = max(ret, p[i] + q[j]);\\n }\\n }\\n return ret;\\n}\\n\\nint main() {\\n init();\\n int n;\\n while (cin >> n, n) {\\n cout << solve(n) << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1216,\n \"score_of_the_acc\": -0.4397,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1224_528000\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\nusing namespace std;\\n\\n#define MAX 151200\\n\\nint main(){\\n vector<int> cubic;\\n vector<int> tetra;\\n\\n cubic.push_back(0);\\n for(int i = 1; i * i * i <= MAX; i++){\\n cubic.push_back(i * i * i);\\n }\\n tetra.push_back(0);\\n for(int i = 1; i * (i + 1) * (i + 2) / 6 <= MAX; i++){\\n tetra.push_back(i * (i + 1) * (i + 2) / 6);\\n }\\n\\n int n;\\n\\n while(cin >> n, n){\\n int ans = 0;\\n\\n for(int i = 0; i < cubic.size(); i++){\\n for(int j = 0; j < tetra.size(); j++){\\n\\tint sum = cubic[i] + tetra[j];\\n\\n\\tif(sum <= n){\\n\\t ans = max(ans, sum);\\n\\t}\\n }\\n }\\n\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1220,\n \"score_of_the_acc\": -0.364,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1224_464177\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<cmath>\\nusing namespace std;\\nconst int INF = (1 << 21);\\n\\nint a(int x){\\n return x * x * x;\\n}\\n\\nint b(int x){\\n return (x * (x - 1) * (x - 2)) / 6;\\n}\\n\\nint c(int n, int x){\\n return n - x;\\n}\\n\\nint main(){\\n int n;\\n while(cin >>n){\\n if(n == 0) break;\\n int ans = INF, tmp;\\n for(int i = 1; i < 100; i++){\\n tmp = c(n, a(i));\\n if(tmp < 0) break;\\n else ans = min(ans, tmp);\\n for(int j = 1; j < 100; j++){\\n tmp = c(n, a(i) + b(j));\\n if(tmp < 0) break;\\n else ans = min(ans, tmp);\\n }\\n\\n }\\n for(int i = 1; i < 100; i++){\\n tmp = c(n, b(i));\\n if(tmp < 0) break;\\n else ans = min(ans, tmp);\\n }\\n cout <<n - ans <<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 0,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1224_464095\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<cmath>\\nusing namespace std;\\nconst int DEF = (1 << 21);\\n\\nint a(int x){\\n return x * x * x;\\n}\\n\\nint b(int x){\\n return (x * (x - 1) * (x - 2)) / 6;\\n}\\n\\nint c(int n, int x){\\n return n - x;\\n}\\n\\nint main(){\\n int n;\\n while(cin >>n){\\n if(n == 0) break;\\n int ans = DEF, tmp;\\n for(int i = 1; i < 100; i++){\\n tmp = c(n, a(i));\\n if(tmp < 0) break;\\n else ans = min(ans, tmp);\\n for(int j = 1; j < 100; j++){\\n tmp = c(n, a(i) + b(j));\\n if(tmp < 0) break;\\n else ans = min(ans, tmp);\\n }\\n\\n }\\n for(int i = 1; i < 100; i++){\\n tmp = c(n, b(i));\\n if(tmp < 0) break;\\n else ans = min(ans, tmp);\\n }\\n cout <<n - ans <<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 0,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1224_392357\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n#include <string>\\n#include <algorithm>\\n#include <vector>\\n#include <stack>\\n#include <queue>\\n#include <set>\\n#include <map>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <cmath>\\n#include <cassert>\\n\\nusing namespace std;\\n\\n#define FOR(i,k,n) for(int i=(k); i<(int)n; ++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\\n\\ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cout<<*i<<\\\" \\\"; cout<<endl; }\\n\\ntypedef long long ll;\\nconst int INF = 100000000;\\nconst double EPS = 1e-8;\\nconst int MOD = 1000000007;\\n\\nint main(){\\n int n;\\n while(cin>>n && n){\\n int ans = 0;\\n REP(x, 55)REP(y, 96){\\n int l = x * x * x + y * (y + 1) * (y + 2) / 6;\\n if(l <= n) ans = max(ans, l);\\n }\\n cout<<ans<<endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 868,\n \"score_of_the_acc\": -0.3359,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1224_354633\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n#include <vector>\\n#include <list>\\n#include <string>\\n#include <set>\\n#include <map>\\n#include <stack>\\n#include <queue>\\n#include <algorithm>\\n#include <numeric>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <cmath>\\n#include <climits>\\nusing namespace std;\\n\\nint main() {\\n int n;\\n while ( cin >> n && n ) {\\n int res = 0;\\n for ( int i = 0; i < 54; ++ i ) {\\n for ( int j = 0; j < 100; ++ j ) {\\n int sum = i * i * i + j * ( j + 1 ) * ( j + 2 ) / 6;\\n if ( sum <= n ) res = max( res, sum );\\n }\\n }\\n cout << res << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 0,\n \"score_of_the_acc\": -0.0769,\n \"final_rank\": 3\n }\n]","isConversational":false}}},{"rowIdx":688,"cells":{"group_id":{"kind":"string","value":"aoj_1229_cpp"},"problem_description":{"kind":"string","value":"Problem F:\nYoung, Poor and Busy\nKen and Keiko are young, poor and busy. Short explanation: they are students, and ridden with part-time jobs. To make things worse, Ken lives in Hakodate and Keiko in Tokyo. They want to meet, but since they have neither time nor money, they have to go back to their respective jobs immediately after, and must be careful about transportation costs. Help them find the most economical meeting point.\nKen starts from Hakodate, Keiko from Tokyo. They know schedules and fares for all trains, and can choose to meet anywhere including their hometowns, but they cannot leave before 8am and must be back by 6pm in their respective towns. Train changes take no time (one can leave the same minute he/she arrives), but they want to meet for at least 30 minutes in the same city.\nThere can be up to 100 cities and 2000 direct connections, so you should devise an algorithm clever enough for the task.\nInput\nThe input is a sequence of data sets.\nThe first line of a data set contains a single integer, the number of connections in the timetable. It is not greater than 2000.\nConnections are given one on a line, in the following format.\nStart_city HH\n:\nMM Arrival_city HH\n:\nMM price\nStart_city\nand\nArrival_city\nare composed of up to 16 alphabetical characters, with only the first one in upper case. Departure and arrival times are given in hours and minutes (two digits each, separated by \":\") from 00:00 to 23:59. Arrival time is strictly after departure time. The\nprice\nfor one connection is an integer between 1 and 10000, inclusive. Fields are separated by spaces.\nThe end of the input is marked by a line containing a zero.\nOutput\nThe output should contain one integer for each data set, the lowest cost possible. This is the total fare of all connections they use.\nIf there is no solution to a data set, you should output a zero.\nThe solution to each data set should be given in a separate line.\nSample Input\n5\nHakodate 08:15 Morioka 12:30 2500\nMorioka 14:05 Hakodate 17:30 2500\nMorioka 15:30 Hakodate 18:00 3000\nMorioka 14:30 Tokyo 17:50 3000\nTokyo 08:30 Morioka 13:35 3000\n4\nHakodate 08:15 Morioka 12:30 2500\nMorioka 14:04 Hakodate 17:30 2500\nMorioka 14:30 Tokyo 17:50 3000\nTokyo 08:30 Morioka 13:35 3000\n18\nHakodate 09:55 Akita 10:53 3840\nHakodate 14:14 Akita 16:09 1920\nHakodate 18:36 Akita 19:33 3840\nHakodate 08:00 Morioka 08:53 3550\nHakodate 22:40 Morioka 23:34 3550\nAkita 14:23 Tokyo 14:53 2010\nAkita 20:36 Tokyo 21:06 2010\nAkita 08:20 Hakodate 09:18 3840\nAkita 13:56 Hakodate 14:54 3840\nAkita 21:37 Hakodate 22:35 3840\nMorioka 09:51 Tokyo 10:31 2660\nMorioka 14:49 Tokyo 15:29 2660\nMorioka 19:42 Tokyo 20:22 2660\nMorioka 15:11 Hakodate 16:04 3550\nMorioka 23:03 Hakodate 23:56 3550\nTokyo 09:44 Morioka 11:04 1330\nTokyo 21:54 Morioka 22:34 2660\nTokyo 11:34 Akita 12:04 2010\n0\nOutput for the Sample Input\n11000\n0\n11090"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1229_2940627","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 NUM 100\n#define BASE 480\n#define MAX 600\n\nenum Type{\n\tA,\n\tB,\n};\n\nstruct Edge{\n\tEdge(int arg_to,int arg_cost,int arg_start_time,int arg_arrive_time){\n\t\tto = arg_to;\n\t\tcost = arg_cost;\n\t\tstart_time = arg_start_time;\n\t\tarrive_time = arg_arrive_time;\n\t}\n\tbool operator<(const struct Edge &arg) const{ //出発時刻の昇順\n\t\treturn start_time < arg.start_time;\n\t}\n\tint to,cost,start_time,arrive_time;\n};\n\nstruct Info{\n\tInfo(int arg_node_id,int arg_sum_cost,int arg_current_time){\n\t\tnode_id = arg_node_id;\n\t\tsum_cost = arg_sum_cost;\n\t\tcurrent_time = arg_current_time;\n\t}\n\tbool operator<(const struct Info &arg) const{ //総コストの昇順(PQ)\n\t\treturn sum_cost > arg.sum_cost;\n\t}\n\tint node_id,sum_cost,current_time;\n};\n\nstruct Data{\n\tData(int arg_rev_start_time,int arg_sum_cost){\n\t\trev_start_time = arg_rev_start_time;\n\t\tsum_cost = arg_sum_cost;\n\t}\n\tbool operator<(const struct Data &arg) const{ //帰宅開始時刻の昇順\n\t\treturn rev_start_time < arg.rev_start_time;\n\t}\n\tint rev_start_time,sum_cost;\n};\n\nint N;\nint node_index;\nint min_cost[2][NUM][601],return_min_cost[NUM][601];\nint A_id,B_id;\nvector<int> work[2][NUM];\nvector<Data> return_start[NUM];\nconst string start_A = \"Hakodate\";\nconst string start_B = \"Tokyo\";\n\nmap<string,int> MAP;\nmap<int,int> CALC;\nvector<Edge> G[NUM];\n\n//時刻を分に直す\nint getNUM(char work[6]){\n\n\tint hour = 10*(work[0]-'0')+(work[1]-'0');\n\tint minute = 10*(work[3]-'0')+(work[4]-'0');\n\n\treturn 60*hour+minute;\n}\n\n//8時～18時の時間帯か\nbool rangeCheck(int tmp_time){\n\tif(tmp_time >= BASE && tmp_time <= BASE+MAX)return true;\n\telse{\n\t\treturn false;\n\t}\n}\n\nvoid dijkstra(Type type,int start_id){\n\n\tfor(int i = 0; i < node_index; i++){\n\t\tfor(int k = 0; k <= MAX; k++){\n\t\t\tmin_cost[type][i][k] = BIG_NUM;\n\t\t}\n\t}\n\n\tmin_cost[type][start_id][0] = 0; //8時に出発\n\n\tpriority_queue<Info> Q;\n\tQ.push(Info(start_id,0,BASE));\n\n\tint next_node,next_cost,next_time;\n\n\twhile(!Q.empty()){\n\n\t\tif(Q.top().sum_cost > min_cost[type][Q.top().node_id][Q.top().current_time-BASE]){\n\t\t\tQ.pop();\n\t\t}else{\n\n\t\t\tfor(int i = 0; i < G[Q.top().node_id].size(); i++){\n\t\t\t\t//既に出発している、または有効時間外ならSKIP\n\t\t\t\tif(Q.top().current_time > G[Q.top().node_id][i].start_time)continue;\n\t\t\t\tif(rangeCheck(G[Q.top().node_id][i].start_time) == false || rangeCheck(G[Q.top().node_id][i].arrive_time) == false)continue;\n\n\t\t\t\tnext_node = G[Q.top().node_id][i].to;\n\t\t\t\tnext_cost = Q.top().sum_cost+G[Q.top().node_id][i].cost;\n\t\t\t\tnext_time = G[Q.top().node_id][i].arrive_time;\n\n\t\t\t\tif(min_cost[type][next_node][next_time-BASE] > next_cost){\n\n\t\t\t\t\tmin_cost[type][next_node][next_time-BASE] = next_cost;\n\t\t\t\t\tQ.push(Info(next_node,next_cost,next_time));\n\t\t\t\t}\n\t\t\t}\n\t\t\tQ.pop();\n\t\t}\n\t}\n}\n\nint rev_dijkstra(int start_id){\n\n\tint ret = BIG_NUM;\n\tint next_node,next_cost,next_time;\n\tint A_min,B_min;\n\tpriority_queue<Info> Q;\n\n\tfor(int p = 0; p < return_start[start_id].size(); p++){ //start時刻を全探索\n\n\t\tint start_time = return_start[start_id][p].rev_start_time;\n\t\tint start_cost = return_start[start_id][p].sum_cost;\n\n\t\tfor(int a = 0; a < node_index; a++){\n\t\t\tfor(int k = start_time-BASE; k <= MAX; k++)return_min_cost[a][k] = BIG_NUM;\n\t\t}\n\n\t\treturn_min_cost[start_id][start_time-BASE] = 0; //★帰宅のコスト\n\t\tQ.push(Info(start_id,0,start_time));\n\n\t\tA_min = BIG_NUM;\n\t\tB_min = BIG_NUM;\n\n\t\twhile(!Q.empty()){\n\n\t\t\tif(Q.top().sum_cost > return_min_cost[Q.top().node_id][Q.top().current_time-BASE]){\n\t\t\t\tQ.pop();\n\t\t\t}else{\n\n\t\t\t\tfor(int i = 0; i < G[Q.top().node_id].size(); i++){\n\t\t\t\t\t//既に出発している、または有効時間外ならSKIP\n\t\t\t\t\tif(Q.top().current_time > G[Q.top().node_id][i].start_time)continue;\n\t\t\t\t\tif(rangeCheck(G[Q.top().node_id][i].start_time) == false || rangeCheck(G[Q.top().node_id][i].arrive_time) == false)continue;\n\n\t\t\t\t\tnext_node = G[Q.top().node_id][i].to;\n\t\t\t\t\tnext_cost = Q.top().sum_cost+G[Q.top().node_id][i].cost;\n\t\t\t\t\tnext_time = G[Q.top().node_id][i].arrive_time;\n\n\t\t\t\t\tif(return_min_cost[next_node][next_time-BASE] > next_cost){\n\t\t\t\t\t\treturn_min_cost[next_node][next_time-BASE] = next_cost;\n\n\t\t\t\t\t\tQ.push(Info(next_node,next_cost,next_time));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tQ.pop();\n\t\t\t}\n\t\t}\n\n\t\tfor(int time = start_time-BASE; time <= MAX; time++){\n\t\t\tif(return_min_cost[A_id][time] != BIG_NUM){\n\t\t\t\tA_min = min(A_min,return_min_cost[A_id][time]);\n\t\t\t}\n\t\t\tif(return_min_cost[B_id][time] != BIG_NUM){\n\t\t\t\tB_min = min(B_min,return_min_cost[B_id][time]);\n\t\t\t}\n\t\t}\n\n\t\tif(A_min == BIG_NUM || B_min == BIG_NUM)continue;\n\n\t\tret = min(ret,start_cost+A_min+B_min);\n\t}\n\treturn ret;\n}\n\nvoid func(){\n\n\tMAP.clear();\n\tfor(int i = 0; i < NUM; i++)G[i].clear();\n\n\tnode_index = 0;\n\n\tstring start,arrival;\n\tchar start_buf[6],arrive_buf[6];\n\tint start_time,arrive_time;\n\tint price,start_id,arrive_id;\n\n\tfor(int loop = 0; loop < N; loop++){\n\t\tcin >> start >> start_buf >> arrival >> arrive_buf >> price;\n\n\t\tauto at = MAP.find(start);\n\n\t\tif(at == MAP.end()){\n\t\t\tMAP[start] = node_index;\n\t\t\tstart_id = node_index;\n\t\t\tnode_index++;\n\n\t\t}else{\n\t\t\tstart_id = MAP[start];\n\t\t}\n\n\t\tat = MAP.find(arrival);\n\n\t\tif(at == MAP.end()){\n\t\t\tMAP[arrival] = node_index;\n\t\t\tarrive_id = node_index;\n\t\t\tnode_index++;\n\n\t\t}else{\n\t\t\tarrive_id = MAP[arrival];\n\t\t}\n\n\t\tstart_time = getNUM(start_buf);\n\t\tarrive_time = getNUM(arrive_buf);\n\n\t\tif(rangeCheck(start_time) == false || rangeCheck(arrive_time) == false)continue;\n\n\t\tG[start_id].push_back(Edge(arrive_id,price,start_time,arrive_time));\n\t}\n\n\tA_id = MAP[start_A];\n\tB_id = MAP[start_B];\n\n\t//函館、東京から、各都市への到着可能時刻と、同時刻での最小コストを求める\n\tdijkstra(A,A_id);\n\tdijkstra(B,B_id);\n\n\tfor(int town = 0; town < node_index; town++){\n\n\t\twork[A][town].clear();\n\t\twork[B][town].clear();\n\n\t\treturn_start[town].clear();\n\t}\n\n\tint rev_start_time,tmp_cost;\n\n\t//各町から、函館or北海道への、帰宅開始可能時刻をworkにpushする\n\tfor(int town = 0; town < node_index; town++){\n\t\tfor(int time = 0; time <= MAX; time++){\n\n\t\t\tif(min_cost[A][town][time] != BIG_NUM){\n\t\t\t\twork[A][town].push_back(time+BASE);\n\t\t\t}\n\n\t\t\tif(min_cost[B][town][time] != BIG_NUM){\n\t\t\t\twork[B][town].push_back(time+BASE);\n\t\t\t}\n\t\t}\n\n\t\t//★最低30分会うので、帰宅開始可能時刻と、そのコストを求める★\n\t\tif(work[A][town].size() == 0 || work[B][town].size() == 0)continue;\n\n\t\tCALC.clear();\n\n\t\tfor(int time = 1; time <= MAX; time++){\n\t\t\tmin_cost[A][town][time] = min(min_cost[A][town][time],min_cost[A][town][time-1]);\n\t\t\tmin_cost[B][town][time] = min(min_cost[B][town][time],min_cost[B][town][time-1]);\n\t\t}\n\n\t\tfor(int i = 0; i < work[A][town].size(); i++){\n\t\t\tfor(int k = 0; k < work[B][town].size(); k++){\n\t\t\t\trev_start_time = max(work[A][town][i],work[B][town][k])+30;\n\t\t\t\tif(!rangeCheck(rev_start_time))continue;\n\n\t\t\t\tauto at2 = CALC.find(rev_start_time);\n\t\t\t\ttmp_cost = min_cost[A][town][work[A][town][i]-BASE]+min_cost[B][town][work[B][town][k]-BASE];\n\n\t\t\t\tif(at2 == CALC.end() || tmp_cost < CALC[rev_start_time]){\n\t\t\t\t\tCALC[rev_start_time] = tmp_cost;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor(auto at3: CALC){\n\t\t\treturn_start[town].push_back(Data(at3.first,at3.second));\n\t\t}\n\t\tsort(return_start[town].begin(),return_start[town].end());\n\t}\n\n\t//各町から、出発時刻別の、函館または東京への帰宅最短コストを求める\n\tint ans = BIG_NUM;\n\tint ret;\n\n\tfor(int start_town = 0; start_town < node_index; start_town++){\n\t\tif(return_start[start_town].size() == 0)continue; //そもそも会えない街ならSKIP\n\n\t\tret = rev_dijkstra(start_town);\n\t\tif(ret == BIG_NUM)continue; //函館または東京に戻れないならSKIP\n\n\t\tans = min(ans,ret);\n\t}\n\n\tif(ans == BIG_NUM){\n\t\tprintf(\"0\\n\");\n\t}else{\n\t\tprintf(\"%d\\n\",ans);\n\t}\n}\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%d\",&N);\n\t\tif(N == 0)break;\n\n\t\tfunc();\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3592,"score_of_the_acc":-0.1136,"final_rank":4},{"submission_id":"aoj_1229_1526289","code_snippet":"#include<bits/stdc++.h>\n\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n\nusing namespace std;\n\nstruct Info {\n int fromStationID,toStationID;\n int fromTimeID,toTimeID;\n int cost;\n};\n\nconst int IINF = INT_MAX;\nconst int MAX_STATION = 100;\nconst int MAX_EVENT = 4000;\nint toDest[2][MAX_STATION][MAX_EVENT+10]; // toDest[0][][] <- hakodate, toDest[1][][] <- tokyo, toDest[][stationID][timeID] := ????????????stationID???timeID??????????????§?????°?????????????°?\nint fromDest[2][MAX_STATION][MAX_EVENT+10]; // fromDest[0][][] <- hakodate, fromDest[1][][] <- tokyo, fromDest[][stationID][timeID] := ???????????§???stationID??????timeID??????????????????????????°????????????????????????????????????????°????\n\nint stationIDIndex;\nmap<string,int> stationIDTable;\nvector<int> T;\n\nvoid init(){\n stationIDIndex = 0;\n stationIDTable.clear();\n T.clear();\n}\n\ninline int convertStringIntoTime(string s){\n return ( ( s[0] - '0' ) * 10 + ( s[1] - '0' ) ) * 60 + ( ( s[3] - '0' ) * 10 + ( s[4] - '0' ) ) ;\n}\n\ninline int calcTimeID(int _time) {\n return lower_bound(T.begin(),T.end(),_time) - T.begin();\n}\n\nInfo convertStringIntoInfo(string context){\n vector<string> buf;\n stringstream ss;\n ss << context;\n while( ss >> context ){\n buf.push_back(context);\n }\n assert( buf.size() == 5 );\n int fromStationID = ( stationIDTable.count(buf[0]) ? stationIDTable[buf[0]] : ( stationIDTable[buf[0]] = stationIDIndex++ ) );\n int toStationID = ( stationIDTable.count(buf[2]) ? stationIDTable[buf[2]] : ( stationIDTable[buf[2]] = stationIDIndex++ ) );\n int fromTime = convertStringIntoTime(buf[1]);\n int toTime = convertStringIntoTime(buf[3]);\n if( fromTime < convertStringIntoTime(\"08:00\") || toTime > convertStringIntoTime(\"18:00\") ) {\n return (Info){-1,-1,-1,-1,-1};\n }\n T.push_back(fromTime);\n T.push_back(toTime);\n return (Info){fromStationID,toStationID,fromTime,toTime,(atoi)(buf[4].c_str())};\n}\n\nbool cmp_to(const Info &a,const Info &b) {\n if( a.toTimeID != b.toTimeID) a.toTimeID < b.toTimeID;\n return a.fromTimeID < b.fromTimeID;\n}\n\nbool cmp_from(const Info &a,const Info &b) {\n if( a.fromTimeID != b.fromTimeID ) a.fromTimeID > b.fromTimeID;\n return a.toTimeID > b.toTimeID;\n}\n\nvoid makeToDest(vector<Info> &vec,int hakodateID,int tokyoID,int startTimeID,int endTimeID) {\n assert( startTimeID == 0 );\n rep(i,2) rep(j,stationIDIndex) rep(k,endTimeID+1) toDest[i][j][k] = IINF;\n toDest[0][hakodateID][startTimeID] = toDest[1][tokyoID][startTimeID] = 0;\n sort(vec.begin(),vec.end(),cmp_to);\n int cur = 0;\n\n REP(timeID,startTimeID,endTimeID+1){\n if( timeID-1 >= startTimeID ) {\n rep(stationID,stationIDIndex){\n\trep(j,2){\n\t toDest[j][stationID][timeID] = min(toDest[j][stationID][timeID],\n\t\t\t\t\t toDest[j][stationID][timeID-1]);\n\t}\n }\n }\n while( cur < (int)vec.size() && vec[cur].fromTimeID == timeID ){\n rep(j,2){\n\tif( toDest[j][vec[cur].fromStationID][timeID] == IINF ) continue;\n\ttoDest[j][vec[cur].toStationID][vec[cur].toTimeID] = min(toDest[j][vec[cur].toStationID][vec[cur].toTimeID],\n\t\t\t\t\t\t\t\t toDest[j][vec[cur].fromStationID][timeID]+vec[cur].cost);\n }\n ++cur;\n }\n }\n}\n\nvoid makeFromDest(vector<Info> &vec,int hakodateID,int tokyoID,int startTimeID,int endTimeID) {\n rep(i,2) rep(j,stationIDIndex) rep(k,endTimeID+1) fromDest[i][j][k] = IINF;\n fromDest[0][hakodateID][endTimeID] = fromDest[1][tokyoID][endTimeID] = 0;\n sort(vec.begin(),vec.end(),cmp_from);\n int cur = 0;\n for(int timeID=endTimeID;timeID>=startTimeID;timeID--){\n if( timeID+1 <= endTimeID ) {\n rep(stationID,stationIDIndex){\n\trep(j,2){\n\t fromDest[j][stationID][timeID] = min(fromDest[j][stationID][timeID],\n\t\t\t\t\t fromDest[j][stationID][timeID+1]);\n\t}\n }\n }\n while( cur < (int)vec.size() && vec[cur].toTimeID == timeID ) {\n rep(j,2){\n\tif( fromDest[j][vec[cur].toStationID][timeID] == IINF ) continue;\n\tfromDest[j][vec[cur].fromStationID][vec[cur].fromTimeID] = min(fromDest[j][vec[cur].fromStationID][vec[cur].fromTimeID],\n\t\t\t\t\t\t\t\t fromDest[j][vec[cur].toStationID][timeID]+vec[cur].cost);\n }\n ++cur;\n }\n }\n}\n\nvoid compute(vector<Info> &vec){\n\n if( !stationIDTable.count(\"Hakodate\") || !stationIDTable.count(\"Tokyo\") ) {\n puts(\"0\");\n return;\n }\n\n int hakodateID = stationIDTable[\"Hakodate\"];\n int tokyoID = stationIDTable[\"Tokyo\"];\n int startTimeID = calcTimeID(convertStringIntoTime(\"08:00\")); \n int endTimeID = calcTimeID(convertStringIntoTime(\"18:00\")); \n makeToDest(vec,hakodateID,tokyoID,startTimeID,endTimeID);\n makeFromDest(vec,hakodateID,tokyoID,startTimeID,endTimeID);\n\n int mini = IINF;\n rep(rendezvous,stationIDIndex){\n REP(timeID,startTimeID,endTimeID+1){\n if( toDest[0][rendezvous][timeID] == IINF || toDest[1][rendezvous][timeID] == IINF ) continue;\n int leaveTimeID = lower_bound(T.begin(),T.end(),T[timeID]+30) - T.begin();\n if( leaveTimeID >= (int)T.size() ) continue;\n if( fromDest[0][rendezvous][leaveTimeID] == IINF || fromDest[1][rendezvous][leaveTimeID] == IINF ) continue;\n mini = min(mini,\n\t\t toDest[0][rendezvous][timeID]+toDest[1][rendezvous][timeID]+\n\t\t fromDest[0][rendezvous][leaveTimeID]+fromDest[1][rendezvous][leaveTimeID]);\n }\n } \n if( mini == IINF ) puts(\"0\");\n else cout << mini << endl;\n}\n\nint main(){\n int n;\n while( cin >> n, n ) {\n init();\n cin.ignore();\n vector<Info> vec;\n rep(i,n){\n string s;\n getline(cin,s);\n Info info = convertStringIntoInfo(s);\n if( info.fromStationID == -1 ) continue;\n vec.push_back(info);\n }\n T.push_back(convertStringIntoTime(\"08:00\"));\n T.push_back(convertStringIntoTime(\"18:00\"));\n sort(T.begin(),T.end());\n T.erase(unique(T.begin(),T.end()),T.end());\n rep(i,(int)vec.size()) {\n vec[i].fromTimeID = calcTimeID(vec[i].fromTimeID);\n vec[i].toTimeID = calcTimeID(vec[i].toTimeID);\n }\n compute(vec);\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":5740,"score_of_the_acc":-0.1767,"final_rank":6},{"submission_id":"aoj_1229_1131515","code_snippet":"#include<string>\n#include<stdio.h>\n#include<algorithm>\n#include<queue>\n#include<vector>\n#include<map>\nusing namespace std;\nchar in[20];\nvector<pair<pair<int,int>,int> >g[110][1440];\nvector<pair<pair<int,int>,int> >g2[110][1440];\nint ijk[110][1440];\nint v[110][1440];\nint s[4][110][1440];\nint main(){\n\tint a;\n\twhile(scanf(\"%d\",&a),a){\n\t\tfor(int i=0;i<110;i++)for(int j=0;j<1440;j++){\n\t\t\tg[i][j].clear();\n\t\t\tg2[i][j].clear();\n\t\t}\n\t\tmap<string,int>m;\n\t\tm[\"Hakodate\"]=0;\n\t\tm[\"Tokyo\"]=1;\n\t\tint n=2;\n\t\tfor(int i=0;i<a;i++){\n\t\t\tscanf(\"%s\",in);\n\t\t\tstring na=in;\n\t\t\tif(!m.count(na))m[na]=n++;\n\t\t\tint p=m[na];\n\t\t\tint H,M;\n\t\t\tscanf(\"%d:%d\",&H,&M);\n\t\t\tint t1=H*60+M;\n\t\t\tscanf(\"%s\",in);\n\t\t\tstring nb=in;\n\t\t\tif(!m.count(nb))m[nb]=n++;\n\t\t\tint q=m[nb];\n\t\t\tscanf(\"%d:%d\",&H,&M);\n\t\t\tint t2=H*60+M;\n\t\t\tint r;\n\t\t\tscanf(\"%d\",&r);\n\t\t\tg[p][t1].push_back(make_pair(make_pair(q,t2),r));\n\t\t\tg2[q][t2].push_back(make_pair(make_pair(p,t1),r));\n\t\t}\n\t\tfor(int i=0;i<110;i++)for(int j=0;j<1440;j++){\n\t\t\tv[i][j]=0;ijk[i][j]=99999999;\n\t\t}\n\t\tpriority_queue<pair<int,pair<int,int> > > Q;\n\t\tQ.push(make_pair(0,make_pair(0,480)));\n\t\tijk[0][480]=0;\n\t\twhile(Q.size()){\n\t\t\tint cost=-Q.top().first;\n\t\t\tint at=Q.top().second.first;\n\t\t\tint t=Q.top().second.second;\n\t\t\tQ.pop();\n\t\t\tif(v[at][t])continue;\n\t\t\tv[at][t]=1;\n\t\t\tif(t<1080&&!v[at][t+1]&&ijk[at][t+1]>cost){\n\t\t\t\tijk[at][t+1]=cost;\n\t\t\t\tQ.push(make_pair(-cost,make_pair(at,t+1)));\n\t\t\t}\n\t\t\tfor(int i=0;i<g[at][t].size();i++){\n\t\t\t\tint x=g[at][t][i].first.first;\n\t\t\t\tint y=g[at][t][i].first.second;\n\t\t\t\tint z=g[at][t][i].second;\n\t\t\t\tif(!v[x][y]&&ijk[x][y]>cost+z){\n\t\t\t\t\tijk[x][y]=cost+z;\n\t\t\t\t\tQ.push(make_pair(-cost-z,make_pair(x,y)));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(int i=0;i<n;i++)for(int j=0;j<1440;j++)\n\t\t\ts[0][i][j]=ijk[i][j];\n\t\tfor(int i=0;i<110;i++)for(int j=0;j<1440;j++){\n\t\t\tv[i][j]=0;ijk[i][j]=99999999;\n\t\t}\n\t\tQ.push(make_pair(0,make_pair(1,480)));\n\t\tijk[1][480]=0;\n\t\twhile(Q.size()){\n\t\t\tint cost=-Q.top().first;\n\t\t\tint at=Q.top().second.first;\n\t\t\tint t=Q.top().second.second;\n\t\t\tQ.pop();\n\t\t\tif(v[at][t])continue;\n\t\t\tv[at][t]=1;\n\t\t\tif(t<1080&&!v[at][t+1]&&ijk[at][t+1]>cost){\n\t\t\t\tijk[at][t+1]=cost;\n\t\t\t\tQ.push(make_pair(-cost,make_pair(at,t+1)));\n\t\t\t}\n\t\t\tfor(int i=0;i<g[at][t].size();i++){\n\t\t\t\tint x=g[at][t][i].first.first;\n\t\t\t\tint y=g[at][t][i].first.second;\n\t\t\t\tint z=g[at][t][i].second;\n\t\t\t\tif(!v[x][y]&&ijk[x][y]>cost+z){\n\t\t\t\t\tijk[x][y]=cost+z;\n\t\t\t\t\tQ.push(make_pair(-cost-z,make_pair(x,y)));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(int i=0;i<n;i++)for(int j=0;j<1440;j++)\n\t\t\ts[1][i][j]=ijk[i][j];\n\t\tfor(int i=0;i<110;i++)for(int j=0;j<1440;j++){\n\t\t\tv[i][j]=0;ijk[i][j]=99999999;\n\t\t}\n\t\tQ.push(make_pair(0,make_pair(0,1080)));\n\t\tijk[0][1080]=0;\n\t\twhile(Q.size()){\n\t\t\tint cost=-Q.top().first;\n\t\t\tint at=Q.top().second.first;\n\t\t\tint t=Q.top().second.second;\n\t\t\tQ.pop();\n\t\t\tif(v[at][t])continue;\n\t\t\tv[at][t]=1;\n\t\t\tif(t>480&&!v[at][t-1]&&ijk[at][t-1]>cost){\n\t\t\t\tijk[at][t-1]=cost;\n\t\t\t\tQ.push(make_pair(-cost,make_pair(at,t-1)));\n\t\t\t}\n\t\t\tfor(int i=0;i<g2[at][t].size();i++){\n\t\t\t\tint x=g2[at][t][i].first.first;\n\t\t\t\tint y=g2[at][t][i].first.second;\n\t\t\t\tint z=g2[at][t][i].second;\n\t\t\t\tif(!v[x][y]&&ijk[x][y]>cost+z){\n\t\t\t\t\tijk[x][y]=cost+z;\n\t\t\t\t\tQ.push(make_pair(-cost-z,make_pair(x,y)));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(int i=0;i<n;i++)for(int j=0;j<1440;j++)\n\t\t\ts[2][i][j]=ijk[i][j];\n\t\tfor(int i=0;i<110;i++)for(int j=0;j<1440;j++){\n\t\t\tv[i][j]=0;ijk[i][j]=99999999;\n\t\t}\n\t\tQ.push(make_pair(0,make_pair(1,1080)));\n\t\tijk[1][1080]=0;\n\t\twhile(Q.size()){\n\t\t\tint cost=-Q.top().first;\n\t\t\tint at=Q.top().second.first;\n\t\t\tint t=Q.top().second.second;\n\t\t\tQ.pop();\n\t\t\tif(v[at][t])continue;\n\t\t\tv[at][t]=1;\n\t\t\tif(t>480&&!v[at][t-1]&&ijk[at][t-1]>cost){\n\t\t\t\tijk[at][t-1]=cost;\n\t\t\t\tQ.push(make_pair(-cost,make_pair(at,t-1)));\n\t\t\t}\n\t\t\tfor(int i=0;i<g2[at][t].size();i++){\n\t\t\t\tint x=g2[at][t][i].first.first;\n\t\t\t\tint y=g2[at][t][i].first.second;\n\t\t\t\tint z=g2[at][t][i].second;\n\t\t\t\tif(!v[x][y]&&ijk[x][y]>cost+z){\n\t\t\t\t\tijk[x][y]=cost+z;\n\t\t\t\t\tQ.push(make_pair(-cost-z,make_pair(x,y)));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(int i=0;i<n;i++)for(int j=0;j<1440;j++)\n\t\t\ts[3][i][j]=ijk[i][j];\n\t\tint ret=999999999;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tfor(int j=480;j<=1410;j++){\n\t\t\t\tret=min(ret,s[0][i][j]+s[1][i][j]+s[2][i][j+30]+s[3][i][j+30]);\n\t\t\t}\n\t\t}\n\t\tif(ret>99999999)printf(\"0\\n\");\n\t\telse printf(\"%d\\n\",ret);\n\t}\n}","accuracy":1,"time_ms":10,"memory_kb":10864,"score_of_the_acc":-0.3345,"final_rank":8},{"submission_id":"aoj_1229_960812","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <string>\n#include <sstream>\n#include <cstring>\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <numeric>\n#include <cctype>\n#include <tuple>\n#include <iterator>\n#include <bitset>\n#include <random>\n#include <assert.h>\n#include <unordered_map>\n\n#ifdef _MSC_VER\n#include <agents.h>\n#endif\n\n#define FOR(i, a, b) for(int i = (a); i < (int)(b); ++i)\n#define rep(i, n) FOR(i, 0, n)\n#define ALL(v) v.begin(), v.end()\n#define REV(v) v.rbegin(), v.rend()\n#define MEMSET(v, s) memset(v, s, sizeof(v))\n#define X first\n#define Y second\n#define MP make_pair\n#define umap unordered_map\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef long double ld;\ntypedef pair<int, int> P;\n\nconst int N = 110;\nconst int T = 610;\n\nint cost[4][N*T];\n\ninline int f(int n, int t){\n\treturn n*T + t;\n}\n\nvector<P> G[N*T], rev[N*T];\nvector<int> v[N];\n\nvoid dijk(int start, int t, int *opt, vector<P> *graph){\n\topt[f(start, t)] = 0;\n\tpriority_queue<P, vector<P>, greater<P>> q;\n\tq.push(MP(0, f(start, t)));\n\n\twhile (!q.empty()){\n\t\tint d = q.top().first;\n\t\tint pos = q.top().second;\n\n\t\tq.pop();\n\n\t\tif (opt[pos] < d) continue;\n\n\t\tfor (auto &e : graph[pos]){\n\t\t\tif (opt[e.first] <= d + e.second)continue;\n\t\t\topt[e.first] = d + e.second;\n\t\t\tq.push(MP(d + e.second, e.first));\n\t\t}\n\t}\n}\n\nvoid pp(int i, int pos, int t){\n\tcout << (i % 2 ? \"to\" : \"from\") << \" \" << (i / 2 ? \"Hakodate\" : \"Tokyo\") << endl;\n\tcout << cost[i][f(pos, t)] << endl;\n}\n\nint main(){\n\tint n;\n\twhile (cin >> n, n){\n\t\trep(i, N*T) G[i].clear();\n\t\trep(i, N*T) rev[i].clear();\n\t\trep(i, N) v[i].clear(), v[i].push_back(0), v[i].push_back(600);\n\n\t\tmap<string, int> m;\n\t\tint idx = 0;\n\t\tm[\"Tokyo\"] = idx++;\n\t\tm[\"Hakodate\"] = idx++;\n\t\trep(i, n){\n\t\t\tstring s, t;\n\t\t\tint h1, m1, h2, m2, cost;\n\t\t\tchar c;\n\t\t\tcin >> s >> h1 >> c >> m1 >> t >> h2 >> c >> m2 >> cost;\n\t\t\tint t1 = h1 * 60 + m1 - 480, t2 = h2 * 60 + m2 - 480;\n\t\t\tif (0 <= t1 && t1 <= 600 && 0 <= t2 && t2 <= 600){\n\t\t\t\tif (!m.count(s)) m[s] = idx++;\n\t\t\t\tif (!m.count(t)) m[t] = idx++;\n\t\t\t\tint from = f(m[s], t1), to = f(m[t], t2);\n\t\t\t\tG[from].push_back(MP(to, cost));\n\t\t\t\trev[to].push_back(MP(from, cost));\n\t\t\t\tv[m[s]].push_back(t1);\n\t\t\t\tv[m[t]].push_back(t2);\n\t\t\t}\n\t\t}\n\n\t\trep(i, idx){\n\t\t\tsort(ALL(v[i]));\n\t\t\tv[i].erase(unique(ALL(v[i])), v[i].end());\n\t\t\trep(j, v[i].size()){\n\t\t\t\tif (j + 1 < v[i].size()) G[f(i, v[i][j])].push_back(MP(f(i, v[i][j + 1]), 0));\n\t\t\t\tif (j - 1 >= 0) rev[f(i, v[i][j])].push_back(MP(f(i, v[i][j - 1]), 0));\n\t\t\t}\n\t\t}\n\n\t\trep(i, 4){\n\t\t\tMEMSET(cost[i], 0x7f);\n\t\t\t// Tokyo -> x, x -> Tokyo, Hakodate -> x, x -> Hakodate\n\t\t\tdijk(i / 2, i % 2 ? 600 : 0, cost[i], i % 2 ? rev : G);\n\t\t}\n\n\t\trep(k, 2) rep(i, idx){\n\t\t\tfor (int j = 0+1; j <= 600; ++j){\n\t\t\t\tcost[k * 2][f(i, j)] = min(cost[k * 2][f(i, j)], cost[k * 2][f(i, j - 1)]);\n\t\t\t}\n\t\t\tfor (int j = 600-1; j >= 0; --j){\n\t\t\t\tcost[k * 2 + 1][f(i, j)] = min(cost[k * 2 + 1][f(i, j)], cost[k * 2 + 1][f(i, j + 1)]);\n\t\t\t}\n\t\t}\n\n\t\tint ans = 1e9;\n\t\trep(i, idx) for (int j = 0; j <= 600 - 30; ++j){\n\t\t\t//pp(0, i, j);\n\t\t\t//pp(1, i, j+30);\n\t\t\t//pp(2, i, j);\n\t\t\t//pp(3, i, j+30);\n\t\t\tint a = f(i, j), b = f(i, j + 30);\n\t\t\tif ((cost[0][a] | cost[1][b] | cost[2][a] | cost[3][b]) >= ans) continue;\n\t\t\tans = min(ans, cost[0][a] + cost[1][b] + cost[2][a] + cost[3][b]);\n\t\t}\n\t\tcout << (ans < 1e9 ? ans : 0) << endl;\n\t}\n\n\n\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":5608,"score_of_the_acc":-0.1727,"final_rank":5},{"submission_id":"aoj_1229_505246","code_snippet":"#include<iostream>\n#include<queue>\n#include<string>\n#include<map>\n#include<cstdlib>\n#include<algorithm>\n#include<functional>\n#include<set>\n#include<cstdio>\n#include<cassert>\n\nusing namespace std;\n\n#define foreach(i,o) for(__typeof((o).begin()) i = (o).begin(); i != (o).end(); ++i)\n\nconst int max_place = 101;\nconst int max_time = 601;\nconst int MAX_V = 2010;\nconst int inf = 1<<28;\n\nstruct edge{\n int src, dst;\n int cost;\n edge(int src, int dst, int cost):src(src), dst(dst), cost(cost){}\n};\n\nstruct state{\n int pos;\n int prev;\n int cost;\n \n state(int pos, int prev, int cost):pos(pos),prev(prev),cost(cost){}\n\n bool operator>(const state &t)const{\n if(cost!=t.cost)return cost>t.cost;\n if(prev!=t.prev)return prev>t.prev;\n if(pos!=t.pos)return pos>t.pos;\n return false;\n }\n};\n\ntypedef vector<edge> edges;\ntypedef vector<edges> graph;\n\nint convTime(const string &s){\n int h = atoi(s.substr(0,2).c_str());\n int m = atoi(s.substr(3,2).c_str());\n return 60 * h + m;\n}\n\nstring revTime(int t){\n char buf[32];\n sprintf(buf, \"%02d:%02d\", t/60, t%60);\n return string(buf);\n}\n\nint **dist = NULL;\nvoid johnson(const graph &tmp_g){\n graph g = tmp_g;\n const int v = g.size();\n \n for(int i = 0; i < v; ++i){\n dist[i] = new int[v];\n for(int j = 0; j < v; ++j){\n dist[i][j] = inf;\n }\n dist[i][i] = 0;\n }\n\n for(int s = 0; s < v; ++s){\n priority_queue<state, vector<state>, greater<state> > q;\n q.push(state(s,s,0));\n while(!q.empty()){\n state cur = q.top(); q.pop();\n for(int i = 0; i < (int)g[cur.pos].size(); ++i){\n edge e = g[cur.pos][i];\n int cost = cur.cost + e.cost;\n assert(cost>=0);\n if(dist[s][e.dst] > cost){\n dist[s][e.dst] = cost;\n q.push(state(e.dst,cur.pos,cost));\n }\n }\n }\n }\n \n return ; \n}\n\nint main()\n{\n int n;\n while(cin>>n && n){\n int id = 1;\n int vid = 0;\n map<string,int> cityDict;\n map<int,string> revCityDict;\n set<int> cityEvTimes[max_place];\n graph g(MAX_V);\n \n map<pair<int,int>, int> vID;\n map<int,pair<int,int> > revID;\n \n for(int i = 0; i < n; ++i){\n string from, ftime, to, ttime;\n int cost;\n\n cin >> from >> ftime >> to >> ttime >> cost;\n if(!cityDict.count(from)){\n cityDict[from] = id;\n revCityDict[id] = from;\n ++id;\n }\n if(!cityDict.count(to)){\n cityDict[to] = id;\n revCityDict[id] = to;\n ++id;\n }\n\n int src = cityDict[from];\n int dst = cityDict[to];\n int srcTime = convTime(ftime) - 480;\n int dstTime = convTime(ttime) - 480;\n \n if( dstTime >= 0 && dstTime < max_time && srcTime >= 0 && srcTime < max_time ){\n if( !vID.count(make_pair(src,srcTime)) ){\n vID[make_pair(src,srcTime)] = vid;\n revID[vid] = make_pair(src,srcTime);\n ++vid;\n }\n cityEvTimes[src].insert(srcTime);\n if( !vID.count(make_pair(dst,dstTime)) ){\n vID[make_pair(dst,dstTime)] = vid;\n revID[vid] = make_pair(dst,dstTime);\n ++vid;\n }\n cityEvTimes[dst].insert(dstTime);\n \n g[vID[make_pair(src,srcTime)]].push_back( edge(vID[make_pair(src,srcTime)], vID[make_pair(dst,dstTime)], cost) );\n }\n\n }\n g.resize(vID.size());\n \n for(int i = 1; i < id; ++i){\n foreach(it2, cityEvTimes[i]){\n set<int>::iterator it3 = it2;\n ++it3;\n if( it3 != cityEvTimes[i].end() ){\n g[vID[make_pair(i,*it2)]].push_back( edge(vID[make_pair(i,*it2)], vID[make_pair(i,*it3)], 0) );\n }\n }\n }\n \n dist=new int*[g.size()];\n for(int i = 0; i < (int)g.size(); ++i){\n dist[i] = new int[g.size()];\n }\n \n johnson(g);\n\n int res = inf;\n int kenInitial = cityDict[\"Tokyo\"];\n int keikoInitial = cityDict[\"Hakodate\"];\n\n int ken_st, keiko_st;\n if( cityEvTimes[kenInitial].size() > 0 && cityEvTimes[keikoInitial].size() > 0 ){\n ken_st = vID[make_pair(kenInitial, *(cityEvTimes[kenInitial].begin()))];\n keiko_st = vID[make_pair(keikoInitial, *(cityEvTimes[keikoInitial].begin()))];\n\n for(int i = 1; i < id; ++i){\n foreach(ev1, cityEvTimes[i]){\n int v1 = vID[make_pair(i,*ev1)];\n foreach(ev2, cityEvTimes[i]){\n int v2 = vID[make_pair(i,*ev2)];\n int st = max(*ev1, *ev2) + 30;\n int from = -1;\n\n if(cityEvTimes[i].lower_bound(st)!=cityEvTimes[i].end()){\n from = vID[make_pair(i,*(cityEvTimes[i].lower_bound(st)))];\n }\n if(from<0)continue;\n foreach(ev3, cityEvTimes[kenInitial]){\n if( *ev3 < st ) continue;\n int v3 = vID[make_pair(kenInitial,*ev3)];\n foreach(ev4, cityEvTimes[keikoInitial]){\n if( *ev4 < st ) continue;\n int v4 = vID[make_pair(keikoInitial, *ev4)];\n res = min(res, dist[ken_st][v1] + dist[keiko_st][v2] + dist[from][v3] + dist[from][v4]);\n }\n }\n }\n }\n }\n }\n \n\n if(res>=inf)res = 0;\n cout << res << endl;\n\n for(int i = 0; i < (int)g.size(); ++i){\n delete [] dist[i];\n }\n delete [] dist;\n \n }\n return 0;\n}","accuracy":1,"time_ms":1550,"memory_kb":23180,"score_of_the_acc":-0.9418,"final_rank":10},{"submission_id":"aoj_1229_505244","code_snippet":"#include<iostream>\n#include<queue>\n#include<string>\n#include<map>\n#include<cstdlib>\n#include<algorithm>\n#include<functional>\n#include<set>\n#include<cstdio>\n#include<cassert>\n\nusing namespace std;\n\n#define foreach(i,o) for(__typeof((o).begin()) i = (o).begin(); i != (o).end(); ++i)\n\nconst int max_place = 101;\nconst int max_time = 601;\nconst int MAX_V = 2010;\nconst int inf = 1<<28;\n\nstruct edge{\n int src, dst;\n int cost;\n edge(int src, int dst, int cost):src(src), dst(dst), cost(cost){}\n};\n\nstruct state{\n int pos;\n int prev;\n int cost;\n \n state(int pos, int prev, int cost):pos(pos),prev(prev),cost(cost){}\n\n bool operator>(const state &t)const{\n if(cost!=t.cost)return cost>t.cost;\n if(prev!=t.prev)return prev>t.prev;\n if(pos!=t.pos)return pos>t.pos;\n return false;\n }\n};\n\ntypedef vector<edge> edges;\ntypedef vector<edges> graph;\n\nint convTime(const string &s){\n int h = atoi(s.substr(0,2).c_str());\n int m = atoi(s.substr(3,2).c_str());\n return 60 * h + m;\n}\n\nstring revTime(int t){\n char buf[32];\n sprintf(buf, \"%02d:%02d\", t/60, t%60);\n return string(buf);\n}\n\n// static int dist[MAX_V][MAX_V];\nint **dist = NULL;\n// = new int* [v];\nvoid johnson(const graph &tmp_g){\n graph g = tmp_g;\n \n const int v = g.size();\n // [v];\n // int **prev = new static int prev[MAX_V][MAX_V];\n \n for(int i = 0; i < v; ++i){\n dist[i] = new int[v];\n for(int j = 0; j < v; ++j){\n dist[i][j] = inf;\n // prev[i][j] = -1;\n }\n dist[i][i] = 0;\n }\n\n for(int s = 0; s < v; ++s){\n priority_queue<state, vector<state>, greater<state> > q;\n q.push(state(s,s,0));\n // bool vis[v]\n while(!q.empty()){\n state cur = q.top(); q.pop();\n // if(prev[s][cur.pos]!=-1)continue;\n // prev[s][cur.pos] = cur.prev;\n for(int i = 0; i < (int)g[cur.pos].size(); ++i){\n edge e = g[cur.pos][i];\n int cost = cur.cost + e.cost;\n assert(cost>=0);\n if(dist[s][e.dst] > cost){\n dist[s][e.dst] = cost;\n q.push(state(e.dst,cur.pos,cost));\n }\n }\n }\n }\n \n return ; \n}\n\nint main()\n{\n int n;\n while(cin>>n && n){\n int id = 1;\n int vid = 0;\n map<string,int> cityDict;\n map<int,string> revCityDict;\n set<int> cityEvTimes[max_place];\n graph g(MAX_V);\n \n map<pair<int,int>, int> vID;\n map<int,pair<int,int> > revID;\n \n for(int i = 0; i < n; ++i){\n string from, ftime, to, ttime;\n int cost;\n\n cin >> from >> ftime >> to >> ttime >> cost;\n if(!cityDict.count(from)){\n cityDict[from] = id;\n revCityDict[id] = from;\n ++id;\n }\n if(!cityDict.count(to)){\n cityDict[to] = id;\n revCityDict[id] = to;\n ++id;\n }\n\n int src = cityDict[from];\n int dst = cityDict[to];\n int srcTime = convTime(ftime) - 480;\n int dstTime = convTime(ttime) - 480;\n \n if( dstTime >= 0 && dstTime < max_time && srcTime >= 0 && srcTime < max_time ){\n if( !vID.count(make_pair(src,srcTime)) ){\n vID[make_pair(src,srcTime)] = vid;\n revID[vid] = make_pair(src,srcTime);\n ++vid;\n }\n cityEvTimes[src].insert(srcTime);\n if( !vID.count(make_pair(dst,dstTime)) ){\n vID[make_pair(dst,dstTime)] = vid;\n revID[vid] = make_pair(dst,dstTime);\n ++vid;\n }\n cityEvTimes[dst].insert(dstTime);\n \n g[vID[make_pair(src,srcTime)]].push_back( edge(vID[make_pair(src,srcTime)], vID[make_pair(dst,dstTime)], cost) );\n }\n\n }\n g.resize(vID.size());\n \n for(int i = 1; i < id; ++i){\n foreach(it2, cityEvTimes[i]){\n set<int>::iterator it3 = it2;\n ++it3;\n if( it3 != cityEvTimes[i].end() ){\n g[vID[make_pair(i,*it2)]].push_back( edge(vID[make_pair(i,*it2)], vID[make_pair(i,*it3)], 0) );\n }\n }\n }\n \n dist=new int*[g.size()];\n for(int i = 0; i < (int)g.size(); ++i){\n dist[i] = new int[g.size()];\n }\n \n johnson(g);\n\n int res = inf;\n int kenInitial = cityDict[\"Tokyo\"];\n int keikoInitial = cityDict[\"Hakodate\"];\n\n int ken_st, keiko_st;\n if( cityEvTimes[kenInitial].size() > 0 && cityEvTimes[keikoInitial].size() > 0 ){\n ken_st = vID[make_pair(kenInitial, *(cityEvTimes[kenInitial].begin()))];\n keiko_st = vID[make_pair(keikoInitial, *(cityEvTimes[keikoInitial].begin()))];\n\n for(int i = 1; i < id; ++i){\n foreach(ev1, cityEvTimes[i]){\n int v1 = vID[make_pair(i,*ev1)];\n foreach(ev2, cityEvTimes[i]){\n int v2 = vID[make_pair(i,*ev2)];\n int st = max(*ev1, *ev2) + 30;\n int from = -1;\n\n if(cityEvTimes[i].lower_bound(st)!=cityEvTimes[i].end()){\n from = vID[make_pair(i,*(cityEvTimes[i].lower_bound(st)))];\n }\n if(from<0)continue;\n foreach(ev3, cityEvTimes[kenInitial]){\n if( *ev3 < st ) continue;\n int v3 = vID[make_pair(kenInitial,*ev3)];\n foreach(ev4, cityEvTimes[keikoInitial]){\n if( *ev4 < st ) continue;\n int v4 = vID[make_pair(keikoInitial, *ev4)];\n res = min(res, dist[ken_st][v1] + dist[keiko_st][v2] + dist[from][v3] + dist[from][v4]);\n }\n }\n }\n }\n }\n \n }\n \n\n if(res>=inf)res = 0;\n cout << res << endl;\n\n for(int i = 0; i < (int)g.size(); ++i){\n delete [] dist[i];\n }\n delete [] dist;\n \n }\n return 0;\n}","accuracy":1,"time_ms":1540,"memory_kb":23184,"score_of_the_acc":-0.9405,"final_rank":9},{"submission_id":"aoj_1229_505240","code_snippet":"#include<iostream>\n#include<queue>\n#include<string>\n#include<map>\n#include<cstdlib>\n#include<algorithm>\n#include<functional>\n#include<set>\n#include<cstdio>\n#include<cassert>\n\nusing namespace std;\n\n#define foreach(i,o) for(__typeof((o).begin()) i = (o).begin(); i != (o).end(); ++i)\n\nconst int max_place = 101;\nconst int max_time = 601;\nconst int MAX_V = 2010;\nconst int inf = 1<<28;\n\nstruct edge{\n int src, dst;\n int cost;\n edge(int src, int dst, int cost):src(src), dst(dst), cost(cost){}\n};\n\nstruct state{\n int pos;\n int prev;\n int cost;\n \n state(int pos, int prev, int cost):pos(pos),prev(prev),cost(cost){}\n\n bool operator>(const state &t)const{\n if(cost!=t.cost)return cost>t.cost;\n if(prev!=t.prev)return prev>t.prev;\n if(pos!=t.pos)return pos>t.pos;\n return false;\n }\n};\n\ntypedef vector<edge> edges;\ntypedef vector<edges> graph;\n\nint convTime(const string &s){\n int h = atoi(s.substr(0,2).c_str());\n int m = atoi(s.substr(3,2).c_str());\n return 60 * h + m;\n}\n\nstring revTime(int t){\n char buf[32];\n sprintf(buf, \"%02d:%02d\", t/60, t%60);\n return string(buf);\n}\n\nstatic int dist[MAX_V][MAX_V];\nvoid johnson(const graph &tmp_g){\n graph g = tmp_g;\n \n const int v = g.size();\n //static int h[MAX_V];\n static int prev[MAX_V][MAX_V];\n \n\n /*\n for(int i = 0; i < v; ++i){\n h[i] = 0;\n }\n */\n\n /*\n for(int i = 0; i <= v; ++i){\n bool end = true;\n for(int j = 0; j < v; ++j){\n for(int k = 0; k < (int)g[j].size(); ++k){\n edge e = g[j][k];\n int tmp = h[j] + e.cost;\n if( h[e.dst] > tmp ){\n h[e.dst] = tmp;\n end = false;\n }\n }\n }\n if(end)break;\n // do not detect an negative cycle.\n }\n */\n\n for(int i = 0; i < v; ++i){\n for(int j = 0; j < v; ++j){\n dist[i][j] = inf;\n prev[i][j] = -1;\n }\n dist[i][i] = 0;\n }\n\n /*\n for(int i = 0; i < v; ++i){\n for(int j = 0; j < (int)g[i].size(); ++j){\n g[i][j].cost += h[i] - h[g[i][j].dst];\n }\n }\n */\n\n for(int s = 0; s < v; ++s){\n priority_queue<state, vector<state>, greater<state> > q;\n q.push(state(s,s,0));\n while(!q.empty()){\n state cur = q.top(); q.pop();\n if(prev[s][cur.pos]!=-1)continue;\n prev[s][cur.pos] = cur.prev;\n for(int i = 0; i < (int)g[cur.pos].size(); ++i){\n edge e = g[cur.pos][i];\n int cost = cur.cost + e.cost;\n assert(cost>=0);\n if(dist[s][e.dst] > cost){\n dist[s][e.dst] = cost;\n q.push(state(e.dst,cur.pos,cost));\n }\n }\n }\n // for(int i = 0; i < v; ++i){\n //dist[s][i] += h[i] - h[s];\n //}\n }\n\n return ; \n}\n\nint main()\n{\n int n;\n while(cin>>n && n){\n int id = 1;\n int vid = 0;\n map<string,int> cityDict;\n map<int,string> revCityDict;\n set<int> cityEvTimes[max_place];\n graph g(MAX_V);\n \n map<pair<int,int>, int> vID;\n map<int,pair<int,int> > revID;\n \n for(int i = 0; i < n; ++i){\n string from, ftime, to, ttime;\n int cost;\n\n cin >> from >> ftime >> to >> ttime >> cost;\n if(!cityDict.count(from)){\n cityDict[from] = id;\n revCityDict[id] = from;\n ++id;\n }\n if(!cityDict.count(to)){\n cityDict[to] = id;\n revCityDict[id] = to;\n ++id;\n }\n\n int src = cityDict[from];\n int dst = cityDict[to];\n int srcTime = convTime(ftime) - 480;\n int dstTime = convTime(ttime) - 480;\n \n if( dstTime >= 0 && dstTime < max_time && srcTime >= 0 && srcTime < max_time ){\n if( !vID.count(make_pair(src,srcTime)) ){\n vID[make_pair(src,srcTime)] = vid;\n revID[vid] = make_pair(src,srcTime);\n ++vid;\n }\n cityEvTimes[src].insert(srcTime);\n if( !vID.count(make_pair(dst,dstTime)) ){\n vID[make_pair(dst,dstTime)] = vid;\n revID[vid] = make_pair(dst,dstTime);\n ++vid;\n }\n cityEvTimes[dst].insert(dstTime);\n \n g[vID[make_pair(src,srcTime)]].push_back( edge(vID[make_pair(src,srcTime)], vID[make_pair(dst,dstTime)], cost) );\n }\n\n }\n g.resize(vID.size());\n \n for(int i = 1; i < id; ++i){\n foreach(it2, cityEvTimes[i]){\n set<int>::iterator it3 = it2;\n ++it3;\n if( it3 != cityEvTimes[i].end() ){\n g[vID[make_pair(i,*it2)]].push_back( edge(vID[make_pair(i,*it2)], vID[make_pair(i,*it3)], 0) );\n }\n }\n }\n \n johnson(g);\n\n int res = inf;\n int kenInitial = cityDict[\"Tokyo\"];\n int keikoInitial = cityDict[\"Hakodate\"];\n\n int ken_st, keiko_st;\n if( cityEvTimes[kenInitial].size() > 0 && cityEvTimes[keikoInitial].size() > 0 ){\n ken_st = vID[make_pair(kenInitial, *(cityEvTimes[kenInitial].begin()))];\n keiko_st = vID[make_pair(keikoInitial, *(cityEvTimes[keikoInitial].begin()))];\n\n for(int i = 1; i < id; ++i){\n foreach(ev1, cityEvTimes[i]){\n int v1 = vID[make_pair(i,*ev1)];\n foreach(ev2, cityEvTimes[i]){\n int v2 = vID[make_pair(i,*ev2)];\n int st = max(*ev1, *ev2) + 30;\n int from = -1;\n\n if(cityEvTimes[i].lower_bound(st)!=cityEvTimes[i].end()){\n from = vID[make_pair(i,*(cityEvTimes[i].lower_bound(st)))];\n }\n if(from<0)continue;\n foreach(ev3, cityEvTimes[kenInitial]){\n if( *ev3 < st ) continue;\n int v3 = vID[make_pair(kenInitial,*ev3)];\n foreach(ev4, cityEvTimes[keikoInitial]){\n if( *ev4 < st ) continue;\n int v4 = vID[make_pair(keikoInitial, *ev4)];\n res = min(res, dist[ken_st][v1] + dist[keiko_st][v2] + dist[from][v3] + dist[from][v4]);\n }\n }\n }\n }\n }\n \n }\n \n\n if(res>=inf)res = 0;\n cout << res << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":1670,"memory_kb":32480,"score_of_the_acc":-1.2459,"final_rank":13},{"submission_id":"aoj_1229_505238","code_snippet":"#include<iostream>\n#include<queue>\n#include<string>\n#include<map>\n#include<cstdlib>\n#include<algorithm>\n#include<functional>\n#include<set>\n#include<cstdio>\n#include<cassert>\n\nusing namespace std;\n\n#define foreach(i,o) for(__typeof((o).begin()) i = (o).begin(); i != (o).end(); ++i)\n\nconst int max_place = 101;\nconst int max_time = 601;\nconst int MAX_V = 2010;\nconst int inf = 1<<28;\n\nstruct edge{\n int src, dst;\n int cost;\n edge(int src, int dst, int cost):src(src), dst(dst), cost(cost){}\n};\n\nstruct state{\n int pos;\n int prev;\n int cost;\n \n state(int pos, int prev, int cost):pos(pos),prev(prev),cost(cost){}\n\n bool operator>(const state &t)const{\n if(cost!=t.cost)return cost>t.cost;\n if(prev!=t.prev)return prev>t.prev;\n if(pos!=t.pos)return pos>t.pos;\n return false;\n }\n};\n\ntypedef vector<edge> edges;\ntypedef vector<edges> graph;\n\nint convTime(const string &s){\n int h = atoi(s.substr(0,2).c_str());\n int m = atoi(s.substr(3,2).c_str());\n return 60 * h + m;\n}\n\nstring revTime(int t){\n char buf[32];\n sprintf(buf, \"%02d:%02d\", t/60, t%60);\n return string(buf);\n}\n\nstatic int dist[MAX_V][MAX_V];\nvoid johnson(const graph &tmp_g){\n graph g = tmp_g;\n \n const int v = g.size();\n static int h[MAX_V];\n static int prev[MAX_V][MAX_V];\n \n\n for(int i = 0; i < v; ++i){\n h[i] = 0;\n }\n\n for(int i = 0; i <= v; ++i){\n bool end = true;\n for(int j = 0; j < v; ++j){\n for(int k = 0; k < (int)g[j].size(); ++k){\n edge e = g[j][k];\n int tmp = h[j] + e.cost;\n if( h[e.dst] > tmp ){\n h[e.dst] = tmp;\n end = false;\n }\n }\n }\n if(end)break;\n // do not detect an negative cycle.\n }\n\n for(int i = 0; i < v; ++i){\n for(int j = 0; j < v; ++j){\n dist[i][j] = inf;\n prev[i][j] = -1;\n }\n dist[i][i] = 0;\n }\n\n for(int i = 0; i < v; ++i){\n for(int j = 0; j < (int)g[i].size(); ++j){\n g[i][j].cost += h[i] - h[g[i][j].dst];\n }\n }\n\n for(int s = 0; s < v; ++s){\n priority_queue<state, vector<state>, greater<state> > q;\n q.push(state(s,s,0));\n while(!q.empty()){\n state cur = q.top(); q.pop();\n if(prev[s][cur.pos]!=-1)continue;\n prev[s][cur.pos] = cur.prev;\n for(int i = 0; i < (int)g[cur.pos].size(); ++i){\n edge e = g[cur.pos][i];\n int cost = cur.cost + e.cost;\n assert(cost>=0);\n if(dist[s][e.dst] > cost){\n dist[s][e.dst] = cost;\n q.push(state(e.dst,cur.pos,cost));\n }\n }\n }\n for(int i = 0; i < v; ++i){\n dist[s][i] += h[i] - h[s];\n }\n }\n\n return ; \n}\n\nint main()\n{\n int n;\n while(cin>>n && n){\n int id = 1;\n int vid = 0;\n map<string,int> cityDict;\n map<int,string> revCityDict;\n set<int> cityEvTimes[max_place];\n graph g(MAX_V);\n \n map<pair<int,int>, int> vID;\n map<int,pair<int,int> > revID;\n \n for(int i = 0; i < n; ++i){\n string from, ftime, to, ttime;\n int cost;\n\n cin >> from >> ftime >> to >> ttime >> cost;\n if(!cityDict.count(from)){\n cityDict[from] = id;\n revCityDict[id] = from;\n ++id;\n }\n if(!cityDict.count(to)){\n cityDict[to] = id;\n revCityDict[id] = to;\n ++id;\n }\n\n int src = cityDict[from];\n int dst = cityDict[to];\n int srcTime = convTime(ftime) - 480;\n int dstTime = convTime(ttime) - 480;\n \n if( dstTime >= 0 && dstTime < max_time && srcTime >= 0 && srcTime < max_time ){\n if( !vID.count(make_pair(src,srcTime)) ){\n vID[make_pair(src,srcTime)] = vid;\n revID[vid] = make_pair(src,srcTime);\n ++vid;\n }\n cityEvTimes[src].insert(srcTime);\n if( !vID.count(make_pair(dst,dstTime)) ){\n vID[make_pair(dst,dstTime)] = vid;\n revID[vid] = make_pair(dst,dstTime);\n ++vid;\n }\n cityEvTimes[dst].insert(dstTime);\n \n g[vID[make_pair(src,srcTime)]].push_back( edge(vID[make_pair(src,srcTime)], vID[make_pair(dst,dstTime)], cost) );\n }\n\n }\n g.resize(vID.size());\n \n for(int i = 1; i < id; ++i){\n foreach(it2, cityEvTimes[i]){\n set<int>::iterator it3 = it2;\n ++it3;\n if( it3 != cityEvTimes[i].end() ){\n g[vID[make_pair(i,*it2)]].push_back( edge(vID[make_pair(i,*it2)], vID[make_pair(i,*it3)], 0) );\n }\n }\n }\n \n johnson(g);\n\n int res = inf;\n int kenInitial = cityDict[\"Tokyo\"];\n int keikoInitial = cityDict[\"Hakodate\"];\n\n int ken_st, keiko_st;\n if( cityEvTimes[kenInitial].size() > 0 && cityEvTimes[keikoInitial].size() > 0 ){\n ken_st = vID[make_pair(kenInitial, *(cityEvTimes[kenInitial].begin()))];\n keiko_st = vID[make_pair(keikoInitial, *(cityEvTimes[keikoInitial].begin()))];\n\n for(int i = 1; i < id; ++i){\n foreach(ev1, cityEvTimes[i]){\n int v1 = vID[make_pair(i,*ev1)];\n foreach(ev2, cityEvTimes[i]){\n int v2 = vID[make_pair(i,*ev2)];\n int st = max(*ev1, *ev2) + 30;\n int from = -1;\n\n if(cityEvTimes[i].lower_bound(st)!=cityEvTimes[i].end()){\n from = vID[make_pair(i,*(cityEvTimes[i].lower_bound(st)))];\n }\n if(from<0)continue;\n foreach(ev3, cityEvTimes[kenInitial]){\n if( *ev3 < st ) continue;\n int v3 = vID[make_pair(kenInitial,*ev3)];\n foreach(ev4, cityEvTimes[keikoInitial]){\n if( *ev4 < st ) continue;\n int v4 = vID[make_pair(keikoInitial, *ev4)];\n res = min(res, dist[ken_st][v1] + dist[keiko_st][v2] + dist[from][v3] + dist[from][v4]);\n }\n }\n }\n }\n }\n \n }\n \n\n if(res>=inf)res = 0;\n cout << res << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":1650,"memory_kb":32480,"score_of_the_acc":-1.243,"final_rank":12},{"submission_id":"aoj_1229_505236","code_snippet":"#include<iostream>\n#include<queue>\n#include<string>\n#include<map>\n#include<cstdlib>\n#include<algorithm>\n#include<functional>\n#include<set>\n#include<cstdio>\n#include<cassert>\n\nusing namespace std;\n\n#define foreach(i,o) for(__typeof((o).begin()) i = (o).begin(); i != (o).end(); ++i)\n\nconst int max_place = 101;\nconst int max_time = 601;\nconst int MAX_V = 2010;\nconst int inf = 1<<28;\n\nstruct edge{\n int src, dst;\n int cost;\n edge(int src, int dst, int cost):src(src), dst(dst), cost(cost){}\n};\n\nstruct state{\n int pos;\n int prev;\n int cost;\n \n state(int pos, int prev, int cost):pos(pos),prev(prev),cost(cost){}\n\n bool operator>(const state &t)const{\n if(cost!=t.cost)return cost>t.cost;\n if(prev!=t.prev)return prev>t.prev;\n if(pos!=t.pos)return pos>t.pos;\n return false;\n }\n \n /*\n bool operator<(const state &t)const{\n if(pos!=t.pos)return pos<t.pos;\n return false;\n }\n */\n};\n\ntypedef vector<edge> edges;\ntypedef vector<edges> graph;\n\nint convTime(const string &s){\n int h = atoi(s.substr(0,2).c_str());\n int m = atoi(s.substr(3,2).c_str());\n return 60 * h + m;\n}\n\nstring revTime(int t){\n char buf[32];\n sprintf(buf, \"%02d:%02d\", t/60, t%60);\n return string(buf);\n}\n\nstatic int dist[MAX_V][MAX_V];\nvoid johnson(const graph &tmp_g){\n graph g = tmp_g;\n \n const int v = g.size();\n static int h[MAX_V];\n static int prev[MAX_V][MAX_V];\n \n\n for(int i = 0; i < v; ++i){\n h[i] = 0;\n }\n\n for(int i = 0; i <= v; ++i){\n bool end = true;\n for(int j = 0; j < v; ++j){\n for(int k = 0; k < (int)g[j].size(); ++k){\n edge e = g[j][k];\n int tmp = h[j] + e.cost;\n if( h[e.dst] > tmp ){\n h[e.dst] = tmp;\n end = false;\n }\n }\n }\n if(end)break;\n // do not detect an negative cycle.\n }\n\n for(int i = 0; i < v; ++i){\n for(int j = 0; j < v; ++j){\n dist[i][j] = inf;\n prev[i][j] = -1;\n }\n dist[i][i] = 0;\n }\n\n for(int i = 0; i < v; ++i){\n for(int j = 0; j < (int)g[i].size(); ++j){\n g[i][j].cost += h[i] - h[g[i][j].dst];\n }\n }\n\n for(int s = 0; s < v; ++s){\n priority_queue<state, vector<state>, greater<state> > q;\n q.push(state(s,s,0));\n while(!q.empty()){\n state cur = q.top(); q.pop();\n if(prev[s][cur.pos]!=-1)continue;\n prev[s][cur.pos] = cur.prev;\n for(int i = 0; i < (int)g[cur.pos].size(); ++i){\n edge e = g[cur.pos][i];\n int cost = cur.cost + e.cost;\n assert(cost>=0);\n if(dist[s][e.dst] > cost){\n dist[s][e.dst] = cost;\n q.push(state(e.dst,cur.pos,cost));\n }\n }\n }\n for(int i = 0; i < v; ++i){\n dist[s][i] += h[i] - h[s];\n }\n }\n\n return ; \n}\n\nint main()\n{\n int n;\n while(cin>>n && n){\n int id = 1;\n int vid = 0;\n map<string,int> cityDict;\n map<int,string> revCityDict;\n set<int> cityEvTimes[max_place];\n graph g(MAX_V);\n \n map<pair<int,int>, int> vID;\n map<int,pair<int,int> > revID;\n \n for(int i = 0; i < n; ++i){\n string from, ftime, to, ttime;\n int cost;\n\n cin >> from >> ftime >> to >> ttime >> cost;\n if(!cityDict.count(from)){\n cityDict[from] = id;\n revCityDict[id] = from;\n ++id;\n }\n if(!cityDict.count(to)){\n cityDict[to] = id;\n revCityDict[id] = to;\n ++id;\n }\n\n int src = cityDict[from];\n int dst = cityDict[to];\n int srcTime = convTime(ftime) - 480;\n int dstTime = convTime(ttime) - 480;\n \n if( dstTime >= 0 && dstTime < max_time && srcTime >= 0 && srcTime < max_time ){\n if( !vID.count(make_pair(src,srcTime)) ){\n vID[make_pair(src,srcTime)] = vid;\n revID[vid] = make_pair(src,srcTime);\n ++vid;\n }\n cityEvTimes[src].insert(srcTime);\n if( !vID.count(make_pair(dst,dstTime)) ){\n vID[make_pair(dst,dstTime)] = vid;\n revID[vid] = make_pair(dst,dstTime);\n ++vid;\n }\n cityEvTimes[dst].insert(dstTime);\n \n g[vID[make_pair(src,srcTime)]].push_back( edge(vID[make_pair(src,srcTime)], vID[make_pair(dst,dstTime)], cost) );\n }\n\n }\n g.resize(vID.size());\n \n for(int i = 1; i < id; ++i){\n // sort( it->second.begin(), it->second.end() );\n foreach(it2, cityEvTimes[i]){\n // g[it->first].push_back( edge(it->first, it->second[i], it->first, it->second[i], 0) );\n set<int>::iterator it3 = it2;\n ++it3;\n if( it3 != cityEvTimes[i].end() ){\n g[vID[make_pair(i,*it2)]].push_back( edge(vID[make_pair(i,*it2)], vID[make_pair(i,*it3)], 0) );\n }\n }\n }\n \n\n /*\n for(int i = 0; i < (int)g.size(); ++i){\n cout << i << ' ' << revCityDict[i] << ':' << endl;\n for(int j = 0; j < (int)g[i].size(); ++j){\n edge e = g[i][j];\n cout << revCityDict[e.src] << ' ' << revTime(e.srcTime) << ' ' << revCityDict[e.dst] << ' ' << revTime(e.dstTime) << endl;\n }\n }\n cout << \"---\"<<endl;\n */\n\n /*\n foreach(i,revID){\n cout << revCityDict[i->second.first] << ' ' << revTime(i->second.second+480) << endl;\n }\n */\n\n johnson(g);\n\n /*\n for(int i = 0; i < (int)g.size(); ++i){\n for(int j = 0; j < (int)g.size(); ++j){\n cout << i << ' ' << j << \" : \" << dist[i][j] <<endl;\n }\n }\n */\n\n int res = inf;\n int kenInitial = cityDict[\"Tokyo\"];\n int keikoInitial = cityDict[\"Hakodate\"];\n\n //cout << kenInitial << ' ' << keikoInitial << endl;\n\n int ken_st, keiko_st;\n if( cityEvTimes[kenInitial].size() > 0 && cityEvTimes[keikoInitial].size() > 0 ){\n ken_st = vID[make_pair(kenInitial, *(cityEvTimes[kenInitial].begin()))];\n keiko_st = vID[make_pair(keikoInitial, *(cityEvTimes[keikoInitial].begin()))];\n\n //cout <<ken_st << ' ' <<keiko_st << endl;\n \n for(int i = 1; i < id; ++i){\n foreach(ev1, cityEvTimes[i]){\n int v1 = vID[make_pair(i,*ev1)];\n foreach(ev2, cityEvTimes[i]){\n int v2 = vID[make_pair(i,*ev2)];\n int st = max(*ev1, *ev2) + 30;\n int from = -1;\n\n if(cityEvTimes[i].lower_bound(st)!=cityEvTimes[i].end()){\n from = vID[make_pair(i,*(cityEvTimes[i].lower_bound(st)))];\n }\n if(from<0)continue;\n\n //cout << v1 << ' ' << v2 << ' ' << from << endl;\n\n foreach(ev3, cityEvTimes[kenInitial]){\n if( *ev3 < st ) continue;\n int v3 = vID[make_pair(kenInitial,*ev3)];\n foreach(ev4, cityEvTimes[keikoInitial]){\n if( *ev4 < st ) continue;\n int v4 = vID[make_pair(keikoInitial, *ev4)];\n // cout << i << ' ' << revTime(*ev1+480) << ' ' << revTime(*ev2+480) << ' ' << revTime(*ev3+480) << ' ' << revTime(*ev4+480) << ' ' << revTime(st+480) << \" : \" << sssp[0][i][*ev1] << ' '<<sssp[1][i][*ev2]<<' '<<sssp[2][kenInitial][*ev3]<< ' ' <<sssp[2][keikoInitial][*ev4] << endl;\n res = min(res, dist[ken_st][v1] + dist[keiko_st][v2] + dist[from][v3] + dist[from][v4]);\n }\n }\n }\n }\n }\n \n }\n \n\n if(res>=inf)res = 0;\n cout << res << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":1680,"memory_kb":32476,"score_of_the_acc":-1.2473,"final_rank":14},{"submission_id":"aoj_1229_410216","code_snippet":"#include <iostream>\n#include <sstream>\n#include <cstring>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <queue>\n#include <map>\nusing namespace std;\n\nconst int INF = (1<<28);\nconst int STR = (8*60);\nconst int LIM = (18*60);\n\nclass Train\n{\npublic:\n\tint src,dst,dep,arv,cst;\n\tTrain(int src, int dst, int dep, int arv, int cst)\n\t\t:src(src),dst(dst),dep(dep),arv(arv),cst(cst)\n\t{}\n};\n\nclass State\n{\npublic:\n\tint p,tm,cst,pvT, pvC;\n\tState(int p, int tm, int cst, int pvT, int pvC)\n\t\t:p(p),tm(tm),cst(cst),pvT(pvT),pvC(pvC)\n\t{}\n\n\tbool operator<(const State& s) const\n\t{\n\t\tif(cst != s.cst) return cst > s.cst;\n\t\treturn tm > s.tm;\n\t}\n};\n\ntypedef vector<Train> City;\ntypedef vector<vector<int> > Matrix;\n\nint toMin(string s)\n{\n\tstringstream ss(s);\n\tint h,m;\n\tchar t;\n\tss >> h >> t >> m;\n\n\treturn h*60+m;\n}\n\nbool used[100][2005];\n\nint dijkstra_go(int S, int T, int u, vector<City>& cities)\n{\n\tpriority_queue<State> q;\n\n\tfor(int i=0; i<cities[S].size(); i++)\n\t\tq.push(State(cities[S][i].dst, cities[S][i].arv, cities[S][i].cst, i, S));\n\n\tmemset(used, 0, sizeof(used));\n\n\twhile(!q.empty()) {\n\t\tState s=q.top(); q.pop();\n\t\tif(used[s.pvC][s.pvT]) continue;\n\t\tused[s.pvC][s.pvT] = true;\n\n\t\tif(s.pvC == T && s.pvT == u) return s.cst-cities[s.pvC][s.pvT].cst;\n\n\t\tfor(int i=0; i<cities[s.p].size(); i++) {\n\t\t\tTrain t = cities[s.p][i];\n\t\t\tif(used[s.p][i]) continue;\n\t\t\tif(s.tm > t.dep) continue;\n\t\t\tif(i == u && s.p == T && s.tm + 30 > t.dep) continue;\n\n\t\t\tq.push(State(t.dst, t.arv, s.cst+t.cst, i, s.p));\n\t\t}\n\t}\n\n\treturn INF;\n}\n\nint dijkstra_back(int S, int T, int u, vector<City>& cities)\n{\n\tif(S == T) return 0;\n\n\tpriority_queue<State> q;\n\tq.push(State(cities[S][u].dst, cities[S][u].arv, cities[S][u].cst, u, S));\n\n\tmemset(used, 0, sizeof(used));\n\n\twhile(!q.empty()) {\n\t\tState s = q.top(); q.pop();\n\t\tif(used[s.pvC][s.pvT]) continue;\n\t\tused[s.pvC][s.pvT] = true;\n\n\t\tif(s.p == T) return s.cst;\n\n\t\tfor(int i=0; i<cities[s.p].size(); i++) {\n\t\t\tTrain t = cities[s.p][i];\n\t\t\tif(used[s.p][i]) continue;\n\t\t\tif(s.tm > t.dep) continue;\n\n\t\t\tq.push(State(t.dst, t.arv, s.cst+t.cst, i, s.p));\n\t\t}\n\t}\n\n\treturn INF;\n}\n\nint solve(int Hakodate, int Tokyo, vector<City>& cities)\n{\n\tMatrix goKen(cities.size());\n\tfor(int i=0; i<cities.size(); i++) {\n\t\tgoKen[i].resize(cities[i].size());\n\t\tfor(int j=0; j<cities[i].size(); j++) {\n\t\t\tgoKen[i][j] = INF;\n\t\t}\n\t}\n\n\tMatrix backKen(goKen), goKeiko(goKen), backKeiko(goKen);\n\n\tfor(int i=0; i<cities.size(); i++)\n\tfor(int j=0; j<cities[i].size(); j++) {\n\t\tgoKen[i][j] = dijkstra_go(Hakodate, i, j, cities);\n\t\tgoKeiko[i][j] = dijkstra_go(Tokyo, i, j, cities);\n\t\tbackKen[i][j] = dijkstra_back(i, Hakodate, j, cities);\n\t\tbackKeiko[i][j] = dijkstra_back(i, Tokyo, j, cities);\n\t}\n\n\tint res = INF;\n\tfor(int i=0; i<cities.size(); i++)\n\tfor(int j=0; j<cities[i].size(); j++)\n\tfor(int k=0; k<cities[i].size(); k++)\n\t{\n\t\tint g = (cities[i][j].dep < cities[i][k].dep ? j : k);\n\t\tres = min(res, goKeiko[i][g]+goKen[i][g]+backKeiko[i][j]+backKen[i][k]);\n\t}\n\n\tif(res == INF) res = 0;\n\n\treturn res;\n}\n\nint main()\n{\n\tint N;\n\twhile(cin >> N, N) {\n\t\t\n\t\tint cnt=0;\n\t\tmap<string, int> dic;\n\t\tvector<City> cities(N);\n\t\tfor(int i=0; i<N; i++) {\n\t\t\tstring src,dst,t,s;\n\t\t\tint c;\n\t\t\tcin >> src >> t >> dst >> s >> c;\n\t\t\t\n\t\t\tif(!dic.count(src)) dic[src] = cnt++;\n\t\t\tif(!dic.count(dst)) dic[dst] = cnt++;\n\n\t\t\tint l = toMin(t), r = toMin(s);\n\t\t\tif(l < STR || r < STR|| l > LIM || r > LIM) continue;\n\n\t\t\tcities[dic[src]].push_back(Train(dic[src], dic[dst], l, r, c));\n\t\t}\n\n\t\tint hako = dic[\"Hakodate\"];\n\t\tint tokyo = dic[\"Tokyo\"];\n\n\t\tcities[hako].push_back(Train(hako, hako, LIM, LIM, 0));\n\t\tcities[tokyo].push_back(Train(tokyo, tokyo, LIM, LIM, 0));\n\n\t\tcout << solve(hako, tokyo, cities) << endl;\n\t}\n\n}","accuracy":1,"time_ms":1880,"memory_kb":1396,"score_of_the_acc":-0.32,"final_rank":7},{"submission_id":"aoj_1229_363161","code_snippet":"#define INF 10000000\n#define BIAS 24*60\n#include <stdlib.h>\n#include <math.h>\n#include <stdio.h>\n#include <string.h>\n\nchar gCity[2001][64];\nint gCityNum = 0;\nint from_hakodate[2001][101];\nint to_hakodate[2001][101];\nint from_tokyo[2001][101];\nint to_tokyo[2001][101];\n\nstruct Train{\n int from, to;\n int dpt, arv;\n int fare;\n};\n\nint max(int lhs,int rhs){\n if(lhs > rhs) return lhs;\n else return rhs;\n}\n\nint min(int lhs,int rhs){\n if(lhs > rhs) return rhs;\n else return lhs;\n}\n\nint getCityNum(char* cityName){\n int i;\n for(i=0;i<gCityNum;i++){\n if(strcmp(gCity[i],cityName)==0) return i;\n }\n \n strcpy(gCity[gCityNum],cityName);\n return gCityNum++;\n}\n\nvoid setTrain(int idx,struct Train* trains,\n\t int dptH,int dptM,int arvH,int arvM,int fare,\n\t char dptCity[64],char arvCity[64]){\n trains[idx].from = getCityNum(dptCity);\n trains[idx].to = getCityNum(arvCity);\n trains[idx].dpt = dptH*60 + dptM;\n trains[idx].arv = arvH*60 + arvM;\n trains[idx].fare = fare;\n}\n\nvoid setRTrain(int idx,struct Train* trains,\n\t int dptH,int dptM,int arvH,int arvM,int fare,\n\t char dptCity[64],char arvCity[64]){\n trains[idx].from = getCityNum(arvCity);\n trains[idx].to = getCityNum(dptCity);\n trains[idx].dpt = BIAS - (arvH*60 + arvM);\n trains[idx].arv = BIAS - (dptH*60 + dptM);\n trains[idx].fare = fare;\n}\n\nint seekMaxFareTrain(struct Train* trains,int ub){\n int i;\n int maxFare = -1;\n int res;\n for(i=0;i<ub;i++){\n if(maxFare < trains[i].fare){\n maxFare = trains[i].fare;\n res = i;\n }\n }\n return res;\n}\n\nint seekMostDelayTrain(struct Train* trains,int ub){\n int i;\n int mostDelay = -1;\n int res;\n for(i=0;i<ub;i++){\n if(mostDelay < abs(trains[i].dpt - trains[i].arv)){\n mostDelay = abs(trains[i].dpt - trains[i].arv);\n res = i;\n }\n }\n return res;\n}\n\nint change(int city,int id,struct Train* trains){\n int i;\n for(i=id-1;i>=0;i--){\n if(trains[i].arv <= trains[id].dpt\n && trains[i].to == city){\n return i;\n }\n } \n\n return 0;\n}\n\nint fr(char* name,int trainNum,int table[2001][101], struct Train* trains){\n int src = getCityNum(name);\n\n //printf(\"%s %d\\n\",name,src);\n\n table[0][src] = 0;\n int i;\n for(i=0;i<trainNum;i++){\n int j;\n for(j=0;j<gCityNum;j++){\n if(j==trains[i].to){\n\ttable[i+1][j] = min(table[i][j],table[change(trains[i].from,i,trains)+1][trains[i].from]+trains[i].fare);\n }\n else table[i+1][j] = table[i][j];\n }\n }\n}\n\nvoid printTable(int table[2001][101],int n){\n int i;\n for(i=0;i<=n;i++){\n int j;\n for(j=0;j<gCityNum;j++){\n printf(\"%d \",table[i][j]);\n }\n printf(\"\\n\");\n }\n}\n\nint mycmp(const void* t1,const void* t2){\n return ((const struct Train*)t1)->arv - ((const struct Train*)t2)->arv;\n}\n\nvoid printTrains(struct Train* trains,int n){\n int i;\n for(i=0;i<n;i++){\n printf(\"%d %d %d %d %d\\n\",\n\t trains[i].from,trains[i].dpt,trains[i].to,\n\t trains[i].arv,trains[i].fare);\n }\n}\n\nint calc_cost(int city,struct Train* trains,struct Train* rtrains,int trainNum){\n int i;\n int res = INF;\n for(i=0;i<trainNum;i++){\n int j;\n for(j=trainNum-1;j>=0;j--){\n int stay = (BIAS - rtrains[j].arv) - trains[i].arv;\n if(stay < 30) continue;\n\n int c = from_hakodate[i+1][city]\n\t+ from_tokyo[i+1][city]\n\t+ to_hakodate[j+1][city]\n\t+ to_tokyo[j+1][city];\n res = min(res,c);\n }\n }\n return res;\n}\n\nint main(){\n int n;\n while(~scanf(\"%d\",&n)){\n if(n==0) break;\n struct Train* trains = (struct Train*)malloc(n*sizeof(struct Train));\n struct Train* rtrains = (struct Train*)malloc(n*sizeof(struct Train));\n int i=0;\n int j=0;\n for(i=0,j=0;i<n;i++){\n int dptH,dptM,arvH,arvM,fare;\n char dptCity[64],arvCity[64];\n scanf(\"%s %d:%d %s %d:%d %d\",dptCity,&dptH,&dptM,arvCity,&arvH,&arvM,&fare);\n if((dptH*60 + dptM < 8*60) || (arvH*60 + arvM > 18*60)) continue;\n setTrain(j,trains,dptH,dptM,arvH,arvM,fare,dptCity,arvCity);\n setRTrain(j++,rtrains,dptH,dptM,arvH,arvM,fare,dptCity,arvCity);\n }\n\n // printTrains(trains,j);\n // printf(\"\\n\");\n qsort(trains,j,sizeof(struct Train),mycmp);\n qsort(rtrains,j,sizeof(struct Train),mycmp);\n\n // printTrains(trains,j);\n // printf(\"\\n\");\n\n memset(from_hakodate,0x3,sizeof(from_hakodate)); \n fr(\"Hakodate\",j,from_hakodate,trains);\n\n memset(from_tokyo,0x3,sizeof(from_tokyo)); \n fr(\"Tokyo\",j,from_tokyo,trains);\n\n memset(to_hakodate,0x3,sizeof(to_hakodate)); \n fr(\"Hakodate\",j,to_hakodate,rtrains);\n\n memset(to_tokyo,0x3,sizeof(to_tokyo)); \n fr(\"Tokyo\",j,to_tokyo,rtrains);\n\n\n int mincost = INF;\n \n for(i=0;i<gCityNum;i++){\n mincost = min(calc_cost(i,trains,rtrains,j),mincost);\n }\n //printTable(to_hakodate,j);\n //printTable(to_tokyo,j);\n \n //printf(\"\\n\");\n //printf(\"cityname:%s cityid:%d\\n\",arvCity,getCityNum(arvCity));\n\n printf(\"%d\\n\",mincost == INF ? 0:mincost);\n\n memset(gCity,'\\0',sizeof(gCity));\n gCityNum = 0;\n free(trains);\n free(rtrains);\n }\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":0,"score_of_the_acc":-0.0089,"final_rank":2},{"submission_id":"aoj_1229_293760","code_snippet":"#include <iostream>\n#include <fstream>\n#include <sstream>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <deque>\n#include <stack>\n#include <map>\n#include <set>\n#include <complex>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <cctype>\n#include <climits>\nusing namespace std;\n\ntypedef long long ll;\n\n#define REP(i,n,m) for(int i=n;i<m;i++)\n#define rep(i,n) REP(i,0,n)\n\nclass E{\npublic:\n int to;\n int ft,tt;\n int cost;\n\n E(){}\n E(int _to,int _ft,int _tt,int _cost){\n to = _to;\n ft = _ft;\n tt = _tt;\n cost = _cost;\n }\n};\n\nclass State{\npublic:\n int id,tm,cost;\n\n State(){}\n State(int _id,int _tm,int _cost){\n id = _id;\n tm = _tm;\n cost = _cost;\n }\n\n bool operator<(const State &st)const{\n return cost > st.cost;\n }\n};\n\nint n,m;\nint A,B;\nint LEAVE,BACK;\nint ac[102][2000],bc[102][2000];\nint r_ac[102][2000],r_bc[102][2000];\nmap<string,int> name;\nvector<E> t[102],rt[102];\n\nint TimeToInt(string s){\n int h = (s[0] - '0') * 10 + (s[1] - '0');\n int m = (s[3] - '0') * 10 + (s[4] - '0');\n return h * 60 + m;\n}\n\nint NameToInt(string s){\n int tmp = name[s];\n if(tmp == 0){\n name[s] = name.size();\n }\n return name[s];\n}\n\nvoid calCost(int start,int closed[102][2000]){\n priority_queue<State> open;\n rep(i,102) rep(j,2000) closed[i][j] = -1;\n open.push(State(start,LEAVE,0));\n\n while(!open.empty()){\n State st = open.top(); open.pop();\n if(closed[st.id][st.tm] != -1) continue;\n closed[st.id][st.tm] = st.cost;\n\n rep(i,t[st.id].size()){\n E e = t[st.id][i];\n if(st.tm <= e.ft){\n open.push(State(e.to,e.tt,st.cost+e.cost));\n }\n }\n }\n}\n\nvoid calRevCost(int start,int closed[102][2000]){\n priority_queue<State> open;\n rep(i,102) rep(j,2000) closed[i][j] = -1;\n open.push(State(start,BACK,0));\n\n while(!open.empty()){\n State st = open.top(); open.pop();\n if(closed[st.id][st.tm] != -1) continue;\n closed[st.id][st.tm] = st.cost;\n\n rep(i,rt[st.id].size()){\n E e = rt[st.id][i];\n if(st.tm >= e.ft){\n open.push(State(e.to,e.tt,st.cost+e.cost));\n }\n }\n }\n\n REP(i,1,n){\n int minCost = INT_MAX;\n for(int j=1999;j>=0;j--){\n if(closed[i][j] != -1){\n minCost = min(minCost,closed[i][j]);\n }\n closed[i][j] = (minCost == INT_MAX ? -1 : minCost);\n }\n }\n}\n\nint main(){\n LEAVE = TimeToInt(\"08:00\");\n BACK = TimeToInt(\"18:00\");\n\n while(cin>>m,m){\n name.clear();\n rep(i,102){\n t[i].clear();\n rt[i].clear();\n }\n\n rep(i,m){\n string from,to,ft,tt;\n int cost;\n cin>>from>>ft>>to>>tt>>cost;\n\n int fromID = NameToInt(from);\n int toID = NameToInt(to);\n int ft_int = TimeToInt(ft);\n int tt_int = TimeToInt(tt);\n\n t[fromID].push_back(E(toID,ft_int,tt_int,cost));\n rt[toID].push_back(E(fromID,tt_int,ft_int,cost));\n }\n\n n = name.size() + 1;\n A = NameToInt(\"Hakodate\");\n B = NameToInt(\"Tokyo\");\n\n calCost(A,ac);\n calCost(B,bc);\n\n calRevCost(A,r_ac);\n calRevCost(B,r_bc);\n\n int ans = INT_MAX;\n REP(i,1,n){\n REP(atime,LEAVE,BACK+1){\n if(ac[i][atime] == -1) continue;\n REP(btime,LEAVE,BACK+1){\n if(bc[i][btime] == -1) continue;\n int maxTime = max(atime,btime);\n if(r_ac[i][maxTime+30] == -1 || r_bc[i][maxTime+30] == -1) break;\n ans = min(ans,ac[i][atime] + bc[i][btime] + r_ac[i][maxTime+30] + r_bc[i][maxTime+30]);\n }\n }\n }\n cout<<(ans == INT_MAX ? 0 : ans)<<endl;\n\n }\n}","accuracy":1,"time_ms":10,"memory_kb":0,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_1229_289502","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <string>\n#include <cstring>\n#include <map>\n#include <queue>\n\nusing namespace std;\n\nint strToTime(string &s){\n return atoi(s.substr(0,2).c_str())*60 + atoi(s.substr(3,2).c_str());\n}\n\nstruct edge{\n int cost;\n int start;\n int goal;\n int to;\n bool operator<(const edge &e)const{\n return start>e.start;\n }\n};\n\nvector<edge> G[101];\n\nstruct Sit{\n int cTime;\n int cost;\n int node;\n\n bool operator<(const Sit &s)const{\n return cTime>s.cTime;\n }\n};\n\nconst int INF=1000000000;\n\nint backMinCost(int idx,int sTime,int snode);\n\nqueue<Sit> *pprv;\nqueue<Sit> *nnxt;\n\nint main(){\n pprv=new queue<Sit>();\n nnxt=new queue<Sit>();\n queue<Sit> *prv=new queue<Sit>();\n queue<Sit> *nxt=new queue<Sit>();\n\n int n;\n while(cin>>n&&n!=0){\n for(int i = 0; i < 101; i++)G[i].clear();\n map<string,vector<pair<int,int> > > startAndFinTimes;\n map<string,int> stationIdx;\n stationIdx[\"Tokyo\"]=0;\n stationIdx[\"Hakodate\"]=1;\n int idx=2;\n for(int i = 0; i < n; i++){\n string st,ft;\n string s1,s2;\n edge e;\n cin>>s1>>st>>s2>>ft>>e.cost;\n e.start=strToTime(st);\n e.goal=strToTime(ft);\n if(stationIdx.find(s1)==stationIdx.end())\n stationIdx[s1]=idx++;\n if(stationIdx.find(s2)==stationIdx.end())\n stationIdx[s2]=idx++;\n e.to=stationIdx[s2];\n G[stationIdx[s1]].push_back(e);\n }\n for(int i = 0; i < 101; i++)sort(G[i].begin(),G[i].end());\n\n map<int,int> minCosts[2][101];\n for(int i = 0; i < 2; i++){\n Sit ss;\n ss.cost=0;\n ss.cTime=480;\n ss.node=i;\n prv->push(ss);\n minCosts[i][ss.node][ss.cTime]=0;\n while(prv->size()){\n while(prv->size()){\n Sit s=prv->front();prv->pop();\n for(int ii = 0; ii < G[s.node].size(); ii++){\n edge &e=G[s.node][ii];\n // ÔÍÇñÇñ¬³ÈÁÄ¢ÌÅ\n if(e.start<s.cTime)\n break;\n if(e.start>60*18||e.goal>60*18)\n continue;\n Sit ns=s;\n ns.cost+=e.cost;\n ns.cTime=e.goal;\n ns.node=e.to;\n if(minCosts[i][ns.node].find(ns.cTime)!=minCosts[i][ns.node].end()){\n if(minCosts[i][ns.node][ns.cTime]>ns.cost){\n minCosts[i][ns.node][ns.cTime]=ns.cost;\n nxt->push(ns);\n }\n }\n else{\n minCosts[i][ns.node][ns.cTime]=ns.cost;\n nxt->push(ns);\n }\n }\n }\n swap(prv,nxt);\n }\n }\n int minCost=INF;\n for(int i = 0; i < idx; i++){\n for(map<int,int>::iterator it=minCosts[0][i].begin();it!=minCosts[0][i].end();it++){\n for(map<int,int>::iterator iit=minCosts[1][i].begin();iit!=minCosts[1][i].end();iit++){\n int sum=it->second+iit->second;\n int nextStartTime=max(it->first,iit->first)+30;\n int res=backMinCost(0,nextStartTime,i);\n int res2=backMinCost(1,nextStartTime,i);\n if(res!=INF&&res2!=INF){\n sum+=res+res2;\n minCost=min(minCost,sum);\n }\n }\n }\n }\n if(minCost==INF)cout<<0<<endl;\n else cout<<minCost<<endl;\n }\n delete prv;\n delete nxt;\n delete nnxt;\n delete pprv;\n return 0;\n}\n\nint backMinCost(int idx,int sTime,int snode){\n map<int,int> d[101];\n Sit ss;\n ss.cost=0;\n ss.node=snode;\n ss.cTime=sTime;\n pprv->push(ss);\n d[snode][ss.cTime]=ss.cost;\n while(pprv->size()){\n while(pprv->size()){\n Sit s=pprv->front();pprv->pop();\n for(int ii = 0; ii < G[s.node].size(); ii++){\n edge &e=G[s.node][ii];\n // ÔÍÇñÇñ¬³ÈÁÄ¢ÌÅ\n if(e.start<s.cTime)\n break;\n if(e.start>60*18||e.goal>60*18)\n continue;\n Sit ns=s;\n ns.cost+=e.cost;\n ns.cTime=e.goal;\n ns.node=e.to;\n if(d[ns.node].find(ns.cTime)!=d[ns.node].end()){\n if(d[ns.node][ns.cTime]>ns.cost){\n d[ns.node][ns.cTime]=ns.cost;\n nnxt->push(ns);\n }\n }\n else{\n d[ns.node][ns.cTime]=ns.cost;\n nnxt->push(ns);\n }\n }\n }\n swap(pprv,nnxt);\n }\n int res=INF;\n for(map<int,int>::iterator it=d[idx].begin();it!=d[idx].end();it++)\n res=min(res,it->second);\n return res;\n}","accuracy":1,"time_ms":6760,"memory_kb":1064,"score_of_the_acc":-1.0328,"final_rank":11},{"submission_id":"aoj_1229_90969","code_snippet":"#include<iostream>\n#include<queue>\n#include<vector>\n#include<algorithm>\n#include<map>\nusing namespace std;\n#define REP(i,b,n) for(int i=b;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define ALL(C) (C).begin(),(C).end()\n#define pb push_back\n#define mp make_pair\n\nconst int N = 100;\nconst int inf = (1 << 28);\n\nclass Edge{\npublic:\n int sh,sm,dh,dm;\n int d;\n int cost;\n};\n\nclass state{\npublic:\n int now,h,m;\n int cost;\n bool operator<(const state & a)const{\n return cost > a.cost;\n }\n};\n\nbool isless(int h,int m,int nh,int nm){\n if (h < nh)return true;\n else if (h == nh && m <= nm)return true;\n return false;\n}\n\nbool isgreater(int h,int m,int nh,int nm){\n if (h > nh)return true;\n else if (h == nh && m >= nm)return true;\n return false;\n}\n\nvoid dijkstra(int n,int s,vector<Edge>*edge,int cost[24][60][N],\n\t bool isrev){\n rep(i,24)rep(j,60)rep(k,n)cost[i][j][k]=inf;\n priority_queue<state> Q;\n if (isrev)Q.push((state){s,17,59,0});\n else Q.push((state){s,8,0,0});\n\n while(!Q.empty()){\n state now = Q.top();Q.pop();\n if (cost[now.h][now.m][now.now] != inf)continue;\n cost[now.h][now.m][now.now]=now.cost;\n rep(i,edge[now.now].size()){\n if (isrev){\n\tif (isgreater(now.h,now.m,edge[now.now][i].sh,edge[now.now][i].sm))\n\t Q.push((state){edge[now.now][i].d,edge[now.now][i].dh,\n\t\t\t edge[now.now][i].dm,\n\t\t\t now.cost+edge[now.now][i].cost});\n }else {\n\tif (isless(now.h,now.m,edge[now.now][i].sh,edge[now.now][i].sm))\n\t Q.push((state){edge[now.now][i].d,edge[now.now][i].dh,\n\t\t\t edge[now.now][i].dm,\n\t\t\t now.cost+edge[now.now][i].cost});\n }\n }\n }\n\n\n if (isrev){\n rep(k,100){\n int tmp = inf;\n for(int i=17;i>=6;i--){\n\tfor(int j=59;j>=0;j--){\n\t cost[i][j][k]=min(cost[i][j][k],tmp);\n\t tmp=min(cost[i][j][k],tmp);\n\t}\n }\n }\n }else {\n rep(k,100){\n int tmp = inf;\n rep(i,24){\n\trep(j,60){\n\t cost[i][j][k]=min(cost[i][j][k],tmp);\n\t tmp=min(tmp,cost[i][j][k]);\n\t}\n }\n }\n }\n}\n\n//from tokyo,from hakodate, to tokyo,to hakodate\nint ft[24][60][N],fh[24][60][N],tt[24][60][N],th[24][60][N];\nint solve(int n,int hakodate,int tokyo,vector<Edge>*edge,\n\t vector<Edge>*revedge){\n\n\n dijkstra(n,tokyo,edge,ft,false);\n dijkstra(n,hakodate,edge,fh,false);\n dijkstra(n,tokyo,revedge,tt,true);\n dijkstra(n,hakodate,revedge,th,true);\n\n \n int ret = inf;\n rep(k,n){\n int tmp = inf;\n REP(i,8,18){\n rep(j,30){\n\ttmp=min(tmp,ft[i][j][k]+fh[i][j][k]+tt[i][j+30][k]+th[i][j+30][k]);\n }\n REP(j,30,60){\n\ttmp=min(tmp,ft[i][j][k]+fh[i][j][k]+tt[i+1][(j+30)%60][k]+th[i+1][(j+30)%60][k]);\n }\n }\n ret=min(ret,tmp);\n }\n return ret;\n}\n\n\nint getnum(string &a,map<string,int> & M){\n int index=M.size();\n if (M.find(a) == M.end())M[a]=index;\n return M[a];\n}\n\nmain(){\n int n;\n vector<Edge> edge[N];\n vector<Edge> rev[N];\n const string name[2]={\"Hakodate\",\"Tokyo\"};\n while(cin>>n && n){\n rep(i,N)edge[i].clear(),rev[i].clear();\n map<string,int> M;\n\n string from,to;\n int f,t;\n int sh,sm,dh,dm;\n int cost;\n char dummy;\n rep(i,n){\n cin>>from>>sh>>dummy>>sm;\n cin>>to>>dh>>dummy>>dm;\n cin>>cost;\n f=getnum(from,M);\n t=getnum(to,M);\n edge[f].pb((Edge){sh,sm,dh,dm,t,cost});\n rev[t].pb((Edge){dh,dm,sh,sm,f,cost});\n }\n\n \n int ans = solve(M.size(),M[name[0]],M[name[1]],edge,rev);\n if (ans == inf)cout <<0<<endl;\n else cout << ans << endl;\n\n }\n}","accuracy":1,"time_ms":20,"memory_kb":3392,"score_of_the_acc":-0.1059,"final_rank":3}],"string":"[\n {\n \"submission_id\": \"aoj_1229_2940627\",\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 NUM 100\\n#define BASE 480\\n#define MAX 600\\n\\nenum Type{\\n\\tA,\\n\\tB,\\n};\\n\\nstruct Edge{\\n\\tEdge(int arg_to,int arg_cost,int arg_start_time,int arg_arrive_time){\\n\\t\\tto = arg_to;\\n\\t\\tcost = arg_cost;\\n\\t\\tstart_time = arg_start_time;\\n\\t\\tarrive_time = arg_arrive_time;\\n\\t}\\n\\tbool operator<(const struct Edge &arg) const{ //出発時刻の昇順\\n\\t\\treturn start_time < arg.start_time;\\n\\t}\\n\\tint to,cost,start_time,arrive_time;\\n};\\n\\nstruct Info{\\n\\tInfo(int arg_node_id,int arg_sum_cost,int arg_current_time){\\n\\t\\tnode_id = arg_node_id;\\n\\t\\tsum_cost = arg_sum_cost;\\n\\t\\tcurrent_time = arg_current_time;\\n\\t}\\n\\tbool operator<(const struct Info &arg) const{ //総コストの昇順(PQ)\\n\\t\\treturn sum_cost > arg.sum_cost;\\n\\t}\\n\\tint node_id,sum_cost,current_time;\\n};\\n\\nstruct Data{\\n\\tData(int arg_rev_start_time,int arg_sum_cost){\\n\\t\\trev_start_time = arg_rev_start_time;\\n\\t\\tsum_cost = arg_sum_cost;\\n\\t}\\n\\tbool operator<(const struct Data &arg) const{ //帰宅開始時刻の昇順\\n\\t\\treturn rev_start_time < arg.rev_start_time;\\n\\t}\\n\\tint rev_start_time,sum_cost;\\n};\\n\\nint N;\\nint node_index;\\nint min_cost[2][NUM][601],return_min_cost[NUM][601];\\nint A_id,B_id;\\nvector<int> work[2][NUM];\\nvector<Data> return_start[NUM];\\nconst string start_A = \\\"Hakodate\\\";\\nconst string start_B = \\\"Tokyo\\\";\\n\\nmap<string,int> MAP;\\nmap<int,int> CALC;\\nvector<Edge> G[NUM];\\n\\n//時刻を分に直す\\nint getNUM(char work[6]){\\n\\n\\tint hour = 10*(work[0]-'0')+(work[1]-'0');\\n\\tint minute = 10*(work[3]-'0')+(work[4]-'0');\\n\\n\\treturn 60*hour+minute;\\n}\\n\\n//8時～18時の時間帯か\\nbool rangeCheck(int tmp_time){\\n\\tif(tmp_time >= BASE && tmp_time <= BASE+MAX)return true;\\n\\telse{\\n\\t\\treturn false;\\n\\t}\\n}\\n\\nvoid dijkstra(Type type,int start_id){\\n\\n\\tfor(int i = 0; i < node_index; i++){\\n\\t\\tfor(int k = 0; k <= MAX; k++){\\n\\t\\t\\tmin_cost[type][i][k] = BIG_NUM;\\n\\t\\t}\\n\\t}\\n\\n\\tmin_cost[type][start_id][0] = 0; //8時に出発\\n\\n\\tpriority_queue<Info> Q;\\n\\tQ.push(Info(start_id,0,BASE));\\n\\n\\tint next_node,next_cost,next_time;\\n\\n\\twhile(!Q.empty()){\\n\\n\\t\\tif(Q.top().sum_cost > min_cost[type][Q.top().node_id][Q.top().current_time-BASE]){\\n\\t\\t\\tQ.pop();\\n\\t\\t}else{\\n\\n\\t\\t\\tfor(int i = 0; i < G[Q.top().node_id].size(); i++){\\n\\t\\t\\t\\t//既に出発している、または有効時間外ならSKIP\\n\\t\\t\\t\\tif(Q.top().current_time > G[Q.top().node_id][i].start_time)continue;\\n\\t\\t\\t\\tif(rangeCheck(G[Q.top().node_id][i].start_time) == false || rangeCheck(G[Q.top().node_id][i].arrive_time) == false)continue;\\n\\n\\t\\t\\t\\tnext_node = G[Q.top().node_id][i].to;\\n\\t\\t\\t\\tnext_cost = Q.top().sum_cost+G[Q.top().node_id][i].cost;\\n\\t\\t\\t\\tnext_time = G[Q.top().node_id][i].arrive_time;\\n\\n\\t\\t\\t\\tif(min_cost[type][next_node][next_time-BASE] > next_cost){\\n\\n\\t\\t\\t\\t\\tmin_cost[type][next_node][next_time-BASE] = next_cost;\\n\\t\\t\\t\\t\\tQ.push(Info(next_node,next_cost,next_time));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tQ.pop();\\n\\t\\t}\\n\\t}\\n}\\n\\nint rev_dijkstra(int start_id){\\n\\n\\tint ret = BIG_NUM;\\n\\tint next_node,next_cost,next_time;\\n\\tint A_min,B_min;\\n\\tpriority_queue<Info> Q;\\n\\n\\tfor(int p = 0; p < return_start[start_id].size(); p++){ //start時刻を全探索\\n\\n\\t\\tint start_time = return_start[start_id][p].rev_start_time;\\n\\t\\tint start_cost = return_start[start_id][p].sum_cost;\\n\\n\\t\\tfor(int a = 0; a < node_index; a++){\\n\\t\\t\\tfor(int k = start_time-BASE; k <= MAX; k++)return_min_cost[a][k] = BIG_NUM;\\n\\t\\t}\\n\\n\\t\\treturn_min_cost[start_id][start_time-BASE] = 0; //★帰宅のコスト\\n\\t\\tQ.push(Info(start_id,0,start_time));\\n\\n\\t\\tA_min = BIG_NUM;\\n\\t\\tB_min = BIG_NUM;\\n\\n\\t\\twhile(!Q.empty()){\\n\\n\\t\\t\\tif(Q.top().sum_cost > return_min_cost[Q.top().node_id][Q.top().current_time-BASE]){\\n\\t\\t\\t\\tQ.pop();\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tfor(int i = 0; i < G[Q.top().node_id].size(); i++){\\n\\t\\t\\t\\t\\t//既に出発している、または有効時間外ならSKIP\\n\\t\\t\\t\\t\\tif(Q.top().current_time > G[Q.top().node_id][i].start_time)continue;\\n\\t\\t\\t\\t\\tif(rangeCheck(G[Q.top().node_id][i].start_time) == false || rangeCheck(G[Q.top().node_id][i].arrive_time) == false)continue;\\n\\n\\t\\t\\t\\t\\tnext_node = G[Q.top().node_id][i].to;\\n\\t\\t\\t\\t\\tnext_cost = Q.top().sum_cost+G[Q.top().node_id][i].cost;\\n\\t\\t\\t\\t\\tnext_time = G[Q.top().node_id][i].arrive_time;\\n\\n\\t\\t\\t\\t\\tif(return_min_cost[next_node][next_time-BASE] > next_cost){\\n\\t\\t\\t\\t\\t\\treturn_min_cost[next_node][next_time-BASE] = next_cost;\\n\\n\\t\\t\\t\\t\\t\\tQ.push(Info(next_node,next_cost,next_time));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tQ.pop();\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tfor(int time = start_time-BASE; time <= MAX; time++){\\n\\t\\t\\tif(return_min_cost[A_id][time] != BIG_NUM){\\n\\t\\t\\t\\tA_min = min(A_min,return_min_cost[A_id][time]);\\n\\t\\t\\t}\\n\\t\\t\\tif(return_min_cost[B_id][time] != BIG_NUM){\\n\\t\\t\\t\\tB_min = min(B_min,return_min_cost[B_id][time]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(A_min == BIG_NUM || B_min == BIG_NUM)continue;\\n\\n\\t\\tret = min(ret,start_cost+A_min+B_min);\\n\\t}\\n\\treturn ret;\\n}\\n\\nvoid func(){\\n\\n\\tMAP.clear();\\n\\tfor(int i = 0; i < NUM; i++)G[i].clear();\\n\\n\\tnode_index = 0;\\n\\n\\tstring start,arrival;\\n\\tchar start_buf[6],arrive_buf[6];\\n\\tint start_time,arrive_time;\\n\\tint price,start_id,arrive_id;\\n\\n\\tfor(int loop = 0; loop < N; loop++){\\n\\t\\tcin >> start >> start_buf >> arrival >> arrive_buf >> price;\\n\\n\\t\\tauto at = MAP.find(start);\\n\\n\\t\\tif(at == MAP.end()){\\n\\t\\t\\tMAP[start] = node_index;\\n\\t\\t\\tstart_id = node_index;\\n\\t\\t\\tnode_index++;\\n\\n\\t\\t}else{\\n\\t\\t\\tstart_id = MAP[start];\\n\\t\\t}\\n\\n\\t\\tat = MAP.find(arrival);\\n\\n\\t\\tif(at == MAP.end()){\\n\\t\\t\\tMAP[arrival] = node_index;\\n\\t\\t\\tarrive_id = node_index;\\n\\t\\t\\tnode_index++;\\n\\n\\t\\t}else{\\n\\t\\t\\tarrive_id = MAP[arrival];\\n\\t\\t}\\n\\n\\t\\tstart_time = getNUM(start_buf);\\n\\t\\tarrive_time = getNUM(arrive_buf);\\n\\n\\t\\tif(rangeCheck(start_time) == false || rangeCheck(arrive_time) == false)continue;\\n\\n\\t\\tG[start_id].push_back(Edge(arrive_id,price,start_time,arrive_time));\\n\\t}\\n\\n\\tA_id = MAP[start_A];\\n\\tB_id = MAP[start_B];\\n\\n\\t//函館、東京から、各都市への到着可能時刻と、同時刻での最小コストを求める\\n\\tdijkstra(A,A_id);\\n\\tdijkstra(B,B_id);\\n\\n\\tfor(int town = 0; town < node_index; town++){\\n\\n\\t\\twork[A][town].clear();\\n\\t\\twork[B][town].clear();\\n\\n\\t\\treturn_start[town].clear();\\n\\t}\\n\\n\\tint rev_start_time,tmp_cost;\\n\\n\\t//各町から、函館or北海道への、帰宅開始可能時刻をworkにpushする\\n\\tfor(int town = 0; town < node_index; town++){\\n\\t\\tfor(int time = 0; time <= MAX; time++){\\n\\n\\t\\t\\tif(min_cost[A][town][time] != BIG_NUM){\\n\\t\\t\\t\\twork[A][town].push_back(time+BASE);\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(min_cost[B][town][time] != BIG_NUM){\\n\\t\\t\\t\\twork[B][town].push_back(time+BASE);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t//★最低30分会うので、帰宅開始可能時刻と、そのコストを求める★\\n\\t\\tif(work[A][town].size() == 0 || work[B][town].size() == 0)continue;\\n\\n\\t\\tCALC.clear();\\n\\n\\t\\tfor(int time = 1; time <= MAX; time++){\\n\\t\\t\\tmin_cost[A][town][time] = min(min_cost[A][town][time],min_cost[A][town][time-1]);\\n\\t\\t\\tmin_cost[B][town][time] = min(min_cost[B][town][time],min_cost[B][town][time-1]);\\n\\t\\t}\\n\\n\\t\\tfor(int i = 0; i < work[A][town].size(); i++){\\n\\t\\t\\tfor(int k = 0; k < work[B][town].size(); k++){\\n\\t\\t\\t\\trev_start_time = max(work[A][town][i],work[B][town][k])+30;\\n\\t\\t\\t\\tif(!rangeCheck(rev_start_time))continue;\\n\\n\\t\\t\\t\\tauto at2 = CALC.find(rev_start_time);\\n\\t\\t\\t\\ttmp_cost = min_cost[A][town][work[A][town][i]-BASE]+min_cost[B][town][work[B][town][k]-BASE];\\n\\n\\t\\t\\t\\tif(at2 == CALC.end() || tmp_cost < CALC[rev_start_time]){\\n\\t\\t\\t\\t\\tCALC[rev_start_time] = tmp_cost;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tfor(auto at3: CALC){\\n\\t\\t\\treturn_start[town].push_back(Data(at3.first,at3.second));\\n\\t\\t}\\n\\t\\tsort(return_start[town].begin(),return_start[town].end());\\n\\t}\\n\\n\\t//各町から、出発時刻別の、函館または東京への帰宅最短コストを求める\\n\\tint ans = BIG_NUM;\\n\\tint ret;\\n\\n\\tfor(int start_town = 0; start_town < node_index; start_town++){\\n\\t\\tif(return_start[start_town].size() == 0)continue; //そもそも会えない街ならSKIP\\n\\n\\t\\tret = rev_dijkstra(start_town);\\n\\t\\tif(ret == BIG_NUM)continue; //函館または東京に戻れないならSKIP\\n\\n\\t\\tans = min(ans,ret);\\n\\t}\\n\\n\\tif(ans == BIG_NUM){\\n\\t\\tprintf(\\\"0\\\\n\\\");\\n\\t}else{\\n\\t\\tprintf(\\\"%d\\\\n\\\",ans);\\n\\t}\\n}\\n\\nint main(){\\n\\n\\twhile(true){\\n\\t\\tscanf(\\\"%d\\\",&N);\\n\\t\\tif(N == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3592,\n \"score_of_the_acc\": -0.1136,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1229_1526289\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n\\nusing namespace std;\\n\\nstruct Info {\\n int fromStationID,toStationID;\\n int fromTimeID,toTimeID;\\n int cost;\\n};\\n\\nconst int IINF = INT_MAX;\\nconst int MAX_STATION = 100;\\nconst int MAX_EVENT = 4000;\\nint toDest[2][MAX_STATION][MAX_EVENT+10]; // toDest[0][][] <- hakodate, toDest[1][][] <- tokyo, toDest[][stationID][timeID] := ????????????stationID???timeID??????????????§?????°?????????????°?\\nint fromDest[2][MAX_STATION][MAX_EVENT+10]; // fromDest[0][][] <- hakodate, fromDest[1][][] <- tokyo, fromDest[][stationID][timeID] := ???????????§???stationID??????timeID??????????????????????????°????????????????????????????????????????°????\\n\\nint stationIDIndex;\\nmap<string,int> stationIDTable;\\nvector<int> T;\\n\\nvoid init(){\\n stationIDIndex = 0;\\n stationIDTable.clear();\\n T.clear();\\n}\\n\\ninline int convertStringIntoTime(string s){\\n return ( ( s[0] - '0' ) * 10 + ( s[1] - '0' ) ) * 60 + ( ( s[3] - '0' ) * 10 + ( s[4] - '0' ) ) ;\\n}\\n\\ninline int calcTimeID(int _time) {\\n return lower_bound(T.begin(),T.end(),_time) - T.begin();\\n}\\n\\nInfo convertStringIntoInfo(string context){\\n vector<string> buf;\\n stringstream ss;\\n ss << context;\\n while( ss >> context ){\\n buf.push_back(context);\\n }\\n assert( buf.size() == 5 );\\n int fromStationID = ( stationIDTable.count(buf[0]) ? stationIDTable[buf[0]] : ( stationIDTable[buf[0]] = stationIDIndex++ ) );\\n int toStationID = ( stationIDTable.count(buf[2]) ? stationIDTable[buf[2]] : ( stationIDTable[buf[2]] = stationIDIndex++ ) );\\n int fromTime = convertStringIntoTime(buf[1]);\\n int toTime = convertStringIntoTime(buf[3]);\\n if( fromTime < convertStringIntoTime(\\\"08:00\\\") || toTime > convertStringIntoTime(\\\"18:00\\\") ) {\\n return (Info){-1,-1,-1,-1,-1};\\n }\\n T.push_back(fromTime);\\n T.push_back(toTime);\\n return (Info){fromStationID,toStationID,fromTime,toTime,(atoi)(buf[4].c_str())};\\n}\\n\\nbool cmp_to(const Info &a,const Info &b) {\\n if( a.toTimeID != b.toTimeID) a.toTimeID < b.toTimeID;\\n return a.fromTimeID < b.fromTimeID;\\n}\\n\\nbool cmp_from(const Info &a,const Info &b) {\\n if( a.fromTimeID != b.fromTimeID ) a.fromTimeID > b.fromTimeID;\\n return a.toTimeID > b.toTimeID;\\n}\\n\\nvoid makeToDest(vector<Info> &vec,int hakodateID,int tokyoID,int startTimeID,int endTimeID) {\\n assert( startTimeID == 0 );\\n rep(i,2) rep(j,stationIDIndex) rep(k,endTimeID+1) toDest[i][j][k] = IINF;\\n toDest[0][hakodateID][startTimeID] = toDest[1][tokyoID][startTimeID] = 0;\\n sort(vec.begin(),vec.end(),cmp_to);\\n int cur = 0;\\n\\n REP(timeID,startTimeID,endTimeID+1){\\n if( timeID-1 >= startTimeID ) {\\n rep(stationID,stationIDIndex){\\n\\trep(j,2){\\n\\t toDest[j][stationID][timeID] = min(toDest[j][stationID][timeID],\\n\\t\\t\\t\\t\\t toDest[j][stationID][timeID-1]);\\n\\t}\\n }\\n }\\n while( cur < (int)vec.size() && vec[cur].fromTimeID == timeID ){\\n rep(j,2){\\n\\tif( toDest[j][vec[cur].fromStationID][timeID] == IINF ) continue;\\n\\ttoDest[j][vec[cur].toStationID][vec[cur].toTimeID] = min(toDest[j][vec[cur].toStationID][vec[cur].toTimeID],\\n\\t\\t\\t\\t\\t\\t\\t\\t toDest[j][vec[cur].fromStationID][timeID]+vec[cur].cost);\\n }\\n ++cur;\\n }\\n }\\n}\\n\\nvoid makeFromDest(vector<Info> &vec,int hakodateID,int tokyoID,int startTimeID,int endTimeID) {\\n rep(i,2) rep(j,stationIDIndex) rep(k,endTimeID+1) fromDest[i][j][k] = IINF;\\n fromDest[0][hakodateID][endTimeID] = fromDest[1][tokyoID][endTimeID] = 0;\\n sort(vec.begin(),vec.end(),cmp_from);\\n int cur = 0;\\n for(int timeID=endTimeID;timeID>=startTimeID;timeID--){\\n if( timeID+1 <= endTimeID ) {\\n rep(stationID,stationIDIndex){\\n\\trep(j,2){\\n\\t fromDest[j][stationID][timeID] = min(fromDest[j][stationID][timeID],\\n\\t\\t\\t\\t\\t fromDest[j][stationID][timeID+1]);\\n\\t}\\n }\\n }\\n while( cur < (int)vec.size() && vec[cur].toTimeID == timeID ) {\\n rep(j,2){\\n\\tif( fromDest[j][vec[cur].toStationID][timeID] == IINF ) continue;\\n\\tfromDest[j][vec[cur].fromStationID][vec[cur].fromTimeID] = min(fromDest[j][vec[cur].fromStationID][vec[cur].fromTimeID],\\n\\t\\t\\t\\t\\t\\t\\t\\t fromDest[j][vec[cur].toStationID][timeID]+vec[cur].cost);\\n }\\n ++cur;\\n }\\n }\\n}\\n\\nvoid compute(vector<Info> &vec){\\n\\n if( !stationIDTable.count(\\\"Hakodate\\\") || !stationIDTable.count(\\\"Tokyo\\\") ) {\\n puts(\\\"0\\\");\\n return;\\n }\\n\\n int hakodateID = stationIDTable[\\\"Hakodate\\\"];\\n int tokyoID = stationIDTable[\\\"Tokyo\\\"];\\n int startTimeID = calcTimeID(convertStringIntoTime(\\\"08:00\\\")); \\n int endTimeID = calcTimeID(convertStringIntoTime(\\\"18:00\\\")); \\n makeToDest(vec,hakodateID,tokyoID,startTimeID,endTimeID);\\n makeFromDest(vec,hakodateID,tokyoID,startTimeID,endTimeID);\\n\\n int mini = IINF;\\n rep(rendezvous,stationIDIndex){\\n REP(timeID,startTimeID,endTimeID+1){\\n if( toDest[0][rendezvous][timeID] == IINF || toDest[1][rendezvous][timeID] == IINF ) continue;\\n int leaveTimeID = lower_bound(T.begin(),T.end(),T[timeID]+30) - T.begin();\\n if( leaveTimeID >= (int)T.size() ) continue;\\n if( fromDest[0][rendezvous][leaveTimeID] == IINF || fromDest[1][rendezvous][leaveTimeID] == IINF ) continue;\\n mini = min(mini,\\n\\t\\t toDest[0][rendezvous][timeID]+toDest[1][rendezvous][timeID]+\\n\\t\\t fromDest[0][rendezvous][leaveTimeID]+fromDest[1][rendezvous][leaveTimeID]);\\n }\\n } \\n if( mini == IINF ) puts(\\\"0\\\");\\n else cout << mini << endl;\\n}\\n\\nint main(){\\n int n;\\n while( cin >> n, n ) {\\n init();\\n cin.ignore();\\n vector<Info> vec;\\n rep(i,n){\\n string s;\\n getline(cin,s);\\n Info info = convertStringIntoInfo(s);\\n if( info.fromStationID == -1 ) continue;\\n vec.push_back(info);\\n }\\n T.push_back(convertStringIntoTime(\\\"08:00\\\"));\\n T.push_back(convertStringIntoTime(\\\"18:00\\\"));\\n sort(T.begin(),T.end());\\n T.erase(unique(T.begin(),T.end()),T.end());\\n rep(i,(int)vec.size()) {\\n vec[i].fromTimeID = calcTimeID(vec[i].fromTimeID);\\n vec[i].toTimeID = calcTimeID(vec[i].toTimeID);\\n }\\n compute(vec);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5740,\n \"score_of_the_acc\": -0.1767,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1229_1131515\",\n \"code_snippet\": \"#include<string>\\n#include<stdio.h>\\n#include<algorithm>\\n#include<queue>\\n#include<vector>\\n#include<map>\\nusing namespace std;\\nchar in[20];\\nvector<pair<pair<int,int>,int> >g[110][1440];\\nvector<pair<pair<int,int>,int> >g2[110][1440];\\nint ijk[110][1440];\\nint v[110][1440];\\nint s[4][110][1440];\\nint main(){\\n\\tint a;\\n\\twhile(scanf(\\\"%d\\\",&a),a){\\n\\t\\tfor(int i=0;i<110;i++)for(int j=0;j<1440;j++){\\n\\t\\t\\tg[i][j].clear();\\n\\t\\t\\tg2[i][j].clear();\\n\\t\\t}\\n\\t\\tmap<string,int>m;\\n\\t\\tm[\\\"Hakodate\\\"]=0;\\n\\t\\tm[\\\"Tokyo\\\"]=1;\\n\\t\\tint n=2;\\n\\t\\tfor(int i=0;i<a;i++){\\n\\t\\t\\tscanf(\\\"%s\\\",in);\\n\\t\\t\\tstring na=in;\\n\\t\\t\\tif(!m.count(na))m[na]=n++;\\n\\t\\t\\tint p=m[na];\\n\\t\\t\\tint H,M;\\n\\t\\t\\tscanf(\\\"%d:%d\\\",&H,&M);\\n\\t\\t\\tint t1=H*60+M;\\n\\t\\t\\tscanf(\\\"%s\\\",in);\\n\\t\\t\\tstring nb=in;\\n\\t\\t\\tif(!m.count(nb))m[nb]=n++;\\n\\t\\t\\tint q=m[nb];\\n\\t\\t\\tscanf(\\\"%d:%d\\\",&H,&M);\\n\\t\\t\\tint t2=H*60+M;\\n\\t\\t\\tint r;\\n\\t\\t\\tscanf(\\\"%d\\\",&r);\\n\\t\\t\\tg[p][t1].push_back(make_pair(make_pair(q,t2),r));\\n\\t\\t\\tg2[q][t2].push_back(make_pair(make_pair(p,t1),r));\\n\\t\\t}\\n\\t\\tfor(int i=0;i<110;i++)for(int j=0;j<1440;j++){\\n\\t\\t\\tv[i][j]=0;ijk[i][j]=99999999;\\n\\t\\t}\\n\\t\\tpriority_queue<pair<int,pair<int,int> > > Q;\\n\\t\\tQ.push(make_pair(0,make_pair(0,480)));\\n\\t\\tijk[0][480]=0;\\n\\t\\twhile(Q.size()){\\n\\t\\t\\tint cost=-Q.top().first;\\n\\t\\t\\tint at=Q.top().second.first;\\n\\t\\t\\tint t=Q.top().second.second;\\n\\t\\t\\tQ.pop();\\n\\t\\t\\tif(v[at][t])continue;\\n\\t\\t\\tv[at][t]=1;\\n\\t\\t\\tif(t<1080&&!v[at][t+1]&&ijk[at][t+1]>cost){\\n\\t\\t\\t\\tijk[at][t+1]=cost;\\n\\t\\t\\t\\tQ.push(make_pair(-cost,make_pair(at,t+1)));\\n\\t\\t\\t}\\n\\t\\t\\tfor(int i=0;i<g[at][t].size();i++){\\n\\t\\t\\t\\tint x=g[at][t][i].first.first;\\n\\t\\t\\t\\tint y=g[at][t][i].first.second;\\n\\t\\t\\t\\tint z=g[at][t][i].second;\\n\\t\\t\\t\\tif(!v[x][y]&&ijk[x][y]>cost+z){\\n\\t\\t\\t\\t\\tijk[x][y]=cost+z;\\n\\t\\t\\t\\t\\tQ.push(make_pair(-cost-z,make_pair(x,y)));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor(int i=0;i<n;i++)for(int j=0;j<1440;j++)\\n\\t\\t\\ts[0][i][j]=ijk[i][j];\\n\\t\\tfor(int i=0;i<110;i++)for(int j=0;j<1440;j++){\\n\\t\\t\\tv[i][j]=0;ijk[i][j]=99999999;\\n\\t\\t}\\n\\t\\tQ.push(make_pair(0,make_pair(1,480)));\\n\\t\\tijk[1][480]=0;\\n\\t\\twhile(Q.size()){\\n\\t\\t\\tint cost=-Q.top().first;\\n\\t\\t\\tint at=Q.top().second.first;\\n\\t\\t\\tint t=Q.top().second.second;\\n\\t\\t\\tQ.pop();\\n\\t\\t\\tif(v[at][t])continue;\\n\\t\\t\\tv[at][t]=1;\\n\\t\\t\\tif(t<1080&&!v[at][t+1]&&ijk[at][t+1]>cost){\\n\\t\\t\\t\\tijk[at][t+1]=cost;\\n\\t\\t\\t\\tQ.push(make_pair(-cost,make_pair(at,t+1)));\\n\\t\\t\\t}\\n\\t\\t\\tfor(int i=0;i<g[at][t].size();i++){\\n\\t\\t\\t\\tint x=g[at][t][i].first.first;\\n\\t\\t\\t\\tint y=g[at][t][i].first.second;\\n\\t\\t\\t\\tint z=g[at][t][i].second;\\n\\t\\t\\t\\tif(!v[x][y]&&ijk[x][y]>cost+z){\\n\\t\\t\\t\\t\\tijk[x][y]=cost+z;\\n\\t\\t\\t\\t\\tQ.push(make_pair(-cost-z,make_pair(x,y)));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor(int i=0;i<n;i++)for(int j=0;j<1440;j++)\\n\\t\\t\\ts[1][i][j]=ijk[i][j];\\n\\t\\tfor(int i=0;i<110;i++)for(int j=0;j<1440;j++){\\n\\t\\t\\tv[i][j]=0;ijk[i][j]=99999999;\\n\\t\\t}\\n\\t\\tQ.push(make_pair(0,make_pair(0,1080)));\\n\\t\\tijk[0][1080]=0;\\n\\t\\twhile(Q.size()){\\n\\t\\t\\tint cost=-Q.top().first;\\n\\t\\t\\tint at=Q.top().second.first;\\n\\t\\t\\tint t=Q.top().second.second;\\n\\t\\t\\tQ.pop();\\n\\t\\t\\tif(v[at][t])continue;\\n\\t\\t\\tv[at][t]=1;\\n\\t\\t\\tif(t>480&&!v[at][t-1]&&ijk[at][t-1]>cost){\\n\\t\\t\\t\\tijk[at][t-1]=cost;\\n\\t\\t\\t\\tQ.push(make_pair(-cost,make_pair(at,t-1)));\\n\\t\\t\\t}\\n\\t\\t\\tfor(int i=0;i<g2[at][t].size();i++){\\n\\t\\t\\t\\tint x=g2[at][t][i].first.first;\\n\\t\\t\\t\\tint y=g2[at][t][i].first.second;\\n\\t\\t\\t\\tint z=g2[at][t][i].second;\\n\\t\\t\\t\\tif(!v[x][y]&&ijk[x][y]>cost+z){\\n\\t\\t\\t\\t\\tijk[x][y]=cost+z;\\n\\t\\t\\t\\t\\tQ.push(make_pair(-cost-z,make_pair(x,y)));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor(int i=0;i<n;i++)for(int j=0;j<1440;j++)\\n\\t\\t\\ts[2][i][j]=ijk[i][j];\\n\\t\\tfor(int i=0;i<110;i++)for(int j=0;j<1440;j++){\\n\\t\\t\\tv[i][j]=0;ijk[i][j]=99999999;\\n\\t\\t}\\n\\t\\tQ.push(make_pair(0,make_pair(1,1080)));\\n\\t\\tijk[1][1080]=0;\\n\\t\\twhile(Q.size()){\\n\\t\\t\\tint cost=-Q.top().first;\\n\\t\\t\\tint at=Q.top().second.first;\\n\\t\\t\\tint t=Q.top().second.second;\\n\\t\\t\\tQ.pop();\\n\\t\\t\\tif(v[at][t])continue;\\n\\t\\t\\tv[at][t]=1;\\n\\t\\t\\tif(t>480&&!v[at][t-1]&&ijk[at][t-1]>cost){\\n\\t\\t\\t\\tijk[at][t-1]=cost;\\n\\t\\t\\t\\tQ.push(make_pair(-cost,make_pair(at,t-1)));\\n\\t\\t\\t}\\n\\t\\t\\tfor(int i=0;i<g2[at][t].size();i++){\\n\\t\\t\\t\\tint x=g2[at][t][i].first.first;\\n\\t\\t\\t\\tint y=g2[at][t][i].first.second;\\n\\t\\t\\t\\tint z=g2[at][t][i].second;\\n\\t\\t\\t\\tif(!v[x][y]&&ijk[x][y]>cost+z){\\n\\t\\t\\t\\t\\tijk[x][y]=cost+z;\\n\\t\\t\\t\\t\\tQ.push(make_pair(-cost-z,make_pair(x,y)));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor(int i=0;i<n;i++)for(int j=0;j<1440;j++)\\n\\t\\t\\ts[3][i][j]=ijk[i][j];\\n\\t\\tint ret=999999999;\\n\\t\\tfor(int i=0;i<n;i++){\\n\\t\\t\\tfor(int j=480;j<=1410;j++){\\n\\t\\t\\t\\tret=min(ret,s[0][i][j]+s[1][i][j]+s[2][i][j+30]+s[3][i][j+30]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(ret>99999999)printf(\\\"0\\\\n\\\");\\n\\t\\telse printf(\\\"%d\\\\n\\\",ret);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 10864,\n \"score_of_the_acc\": -0.3345,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1229_960812\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <string>\\n#include <sstream>\\n#include <cstring>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cmath>\\n#include <queue>\\n#include <stack>\\n#include <map>\\n#include <set>\\n#include <numeric>\\n#include <cctype>\\n#include <tuple>\\n#include <iterator>\\n#include <bitset>\\n#include <random>\\n#include <assert.h>\\n#include <unordered_map>\\n\\n#ifdef _MSC_VER\\n#include <agents.h>\\n#endif\\n\\n#define FOR(i, a, b) for(int i = (a); i < (int)(b); ++i)\\n#define rep(i, n) FOR(i, 0, n)\\n#define ALL(v) v.begin(), v.end()\\n#define REV(v) v.rbegin(), v.rend()\\n#define MEMSET(v, s) memset(v, s, sizeof(v))\\n#define X first\\n#define Y second\\n#define MP make_pair\\n#define umap unordered_map\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef long double ld;\\ntypedef pair<int, int> P;\\n\\nconst int N = 110;\\nconst int T = 610;\\n\\nint cost[4][N*T];\\n\\ninline int f(int n, int t){\\n\\treturn n*T + t;\\n}\\n\\nvector<P> G[N*T], rev[N*T];\\nvector<int> v[N];\\n\\nvoid dijk(int start, int t, int *opt, vector<P> *graph){\\n\\topt[f(start, t)] = 0;\\n\\tpriority_queue<P, vector<P>, greater<P>> q;\\n\\tq.push(MP(0, f(start, t)));\\n\\n\\twhile (!q.empty()){\\n\\t\\tint d = q.top().first;\\n\\t\\tint pos = q.top().second;\\n\\n\\t\\tq.pop();\\n\\n\\t\\tif (opt[pos] < d) continue;\\n\\n\\t\\tfor (auto &e : graph[pos]){\\n\\t\\t\\tif (opt[e.first] <= d + e.second)continue;\\n\\t\\t\\topt[e.first] = d + e.second;\\n\\t\\t\\tq.push(MP(d + e.second, e.first));\\n\\t\\t}\\n\\t}\\n}\\n\\nvoid pp(int i, int pos, int t){\\n\\tcout << (i % 2 ? \\\"to\\\" : \\\"from\\\") << \\\" \\\" << (i / 2 ? \\\"Hakodate\\\" : \\\"Tokyo\\\") << endl;\\n\\tcout << cost[i][f(pos, t)] << endl;\\n}\\n\\nint main(){\\n\\tint n;\\n\\twhile (cin >> n, n){\\n\\t\\trep(i, N*T) G[i].clear();\\n\\t\\trep(i, N*T) rev[i].clear();\\n\\t\\trep(i, N) v[i].clear(), v[i].push_back(0), v[i].push_back(600);\\n\\n\\t\\tmap<string, int> m;\\n\\t\\tint idx = 0;\\n\\t\\tm[\\\"Tokyo\\\"] = idx++;\\n\\t\\tm[\\\"Hakodate\\\"] = idx++;\\n\\t\\trep(i, n){\\n\\t\\t\\tstring s, t;\\n\\t\\t\\tint h1, m1, h2, m2, cost;\\n\\t\\t\\tchar c;\\n\\t\\t\\tcin >> s >> h1 >> c >> m1 >> t >> h2 >> c >> m2 >> cost;\\n\\t\\t\\tint t1 = h1 * 60 + m1 - 480, t2 = h2 * 60 + m2 - 480;\\n\\t\\t\\tif (0 <= t1 && t1 <= 600 && 0 <= t2 && t2 <= 600){\\n\\t\\t\\t\\tif (!m.count(s)) m[s] = idx++;\\n\\t\\t\\t\\tif (!m.count(t)) m[t] = idx++;\\n\\t\\t\\t\\tint from = f(m[s], t1), to = f(m[t], t2);\\n\\t\\t\\t\\tG[from].push_back(MP(to, cost));\\n\\t\\t\\t\\trev[to].push_back(MP(from, cost));\\n\\t\\t\\t\\tv[m[s]].push_back(t1);\\n\\t\\t\\t\\tv[m[t]].push_back(t2);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\trep(i, idx){\\n\\t\\t\\tsort(ALL(v[i]));\\n\\t\\t\\tv[i].erase(unique(ALL(v[i])), v[i].end());\\n\\t\\t\\trep(j, v[i].size()){\\n\\t\\t\\t\\tif (j + 1 < v[i].size()) G[f(i, v[i][j])].push_back(MP(f(i, v[i][j + 1]), 0));\\n\\t\\t\\t\\tif (j - 1 >= 0) rev[f(i, v[i][j])].push_back(MP(f(i, v[i][j - 1]), 0));\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\trep(i, 4){\\n\\t\\t\\tMEMSET(cost[i], 0x7f);\\n\\t\\t\\t// Tokyo -> x, x -> Tokyo, Hakodate -> x, x -> Hakodate\\n\\t\\t\\tdijk(i / 2, i % 2 ? 600 : 0, cost[i], i % 2 ? rev : G);\\n\\t\\t}\\n\\n\\t\\trep(k, 2) rep(i, idx){\\n\\t\\t\\tfor (int j = 0+1; j <= 600; ++j){\\n\\t\\t\\t\\tcost[k * 2][f(i, j)] = min(cost[k * 2][f(i, j)], cost[k * 2][f(i, j - 1)]);\\n\\t\\t\\t}\\n\\t\\t\\tfor (int j = 600-1; j >= 0; --j){\\n\\t\\t\\t\\tcost[k * 2 + 1][f(i, j)] = min(cost[k * 2 + 1][f(i, j)], cost[k * 2 + 1][f(i, j + 1)]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tint ans = 1e9;\\n\\t\\trep(i, idx) for (int j = 0; j <= 600 - 30; ++j){\\n\\t\\t\\t//pp(0, i, j);\\n\\t\\t\\t//pp(1, i, j+30);\\n\\t\\t\\t//pp(2, i, j);\\n\\t\\t\\t//pp(3, i, j+30);\\n\\t\\t\\tint a = f(i, j), b = f(i, j + 30);\\n\\t\\t\\tif ((cost[0][a] | cost[1][b] | cost[2][a] | cost[3][b]) >= ans) continue;\\n\\t\\t\\tans = min(ans, cost[0][a] + cost[1][b] + cost[2][a] + cost[3][b]);\\n\\t\\t}\\n\\t\\tcout << (ans < 1e9 ? ans : 0) << endl;\\n\\t}\\n\\n\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5608,\n \"score_of_the_acc\": -0.1727,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1229_505246\",\n \"code_snippet\": \"#include<iostream>\\n#include<queue>\\n#include<string>\\n#include<map>\\n#include<cstdlib>\\n#include<algorithm>\\n#include<functional>\\n#include<set>\\n#include<cstdio>\\n#include<cassert>\\n\\nusing namespace std;\\n\\n#define foreach(i,o) for(__typeof((o).begin()) i = (o).begin(); i != (o).end(); ++i)\\n\\nconst int max_place = 101;\\nconst int max_time = 601;\\nconst int MAX_V = 2010;\\nconst int inf = 1<<28;\\n\\nstruct edge{\\n int src, dst;\\n int cost;\\n edge(int src, int dst, int cost):src(src), dst(dst), cost(cost){}\\n};\\n\\nstruct state{\\n int pos;\\n int prev;\\n int cost;\\n \\n state(int pos, int prev, int cost):pos(pos),prev(prev),cost(cost){}\\n\\n bool operator>(const state &t)const{\\n if(cost!=t.cost)return cost>t.cost;\\n if(prev!=t.prev)return prev>t.prev;\\n if(pos!=t.pos)return pos>t.pos;\\n return false;\\n }\\n};\\n\\ntypedef vector<edge> edges;\\ntypedef vector<edges> graph;\\n\\nint convTime(const string &s){\\n int h = atoi(s.substr(0,2).c_str());\\n int m = atoi(s.substr(3,2).c_str());\\n return 60 * h + m;\\n}\\n\\nstring revTime(int t){\\n char buf[32];\\n sprintf(buf, \\\"%02d:%02d\\\", t/60, t%60);\\n return string(buf);\\n}\\n\\nint **dist = NULL;\\nvoid johnson(const graph &tmp_g){\\n graph g = tmp_g;\\n const int v = g.size();\\n \\n for(int i = 0; i < v; ++i){\\n dist[i] = new int[v];\\n for(int j = 0; j < v; ++j){\\n dist[i][j] = inf;\\n }\\n dist[i][i] = 0;\\n }\\n\\n for(int s = 0; s < v; ++s){\\n priority_queue<state, vector<state>, greater<state> > q;\\n q.push(state(s,s,0));\\n while(!q.empty()){\\n state cur = q.top(); q.pop();\\n for(int i = 0; i < (int)g[cur.pos].size(); ++i){\\n edge e = g[cur.pos][i];\\n int cost = cur.cost + e.cost;\\n assert(cost>=0);\\n if(dist[s][e.dst] > cost){\\n dist[s][e.dst] = cost;\\n q.push(state(e.dst,cur.pos,cost));\\n }\\n }\\n }\\n }\\n \\n return ; \\n}\\n\\nint main()\\n{\\n int n;\\n while(cin>>n && n){\\n int id = 1;\\n int vid = 0;\\n map<string,int> cityDict;\\n map<int,string> revCityDict;\\n set<int> cityEvTimes[max_place];\\n graph g(MAX_V);\\n \\n map<pair<int,int>, int> vID;\\n map<int,pair<int,int> > revID;\\n \\n for(int i = 0; i < n; ++i){\\n string from, ftime, to, ttime;\\n int cost;\\n\\n cin >> from >> ftime >> to >> ttime >> cost;\\n if(!cityDict.count(from)){\\n cityDict[from] = id;\\n revCityDict[id] = from;\\n ++id;\\n }\\n if(!cityDict.count(to)){\\n cityDict[to] = id;\\n revCityDict[id] = to;\\n ++id;\\n }\\n\\n int src = cityDict[from];\\n int dst = cityDict[to];\\n int srcTime = convTime(ftime) - 480;\\n int dstTime = convTime(ttime) - 480;\\n \\n if( dstTime >= 0 && dstTime < max_time && srcTime >= 0 && srcTime < max_time ){\\n if( !vID.count(make_pair(src,srcTime)) ){\\n vID[make_pair(src,srcTime)] = vid;\\n revID[vid] = make_pair(src,srcTime);\\n ++vid;\\n }\\n cityEvTimes[src].insert(srcTime);\\n if( !vID.count(make_pair(dst,dstTime)) ){\\n vID[make_pair(dst,dstTime)] = vid;\\n revID[vid] = make_pair(dst,dstTime);\\n ++vid;\\n }\\n cityEvTimes[dst].insert(dstTime);\\n \\n g[vID[make_pair(src,srcTime)]].push_back( edge(vID[make_pair(src,srcTime)], vID[make_pair(dst,dstTime)], cost) );\\n }\\n\\n }\\n g.resize(vID.size());\\n \\n for(int i = 1; i < id; ++i){\\n foreach(it2, cityEvTimes[i]){\\n set<int>::iterator it3 = it2;\\n ++it3;\\n if( it3 != cityEvTimes[i].end() ){\\n g[vID[make_pair(i,*it2)]].push_back( edge(vID[make_pair(i,*it2)], vID[make_pair(i,*it3)], 0) );\\n }\\n }\\n }\\n \\n dist=new int*[g.size()];\\n for(int i = 0; i < (int)g.size(); ++i){\\n dist[i] = new int[g.size()];\\n }\\n \\n johnson(g);\\n\\n int res = inf;\\n int kenInitial = cityDict[\\\"Tokyo\\\"];\\n int keikoInitial = cityDict[\\\"Hakodate\\\"];\\n\\n int ken_st, keiko_st;\\n if( cityEvTimes[kenInitial].size() > 0 && cityEvTimes[keikoInitial].size() > 0 ){\\n ken_st = vID[make_pair(kenInitial, *(cityEvTimes[kenInitial].begin()))];\\n keiko_st = vID[make_pair(keikoInitial, *(cityEvTimes[keikoInitial].begin()))];\\n\\n for(int i = 1; i < id; ++i){\\n foreach(ev1, cityEvTimes[i]){\\n int v1 = vID[make_pair(i,*ev1)];\\n foreach(ev2, cityEvTimes[i]){\\n int v2 = vID[make_pair(i,*ev2)];\\n int st = max(*ev1, *ev2) + 30;\\n int from = -1;\\n\\n if(cityEvTimes[i].lower_bound(st)!=cityEvTimes[i].end()){\\n from = vID[make_pair(i,*(cityEvTimes[i].lower_bound(st)))];\\n }\\n if(from<0)continue;\\n foreach(ev3, cityEvTimes[kenInitial]){\\n if( *ev3 < st ) continue;\\n int v3 = vID[make_pair(kenInitial,*ev3)];\\n foreach(ev4, cityEvTimes[keikoInitial]){\\n if( *ev4 < st ) continue;\\n int v4 = vID[make_pair(keikoInitial, *ev4)];\\n res = min(res, dist[ken_st][v1] + dist[keiko_st][v2] + dist[from][v3] + dist[from][v4]);\\n }\\n }\\n }\\n }\\n }\\n }\\n \\n\\n if(res>=inf)res = 0;\\n cout << res << endl;\\n\\n for(int i = 0; i < (int)g.size(); ++i){\\n delete [] dist[i];\\n }\\n delete [] dist;\\n \\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1550,\n \"memory_kb\": 23180,\n \"score_of_the_acc\": -0.9418,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1229_505244\",\n \"code_snippet\": \"#include<iostream>\\n#include<queue>\\n#include<string>\\n#include<map>\\n#include<cstdlib>\\n#include<algorithm>\\n#include<functional>\\n#include<set>\\n#include<cstdio>\\n#include<cassert>\\n\\nusing namespace std;\\n\\n#define foreach(i,o) for(__typeof((o).begin()) i = (o).begin(); i != (o).end(); ++i)\\n\\nconst int max_place = 101;\\nconst int max_time = 601;\\nconst int MAX_V = 2010;\\nconst int inf = 1<<28;\\n\\nstruct edge{\\n int src, dst;\\n int cost;\\n edge(int src, int dst, int cost):src(src), dst(dst), cost(cost){}\\n};\\n\\nstruct state{\\n int pos;\\n int prev;\\n int cost;\\n \\n state(int pos, int prev, int cost):pos(pos),prev(prev),cost(cost){}\\n\\n bool operator>(const state &t)const{\\n if(cost!=t.cost)return cost>t.cost;\\n if(prev!=t.prev)return prev>t.prev;\\n if(pos!=t.pos)return pos>t.pos;\\n return false;\\n }\\n};\\n\\ntypedef vector<edge> edges;\\ntypedef vector<edges> graph;\\n\\nint convTime(const string &s){\\n int h = atoi(s.substr(0,2).c_str());\\n int m = atoi(s.substr(3,2).c_str());\\n return 60 * h + m;\\n}\\n\\nstring revTime(int t){\\n char buf[32];\\n sprintf(buf, \\\"%02d:%02d\\\", t/60, t%60);\\n return string(buf);\\n}\\n\\n// static int dist[MAX_V][MAX_V];\\nint **dist = NULL;\\n// = new int* [v];\\nvoid johnson(const graph &tmp_g){\\n graph g = tmp_g;\\n \\n const int v = g.size();\\n // [v];\\n // int **prev = new static int prev[MAX_V][MAX_V];\\n \\n for(int i = 0; i < v; ++i){\\n dist[i] = new int[v];\\n for(int j = 0; j < v; ++j){\\n dist[i][j] = inf;\\n // prev[i][j] = -1;\\n }\\n dist[i][i] = 0;\\n }\\n\\n for(int s = 0; s < v; ++s){\\n priority_queue<state, vector<state>, greater<state> > q;\\n q.push(state(s,s,0));\\n // bool vis[v]\\n while(!q.empty()){\\n state cur = q.top(); q.pop();\\n // if(prev[s][cur.pos]!=-1)continue;\\n // prev[s][cur.pos] = cur.prev;\\n for(int i = 0; i < (int)g[cur.pos].size(); ++i){\\n edge e = g[cur.pos][i];\\n int cost = cur.cost + e.cost;\\n assert(cost>=0);\\n if(dist[s][e.dst] > cost){\\n dist[s][e.dst] = cost;\\n q.push(state(e.dst,cur.pos,cost));\\n }\\n }\\n }\\n }\\n \\n return ; \\n}\\n\\nint main()\\n{\\n int n;\\n while(cin>>n && n){\\n int id = 1;\\n int vid = 0;\\n map<string,int> cityDict;\\n map<int,string> revCityDict;\\n set<int> cityEvTimes[max_place];\\n graph g(MAX_V);\\n \\n map<pair<int,int>, int> vID;\\n map<int,pair<int,int> > revID;\\n \\n for(int i = 0; i < n; ++i){\\n string from, ftime, to, ttime;\\n int cost;\\n\\n cin >> from >> ftime >> to >> ttime >> cost;\\n if(!cityDict.count(from)){\\n cityDict[from] = id;\\n revCityDict[id] = from;\\n ++id;\\n }\\n if(!cityDict.count(to)){\\n cityDict[to] = id;\\n revCityDict[id] = to;\\n ++id;\\n }\\n\\n int src = cityDict[from];\\n int dst = cityDict[to];\\n int srcTime = convTime(ftime) - 480;\\n int dstTime = convTime(ttime) - 480;\\n \\n if( dstTime >= 0 && dstTime < max_time && srcTime >= 0 && srcTime < max_time ){\\n if( !vID.count(make_pair(src,srcTime)) ){\\n vID[make_pair(src,srcTime)] = vid;\\n revID[vid] = make_pair(src,srcTime);\\n ++vid;\\n }\\n cityEvTimes[src].insert(srcTime);\\n if( !vID.count(make_pair(dst,dstTime)) ){\\n vID[make_pair(dst,dstTime)] = vid;\\n revID[vid] = make_pair(dst,dstTime);\\n ++vid;\\n }\\n cityEvTimes[dst].insert(dstTime);\\n \\n g[vID[make_pair(src,srcTime)]].push_back( edge(vID[make_pair(src,srcTime)], vID[make_pair(dst,dstTime)], cost) );\\n }\\n\\n }\\n g.resize(vID.size());\\n \\n for(int i = 1; i < id; ++i){\\n foreach(it2, cityEvTimes[i]){\\n set<int>::iterator it3 = it2;\\n ++it3;\\n if( it3 != cityEvTimes[i].end() ){\\n g[vID[make_pair(i,*it2)]].push_back( edge(vID[make_pair(i,*it2)], vID[make_pair(i,*it3)], 0) );\\n }\\n }\\n }\\n \\n dist=new int*[g.size()];\\n for(int i = 0; i < (int)g.size(); ++i){\\n dist[i] = new int[g.size()];\\n }\\n \\n johnson(g);\\n\\n int res = inf;\\n int kenInitial = cityDict[\\\"Tokyo\\\"];\\n int keikoInitial = cityDict[\\\"Hakodate\\\"];\\n\\n int ken_st, keiko_st;\\n if( cityEvTimes[kenInitial].size() > 0 && cityEvTimes[keikoInitial].size() > 0 ){\\n ken_st = vID[make_pair(kenInitial, *(cityEvTimes[kenInitial].begin()))];\\n keiko_st = vID[make_pair(keikoInitial, *(cityEvTimes[keikoInitial].begin()))];\\n\\n for(int i = 1; i < id; ++i){\\n foreach(ev1, cityEvTimes[i]){\\n int v1 = vID[make_pair(i,*ev1)];\\n foreach(ev2, cityEvTimes[i]){\\n int v2 = vID[make_pair(i,*ev2)];\\n int st = max(*ev1, *ev2) + 30;\\n int from = -1;\\n\\n if(cityEvTimes[i].lower_bound(st)!=cityEvTimes[i].end()){\\n from = vID[make_pair(i,*(cityEvTimes[i].lower_bound(st)))];\\n }\\n if(from<0)continue;\\n foreach(ev3, cityEvTimes[kenInitial]){\\n if( *ev3 < st ) continue;\\n int v3 = vID[make_pair(kenInitial,*ev3)];\\n foreach(ev4, cityEvTimes[keikoInitial]){\\n if( *ev4 < st ) continue;\\n int v4 = vID[make_pair(keikoInitial, *ev4)];\\n res = min(res, dist[ken_st][v1] + dist[keiko_st][v2] + dist[from][v3] + dist[from][v4]);\\n }\\n }\\n }\\n }\\n }\\n \\n }\\n \\n\\n if(res>=inf)res = 0;\\n cout << res << endl;\\n\\n for(int i = 0; i < (int)g.size(); ++i){\\n delete [] dist[i];\\n }\\n delete [] dist;\\n \\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1540,\n \"memory_kb\": 23184,\n \"score_of_the_acc\": -0.9405,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1229_505240\",\n \"code_snippet\": \"#include<iostream>\\n#include<queue>\\n#include<string>\\n#include<map>\\n#include<cstdlib>\\n#include<algorithm>\\n#include<functional>\\n#include<set>\\n#include<cstdio>\\n#include<cassert>\\n\\nusing namespace std;\\n\\n#define foreach(i,o) for(__typeof((o).begin()) i = (o).begin(); i != (o).end(); ++i)\\n\\nconst int max_place = 101;\\nconst int max_time = 601;\\nconst int MAX_V = 2010;\\nconst int inf = 1<<28;\\n\\nstruct edge{\\n int src, dst;\\n int cost;\\n edge(int src, int dst, int cost):src(src), dst(dst), cost(cost){}\\n};\\n\\nstruct state{\\n int pos;\\n int prev;\\n int cost;\\n \\n state(int pos, int prev, int cost):pos(pos),prev(prev),cost(cost){}\\n\\n bool operator>(const state &t)const{\\n if(cost!=t.cost)return cost>t.cost;\\n if(prev!=t.prev)return prev>t.prev;\\n if(pos!=t.pos)return pos>t.pos;\\n return false;\\n }\\n};\\n\\ntypedef vector<edge> edges;\\ntypedef vector<edges> graph;\\n\\nint convTime(const string &s){\\n int h = atoi(s.substr(0,2).c_str());\\n int m = atoi(s.substr(3,2).c_str());\\n return 60 * h + m;\\n}\\n\\nstring revTime(int t){\\n char buf[32];\\n sprintf(buf, \\\"%02d:%02d\\\", t/60, t%60);\\n return string(buf);\\n}\\n\\nstatic int dist[MAX_V][MAX_V];\\nvoid johnson(const graph &tmp_g){\\n graph g = tmp_g;\\n \\n const int v = g.size();\\n //static int h[MAX_V];\\n static int prev[MAX_V][MAX_V];\\n \\n\\n /*\\n for(int i = 0; i < v; ++i){\\n h[i] = 0;\\n }\\n */\\n\\n /*\\n for(int i = 0; i <= v; ++i){\\n bool end = true;\\n for(int j = 0; j < v; ++j){\\n for(int k = 0; k < (int)g[j].size(); ++k){\\n edge e = g[j][k];\\n int tmp = h[j] + e.cost;\\n if( h[e.dst] > tmp ){\\n h[e.dst] = tmp;\\n end = false;\\n }\\n }\\n }\\n if(end)break;\\n // do not detect an negative cycle.\\n }\\n */\\n\\n for(int i = 0; i < v; ++i){\\n for(int j = 0; j < v; ++j){\\n dist[i][j] = inf;\\n prev[i][j] = -1;\\n }\\n dist[i][i] = 0;\\n }\\n\\n /*\\n for(int i = 0; i < v; ++i){\\n for(int j = 0; j < (int)g[i].size(); ++j){\\n g[i][j].cost += h[i] - h[g[i][j].dst];\\n }\\n }\\n */\\n\\n for(int s = 0; s < v; ++s){\\n priority_queue<state, vector<state>, greater<state> > q;\\n q.push(state(s,s,0));\\n while(!q.empty()){\\n state cur = q.top(); q.pop();\\n if(prev[s][cur.pos]!=-1)continue;\\n prev[s][cur.pos] = cur.prev;\\n for(int i = 0; i < (int)g[cur.pos].size(); ++i){\\n edge e = g[cur.pos][i];\\n int cost = cur.cost + e.cost;\\n assert(cost>=0);\\n if(dist[s][e.dst] > cost){\\n dist[s][e.dst] = cost;\\n q.push(state(e.dst,cur.pos,cost));\\n }\\n }\\n }\\n // for(int i = 0; i < v; ++i){\\n //dist[s][i] += h[i] - h[s];\\n //}\\n }\\n\\n return ; \\n}\\n\\nint main()\\n{\\n int n;\\n while(cin>>n && n){\\n int id = 1;\\n int vid = 0;\\n map<string,int> cityDict;\\n map<int,string> revCityDict;\\n set<int> cityEvTimes[max_place];\\n graph g(MAX_V);\\n \\n map<pair<int,int>, int> vID;\\n map<int,pair<int,int> > revID;\\n \\n for(int i = 0; i < n; ++i){\\n string from, ftime, to, ttime;\\n int cost;\\n\\n cin >> from >> ftime >> to >> ttime >> cost;\\n if(!cityDict.count(from)){\\n cityDict[from] = id;\\n revCityDict[id] = from;\\n ++id;\\n }\\n if(!cityDict.count(to)){\\n cityDict[to] = id;\\n revCityDict[id] = to;\\n ++id;\\n }\\n\\n int src = cityDict[from];\\n int dst = cityDict[to];\\n int srcTime = convTime(ftime) - 480;\\n int dstTime = convTime(ttime) - 480;\\n \\n if( dstTime >= 0 && dstTime < max_time && srcTime >= 0 && srcTime < max_time ){\\n if( !vID.count(make_pair(src,srcTime)) ){\\n vID[make_pair(src,srcTime)] = vid;\\n revID[vid] = make_pair(src,srcTime);\\n ++vid;\\n }\\n cityEvTimes[src].insert(srcTime);\\n if( !vID.count(make_pair(dst,dstTime)) ){\\n vID[make_pair(dst,dstTime)] = vid;\\n revID[vid] = make_pair(dst,dstTime);\\n ++vid;\\n }\\n cityEvTimes[dst].insert(dstTime);\\n \\n g[vID[make_pair(src,srcTime)]].push_back( edge(vID[make_pair(src,srcTime)], vID[make_pair(dst,dstTime)], cost) );\\n }\\n\\n }\\n g.resize(vID.size());\\n \\n for(int i = 1; i < id; ++i){\\n foreach(it2, cityEvTimes[i]){\\n set<int>::iterator it3 = it2;\\n ++it3;\\n if( it3 != cityEvTimes[i].end() ){\\n g[vID[make_pair(i,*it2)]].push_back( edge(vID[make_pair(i,*it2)], vID[make_pair(i,*it3)], 0) );\\n }\\n }\\n }\\n \\n johnson(g);\\n\\n int res = inf;\\n int kenInitial = cityDict[\\\"Tokyo\\\"];\\n int keikoInitial = cityDict[\\\"Hakodate\\\"];\\n\\n int ken_st, keiko_st;\\n if( cityEvTimes[kenInitial].size() > 0 && cityEvTimes[keikoInitial].size() > 0 ){\\n ken_st = vID[make_pair(kenInitial, *(cityEvTimes[kenInitial].begin()))];\\n keiko_st = vID[make_pair(keikoInitial, *(cityEvTimes[keikoInitial].begin()))];\\n\\n for(int i = 1; i < id; ++i){\\n foreach(ev1, cityEvTimes[i]){\\n int v1 = vID[make_pair(i,*ev1)];\\n foreach(ev2, cityEvTimes[i]){\\n int v2 = vID[make_pair(i,*ev2)];\\n int st = max(*ev1, *ev2) + 30;\\n int from = -1;\\n\\n if(cityEvTimes[i].lower_bound(st)!=cityEvTimes[i].end()){\\n from = vID[make_pair(i,*(cityEvTimes[i].lower_bound(st)))];\\n }\\n if(from<0)continue;\\n foreach(ev3, cityEvTimes[kenInitial]){\\n if( *ev3 < st ) continue;\\n int v3 = vID[make_pair(kenInitial,*ev3)];\\n foreach(ev4, cityEvTimes[keikoInitial]){\\n if( *ev4 < st ) continue;\\n int v4 = vID[make_pair(keikoInitial, *ev4)];\\n res = min(res, dist[ken_st][v1] + dist[keiko_st][v2] + dist[from][v3] + dist[from][v4]);\\n }\\n }\\n }\\n }\\n }\\n \\n }\\n \\n\\n if(res>=inf)res = 0;\\n cout << res << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1670,\n \"memory_kb\": 32480,\n \"score_of_the_acc\": -1.2459,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1229_505238\",\n \"code_snippet\": \"#include<iostream>\\n#include<queue>\\n#include<string>\\n#include<map>\\n#include<cstdlib>\\n#include<algorithm>\\n#include<functional>\\n#include<set>\\n#include<cstdio>\\n#include<cassert>\\n\\nusing namespace std;\\n\\n#define foreach(i,o) for(__typeof((o).begin()) i = (o).begin(); i != (o).end(); ++i)\\n\\nconst int max_place = 101;\\nconst int max_time = 601;\\nconst int MAX_V = 2010;\\nconst int inf = 1<<28;\\n\\nstruct edge{\\n int src, dst;\\n int cost;\\n edge(int src, int dst, int cost):src(src), dst(dst), cost(cost){}\\n};\\n\\nstruct state{\\n int pos;\\n int prev;\\n int cost;\\n \\n state(int pos, int prev, int cost):pos(pos),prev(prev),cost(cost){}\\n\\n bool operator>(const state &t)const{\\n if(cost!=t.cost)return cost>t.cost;\\n if(prev!=t.prev)return prev>t.prev;\\n if(pos!=t.pos)return pos>t.pos;\\n return false;\\n }\\n};\\n\\ntypedef vector<edge> edges;\\ntypedef vector<edges> graph;\\n\\nint convTime(const string &s){\\n int h = atoi(s.substr(0,2).c_str());\\n int m = atoi(s.substr(3,2).c_str());\\n return 60 * h + m;\\n}\\n\\nstring revTime(int t){\\n char buf[32];\\n sprintf(buf, \\\"%02d:%02d\\\", t/60, t%60);\\n return string(buf);\\n}\\n\\nstatic int dist[MAX_V][MAX_V];\\nvoid johnson(const graph &tmp_g){\\n graph g = tmp_g;\\n \\n const int v = g.size();\\n static int h[MAX_V];\\n static int prev[MAX_V][MAX_V];\\n \\n\\n for(int i = 0; i < v; ++i){\\n h[i] = 0;\\n }\\n\\n for(int i = 0; i <= v; ++i){\\n bool end = true;\\n for(int j = 0; j < v; ++j){\\n for(int k = 0; k < (int)g[j].size(); ++k){\\n edge e = g[j][k];\\n int tmp = h[j] + e.cost;\\n if( h[e.dst] > tmp ){\\n h[e.dst] = tmp;\\n end = false;\\n }\\n }\\n }\\n if(end)break;\\n // do not detect an negative cycle.\\n }\\n\\n for(int i = 0; i < v; ++i){\\n for(int j = 0; j < v; ++j){\\n dist[i][j] = inf;\\n prev[i][j] = -1;\\n }\\n dist[i][i] = 0;\\n }\\n\\n for(int i = 0; i < v; ++i){\\n for(int j = 0; j < (int)g[i].size(); ++j){\\n g[i][j].cost += h[i] - h[g[i][j].dst];\\n }\\n }\\n\\n for(int s = 0; s < v; ++s){\\n priority_queue<state, vector<state>, greater<state> > q;\\n q.push(state(s,s,0));\\n while(!q.empty()){\\n state cur = q.top(); q.pop();\\n if(prev[s][cur.pos]!=-1)continue;\\n prev[s][cur.pos] = cur.prev;\\n for(int i = 0; i < (int)g[cur.pos].size(); ++i){\\n edge e = g[cur.pos][i];\\n int cost = cur.cost + e.cost;\\n assert(cost>=0);\\n if(dist[s][e.dst] > cost){\\n dist[s][e.dst] = cost;\\n q.push(state(e.dst,cur.pos,cost));\\n }\\n }\\n }\\n for(int i = 0; i < v; ++i){\\n dist[s][i] += h[i] - h[s];\\n }\\n }\\n\\n return ; \\n}\\n\\nint main()\\n{\\n int n;\\n while(cin>>n && n){\\n int id = 1;\\n int vid = 0;\\n map<string,int> cityDict;\\n map<int,string> revCityDict;\\n set<int> cityEvTimes[max_place];\\n graph g(MAX_V);\\n \\n map<pair<int,int>, int> vID;\\n map<int,pair<int,int> > revID;\\n \\n for(int i = 0; i < n; ++i){\\n string from, ftime, to, ttime;\\n int cost;\\n\\n cin >> from >> ftime >> to >> ttime >> cost;\\n if(!cityDict.count(from)){\\n cityDict[from] = id;\\n revCityDict[id] = from;\\n ++id;\\n }\\n if(!cityDict.count(to)){\\n cityDict[to] = id;\\n revCityDict[id] = to;\\n ++id;\\n }\\n\\n int src = cityDict[from];\\n int dst = cityDict[to];\\n int srcTime = convTime(ftime) - 480;\\n int dstTime = convTime(ttime) - 480;\\n \\n if( dstTime >= 0 && dstTime < max_time && srcTime >= 0 && srcTime < max_time ){\\n if( !vID.count(make_pair(src,srcTime)) ){\\n vID[make_pair(src,srcTime)] = vid;\\n revID[vid] = make_pair(src,srcTime);\\n ++vid;\\n }\\n cityEvTimes[src].insert(srcTime);\\n if( !vID.count(make_pair(dst,dstTime)) ){\\n vID[make_pair(dst,dstTime)] = vid;\\n revID[vid] = make_pair(dst,dstTime);\\n ++vid;\\n }\\n cityEvTimes[dst].insert(dstTime);\\n \\n g[vID[make_pair(src,srcTime)]].push_back( edge(vID[make_pair(src,srcTime)], vID[make_pair(dst,dstTime)], cost) );\\n }\\n\\n }\\n g.resize(vID.size());\\n \\n for(int i = 1; i < id; ++i){\\n foreach(it2, cityEvTimes[i]){\\n set<int>::iterator it3 = it2;\\n ++it3;\\n if( it3 != cityEvTimes[i].end() ){\\n g[vID[make_pair(i,*it2)]].push_back( edge(vID[make_pair(i,*it2)], vID[make_pair(i,*it3)], 0) );\\n }\\n }\\n }\\n \\n johnson(g);\\n\\n int res = inf;\\n int kenInitial = cityDict[\\\"Tokyo\\\"];\\n int keikoInitial = cityDict[\\\"Hakodate\\\"];\\n\\n int ken_st, keiko_st;\\n if( cityEvTimes[kenInitial].size() > 0 && cityEvTimes[keikoInitial].size() > 0 ){\\n ken_st = vID[make_pair(kenInitial, *(cityEvTimes[kenInitial].begin()))];\\n keiko_st = vID[make_pair(keikoInitial, *(cityEvTimes[keikoInitial].begin()))];\\n\\n for(int i = 1; i < id; ++i){\\n foreach(ev1, cityEvTimes[i]){\\n int v1 = vID[make_pair(i,*ev1)];\\n foreach(ev2, cityEvTimes[i]){\\n int v2 = vID[make_pair(i,*ev2)];\\n int st = max(*ev1, *ev2) + 30;\\n int from = -1;\\n\\n if(cityEvTimes[i].lower_bound(st)!=cityEvTimes[i].end()){\\n from = vID[make_pair(i,*(cityEvTimes[i].lower_bound(st)))];\\n }\\n if(from<0)continue;\\n foreach(ev3, cityEvTimes[kenInitial]){\\n if( *ev3 < st ) continue;\\n int v3 = vID[make_pair(kenInitial,*ev3)];\\n foreach(ev4, cityEvTimes[keikoInitial]){\\n if( *ev4 < st ) continue;\\n int v4 = vID[make_pair(keikoInitial, *ev4)];\\n res = min(res, dist[ken_st][v1] + dist[keiko_st][v2] + dist[from][v3] + dist[from][v4]);\\n }\\n }\\n }\\n }\\n }\\n \\n }\\n \\n\\n if(res>=inf)res = 0;\\n cout << res << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1650,\n \"memory_kb\": 32480,\n \"score_of_the_acc\": -1.243,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1229_505236\",\n \"code_snippet\": \"#include<iostream>\\n#include<queue>\\n#include<string>\\n#include<map>\\n#include<cstdlib>\\n#include<algorithm>\\n#include<functional>\\n#include<set>\\n#include<cstdio>\\n#include<cassert>\\n\\nusing namespace std;\\n\\n#define foreach(i,o) for(__typeof((o).begin()) i = (o).begin(); i != (o).end(); ++i)\\n\\nconst int max_place = 101;\\nconst int max_time = 601;\\nconst int MAX_V = 2010;\\nconst int inf = 1<<28;\\n\\nstruct edge{\\n int src, dst;\\n int cost;\\n edge(int src, int dst, int cost):src(src), dst(dst), cost(cost){}\\n};\\n\\nstruct state{\\n int pos;\\n int prev;\\n int cost;\\n \\n state(int pos, int prev, int cost):pos(pos),prev(prev),cost(cost){}\\n\\n bool operator>(const state &t)const{\\n if(cost!=t.cost)return cost>t.cost;\\n if(prev!=t.prev)return prev>t.prev;\\n if(pos!=t.pos)return pos>t.pos;\\n return false;\\n }\\n \\n /*\\n bool operator<(const state &t)const{\\n if(pos!=t.pos)return pos<t.pos;\\n return false;\\n }\\n */\\n};\\n\\ntypedef vector<edge> edges;\\ntypedef vector<edges> graph;\\n\\nint convTime(const string &s){\\n int h = atoi(s.substr(0,2).c_str());\\n int m = atoi(s.substr(3,2).c_str());\\n return 60 * h + m;\\n}\\n\\nstring revTime(int t){\\n char buf[32];\\n sprintf(buf, \\\"%02d:%02d\\\", t/60, t%60);\\n return string(buf);\\n}\\n\\nstatic int dist[MAX_V][MAX_V];\\nvoid johnson(const graph &tmp_g){\\n graph g = tmp_g;\\n \\n const int v = g.size();\\n static int h[MAX_V];\\n static int prev[MAX_V][MAX_V];\\n \\n\\n for(int i = 0; i < v; ++i){\\n h[i] = 0;\\n }\\n\\n for(int i = 0; i <= v; ++i){\\n bool end = true;\\n for(int j = 0; j < v; ++j){\\n for(int k = 0; k < (int)g[j].size(); ++k){\\n edge e = g[j][k];\\n int tmp = h[j] + e.cost;\\n if( h[e.dst] > tmp ){\\n h[e.dst] = tmp;\\n end = false;\\n }\\n }\\n }\\n if(end)break;\\n // do not detect an negative cycle.\\n }\\n\\n for(int i = 0; i < v; ++i){\\n for(int j = 0; j < v; ++j){\\n dist[i][j] = inf;\\n prev[i][j] = -1;\\n }\\n dist[i][i] = 0;\\n }\\n\\n for(int i = 0; i < v; ++i){\\n for(int j = 0; j < (int)g[i].size(); ++j){\\n g[i][j].cost += h[i] - h[g[i][j].dst];\\n }\\n }\\n\\n for(int s = 0; s < v; ++s){\\n priority_queue<state, vector<state>, greater<state> > q;\\n q.push(state(s,s,0));\\n while(!q.empty()){\\n state cur = q.top(); q.pop();\\n if(prev[s][cur.pos]!=-1)continue;\\n prev[s][cur.pos] = cur.prev;\\n for(int i = 0; i < (int)g[cur.pos].size(); ++i){\\n edge e = g[cur.pos][i];\\n int cost = cur.cost + e.cost;\\n assert(cost>=0);\\n if(dist[s][e.dst] > cost){\\n dist[s][e.dst] = cost;\\n q.push(state(e.dst,cur.pos,cost));\\n }\\n }\\n }\\n for(int i = 0; i < v; ++i){\\n dist[s][i] += h[i] - h[s];\\n }\\n }\\n\\n return ; \\n}\\n\\nint main()\\n{\\n int n;\\n while(cin>>n && n){\\n int id = 1;\\n int vid = 0;\\n map<string,int> cityDict;\\n map<int,string> revCityDict;\\n set<int> cityEvTimes[max_place];\\n graph g(MAX_V);\\n \\n map<pair<int,int>, int> vID;\\n map<int,pair<int,int> > revID;\\n \\n for(int i = 0; i < n; ++i){\\n string from, ftime, to, ttime;\\n int cost;\\n\\n cin >> from >> ftime >> to >> ttime >> cost;\\n if(!cityDict.count(from)){\\n cityDict[from] = id;\\n revCityDict[id] = from;\\n ++id;\\n }\\n if(!cityDict.count(to)){\\n cityDict[to] = id;\\n revCityDict[id] = to;\\n ++id;\\n }\\n\\n int src = cityDict[from];\\n int dst = cityDict[to];\\n int srcTime = convTime(ftime) - 480;\\n int dstTime = convTime(ttime) - 480;\\n \\n if( dstTime >= 0 && dstTime < max_time && srcTime >= 0 && srcTime < max_time ){\\n if( !vID.count(make_pair(src,srcTime)) ){\\n vID[make_pair(src,srcTime)] = vid;\\n revID[vid] = make_pair(src,srcTime);\\n ++vid;\\n }\\n cityEvTimes[src].insert(srcTime);\\n if( !vID.count(make_pair(dst,dstTime)) ){\\n vID[make_pair(dst,dstTime)] = vid;\\n revID[vid] = make_pair(dst,dstTime);\\n ++vid;\\n }\\n cityEvTimes[dst].insert(dstTime);\\n \\n g[vID[make_pair(src,srcTime)]].push_back( edge(vID[make_pair(src,srcTime)], vID[make_pair(dst,dstTime)], cost) );\\n }\\n\\n }\\n g.resize(vID.size());\\n \\n for(int i = 1; i < id; ++i){\\n // sort( it->second.begin(), it->second.end() );\\n foreach(it2, cityEvTimes[i]){\\n // g[it->first].push_back( edge(it->first, it->second[i], it->first, it->second[i], 0) );\\n set<int>::iterator it3 = it2;\\n ++it3;\\n if( it3 != cityEvTimes[i].end() ){\\n g[vID[make_pair(i,*it2)]].push_back( edge(vID[make_pair(i,*it2)], vID[make_pair(i,*it3)], 0) );\\n }\\n }\\n }\\n \\n\\n /*\\n for(int i = 0; i < (int)g.size(); ++i){\\n cout << i << ' ' << revCityDict[i] << ':' << endl;\\n for(int j = 0; j < (int)g[i].size(); ++j){\\n edge e = g[i][j];\\n cout << revCityDict[e.src] << ' ' << revTime(e.srcTime) << ' ' << revCityDict[e.dst] << ' ' << revTime(e.dstTime) << endl;\\n }\\n }\\n cout << \\\"---\\\"<<endl;\\n */\\n\\n /*\\n foreach(i,revID){\\n cout << revCityDict[i->second.first] << ' ' << revTime(i->second.second+480) << endl;\\n }\\n */\\n\\n johnson(g);\\n\\n /*\\n for(int i = 0; i < (int)g.size(); ++i){\\n for(int j = 0; j < (int)g.size(); ++j){\\n cout << i << ' ' << j << \\\" : \\\" << dist[i][j] <<endl;\\n }\\n }\\n */\\n\\n int res = inf;\\n int kenInitial = cityDict[\\\"Tokyo\\\"];\\n int keikoInitial = cityDict[\\\"Hakodate\\\"];\\n\\n //cout << kenInitial << ' ' << keikoInitial << endl;\\n\\n int ken_st, keiko_st;\\n if( cityEvTimes[kenInitial].size() > 0 && cityEvTimes[keikoInitial].size() > 0 ){\\n ken_st = vID[make_pair(kenInitial, *(cityEvTimes[kenInitial].begin()))];\\n keiko_st = vID[make_pair(keikoInitial, *(cityEvTimes[keikoInitial].begin()))];\\n\\n //cout <<ken_st << ' ' <<keiko_st << endl;\\n \\n for(int i = 1; i < id; ++i){\\n foreach(ev1, cityEvTimes[i]){\\n int v1 = vID[make_pair(i,*ev1)];\\n foreach(ev2, cityEvTimes[i]){\\n int v2 = vID[make_pair(i,*ev2)];\\n int st = max(*ev1, *ev2) + 30;\\n int from = -1;\\n\\n if(cityEvTimes[i].lower_bound(st)!=cityEvTimes[i].end()){\\n from = vID[make_pair(i,*(cityEvTimes[i].lower_bound(st)))];\\n }\\n if(from<0)continue;\\n\\n //cout << v1 << ' ' << v2 << ' ' << from << endl;\\n\\n foreach(ev3, cityEvTimes[kenInitial]){\\n if( *ev3 < st ) continue;\\n int v3 = vID[make_pair(kenInitial,*ev3)];\\n foreach(ev4, cityEvTimes[keikoInitial]){\\n if( *ev4 < st ) continue;\\n int v4 = vID[make_pair(keikoInitial, *ev4)];\\n // cout << i << ' ' << revTime(*ev1+480) << ' ' << revTime(*ev2+480) << ' ' << revTime(*ev3+480) << ' ' << revTime(*ev4+480) << ' ' << revTime(st+480) << \\\" : \\\" << sssp[0][i][*ev1] << ' '<<sssp[1][i][*ev2]<<' '<<sssp[2][kenInitial][*ev3]<< ' ' <<sssp[2][keikoInitial][*ev4] << endl;\\n res = min(res, dist[ken_st][v1] + dist[keiko_st][v2] + dist[from][v3] + dist[from][v4]);\\n }\\n }\\n }\\n }\\n }\\n \\n }\\n \\n\\n if(res>=inf)res = 0;\\n cout << res << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1680,\n \"memory_kb\": 32476,\n \"score_of_the_acc\": -1.2473,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1229_410216\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n#include <cstring>\\n#include <string>\\n#include <vector>\\n#include <algorithm>\\n#include <queue>\\n#include <map>\\nusing namespace std;\\n\\nconst int INF = (1<<28);\\nconst int STR = (8*60);\\nconst int LIM = (18*60);\\n\\nclass Train\\n{\\npublic:\\n\\tint src,dst,dep,arv,cst;\\n\\tTrain(int src, int dst, int dep, int arv, int cst)\\n\\t\\t:src(src),dst(dst),dep(dep),arv(arv),cst(cst)\\n\\t{}\\n};\\n\\nclass State\\n{\\npublic:\\n\\tint p,tm,cst,pvT, pvC;\\n\\tState(int p, int tm, int cst, int pvT, int pvC)\\n\\t\\t:p(p),tm(tm),cst(cst),pvT(pvT),pvC(pvC)\\n\\t{}\\n\\n\\tbool operator<(const State& s) const\\n\\t{\\n\\t\\tif(cst != s.cst) return cst > s.cst;\\n\\t\\treturn tm > s.tm;\\n\\t}\\n};\\n\\ntypedef vector<Train> City;\\ntypedef vector<vector<int> > Matrix;\\n\\nint toMin(string s)\\n{\\n\\tstringstream ss(s);\\n\\tint h,m;\\n\\tchar t;\\n\\tss >> h >> t >> m;\\n\\n\\treturn h*60+m;\\n}\\n\\nbool used[100][2005];\\n\\nint dijkstra_go(int S, int T, int u, vector<City>& cities)\\n{\\n\\tpriority_queue<State> q;\\n\\n\\tfor(int i=0; i<cities[S].size(); i++)\\n\\t\\tq.push(State(cities[S][i].dst, cities[S][i].arv, cities[S][i].cst, i, S));\\n\\n\\tmemset(used, 0, sizeof(used));\\n\\n\\twhile(!q.empty()) {\\n\\t\\tState s=q.top(); q.pop();\\n\\t\\tif(used[s.pvC][s.pvT]) continue;\\n\\t\\tused[s.pvC][s.pvT] = true;\\n\\n\\t\\tif(s.pvC == T && s.pvT == u) return s.cst-cities[s.pvC][s.pvT].cst;\\n\\n\\t\\tfor(int i=0; i<cities[s.p].size(); i++) {\\n\\t\\t\\tTrain t = cities[s.p][i];\\n\\t\\t\\tif(used[s.p][i]) continue;\\n\\t\\t\\tif(s.tm > t.dep) continue;\\n\\t\\t\\tif(i == u && s.p == T && s.tm + 30 > t.dep) continue;\\n\\n\\t\\t\\tq.push(State(t.dst, t.arv, s.cst+t.cst, i, s.p));\\n\\t\\t}\\n\\t}\\n\\n\\treturn INF;\\n}\\n\\nint dijkstra_back(int S, int T, int u, vector<City>& cities)\\n{\\n\\tif(S == T) return 0;\\n\\n\\tpriority_queue<State> q;\\n\\tq.push(State(cities[S][u].dst, cities[S][u].arv, cities[S][u].cst, u, S));\\n\\n\\tmemset(used, 0, sizeof(used));\\n\\n\\twhile(!q.empty()) {\\n\\t\\tState s = q.top(); q.pop();\\n\\t\\tif(used[s.pvC][s.pvT]) continue;\\n\\t\\tused[s.pvC][s.pvT] = true;\\n\\n\\t\\tif(s.p == T) return s.cst;\\n\\n\\t\\tfor(int i=0; i<cities[s.p].size(); i++) {\\n\\t\\t\\tTrain t = cities[s.p][i];\\n\\t\\t\\tif(used[s.p][i]) continue;\\n\\t\\t\\tif(s.tm > t.dep) continue;\\n\\n\\t\\t\\tq.push(State(t.dst, t.arv, s.cst+t.cst, i, s.p));\\n\\t\\t}\\n\\t}\\n\\n\\treturn INF;\\n}\\n\\nint solve(int Hakodate, int Tokyo, vector<City>& cities)\\n{\\n\\tMatrix goKen(cities.size());\\n\\tfor(int i=0; i<cities.size(); i++) {\\n\\t\\tgoKen[i].resize(cities[i].size());\\n\\t\\tfor(int j=0; j<cities[i].size(); j++) {\\n\\t\\t\\tgoKen[i][j] = INF;\\n\\t\\t}\\n\\t}\\n\\n\\tMatrix backKen(goKen), goKeiko(goKen), backKeiko(goKen);\\n\\n\\tfor(int i=0; i<cities.size(); i++)\\n\\tfor(int j=0; j<cities[i].size(); j++) {\\n\\t\\tgoKen[i][j] = dijkstra_go(Hakodate, i, j, cities);\\n\\t\\tgoKeiko[i][j] = dijkstra_go(Tokyo, i, j, cities);\\n\\t\\tbackKen[i][j] = dijkstra_back(i, Hakodate, j, cities);\\n\\t\\tbackKeiko[i][j] = dijkstra_back(i, Tokyo, j, cities);\\n\\t}\\n\\n\\tint res = INF;\\n\\tfor(int i=0; i<cities.size(); i++)\\n\\tfor(int j=0; j<cities[i].size(); j++)\\n\\tfor(int k=0; k<cities[i].size(); k++)\\n\\t{\\n\\t\\tint g = (cities[i][j].dep < cities[i][k].dep ? j : k);\\n\\t\\tres = min(res, goKeiko[i][g]+goKen[i][g]+backKeiko[i][j]+backKen[i][k]);\\n\\t}\\n\\n\\tif(res == INF) res = 0;\\n\\n\\treturn res;\\n}\\n\\nint main()\\n{\\n\\tint N;\\n\\twhile(cin >> N, N) {\\n\\t\\t\\n\\t\\tint cnt=0;\\n\\t\\tmap<string, int> dic;\\n\\t\\tvector<City> cities(N);\\n\\t\\tfor(int i=0; i<N; i++) {\\n\\t\\t\\tstring src,dst,t,s;\\n\\t\\t\\tint c;\\n\\t\\t\\tcin >> src >> t >> dst >> s >> c;\\n\\t\\t\\t\\n\\t\\t\\tif(!dic.count(src)) dic[src] = cnt++;\\n\\t\\t\\tif(!dic.count(dst)) dic[dst] = cnt++;\\n\\n\\t\\t\\tint l = toMin(t), r = toMin(s);\\n\\t\\t\\tif(l < STR || r < STR|| l > LIM || r > LIM) continue;\\n\\n\\t\\t\\tcities[dic[src]].push_back(Train(dic[src], dic[dst], l, r, c));\\n\\t\\t}\\n\\n\\t\\tint hako = dic[\\\"Hakodate\\\"];\\n\\t\\tint tokyo = dic[\\\"Tokyo\\\"];\\n\\n\\t\\tcities[hako].push_back(Train(hako, hako, LIM, LIM, 0));\\n\\t\\tcities[tokyo].push_back(Train(tokyo, tokyo, LIM, LIM, 0));\\n\\n\\t\\tcout << solve(hako, tokyo, cities) << endl;\\n\\t}\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1880,\n \"memory_kb\": 1396,\n \"score_of_the_acc\": -0.32,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1229_363161\",\n \"code_snippet\": \"#define INF 10000000\\n#define BIAS 24*60\\n#include <stdlib.h>\\n#include <math.h>\\n#include <stdio.h>\\n#include <string.h>\\n\\nchar gCity[2001][64];\\nint gCityNum = 0;\\nint from_hakodate[2001][101];\\nint to_hakodate[2001][101];\\nint from_tokyo[2001][101];\\nint to_tokyo[2001][101];\\n\\nstruct Train{\\n int from, to;\\n int dpt, arv;\\n int fare;\\n};\\n\\nint max(int lhs,int rhs){\\n if(lhs > rhs) return lhs;\\n else return rhs;\\n}\\n\\nint min(int lhs,int rhs){\\n if(lhs > rhs) return rhs;\\n else return lhs;\\n}\\n\\nint getCityNum(char* cityName){\\n int i;\\n for(i=0;i<gCityNum;i++){\\n if(strcmp(gCity[i],cityName)==0) return i;\\n }\\n \\n strcpy(gCity[gCityNum],cityName);\\n return gCityNum++;\\n}\\n\\nvoid setTrain(int idx,struct Train* trains,\\n\\t int dptH,int dptM,int arvH,int arvM,int fare,\\n\\t char dptCity[64],char arvCity[64]){\\n trains[idx].from = getCityNum(dptCity);\\n trains[idx].to = getCityNum(arvCity);\\n trains[idx].dpt = dptH*60 + dptM;\\n trains[idx].arv = arvH*60 + arvM;\\n trains[idx].fare = fare;\\n}\\n\\nvoid setRTrain(int idx,struct Train* trains,\\n\\t int dptH,int dptM,int arvH,int arvM,int fare,\\n\\t char dptCity[64],char arvCity[64]){\\n trains[idx].from = getCityNum(arvCity);\\n trains[idx].to = getCityNum(dptCity);\\n trains[idx].dpt = BIAS - (arvH*60 + arvM);\\n trains[idx].arv = BIAS - (dptH*60 + dptM);\\n trains[idx].fare = fare;\\n}\\n\\nint seekMaxFareTrain(struct Train* trains,int ub){\\n int i;\\n int maxFare = -1;\\n int res;\\n for(i=0;i<ub;i++){\\n if(maxFare < trains[i].fare){\\n maxFare = trains[i].fare;\\n res = i;\\n }\\n }\\n return res;\\n}\\n\\nint seekMostDelayTrain(struct Train* trains,int ub){\\n int i;\\n int mostDelay = -1;\\n int res;\\n for(i=0;i<ub;i++){\\n if(mostDelay < abs(trains[i].dpt - trains[i].arv)){\\n mostDelay = abs(trains[i].dpt - trains[i].arv);\\n res = i;\\n }\\n }\\n return res;\\n}\\n\\nint change(int city,int id,struct Train* trains){\\n int i;\\n for(i=id-1;i>=0;i--){\\n if(trains[i].arv <= trains[id].dpt\\n && trains[i].to == city){\\n return i;\\n }\\n } \\n\\n return 0;\\n}\\n\\nint fr(char* name,int trainNum,int table[2001][101], struct Train* trains){\\n int src = getCityNum(name);\\n\\n //printf(\\\"%s %d\\\\n\\\",name,src);\\n\\n table[0][src] = 0;\\n int i;\\n for(i=0;i<trainNum;i++){\\n int j;\\n for(j=0;j<gCityNum;j++){\\n if(j==trains[i].to){\\n\\ttable[i+1][j] = min(table[i][j],table[change(trains[i].from,i,trains)+1][trains[i].from]+trains[i].fare);\\n }\\n else table[i+1][j] = table[i][j];\\n }\\n }\\n}\\n\\nvoid printTable(int table[2001][101],int n){\\n int i;\\n for(i=0;i<=n;i++){\\n int j;\\n for(j=0;j<gCityNum;j++){\\n printf(\\\"%d \\\",table[i][j]);\\n }\\n printf(\\\"\\\\n\\\");\\n }\\n}\\n\\nint mycmp(const void* t1,const void* t2){\\n return ((const struct Train*)t1)->arv - ((const struct Train*)t2)->arv;\\n}\\n\\nvoid printTrains(struct Train* trains,int n){\\n int i;\\n for(i=0;i<n;i++){\\n printf(\\\"%d %d %d %d %d\\\\n\\\",\\n\\t trains[i].from,trains[i].dpt,trains[i].to,\\n\\t trains[i].arv,trains[i].fare);\\n }\\n}\\n\\nint calc_cost(int city,struct Train* trains,struct Train* rtrains,int trainNum){\\n int i;\\n int res = INF;\\n for(i=0;i<trainNum;i++){\\n int j;\\n for(j=trainNum-1;j>=0;j--){\\n int stay = (BIAS - rtrains[j].arv) - trains[i].arv;\\n if(stay < 30) continue;\\n\\n int c = from_hakodate[i+1][city]\\n\\t+ from_tokyo[i+1][city]\\n\\t+ to_hakodate[j+1][city]\\n\\t+ to_tokyo[j+1][city];\\n res = min(res,c);\\n }\\n }\\n return res;\\n}\\n\\nint main(){\\n int n;\\n while(~scanf(\\\"%d\\\",&n)){\\n if(n==0) break;\\n struct Train* trains = (struct Train*)malloc(n*sizeof(struct Train));\\n struct Train* rtrains = (struct Train*)malloc(n*sizeof(struct Train));\\n int i=0;\\n int j=0;\\n for(i=0,j=0;i<n;i++){\\n int dptH,dptM,arvH,arvM,fare;\\n char dptCity[64],arvCity[64];\\n scanf(\\\"%s %d:%d %s %d:%d %d\\\",dptCity,&dptH,&dptM,arvCity,&arvH,&arvM,&fare);\\n if((dptH*60 + dptM < 8*60) || (arvH*60 + arvM > 18*60)) continue;\\n setTrain(j,trains,dptH,dptM,arvH,arvM,fare,dptCity,arvCity);\\n setRTrain(j++,rtrains,dptH,dptM,arvH,arvM,fare,dptCity,arvCity);\\n }\\n\\n // printTrains(trains,j);\\n // printf(\\\"\\\\n\\\");\\n qsort(trains,j,sizeof(struct Train),mycmp);\\n qsort(rtrains,j,sizeof(struct Train),mycmp);\\n\\n // printTrains(trains,j);\\n // printf(\\\"\\\\n\\\");\\n\\n memset(from_hakodate,0x3,sizeof(from_hakodate)); \\n fr(\\\"Hakodate\\\",j,from_hakodate,trains);\\n\\n memset(from_tokyo,0x3,sizeof(from_tokyo)); \\n fr(\\\"Tokyo\\\",j,from_tokyo,trains);\\n\\n memset(to_hakodate,0x3,sizeof(to_hakodate)); \\n fr(\\\"Hakodate\\\",j,to_hakodate,rtrains);\\n\\n memset(to_tokyo,0x3,sizeof(to_tokyo)); \\n fr(\\\"Tokyo\\\",j,to_tokyo,rtrains);\\n\\n\\n int mincost = INF;\\n \\n for(i=0;i<gCityNum;i++){\\n mincost = min(calc_cost(i,trains,rtrains,j),mincost);\\n }\\n //printTable(to_hakodate,j);\\n //printTable(to_tokyo,j);\\n \\n //printf(\\\"\\\\n\\\");\\n //printf(\\\"cityname:%s cityid:%d\\\\n\\\",arvCity,getCityNum(arvCity));\\n\\n printf(\\\"%d\\\\n\\\",mincost == INF ? 0:mincost);\\n\\n memset(gCity,'\\\\0',sizeof(gCity));\\n gCityNum = 0;\\n free(trains);\\n free(rtrains);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 0,\n \"score_of_the_acc\": -0.0089,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1229_293760\",\n \"code_snippet\": \"#include <iostream>\\n#include <fstream>\\n#include <sstream>\\n#include <string>\\n#include <algorithm>\\n#include <vector>\\n#include <queue>\\n#include <deque>\\n#include <stack>\\n#include <map>\\n#include <set>\\n#include <complex>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <cmath>\\n#include <cctype>\\n#include <climits>\\nusing namespace std;\\n\\ntypedef long long ll;\\n\\n#define REP(i,n,m) for(int i=n;i<m;i++)\\n#define rep(i,n) REP(i,0,n)\\n\\nclass E{\\npublic:\\n int to;\\n int ft,tt;\\n int cost;\\n\\n E(){}\\n E(int _to,int _ft,int _tt,int _cost){\\n to = _to;\\n ft = _ft;\\n tt = _tt;\\n cost = _cost;\\n }\\n};\\n\\nclass State{\\npublic:\\n int id,tm,cost;\\n\\n State(){}\\n State(int _id,int _tm,int _cost){\\n id = _id;\\n tm = _tm;\\n cost = _cost;\\n }\\n\\n bool operator<(const State &st)const{\\n return cost > st.cost;\\n }\\n};\\n\\nint n,m;\\nint A,B;\\nint LEAVE,BACK;\\nint ac[102][2000],bc[102][2000];\\nint r_ac[102][2000],r_bc[102][2000];\\nmap<string,int> name;\\nvector<E> t[102],rt[102];\\n\\nint TimeToInt(string s){\\n int h = (s[0] - '0') * 10 + (s[1] - '0');\\n int m = (s[3] - '0') * 10 + (s[4] - '0');\\n return h * 60 + m;\\n}\\n\\nint NameToInt(string s){\\n int tmp = name[s];\\n if(tmp == 0){\\n name[s] = name.size();\\n }\\n return name[s];\\n}\\n\\nvoid calCost(int start,int closed[102][2000]){\\n priority_queue<State> open;\\n rep(i,102) rep(j,2000) closed[i][j] = -1;\\n open.push(State(start,LEAVE,0));\\n\\n while(!open.empty()){\\n State st = open.top(); open.pop();\\n if(closed[st.id][st.tm] != -1) continue;\\n closed[st.id][st.tm] = st.cost;\\n\\n rep(i,t[st.id].size()){\\n E e = t[st.id][i];\\n if(st.tm <= e.ft){\\n open.push(State(e.to,e.tt,st.cost+e.cost));\\n }\\n }\\n }\\n}\\n\\nvoid calRevCost(int start,int closed[102][2000]){\\n priority_queue<State> open;\\n rep(i,102) rep(j,2000) closed[i][j] = -1;\\n open.push(State(start,BACK,0));\\n\\n while(!open.empty()){\\n State st = open.top(); open.pop();\\n if(closed[st.id][st.tm] != -1) continue;\\n closed[st.id][st.tm] = st.cost;\\n\\n rep(i,rt[st.id].size()){\\n E e = rt[st.id][i];\\n if(st.tm >= e.ft){\\n open.push(State(e.to,e.tt,st.cost+e.cost));\\n }\\n }\\n }\\n\\n REP(i,1,n){\\n int minCost = INT_MAX;\\n for(int j=1999;j>=0;j--){\\n if(closed[i][j] != -1){\\n minCost = min(minCost,closed[i][j]);\\n }\\n closed[i][j] = (minCost == INT_MAX ? -1 : minCost);\\n }\\n }\\n}\\n\\nint main(){\\n LEAVE = TimeToInt(\\\"08:00\\\");\\n BACK = TimeToInt(\\\"18:00\\\");\\n\\n while(cin>>m,m){\\n name.clear();\\n rep(i,102){\\n t[i].clear();\\n rt[i].clear();\\n }\\n\\n rep(i,m){\\n string from,to,ft,tt;\\n int cost;\\n cin>>from>>ft>>to>>tt>>cost;\\n\\n int fromID = NameToInt(from);\\n int toID = NameToInt(to);\\n int ft_int = TimeToInt(ft);\\n int tt_int = TimeToInt(tt);\\n\\n t[fromID].push_back(E(toID,ft_int,tt_int,cost));\\n rt[toID].push_back(E(fromID,tt_int,ft_int,cost));\\n }\\n\\n n = name.size() + 1;\\n A = NameToInt(\\\"Hakodate\\\");\\n B = NameToInt(\\\"Tokyo\\\");\\n\\n calCost(A,ac);\\n calCost(B,bc);\\n\\n calRevCost(A,r_ac);\\n calRevCost(B,r_bc);\\n\\n int ans = INT_MAX;\\n REP(i,1,n){\\n REP(atime,LEAVE,BACK+1){\\n if(ac[i][atime] == -1) continue;\\n REP(btime,LEAVE,BACK+1){\\n if(bc[i][btime] == -1) continue;\\n int maxTime = max(atime,btime);\\n if(r_ac[i][maxTime+30] == -1 || r_bc[i][maxTime+30] == -1) break;\\n ans = min(ans,ac[i][atime] + bc[i][btime] + r_ac[i][maxTime+30] + r_bc[i][maxTime+30]);\\n }\\n }\\n }\\n cout<<(ans == INT_MAX ? 0 : ans)<<endl;\\n\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 0,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1229_289502\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <string>\\n#include <cstring>\\n#include <map>\\n#include <queue>\\n\\nusing namespace std;\\n\\nint strToTime(string &s){\\n return atoi(s.substr(0,2).c_str())*60 + atoi(s.substr(3,2).c_str());\\n}\\n\\nstruct edge{\\n int cost;\\n int start;\\n int goal;\\n int to;\\n bool operator<(const edge &e)const{\\n return start>e.start;\\n }\\n};\\n\\nvector<edge> G[101];\\n\\nstruct Sit{\\n int cTime;\\n int cost;\\n int node;\\n\\n bool operator<(const Sit &s)const{\\n return cTime>s.cTime;\\n }\\n};\\n\\nconst int INF=1000000000;\\n\\nint backMinCost(int idx,int sTime,int snode);\\n\\nqueue<Sit> *pprv;\\nqueue<Sit> *nnxt;\\n\\nint main(){\\n pprv=new queue<Sit>();\\n nnxt=new queue<Sit>();\\n queue<Sit> *prv=new queue<Sit>();\\n queue<Sit> *nxt=new queue<Sit>();\\n\\n int n;\\n while(cin>>n&&n!=0){\\n for(int i = 0; i < 101; i++)G[i].clear();\\n map<string,vector<pair<int,int> > > startAndFinTimes;\\n map<string,int> stationIdx;\\n stationIdx[\\\"Tokyo\\\"]=0;\\n stationIdx[\\\"Hakodate\\\"]=1;\\n int idx=2;\\n for(int i = 0; i < n; i++){\\n string st,ft;\\n string s1,s2;\\n edge e;\\n cin>>s1>>st>>s2>>ft>>e.cost;\\n e.start=strToTime(st);\\n e.goal=strToTime(ft);\\n if(stationIdx.find(s1)==stationIdx.end())\\n stationIdx[s1]=idx++;\\n if(stationIdx.find(s2)==stationIdx.end())\\n stationIdx[s2]=idx++;\\n e.to=stationIdx[s2];\\n G[stationIdx[s1]].push_back(e);\\n }\\n for(int i = 0; i < 101; i++)sort(G[i].begin(),G[i].end());\\n\\n map<int,int> minCosts[2][101];\\n for(int i = 0; i < 2; i++){\\n Sit ss;\\n ss.cost=0;\\n ss.cTime=480;\\n ss.node=i;\\n prv->push(ss);\\n minCosts[i][ss.node][ss.cTime]=0;\\n while(prv->size()){\\n while(prv->size()){\\n Sit s=prv->front();prv->pop();\\n for(int ii = 0; ii < G[s.node].size(); ii++){\\n edge &e=G[s.node][ii];\\n // ÔÍÇñÇñ¬³ÈÁÄ¢ÌÅ\\n if(e.start<s.cTime)\\n break;\\n if(e.start>60*18||e.goal>60*18)\\n continue;\\n Sit ns=s;\\n ns.cost+=e.cost;\\n ns.cTime=e.goal;\\n ns.node=e.to;\\n if(minCosts[i][ns.node].find(ns.cTime)!=minCosts[i][ns.node].end()){\\n if(minCosts[i][ns.node][ns.cTime]>ns.cost){\\n minCosts[i][ns.node][ns.cTime]=ns.cost;\\n nxt->push(ns);\\n }\\n }\\n else{\\n minCosts[i][ns.node][ns.cTime]=ns.cost;\\n nxt->push(ns);\\n }\\n }\\n }\\n swap(prv,nxt);\\n }\\n }\\n int minCost=INF;\\n for(int i = 0; i < idx; i++){\\n for(map<int,int>::iterator it=minCosts[0][i].begin();it!=minCosts[0][i].end();it++){\\n for(map<int,int>::iterator iit=minCosts[1][i].begin();iit!=minCosts[1][i].end();iit++){\\n int sum=it->second+iit->second;\\n int nextStartTime=max(it->first,iit->first)+30;\\n int res=backMinCost(0,nextStartTime,i);\\n int res2=backMinCost(1,nextStartTime,i);\\n if(res!=INF&&res2!=INF){\\n sum+=res+res2;\\n minCost=min(minCost,sum);\\n }\\n }\\n }\\n }\\n if(minCost==INF)cout<<0<<endl;\\n else cout<<minCost<<endl;\\n }\\n delete prv;\\n delete nxt;\\n delete nnxt;\\n delete pprv;\\n return 0;\\n}\\n\\nint backMinCost(int idx,int sTime,int snode){\\n map<int,int> d[101];\\n Sit ss;\\n ss.cost=0;\\n ss.node=snode;\\n ss.cTime=sTime;\\n pprv->push(ss);\\n d[snode][ss.cTime]=ss.cost;\\n while(pprv->size()){\\n while(pprv->size()){\\n Sit s=pprv->front();pprv->pop();\\n for(int ii = 0; ii < G[s.node].size(); ii++){\\n edge &e=G[s.node][ii];\\n // ÔÍÇñÇñ¬³ÈÁÄ¢ÌÅ\\n if(e.start<s.cTime)\\n break;\\n if(e.start>60*18||e.goal>60*18)\\n continue;\\n Sit ns=s;\\n ns.cost+=e.cost;\\n ns.cTime=e.goal;\\n ns.node=e.to;\\n if(d[ns.node].find(ns.cTime)!=d[ns.node].end()){\\n if(d[ns.node][ns.cTime]>ns.cost){\\n d[ns.node][ns.cTime]=ns.cost;\\n nnxt->push(ns);\\n }\\n }\\n else{\\n d[ns.node][ns.cTime]=ns.cost;\\n nnxt->push(ns);\\n }\\n }\\n }\\n swap(pprv,nnxt);\\n }\\n int res=INF;\\n for(map<int,int>::iterator it=d[idx].begin();it!=d[idx].end();it++)\\n res=min(res,it->second);\\n return res;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6760,\n \"memory_kb\": 1064,\n \"score_of_the_acc\": -1.0328,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1229_90969\",\n \"code_snippet\": \"#include<iostream>\\n#include<queue>\\n#include<vector>\\n#include<algorithm>\\n#include<map>\\nusing namespace std;\\n#define REP(i,b,n) for(int i=b;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define ALL(C) (C).begin(),(C).end()\\n#define pb push_back\\n#define mp make_pair\\n\\nconst int N = 100;\\nconst int inf = (1 << 28);\\n\\nclass Edge{\\npublic:\\n int sh,sm,dh,dm;\\n int d;\\n int cost;\\n};\\n\\nclass state{\\npublic:\\n int now,h,m;\\n int cost;\\n bool operator<(const state & a)const{\\n return cost > a.cost;\\n }\\n};\\n\\nbool isless(int h,int m,int nh,int nm){\\n if (h < nh)return true;\\n else if (h == nh && m <= nm)return true;\\n return false;\\n}\\n\\nbool isgreater(int h,int m,int nh,int nm){\\n if (h > nh)return true;\\n else if (h == nh && m >= nm)return true;\\n return false;\\n}\\n\\nvoid dijkstra(int n,int s,vector<Edge>*edge,int cost[24][60][N],\\n\\t bool isrev){\\n rep(i,24)rep(j,60)rep(k,n)cost[i][j][k]=inf;\\n priority_queue<state> Q;\\n if (isrev)Q.push((state){s,17,59,0});\\n else Q.push((state){s,8,0,0});\\n\\n while(!Q.empty()){\\n state now = Q.top();Q.pop();\\n if (cost[now.h][now.m][now.now] != inf)continue;\\n cost[now.h][now.m][now.now]=now.cost;\\n rep(i,edge[now.now].size()){\\n if (isrev){\\n\\tif (isgreater(now.h,now.m,edge[now.now][i].sh,edge[now.now][i].sm))\\n\\t Q.push((state){edge[now.now][i].d,edge[now.now][i].dh,\\n\\t\\t\\t edge[now.now][i].dm,\\n\\t\\t\\t now.cost+edge[now.now][i].cost});\\n }else {\\n\\tif (isless(now.h,now.m,edge[now.now][i].sh,edge[now.now][i].sm))\\n\\t Q.push((state){edge[now.now][i].d,edge[now.now][i].dh,\\n\\t\\t\\t edge[now.now][i].dm,\\n\\t\\t\\t now.cost+edge[now.now][i].cost});\\n }\\n }\\n }\\n\\n\\n if (isrev){\\n rep(k,100){\\n int tmp = inf;\\n for(int i=17;i>=6;i--){\\n\\tfor(int j=59;j>=0;j--){\\n\\t cost[i][j][k]=min(cost[i][j][k],tmp);\\n\\t tmp=min(cost[i][j][k],tmp);\\n\\t}\\n }\\n }\\n }else {\\n rep(k,100){\\n int tmp = inf;\\n rep(i,24){\\n\\trep(j,60){\\n\\t cost[i][j][k]=min(cost[i][j][k],tmp);\\n\\t tmp=min(tmp,cost[i][j][k]);\\n\\t}\\n }\\n }\\n }\\n}\\n\\n//from tokyo,from hakodate, to tokyo,to hakodate\\nint ft[24][60][N],fh[24][60][N],tt[24][60][N],th[24][60][N];\\nint solve(int n,int hakodate,int tokyo,vector<Edge>*edge,\\n\\t vector<Edge>*revedge){\\n\\n\\n dijkstra(n,tokyo,edge,ft,false);\\n dijkstra(n,hakodate,edge,fh,false);\\n dijkstra(n,tokyo,revedge,tt,true);\\n dijkstra(n,hakodate,revedge,th,true);\\n\\n \\n int ret = inf;\\n rep(k,n){\\n int tmp = inf;\\n REP(i,8,18){\\n rep(j,30){\\n\\ttmp=min(tmp,ft[i][j][k]+fh[i][j][k]+tt[i][j+30][k]+th[i][j+30][k]);\\n }\\n REP(j,30,60){\\n\\ttmp=min(tmp,ft[i][j][k]+fh[i][j][k]+tt[i+1][(j+30)%60][k]+th[i+1][(j+30)%60][k]);\\n }\\n }\\n ret=min(ret,tmp);\\n }\\n return ret;\\n}\\n\\n\\nint getnum(string &a,map<string,int> & M){\\n int index=M.size();\\n if (M.find(a) == M.end())M[a]=index;\\n return M[a];\\n}\\n\\nmain(){\\n int n;\\n vector<Edge> edge[N];\\n vector<Edge> rev[N];\\n const string name[2]={\\\"Hakodate\\\",\\\"Tokyo\\\"};\\n while(cin>>n && n){\\n rep(i,N)edge[i].clear(),rev[i].clear();\\n map<string,int> M;\\n\\n string from,to;\\n int f,t;\\n int sh,sm,dh,dm;\\n int cost;\\n char dummy;\\n rep(i,n){\\n cin>>from>>sh>>dummy>>sm;\\n cin>>to>>dh>>dummy>>dm;\\n cin>>cost;\\n f=getnum(from,M);\\n t=getnum(to,M);\\n edge[f].pb((Edge){sh,sm,dh,dm,t,cost});\\n rev[t].pb((Edge){dh,dm,sh,sm,f,cost});\\n }\\n\\n \\n int ans = solve(M.size(),M[name[0]],M[name[1]],edge,rev);\\n if (ans == inf)cout <<0<<endl;\\n else cout << ans << endl;\\n\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3392,\n \"score_of_the_acc\": -0.1059,\n \"final_rank\": 3\n }\n]","isConversational":false}}},{"rowIdx":689,"cells":{"group_id":{"kind":"string","value":"aoj_1228_cpp"},"problem_description":{"kind":"string","value":"Problem E:\nBeehives\nTaro and Hanako, students majoring in biology, have been engaged long in observations of beehives. Their interest is in finding any egg patterns laid by queen bees of a specific wild species. A queen bee is said to lay a batch ofeggs in a short time. Taro and Hanako have never seen queen bees laying eggs. Thus, every time they find beehives, they find eggs just laid in hive cells.\nTaro and Hanako have a convention to record an egg layout.. they assume the queen bee lays eggs, moving from one cell to an adjacent cell along a path containing no cycles. They record the path of cells with eggs. There is no guarantee in biology for them to find an acyclic path in every case. Yet they have never failed to do so in their observations.\nThere are only six possible movements from a cell to an adjacent one, and they agree to write down those six by letters a, b, c, d, e, and f ounterclockwise as shown in Figure 2. Thus the layout in Figure 1 may be written down as \"faafd\".\nTaro and Hanako have investigated beehives in a forest independently. Each has his/her own way to approach beehives, protecting oneself from possible bee attacks.\nThey are asked to report on their work jointly at a conference, and share their own observation records to draft a joint report. At this point they find a serious fault in their convention. They have never discussed which direction, in an absolute sense, should be taken as \"a\", and thus Figure 2 might be taken as, e.g., Figure 3 or Figure 4. The layout shown in Figure 1 may be recorded differently, depending on the direction looking at the beehive and the path assumed: \"bcbdb\" with combination of Figure 3 and Figure 5, or \"bccac\" with combination of Figure 4 and Figure 6.\nA beehive can be observed only from its front side and never from its back, so a layout cannot be confused with its mirror image.\nSince they may have observed the same layout independently, they have to find duplicated records in their observations (Of course, they do not record the exact place and the exact time of each observation). Your mission is to help Taro and Hanako by writing a program that checks whether two observation records are made from the same layout.\nInput\nThe input starts with a line containing the number of record pairs that follow. The number is given with at most three digits.\nEach record pair consists of two lines of layout records and a line containing a hyphen. Each layout record consists of a sequence of letters a, b, c, d, e, and f. Note that a layout record may be an empty sequence if a queen bee laid only one egg by some reason. You can trust Taro and Hanako in that any of the paths in the input does not force you to visit any cell more than once. Any of lines in the input contain no characters other than those described above, and contain at most one hundred characters.\nOutput\nFor each pair of records, produce a line containing either \"\ntrue\n\" or \"\nfalse\n\": \"\ntrue\n\" if the two records represent the same layout, \n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1228_2649936","code_snippet":"#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\n#include <time.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\nstring line;\n\nstruct Info{\n\tInfo(int arg_row,int arg_col){\n\t\trow = arg_row;\n\t\tcol = arg_col;\n\t}\n\tint row,col;\n};\n\nchar buf1[101],buf2[101],buf3[101];\nbool table1[201][201],table2[201][201];\nint len_1,len_2,start_row = 100,start_col = 100,G[128];\nint diff_row[6] = {1,1,0,-1,-1,0},diff_col[6] = {0,-1,-1,0,1,1};\nint loc[6][6] = {{0,1,2,3,4,5},{1,2,3,4,5,0},{2,3,4,5,0,1},{3,4,5,0,1,2},{4,5,0,1,2,3},{5,0,1,2,3,4}};\nvector<Info> V;\n\nvoid func(){\n\n\tgetchar();\n\tgetline(cin,line);\n\tfor(len_1 = 0; len_1 != line.length(); len_1++){\n\t\tbuf1[len_1] = line[len_1];\n\t}\n\tbuf1[len_1] = '\\0';\n\n\tgetline(cin,line);\n\tfor(len_2 = 0; len_2 != line.length(); len_2++){\n\t\tbuf2[len_2] = line[len_2];\n\t}\n\tbuf2[len_2] = '\\0';\n\tscanf(\"%s\",buf3);\n\n\tfor(len_1 = 0; buf1[len_1] != '\\0'; len_1++);\n\tfor(len_2 = 0; buf2[len_2] != '\\0'; len_2++);\n\n\tif(len_1 != len_2){\n\t\tprintf(\"false\\n\");\n\t\treturn;\n\t}else if(len_1 == 0 && len_2 == 0){\n\t\tprintf(\"true\\n\");\n\t\treturn;\n\t}\n\n\tfor(int row = 0; row <= 200; row++){\n\t\tfor(int col = 0; col <= 200; col++){\n\t\t\ttable1[row][col] = false;\n\t\t\ttable2[row][col] = false;\n\t\t}\n\t}\n\n\tV.clear();\n\n\tint tmp_row = start_row,tmp_col = start_col,tmp;\n\ttable1[start_row][start_col] = true;\n\tV.push_back(Info(start_row,start_col));\n\n\tfor(int i = 0; i < len_1; i++){\n\t\ttmp = G[buf1[i]];\n\t\ttmp_row += diff_row[tmp];\n\t\ttmp_col += diff_col[tmp];\n\t\ttable1[tmp_row][tmp_col] = true;\n\t\tV.push_back(Info(tmp_row,tmp_col));\n\t}\n\n\tbool FLG;\n\tvector<Info> X;\n\n\tfor(int loop = 0; loop < V.size(); loop++){\n\n\t\tfor(int k = 0; k < 6; k++){\n\n\t\t\tfor(int i = 0; i < X.size(); i++){\n\t\t\t\ttable2[X[i].row][X[i].col] = false;\n\t\t\t}\n\t\t\tX.clear();\n\n\t\t\ttmp_row = V[loop].row;\n\t\t\ttmp_col = V[loop].col;\n\t\t\ttable2[tmp_row][tmp_col] = true;\n\t\t\tX.push_back(Info(tmp_row,tmp_col));\n\n\t\t\tFLG = true;\n\t\t\tfor(int i = 0; i < len_2; i++){\n\n\t\t\t\ttmp = loc[k][G[buf2[i]]];\n\t\t\t\ttmp_row += diff_row[tmp];\n\t\t\t\ttmp_col += diff_col[tmp];\n\t\t\t\tif(table1[tmp_row][tmp_col] == false){\n\t\t\t\t\tFLG = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\ttable2[tmp_row][tmp_col] = true;\n\t\t\t\tX.push_back(Info(tmp_row,tmp_col));\n\t\t\t}\n\t\t\tif(!FLG)continue;\n\n\t\t\tfor(int i = 0; i < V.size(); i++){\n\t\t\t\tif(table2[V[i].row][V[i].col] == false){\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\tprintf(\"true\\n\");\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"false\\n\");\n}\n\n\nint main(){\n\n\tint case_num;\n\tscanf(\"%d\",&case_num);\n\n\tG['a'] = 0;\n\tG['b'] = 1;\n\tG['c'] = 2;\n\tG['d'] = 3;\n\tG['e'] = 4;\n\tG['f'] = 5;\n\n\tfor(int i = 0; i < case_num; i++)func();\n\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3324,"score_of_the_acc":-0.4711,"final_rank":17},{"submission_id":"aoj_1228_2548403","code_snippet":"#include <bits/stdc++.h>\n \nusing namespace std;\n \nconst int dx[] = {0, 1, 1, 0, -1, -1};\nconst int dy[] = {-1, 0, 1, 1, 0, -1};\n \nusing Point = pair<int, int>;\n \nint main() {\n int T;\n cin >> T;\n cin.ignore(); \n while(T--) {\n string s, t, sp; \n //cin >> s >> t >> sp;\n getline(cin, s);\n getline(cin, t);\n getline(cin, sp);\n if(s.size() != t.size()) {\n cout << \"false\" << endl;\n continue;\n }\n int x = 0, y = 0;\n set<Point> vis;\n vis.insert(Point(0, 0));\n for(char c : s) {\n int k = c-'a';\n x += dx[k], y += dy[k];\n vis.insert(Point(x, y));\n }\n for(int i = 0; i < 6; i++) {\n for(Point p : vis) {\n set<Point> st;\n int x = p.first, y = p.second;\n st.insert(Point(x, y));\n for(char c : t) {\n int k = c-'a';\n x += dx[(k+i)%6], y += dy[(k+i)%6];\n if(!vis.count(Point(x, y))) {\n break;\n } else {\n st.insert(Point(x, y));\n }\n }\n if(st == vis) {\n cout << \"true\" << endl;\n goto end;\n }\n }\n }\n cout << \"false\" << endl;\n end: ;\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3156,"score_of_the_acc":-0.4605,"final_rank":15},{"submission_id":"aoj_1228_2548382","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<n;i++)\nusing namespace std;\nstring s,t;\nint n;\nint dy1[6]={1,1,0,-1,-1,0};\nint dx1[6]={0,-1,-1,0,1,1};\nint dy2[6]={-1,-1,0,1,1,0};\nint dx2[6]={0,1,1,0,-1,-1};\nbool b[1000][1000];\nbool c[1000][1000];\nmain(){\n cin>>n;\n while(n--){\n memset(b,0,sizeof(b));\n cin>>s;\n if(s==\"-\"){\n cout<<\"true\"<<endl;\n continue;\n }\n int y=500,x=500;\n b[y][x]=1;\n vector<int>X,Y;\n X.push_back(x);\n Y.push_back(y);\n rep(i,s.size()){\n x+=dx1[s[i]-'a'];\n y+=dy1[s[i]-'a'];\n b[y][x]=1;\n X.push_back(x);\n Y.push_back(y);\n }\n cin>>t;\n if(t==\"-\"){\n cout<<\"false\"<<endl;\n continue;\n }\n rep(i,2){\n rep(j,6){\n rep(l,X.size()){\n int f=0,y=Y[l],x=X[l];\n rep(k,t.size()){\n if(i){\n x+=dx2[(t[k]-'a'+j)%6];\n y+=dy2[(t[k]-'a'+j)%6];\n }else{\n x+=dx1[(t[k]-'a'+j)%6];\n y+=dy1[(t[k]-'a'+j)%6];\n }\n if(b[y][x])f++;\n }\n if(f==t.size())goto L;\n }\n }\n reverse(t.begin(),t.end());\n }\n cout<<\"false\"<<endl;\n if(0){L:;cout<<\"true\"<<endl;}\n cin>>s;\n }\n}","accuracy":1,"time_ms":50,"memory_kb":4140,"score_of_the_acc":-0.6132,"final_rank":18},{"submission_id":"aoj_1228_2548240","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int dx[] = {0, 1, 1, 0, -1, -1};\nconst int dy[] = {-1, 0, 1, 1, 0, -1};\n\nusing Point = pair<int, int>;\n\nint main() {\n int T;\n cin >> T;\n cin.ignore(); \n while(T--) {\n string s, t, sp; \n //cin >> s >> t >> sp;\n getline(cin, s);\n getline(cin, t);\n getline(cin, sp);\n if(s.size() != t.size()) {\n cout << \"false\" << endl;\n continue;\n }\n int x = 0, y = 0;\n set<Point> vis;\n vis.insert(Point(0, 0));\n for(char c : s) {\n int k = c-'a';\n x += dx[k], y += dy[k];\n vis.insert(Point(x, y));\n }\n for(int i = 0; i < 6; i++) {\n for(Point p : vis) {\n\tset<Point> st;\n\tint x = p.first, y = p.second;\n\tst.insert(Point(x, y));\n\tfor(char c : t) {\n\t int k = c-'a';\n\t x += dx[(k+i)%6], y += dy[(k+i)%6];\n\t if(!vis.count(Point(x, y))) {\n\t break;\n\t } else {\n\t st.insert(Point(x, y));\n\t }\n\t}\n\tif(st == vis) {\n\t cout << \"true\" << endl;\n\t goto end;\n\t}\n }\n }\n cout << \"false\" << endl;\n end: ;\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3172,"score_of_the_acc":-0.4694,"final_rank":16},{"submission_id":"aoj_1228_2548097","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nint dy[6]={1,1,0,-1,-1,0};\nint dx[6]={0,-1,-1,0,1,1};\n\nint base[1000][1000];\nint cnum[300];\nchar cc[300];\n\nint main(){\n\n cnum['a']=0;\n cnum['b']=1;\n cnum['c']=2;\n cnum['d']=3;\n cnum['e']=4;\n cnum['f']=5;\n \n cc['a']='d';\n cc['b']='e';\n cc['c']='f';\n cc['d']='a';\n cc['e']='b';\n cc['f']='c';\n \n int n;\n\n cin>>n;\n \n while(n--){\n \n string s;\n string t;\n \n cin>>s;\n \n if(s==\"-\"){\n cout<<\"true\"<<endl;\n continue;\n }\n\n vector<int> X, Y;\n \n int y=500, x=500;\n\n memset(base,0,sizeof(base));\n\n base[y][x]=1;\n X.push_back(x);\n Y.push_back(y);\n \n for(int i=0;i<s.size();i++){\n \n y+=dy[cnum[s[i]]];\n x+=dx[cnum[s[i]]];\n\n base[y][x]=1;\n X.push_back(x);\n Y.push_back(y);\n }\n\n cin>>t;\n \n if(t==\"-\"){\n cout<<\"false\"<<endl;\n continue;\n }\n \n bool ans=false;\n \n for(int T=0;T<X.size();T++){\n \n for(int i=0;i<6;i++){\n\n\t\n\tint flag=0;\n\n\ty=Y[T], x=X[T];\n \n\tfor(int j=0;j<t.size();j++){\n \n\t y+=dy[(cnum[t[j]]+i)%6];\n\t x+=dx[(cnum[t[j]]+i)%6];\n\t\n\t if(!base[y][x]) flag=1;\n\t}\n \n\tif(!flag) ans=true;\n \n }\n\n reverse(t.begin(),t.end());\n \n for(int i=0;i<6;i++){\n \n\tint flag=0;\n \n\ty=Y[T], x=X[T];\n\t\n\tfor(int j=0;j<t.size();j++){\n\t\n\t y+=dy[(cnum[cc[t[j]]]+i)%6];\n\t x+=dx[(cnum[cc[t[j]]]+i)%6];\n\t\n\t if(!base[y][x]) flag=1;\n\t}\n\n\tif(!flag) ans=true;\n \n }\n \n reverse(t.begin(),t.end());\n\n }\n \n if(s.size()!=t.size()) ans=false;\n\n if(ans) cout<<\"true\"<<endl;\n else cout<<\"false\"<<endl;\n \n cin>>s;\n }\n \n return 0;\n}","accuracy":1,"time_ms":130,"memory_kb":7056,"score_of_the_acc":-1.0795,"final_rank":19},{"submission_id":"aoj_1228_1828590","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef pair<int,int> P;\nvector<int> ss(string&s ){\n vector<int> v;\n for(int i=0;i<(int)s.size();i++){\n v.push_back( s[i] - 'a' );\n }\n return v;\n}\n\nint dx[2][6]={ {0,-1,-1,0,1,1},\n {0,1,1,0,-1,-1} };\nint dy[2][6]={ {1,1,0,-1,-1,0},\n {1,0,-1,-1,0,1} };\n\nvoid dfs(int x,int y,int c,int k,const vector<int>& v,set<P> &s){\n s.insert(P(x,y));\n if( c == (int)v.size() ) return;\n int d = (v[c]+k)%6;\n dfs( x + dx[0][d], y + dy[0][d], c+1, k, v, s );\n}\n\nbool eq(const set<P>& a, const set<P>& b){\n if(a.size() != b.size() ) return false;\n for( auto x = a.begin(), y = b.begin(); x != a.end() || y != b.end(); x++, y++ )\n if( *x != *y ) return false;\n return true;\n}\n\nvoid view(const set<P> &s ){\n for( auto x : s ){\n cout << x.first << \" \" <<x.second << endl;\n }\n}\n\nint main(){\n\n int T;\n cin >> T;\n getchar();\n while(T--){\n string S1,S2; \n getline(cin,S1);\n getline(cin,S2);\n vector<int> v1 = ss( S1 ), v2 = ss( S2 );\n getline(cin,S1); \n bool f = false;\n for(int i=0;i<6;i++){\n set<P> s1;\n dfs( 0,0,0,i,v1,s1 );\n //cout << \"s1------------- \"<< endl;\n // view(s1);\n for(int j=0;j<6;j++){\n for( auto ps : s1 ){\n set<P> s2;\n dfs(ps.first,ps.second,0,j,v2,s2);\n //cout << \"s2 \"<< endl;\n //view(s2);\n if( eq(s1, s2) ) {\n //cout << \"ok---------\" << endl;\n f = true;\n }\n }\n } \n }\n if( f ) cout << \"true\" << endl;\n else cout << \"false\" << endl;\n }\n}","accuracy":1,"time_ms":1520,"memory_kb":3140,"score_of_the_acc":-1.445,"final_rank":20},{"submission_id":"aoj_1228_1828466","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef vector<int> vec;\ntypedef vector<vec> mat;\n\nvoid pr(mat a){\n int h=a.size(),w=a[0].size();\n for(int i=0;i<h;i++){\n for(int j=0;j<w;j++){\n cout<<a[i][j];\n }\n cout<<endl;\n }\n cout<<endl;\n}\n\n\nmat cut(mat a){\n \n int h=a.size(),w=a[0].size();\n int ay=1e9,ax=1e9,by=0,bx=0;\n for(int i=0;i<h;i++)\n for(int j=0;j<w;j++)\n if(a[i][j]!=0){\n ay=min(ay,i);\n ax=min(ax,j);\n by=max(by,i);\n bx=max(bx,j);\n }\n \n mat res=mat(by-ay+1,vec(bx-ax+1));\n for(int y=ay;y<=by;y++)\n for(int x=ax;x<=bx;x++)\n res[y-ay][x-ax]=a[y][x];\n return res;\n}\n\n\nint main(){\n int Tc;cin>>Tc;\n cin.ignore();\n while(Tc--){\n\n int F;\n string s;\n getline(cin,s);\n \n F=s.size()+2;\n int py=F,px=F;\n mat A(F+F,vec(F+F,0));\n A[py][px]=1;\n for(int i=0;i<(int)s.size();i++){\n if(s[i]=='a')px++;\n if(s[i]=='b')py--;\n if(s[i]=='c')py--,px--;\n if(s[i]=='d')px--;\n if(s[i]=='e')py++;\n if(s[i]=='f')py++,px++;\n A[py][px]=1;\n }\n A=cut(A);\n\n getline(cin,s);\n bool ans=false;\n for(int T=0;T<6;T++){\n F=s.size()+2;\n mat B(F+F,vec(F+F,0));\n py=F,px=F;\n B[py][px]=1;\n \n for(int i=0;i<(int)s.size();i++){\n if(s[i]=='a')px++,s[i]='b';\n else if(s[i]=='b')py--,s[i]='c';\n else if(s[i]=='c')py--,px--,s[i]='d';\n else if(s[i]=='d')px--,s[i]='e';\n else if(s[i]=='e')py++,s[i]='f';\n else if(s[i]=='f')py++,px++,s[i]='a';\n B[py][px]=1;\n }\n\n B=cut(B);\n if(A==B)ans=true;\n }\n cout<< (ans?\"true\":\"false\") <<endl;\n string tmp;\n getline(cin,tmp);\n assert(tmp==\"-\");\n\n }\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":1532,"score_of_the_acc":-0.2635,"final_rank":13},{"submission_id":"aoj_1228_1130939","code_snippet":"#include<stdio.h>\n#include<algorithm>\n#include<vector>\nusing namespace std;\nchar str[1100];\nint dx[]={1,1,0,-1,-1,0};\nint dy[]={0,1,1,0,-1,-1};\n\nint main(){\n\tint a;scanf(\"%d\",&a);\n\tgets(str);\n\twhile(a--){\n\t\tgets(str);\n\t\tvector<pair<int,int> >v;\n\t\tint r=0;int c=0;\n\t\tv.push_back(make_pair(0,0));\n\t\tfor(int i=0;str[i];i++){\n\t\t\tr+=dx[str[i]-'a'];\n\t\t\tc+=dy[str[i]-'a'];\n\t\t\tv.push_back(make_pair(r,c));\n\t\t}\n\t\tstd::sort(v.begin(),v.end());\n\t\tgets(str);\n\t\tint ret=0;\n\t\tfor(int i=0;i<6;i++){\n\t\t\tfor(int t=0;t<v.size();t++){\n\t\t\t\tvector<pair<int,int> >w;\n\t\t\t\tint nr=v[t].first;int nc=v[t].second;\n\t\t\t\tw.push_back(make_pair(nr,nc));\n\t\t\t\tfor(int j=0;str[j];j++){\n\t\t\t\t\tnr+=dx[(str[j]-'a'+i)%6];\n\t\t\t\t\tnc+=dy[(str[j]-'a'+i)%6];\n\t\t\t\t\tw.push_back(make_pair(nr,nc));\n\t\t\t\t}\n\t\t\t\tstd::sort(w.begin(),w.end());\n\t\t\t\tbool ok=true;\n\t\t\t\tif(v.size()!=w.size())continue;\n\t\t\t\tfor(int j=0;j<v.size();j++){\n\t\t\t\t\tif(v[j].first!=w[j].first||v[j].second!=w[j].second)ok=false;\n\t\t\t\t}\n\t\t\t\tif(ok){ret=1;break;}\n\t\t\t}\n\t\t\tif(ret)break;\n\t\t}\n\t\tif(ret)printf(\"true\\n\");\n\t\telse printf(\"false\\n\");\n\t\tgets(str);\n\t}\n}","accuracy":1,"time_ms":150,"memory_kb":1012,"score_of_the_acc":-0.2361,"final_rank":12},{"submission_id":"aoj_1228_1053417","code_snippet":"#include<iostream>\n#include<set>\n#include<vector>\n#include<iterator>\n#include<utility>\n#include<algorithm>\n#include<cstdio>\n#include<string>\n\nusing namespace std;\n\nint main(){\n int T;\n cin>>T;\n cin.ignore(1);\n while(T--){\n set<set<pair<int,int> > >ss[2];\n for(int i=0;i<2;i++){\n string str;\n getline(cin,str);\n for(int j=0;j<6;j++){\n\tset<pair<int,int> > s;\n\tint y=0,x=0;\n\tfor(int k=0;;k++){\n\t s.insert(make_pair(x,y)).second;\n\t if(k==str.size())break;\n\t static int dy[]={-1,-1,0,1,1,0};\n\t static int dx[]={0,-1,-1,0,1,1};\n\t int idx=(j+str[k]-'a')%6;\n\t y+=dy[idx];\n\t x+=dx[idx];\n\t}\n\tint mx=999,my=999;\n\tfor(auto e:s){\n\t mx=min(mx,e.first);\n\t my=min(my,e.second);\n\t}\n\tset<pair<int,int> > ns;\n\tfor(auto e:s){\n\t ns.insert(make_pair(e.first-mx,e.second-my));\n\t}\n\tss[i].insert(ns);\n }\n } \n cin.ignore(2);\n vector<set<pair<int,int> > > v;\n set_intersection(begin(ss[0]),end(ss[0]),begin(ss[1]),end(ss[1]),back_inserter(v));\n cout<<boolalpha<<(!v.empty())<<endl;\n }\n}","accuracy":1,"time_ms":60,"memory_kb":1276,"score_of_the_acc":-0.214,"final_rank":11},{"submission_id":"aoj_1228_955482","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <string>\n#include <vector>\n#include <set>\n\nusing namespace std;\n\nint dx[] = {-1, -1, 0, 1, 1, 0};\nint dy[] = {-1, 0, 1, 1, 0, -1};\n\nvector<pair<int, int>> make_set(string &s, int i){\n\tvector<pair<int, int>> ret;\n\tauto pos = make_pair(0, 0);\n\n\tret.push_back(pos);\n\tfor (auto c : s){\n\t\tpos.first += dx[(c - 'a' + i) % 6];\n\t\tpos.second += dy[(c - 'a' + i) % 6];\n\t\tret.push_back(pos);\n\t}\n\tsort(ret.begin(), ret.end());\n\treturn ret;\n}\n\nbool check(string &s, string &t){\n\tvector<pair<int, int>> s1 = make_set(s, 0);\n\tvector<vector<pair<int, int>>> s2(6);\n\tfor (int i = 0; i < 6; ++i) s2[i] = make_set(t, i);\n\n\tfor (auto p : s1){\n\t\tfor (int i = 0; i < 6; ++i){\n\t\t\tbool ok = true;\n\t\t\tfor (int j = 0; j < s1.size(); ++j){\n\t\t\t\tint x = s1[j].first - p.first;\n\t\t\t\tint y = s1[j].second - p.second;\n\t\t\t\tif (make_pair(x, y) != s2[i][j]) ok = false;\n\t\t\t}\n\n\t\t\tif (ok) return true;\n\t\t}\n\t}\n\treturn false;\n}\n\nint main(){\n\tint n;\n\tcin >> n;\n\tcin.ignore();\n\tfor (int i = 0; i < n; ++i){\n\t\tstring s, t, u;\n\t\tgetline(cin, s);\n\t\tgetline(cin, t);\n\t\tgetline(cin, u);\n\t\tif (s.size() == t.size() && check(s, t)) cout << \"true\" << '\\n';\n\t\telse cout << \"false\" << '\\n';\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1208,"score_of_the_acc":-0.1778,"final_rank":7},{"submission_id":"aoj_1228_920121","code_snippet":"#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n\n#include <iostream>\n#include <cstdio>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cctype>\n#include <utility>\n \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <int,int> P;\ntypedef pair <int,P> PP;\n \nstatic const double EPS = 1e-8;\n\npair<int,int> maja(int x) {\n if (x == 0) return pair<int,int>(0,0);\n int n = static_cast<int>(ceil((-1.0+sqrt(1.0+4.0/3.0*x))/2.0));\n int a = 3*n*(n-1), d = static_cast<int>(ceil((1.0*x-a)/n-1.0));\n int k = x - a - n * d;\n switch (d) {\n case 0: return pair<int,int>(n-k,k);\n case 1: return pair<int,int>(-k,n);\n case 2: return pair<int,int>(-n,n-k);\n case 3: return pair<int,int>(-n+k,-k);\n case 4: return pair<int,int>(k,-n);\n case 5: return pair<int,int>(n,-n+k);\n }\n}\n\nint majadist(const pair<int,int> &a, const pair<int,int> &b) {\n int dx = abs(a.first - b.first);\n int dy = abs(a.second - b.second);\n int dz = abs(a.first+a.second-b.first-b.second);\n return min(dx+dy, min(dx+dz, dy+dz));\n}\n\nint main(){\n string strN;\n \n int char2num[256];\n char2num['f'] = 1;\n char2num['e'] = 2;\n char2num['d'] = 3;\n char2num['c'] = 4;\n char2num['b'] = 5;\n char2num['a'] = 6;\n int chars[] = {'f','e','d','c','b','a'};\n\n while(getline(cin,strN)){\n int N = atoi(strN.c_str());\n \n for(int i=0;i<N;i++){\n string routes[2];\n map<pair<int,int>,bool> visited[2][6];\n\n for(int person=0;person<2;person++){\n\tgetline(cin,routes[person]);\n\n\tfor(int offset=0;offset< 6;offset++){\n\t for(int char_idx=0;char_idx<6;char_idx++){\n\t char2num[chars[char_idx]]\n\t = (char_idx + offset) % 6 + 1;\t \n\t } \n\t pair<int,int> current(0,0);\n\t visited[person][offset][current] = true;\n\n\t for(int k=0;k<routes[person].size();k++){\n\t current.first \n\t += maja(char2num[routes[person][k]]).first;\n\t current.second \n\t += maja(char2num[routes[person][k]]).second;\n\t // cout << \"x: \" << current.first;\n\t // cout << \" y: \" << current.second << endl;\n\t visited[person][offset][current] = true;\n\t }\n\t}\n }\n\t\n string garbage;\n getline(cin,garbage);\n\n bool res = false;\n for(int src_offset=0;src_offset< 6;src_offset++){\n\tfor(int dst_offset=0;dst_offset< 6;dst_offset++){\n\t int offset_x\n\t = visited[1][dst_offset].begin()->first.first\n\t - visited[0][src_offset].begin()->first.first;\n\t int offset_y\n\t = visited[1][dst_offset].begin()->first.second\n\t - visited[0][src_offset].begin()->first.second;\n\n\t bool isok = true;\n\t for(map<pair<int,int>,bool>::iterator it = visited[0][src_offset].begin();\n\t it != visited[0][src_offset].end();\n\t it++){\n\t pair<int,int> moved(it->first.first+offset_x,\n\t\t\t\tit->first.second+offset_y);\n\t if(visited[1][dst_offset].find(moved) == visited[1][dst_offset].end()){\n\t isok = false;\n\t break;\n\t }\n\t }\n\t res |= isok;\n\t}\n }\n printf(\"%s\\n\",res ? \"true\" : \"false\");\n }\n }\n}","accuracy":1,"time_ms":50,"memory_kb":1260,"score_of_the_acc":-0.2051,"final_rank":10},{"submission_id":"aoj_1228_794805","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <algorithm>\n#include <vector>\nusing namespace std;\n \nint dx[] = {0, -1, -1, 0, 1, 1};\nint dy[] = {-1, -1, 0, 1, 1, 0};\n\ntypedef pair<int, int> P; \n\nvector<P> move(int d, vector<int> m){\n int x = 0, y = 0;\n int mx = 0, my = 0;\n vector<P> path;\n path.push_back(P(0, 0));\n for(int i = 0 ; i < (int)m.size() ; i++){\n x += dx[ (m[i]+d)%6 ] ,y += dy[ (m[i]+d)%6 ];\n mx = min(mx, x), my = min(my, y);\n path.push_back(P(x, y));\n }\n sort(path.begin(), path.end());\n for(int i = 0 ; i < (int)path.size() ; i++){\n path[i].first -= mx, path[i].second -= my;\n }\n return path;\n}\n\nbool solve(vector<int> m1, vector<int> m2){\n vector<P> path1 = move(0, m1);\n \n for(int i = 0 ; i < 6 ; i++){\n vector<P> path2 = move(i, m2);\n if(path1 == path2) return true;\n }\n return false;\n}\nint main(){\n int n;\n cin >> n;\n cin.ignore();\n string s1, s2, tmp;\n for(int i = 0 ; i < n ; i++){\n getline(cin, s1);\n getline(cin, s2);\n getline(cin, tmp);\n \n vector<int> m1, m2;\n for(int i = 0 ; i < (int)s1.size() ; i++) m1.push_back(s1[i]-'a');\n for(int i = 0 ; i < (int)s2.size() ; i++) m2.push_back(s2[i]-'a');\n \n if(solve(m1, m2)) cout << \"true\" << endl;\n else cout << \"false\" << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1232,"score_of_the_acc":-0.1746,"final_rank":6},{"submission_id":"aoj_1228_794765","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <algorithm>\n#include <vector>\nusing namespace std;\n \nint dx[] = {0, -1, -1, 0, 1, 1};\nint dy[] = {-1, -1, 0, 1, 1, 0};\n\ntypedef pair<int, int> P; \n\nint main(){\n int n;\n cin >> n;\n cin.ignore();\n string s1, s2, tmp;\n for(int i = 0 ; i < n ; i++){\n getline(cin, s1);\n getline(cin, s2);\n getline(cin, tmp);\n \n vector<int> m1, m2;\n for(int i = 0 ; i < (int)s1.size() ; i++) m1.push_back(s1[i]-'a');\n for(int i = 0 ; i < (int)s2.size() ; i++) m2.push_back(s2[i]-'a');\n \n vector<P> path1;\n int x1 = 0, y1 = 0; \n int mx1 = 0, my1 = 0;\n path1.push_back(P(0, 0));\n for(int i = 0 ; i < (int)m1.size() ; i++){\n x1 += dx[ m1[i] ];\n y1 += dy[ m1[i] ];\n path1.push_back(P(x1, y1));\n mx1 = min(mx1, x1);\n my1 = min(my1, y1); \n }\n for(int i = 0 ; i < path1.size() ; i++){\n path1[i].first -= mx1;\n path1[i].second -= my1;\n }\n sort(path1.begin(), path1.end()); \n \n bool flag = false; \n for(int i = 0 ; i < 6 ; i++){\n int x2 = 0, y2 = 0;\n int mx2 = 0, my2 = 0;\n vector<P> path2;\n path2.push_back(P(0, 0));\n for(int j = 0 ; j < (int)m2.size() ; j++){\n\tx2 += dx[ (m2[j]+i)%6 ];\n\ty2 += dy[ (m2[j]+i)%6 ];\n\tpath2.push_back(P(x2, y2));\n\tmx2 = min(mx2, x2);\n\tmy2 = min(my2, y2);\n }\n for(int j = 0 ; j < path2.size() ; j++){\n\tpath2[j].first -= mx2;\n\tpath2[j].second -= my2;\n }\n sort(path2.begin(), path2.end());\n if(path1 == path2){\n\tflag = true;\n\tgoto END;\n }\n }\n END:;\n if(flag) cout << \"true\" << endl;\n else cout << \"false\" << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1228,"score_of_the_acc":-0.174,"final_rank":5},{"submission_id":"aoj_1228_794746","code_snippet":"#include<iostream>\n#include<cmath>\n#include<algorithm>\n#include<vector>\n#include<cassert>\n#include<set>\n#include<cstdio>\n\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define inf (1<<29)\n\nusing namespace std;\n\ntypedef pair<int,int> ii;\n\nconst string roulette = \"abcdef\";\nint dx[] = {-1,-1,+0,+1,+1,+0};\nint dy[] = {+1,+0,-1,-1,+0,+1};\nstring line1,line2;\nint N;\nvector<int> Index[2];\n\nbool check(vector<ii> v1,vector<ii> v2)\n{\n sort(v1.begin(),v1.end());\n sort(v2.begin(),v2.end());\n rep(i,N)if(v1[i] != v2[i])return false;\n return true;\n}\n\nvoid compute()\n{\n if(line1.size() != line2.size())\n {\n cout << \"false\" << endl;\n return;\n }\n N = line2.size();\n \n vector<ii> ori;\n int mx,my;\n ori.push_back(ii(0,0));\n \n int x = 0, y = 0;\n mx = my = 0;\n rep(i,N)\n {\n\tx += dx[line1[i]-'a'];\n\ty += dy[line1[i]-'a'];\n\tmx = min(mx,x);\n\tmy = min(my,y);\n\tori.push_back(ii(x,y));\n }\n \n\n rep(i,ori.size())ori[i].first -= mx, ori[i].second -= my;\n\n\n rep(j,7)//dir\n {\n vector<ii> cont;\n cont.push_back(ii(0,0));\n x = y = 0;\n mx = x, my = y;\n rep(i,N)\n\t{\n\t x += dx[(line2[i]-'a'+j)%6];\n\t y += dy[(line2[i]-'a'+j)%6];\n\t mx = min(mx,x);\n\t my = min(my,y);\n\t cont.push_back(ii(x,y));\n\t}\n \n rep(i,cont.size())cont[i].first -= mx,cont[i].second -= my;\n \n if(check(ori,cont))\n\t{\n\t cout << \"true\" << endl;\n\t return;\n\t}\n \n }\n \n \n \n \n cout << \"false\" << endl;\n}\n\n\nint main()\n{\n int n; \n while(cin >> n)\n {\n cin.ignore();\n string blank;\n while(n--)\n\t{\n\t line1.clear();\n\t line2.clear();\n\t char c;\n\t while((c = getchar()) != '\\n')line1 += c;\n\t while((c = getchar()) != '\\n')line2 += c;\n\t cin >> blank;\n\t cin.ignore();\n\t compute();\n\t}\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1216,"score_of_the_acc":-0.1723,"final_rank":4},{"submission_id":"aoj_1228_545467","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <map>\n#include <set>\nusing namespace std;\n\nconst int dx[6] = {1,0,-1,-1,0,1};\nconst int dy[6] = {0,1,1,0,-1,-1};\n\nset<pair<int,int> > move(const string &s, int diff) {\n int x, y, mx, my;\n set<pair<int,int> > res;\n x = y = mx = my = 0;\n res.insert(make_pair(x,y));\n for(int i = 0; i < s.size(); ++i) {\n int d = (s[i]-'a'+diff)%6;\n x += dx[d];\n y += dy[d];\n res.insert(make_pair(x,y));\n mx = min(mx, x);\n my = min(my, y);\n }\n set<pair<int,int> > res2;\n for(set<pair<int,int> >::iterator it = res.begin();\n it != res.end(); ++it) {\n res2.insert(make_pair(it->first - mx, it->second - my));\n }\n return res2;\n}\n\nint main() {\n int Tc;\n cin >> Tc;\n cin.ignore();\n for(int tc = 0; tc < Tc; ++tc) {\n string s, t, dummy;\n getline(cin, s);\n getline(cin, t);\n getline(cin, dummy);\n set<pair<int,int> > ss = move(s, 0);\n bool res = false;\n for(int i = 0; i < 6; ++i) {\n if(move(t, i) == ss) {\n\tres = true;\n\tbreak;\n }\n }\n if(res) cout << \"true\" << endl;\n else cout << \"false\" << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1212,"score_of_the_acc":-0.1784,"final_rank":8},{"submission_id":"aoj_1228_542578","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <cstdio>\n \nusing namespace std;\n \ntypedef pair<int, int> P;\n\nset<P> vis[2];\nstring in[2];\nint dy[6] = {1, 0, -1, -1, 0, 1};\nint dx[6] = {0, 1, 1, 0, -1, -1};\n \nvoid calc(int p, int d){\n int x = 0, y = 0;\n int mx = 0, my = 0;\n set<P> tmp;\n tmp.insert(P(y, x));\n for(int i=0;i<in[p].size();i++){\n y += dy[(in[p][i]-'a'+d)%6];\n x += dx[(in[p][i]-'a'+d)%6];\n mx = min(mx, x);\n my = min(my, y);\n tmp.insert(P(y, x));\n }\n for(set<P>::iterator ite=tmp.begin();ite!=tmp.end();ite++){\n vis[p].insert(P(ite->first-my, ite->second-mx));\n }\n}\n\nbool solve(){\n vis[0].clear();\n calc(0, 0);\n for(int i=0;i<6;i++){\n vis[1].clear();\n calc(1, i);\n if(vis[0] == vis[1]) return true;\n }\n return false;\n}\n \nint main(){\n int T;\n cin >> T;\n getchar();\n while(T--){\n string s;\n for(int i=0;i<2;i++){\n getline(cin, in[i]);\n }\n getline(cin, s);\n cout << (solve() ? \"true\" : \"false\") << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1212,"score_of_the_acc":-0.1784,"final_rank":8},{"submission_id":"aoj_1228_520256","code_snippet":"#include<cstdio>\n#include<cstring>\n#include<algorithm>\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\n\nconst int dx[6]={1,0,-1,-1,0,1};\nconst int dy[2][6]={{0,1,0,-1,-1,-1},{1,1,1,0,-1,0}};\n\nbool solve(const char *s,const char *t){\n\tint m=strlen(s)-1,n=strlen(t)-1;\n\n\tif(m!=n) return false;\n\n\tpair<int,int> p[128];\n\tint x=0,y=0;\n\trep(i,m+1){\n\t\tp[i]=make_pair(x,y);\n\t\tif(i<m){\n\t\t\ty+=dy[x&1][s[i]-'a'];\n\t\t\tx+=dx[s[i]-'a'];\n\t\t}\n\t}\n\n\trep(k,m+1) rep(d,6) {\n\t\tbool ok=true;\n\t\tint x=p[k].first,y=p[k].second;\n\t\trep(i,n+1){\n\t\t\tif(find(p,p+m+1,make_pair(x,y))==p+m+1){ ok=false; break; }\n\t\t\tif(i<n){\n\t\t\t\ty+=dy[x&1][(t[i]-'a'+d)%6];\n\t\t\t\tx+=dx[(t[i]-'a'+d)%6];\n\t\t\t}\n\t\t}\n\t\tif(ok) return true;\n\t}\n\treturn false;\n}\n\nint main(){\n\tint T; scanf(\"%d\",&T);\n\tfor(getchar();T--;){\n\t\tchar s[128],t[128];\n\t\tfgets(s,128,stdin);\n\t\tfgets(t,128,stdin);\n\t\tgetchar(); getchar();\n\t\tputs(solve(s,t)?\"true\":\"false\");\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1016,"score_of_the_acc":-0.144,"final_rank":3},{"submission_id":"aoj_1228_495906","code_snippet":"#include <iostream>\n#include <sstream>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <set>\n#include <map>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <cassert>\n\nusing namespace std;\n\n#define FOR(i,k,n) for(int i=(k); i<(int)n; ++i)\n#define REP(i,n) FOR(i,0,n)\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n\ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cout<<*i<<\" \"; cout<<endl; }\n\ntypedef long long ll;\nconst int INF = 100000000;\nconst double EPS = 1e-8;\nconst int MOD = 1000000007;\ntypedef pair<int, int> P;\nvoid move(int x, int y, int& nx, int& ny, int r){\n int dx[6] = {1, 0, -1, -1, 0, 1};\n int dy[6] = {1, 1, 0, -1, -1, 0};\n nx = x + dx[r];\n ny = y + dy[r];\n}\n\nint main(){\n int N;\n cin>>N;\n cin.ignore();\n while(N--){\n string s, t, tmp;\n getline(cin, s);\n getline(cin, t);\n getline(cin, tmp);\n set<P> p_set;\n int x = 0, y = 0;\n p_set.insert(P(x, y));\n REP(i, s.size()){\n move(x, y, x, y, s[i] - 'a');\n //printf(\"(%d %d) \", x, y);\n p_set.insert(P(x, y));\n }\n bool ans = false;\n REP(d, 6){\n vector<P> p_vect;\n x = 0, y = 0;\n p_vect.push_back(P(x, y));\n REP(i, t.size()){\n move(x, y, x, y, (t[i] - 'a' + d) % 6);\n p_vect.push_back(P(x, y));\n }\n REP(i, p_vect.size()){\n int bx = p_vect[i].first, by = p_vect[i].second;\n set<P> p_set2;\n REP(j, p_vect.size()){\n p_set2.insert(P(p_vect[j].first - bx, p_vect[j].second - by));\n }\n if(p_set == p_set2) ans = true;\n }\n }\n if(ans) cout<<\"true\"<<endl;\n else cout<<\"false\"<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":390,"memory_kb":1212,"score_of_the_acc":-0.4234,"final_rank":14},{"submission_id":"aoj_1228_331309","code_snippet":"#include<iostream>\n#include<string>\nusing namespace std;\n#define rep(i, n) for ( int i = 0; i < (int)n; i++ )\n#define MAX 250\n\nbool compute(string str1, string str2){\n bool V1[MAX][MAX], V2[MAX][MAX];\n int ldy1, ldx1, rty1, rtx1;\n int dy[6] = {1, 1, 0, -1, -1, 0};\n int dx[6] = {0, -1, -1, 0, 1, 1};\n if ( str1.size() != str2.size() ) return false;\n int n = (int)str1.size()*2+2;\n rep(y, n) rep(x, n) V1[y][x] = false;\n\n int py = n/2;\n int px = n/2;\n V1[py][px] = true;\n ldy1 = rty1 = py;\n ldx1 = rtx1 = px;\n rep(i, str1.size()){\n int r = (str1[i]-'a')%6;\n py += dy[r];\n px += dx[r];\n V1[py][px] = true;\n ldy1 = min(ldy1, py);\n ldx1 = min(ldx1, px);\n rty1 = max(rty1, py);\n rtx1 = max(rtx1, px);\n }\n\n rep(d, 6){\n int ldy2, ldx2, rty2, rtx2;\n py = n/2;\n px = n/2;\n ldy2 = rty2 = py;\n ldx2 = rtx2 = px;\n rep(y, n) rep(x, n) V2[y][x] = false;\n V2[py][px] = true;\n rep(i, str2.size()){\n int r = (str2[i]-'a'+d)%6;\n py += dy[r];\n px += dx[r];\n V2[py][px] = true;\n ldy2 = min(ldy2, py);\n ldx2 = min(ldx2, px);\n rty2 = max(rty2, py);\n rtx2 = max(rtx2, px);\n }\n if ( !(rty1-ldy1 == rty2-ldy2 && rtx1-ldx1 == rtx2-ldx2 ) ) continue;\n int h = rty1-ldy1+1;\n int w = rtx1-ldx1+1;\n bool same = true;\n rep(y, h) rep(x, w){\n if ( V1[y+ldy1][x+ldx1] != V2[y+ldy2][x+ldx2] ) {same = false; break;}\n }\n if ( same ) return true;\n }\n return false;\n}\n\nmain(){\n int tcase; cin >> tcase;\n string str1, str2, kasu;\n getline(cin, kasu);\n rep(t, tcase) {\n getline(cin, str1);\n getline(cin, str2);\n if (compute(str1, str2) ) cout << \"true\" << endl;\n else cout << \"false\" << endl;\n getline(cin, kasu);\n }\n}","accuracy":1,"time_ms":20,"memory_kb":0,"score_of_the_acc":-0.0066,"final_rank":1},{"submission_id":"aoj_1228_293288","code_snippet":"#include <iostream>\n#include <fstream>\n#include <sstream>\n#include <string>\n#include <vector>\n#include <queue>\n#include <deque>\n#include <stack>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <climits>\n#include <cctype>\n#include <complex>\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int,int> P;\n\n#define REP(i,n,m) for(int i=n;i<m;i++)\n#define rep(i,n) REP(i,0,n)\n\nint dx[] = {1,0,-1,-1, 0,1};\nint dy[] = {1,1, 0,-1,-1,0};\n\nbool equals(set<P> a,set<P> b){\n if(a.size() != b.size()) return false;\n\n set<P>::iterator iterA = a.begin();\n set<P>::iterator iterB = b.begin();\n int diffX = (iterA->first) - (iterB->first);\n int diffY = (iterA->second) - (iterB->second);\n\n while(iterA != a.end()){\n if((iterA->first) - (iterB->first) != diffX ||\n (iterA->second) - (iterB->second) != diffY){\n return false;\n }\n iterA++;\n iterB++;\n }\n return true;\n}\n\nint main(){\n int T;\n string tmp;\n cin>>T;\n getline(cin,tmp);\n\n while(T--){\n string a,b;\n getline(cin,a);\n getline(cin,b);\n getline(cin,tmp);\n\n set<P> aset;\n P p(0,0);\n aset.insert(p);\n\n rep(i,a.length()){\n p.first += dx[a[i] - 'a'];\n p.second += dy[a[i] - 'a'];\n aset.insert(p);\n }\n\n /*\n for(set<P>::iterator iter=aset.begin();iter!=aset.end();iter++){\n cout<<(iter->first)<<\",\"<<(iter->second)<<endl;\n }\n cout<<\"--\\n\";\n */\n\n bool flg = false;\n\n rep(i,6){\n set<P> bset;\n bset.clear();\n p = P(0,0);\n bset.insert(p);\n rep(j,b.length()){\n p.first += dx[((int)b[j] - 'a' + i) % 6];\n p.second += dy[((int)b[j] - 'a' + i) % 6];\n bset.insert(p);\n }\n /*\n if(b.length() > 0 && b[0] == 'b'){\n for(set<P>::iterator iter=bset.begin();iter!=bset.end();iter++){\n cout<<(iter->first)<<\",\"<<(iter->second)<<endl;\n }\n cout<<endl;\n }\n */\n\n if(equals(aset,bset)){\n flg = true;\n break;\n }\n }\n\n if(flg){\n cout<<\"true\\n\";\n }\n else{\n cout<<\"false\\n\";\n }\n }\n}","accuracy":1,"time_ms":40,"memory_kb":0,"score_of_the_acc":-0.0199,"final_rank":2}],"string":"[\n {\n \"submission_id\": \"aoj_1228_2649936\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <set>\\n#include <map>\\n#include <time.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\nstring line;\\n\\nstruct Info{\\n\\tInfo(int arg_row,int arg_col){\\n\\t\\trow = arg_row;\\n\\t\\tcol = arg_col;\\n\\t}\\n\\tint row,col;\\n};\\n\\nchar buf1[101],buf2[101],buf3[101];\\nbool table1[201][201],table2[201][201];\\nint len_1,len_2,start_row = 100,start_col = 100,G[128];\\nint diff_row[6] = {1,1,0,-1,-1,0},diff_col[6] = {0,-1,-1,0,1,1};\\nint loc[6][6] = {{0,1,2,3,4,5},{1,2,3,4,5,0},{2,3,4,5,0,1},{3,4,5,0,1,2},{4,5,0,1,2,3},{5,0,1,2,3,4}};\\nvector<Info> V;\\n\\nvoid func(){\\n\\n\\tgetchar();\\n\\tgetline(cin,line);\\n\\tfor(len_1 = 0; len_1 != line.length(); len_1++){\\n\\t\\tbuf1[len_1] = line[len_1];\\n\\t}\\n\\tbuf1[len_1] = '\\\\0';\\n\\n\\tgetline(cin,line);\\n\\tfor(len_2 = 0; len_2 != line.length(); len_2++){\\n\\t\\tbuf2[len_2] = line[len_2];\\n\\t}\\n\\tbuf2[len_2] = '\\\\0';\\n\\tscanf(\\\"%s\\\",buf3);\\n\\n\\tfor(len_1 = 0; buf1[len_1] != '\\\\0'; len_1++);\\n\\tfor(len_2 = 0; buf2[len_2] != '\\\\0'; len_2++);\\n\\n\\tif(len_1 != len_2){\\n\\t\\tprintf(\\\"false\\\\n\\\");\\n\\t\\treturn;\\n\\t}else if(len_1 == 0 && len_2 == 0){\\n\\t\\tprintf(\\\"true\\\\n\\\");\\n\\t\\treturn;\\n\\t}\\n\\n\\tfor(int row = 0; row <= 200; row++){\\n\\t\\tfor(int col = 0; col <= 200; col++){\\n\\t\\t\\ttable1[row][col] = false;\\n\\t\\t\\ttable2[row][col] = false;\\n\\t\\t}\\n\\t}\\n\\n\\tV.clear();\\n\\n\\tint tmp_row = start_row,tmp_col = start_col,tmp;\\n\\ttable1[start_row][start_col] = true;\\n\\tV.push_back(Info(start_row,start_col));\\n\\n\\tfor(int i = 0; i < len_1; i++){\\n\\t\\ttmp = G[buf1[i]];\\n\\t\\ttmp_row += diff_row[tmp];\\n\\t\\ttmp_col += diff_col[tmp];\\n\\t\\ttable1[tmp_row][tmp_col] = true;\\n\\t\\tV.push_back(Info(tmp_row,tmp_col));\\n\\t}\\n\\n\\tbool FLG;\\n\\tvector<Info> X;\\n\\n\\tfor(int loop = 0; loop < V.size(); loop++){\\n\\n\\t\\tfor(int k = 0; k < 6; k++){\\n\\n\\t\\t\\tfor(int i = 0; i < X.size(); i++){\\n\\t\\t\\t\\ttable2[X[i].row][X[i].col] = false;\\n\\t\\t\\t}\\n\\t\\t\\tX.clear();\\n\\n\\t\\t\\ttmp_row = V[loop].row;\\n\\t\\t\\ttmp_col = V[loop].col;\\n\\t\\t\\ttable2[tmp_row][tmp_col] = true;\\n\\t\\t\\tX.push_back(Info(tmp_row,tmp_col));\\n\\n\\t\\t\\tFLG = true;\\n\\t\\t\\tfor(int i = 0; i < len_2; i++){\\n\\n\\t\\t\\t\\ttmp = loc[k][G[buf2[i]]];\\n\\t\\t\\t\\ttmp_row += diff_row[tmp];\\n\\t\\t\\t\\ttmp_col += diff_col[tmp];\\n\\t\\t\\t\\tif(table1[tmp_row][tmp_col] == false){\\n\\t\\t\\t\\t\\tFLG = false;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\ttable2[tmp_row][tmp_col] = true;\\n\\t\\t\\t\\tX.push_back(Info(tmp_row,tmp_col));\\n\\t\\t\\t}\\n\\t\\t\\tif(!FLG)continue;\\n\\n\\t\\t\\tfor(int i = 0; i < V.size(); i++){\\n\\t\\t\\t\\tif(table2[V[i].row][V[i].col] == false){\\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\\tprintf(\\\"true\\\\n\\\");\\n\\t\\t\\t\\treturn;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tprintf(\\\"false\\\\n\\\");\\n}\\n\\n\\nint main(){\\n\\n\\tint case_num;\\n\\tscanf(\\\"%d\\\",&case_num);\\n\\n\\tG['a'] = 0;\\n\\tG['b'] = 1;\\n\\tG['c'] = 2;\\n\\tG['d'] = 3;\\n\\tG['e'] = 4;\\n\\tG['f'] = 5;\\n\\n\\tfor(int i = 0; i < case_num; i++)func();\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3324,\n \"score_of_the_acc\": -0.4711,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1228_2548403\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n \\nusing namespace std;\\n \\nconst int dx[] = {0, 1, 1, 0, -1, -1};\\nconst int dy[] = {-1, 0, 1, 1, 0, -1};\\n \\nusing Point = pair<int, int>;\\n \\nint main() {\\n int T;\\n cin >> T;\\n cin.ignore(); \\n while(T--) {\\n string s, t, sp; \\n //cin >> s >> t >> sp;\\n getline(cin, s);\\n getline(cin, t);\\n getline(cin, sp);\\n if(s.size() != t.size()) {\\n cout << \\\"false\\\" << endl;\\n continue;\\n }\\n int x = 0, y = 0;\\n set<Point> vis;\\n vis.insert(Point(0, 0));\\n for(char c : s) {\\n int k = c-'a';\\n x += dx[k], y += dy[k];\\n vis.insert(Point(x, y));\\n }\\n for(int i = 0; i < 6; i++) {\\n for(Point p : vis) {\\n set<Point> st;\\n int x = p.first, y = p.second;\\n st.insert(Point(x, y));\\n for(char c : t) {\\n int k = c-'a';\\n x += dx[(k+i)%6], y += dy[(k+i)%6];\\n if(!vis.count(Point(x, y))) {\\n break;\\n } else {\\n st.insert(Point(x, y));\\n }\\n }\\n if(st == vis) {\\n cout << \\\"true\\\" << endl;\\n goto end;\\n }\\n }\\n }\\n cout << \\\"false\\\" << endl;\\n end: ;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3156,\n \"score_of_the_acc\": -0.4605,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1228_2548382\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,n) for(int i=0;i<n;i++)\\nusing namespace std;\\nstring s,t;\\nint n;\\nint dy1[6]={1,1,0,-1,-1,0};\\nint dx1[6]={0,-1,-1,0,1,1};\\nint dy2[6]={-1,-1,0,1,1,0};\\nint dx2[6]={0,1,1,0,-1,-1};\\nbool b[1000][1000];\\nbool c[1000][1000];\\nmain(){\\n cin>>n;\\n while(n--){\\n memset(b,0,sizeof(b));\\n cin>>s;\\n if(s==\\\"-\\\"){\\n cout<<\\\"true\\\"<<endl;\\n continue;\\n }\\n int y=500,x=500;\\n b[y][x]=1;\\n vector<int>X,Y;\\n X.push_back(x);\\n Y.push_back(y);\\n rep(i,s.size()){\\n x+=dx1[s[i]-'a'];\\n y+=dy1[s[i]-'a'];\\n b[y][x]=1;\\n X.push_back(x);\\n Y.push_back(y);\\n }\\n cin>>t;\\n if(t==\\\"-\\\"){\\n cout<<\\\"false\\\"<<endl;\\n continue;\\n }\\n rep(i,2){\\n rep(j,6){\\n rep(l,X.size()){\\n int f=0,y=Y[l],x=X[l];\\n rep(k,t.size()){\\n if(i){\\n x+=dx2[(t[k]-'a'+j)%6];\\n y+=dy2[(t[k]-'a'+j)%6];\\n }else{\\n x+=dx1[(t[k]-'a'+j)%6];\\n y+=dy1[(t[k]-'a'+j)%6];\\n }\\n if(b[y][x])f++;\\n }\\n if(f==t.size())goto L;\\n }\\n }\\n reverse(t.begin(),t.end());\\n }\\n cout<<\\\"false\\\"<<endl;\\n if(0){L:;cout<<\\\"true\\\"<<endl;}\\n cin>>s;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 4140,\n \"score_of_the_acc\": -0.6132,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1228_2548240\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nconst int dx[] = {0, 1, 1, 0, -1, -1};\\nconst int dy[] = {-1, 0, 1, 1, 0, -1};\\n\\nusing Point = pair<int, int>;\\n\\nint main() {\\n int T;\\n cin >> T;\\n cin.ignore(); \\n while(T--) {\\n string s, t, sp; \\n //cin >> s >> t >> sp;\\n getline(cin, s);\\n getline(cin, t);\\n getline(cin, sp);\\n if(s.size() != t.size()) {\\n cout << \\\"false\\\" << endl;\\n continue;\\n }\\n int x = 0, y = 0;\\n set<Point> vis;\\n vis.insert(Point(0, 0));\\n for(char c : s) {\\n int k = c-'a';\\n x += dx[k], y += dy[k];\\n vis.insert(Point(x, y));\\n }\\n for(int i = 0; i < 6; i++) {\\n for(Point p : vis) {\\n\\tset<Point> st;\\n\\tint x = p.first, y = p.second;\\n\\tst.insert(Point(x, y));\\n\\tfor(char c : t) {\\n\\t int k = c-'a';\\n\\t x += dx[(k+i)%6], y += dy[(k+i)%6];\\n\\t if(!vis.count(Point(x, y))) {\\n\\t break;\\n\\t } else {\\n\\t st.insert(Point(x, y));\\n\\t }\\n\\t}\\n\\tif(st == vis) {\\n\\t cout << \\\"true\\\" << endl;\\n\\t goto end;\\n\\t}\\n }\\n }\\n cout << \\\"false\\\" << endl;\\n end: ;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3172,\n \"score_of_the_acc\": -0.4694,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1228_2548097\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nint dy[6]={1,1,0,-1,-1,0};\\nint dx[6]={0,-1,-1,0,1,1};\\n\\nint base[1000][1000];\\nint cnum[300];\\nchar cc[300];\\n\\nint main(){\\n\\n cnum['a']=0;\\n cnum['b']=1;\\n cnum['c']=2;\\n cnum['d']=3;\\n cnum['e']=4;\\n cnum['f']=5;\\n \\n cc['a']='d';\\n cc['b']='e';\\n cc['c']='f';\\n cc['d']='a';\\n cc['e']='b';\\n cc['f']='c';\\n \\n int n;\\n\\n cin>>n;\\n \\n while(n--){\\n \\n string s;\\n string t;\\n \\n cin>>s;\\n \\n if(s==\\\"-\\\"){\\n cout<<\\\"true\\\"<<endl;\\n continue;\\n }\\n\\n vector<int> X, Y;\\n \\n int y=500, x=500;\\n\\n memset(base,0,sizeof(base));\\n\\n base[y][x]=1;\\n X.push_back(x);\\n Y.push_back(y);\\n \\n for(int i=0;i<s.size();i++){\\n \\n y+=dy[cnum[s[i]]];\\n x+=dx[cnum[s[i]]];\\n\\n base[y][x]=1;\\n X.push_back(x);\\n Y.push_back(y);\\n }\\n\\n cin>>t;\\n \\n if(t==\\\"-\\\"){\\n cout<<\\\"false\\\"<<endl;\\n continue;\\n }\\n \\n bool ans=false;\\n \\n for(int T=0;T<X.size();T++){\\n \\n for(int i=0;i<6;i++){\\n\\n\\t\\n\\tint flag=0;\\n\\n\\ty=Y[T], x=X[T];\\n \\n\\tfor(int j=0;j<t.size();j++){\\n \\n\\t y+=dy[(cnum[t[j]]+i)%6];\\n\\t x+=dx[(cnum[t[j]]+i)%6];\\n\\t\\n\\t if(!base[y][x]) flag=1;\\n\\t}\\n \\n\\tif(!flag) ans=true;\\n \\n }\\n\\n reverse(t.begin(),t.end());\\n \\n for(int i=0;i<6;i++){\\n \\n\\tint flag=0;\\n \\n\\ty=Y[T], x=X[T];\\n\\t\\n\\tfor(int j=0;j<t.size();j++){\\n\\t\\n\\t y+=dy[(cnum[cc[t[j]]]+i)%6];\\n\\t x+=dx[(cnum[cc[t[j]]]+i)%6];\\n\\t\\n\\t if(!base[y][x]) flag=1;\\n\\t}\\n\\n\\tif(!flag) ans=true;\\n \\n }\\n \\n reverse(t.begin(),t.end());\\n\\n }\\n \\n if(s.size()!=t.size()) ans=false;\\n\\n if(ans) cout<<\\\"true\\\"<<endl;\\n else cout<<\\\"false\\\"<<endl;\\n \\n cin>>s;\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 7056,\n \"score_of_the_acc\": -1.0795,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1228_1828590\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef pair<int,int> P;\\nvector<int> ss(string&s ){\\n vector<int> v;\\n for(int i=0;i<(int)s.size();i++){\\n v.push_back( s[i] - 'a' );\\n }\\n return v;\\n}\\n\\nint dx[2][6]={ {0,-1,-1,0,1,1},\\n {0,1,1,0,-1,-1} };\\nint dy[2][6]={ {1,1,0,-1,-1,0},\\n {1,0,-1,-1,0,1} };\\n\\nvoid dfs(int x,int y,int c,int k,const vector<int>& v,set<P> &s){\\n s.insert(P(x,y));\\n if( c == (int)v.size() ) return;\\n int d = (v[c]+k)%6;\\n dfs( x + dx[0][d], y + dy[0][d], c+1, k, v, s );\\n}\\n\\nbool eq(const set<P>& a, const set<P>& b){\\n if(a.size() != b.size() ) return false;\\n for( auto x = a.begin(), y = b.begin(); x != a.end() || y != b.end(); x++, y++ )\\n if( *x != *y ) return false;\\n return true;\\n}\\n\\nvoid view(const set<P> &s ){\\n for( auto x : s ){\\n cout << x.first << \\\" \\\" <<x.second << endl;\\n }\\n}\\n\\nint main(){\\n\\n int T;\\n cin >> T;\\n getchar();\\n while(T--){\\n string S1,S2; \\n getline(cin,S1);\\n getline(cin,S2);\\n vector<int> v1 = ss( S1 ), v2 = ss( S2 );\\n getline(cin,S1); \\n bool f = false;\\n for(int i=0;i<6;i++){\\n set<P> s1;\\n dfs( 0,0,0,i,v1,s1 );\\n //cout << \\\"s1------------- \\\"<< endl;\\n // view(s1);\\n for(int j=0;j<6;j++){\\n for( auto ps : s1 ){\\n set<P> s2;\\n dfs(ps.first,ps.second,0,j,v2,s2);\\n //cout << \\\"s2 \\\"<< endl;\\n //view(s2);\\n if( eq(s1, s2) ) {\\n //cout << \\\"ok---------\\\" << endl;\\n f = true;\\n }\\n }\\n } \\n }\\n if( f ) cout << \\\"true\\\" << endl;\\n else cout << \\\"false\\\" << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1520,\n \"memory_kb\": 3140,\n \"score_of_the_acc\": -1.445,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1228_1828466\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef vector<int> vec;\\ntypedef vector<vec> mat;\\n\\nvoid pr(mat a){\\n int h=a.size(),w=a[0].size();\\n for(int i=0;i<h;i++){\\n for(int j=0;j<w;j++){\\n cout<<a[i][j];\\n }\\n cout<<endl;\\n }\\n cout<<endl;\\n}\\n\\n\\nmat cut(mat a){\\n \\n int h=a.size(),w=a[0].size();\\n int ay=1e9,ax=1e9,by=0,bx=0;\\n for(int i=0;i<h;i++)\\n for(int j=0;j<w;j++)\\n if(a[i][j]!=0){\\n ay=min(ay,i);\\n ax=min(ax,j);\\n by=max(by,i);\\n bx=max(bx,j);\\n }\\n \\n mat res=mat(by-ay+1,vec(bx-ax+1));\\n for(int y=ay;y<=by;y++)\\n for(int x=ax;x<=bx;x++)\\n res[y-ay][x-ax]=a[y][x];\\n return res;\\n}\\n\\n\\nint main(){\\n int Tc;cin>>Tc;\\n cin.ignore();\\n while(Tc--){\\n\\n int F;\\n string s;\\n getline(cin,s);\\n \\n F=s.size()+2;\\n int py=F,px=F;\\n mat A(F+F,vec(F+F,0));\\n A[py][px]=1;\\n for(int i=0;i<(int)s.size();i++){\\n if(s[i]=='a')px++;\\n if(s[i]=='b')py--;\\n if(s[i]=='c')py--,px--;\\n if(s[i]=='d')px--;\\n if(s[i]=='e')py++;\\n if(s[i]=='f')py++,px++;\\n A[py][px]=1;\\n }\\n A=cut(A);\\n\\n getline(cin,s);\\n bool ans=false;\\n for(int T=0;T<6;T++){\\n F=s.size()+2;\\n mat B(F+F,vec(F+F,0));\\n py=F,px=F;\\n B[py][px]=1;\\n \\n for(int i=0;i<(int)s.size();i++){\\n if(s[i]=='a')px++,s[i]='b';\\n else if(s[i]=='b')py--,s[i]='c';\\n else if(s[i]=='c')py--,px--,s[i]='d';\\n else if(s[i]=='d')px--,s[i]='e';\\n else if(s[i]=='e')py++,s[i]='f';\\n else if(s[i]=='f')py++,px++,s[i]='a';\\n B[py][px]=1;\\n }\\n\\n B=cut(B);\\n if(A==B)ans=true;\\n }\\n cout<< (ans?\\\"true\\\":\\\"false\\\") <<endl;\\n string tmp;\\n getline(cin,tmp);\\n assert(tmp==\\\"-\\\");\\n\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 1532,\n \"score_of_the_acc\": -0.2635,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1228_1130939\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<algorithm>\\n#include<vector>\\nusing namespace std;\\nchar str[1100];\\nint dx[]={1,1,0,-1,-1,0};\\nint dy[]={0,1,1,0,-1,-1};\\n\\nint main(){\\n\\tint a;scanf(\\\"%d\\\",&a);\\n\\tgets(str);\\n\\twhile(a--){\\n\\t\\tgets(str);\\n\\t\\tvector<pair<int,int> >v;\\n\\t\\tint r=0;int c=0;\\n\\t\\tv.push_back(make_pair(0,0));\\n\\t\\tfor(int i=0;str[i];i++){\\n\\t\\t\\tr+=dx[str[i]-'a'];\\n\\t\\t\\tc+=dy[str[i]-'a'];\\n\\t\\t\\tv.push_back(make_pair(r,c));\\n\\t\\t}\\n\\t\\tstd::sort(v.begin(),v.end());\\n\\t\\tgets(str);\\n\\t\\tint ret=0;\\n\\t\\tfor(int i=0;i<6;i++){\\n\\t\\t\\tfor(int t=0;t<v.size();t++){\\n\\t\\t\\t\\tvector<pair<int,int> >w;\\n\\t\\t\\t\\tint nr=v[t].first;int nc=v[t].second;\\n\\t\\t\\t\\tw.push_back(make_pair(nr,nc));\\n\\t\\t\\t\\tfor(int j=0;str[j];j++){\\n\\t\\t\\t\\t\\tnr+=dx[(str[j]-'a'+i)%6];\\n\\t\\t\\t\\t\\tnc+=dy[(str[j]-'a'+i)%6];\\n\\t\\t\\t\\t\\tw.push_back(make_pair(nr,nc));\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tstd::sort(w.begin(),w.end());\\n\\t\\t\\t\\tbool ok=true;\\n\\t\\t\\t\\tif(v.size()!=w.size())continue;\\n\\t\\t\\t\\tfor(int j=0;j<v.size();j++){\\n\\t\\t\\t\\t\\tif(v[j].first!=w[j].first||v[j].second!=w[j].second)ok=false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(ok){ret=1;break;}\\n\\t\\t\\t}\\n\\t\\t\\tif(ret)break;\\n\\t\\t}\\n\\t\\tif(ret)printf(\\\"true\\\\n\\\");\\n\\t\\telse printf(\\\"false\\\\n\\\");\\n\\t\\tgets(str);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 1012,\n \"score_of_the_acc\": -0.2361,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1228_1053417\",\n \"code_snippet\": \"#include<iostream>\\n#include<set>\\n#include<vector>\\n#include<iterator>\\n#include<utility>\\n#include<algorithm>\\n#include<cstdio>\\n#include<string>\\n\\nusing namespace std;\\n\\nint main(){\\n int T;\\n cin>>T;\\n cin.ignore(1);\\n while(T--){\\n set<set<pair<int,int> > >ss[2];\\n for(int i=0;i<2;i++){\\n string str;\\n getline(cin,str);\\n for(int j=0;j<6;j++){\\n\\tset<pair<int,int> > s;\\n\\tint y=0,x=0;\\n\\tfor(int k=0;;k++){\\n\\t s.insert(make_pair(x,y)).second;\\n\\t if(k==str.size())break;\\n\\t static int dy[]={-1,-1,0,1,1,0};\\n\\t static int dx[]={0,-1,-1,0,1,1};\\n\\t int idx=(j+str[k]-'a')%6;\\n\\t y+=dy[idx];\\n\\t x+=dx[idx];\\n\\t}\\n\\tint mx=999,my=999;\\n\\tfor(auto e:s){\\n\\t mx=min(mx,e.first);\\n\\t my=min(my,e.second);\\n\\t}\\n\\tset<pair<int,int> > ns;\\n\\tfor(auto e:s){\\n\\t ns.insert(make_pair(e.first-mx,e.second-my));\\n\\t}\\n\\tss[i].insert(ns);\\n }\\n } \\n cin.ignore(2);\\n vector<set<pair<int,int> > > v;\\n set_intersection(begin(ss[0]),end(ss[0]),begin(ss[1]),end(ss[1]),back_inserter(v));\\n cout<<boolalpha<<(!v.empty())<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 1276,\n \"score_of_the_acc\": -0.214,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1228_955482\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <string>\\n#include <vector>\\n#include <set>\\n\\nusing namespace std;\\n\\nint dx[] = {-1, -1, 0, 1, 1, 0};\\nint dy[] = {-1, 0, 1, 1, 0, -1};\\n\\nvector<pair<int, int>> make_set(string &s, int i){\\n\\tvector<pair<int, int>> ret;\\n\\tauto pos = make_pair(0, 0);\\n\\n\\tret.push_back(pos);\\n\\tfor (auto c : s){\\n\\t\\tpos.first += dx[(c - 'a' + i) % 6];\\n\\t\\tpos.second += dy[(c - 'a' + i) % 6];\\n\\t\\tret.push_back(pos);\\n\\t}\\n\\tsort(ret.begin(), ret.end());\\n\\treturn ret;\\n}\\n\\nbool check(string &s, string &t){\\n\\tvector<pair<int, int>> s1 = make_set(s, 0);\\n\\tvector<vector<pair<int, int>>> s2(6);\\n\\tfor (int i = 0; i < 6; ++i) s2[i] = make_set(t, i);\\n\\n\\tfor (auto p : s1){\\n\\t\\tfor (int i = 0; i < 6; ++i){\\n\\t\\t\\tbool ok = true;\\n\\t\\t\\tfor (int j = 0; j < s1.size(); ++j){\\n\\t\\t\\t\\tint x = s1[j].first - p.first;\\n\\t\\t\\t\\tint y = s1[j].second - p.second;\\n\\t\\t\\t\\tif (make_pair(x, y) != s2[i][j]) ok = false;\\n\\t\\t\\t}\\n\\n\\t\\t\\tif (ok) return true;\\n\\t\\t}\\n\\t}\\n\\treturn false;\\n}\\n\\nint main(){\\n\\tint n;\\n\\tcin >> n;\\n\\tcin.ignore();\\n\\tfor (int i = 0; i < n; ++i){\\n\\t\\tstring s, t, u;\\n\\t\\tgetline(cin, s);\\n\\t\\tgetline(cin, t);\\n\\t\\tgetline(cin, u);\\n\\t\\tif (s.size() == t.size() && check(s, t)) cout << \\\"true\\\" << '\\\\n';\\n\\t\\telse cout << \\\"false\\\" << '\\\\n';\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1208,\n \"score_of_the_acc\": -0.1778,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1228_920121\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#define INF 0x3f3f3f3f\\n\\n#include <iostream>\\n#include <cstdio>\\n#include <sstream>\\n#include <cmath>\\n#include <cstdlib>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <limits>\\n#include <map>\\n#include <string>\\n#include <cstring>\\n#include <set>\\n#include <deque>\\n#include <bitset>\\n#include <list>\\n#include <cctype>\\n#include <utility>\\n \\nusing namespace std;\\n \\ntypedef long long ll;\\ntypedef pair <int,int> P;\\ntypedef pair <int,P> PP;\\n \\nstatic const double EPS = 1e-8;\\n\\npair<int,int> maja(int x) {\\n if (x == 0) return pair<int,int>(0,0);\\n int n = static_cast<int>(ceil((-1.0+sqrt(1.0+4.0/3.0*x))/2.0));\\n int a = 3*n*(n-1), d = static_cast<int>(ceil((1.0*x-a)/n-1.0));\\n int k = x - a - n * d;\\n switch (d) {\\n case 0: return pair<int,int>(n-k,k);\\n case 1: return pair<int,int>(-k,n);\\n case 2: return pair<int,int>(-n,n-k);\\n case 3: return pair<int,int>(-n+k,-k);\\n case 4: return pair<int,int>(k,-n);\\n case 5: return pair<int,int>(n,-n+k);\\n }\\n}\\n\\nint majadist(const pair<int,int> &a, const pair<int,int> &b) {\\n int dx = abs(a.first - b.first);\\n int dy = abs(a.second - b.second);\\n int dz = abs(a.first+a.second-b.first-b.second);\\n return min(dx+dy, min(dx+dz, dy+dz));\\n}\\n\\nint main(){\\n string strN;\\n \\n int char2num[256];\\n char2num['f'] = 1;\\n char2num['e'] = 2;\\n char2num['d'] = 3;\\n char2num['c'] = 4;\\n char2num['b'] = 5;\\n char2num['a'] = 6;\\n int chars[] = {'f','e','d','c','b','a'};\\n\\n while(getline(cin,strN)){\\n int N = atoi(strN.c_str());\\n \\n for(int i=0;i<N;i++){\\n string routes[2];\\n map<pair<int,int>,bool> visited[2][6];\\n\\n for(int person=0;person<2;person++){\\n\\tgetline(cin,routes[person]);\\n\\n\\tfor(int offset=0;offset< 6;offset++){\\n\\t for(int char_idx=0;char_idx<6;char_idx++){\\n\\t char2num[chars[char_idx]]\\n\\t = (char_idx + offset) % 6 + 1;\\t \\n\\t } \\n\\t pair<int,int> current(0,0);\\n\\t visited[person][offset][current] = true;\\n\\n\\t for(int k=0;k<routes[person].size();k++){\\n\\t current.first \\n\\t += maja(char2num[routes[person][k]]).first;\\n\\t current.second \\n\\t += maja(char2num[routes[person][k]]).second;\\n\\t // cout << \\\"x: \\\" << current.first;\\n\\t // cout << \\\" y: \\\" << current.second << endl;\\n\\t visited[person][offset][current] = true;\\n\\t }\\n\\t}\\n }\\n\\t\\n string garbage;\\n getline(cin,garbage);\\n\\n bool res = false;\\n for(int src_offset=0;src_offset< 6;src_offset++){\\n\\tfor(int dst_offset=0;dst_offset< 6;dst_offset++){\\n\\t int offset_x\\n\\t = visited[1][dst_offset].begin()->first.first\\n\\t - visited[0][src_offset].begin()->first.first;\\n\\t int offset_y\\n\\t = visited[1][dst_offset].begin()->first.second\\n\\t - visited[0][src_offset].begin()->first.second;\\n\\n\\t bool isok = true;\\n\\t for(map<pair<int,int>,bool>::iterator it = visited[0][src_offset].begin();\\n\\t it != visited[0][src_offset].end();\\n\\t it++){\\n\\t pair<int,int> moved(it->first.first+offset_x,\\n\\t\\t\\t\\tit->first.second+offset_y);\\n\\t if(visited[1][dst_offset].find(moved) == visited[1][dst_offset].end()){\\n\\t isok = false;\\n\\t break;\\n\\t }\\n\\t }\\n\\t res |= isok;\\n\\t}\\n }\\n printf(\\\"%s\\\\n\\\",res ? \\\"true\\\" : \\\"false\\\");\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 1260,\n \"score_of_the_acc\": -0.2051,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1228_794805\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cstring>\\n#include <algorithm>\\n#include <vector>\\nusing namespace std;\\n \\nint dx[] = {0, -1, -1, 0, 1, 1};\\nint dy[] = {-1, -1, 0, 1, 1, 0};\\n\\ntypedef pair<int, int> P; \\n\\nvector<P> move(int d, vector<int> m){\\n int x = 0, y = 0;\\n int mx = 0, my = 0;\\n vector<P> path;\\n path.push_back(P(0, 0));\\n for(int i = 0 ; i < (int)m.size() ; i++){\\n x += dx[ (m[i]+d)%6 ] ,y += dy[ (m[i]+d)%6 ];\\n mx = min(mx, x), my = min(my, y);\\n path.push_back(P(x, y));\\n }\\n sort(path.begin(), path.end());\\n for(int i = 0 ; i < (int)path.size() ; i++){\\n path[i].first -= mx, path[i].second -= my;\\n }\\n return path;\\n}\\n\\nbool solve(vector<int> m1, vector<int> m2){\\n vector<P> path1 = move(0, m1);\\n \\n for(int i = 0 ; i < 6 ; i++){\\n vector<P> path2 = move(i, m2);\\n if(path1 == path2) return true;\\n }\\n return false;\\n}\\nint main(){\\n int n;\\n cin >> n;\\n cin.ignore();\\n string s1, s2, tmp;\\n for(int i = 0 ; i < n ; i++){\\n getline(cin, s1);\\n getline(cin, s2);\\n getline(cin, tmp);\\n \\n vector<int> m1, m2;\\n for(int i = 0 ; i < (int)s1.size() ; i++) m1.push_back(s1[i]-'a');\\n for(int i = 0 ; i < (int)s2.size() ; i++) m2.push_back(s2[i]-'a');\\n \\n if(solve(m1, m2)) cout << \\\"true\\\" << endl;\\n else cout << \\\"false\\\" << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1232,\n \"score_of_the_acc\": -0.1746,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1228_794765\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cstring>\\n#include <algorithm>\\n#include <vector>\\nusing namespace std;\\n \\nint dx[] = {0, -1, -1, 0, 1, 1};\\nint dy[] = {-1, -1, 0, 1, 1, 0};\\n\\ntypedef pair<int, int> P; \\n\\nint main(){\\n int n;\\n cin >> n;\\n cin.ignore();\\n string s1, s2, tmp;\\n for(int i = 0 ; i < n ; i++){\\n getline(cin, s1);\\n getline(cin, s2);\\n getline(cin, tmp);\\n \\n vector<int> m1, m2;\\n for(int i = 0 ; i < (int)s1.size() ; i++) m1.push_back(s1[i]-'a');\\n for(int i = 0 ; i < (int)s2.size() ; i++) m2.push_back(s2[i]-'a');\\n \\n vector<P> path1;\\n int x1 = 0, y1 = 0; \\n int mx1 = 0, my1 = 0;\\n path1.push_back(P(0, 0));\\n for(int i = 0 ; i < (int)m1.size() ; i++){\\n x1 += dx[ m1[i] ];\\n y1 += dy[ m1[i] ];\\n path1.push_back(P(x1, y1));\\n mx1 = min(mx1, x1);\\n my1 = min(my1, y1); \\n }\\n for(int i = 0 ; i < path1.size() ; i++){\\n path1[i].first -= mx1;\\n path1[i].second -= my1;\\n }\\n sort(path1.begin(), path1.end()); \\n \\n bool flag = false; \\n for(int i = 0 ; i < 6 ; i++){\\n int x2 = 0, y2 = 0;\\n int mx2 = 0, my2 = 0;\\n vector<P> path2;\\n path2.push_back(P(0, 0));\\n for(int j = 0 ; j < (int)m2.size() ; j++){\\n\\tx2 += dx[ (m2[j]+i)%6 ];\\n\\ty2 += dy[ (m2[j]+i)%6 ];\\n\\tpath2.push_back(P(x2, y2));\\n\\tmx2 = min(mx2, x2);\\n\\tmy2 = min(my2, y2);\\n }\\n for(int j = 0 ; j < path2.size() ; j++){\\n\\tpath2[j].first -= mx2;\\n\\tpath2[j].second -= my2;\\n }\\n sort(path2.begin(), path2.end());\\n if(path1 == path2){\\n\\tflag = true;\\n\\tgoto END;\\n }\\n }\\n END:;\\n if(flag) cout << \\\"true\\\" << endl;\\n else cout << \\\"false\\\" << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1228,\n \"score_of_the_acc\": -0.174,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1228_794746\",\n \"code_snippet\": \"#include<iostream>\\n#include<cmath>\\n#include<algorithm>\\n#include<vector>\\n#include<cassert>\\n#include<set>\\n#include<cstdio>\\n\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define inf (1<<29)\\n\\nusing namespace std;\\n\\ntypedef pair<int,int> ii;\\n\\nconst string roulette = \\\"abcdef\\\";\\nint dx[] = {-1,-1,+0,+1,+1,+0};\\nint dy[] = {+1,+0,-1,-1,+0,+1};\\nstring line1,line2;\\nint N;\\nvector<int> Index[2];\\n\\nbool check(vector<ii> v1,vector<ii> v2)\\n{\\n sort(v1.begin(),v1.end());\\n sort(v2.begin(),v2.end());\\n rep(i,N)if(v1[i] != v2[i])return false;\\n return true;\\n}\\n\\nvoid compute()\\n{\\n if(line1.size() != line2.size())\\n {\\n cout << \\\"false\\\" << endl;\\n return;\\n }\\n N = line2.size();\\n \\n vector<ii> ori;\\n int mx,my;\\n ori.push_back(ii(0,0));\\n \\n int x = 0, y = 0;\\n mx = my = 0;\\n rep(i,N)\\n {\\n\\tx += dx[line1[i]-'a'];\\n\\ty += dy[line1[i]-'a'];\\n\\tmx = min(mx,x);\\n\\tmy = min(my,y);\\n\\tori.push_back(ii(x,y));\\n }\\n \\n\\n rep(i,ori.size())ori[i].first -= mx, ori[i].second -= my;\\n\\n\\n rep(j,7)//dir\\n {\\n vector<ii> cont;\\n cont.push_back(ii(0,0));\\n x = y = 0;\\n mx = x, my = y;\\n rep(i,N)\\n\\t{\\n\\t x += dx[(line2[i]-'a'+j)%6];\\n\\t y += dy[(line2[i]-'a'+j)%6];\\n\\t mx = min(mx,x);\\n\\t my = min(my,y);\\n\\t cont.push_back(ii(x,y));\\n\\t}\\n \\n rep(i,cont.size())cont[i].first -= mx,cont[i].second -= my;\\n \\n if(check(ori,cont))\\n\\t{\\n\\t cout << \\\"true\\\" << endl;\\n\\t return;\\n\\t}\\n \\n }\\n \\n \\n \\n \\n cout << \\\"false\\\" << endl;\\n}\\n\\n\\nint main()\\n{\\n int n; \\n while(cin >> n)\\n {\\n cin.ignore();\\n string blank;\\n while(n--)\\n\\t{\\n\\t line1.clear();\\n\\t line2.clear();\\n\\t char c;\\n\\t while((c = getchar()) != '\\\\n')line1 += c;\\n\\t while((c = getchar()) != '\\\\n')line2 += c;\\n\\t cin >> blank;\\n\\t cin.ignore();\\n\\t compute();\\n\\t}\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1216,\n \"score_of_the_acc\": -0.1723,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1228_545467\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <vector>\\n#include <map>\\n#include <set>\\nusing namespace std;\\n\\nconst int dx[6] = {1,0,-1,-1,0,1};\\nconst int dy[6] = {0,1,1,0,-1,-1};\\n\\nset<pair<int,int> > move(const string &s, int diff) {\\n int x, y, mx, my;\\n set<pair<int,int> > res;\\n x = y = mx = my = 0;\\n res.insert(make_pair(x,y));\\n for(int i = 0; i < s.size(); ++i) {\\n int d = (s[i]-'a'+diff)%6;\\n x += dx[d];\\n y += dy[d];\\n res.insert(make_pair(x,y));\\n mx = min(mx, x);\\n my = min(my, y);\\n }\\n set<pair<int,int> > res2;\\n for(set<pair<int,int> >::iterator it = res.begin();\\n it != res.end(); ++it) {\\n res2.insert(make_pair(it->first - mx, it->second - my));\\n }\\n return res2;\\n}\\n\\nint main() {\\n int Tc;\\n cin >> Tc;\\n cin.ignore();\\n for(int tc = 0; tc < Tc; ++tc) {\\n string s, t, dummy;\\n getline(cin, s);\\n getline(cin, t);\\n getline(cin, dummy);\\n set<pair<int,int> > ss = move(s, 0);\\n bool res = false;\\n for(int i = 0; i < 6; ++i) {\\n if(move(t, i) == ss) {\\n\\tres = true;\\n\\tbreak;\\n }\\n }\\n if(res) cout << \\\"true\\\" << endl;\\n else cout << \\\"false\\\" << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1212,\n \"score_of_the_acc\": -0.1784,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1228_542578\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <map>\\n#include <set>\\n#include <cstdio>\\n \\nusing namespace std;\\n \\ntypedef pair<int, int> P;\\n\\nset<P> vis[2];\\nstring in[2];\\nint dy[6] = {1, 0, -1, -1, 0, 1};\\nint dx[6] = {0, 1, 1, 0, -1, -1};\\n \\nvoid calc(int p, int d){\\n int x = 0, y = 0;\\n int mx = 0, my = 0;\\n set<P> tmp;\\n tmp.insert(P(y, x));\\n for(int i=0;i<in[p].size();i++){\\n y += dy[(in[p][i]-'a'+d)%6];\\n x += dx[(in[p][i]-'a'+d)%6];\\n mx = min(mx, x);\\n my = min(my, y);\\n tmp.insert(P(y, x));\\n }\\n for(set<P>::iterator ite=tmp.begin();ite!=tmp.end();ite++){\\n vis[p].insert(P(ite->first-my, ite->second-mx));\\n }\\n}\\n\\nbool solve(){\\n vis[0].clear();\\n calc(0, 0);\\n for(int i=0;i<6;i++){\\n vis[1].clear();\\n calc(1, i);\\n if(vis[0] == vis[1]) return true;\\n }\\n return false;\\n}\\n \\nint main(){\\n int T;\\n cin >> T;\\n getchar();\\n while(T--){\\n string s;\\n for(int i=0;i<2;i++){\\n getline(cin, in[i]);\\n }\\n getline(cin, s);\\n cout << (solve() ? \\\"true\\\" : \\\"false\\\") << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1212,\n \"score_of_the_acc\": -0.1784,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1228_520256\",\n \"code_snippet\": \"#include<cstdio>\\n#include<cstring>\\n#include<algorithm>\\n\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n\\nusing namespace std;\\n\\nconst int dx[6]={1,0,-1,-1,0,1};\\nconst int dy[2][6]={{0,1,0,-1,-1,-1},{1,1,1,0,-1,0}};\\n\\nbool solve(const char *s,const char *t){\\n\\tint m=strlen(s)-1,n=strlen(t)-1;\\n\\n\\tif(m!=n) return false;\\n\\n\\tpair<int,int> p[128];\\n\\tint x=0,y=0;\\n\\trep(i,m+1){\\n\\t\\tp[i]=make_pair(x,y);\\n\\t\\tif(i<m){\\n\\t\\t\\ty+=dy[x&1][s[i]-'a'];\\n\\t\\t\\tx+=dx[s[i]-'a'];\\n\\t\\t}\\n\\t}\\n\\n\\trep(k,m+1) rep(d,6) {\\n\\t\\tbool ok=true;\\n\\t\\tint x=p[k].first,y=p[k].second;\\n\\t\\trep(i,n+1){\\n\\t\\t\\tif(find(p,p+m+1,make_pair(x,y))==p+m+1){ ok=false; break; }\\n\\t\\t\\tif(i<n){\\n\\t\\t\\t\\ty+=dy[x&1][(t[i]-'a'+d)%6];\\n\\t\\t\\t\\tx+=dx[(t[i]-'a'+d)%6];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(ok) return true;\\n\\t}\\n\\treturn false;\\n}\\n\\nint main(){\\n\\tint T; scanf(\\\"%d\\\",&T);\\n\\tfor(getchar();T--;){\\n\\t\\tchar s[128],t[128];\\n\\t\\tfgets(s,128,stdin);\\n\\t\\tfgets(t,128,stdin);\\n\\t\\tgetchar(); getchar();\\n\\t\\tputs(solve(s,t)?\\\"true\\\":\\\"false\\\");\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1016,\n \"score_of_the_acc\": -0.144,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1228_495906\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n#include <string>\\n#include <algorithm>\\n#include <vector>\\n#include <stack>\\n#include <queue>\\n#include <set>\\n#include <map>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <cmath>\\n#include <cassert>\\n\\nusing namespace std;\\n\\n#define FOR(i,k,n) for(int i=(k); i<(int)n; ++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\\n\\ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cout<<*i<<\\\" \\\"; cout<<endl; }\\n\\ntypedef long long ll;\\nconst int INF = 100000000;\\nconst double EPS = 1e-8;\\nconst int MOD = 1000000007;\\ntypedef pair<int, int> P;\\nvoid move(int x, int y, int& nx, int& ny, int r){\\n int dx[6] = {1, 0, -1, -1, 0, 1};\\n int dy[6] = {1, 1, 0, -1, -1, 0};\\n nx = x + dx[r];\\n ny = y + dy[r];\\n}\\n\\nint main(){\\n int N;\\n cin>>N;\\n cin.ignore();\\n while(N--){\\n string s, t, tmp;\\n getline(cin, s);\\n getline(cin, t);\\n getline(cin, tmp);\\n set<P> p_set;\\n int x = 0, y = 0;\\n p_set.insert(P(x, y));\\n REP(i, s.size()){\\n move(x, y, x, y, s[i] - 'a');\\n //printf(\\\"(%d %d) \\\", x, y);\\n p_set.insert(P(x, y));\\n }\\n bool ans = false;\\n REP(d, 6){\\n vector<P> p_vect;\\n x = 0, y = 0;\\n p_vect.push_back(P(x, y));\\n REP(i, t.size()){\\n move(x, y, x, y, (t[i] - 'a' + d) % 6);\\n p_vect.push_back(P(x, y));\\n }\\n REP(i, p_vect.size()){\\n int bx = p_vect[i].first, by = p_vect[i].second;\\n set<P> p_set2;\\n REP(j, p_vect.size()){\\n p_set2.insert(P(p_vect[j].first - bx, p_vect[j].second - by));\\n }\\n if(p_set == p_set2) ans = true;\\n }\\n }\\n if(ans) cout<<\\\"true\\\"<<endl;\\n else cout<<\\\"false\\\"<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 390,\n \"memory_kb\": 1212,\n \"score_of_the_acc\": -0.4234,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1228_331309\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\nusing namespace std;\\n#define rep(i, n) for ( int i = 0; i < (int)n; i++ )\\n#define MAX 250\\n\\nbool compute(string str1, string str2){\\n bool V1[MAX][MAX], V2[MAX][MAX];\\n int ldy1, ldx1, rty1, rtx1;\\n int dy[6] = {1, 1, 0, -1, -1, 0};\\n int dx[6] = {0, -1, -1, 0, 1, 1};\\n if ( str1.size() != str2.size() ) return false;\\n int n = (int)str1.size()*2+2;\\n rep(y, n) rep(x, n) V1[y][x] = false;\\n\\n int py = n/2;\\n int px = n/2;\\n V1[py][px] = true;\\n ldy1 = rty1 = py;\\n ldx1 = rtx1 = px;\\n rep(i, str1.size()){\\n int r = (str1[i]-'a')%6;\\n py += dy[r];\\n px += dx[r];\\n V1[py][px] = true;\\n ldy1 = min(ldy1, py);\\n ldx1 = min(ldx1, px);\\n rty1 = max(rty1, py);\\n rtx1 = max(rtx1, px);\\n }\\n\\n rep(d, 6){\\n int ldy2, ldx2, rty2, rtx2;\\n py = n/2;\\n px = n/2;\\n ldy2 = rty2 = py;\\n ldx2 = rtx2 = px;\\n rep(y, n) rep(x, n) V2[y][x] = false;\\n V2[py][px] = true;\\n rep(i, str2.size()){\\n int r = (str2[i]-'a'+d)%6;\\n py += dy[r];\\n px += dx[r];\\n V2[py][px] = true;\\n ldy2 = min(ldy2, py);\\n ldx2 = min(ldx2, px);\\n rty2 = max(rty2, py);\\n rtx2 = max(rtx2, px);\\n }\\n if ( !(rty1-ldy1 == rty2-ldy2 && rtx1-ldx1 == rtx2-ldx2 ) ) continue;\\n int h = rty1-ldy1+1;\\n int w = rtx1-ldx1+1;\\n bool same = true;\\n rep(y, h) rep(x, w){\\n if ( V1[y+ldy1][x+ldx1] != V2[y+ldy2][x+ldx2] ) {same = false; break;}\\n }\\n if ( same ) return true;\\n }\\n return false;\\n}\\n\\nmain(){\\n int tcase; cin >> tcase;\\n string str1, str2, kasu;\\n getline(cin, kasu);\\n rep(t, tcase) {\\n getline(cin, str1);\\n getline(cin, str2);\\n if (compute(str1, str2) ) cout << \\\"true\\\" << endl;\\n else cout << \\\"false\\\" << endl;\\n getline(cin, kasu);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 0,\n \"score_of_the_acc\": -0.0066,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1228_293288\",\n \"code_snippet\": \"#include <iostream>\\n#include <fstream>\\n#include <sstream>\\n#include <string>\\n#include <vector>\\n#include <queue>\\n#include <deque>\\n#include <stack>\\n#include <algorithm>\\n#include <map>\\n#include <set>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <cmath>\\n#include <climits>\\n#include <cctype>\\n#include <complex>\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef pair<int,int> P;\\n\\n#define REP(i,n,m) for(int i=n;i<m;i++)\\n#define rep(i,n) REP(i,0,n)\\n\\nint dx[] = {1,0,-1,-1, 0,1};\\nint dy[] = {1,1, 0,-1,-1,0};\\n\\nbool equals(set<P> a,set<P> b){\\n if(a.size() != b.size()) return false;\\n\\n set<P>::iterator iterA = a.begin();\\n set<P>::iterator iterB = b.begin();\\n int diffX = (iterA->first) - (iterB->first);\\n int diffY = (iterA->second) - (iterB->second);\\n\\n while(iterA != a.end()){\\n if((iterA->first) - (iterB->first) != diffX ||\\n (iterA->second) - (iterB->second) != diffY){\\n return false;\\n }\\n iterA++;\\n iterB++;\\n }\\n return true;\\n}\\n\\nint main(){\\n int T;\\n string tmp;\\n cin>>T;\\n getline(cin,tmp);\\n\\n while(T--){\\n string a,b;\\n getline(cin,a);\\n getline(cin,b);\\n getline(cin,tmp);\\n\\n set<P> aset;\\n P p(0,0);\\n aset.insert(p);\\n\\n rep(i,a.length()){\\n p.first += dx[a[i] - 'a'];\\n p.second += dy[a[i] - 'a'];\\n aset.insert(p);\\n }\\n\\n /*\\n for(set<P>::iterator iter=aset.begin();iter!=aset.end();iter++){\\n cout<<(iter->first)<<\\\",\\\"<<(iter->second)<<endl;\\n }\\n cout<<\\\"--\\\\n\\\";\\n */\\n\\n bool flg = false;\\n\\n rep(i,6){\\n set<P> bset;\\n bset.clear();\\n p = P(0,0);\\n bset.insert(p);\\n rep(j,b.length()){\\n p.first += dx[((int)b[j] - 'a' + i) % 6];\\n p.second += dy[((int)b[j] - 'a' + i) % 6];\\n bset.insert(p);\\n }\\n /*\\n if(b.length() > 0 && b[0] == 'b'){\\n for(set<P>::iterator iter=bset.begin();iter!=bset.end();iter++){\\n cout<<(iter->first)<<\\\",\\\"<<(iter->second)<<endl;\\n }\\n cout<<endl;\\n }\\n */\\n\\n if(equals(aset,bset)){\\n flg = true;\\n break;\\n }\\n }\\n\\n if(flg){\\n cout<<\\\"true\\\\n\\\";\\n }\\n else{\\n cout<<\\\"false\\\\n\\\";\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 0,\n \"score_of_the_acc\": -0.0199,\n \"final_rank\": 2\n }\n]","isConversational":false}}},{"rowIdx":690,"cells":{"group_id":{"kind":"string","value":"aoj_1232_cpp"},"problem_description":{"kind":"string","value":"Problem A:\nCalling Extraterrestrial Intelligence Again\nA message from humans to extraterrestrial intelligence was sent through the Arecibo radio telescope in Puerto Rico on the afternoon of Saturday November l6, l974. The message consisted of l679 bits and was meant to be translated to a rectangular picture with 23 × 73 pixels. Since both 23 and 73 are prime numbers, 23 × 73 is the unique possible size of the translated rectangular picture each edge of which is longer than l pixel. Of course, there was no guarantee that the receivers would try to translate the message to a rectangular picture. Even if they would, they might put the pixels into the rectangle incorrectly. The senders of the Arecibo message were optimistic.\nWe are planning a similar project. Your task in the project is to find the most suitable width and height of the translated rectangular picture. The term ``most suitable'' is defined as follows. An integer m greater than 4 is given. A positive fraction\na\n/\nb\nless than or equal to 1 is also given. The area of the picture should not be greater than\nm\n. Both of the width and the height of the translated picture should be prime numbers. The ratio of the width to the height should not be less than\na\n/\nb\nnor greater than 1. You should maximize the area of the picture under these constraints.\nIn other words, you will receive an integer\nm\nand a fraction\na\n/\nb\n. It holds that\nm\n> 4 and 0 <\na\n/\nb\n≤ 1 . You should find the pair of prime numbers\np\n,\nq\nsuch that\npq\n≤\nm\nand\na\n/\nb\n≤\np\n/\nq\n≤ 1 , and furthermore, the product\npq\ntakes the maximum value among such pairs of two prime numbers. You should report\np\nand\nq\nas the \"most suitable\" width and height of the translated picture.\nInput\nThe input is a sequence of at most 2000 triplets of positive integers, delimited by a space character in between. Each line contains a single triplet. The sequence is followed by a triplet of zeros, 0 0 0, which indicates the end of the input and should not be treated as data to be processed.\nThe integers of each input triplet are the integer\nm\n, the numerator\na\n, and the denominator\nb\ndescribed above, in this order. You may assume 4 <\nm\n< 100000 and 1 ≤\na\n≤\nb\n≤ 1000.\nOutput\nThe output is a sequence of pairs of positive integers. The\ni\n-th output pair corresponds to the\ni\n-th input triplet. The integers of each output pair are the width\np\nand the height\nq\ndescribed above, in this order.\nEach output line contains a single pair. A space character is put between the integers as a delimiter. No other characters should appear in the output.\nSample Input\n5 1 2\n99999 999 999\n1680 5 16\n1970 1 1\n2002 4 11\n0 0 0\nOutput for the Sample Input\n2 2\n313 313\n23 73\n43 43\n37 53"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1232_10896784","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 pii = pair<int,int>;\nusing pll = 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,s,n) for(ll i = (ll)s;i < (ll)n;i++)\n#define rrep(i,l,r) for(ll i = r-1;i >= l;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\nint main(){\n \n ios_base::sync_with_stdio(0), cin.tie(0);\n vi P;\n vb mem(100000,1);mem[0] = mem[1] = 0;\n for(int i = 2;i < 100000;i++){\n if(!mem[i])continue;\n P.emplace_back(i);\n for(int j = 2*i;j < 100000;j += i)mem[j] = 0;\n }\n while(1){\n int m,a,b;cin >> m >> a >> b;\n if(!m)break;\n // maximize pq s.t. pq <= m && a/b <= p/q <= 1\n ll x = 0,y = 0;\n rep(p,0,sz(P))rep(q,p,sz(P)){\n if(P[p]*P[q] > m)break;\n if(a*P[q] <= b*P[p] && x*y < P[p]*P[q]){x = P[p],y = P[q];}\n }\n cout << x << \" \" << y << \"\\n\";\n }\n \n\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3512,"score_of_the_acc":-0.1727,"final_rank":8},{"submission_id":"aoj_1232_10720609","code_snippet":"// AOJ 1232 - Calling Extraterrestrial Intelligence Again\n// ICPC Asia Japan Regional Contest 2002 - Problem A\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nset<ll> prime;\n\nbool solve() {\n int m, a, b; cin >> m >> a >> b;\n if(m == 0) return false;\n\n int area = 0;\n pair<int,int> best;\n for(ll q : prime) {\n for(ll p : prime) {\n if(p > q) break;\n if(p * q > m) break;\n if(a*q <= b*p && area < p*q) {\n area = p * q;\n best = make_pair(p, q);\n }\n }\n }\n cout << best.first << ' ' << best.second << endl;\n return true;\n}\n\nint main() {\n for(ll i = 3; i < 100000; i += 2) prime.insert(i);\n for(ll i : prime) {\n for(ll j = i; i*j < 100000; j += 2) {\n prime.erase(i * j);\n }\n }\n prime.insert(2);\n \n while(solve()) {}\n}","accuracy":1,"time_ms":270,"memory_kb":5760,"score_of_the_acc":-1.0355,"final_rank":20},{"submission_id":"aoj_1232_10022080","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\n\nvector<int> prime(0);\nint m,a,b;\n\nvoid solve() {\n ll ans = 0;\n pair<int,int> ap;\n for (int i = 0; i < prime.size(); i++) {\n int q = prime[i];\n auto pi = upper_bound(all(prime),min(m/q,q));\n pi--;\n ll p = *pi;\n\n if (p*b >= a*q && p <= q) {\n if (ans < p*q) {\n ans = p*q;\n ap = {p,q};\n }\n }\n }\n\n cout << ap.first << ' ' << ap.second << endl;\n return;\n}\n\n\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n\n prime.push_back(2);\n prime.push_back(3);\n int fl = 0;\n for (int i = 5; i < 10050; i+=2) {\n fl = 0;\n for (int j = 3; j*j<=i; j+=2) {\n if (i%j==0) {\n fl = 1;\n break;\n }\n }\n if (fl == 0) {\n prime.push_back(i);\n }\n }\n\n cin >> m >> a >> b;\n while (m != 0) {\n solve();\n cin >> m >> a >> b;\n }\n}","accuracy":1,"time_ms":20,"memory_kb":3476,"score_of_the_acc":-0.1566,"final_rank":5},{"submission_id":"aoj_1232_9572606","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 main() {\n int MAXS = 1000010;\n vector<bool> Prime(MAXS,true);\n Prime[0] = Prime[1] = false;\n rep(i,2,MAXS) {\n if (Prime[i]) {\n rep(j,2,MAXS) {\n if (i * j >= MAXS) break;\n Prime[i*j] = false;\n }\n }\n }\nwhile(1) {\n int M, A, B;\n cin >> M >> A >> B;\n if (M == 0) return 0;\n int X, Y, MAX = 0;\n rep(i,1,MAXS) {\n if (i*i > M) break;\n if (!Prime[i]) continue;\n rep(j,i,(i*B)/A+1) {\n if (i*j>M) break;\n if (!Prime[j]) continue;\n if (MAX < i * j) X = i, Y = j, MAX = i * j;\n }\n }\n cout << X << ' ' << Y << endl;\n}\n}","accuracy":1,"time_ms":20,"memory_kb":3516,"score_of_the_acc":-0.1713,"final_rank":7},{"submission_id":"aoj_1232_9279442","code_snippet":"#include <algorithm>\n#include <iostream>\n#include <vector>\n\n#define ll long long\nusing namespace std;\n\nint main() {\n vector<ll> prime;\n vector<bool> check(8000, true);\n check[0] = false;\n check[1] = false;\n for (ll i = 2; i < 8000; i++) {\n if (check[i]) {\n for (ll j = i * 2; j < 8000; j += i) {\n check[j] = false;\n }\n }\n }\n\n for (ll i = 0; i < 8000; i++) {\n if (check[i]) {\n prime.push_back(i);\n }\n }\n\n while (1) {\n ll m = 0, a = 0, b = 0, p = 0, q = 0, max = -1;\n double ab;\n cin >> m >> a >> b;\n ab = (double)a /b;\n if (m == 0 && a == 0 && b == 0) {\n break;\n }\n\n for (ll i = 0; i < prime.size(); i++) {\n for (ll j = 0; j < prime.size(); j++) {\n if ((ab <= (double)prime[i] / (double)prime[j])&&((double)prime[i]/(double)prime[j]<=1.0) && (prime[i] * prime[j] <= m)){\n if ((max < prime[i] * prime[j])) {\n max = prime[i] * prime[j];\n p = prime[i];\n q = prime[j];\n }\n }\n }\n }\n\n cout << p << \" \" << q << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":7070,"memory_kb":3120,"score_of_the_acc":-1.0251,"final_rank":18},{"submission_id":"aoj_1232_9279439","code_snippet":"#include <algorithm>\n#include <iostream>\n#include <vector>\n\n#define ll long long\nusing namespace std;\n\nint main() {\n vector<ll> prime;\n vector<bool> check(8000, true);\n check[0] = false;\n check[1] = false;\n for (ll i = 2; i < 8000; i++) {\n if (check[i]) {\n for (ll j = i * 2; j < 8000; j += i) {\n check[j] = false;\n }\n }\n }\n\n for (ll i = 0; i < 8000; i++) {\n if (check[i]) {\n prime.push_back(i);\n }\n }\n\n while (1) {\n ll m = 0, a = 0, b = 0, p = 0, q = 0, max = -1;\n double ab;\n cin >> m >> a >> b;\n ab = (double)a /(double) b;\n if (m == 0 && a == 0 && b == 0) {\n break;\n }\n\n for (ll i = 0; i < prime.size(); i++) {\n for (ll j = 0; j < prime.size(); j++) {\n if ((ab <= (double)prime[i] / (double)prime[j])&&((double)prime[i]/(double)prime[j]<=1.0) && (prime[i] * prime[j] <= m)){\n if ((max < prime[i] * prime[j])) {\n max = prime[i] * prime[j];\n p = prime[i];\n q = prime[j];\n }\n }\n }\n }\n\n cout << p << \" \" << q << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":7070,"memory_kb":3136,"score_of_the_acc":-1.031,"final_rank":19},{"submission_id":"aoj_1232_9144690","code_snippet":"#include <algorithm>\n#include <cmath>\n#include <cstdlib>\n#include <iomanip>\n#include <iostream>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\nvector<int> generatePrimes(int max) {\n\tvector<bool> is_prime_list(max, true);\n\tvector<int> primes;\n\tis_prime_list[0] = is_prime_list[1] = false;\n\n\tfor (int i = 2; i <= max; i++) {\n\t\tif (!is_prime_list[i]) continue;\n\t\tprimes.push_back(i);\n\t\tfor (int j = 2 * i; j <= max; j += i) {\n\t\t\tis_prime_list[j] = false;\n\t\t}\n\t}\n\n\treturn primes;\n}\n\nint main() {\n\tvector<int> primes = generatePrimes(50000);\n\n\twhile (true) {\n\t\tint m, a, b;\n\t\tcin >> m >> a >> b;\n\t\tif (m == 0 && a == 0 && b == 0) break;\n\n\t\tint max = 0, max_p = 0, max_q = 0;\n\t\tfor (auto p = primes.begin(); p != primes.end() && *p <= m; p++) {\n\t\t\tfor (auto q = p; q != primes.end() && *p * *q <= m && a * *q <= b * *p; q++) {\n\t\t\t\tif (max < *p * *q) {\n\t\t\t\t\tmax = *p * *q;\n\t\t\t\t\tmax_p = *p;\n\t\t\t\t\tmax_q = *q;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tcout << max_p << \" \" << max_q << endl;\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":80,"memory_kb":3400,"score_of_the_acc":-0.137,"final_rank":3},{"submission_id":"aoj_1232_9144086","code_snippet":"#include <algorithm>\n#include <bitset>\n#include <cctype>\n#include <cmath>\n#include <deque>\n#include <iomanip>\n#include <iostream>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <vector>\n// #include<atcoder/all>\n\nusing namespace std;\n// using namespace atcoder;\n\n#define ll long long\n#define ull unsigned long long\n#define rep(i, start, end) for (ll i = (ll)start; i < (ll)end; i++)\n#define rep2(i, start, end) for (ll i = (ll)start; i <= (ll)end; i++)\n#define rrep(i, start, end) for (ll i = (ll)start; i >= (ll)end; i--)\n#define all(a) a.begin(), a.end()\n#define P pair<int, int>\n#define Pll pair<ll, ll>\n\ntemplate <class T>\nvoid chmin(T &a, T b) {\n if (a > b) a = b;\n}\n\ntemplate <class T>\nvoid chmax(T &a, T b) {\n if (a < b) a = b;\n}\n\nvoid yn(bool x) { cout << (x ? \"Yes\" : \"No\") << endl; }\n\nll digit(ll n) {\n ll digit_num = 0;\n while (n > 0) {\n digit_num++;\n n /= 10;\n }\n return digit_num;\n}\n\nvoid t() { cout << \"Takahashi\" << endl; }\n\nll power_mod(ll n, ll k, ll mod) {\n // ll mod = 998244353;\n ll result = 1;\n while (k > 0) {\n if ((k & 1) == 1) result = (result * n) % mod;\n n = n * n % mod;\n k >>= 1;\n }\n return result;\n}\n\nint chc_n(char c) {\n int a = c - 'a';\n return a;\n}\n\nchar chn_c(int a) {\n char c = a + 'a';\n return c;\n}\n\nll ch_10num(string s, ll k) {\n ll ans = 0;\n for (char x : s) {\n ans *= k;\n ans += x - '0';\n // cout << ans << endl;\n }\n return ans;\n}\n\nconst int inf = 1 << 30;\n\nconst ll INF = 1ll << 60;\n\nconst int dx[9] = {-1, 0, 1, 0, 1, 1, -1, -1, 0},\n dy[9] = {0, 1, 0, -1, 1, -1, 1, -1, 0};\n\n/*-------------------------------template-------------------------------*/\n\nint main() {\n vector<bool> hurui(8000, true);\n hurui[0] = hurui[1] = false;\n rep(i, 2, 8000) {\n if (hurui[i] == true) {\n for (int j = 2 * i; j < 8000; j += i) {\n hurui[j] = false;\n }\n }\n }\n vector<int> prime;\n rep(i, 2, 8000) {\n if (hurui[i]) prime.push_back(i);\n }\n int primeSize = prime.size();\n while (1) {\n int m, a, b, p = 0, q = 0;\n cin >> m >> a >> b;\n if (m == 0 and a == 0 and b == 0) break;\n rep(i, 0, primeSize) {\n rep(j, i, primeSize){\n if(prime[i]*prime[j] > p*q and prime[i]*prime[j] <= m and (double)a/b <= (double)prime[i]/prime[j]){\n p = prime[i];\n q = prime[j];\n }\n }\n }\n cout << p << \" \" << q << endl;\n }\n}","accuracy":1,"time_ms":790,"memory_kb":3188,"score_of_the_acc":-0.1594,"final_rank":6},{"submission_id":"aoj_1232_8993670","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 = 3.141592653589793;\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\nvc<bool> eratosthenes(int t){\n vc<bool> is_prime(t + 1, true);\n is_prime[0] = false; is_prime[1] = false;\n for (int i = 0; i <= t; i++){\n if (is_prime[i]){\n for (int q = i * 2; q <= t; q += i){\n is_prime[q] = false;\n }\n }\n }\n return is_prime;\n}\n\nauto is_prime = eratosthenes(100000);\nvi prime;\n\npair<int, int> solve(int M, int A, int B){\n int ansp = 2, ansq = 2;\n for (auto q : prime) if (q <= M){\n auto it = lower_bound(all(prime), min(q, M / q));\n if (it != prime.end() && *it * q <= M && *it <= q && A * q <= B * *it){\n if (ansp * ansq < *it * q){\n ansp = *it;\n ansq = q;\n }\n }if (it != prime.begin()){\n it--;\n if (A * q <= B * *it && ansp * ansq < *it * q){\n ansp = *it;\n ansq = q;\n }\n }\n }\n return {ansp, ansq};\n}\n\nint main(){\n rep(i, 100000) if (is_prime[i]) prime.push_back(i);\n vc<pair<int, int>> ans;\n while (true){\n int M, A, B; cin >> M >> A >> B;\n if (M == 0) break;\n ans.push_back(solve(M, A, B));\n }\n for (auto x : ans) cout << x.first << \" \" << x.second << endl;\n}","accuracy":1,"time_ms":120,"memory_kb":3552,"score_of_the_acc":-0.1988,"final_rank":10},{"submission_id":"aoj_1232_8966972","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;\npair<vector<int>, vector<int>> seive(int n) {\n assert(n >= 1);\n vector<int> min_factor(n + 1);\n iota(min_factor.begin(), min_factor.end(), 0);\n min_factor[0] = min_factor[1] = -1;\n vector<int> prime;\n for(long long i = 2; i <= n; ++i) {\n if(min_factor[i] < i) continue;\n prime.push_back(i);\n for(long long j = i * i; j <= n; j += i) {\n if(min_factor[j] == j) min_factor[j] = i;\n }\n }\n return {prime, min_factor};\n}\nint main(void) {\n auto [prime, min_factor] = seive(100000);\n while(1) {\n ll m, a, b;\n cin >> m >> a >> b;\n if(m == 0 and a == 0 and b == 0) break;\n P ans = {0, 0};\n for(ll q : prime) {\n if(q > m / 2) break;\n for(ll p : prime) {\n if(p * q > m or p > q) break;\n if(a * q <= b * p and p * q > ans.first * ans.second) {\n ans = {p, q};\n }\n }\n }\n cout << ans.first << ' ' << ans.second << '\\n';\n }\n}","accuracy":1,"time_ms":30,"memory_kb":3936,"score_of_the_acc":-0.3279,"final_rank":14},{"submission_id":"aoj_1232_8396781","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nvector<int> vec;\nvoid furui(){\n bool f[100010]={};\n vec.push_back(2);\n for(int i=3;i<320;i+=2){\n if(f[i]) continue;\n vec.push_back(i);\n for(int j=i*i;j<100000;j+=i) f[j] = true;\n }\n for(int i=323;i<50000;i+=2){\n if(!f[i]) vec.push_back(i);\n }\n}\nint main(){\n int m, a, b;\n furui();\n while(cin >> m >> a >> b, m){\n int p=0, q=0;\n for(int i=0;i<vec.size();i++){\n for(int j=i;j<vec.size()&&vec[i]*vec[j]<=m&&a*vec[j]<=b*vec[i];j++){\n if(p*q<vec[i]*vec[j]){\n p = vec[i];\n q = vec[j];\n }\n }\n }\n cout << p << \" \" << q << endl;\n }\n return(0);\n}","accuracy":1,"time_ms":210,"memory_kb":3120,"score_of_the_acc":-0.0521,"final_rank":1},{"submission_id":"aoj_1232_8396774","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nvector<int> vec;\nvoid furui(){\n bool f[100010]={};\n vec.push_back(2);\n for(int i=3;i<320;i+=2){\n if(f[i]) continue;\n vec.push_back(i);\n for(int j=i*i;j<100000;j+=i) f[j] = true;\n }\n for(int i=323;i<50000;i+=2){\n if(!f[i]) vec.push_back(i);\n }\n}\nint main(){\n int m, a, b;\n furui();\n while(cin >> m >> a >> b, m){\n int p=0, q=0;\n for(int i=0;i<vec.size();i++){\n for(int j=i;j<vec.size()&&vec[i]*vec[j]<=m;j++){\n if(a*vec[j]<=b*vec[i]){\n if(p*q<vec[i]*vec[j]){\n p = vec[i];\n q = vec[j];\n }\n }\n }\n }\n cout << p << \" \" << q << endl;\n }\n return(0);\n}","accuracy":1,"time_ms":240,"memory_kb":3220,"score_of_the_acc":-0.0932,"final_rank":2},{"submission_id":"aoj_1232_8029186","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n while (1) {\n int m, a, b;\n cin >> m >> a >> b;\n \n if(m == 0 and a == 0 and b == 0) break;\n \n int ans = 0, ansx, ansy;\n double flag = (double)a / b;\n for (int i = 1; i <= m; i++) {\n for (int j = 1; i * j <= m; j++) {\n if(ans <= i * j and flag <= (double)i / j and (double)i / j <= 1) {\n int flag2 = 1;\n for(int k = 2; k * k <= i; k++) {\n if(i == 2) break;\n if(i % k == 0) flag2 = 0;\n }\n for(int k = 2; k * k <= j; k++) {\n if(j == 2) break;\n if(j % k == 0) flag2 = 0;\n }\n \n if(flag2 == 1) {\n ans = i * j;\n ansx = i;\n ansy = j;\n }\n }\n }\n }\n \n cout << ansx << ' ' << ansy << endl;\n }\n \n return 0;\n}","accuracy":1,"time_ms":1000,"memory_kb":3052,"score_of_the_acc":-0.139,"final_rank":4},{"submission_id":"aoj_1232_8017679","code_snippet":"#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<queue>\n#include<set>\n\nusing namespace std;\nusing ll = long long;\n\nll n,a,b;\nvoid solve(){\n vector<int> use(n+1,0);\n vector<ll> can;\n for(int i = 2;i<=n;i++) if(use[i]==0){\n can.push_back(i);\n for(int j = i;j<=n;j+=i) use[j] = 1;\n }\n ll ans = 0;\n ll ni = 0;\n ll nj = 0;\n for(int i = 0;i<can.size();i++) for(int j = i;j<can.size();j++){\n ll now = can[i] * can[j];\n if(now>n) break;\n if(can[j]*a>can[i]*b) continue;\n if(ans<now){\n ans = now;\n ni = can[i];\n nj = can[j];\n }\n }\n cout<<ni<<\" \"<<nj<<endl;\n}\n\nint main(){\n while(true){\n cin>>n>>a>>b;\n if(n==0) break;\n solve();\n }\n}","accuracy":1,"time_ms":340,"memory_kb":3780,"score_of_the_acc":-0.3142,"final_rank":13},{"submission_id":"aoj_1232_7979292","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main() {\n\tint m, a, b;\n\twhile(cin >> m >> a >> b, m) {\n\t\t\n\t\tvector<bool> p(m+1, true);\n\t\tp[0] = false;\n\t\tp[1] = false;\n\t\tfor(int i=2;i*i<=m;i++) {\n\t\t\tfor(int j=2;i*j<=m;j++) {\n\t\t\t\tp[i*j] = false;\n\t\t\t}\n\t\t}\n\t\tint s = 0;\n\t\tint ansx, ansy;\n\t\tfor(int i=2;i*i<=m;i++) {\n\t\t\tfor(int j=i;i*j<=m;j++) {\n\t\t\t\tif(!p[i] || !p[j]) continue; \n\t\t\t\t\n\t\t\t\tif(m >= i*j && (1.0*a/b) <= (1.0*i/j)) {\n\t\t\t\t\tif(s <= i*j) {\n\t\t\t\t\t\tansx = i;\n\t\t\t\t\t\tansy = j;\n\t\t\t\t\t\ts = i*j;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t}\n\t\t}\n\t\tcout << ansx << \" \" << ansy << endl;\n\t}\n}","accuracy":1,"time_ms":890,"memory_kb":3404,"score_of_the_acc":-0.2534,"final_rank":12},{"submission_id":"aoj_1232_7130039","code_snippet":"#include<bits/stdc++.h>\n#define int ll\n#define rep(i, N) for(int i = 0; i < (int)(N); ++i)\n#define per(i, N) for(int i = (int)(N)-1; i >= 0; --i)\n#define all(v) (v).begin(), (v).end()\n#define rall(v) (v).rbegin(), (v).rend()\n#define bit(n, k) (((n) >> (k)) & 1)\n#define pcnt(n) (bitset<64>(n).count())\n#define endl '\\n'\n#define fi first\n#define se second\n#define mkpr make_pair\n#define mktpl make_tuple\n#define eb emplace_back\n\n#ifdef LOCAL\n#define debug(x) cerr << \"line:\"<< __LINE__ << \" \" << #x << \" = \" << x << '\\n'\n#define dbgln() cerr << \"line:\" << __LINE__ << \" passed.\\n\"\n#else\n#define debug(x) void(0)\n#define dbgln() void(0)\n#endif\n\nusing namespace std;\nusing ll = int64_t;\nusing ull = uint64_t;\nusing ld = long double;\nusing point = struct{ ld x, y; };\nusing State = string::iterator;\ntemplate<class T> using max_heap = priority_queue<T>;\ntemplate<class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;\ntemplate<class T> using vec = vector<T>;\ntemplate<class T> using vvec = vec<vec<T>>;\ntemplate<class T> using vvvec = vec<vvec<T>>;\n\nconstexpr ld EPS = 1e-10;\nld Pi = acos(-1);\nconstexpr int INF = 1001001001;\nconstexpr ll LINF = 1001001001001001001ll;\nconstexpr ll MOD = (1) ? 998244353 : 1e9+7;\nconstexpr int NIL = -1;\nconstexpr int pm[2] = {1, -1};\nconstexpr int dy[4] = {0, 1, 0, -1};\nconstexpr int dx[4] = {1, 0, -1, 0};\nconstexpr int dy8[8] = {0, 1, 1, 1, 0, -1, -1, -1};\nconstexpr int dx8[8] = {1, 1, 0, -1, -1, -1, 0, 1};\n\nll cel(ll a, ll b){ return (a + b - 1) / b;}\nll Gcd(ll a, ll b){ return b ? Gcd(b, a % b) : abs(a);}\nll Lcm(ll a, ll b){ return a / Gcd(a, b) * b;}\ntemplate<class T> T powi(T x, ll exp){\n return exp > 0 ? (exp & 1 ? x : 1) * powi(x * x, exp >> 1) : x / x;\n}\nll modpow(ll x, ll exp, ll mod){\n x %= mod;\n return exp > 0 ? (exp & 1 ? x : 1) * modpow(x * x, exp >> 1, mod) % mod : 1;\n}\ntemplate<class T> bool chmin(T &a, T b){ return a > b ? (a = b, true) : 0;}\ntemplate<class T> bool chmax(T &a, T b){ return a < b ? (a = b, true) : 0;}\n\nusing Pair = pair<ll, ll>;\nusing Tpl = tuple<int, int, int>;\n\nbool isPrime(ll p){\n if(p < 2) return false;\n for(ll i = 2; i * i <= p; i++){\n if(p % i == 0) return false;\n }\n return true;\n}\n\nvoid Main(){\n vec<int> Prime(100010, NIL);\n vec<int> mx_P(100010, NIL);\n rep(i, 100010){\n if(isPrime(i)) Prime[i] = i;\n }\n rep(i, 100010){\n if(i == 0) continue;\n if(Prime[i] == NIL) mx_P[i] = mx_P[i - 1];\n else mx_P[i] = i;\n }\n //rep(i, 10) cout << mx_P[i] << endl;\n while(1){\n //cout << mx_P[99999 / 313] << endl;\n int M, A, B; cin >> M >> A >> B;\n if(M == 0) break;\n ll ans = 0, P = 0, Q = 0;\n rep(i, M + 1){\n if(i == 0) continue;\n if(mx_P[M / i] == NIL) continue;\n if(Prime[i] == NIL) continue;\n int val = mx_P[min(i, M / i)];\n if(val == NIL) continue;\n //debug(Prime[M / i]);\n //debug(i);\n if(i * A <= val * B){\n if(chmax(ans, i * val)){\n P = val, Q = i;\n }\n }\n }\n cout << P << \" \" << Q << endl;\n }\n}\nint a = 313*313;\nsigned main(){\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n Main();\n return 0;\n}","accuracy":1,"time_ms":650,"memory_kb":4340,"score_of_the_acc":-0.565,"final_rank":16},{"submission_id":"aoj_1232_6783499","code_snippet":"#line 1 \"a.cpp\"\n/**\n *\tauthor: nok0\n *\tcreated: 2022.07.05 15:37:36\n**/\n#line 1 \"/Users/nok0/Documents/Programming/nok0/cftemp.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n\n#pragma region Macros\n// rep macro\n#define foa(v, a) for(auto &v : a)\n#define repname(a, b, c, d, e, ...) e\n#define rep(...) repname(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)\n#define rep0(x) for(int i = 0; i < (x); ++i)\n#define rep1(i, x) for(int i = 0; i < (x); ++i)\n#define rep2(i, l, r) for(int i = (l); i < (r); ++i)\n#define rep3(i, l, r, c) for(int i = (l); i < (r); i += (c))\n#define repsname(a, b, c, ...) c\n#define reps(...) repsname(__VA_ARGS__, reps1, reps0)(__VA_ARGS__)\n#define reps0(x) for(int i = 1; i <= (x); ++i)\n#define reps1(i, x) for(int i = 1; i <= (x); ++i)\n#define rrepname(a, b, c, d, e, ...) e\n#define rrep(...) rrepname(__VA_ARGS__, rrep3, rrep2, rrep1, rrep0)(__VA_ARGS__)\n#define rrep0(x) for(int i = (x)-1; i >= 0; --i)\n#define rrep1(i, x) for(int i = (x)-1; i >= 0; --i)\n#define rrep2(i, r, l) for(int i = (r)-1; i >= (l); --i)\n#define rrep3(i, r, l, c) for(int i = (r)-1; i >= (l); i -= (c))\n#define rrepsname(a, b, c, ...) c\n#define rreps(...) rrepsname(__VA_ARGS__, rreps1, rreps0)(__VA_ARGS__)\n#define rreps0(x) for(int i = (x); i >= 1; --i)\n#define rreps1(i, x) for(int i = (x); i >= 1; --i)\n\n// name macro\n#define pb push_back\n#define eb emplace_back\n#define SZ(x) ((int)(x).size())\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n#define popcnt(x) __builtin_popcountll(x)\ntemplate <class T = int>\nusing V = std::vector<T>;\ntemplate <class T = int>\nusing VV = std::vector<std::vector<T>>;\ntemplate <class T>\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\nusing ll = long long;\nusing ld = long double;\nusing int128 = __int128_t;\nusing pii = std::pair<int, int>;\nusing pll = std::pair<long long, long long>;\n\n// input macro\ntemplate <class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\n\tis >> p.first >> p.second;\n\treturn is;\n}\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\n\tfor(T &i : v) is >> i;\n\treturn is;\n}\nstd::istream &operator>>(std::istream &is, __int128_t &a) {\n\tstd::string s;\n\tis >> s;\n\t__int128_t ret = 0;\n\tfor(int i = 0; i < s.length(); i++)\n\t\tif('0' <= s[i] and s[i] <= '9')\n\t\t\tret = 10 * ret + s[i] - '0';\n\ta = ret * (s[0] == '-' ? -1 : 1);\n\treturn is;\n}\nnamespace scanner {\nvoid scan(int &a) { std::cin >> a; }\nvoid scan(long long &a) { std::cin >> a; }\nvoid scan(std::string &a) { std::cin >> a; }\nvoid scan(char &a) { std::cin >> a; }\nvoid scan(char a[]) { std::scanf(\"%s\", a); }\nvoid scan(double &a) { std::cin >> a; }\nvoid scan(long double &a) { std::cin >> a; }\ntemplate <class T, class U>\nvoid scan(std::pair<T, U> &p) { std::cin >> p; }\ntemplate <class T>\nvoid scan(std::vector<T> &a) { std::cin >> a; }\nvoid INPUT() {}\ntemplate <class Head, class... Tail>\nvoid INPUT(Head &head, Tail &...tail) {\n\tscan(head);\n\tINPUT(tail...);\n}\n} // namespace scanner\n#define VEC(type, name, size) \\\n\tstd::vector<type> name(size); \\\n\tscanner::INPUT(name)\n#define VVEC(type, name, h, w) \\\n\tstd::vector<std::vector<type>> name(h, std::vector<type>(w)); \\\n\tscanner::INPUT(name)\n#define INT(...) \\\n\tint __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LL(...) \\\n\tlong long __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define STR(...) \\\n\tstd::string __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define CHAR(...) \\\n\tchar __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define DOUBLE(...) \\\n\tdouble __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LD(...) \\\n\tlong double __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n\n// output-macro\ntemplate <class T, class U>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\n\tos << p.first << \" \" << p.second;\n\treturn os;\n}\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &a) {\n\tfor(int i = 0; i < int(a.size()); ++i) {\n\t\tif(i) os << \" \";\n\t\tos << a[i];\n\t}\n\treturn os;\n}\nstd::ostream &operator<<(std::ostream &dest, __int128_t &value) {\n\tstd::ostream::sentry s(dest);\n\tif(s) {\n\t\t__uint128_t tmp = value < 0 ? -value : value;\n\t\tchar buffer[128];\n\t\tchar *d = std::end(buffer);\n\t\tdo {\n\t\t\t--d;\n\t\t\t*d = \"0123456789\"[tmp % 10];\n\t\t\ttmp /= 10;\n\t\t} while(tmp != 0);\n\t\tif(value < 0) {\n\t\t\t--d;\n\t\t\t*d = '-';\n\t\t}\n\t\tint len = std::end(buffer) - d;\n\t\tif(dest.rdbuf()->sputn(d, len) != len) {\n\t\t\tdest.setstate(std::ios_base::badbit);\n\t\t}\n\t}\n\treturn dest;\n}\ntemplate <class T>\nvoid print(const T a) { std::cout << a << '\\n'; }\ntemplate <class Head, class... Tail>\nvoid print(Head H, Tail... T) {\n\tstd::cout << H << ' ';\n\tprint(T...);\n}\ntemplate <class T>\nvoid printel(const T a) { std::cout << a << '\\n'; }\ntemplate <class T>\nvoid printel(const std::vector<T> &a) {\n\tfor(const auto &v : a)\n\t\tstd::cout << v << '\\n';\n}\ntemplate <class Head, class... Tail>\nvoid printel(Head H, Tail... T) {\n\tstd::cout << H << '\\n';\n\tprintel(T...);\n}\nvoid Yes(const bool b = true) { std::cout << (b ? \"Yes\\n\" : \"No\\n\"); }\nvoid No() { std::cout << \"No\\n\"; }\nvoid YES(const bool b = true) { std::cout << (b ? \"YES\\n\" : \"NO\\n\"); }\nvoid NO() { std::cout << \"NO\\n\"; }\nvoid err(const bool b = true) {\n\tif(b) {\n\t\tstd::cout << \"-1\\n\", exit(0);\n\t}\n}\n\n//debug macro\nnamespace debugger {\ntemplate <class T>\nvoid view(const std::vector<T> &a) {\n\tstd::cerr << \"{ \";\n\tfor(const auto &v : a) {\n\t\tstd::cerr << v << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\ntemplate <class T>\nvoid view(const std::vector<std::vector<T>> &a) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &v : a) {\n\t\tstd::cerr << \"\\t\";\n\t\tview(v);\n\t\tstd::cerr << \"\\n\";\n\t}\n\tstd::cerr << \"}\";\n}\ntemplate <class T, class U>\nvoid view(const std::vector<std::pair<T, U>> &a) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &p : a) std::cerr << \"\\t(\" << p.first << \", \" << p.second << \")\\n\";\n\tstd::cerr << \"}\";\n}\ntemplate <class T, class U>\nvoid view(const std::map<T, U> &m) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &p : m) std::cerr << \"\\t[\" << p.first << \"] : \" << p.second << \"\\n\";\n\tstd::cerr << \"}\";\n}\ntemplate <class T, class U>\nvoid view(const std::pair<T, U> &p) { std::cerr << \"(\" << p.first << \", \" << p.second << \")\"; }\ntemplate <class T>\nvoid view(const std::set<T> &s) {\n\tstd::cerr << \"{ \";\n\tfor(auto &v : s) {\n\t\tview(v);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <class T>\nvoid view(const T &e) { std::cerr << e; }\n} // namespace debugger\n#ifdef LOCAL\nvoid debug_out() {}\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head H, Tail... T) {\n\tdebugger::view(H);\n\tstd::cerr << \", \";\n\tdebug_out(T...);\n}\n#define debug(...) \\\n\tdo { \\\n\t\tstd::cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"] : [\"; \\\n\t\tdebug_out(__VA_ARGS__); \\\n\t\tstd::cerr << \"\\b\\b]\\n\"; \\\n\t} while(false)\n#else\n#define debug(...) (void(0))\n#endif\n\n// vector macro\ntemplate <class T>\nint lb(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::lower_bound((a).begin(), (a).end(), (x))); }\ntemplate <class T>\nint ub(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::upper_bound((a).begin(), (a).end(), (x))); }\ntemplate <class T>\nvoid UNIQUE(std::vector<T> &a) {\n\tstd::sort(a.begin(), a.end());\n\ta.erase(std::unique(a.begin(), a.end()), a.end());\n}\ntemplate <class T>\nstd::vector<T> press(std::vector<T> &a) {\n\tauto res = a;\n\tUNIQUE(res);\n\tfor(auto &v : a)\n\t\tv = lb(res, v);\n\treturn res;\n}\n#define SORTname(a, b, c, ...) c\n#define SORT(...) SORTname(__VA_ARGS__, SORT1, SORT0, ...)(__VA_ARGS__)\n#define SORT0(a) std::sort((a).begin(), (a).end())\n#define SORT1(a, c) std::sort((a).begin(), (a).end(), [](const auto x, const auto y) { return x c y; })\ntemplate <class T>\nvoid ADD(std::vector<T> &a, const T x = 1) {\n\tfor(auto &v : a) v += x;\n}\ntemplate <class T>\nvoid SUB(std::vector<T> &a, const T x = 1) {\n\tfor(auto &v : a) v -= x;\n}\nstd::vector<std::pair<char, int>> rle(const string &s) {\n\tint n = s.size();\n\tstd::vector<std::pair<char, int>> ret;\n\tfor(int l = 0; l < n;) {\n\t\tint r = l + 1;\n\t\tfor(; r < n and s[l] == s[r]; r++) {}\n\t\tret.emplace_back(s[l], r - l);\n\t\tl = r;\n\t}\n\treturn ret;\n}\ntemplate <class T>\nstd::vector<std::pair<T, int>> rle(const std::vector<T> &v) {\n\tint n = v.size();\n\tstd::vector<std::pair<T, int>> ret;\n\tfor(int l = 0; l < n;) {\n\t\tint r = l + 1;\n\t\tfor(; r < n and v[l] == v[r]; r++) {}\n\t\tret.emplace_back(v[l], r - l);\n\t\tl = r;\n\t}\n\treturn ret;\n}\nstd::vector<int> iota(int n) {\n\tstd::vector<int> p(n);\n\tstd::iota(p.begin(), p.end(), 0);\n\treturn p;\n}\ntemplate <class T>\nstruct cum_vector {\npublic:\n\tcum_vector() = default;\n\ttemplate <class U>\n\tcum_vector(const std::vector<U> &vec) : cum((int)vec.size() + 1) {\n\t\tfor(int i = 0; i < (int)vec.size(); i++)\n\t\t\tcum[i + 1] = cum[i] + vec[i];\n\t}\n\tT prod(int l, int r) {\n\t\treturn cum[r] - cum[l];\n\t}\n\nprivate:\n\tstd::vector<T> cum;\n};\n\n// math macro\ntemplate <class T, class U>\ninline bool chmin(T &a, const U &b) { return a > b ? a = b, true : false; }\ntemplate <class T, class U>\ninline bool chmax(T &a, const U &b) { return a < b ? a = b, true : false; }\ntemplate <class T>\nT divup(T x, T y) { return (x + y - 1) / y; }\ntemplate <class T>\nT POW(T a, long long n) {\n\tT ret = 1;\n\twhile(n) {\n\t\tif(n & 1) ret *= a;\n\t\ta *= a;\n\t\tn >>= 1;\n\t}\n\treturn ret;\n}\n// modpow\nlong long POW(long long a, long long n, const int mod) {\n\tlong long ret = 1;\n\ta = (a % mod + mod) % mod;\n\twhile(n) {\n\t\tif(n & 1) (ret *= a) %= mod;\n\t\t(a *= a) %= mod;\n\t\tn >>= 1;\n\t}\n\treturn ret;\n}\ntemplate <class T, class F>\nT bin_search(T ok, T ng, const F &f) {\n\twhile(abs(ok - ng) > 1) {\n\t\tT mid = (ok + ng) >> 1;\n\t\t(f(mid) ? ok : ng) = mid;\n\t}\n\treturn ok;\n}\ntemplate <class T, class F>\nT bin_search(T ok, T ng, const F &f, int loop) {\n\tfor(int i = 0; i < loop; i++) {\n\t\tT mid = (ok + ng) / 2;\n\t\t(f(mid) ? ok : ng) = mid;\n\t}\n\treturn ok;\n}\n\n// others\nstruct fast_io {\n\tfast_io() {\n\t\tios::sync_with_stdio(false);\n\t\tcin.tie(nullptr);\n\t\tcout << fixed << setprecision(15);\n\t}\n} fast_io_;\nconst int inf = 1e9;\nconst ll INF = 1e18;\n#pragma endregion\n\nvoid main_();\n\nint main() {\n\tmain_();\n\treturn 0;\n}\n#line 2 \"/Users/nok0/Documents/Programming/nok0/math/osa_k.hpp\"\n\nstruct osa_k {\nprivate:\n\tstd::vector<int> spf, pr;\n\npublic:\n\tosa_k() = default;\n\n\tosa_k(int MAX) : spf(MAX + 1) {\n\t\tfor(int i = 2; i <= MAX; i++) {\n\t\t\tif(spf[i] == 0) {\n\t\t\t\tspf[i] = i;\n\t\t\t\tpr.push_back(i);\n\t\t\t}\n\t\t\tfor(int j = 0; j < pr.size() and pr[j] <= spf[i] and i * pr[j] <= MAX; j++)\n\t\t\t\tspf[i * pr[j]] = pr[j];\n\t\t}\n\t}\n\n\tstd::vector<std::pair<int, int>> PF(int n) {\n\t\tstd::vector<std::pair<int, int>> divisor;\n\t\tif(n == 1) return divisor;\n\t\tint before = spf[n], cnt = 0;\n\t\twhile(n > 1) {\n\t\t\tif(spf[n] == before) {\n\t\t\t\tcnt++;\n\t\t\t\tn /= spf[n];\n\t\t\t} else {\n\t\t\t\tdivisor.emplace_back(before, cnt);\n\t\t\t\tbefore = spf[n];\n\t\t\t\tcnt = 1;\n\t\t\t\tn /= spf[n];\n\t\t\t}\n\t\t}\n\t\tdivisor.emplace_back(before, cnt);\n\t\treturn divisor;\n\t}\n\n\tint smallestprimefactor(const int n) const {\n\t\treturn spf[n];\n\t}\n\n\tbool isPrime(const int n) const {\n\t\treturn n == spf[n];\n\t}\n};\n#line 7 \"a.cpp\"\n\nosa_k pf(200000);\nV<> primes;\n\nvoid solve() {\n\tLL(m, a, b);\n\tif(!m) exit(0);\n\tll mx = 0;\n\tint pres = -1, qres = -1;\n\tfor(auto p : primes) {\n\t\tfor(auto q : primes) {\n\t\t\tif(p * q > m) break;\n\t\t\tif(p > q) continue;\n\t\t\tif(a * q > p * b) continue;\n\t\t\tif(chmax(mx, p * q)) {\n\t\t\t\tpres = p, qres = q;\n\t\t\t}\n\t\t}\n\t}\n\tprint(pres, qres);\n}\n\nvoid main_() {\n\treps(i, 50000) {\n\t\tif(pf.isPrime(i)) primes.pb(i);\n\t}\n\twhile(true) {\n\t\tsolve();\n\t}\n}","accuracy":1,"time_ms":50,"memory_kb":4148,"score_of_the_acc":-0.409,"final_rank":15},{"submission_id":"aoj_1232_6761088","code_snippet":"#include <bits/stdc++.h>\n\n#ifdef _MSC_VER\n# include <intrin.h>\n#else\n# include <x86intrin.h>\n#endif\n\n#include <limits>\n#include <type_traits>\n\nnamespace suisen {\n// ! utility\ntemplate <typename ...Types>\nusing constraints_t = std::enable_if_t<std::conjunction_v<Types...>, std::nullptr_t>;\ntemplate <bool cond_v, typename Then, typename OrElse>\nconstexpr decltype(auto) constexpr_if(Then&& then, OrElse&& or_else) {\n if constexpr (cond_v) {\n return std::forward<Then>(then);\n } else {\n return std::forward<OrElse>(or_else);\n }\n}\n\n// ! function\ntemplate <typename ReturnType, typename Callable, typename ...Args>\nusing is_same_as_invoke_result = std::is_same<std::invoke_result_t<Callable, Args...>, ReturnType>;\ntemplate <typename F, typename T>\nusing is_uni_op = is_same_as_invoke_result<T, F, T>;\ntemplate <typename F, typename T>\nusing is_bin_op = is_same_as_invoke_result<T, F, T, T>;\n\ntemplate <typename Comparator, typename T>\nusing is_comparator = std::is_same<std::invoke_result_t<Comparator, T, T>, bool>;\n\n// ! integral\ntemplate <typename T, typename = constraints_t<std::is_integral<T>>>\nconstexpr int bit_num = std::numeric_limits<std::make_unsigned_t<T>>::digits;\ntemplate <typename T, unsigned int n>\nstruct is_nbit { static constexpr bool value = bit_num<T> == n; };\ntemplate <typename T, unsigned int n>\nstatic constexpr bool is_nbit_v = is_nbit<T, n>::value;\n\n// ?\ntemplate <typename T>\nstruct safely_multipliable {};\ntemplate <>\nstruct safely_multipliable<int> { using type = long long; };\ntemplate <>\nstruct safely_multipliable<long long> { using type = __int128_t; };\ntemplate <>\nstruct safely_multipliable<unsigned int> { using type = unsigned long long; };\ntemplate <>\nstruct safely_multipliable<unsigned long int> { using type = __uint128_t; };\ntemplate <>\nstruct safely_multipliable<unsigned long long> { using type = __uint128_t; };\ntemplate <>\nstruct safely_multipliable<float> { using type = float; };\ntemplate <>\nstruct safely_multipliable<double> { using type = double; };\ntemplate <>\nstruct safely_multipliable<long double> { using type = long double; };\ntemplate <typename T>\nusing safely_multipliable_t = typename safely_multipliable<T>::type;\n\ntemplate <typename T, typename = void>\nstruct rec_value_type {\n using type = T;\n};\ntemplate <typename T>\nstruct rec_value_type<T, std::void_t<typename T::value_type>> {\n using type = typename rec_value_type<typename T::value_type>::type;\n};\ntemplate <typename T>\nusing rec_value_type_t = typename rec_value_type<T>::type;\n\n} // namespace suisen\n\n// ! type aliases\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\n\ntemplate <typename T>\nusing pq_greater = std::priority_queue<T, std::vector<T>, std::greater<T>>;\ntemplate <typename T, typename U>\nusing umap = std::unordered_map<T, U>;\n\n// ! macros (capital: internal macro)\n#define OVERLOAD2(_1,_2,name,...) name\n#define OVERLOAD3(_1,_2,_3,name,...) name\n#define OVERLOAD4(_1,_2,_3,_4,name,...) name\n\n#define REP4(i,l,r,s) for(std::remove_reference_t<std::remove_const_t<decltype(r)>>i=(l);i<(r);i+=(s))\n#define REP3(i,l,r) REP4(i,l,r,1)\n#define REP2(i,n) REP3(i,0,n)\n#define REPINF3(i,l,s) for(std::remove_reference_t<std::remove_const_t<decltype(l)>>i=(l);;i+=(s))\n#define REPINF2(i,l) REPINF3(i,l,1)\n#define REPINF1(i) REPINF2(i,0)\n#define RREP4(i,l,r,s) for(std::remove_reference_t<std::remove_const_t<decltype(r)>>i=(l)+fld((r)-(l)-1,s)*(s);i>=(l);i-=(s))\n#define RREP3(i,l,r) RREP4(i,l,r,1)\n#define RREP2(i,n) RREP3(i,0,n)\n\n#define rep(...) OVERLOAD4(__VA_ARGS__, REP4 , REP3 , REP2 )(__VA_ARGS__)\n#define rrep(...) OVERLOAD4(__VA_ARGS__, RREP4 , RREP3 , RREP2 )(__VA_ARGS__)\n#define repinf(...) OVERLOAD3(__VA_ARGS__, REPINF3, REPINF2, REPINF1)(__VA_ARGS__)\n\n#define CAT_I(a, b) a##b\n#define CAT(a, b) CAT_I(a, b)\n#define UNIQVAR(tag) CAT(tag, __LINE__)\n#define loop(n) for (std::remove_reference_t<std::remove_const_t<decltype(n)>> UNIQVAR(loop_variable) = n; UNIQVAR(loop_variable) --> 0;)\n\n#define all(iterable) std::begin(iterable), std::end(iterable)\n#define input(type, ...) type __VA_ARGS__; read(__VA_ARGS__)\n\n#ifdef LOCAL\n# define debug(...) debug_internal(#__VA_ARGS__, __VA_ARGS__)\n\ntemplate <class T, class... Args>\nvoid debug_internal(const char* s, T&& first, Args&&... args) {\n constexpr const char* prefix = \"[\\033[32mDEBUG\\033[m] \";\n constexpr const char* open_brakets = sizeof...(args) == 0 ? \"\" : \"(\";\n constexpr const char* close_brakets = sizeof...(args) == 0 ? \"\" : \")\";\n std::cerr << prefix << open_brakets << s << close_brakets << \": \" << open_brakets << std::forward<T>(first);\n ((std::cerr << \", \" << std::forward<Args>(args)), ...);\n std::cerr << close_brakets << \"\\n\";\n}\n\n#else\n# define debug(...) void(0)\n#endif\n\n// ! I/O utilities\n\n// __int128_t\nstd::ostream& operator<<(std::ostream& dest, __int128_t value) {\n std::ostream::sentry s(dest);\n if (s) {\n __uint128_t tmp = value < 0 ? -value : value;\n char buffer[128];\n char* d = std::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 = std::end(buffer) - d;\n if (dest.rdbuf()->sputn(d, len) != len) {\n dest.setstate(std::ios_base::badbit);\n }\n }\n return dest;\n}\n// __uint128_t\nstd::ostream& operator<<(std::ostream& dest, __uint128_t value) {\n std::ostream::sentry s(dest);\n if (s) {\n char buffer[128];\n char* d = std::end(buffer);\n do {\n --d;\n *d = \"0123456789\"[value % 10];\n value /= 10;\n } while (value != 0);\n int len = std::end(buffer) - d;\n if (dest.rdbuf()->sputn(d, len) != len) {\n dest.setstate(std::ios_base::badbit);\n }\n }\n return dest;\n}\n\n// pair\ntemplate <typename T, typename U>\nstd::ostream& operator<<(std::ostream& out, const std::pair<T, U>& a) {\n return out << a.first << ' ' << a.second;\n}\n// tuple\ntemplate <unsigned int N = 0, typename ...Args>\nstd::ostream& operator<<(std::ostream& out, const std::tuple<Args...>& a) {\n if constexpr (N >= std::tuple_size_v<std::tuple<Args...>>) {\n return out;\n } else {\n out << std::get<N>(a);\n if constexpr (N + 1 < std::tuple_size_v<std::tuple<Args...>>) {\n out << ' ';\n }\n return operator<<<N + 1>(out, a);\n }\n}\n// vector\ntemplate <typename T>\nstd::ostream& operator<<(std::ostream& out, const std::vector<T>& a) {\n for (auto it = a.begin(); it != a.end();) {\n out << *it;\n if (++it != a.end()) out << ' ';\n }\n return out;\n}\n// array\ntemplate <typename T, size_t N>\nstd::ostream& operator<<(std::ostream& out, const std::array<T, N>& a) {\n for (auto it = a.begin(); it != a.end();) {\n out << *it;\n if (++it != a.end()) out << ' ';\n }\n return out;\n}\ninline void print() { std::cout << '\\n'; }\ntemplate <typename Head, typename... Tail>\ninline void print(const Head& head, const Tail &...tails) {\n std::cout << head;\n if (sizeof...(tails)) std::cout << ' ';\n print(tails...);\n}\ntemplate <typename Iterable>\nauto print_all(const Iterable& v, std::string sep = \" \", std::string end = \"\\n\") -> decltype(std::cout << *v.begin(), void()) {\n for (auto it = v.begin(); it != v.end();) {\n std::cout << *it;\n if (++it != v.end()) std::cout << sep;\n }\n std::cout << end;\n}\n\n__int128_t parse_i128(std::string& s) {\n __int128_t ret = 0;\n for (int i = 0; i < int(s.size()); i++) if ('0' <= s[i] and s[i] <= '9') ret = 10 * ret + s[i] - '0';\n if (s[0] == '-') ret = -ret;\n return ret;\n}\n__uint128_t parse_u128(std::string& s) {\n __uint128_t ret = 0;\n for (int i = 0; i < int(s.size()); i++) if ('0' <= s[i] and s[i] <= '9') ret = 10 * ret + s[i] - '0';\n return ret;\n}\n// __int128_t\nstd::istream& operator>>(std::istream& in, __int128_t& v) {\n std::string s;\n in >> s;\n v = parse_i128(s);\n return in;\n}\n// __uint128_t\nstd::istream& operator>>(std::istream& in, __uint128_t& v) {\n std::string s;\n in >> s;\n v = parse_u128(s);\n return in;\n}\n// pair\ntemplate <typename T, typename U>\nstd::istream& operator>>(std::istream& in, std::pair<T, U>& a) {\n return in >> a.first >> a.second;\n}\n// tuple\ntemplate <unsigned int N = 0, typename ...Args>\nstd::istream& operator>>(std::istream& in, std::tuple<Args...>& a) {\n if constexpr (N >= std::tuple_size_v<std::tuple<Args...>>) {\n return in;\n } else {\n return operator>><N + 1>(in >> std::get<N>(a), a);\n }\n}\n// vector\ntemplate <typename T>\nstd::istream& operator>>(std::istream& in, std::vector<T>& a) {\n for (auto it = a.begin(); it != a.end(); ++it) in >> *it;\n return in;\n}\n// array\ntemplate <typename T, size_t N>\nstd::istream& operator>>(std::istream& in, std::array<T, N>& a) {\n for (auto it = a.begin(); it != a.end(); ++it) in >> *it;\n return in;\n}\ntemplate <typename ...Args>\nvoid read(Args &...args) {\n (std::cin >> ... >> args);\n}\n\n// ! integral utilities\n\n// Returns pow(-1, n)\ntemplate <typename T>\nconstexpr inline int pow_m1(T n) {\n return -(n & 1) | 1;\n}\n// Returns pow(-1, n)\ntemplate <>\nconstexpr inline int pow_m1<bool>(bool n) {\n return -int(n) | 1;\n}\n\n// Returns floor(x / y)\ntemplate <typename T>\nconstexpr inline T fld(const T x, const T y) {\n return (x ^ y) >= 0 ? x / y : (x - (y + pow_m1(y >= 0))) / y;\n}\ntemplate <typename T>\nconstexpr inline T cld(const T x, const T y) {\n return (x ^ y) <= 0 ? x / y : (x + (y + pow_m1(y >= 0))) / y;\n}\n\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 16>> = nullptr>\n__attribute__((target(\"popcnt\"))) constexpr inline int popcount(const T x) { return _mm_popcnt_u32(x); }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 32>> = nullptr>\n__attribute__((target(\"popcnt\"))) constexpr inline int popcount(const T x) { return _mm_popcnt_u32(x); }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 64>> = nullptr>\n__attribute__((target(\"popcnt\"))) constexpr inline int popcount(const T x) { return _mm_popcnt_u64(x); }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 16>> = nullptr>\nconstexpr inline int count_lz(const T x) { return x ? __builtin_clz(x) : suisen::bit_num<T>; }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 32>> = nullptr>\nconstexpr inline int count_lz(const T x) { return x ? __builtin_clz(x) : suisen::bit_num<T>; }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 64>> = nullptr>\nconstexpr inline int count_lz(const T x) { return x ? __builtin_clzll(x) : suisen::bit_num<T>; }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 16>> = nullptr>\nconstexpr inline int count_tz(const T x) { return x ? __builtin_ctz(x) : suisen::bit_num<T>; }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 32>> = nullptr>\nconstexpr inline int count_tz(const T x) { return x ? __builtin_ctz(x) : suisen::bit_num<T>; }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 64>> = nullptr>\nconstexpr inline int count_tz(const T x) { return x ? __builtin_ctzll(x) : suisen::bit_num<T>; }\ntemplate <typename T>\nconstexpr inline int floor_log2(const T x) { return suisen::bit_num<T> -1 - count_lz(x); }\ntemplate <typename T>\nconstexpr inline int ceil_log2(const T x) { return floor_log2(x) + ((x & -x) != x); }\ntemplate <typename T>\nconstexpr inline int kth_bit(const T x, const unsigned int k) { return (x >> k) & 1; }\ntemplate <typename T>\nconstexpr inline int parity(const T x) { return popcount(x) & 1; }\n\n// ! container\n\ntemplate <typename T, typename Comparator, suisen::constraints_t<suisen::is_comparator<Comparator, T>> = nullptr>\nauto priqueue_comp(const Comparator comparator) {\n return std::priority_queue<T, std::vector<T>, Comparator>(comparator);\n}\n\ntemplate <typename Iterable>\nauto isize(const Iterable& iterable) -> decltype(int(iterable.size())) {\n return iterable.size();\n}\n\ntemplate <typename T, typename Gen, suisen::constraints_t<suisen::is_same_as_invoke_result<T, Gen, int>> = nullptr>\nauto generate_vector(int n, Gen generator) {\n std::vector<T> v(n);\n for (int i = 0; i < n; ++i) v[i] = generator(i);\n return v;\n}\ntemplate <typename T>\nauto generate_range_vector(T l, T r) {\n return generate_vector(r - l, [l](int i) { return l + i; });\n}\ntemplate <typename T>\nauto generate_range_vector(T n) {\n return generate_range_vector(0, n);\n}\n\ntemplate <typename T>\nvoid sort_unique_erase(std::vector<T>& a) {\n std::sort(a.begin(), a.end());\n a.erase(std::unique(a.begin(), a.end()), a.end());\n}\n\ntemplate <typename InputIterator, typename BiConsumer>\nauto foreach_adjacent_values(InputIterator first, InputIterator last, BiConsumer f) -> decltype(f(*first++, *last), void()) {\n if (first != last) for (auto itr = first, itl = itr++; itr != last; itl = itr++) f(*itl, *itr);\n}\ntemplate <typename Container, typename BiConsumer>\nauto foreach_adjacent_values(Container c, BiConsumer f) -> decltype(c.begin(), c.end(), void()) {\n foreach_adjacent_values(c.begin(), c.end(), f);\n}\n\n// ! other utilities\n\n// x <- min(x, y). returns true iff `x` has chenged.\ntemplate <typename T>\ninline bool chmin(T& x, const T& y) {\n if (y >= x) return false;\n x = y;\n return true;\n}\n// x <- max(x, y). returns true iff `x` has chenged.\ntemplate <typename T>\ninline bool chmax(T& x, const T& y) {\n if (y <= x) return false;\n x = y;\n return true;\n}\n\ntemplate <typename T, std::enable_if_t<std::is_integral_v<T>, std::nullptr_t> = nullptr>\nstd::string bin(T val, int bit_num = -1) {\n std::string res;\n if (bit_num >= 0) {\n for (int bit = bit_num; bit-- > 0;) res += '0' + ((val >> bit) & 1);\n } else {\n for (; val; val >>= 1) res += '0' + (val & 1);\n std::reverse(res.begin(), res.end());\n }\n return res;\n}\n\ntemplate <typename T, std::enable_if_t<std::is_integral_v<T>, std::nullptr_t> = nullptr>\nstd::vector<T> digits_low_to_high(T val, T base = 10) {\n std::vector<T> res;\n for (; val; val /= base) res.push_back(val % base);\n if (res.empty()) res.push_back(T{ 0 });\n return res;\n}\ntemplate <typename T, std::enable_if_t<std::is_integral_v<T>, std::nullptr_t> = nullptr>\nstd::vector<T> digits_high_to_low(T val, T base = 10) {\n auto res = digits_low_to_high(val, base);\n std::reverse(res.begin(), res.end());\n return res;\n}\n\ntemplate <typename T>\nstd::string join(const std::vector<T>& v, const std::string& sep, const std::string& end) {\n std::ostringstream ss;\n for (auto it = v.begin(); it != v.end();) {\n ss << *it;\n if (++it != v.end()) ss << sep;\n }\n ss << end;\n return ss.str();\n}\n\nnamespace suisen {}\nusing namespace suisen;\nusing namespace std;\n\nstruct io_setup {\n io_setup(int precision = 20) {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n std::cout << std::fixed << std::setprecision(precision);\n }\n} io_setup_{};\n\n// ! code from here\n\n#include <cassert>\n#include <cmath>\n#include <vector>\n\n#include <cstdint>\n\nnamespace suisen::internal::sieve {\n\nconstexpr std::uint8_t K = 8;\nconstexpr std::uint8_t PROD = 2 * 3 * 5;\nconstexpr std::uint8_t RM[K] = { 1, 7, 11, 13, 17, 19, 23, 29 };\nconstexpr std::uint8_t DR[K] = { 6, 4, 2, 4, 2, 4, 6, 2 };\nconstexpr std::uint8_t DF[K][K] = {\n { 0, 0, 0, 0, 0, 0, 0, 1 }, { 1, 1, 1, 0, 1, 1, 1, 1 },\n { 2, 2, 0, 2, 0, 2, 2, 1 }, { 3, 1, 1, 2, 1, 1, 3, 1 },\n { 3, 3, 1, 2, 1, 3, 3, 1 }, { 4, 2, 2, 2, 2, 2, 4, 1 },\n { 5, 3, 1, 4, 1, 3, 5, 1 }, { 6, 4, 2, 4, 2, 4, 6, 1 },\n};\nconstexpr std::uint8_t DRP[K] = { 48, 32, 16, 32, 16, 32, 48, 16 };\nconstexpr std::uint8_t DFP[K][K] = {\n { 0, 0, 0, 0, 0, 0, 0, 8 }, { 8, 8, 8, 0, 8, 8, 8, 8 },\n { 16, 16, 0, 16, 0, 16, 16, 8 }, { 24, 8, 8, 16, 8, 8, 24, 8 },\n { 24, 24, 8, 16, 8, 24, 24, 8 }, { 32, 16, 16, 16, 16, 16, 32, 8 },\n { 40, 24, 8, 32, 8, 24, 40, 8 }, { 48, 32, 16, 32, 16, 32, 48, 8 },\n};\n\nconstexpr std::uint8_t MASK[K][K] = {\n { 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80 }, { 0x02, 0x20, 0x10, 0x01, 0x80, 0x08, 0x04, 0x40 },\n { 0x04, 0x10, 0x01, 0x40, 0x02, 0x80, 0x08, 0x20 }, { 0x08, 0x01, 0x40, 0x20, 0x04, 0x02, 0x80, 0x10 },\n { 0x10, 0x80, 0x02, 0x04, 0x20, 0x40, 0x01, 0x08 }, { 0x20, 0x08, 0x80, 0x02, 0x40, 0x01, 0x10, 0x04 },\n { 0x40, 0x04, 0x08, 0x80, 0x01, 0x10, 0x20, 0x02 }, { 0x80, 0x40, 0x20, 0x10, 0x08, 0x04, 0x02, 0x01 },\n};\nconstexpr std::uint8_t OFFSET[K][K] = {\n { 0, 1, 2, 3, 4, 5, 6, 7, },\n { 1, 5, 4, 0, 7, 3, 2, 6, },\n { 2, 4, 0, 6, 1, 7, 3, 5, },\n { 3, 0, 6, 5, 2, 1, 7, 4, },\n { 4, 7, 1, 2, 5, 6, 0, 3, },\n { 5, 3, 7, 1, 6, 0, 4, 2, },\n { 6, 2, 3, 7, 0, 4, 5, 1, },\n { 7, 6, 5, 4, 3, 2, 1, 0, },\n};\n\nconstexpr std::uint8_t mask_to_index(const std::uint8_t bits) {\n switch (bits) {\n case 1 << 0: return 0;\n case 1 << 1: return 1;\n case 1 << 2: return 2;\n case 1 << 3: return 3;\n case 1 << 4: return 4;\n case 1 << 5: return 5;\n case 1 << 6: return 6;\n case 1 << 7: return 7;\n default: assert(false);\n }\n}\n} // namespace suisen::internal::sieve\n\nnamespace suisen {\n\ntemplate <unsigned int N>\nclass SimpleSieve {\n private:\n static constexpr unsigned int siz = N / internal::sieve::PROD + 1;\n static std::uint8_t flag[siz];\n public:\n SimpleSieve() {\n using namespace internal::sieve;\n flag[0] |= 1;\n unsigned int k_max = (unsigned int) std::sqrt(N + 2) / PROD;\n for (unsigned int kp = 0; kp <= k_max; ++kp) {\n for (std::uint8_t bits = ~flag[kp]; bits; bits &= bits - 1) {\n const std::uint8_t mp = mask_to_index(bits & -bits), m = RM[mp];\n unsigned int kr = kp * (PROD * kp + 2 * m) + m * m / PROD;\n for (std::uint8_t mq = mp; kr < siz; kr += kp * DR[mq] + DF[mp][mq], ++mq &= 7) {\n flag[kr] |= MASK[mp][mq];\n }\n }\n }\n }\n std::vector<int> prime_list(unsigned int max_val = N) const {\n using namespace internal::sieve;\n std::vector<int> res { 2, 3, 5 };\n res.reserve(max_val / 25);\n for (unsigned int i = 0, offset = 0; i < siz and offset < max_val; ++i, offset += PROD) {\n for (uint8_t f = ~flag[i]; f;) {\n uint8_t g = f & -f;\n res.push_back(offset + RM[mask_to_index(g)]);\n f ^= g;\n }\n }\n while (res.size() and (unsigned int) res.back() > max_val) res.pop_back();\n return res;\n }\n bool is_prime(const unsigned int p) const {\n using namespace internal::sieve;\n switch (p) {\n case 2: case 3: case 5: return true;\n default:\n switch (p % PROD) {\n case RM[0]: return ((flag[p / PROD] >> 0) & 1) == 0;\n case RM[1]: return ((flag[p / PROD] >> 1) & 1) == 0;\n case RM[2]: return ((flag[p / PROD] >> 2) & 1) == 0;\n case RM[3]: return ((flag[p / PROD] >> 3) & 1) == 0;\n case RM[4]: return ((flag[p / PROD] >> 4) & 1) == 0;\n case RM[5]: return ((flag[p / PROD] >> 5) & 1) == 0;\n case RM[6]: return ((flag[p / PROD] >> 6) & 1) == 0;\n case RM[7]: return ((flag[p / PROD] >> 7) & 1) == 0;\n default: return false;\n }\n }\n }\n};\ntemplate <unsigned int N>\nstd::uint8_t SimpleSieve<N>::flag[SimpleSieve<N>::siz];\n\ntemplate <unsigned int N>\nclass Sieve {\n private:\n static constexpr unsigned int base_max = (N + 1) * internal::sieve::K / internal::sieve::PROD;\n static unsigned int pf[base_max + internal::sieve::K];\n\n public:\n Sieve() {\n using namespace internal::sieve;\n pf[0] = 1;\n unsigned int k_max = ((unsigned int) std::sqrt(N + 1) - 1) / PROD;\n for (unsigned int kp = 0; kp <= k_max; ++kp) {\n const int base_i = kp * K, base_act_i = kp * PROD;\n for (int mp = 0; mp < K; ++mp) {\n const int m = RM[mp], i = base_i + mp;\n if (pf[i] == 0) {\n unsigned int act_i = base_act_i + m;\n unsigned int base_k = (kp * (PROD * kp + 2 * m) + m * m / PROD) * K;\n for (std::uint8_t mq = mp; base_k <= base_max; base_k += kp * DRP[mq] + DFP[mp][mq], ++mq &= 7) {\n pf[base_k + OFFSET[mp][mq]] = act_i;\n }\n }\n }\n }\n }\n bool is_prime(const unsigned int p) const {\n using namespace internal::sieve;\n switch (p) {\n case 2: case 3: case 5: return true;\n default:\n switch (p % PROD) {\n case RM[0]: return pf[p / PROD * K + 0] == 0;\n case RM[1]: return pf[p / PROD * K + 1] == 0;\n case RM[2]: return pf[p / PROD * K + 2] == 0;\n case RM[3]: return pf[p / PROD * K + 3] == 0;\n case RM[4]: return pf[p / PROD * K + 4] == 0;\n case RM[5]: return pf[p / PROD * K + 5] == 0;\n case RM[6]: return pf[p / PROD * K + 6] == 0;\n case RM[7]: return pf[p / PROD * K + 7] == 0;\n default: return false;\n }\n }\n }\n int prime_factor(const unsigned int p) const {\n using namespace internal::sieve;\n switch (p % PROD) {\n case 0: case 2: case 4: case 6: case 8:\n case 10: case 12: case 14: case 16: case 18:\n case 20: case 22: case 24: case 26: case 28: return 2;\n case 3: case 9: case 15: case 21: case 27: return 3;\n case 5: case 25: return 5;\n case RM[0]: return pf[p / PROD * K + 0] ? pf[p / PROD * K + 0] : p;\n case RM[1]: return pf[p / PROD * K + 1] ? pf[p / PROD * K + 1] : p;\n case RM[2]: return pf[p / PROD * K + 2] ? pf[p / PROD * K + 2] : p;\n case RM[3]: return pf[p / PROD * K + 3] ? pf[p / PROD * K + 3] : p;\n case RM[4]: return pf[p / PROD * K + 4] ? pf[p / PROD * K + 4] : p;\n case RM[5]: return pf[p / PROD * K + 5] ? pf[p / PROD * K + 5] : p;\n case RM[6]: return pf[p / PROD * K + 6] ? pf[p / PROD * K + 6] : p;\n case RM[7]: return pf[p / PROD * K + 7] ? pf[p / PROD * K + 7] : p;\n default: assert(false);\n }\n }\n /**\n * Returns a vector of `{ prime, index }`.\n */\n std::vector<std::pair<int, int>> factorize(unsigned int n) const {\n assert(0 < n and n <= N);\n std::vector<std::pair<int, int>> prime_powers;\n while (n > 1) {\n int p = prime_factor(n), c = 0;\n do { n /= p, ++c; } while (n % p == 0);\n prime_powers.emplace_back(p, c);\n }\n return prime_powers;\n }\n /**\n * Returns the divisors of `n`.\n * It is NOT guaranteed that the returned vector is sorted.\n */\n std::vector<int> divisors(unsigned int n) const {\n assert(0 < n and n <= N);\n std::vector<int> divs { 1 };\n for (auto [prime, index] : factorize(n)) {\n int sz = divs.size();\n for (int i = 0; i < sz; ++i) {\n int d = divs[i];\n for (int j = 0; j < index; ++j) {\n divs.push_back(d *= prime);\n }\n }\n }\n return divs;\n }\n};\ntemplate <unsigned int N>\nunsigned int Sieve<N>::pf[Sieve<N>::base_max + internal::sieve::K];\n} // namespace suisen\n\nSieve<100000> sieve;\n\nint main() {\n vector<int> primes;\n rep(i, 1, 100000) {\n if (sieve.is_prime(i)) {\n primes.push_back(i);\n }\n }\n while (true) {\n input(int, m, a, b);\n if (m == 0) break;\n\n int ans_p = 0, ans_q = 0;\n for (int q : primes) {\n int pl = cld(a * q, b);\n int pr = min(fld(m, q), q);\n auto it = upper_bound(all(primes), pr);\n if (it != primes.begin()) {\n int p = *--it;\n if (pl <= p and ans_p * ans_q < p * q) {\n ans_p = p, ans_q = q;\n }\n }\n }\n print(ans_p, ans_q);\n\n }\n return 0;\n}","accuracy":1,"time_ms":170,"memory_kb":3664,"score_of_the_acc":-0.2473,"final_rank":11},{"submission_id":"aoj_1232_6736721","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef long double ld;\n\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\ntypedef vector<vector<int>> vvi;\ntypedef vector<vector<ll>> vvl;\n\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\ntypedef vector<pii> vpii;\ntypedef vector<pll> vpll;\n\n#define FOR(i, a, b) for(ll i=(a); i<(b); ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define NREP(i, n) FOR(i, 1, n+1)\n\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }\n\nbool isfin = 0;\nconst ll INF = 1e15;\n\nconst ll nmax = 1e5 + 1000;\nll isprime[nmax];\nll preprime[nmax];\n\nvoid init() {\n REP(i, nmax) {\n if(i <= 1) {continue;}\n \n ll flg = 1;\n for(ll j = 2; j * j <= i; ++j) {\n if(i % j == 0) {flg = 0;}\n }\n \n if(flg) {isprime[i] = 1;}\n }\n \n ll now = -1;\n REP(i, nmax) {\n if(isprime[i]) {\n now = i;\n }\n preprime[i] = now;\n }\n \n return;\n}\n\nvoid calc() {\n ll M, A, B; cin >> M >> A >> B;\n \n if(M == 0) {\n isfin = 1;\n return;\n }\n \n ll P = 2, Q = 2;\n ll mult = P * Q;\n \n REP(q, nmax) {\n if(q <= 1) {continue;}\n if(isprime[q] == 0) {continue;}\n \n ll mn = (A * q + B - 1) / B;\n ll mx = min(q, M / q);\n \n ll p = preprime[mx];\n \n if(p == -1) {continue;} \n if(p < mn) {continue;}\n \n if(chmax(mult, p * q)) {\n P = p, Q = q;\n }\n }\n \n cout << P << \" \" << Q << endl;\n \n return;\n}\n\nint main(void) {\n init();\n while(1) {\n calc();\n if(isfin) {break;}\n }\n \n return 0;\n}","accuracy":1,"time_ms":610,"memory_kb":4932,"score_of_the_acc":-0.7779,"final_rank":17},{"submission_id":"aoj_1232_6736477","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\nstd::vector<bool> prime_table(int n) {\n std::vector<bool> prime(n + 1, true);\n prime[0] = prime[1] = false;\n for (int j = 4; j <= n; j += 2) prime[j] = false;\n for (int i = 3; i * i <= n; i += 2) {\n if (!prime[i]) continue;\n for (int j = i * i; j <= n; j += 2 * i) prime[j] = false;\n }\n return prime;\n}\n\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(15);\n\n auto table = prime_table(1e5);\n vector<ll> primes;\n rep(i,2,1e5) if (table[i]) primes.push_back(i);\n while (true) {\n int m, a, b;\n cin >> m >> a >> b;\n if (m == 0) break;\n tuple<ll, int, int> ans(0, 0, 0);\n rep(i,0,primes.size()) {\n int lb = i-1, ub = primes.size();\n ll p = primes[i];\n while (ub - lb > 1) {\n int j = (lb + ub) / 2;\n ll q = primes[j];\n if (p*q > m || a*q > p*b) ub = j;\n else lb = j;\n }\n if (lb >= i) chmax(ans, {primes[i]*primes[lb], primes[i], primes[lb]});\n }\n auto [_, p, q] = ans;\n cout << p << \" \" << q << \"\\n\";\n }\n}","accuracy":1,"time_ms":260,"memory_kb":3460,"score_of_the_acc":-0.1847,"final_rank":9}],"string":"[\n {\n \"submission_id\": \"aoj_1232_10896784\",\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 pii = pair<int,int>;\\nusing pll = 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,s,n) for(ll i = (ll)s;i < (ll)n;i++)\\n#define rrep(i,l,r) for(ll i = r-1;i >= l;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\\nint main(){\\n \\n ios_base::sync_with_stdio(0), cin.tie(0);\\n vi P;\\n vb mem(100000,1);mem[0] = mem[1] = 0;\\n for(int i = 2;i < 100000;i++){\\n if(!mem[i])continue;\\n P.emplace_back(i);\\n for(int j = 2*i;j < 100000;j += i)mem[j] = 0;\\n }\\n while(1){\\n int m,a,b;cin >> m >> a >> b;\\n if(!m)break;\\n // maximize pq s.t. pq <= m && a/b <= p/q <= 1\\n ll x = 0,y = 0;\\n rep(p,0,sz(P))rep(q,p,sz(P)){\\n if(P[p]*P[q] > m)break;\\n if(a*P[q] <= b*P[p] && x*y < P[p]*P[q]){x = P[p],y = P[q];}\\n }\\n cout << x << \\\" \\\" << y << \\\"\\\\n\\\";\\n }\\n \\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3512,\n \"score_of_the_acc\": -0.1727,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1232_10720609\",\n \"code_snippet\": \"// AOJ 1232 - Calling Extraterrestrial Intelligence Again\\n// ICPC Asia Japan Regional Contest 2002 - Problem A\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\nset<ll> prime;\\n\\nbool solve() {\\n int m, a, b; cin >> m >> a >> b;\\n if(m == 0) return false;\\n\\n int area = 0;\\n pair<int,int> best;\\n for(ll q : prime) {\\n for(ll p : prime) {\\n if(p > q) break;\\n if(p * q > m) break;\\n if(a*q <= b*p && area < p*q) {\\n area = p * q;\\n best = make_pair(p, q);\\n }\\n }\\n }\\n cout << best.first << ' ' << best.second << endl;\\n return true;\\n}\\n\\nint main() {\\n for(ll i = 3; i < 100000; i += 2) prime.insert(i);\\n for(ll i : prime) {\\n for(ll j = i; i*j < 100000; j += 2) {\\n prime.erase(i * j);\\n }\\n }\\n prime.insert(2);\\n \\n while(solve()) {}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 270,\n \"memory_kb\": 5760,\n \"score_of_the_acc\": -1.0355,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1232_10022080\",\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\\n\\nvector<int> prime(0);\\nint m,a,b;\\n\\nvoid solve() {\\n ll ans = 0;\\n pair<int,int> ap;\\n for (int i = 0; i < prime.size(); i++) {\\n int q = prime[i];\\n auto pi = upper_bound(all(prime),min(m/q,q));\\n pi--;\\n ll p = *pi;\\n\\n if (p*b >= a*q && p <= q) {\\n if (ans < p*q) {\\n ans = p*q;\\n ap = {p,q};\\n }\\n }\\n }\\n\\n cout << ap.first << ' ' << ap.second << endl;\\n return;\\n}\\n\\n\\nint main() {\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n\\n prime.push_back(2);\\n prime.push_back(3);\\n int fl = 0;\\n for (int i = 5; i < 10050; i+=2) {\\n fl = 0;\\n for (int j = 3; j*j<=i; j+=2) {\\n if (i%j==0) {\\n fl = 1;\\n break;\\n }\\n }\\n if (fl == 0) {\\n prime.push_back(i);\\n }\\n }\\n\\n cin >> m >> a >> b;\\n while (m != 0) {\\n solve();\\n cin >> m >> a >> b;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3476,\n \"score_of_the_acc\": -0.1566,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1232_9572606\",\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 main() {\\n int MAXS = 1000010;\\n vector<bool> Prime(MAXS,true);\\n Prime[0] = Prime[1] = false;\\n rep(i,2,MAXS) {\\n if (Prime[i]) {\\n rep(j,2,MAXS) {\\n if (i * j >= MAXS) break;\\n Prime[i*j] = false;\\n }\\n }\\n }\\nwhile(1) {\\n int M, A, B;\\n cin >> M >> A >> B;\\n if (M == 0) return 0;\\n int X, Y, MAX = 0;\\n rep(i,1,MAXS) {\\n if (i*i > M) break;\\n if (!Prime[i]) continue;\\n rep(j,i,(i*B)/A+1) {\\n if (i*j>M) break;\\n if (!Prime[j]) continue;\\n if (MAX < i * j) X = i, Y = j, MAX = i * j;\\n }\\n }\\n cout << X << ' ' << Y << endl;\\n}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3516,\n \"score_of_the_acc\": -0.1713,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1232_9279442\",\n \"code_snippet\": \"#include <algorithm>\\n#include <iostream>\\n#include <vector>\\n\\n#define ll long long\\nusing namespace std;\\n\\nint main() {\\n vector<ll> prime;\\n vector<bool> check(8000, true);\\n check[0] = false;\\n check[1] = false;\\n for (ll i = 2; i < 8000; i++) {\\n if (check[i]) {\\n for (ll j = i * 2; j < 8000; j += i) {\\n check[j] = false;\\n }\\n }\\n }\\n\\n for (ll i = 0; i < 8000; i++) {\\n if (check[i]) {\\n prime.push_back(i);\\n }\\n }\\n\\n while (1) {\\n ll m = 0, a = 0, b = 0, p = 0, q = 0, max = -1;\\n double ab;\\n cin >> m >> a >> b;\\n ab = (double)a /b;\\n if (m == 0 && a == 0 && b == 0) {\\n break;\\n }\\n\\n for (ll i = 0; i < prime.size(); i++) {\\n for (ll j = 0; j < prime.size(); j++) {\\n if ((ab <= (double)prime[i] / (double)prime[j])&&((double)prime[i]/(double)prime[j]<=1.0) && (prime[i] * prime[j] <= m)){\\n if ((max < prime[i] * prime[j])) {\\n max = prime[i] * prime[j];\\n p = prime[i];\\n q = prime[j];\\n }\\n }\\n }\\n }\\n\\n cout << p << \\\" \\\" << q << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 7070,\n \"memory_kb\": 3120,\n \"score_of_the_acc\": -1.0251,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1232_9279439\",\n \"code_snippet\": \"#include <algorithm>\\n#include <iostream>\\n#include <vector>\\n\\n#define ll long long\\nusing namespace std;\\n\\nint main() {\\n vector<ll> prime;\\n vector<bool> check(8000, true);\\n check[0] = false;\\n check[1] = false;\\n for (ll i = 2; i < 8000; i++) {\\n if (check[i]) {\\n for (ll j = i * 2; j < 8000; j += i) {\\n check[j] = false;\\n }\\n }\\n }\\n\\n for (ll i = 0; i < 8000; i++) {\\n if (check[i]) {\\n prime.push_back(i);\\n }\\n }\\n\\n while (1) {\\n ll m = 0, a = 0, b = 0, p = 0, q = 0, max = -1;\\n double ab;\\n cin >> m >> a >> b;\\n ab = (double)a /(double) b;\\n if (m == 0 && a == 0 && b == 0) {\\n break;\\n }\\n\\n for (ll i = 0; i < prime.size(); i++) {\\n for (ll j = 0; j < prime.size(); j++) {\\n if ((ab <= (double)prime[i] / (double)prime[j])&&((double)prime[i]/(double)prime[j]<=1.0) && (prime[i] * prime[j] <= m)){\\n if ((max < prime[i] * prime[j])) {\\n max = prime[i] * prime[j];\\n p = prime[i];\\n q = prime[j];\\n }\\n }\\n }\\n }\\n\\n cout << p << \\\" \\\" << q << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 7070,\n \"memory_kb\": 3136,\n \"score_of_the_acc\": -1.031,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1232_9144690\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cmath>\\n#include <cstdlib>\\n#include <iomanip>\\n#include <iostream>\\n#include <list>\\n#include <map>\\n#include <numeric>\\n#include <queue>\\n#include <set>\\n#include <string>\\n#include <vector>\\n\\nusing namespace std;\\n\\nvector<int> generatePrimes(int max) {\\n\\tvector<bool> is_prime_list(max, true);\\n\\tvector<int> primes;\\n\\tis_prime_list[0] = is_prime_list[1] = false;\\n\\n\\tfor (int i = 2; i <= max; i++) {\\n\\t\\tif (!is_prime_list[i]) continue;\\n\\t\\tprimes.push_back(i);\\n\\t\\tfor (int j = 2 * i; j <= max; j += i) {\\n\\t\\t\\tis_prime_list[j] = false;\\n\\t\\t}\\n\\t}\\n\\n\\treturn primes;\\n}\\n\\nint main() {\\n\\tvector<int> primes = generatePrimes(50000);\\n\\n\\twhile (true) {\\n\\t\\tint m, a, b;\\n\\t\\tcin >> m >> a >> b;\\n\\t\\tif (m == 0 && a == 0 && b == 0) break;\\n\\n\\t\\tint max = 0, max_p = 0, max_q = 0;\\n\\t\\tfor (auto p = primes.begin(); p != primes.end() && *p <= m; p++) {\\n\\t\\t\\tfor (auto q = p; q != primes.end() && *p * *q <= m && a * *q <= b * *p; q++) {\\n\\t\\t\\t\\tif (max < *p * *q) {\\n\\t\\t\\t\\t\\tmax = *p * *q;\\n\\t\\t\\t\\t\\tmax_p = *p;\\n\\t\\t\\t\\t\\tmax_q = *q;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tcout << max_p << \\\" \\\" << max_q << endl;\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3400,\n \"score_of_the_acc\": -0.137,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1232_9144086\",\n \"code_snippet\": \"#include <algorithm>\\n#include <bitset>\\n#include <cctype>\\n#include <cmath>\\n#include <deque>\\n#include <iomanip>\\n#include <iostream>\\n#include <list>\\n#include <map>\\n#include <numeric>\\n#include <queue>\\n#include <set>\\n#include <sstream>\\n#include <stack>\\n#include <string>\\n#include <vector>\\n// #include<atcoder/all>\\n\\nusing namespace std;\\n// using namespace atcoder;\\n\\n#define ll long long\\n#define ull unsigned long long\\n#define rep(i, start, end) for (ll i = (ll)start; i < (ll)end; i++)\\n#define rep2(i, start, end) for (ll i = (ll)start; i <= (ll)end; i++)\\n#define rrep(i, start, end) for (ll i = (ll)start; i >= (ll)end; i--)\\n#define all(a) a.begin(), a.end()\\n#define P pair<int, int>\\n#define Pll pair<ll, ll>\\n\\ntemplate <class T>\\nvoid chmin(T &a, T b) {\\n if (a > b) a = b;\\n}\\n\\ntemplate <class T>\\nvoid chmax(T &a, T b) {\\n if (a < b) a = b;\\n}\\n\\nvoid yn(bool x) { cout << (x ? \\\"Yes\\\" : \\\"No\\\") << endl; }\\n\\nll digit(ll n) {\\n ll digit_num = 0;\\n while (n > 0) {\\n digit_num++;\\n n /= 10;\\n }\\n return digit_num;\\n}\\n\\nvoid t() { cout << \\\"Takahashi\\\" << endl; }\\n\\nll power_mod(ll n, ll k, ll mod) {\\n // ll mod = 998244353;\\n ll result = 1;\\n while (k > 0) {\\n if ((k & 1) == 1) result = (result * n) % mod;\\n n = n * n % mod;\\n k >>= 1;\\n }\\n return result;\\n}\\n\\nint chc_n(char c) {\\n int a = c - 'a';\\n return a;\\n}\\n\\nchar chn_c(int a) {\\n char c = a + 'a';\\n return c;\\n}\\n\\nll ch_10num(string s, ll k) {\\n ll ans = 0;\\n for (char x : s) {\\n ans *= k;\\n ans += x - '0';\\n // cout << ans << endl;\\n }\\n return ans;\\n}\\n\\nconst int inf = 1 << 30;\\n\\nconst ll INF = 1ll << 60;\\n\\nconst int dx[9] = {-1, 0, 1, 0, 1, 1, -1, -1, 0},\\n dy[9] = {0, 1, 0, -1, 1, -1, 1, -1, 0};\\n\\n/*-------------------------------template-------------------------------*/\\n\\nint main() {\\n vector<bool> hurui(8000, true);\\n hurui[0] = hurui[1] = false;\\n rep(i, 2, 8000) {\\n if (hurui[i] == true) {\\n for (int j = 2 * i; j < 8000; j += i) {\\n hurui[j] = false;\\n }\\n }\\n }\\n vector<int> prime;\\n rep(i, 2, 8000) {\\n if (hurui[i]) prime.push_back(i);\\n }\\n int primeSize = prime.size();\\n while (1) {\\n int m, a, b, p = 0, q = 0;\\n cin >> m >> a >> b;\\n if (m == 0 and a == 0 and b == 0) break;\\n rep(i, 0, primeSize) {\\n rep(j, i, primeSize){\\n if(prime[i]*prime[j] > p*q and prime[i]*prime[j] <= m and (double)a/b <= (double)prime[i]/prime[j]){\\n p = prime[i];\\n q = prime[j];\\n }\\n }\\n }\\n cout << p << \\\" \\\" << q << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 790,\n \"memory_kb\": 3188,\n \"score_of_the_acc\": -0.1594,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1232_8993670\",\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 = 3.141592653589793;\\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\\nvc<bool> eratosthenes(int t){\\n vc<bool> is_prime(t + 1, true);\\n is_prime[0] = false; is_prime[1] = false;\\n for (int i = 0; i <= t; i++){\\n if (is_prime[i]){\\n for (int q = i * 2; q <= t; q += i){\\n is_prime[q] = false;\\n }\\n }\\n }\\n return is_prime;\\n}\\n\\nauto is_prime = eratosthenes(100000);\\nvi prime;\\n\\npair<int, int> solve(int M, int A, int B){\\n int ansp = 2, ansq = 2;\\n for (auto q : prime) if (q <= M){\\n auto it = lower_bound(all(prime), min(q, M / q));\\n if (it != prime.end() && *it * q <= M && *it <= q && A * q <= B * *it){\\n if (ansp * ansq < *it * q){\\n ansp = *it;\\n ansq = q;\\n }\\n }if (it != prime.begin()){\\n it--;\\n if (A * q <= B * *it && ansp * ansq < *it * q){\\n ansp = *it;\\n ansq = q;\\n }\\n }\\n }\\n return {ansp, ansq};\\n}\\n\\nint main(){\\n rep(i, 100000) if (is_prime[i]) prime.push_back(i);\\n vc<pair<int, int>> ans;\\n while (true){\\n int M, A, B; cin >> M >> A >> B;\\n if (M == 0) break;\\n ans.push_back(solve(M, A, B));\\n }\\n for (auto x : ans) cout << x.first << \\\" \\\" << x.second << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 3552,\n \"score_of_the_acc\": -0.1988,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1232_8966972\",\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;\\npair<vector<int>, vector<int>> seive(int n) {\\n assert(n >= 1);\\n vector<int> min_factor(n + 1);\\n iota(min_factor.begin(), min_factor.end(), 0);\\n min_factor[0] = min_factor[1] = -1;\\n vector<int> prime;\\n for(long long i = 2; i <= n; ++i) {\\n if(min_factor[i] < i) continue;\\n prime.push_back(i);\\n for(long long j = i * i; j <= n; j += i) {\\n if(min_factor[j] == j) min_factor[j] = i;\\n }\\n }\\n return {prime, min_factor};\\n}\\nint main(void) {\\n auto [prime, min_factor] = seive(100000);\\n while(1) {\\n ll m, a, b;\\n cin >> m >> a >> b;\\n if(m == 0 and a == 0 and b == 0) break;\\n P ans = {0, 0};\\n for(ll q : prime) {\\n if(q > m / 2) break;\\n for(ll p : prime) {\\n if(p * q > m or p > q) break;\\n if(a * q <= b * p and p * q > ans.first * ans.second) {\\n ans = {p, q};\\n }\\n }\\n }\\n cout << ans.first << ' ' << ans.second << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3936,\n \"score_of_the_acc\": -0.3279,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1232_8396781\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nvector<int> vec;\\nvoid furui(){\\n bool f[100010]={};\\n vec.push_back(2);\\n for(int i=3;i<320;i+=2){\\n if(f[i]) continue;\\n vec.push_back(i);\\n for(int j=i*i;j<100000;j+=i) f[j] = true;\\n }\\n for(int i=323;i<50000;i+=2){\\n if(!f[i]) vec.push_back(i);\\n }\\n}\\nint main(){\\n int m, a, b;\\n furui();\\n while(cin >> m >> a >> b, m){\\n int p=0, q=0;\\n for(int i=0;i<vec.size();i++){\\n for(int j=i;j<vec.size()&&vec[i]*vec[j]<=m&&a*vec[j]<=b*vec[i];j++){\\n if(p*q<vec[i]*vec[j]){\\n p = vec[i];\\n q = vec[j];\\n }\\n }\\n }\\n cout << p << \\\" \\\" << q << endl;\\n }\\n return(0);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 3120,\n \"score_of_the_acc\": -0.0521,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1232_8396774\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nvector<int> vec;\\nvoid furui(){\\n bool f[100010]={};\\n vec.push_back(2);\\n for(int i=3;i<320;i+=2){\\n if(f[i]) continue;\\n vec.push_back(i);\\n for(int j=i*i;j<100000;j+=i) f[j] = true;\\n }\\n for(int i=323;i<50000;i+=2){\\n if(!f[i]) vec.push_back(i);\\n }\\n}\\nint main(){\\n int m, a, b;\\n furui();\\n while(cin >> m >> a >> b, m){\\n int p=0, q=0;\\n for(int i=0;i<vec.size();i++){\\n for(int j=i;j<vec.size()&&vec[i]*vec[j]<=m;j++){\\n if(a*vec[j]<=b*vec[i]){\\n if(p*q<vec[i]*vec[j]){\\n p = vec[i];\\n q = vec[j];\\n }\\n }\\n }\\n }\\n cout << p << \\\" \\\" << q << endl;\\n }\\n return(0);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 3220,\n \"score_of_the_acc\": -0.0932,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1232_8029186\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint main(){\\n while (1) {\\n int m, a, b;\\n cin >> m >> a >> b;\\n \\n if(m == 0 and a == 0 and b == 0) break;\\n \\n int ans = 0, ansx, ansy;\\n double flag = (double)a / b;\\n for (int i = 1; i <= m; i++) {\\n for (int j = 1; i * j <= m; j++) {\\n if(ans <= i * j and flag <= (double)i / j and (double)i / j <= 1) {\\n int flag2 = 1;\\n for(int k = 2; k * k <= i; k++) {\\n if(i == 2) break;\\n if(i % k == 0) flag2 = 0;\\n }\\n for(int k = 2; k * k <= j; k++) {\\n if(j == 2) break;\\n if(j % k == 0) flag2 = 0;\\n }\\n \\n if(flag2 == 1) {\\n ans = i * j;\\n ansx = i;\\n ansy = j;\\n }\\n }\\n }\\n }\\n \\n cout << ansx << ' ' << ansy << endl;\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1000,\n \"memory_kb\": 3052,\n \"score_of_the_acc\": -0.139,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1232_8017679\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<algorithm>\\n#include<queue>\\n#include<set>\\n\\nusing namespace std;\\nusing ll = long long;\\n\\nll n,a,b;\\nvoid solve(){\\n vector<int> use(n+1,0);\\n vector<ll> can;\\n for(int i = 2;i<=n;i++) if(use[i]==0){\\n can.push_back(i);\\n for(int j = i;j<=n;j+=i) use[j] = 1;\\n }\\n ll ans = 0;\\n ll ni = 0;\\n ll nj = 0;\\n for(int i = 0;i<can.size();i++) for(int j = i;j<can.size();j++){\\n ll now = can[i] * can[j];\\n if(now>n) break;\\n if(can[j]*a>can[i]*b) continue;\\n if(ans<now){\\n ans = now;\\n ni = can[i];\\n nj = can[j];\\n }\\n }\\n cout<<ni<<\\\" \\\"<<nj<<endl;\\n}\\n\\nint main(){\\n while(true){\\n cin>>n>>a>>b;\\n if(n==0) break;\\n solve();\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 340,\n \"memory_kb\": 3780,\n \"score_of_the_acc\": -0.3142,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1232_7979292\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nint main() {\\n\\tint m, a, b;\\n\\twhile(cin >> m >> a >> b, m) {\\n\\t\\t\\n\\t\\tvector<bool> p(m+1, true);\\n\\t\\tp[0] = false;\\n\\t\\tp[1] = false;\\n\\t\\tfor(int i=2;i*i<=m;i++) {\\n\\t\\t\\tfor(int j=2;i*j<=m;j++) {\\n\\t\\t\\t\\tp[i*j] = false;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tint s = 0;\\n\\t\\tint ansx, ansy;\\n\\t\\tfor(int i=2;i*i<=m;i++) {\\n\\t\\t\\tfor(int j=i;i*j<=m;j++) {\\n\\t\\t\\t\\tif(!p[i] || !p[j]) continue; \\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(m >= i*j && (1.0*a/b) <= (1.0*i/j)) {\\n\\t\\t\\t\\t\\tif(s <= i*j) {\\n\\t\\t\\t\\t\\t\\tansx = i;\\n\\t\\t\\t\\t\\t\\tansy = j;\\n\\t\\t\\t\\t\\t\\ts = i*j;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << ansx << \\\" \\\" << ansy << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 890,\n \"memory_kb\": 3404,\n \"score_of_the_acc\": -0.2534,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1232_7130039\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define int ll\\n#define rep(i, N) for(int i = 0; i < (int)(N); ++i)\\n#define per(i, N) for(int i = (int)(N)-1; i >= 0; --i)\\n#define all(v) (v).begin(), (v).end()\\n#define rall(v) (v).rbegin(), (v).rend()\\n#define bit(n, k) (((n) >> (k)) & 1)\\n#define pcnt(n) (bitset<64>(n).count())\\n#define endl '\\\\n'\\n#define fi first\\n#define se second\\n#define mkpr make_pair\\n#define mktpl make_tuple\\n#define eb emplace_back\\n\\n#ifdef LOCAL\\n#define debug(x) cerr << \\\"line:\\\"<< __LINE__ << \\\" \\\" << #x << \\\" = \\\" << x << '\\\\n'\\n#define dbgln() cerr << \\\"line:\\\" << __LINE__ << \\\" passed.\\\\n\\\"\\n#else\\n#define debug(x) void(0)\\n#define dbgln() void(0)\\n#endif\\n\\nusing namespace std;\\nusing ll = int64_t;\\nusing ull = uint64_t;\\nusing ld = long double;\\nusing point = struct{ ld x, y; };\\nusing State = string::iterator;\\ntemplate<class T> using max_heap = priority_queue<T>;\\ntemplate<class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;\\ntemplate<class T> using vec = vector<T>;\\ntemplate<class T> using vvec = vec<vec<T>>;\\ntemplate<class T> using vvvec = vec<vvec<T>>;\\n\\nconstexpr ld EPS = 1e-10;\\nld Pi = acos(-1);\\nconstexpr int INF = 1001001001;\\nconstexpr ll LINF = 1001001001001001001ll;\\nconstexpr ll MOD = (1) ? 998244353 : 1e9+7;\\nconstexpr int NIL = -1;\\nconstexpr int pm[2] = {1, -1};\\nconstexpr int dy[4] = {0, 1, 0, -1};\\nconstexpr int dx[4] = {1, 0, -1, 0};\\nconstexpr int dy8[8] = {0, 1, 1, 1, 0, -1, -1, -1};\\nconstexpr int dx8[8] = {1, 1, 0, -1, -1, -1, 0, 1};\\n\\nll cel(ll a, ll b){ return (a + b - 1) / b;}\\nll Gcd(ll a, ll b){ return b ? Gcd(b, a % b) : abs(a);}\\nll Lcm(ll a, ll b){ return a / Gcd(a, b) * b;}\\ntemplate<class T> T powi(T x, ll exp){\\n return exp > 0 ? (exp & 1 ? x : 1) * powi(x * x, exp >> 1) : x / x;\\n}\\nll modpow(ll x, ll exp, ll mod){\\n x %= mod;\\n return exp > 0 ? (exp & 1 ? x : 1) * modpow(x * x, exp >> 1, mod) % mod : 1;\\n}\\ntemplate<class T> bool chmin(T &a, T b){ return a > b ? (a = b, true) : 0;}\\ntemplate<class T> bool chmax(T &a, T b){ return a < b ? (a = b, true) : 0;}\\n\\nusing Pair = pair<ll, ll>;\\nusing Tpl = tuple<int, int, int>;\\n\\nbool isPrime(ll p){\\n if(p < 2) return false;\\n for(ll i = 2; i * i <= p; i++){\\n if(p % i == 0) return false;\\n }\\n return true;\\n}\\n\\nvoid Main(){\\n vec<int> Prime(100010, NIL);\\n vec<int> mx_P(100010, NIL);\\n rep(i, 100010){\\n if(isPrime(i)) Prime[i] = i;\\n }\\n rep(i, 100010){\\n if(i == 0) continue;\\n if(Prime[i] == NIL) mx_P[i] = mx_P[i - 1];\\n else mx_P[i] = i;\\n }\\n //rep(i, 10) cout << mx_P[i] << endl;\\n while(1){\\n //cout << mx_P[99999 / 313] << endl;\\n int M, A, B; cin >> M >> A >> B;\\n if(M == 0) break;\\n ll ans = 0, P = 0, Q = 0;\\n rep(i, M + 1){\\n if(i == 0) continue;\\n if(mx_P[M / i] == NIL) continue;\\n if(Prime[i] == NIL) continue;\\n int val = mx_P[min(i, M / i)];\\n if(val == NIL) continue;\\n //debug(Prime[M / i]);\\n //debug(i);\\n if(i * A <= val * B){\\n if(chmax(ans, i * val)){\\n P = val, Q = i;\\n }\\n }\\n }\\n cout << P << \\\" \\\" << Q << endl;\\n }\\n}\\nint a = 313*313;\\nsigned main(){\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n cout << fixed << setprecision(15);\\n Main();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 650,\n \"memory_kb\": 4340,\n \"score_of_the_acc\": -0.565,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1232_6783499\",\n \"code_snippet\": \"#line 1 \\\"a.cpp\\\"\\n/**\\n *\\tauthor: nok0\\n *\\tcreated: 2022.07.05 15:37:36\\n**/\\n#line 1 \\\"/Users/nok0/Documents/Programming/nok0/cftemp.hpp\\\"\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#pragma region Macros\\n// rep macro\\n#define foa(v, a) for(auto &v : a)\\n#define repname(a, b, c, d, e, ...) e\\n#define rep(...) repname(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)\\n#define rep0(x) for(int i = 0; i < (x); ++i)\\n#define rep1(i, x) for(int i = 0; i < (x); ++i)\\n#define rep2(i, l, r) for(int i = (l); i < (r); ++i)\\n#define rep3(i, l, r, c) for(int i = (l); i < (r); i += (c))\\n#define repsname(a, b, c, ...) c\\n#define reps(...) repsname(__VA_ARGS__, reps1, reps0)(__VA_ARGS__)\\n#define reps0(x) for(int i = 1; i <= (x); ++i)\\n#define reps1(i, x) for(int i = 1; i <= (x); ++i)\\n#define rrepname(a, b, c, d, e, ...) e\\n#define rrep(...) rrepname(__VA_ARGS__, rrep3, rrep2, rrep1, rrep0)(__VA_ARGS__)\\n#define rrep0(x) for(int i = (x)-1; i >= 0; --i)\\n#define rrep1(i, x) for(int i = (x)-1; i >= 0; --i)\\n#define rrep2(i, r, l) for(int i = (r)-1; i >= (l); --i)\\n#define rrep3(i, r, l, c) for(int i = (r)-1; i >= (l); i -= (c))\\n#define rrepsname(a, b, c, ...) c\\n#define rreps(...) rrepsname(__VA_ARGS__, rreps1, rreps0)(__VA_ARGS__)\\n#define rreps0(x) for(int i = (x); i >= 1; --i)\\n#define rreps1(i, x) for(int i = (x); i >= 1; --i)\\n\\n// name macro\\n#define pb push_back\\n#define eb emplace_back\\n#define SZ(x) ((int)(x).size())\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\n#define popcnt(x) __builtin_popcountll(x)\\ntemplate <class T = int>\\nusing V = std::vector<T>;\\ntemplate <class T = int>\\nusing VV = std::vector<std::vector<T>>;\\ntemplate <class T>\\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\\nusing ll = long long;\\nusing ld = long double;\\nusing int128 = __int128_t;\\nusing pii = std::pair<int, int>;\\nusing pll = std::pair<long long, long long>;\\n\\n// input macro\\ntemplate <class T, class U>\\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\\n\\tis >> p.first >> p.second;\\n\\treturn is;\\n}\\ntemplate <class T>\\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\\n\\tfor(T &i : v) is >> i;\\n\\treturn is;\\n}\\nstd::istream &operator>>(std::istream &is, __int128_t &a) {\\n\\tstd::string s;\\n\\tis >> s;\\n\\t__int128_t ret = 0;\\n\\tfor(int i = 0; i < s.length(); i++)\\n\\t\\tif('0' <= s[i] and s[i] <= '9')\\n\\t\\t\\tret = 10 * ret + s[i] - '0';\\n\\ta = ret * (s[0] == '-' ? -1 : 1);\\n\\treturn is;\\n}\\nnamespace scanner {\\nvoid scan(int &a) { std::cin >> a; }\\nvoid scan(long long &a) { std::cin >> a; }\\nvoid scan(std::string &a) { std::cin >> a; }\\nvoid scan(char &a) { std::cin >> a; }\\nvoid scan(char a[]) { std::scanf(\\\"%s\\\", a); }\\nvoid scan(double &a) { std::cin >> a; }\\nvoid scan(long double &a) { std::cin >> a; }\\ntemplate <class T, class U>\\nvoid scan(std::pair<T, U> &p) { std::cin >> p; }\\ntemplate <class T>\\nvoid scan(std::vector<T> &a) { std::cin >> a; }\\nvoid INPUT() {}\\ntemplate <class Head, class... Tail>\\nvoid INPUT(Head &head, Tail &...tail) {\\n\\tscan(head);\\n\\tINPUT(tail...);\\n}\\n} // namespace scanner\\n#define VEC(type, name, size) \\\\\\n\\tstd::vector<type> name(size); \\\\\\n\\tscanner::INPUT(name)\\n#define VVEC(type, name, h, w) \\\\\\n\\tstd::vector<std::vector<type>> name(h, std::vector<type>(w)); \\\\\\n\\tscanner::INPUT(name)\\n#define INT(...) \\\\\\n\\tint __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define LL(...) \\\\\\n\\tlong long __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define STR(...) \\\\\\n\\tstd::string __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define CHAR(...) \\\\\\n\\tchar __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define DOUBLE(...) \\\\\\n\\tdouble __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define LD(...) \\\\\\n\\tlong double __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n\\n// output-macro\\ntemplate <class T, class U>\\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\\n\\tos << p.first << \\\" \\\" << p.second;\\n\\treturn os;\\n}\\ntemplate <class T>\\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &a) {\\n\\tfor(int i = 0; i < int(a.size()); ++i) {\\n\\t\\tif(i) os << \\\" \\\";\\n\\t\\tos << a[i];\\n\\t}\\n\\treturn os;\\n}\\nstd::ostream &operator<<(std::ostream &dest, __int128_t &value) {\\n\\tstd::ostream::sentry s(dest);\\n\\tif(s) {\\n\\t\\t__uint128_t tmp = value < 0 ? -value : value;\\n\\t\\tchar buffer[128];\\n\\t\\tchar *d = std::end(buffer);\\n\\t\\tdo {\\n\\t\\t\\t--d;\\n\\t\\t\\t*d = \\\"0123456789\\\"[tmp % 10];\\n\\t\\t\\ttmp /= 10;\\n\\t\\t} while(tmp != 0);\\n\\t\\tif(value < 0) {\\n\\t\\t\\t--d;\\n\\t\\t\\t*d = '-';\\n\\t\\t}\\n\\t\\tint len = std::end(buffer) - d;\\n\\t\\tif(dest.rdbuf()->sputn(d, len) != len) {\\n\\t\\t\\tdest.setstate(std::ios_base::badbit);\\n\\t\\t}\\n\\t}\\n\\treturn dest;\\n}\\ntemplate <class T>\\nvoid print(const T a) { std::cout << a << '\\\\n'; }\\ntemplate <class Head, class... Tail>\\nvoid print(Head H, Tail... T) {\\n\\tstd::cout << H << ' ';\\n\\tprint(T...);\\n}\\ntemplate <class T>\\nvoid printel(const T a) { std::cout << a << '\\\\n'; }\\ntemplate <class T>\\nvoid printel(const std::vector<T> &a) {\\n\\tfor(const auto &v : a)\\n\\t\\tstd::cout << v << '\\\\n';\\n}\\ntemplate <class Head, class... Tail>\\nvoid printel(Head H, Tail... T) {\\n\\tstd::cout << H << '\\\\n';\\n\\tprintel(T...);\\n}\\nvoid Yes(const bool b = true) { std::cout << (b ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\"); }\\nvoid No() { std::cout << \\\"No\\\\n\\\"; }\\nvoid YES(const bool b = true) { std::cout << (b ? \\\"YES\\\\n\\\" : \\\"NO\\\\n\\\"); }\\nvoid NO() { std::cout << \\\"NO\\\\n\\\"; }\\nvoid err(const bool b = true) {\\n\\tif(b) {\\n\\t\\tstd::cout << \\\"-1\\\\n\\\", exit(0);\\n\\t}\\n}\\n\\n//debug macro\\nnamespace debugger {\\ntemplate <class T>\\nvoid view(const std::vector<T> &a) {\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(const auto &v : a) {\\n\\t\\tstd::cerr << v << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\ntemplate <class T>\\nvoid view(const std::vector<std::vector<T>> &a) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &v : a) {\\n\\t\\tstd::cerr << \\\"\\\\t\\\";\\n\\t\\tview(v);\\n\\t\\tstd::cerr << \\\"\\\\n\\\";\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\ntemplate <class T, class U>\\nvoid view(const std::vector<std::pair<T, U>> &a) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &p : a) std::cerr << \\\"\\\\t(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\\n\\\";\\n\\tstd::cerr << \\\"}\\\";\\n}\\ntemplate <class T, class U>\\nvoid view(const std::map<T, U> &m) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &p : m) std::cerr << \\\"\\\\t[\\\" << p.first << \\\"] : \\\" << p.second << \\\"\\\\n\\\";\\n\\tstd::cerr << \\\"}\\\";\\n}\\ntemplate <class T, class U>\\nvoid view(const std::pair<T, U> &p) { std::cerr << \\\"(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\"; }\\ntemplate <class T>\\nvoid view(const std::set<T> &s) {\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(auto &v : s) {\\n\\t\\tview(v);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <class T>\\nvoid view(const T &e) { std::cerr << e; }\\n} // namespace debugger\\n#ifdef LOCAL\\nvoid debug_out() {}\\ntemplate <typename Head, typename... Tail>\\nvoid debug_out(Head H, Tail... T) {\\n\\tdebugger::view(H);\\n\\tstd::cerr << \\\", \\\";\\n\\tdebug_out(T...);\\n}\\n#define debug(...) \\\\\\n\\tdo { \\\\\\n\\t\\tstd::cerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"] : [\\\"; \\\\\\n\\t\\tdebug_out(__VA_ARGS__); \\\\\\n\\t\\tstd::cerr << \\\"\\\\b\\\\b]\\\\n\\\"; \\\\\\n\\t} while(false)\\n#else\\n#define debug(...) (void(0))\\n#endif\\n\\n// vector macro\\ntemplate <class T>\\nint lb(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::lower_bound((a).begin(), (a).end(), (x))); }\\ntemplate <class T>\\nint ub(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::upper_bound((a).begin(), (a).end(), (x))); }\\ntemplate <class T>\\nvoid UNIQUE(std::vector<T> &a) {\\n\\tstd::sort(a.begin(), a.end());\\n\\ta.erase(std::unique(a.begin(), a.end()), a.end());\\n}\\ntemplate <class T>\\nstd::vector<T> press(std::vector<T> &a) {\\n\\tauto res = a;\\n\\tUNIQUE(res);\\n\\tfor(auto &v : a)\\n\\t\\tv = lb(res, v);\\n\\treturn res;\\n}\\n#define SORTname(a, b, c, ...) c\\n#define SORT(...) SORTname(__VA_ARGS__, SORT1, SORT0, ...)(__VA_ARGS__)\\n#define SORT0(a) std::sort((a).begin(), (a).end())\\n#define SORT1(a, c) std::sort((a).begin(), (a).end(), [](const auto x, const auto y) { return x c y; })\\ntemplate <class T>\\nvoid ADD(std::vector<T> &a, const T x = 1) {\\n\\tfor(auto &v : a) v += x;\\n}\\ntemplate <class T>\\nvoid SUB(std::vector<T> &a, const T x = 1) {\\n\\tfor(auto &v : a) v -= x;\\n}\\nstd::vector<std::pair<char, int>> rle(const string &s) {\\n\\tint n = s.size();\\n\\tstd::vector<std::pair<char, int>> ret;\\n\\tfor(int l = 0; l < n;) {\\n\\t\\tint r = l + 1;\\n\\t\\tfor(; r < n and s[l] == s[r]; r++) {}\\n\\t\\tret.emplace_back(s[l], r - l);\\n\\t\\tl = r;\\n\\t}\\n\\treturn ret;\\n}\\ntemplate <class T>\\nstd::vector<std::pair<T, int>> rle(const std::vector<T> &v) {\\n\\tint n = v.size();\\n\\tstd::vector<std::pair<T, int>> ret;\\n\\tfor(int l = 0; l < n;) {\\n\\t\\tint r = l + 1;\\n\\t\\tfor(; r < n and v[l] == v[r]; r++) {}\\n\\t\\tret.emplace_back(v[l], r - l);\\n\\t\\tl = r;\\n\\t}\\n\\treturn ret;\\n}\\nstd::vector<int> iota(int n) {\\n\\tstd::vector<int> p(n);\\n\\tstd::iota(p.begin(), p.end(), 0);\\n\\treturn p;\\n}\\ntemplate <class T>\\nstruct cum_vector {\\npublic:\\n\\tcum_vector() = default;\\n\\ttemplate <class U>\\n\\tcum_vector(const std::vector<U> &vec) : cum((int)vec.size() + 1) {\\n\\t\\tfor(int i = 0; i < (int)vec.size(); i++)\\n\\t\\t\\tcum[i + 1] = cum[i] + vec[i];\\n\\t}\\n\\tT prod(int l, int r) {\\n\\t\\treturn cum[r] - cum[l];\\n\\t}\\n\\nprivate:\\n\\tstd::vector<T> cum;\\n};\\n\\n// math macro\\ntemplate <class T, class U>\\ninline bool chmin(T &a, const U &b) { return a > b ? a = b, true : false; }\\ntemplate <class T, class U>\\ninline bool chmax(T &a, const U &b) { return a < b ? a = b, true : false; }\\ntemplate <class T>\\nT divup(T x, T y) { return (x + y - 1) / y; }\\ntemplate <class T>\\nT POW(T a, long long n) {\\n\\tT ret = 1;\\n\\twhile(n) {\\n\\t\\tif(n & 1) ret *= a;\\n\\t\\ta *= a;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn ret;\\n}\\n// modpow\\nlong long POW(long long a, long long n, const int mod) {\\n\\tlong long ret = 1;\\n\\ta = (a % mod + mod) % mod;\\n\\twhile(n) {\\n\\t\\tif(n & 1) (ret *= a) %= mod;\\n\\t\\t(a *= a) %= mod;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn ret;\\n}\\ntemplate <class T, class F>\\nT bin_search(T ok, T ng, const F &f) {\\n\\twhile(abs(ok - ng) > 1) {\\n\\t\\tT mid = (ok + ng) >> 1;\\n\\t\\t(f(mid) ? ok : ng) = mid;\\n\\t}\\n\\treturn ok;\\n}\\ntemplate <class T, class F>\\nT bin_search(T ok, T ng, const F &f, int loop) {\\n\\tfor(int i = 0; i < loop; i++) {\\n\\t\\tT mid = (ok + ng) / 2;\\n\\t\\t(f(mid) ? ok : ng) = mid;\\n\\t}\\n\\treturn ok;\\n}\\n\\n// others\\nstruct fast_io {\\n\\tfast_io() {\\n\\t\\tios::sync_with_stdio(false);\\n\\t\\tcin.tie(nullptr);\\n\\t\\tcout << fixed << setprecision(15);\\n\\t}\\n} fast_io_;\\nconst int inf = 1e9;\\nconst ll INF = 1e18;\\n#pragma endregion\\n\\nvoid main_();\\n\\nint main() {\\n\\tmain_();\\n\\treturn 0;\\n}\\n#line 2 \\\"/Users/nok0/Documents/Programming/nok0/math/osa_k.hpp\\\"\\n\\nstruct osa_k {\\nprivate:\\n\\tstd::vector<int> spf, pr;\\n\\npublic:\\n\\tosa_k() = default;\\n\\n\\tosa_k(int MAX) : spf(MAX + 1) {\\n\\t\\tfor(int i = 2; i <= MAX; i++) {\\n\\t\\t\\tif(spf[i] == 0) {\\n\\t\\t\\t\\tspf[i] = i;\\n\\t\\t\\t\\tpr.push_back(i);\\n\\t\\t\\t}\\n\\t\\t\\tfor(int j = 0; j < pr.size() and pr[j] <= spf[i] and i * pr[j] <= MAX; j++)\\n\\t\\t\\t\\tspf[i * pr[j]] = pr[j];\\n\\t\\t}\\n\\t}\\n\\n\\tstd::vector<std::pair<int, int>> PF(int n) {\\n\\t\\tstd::vector<std::pair<int, int>> divisor;\\n\\t\\tif(n == 1) return divisor;\\n\\t\\tint before = spf[n], cnt = 0;\\n\\t\\twhile(n > 1) {\\n\\t\\t\\tif(spf[n] == before) {\\n\\t\\t\\t\\tcnt++;\\n\\t\\t\\t\\tn /= spf[n];\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tdivisor.emplace_back(before, cnt);\\n\\t\\t\\t\\tbefore = spf[n];\\n\\t\\t\\t\\tcnt = 1;\\n\\t\\t\\t\\tn /= spf[n];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tdivisor.emplace_back(before, cnt);\\n\\t\\treturn divisor;\\n\\t}\\n\\n\\tint smallestprimefactor(const int n) const {\\n\\t\\treturn spf[n];\\n\\t}\\n\\n\\tbool isPrime(const int n) const {\\n\\t\\treturn n == spf[n];\\n\\t}\\n};\\n#line 7 \\\"a.cpp\\\"\\n\\nosa_k pf(200000);\\nV<> primes;\\n\\nvoid solve() {\\n\\tLL(m, a, b);\\n\\tif(!m) exit(0);\\n\\tll mx = 0;\\n\\tint pres = -1, qres = -1;\\n\\tfor(auto p : primes) {\\n\\t\\tfor(auto q : primes) {\\n\\t\\t\\tif(p * q > m) break;\\n\\t\\t\\tif(p > q) continue;\\n\\t\\t\\tif(a * q > p * b) continue;\\n\\t\\t\\tif(chmax(mx, p * q)) {\\n\\t\\t\\t\\tpres = p, qres = q;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tprint(pres, qres);\\n}\\n\\nvoid main_() {\\n\\treps(i, 50000) {\\n\\t\\tif(pf.isPrime(i)) primes.pb(i);\\n\\t}\\n\\twhile(true) {\\n\\t\\tsolve();\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 4148,\n \"score_of_the_acc\": -0.409,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1232_6761088\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n#ifdef _MSC_VER\\n# include <intrin.h>\\n#else\\n# include <x86intrin.h>\\n#endif\\n\\n#include <limits>\\n#include <type_traits>\\n\\nnamespace suisen {\\n// ! utility\\ntemplate <typename ...Types>\\nusing constraints_t = std::enable_if_t<std::conjunction_v<Types...>, std::nullptr_t>;\\ntemplate <bool cond_v, typename Then, typename OrElse>\\nconstexpr decltype(auto) constexpr_if(Then&& then, OrElse&& or_else) {\\n if constexpr (cond_v) {\\n return std::forward<Then>(then);\\n } else {\\n return std::forward<OrElse>(or_else);\\n }\\n}\\n\\n// ! function\\ntemplate <typename ReturnType, typename Callable, typename ...Args>\\nusing is_same_as_invoke_result = std::is_same<std::invoke_result_t<Callable, Args...>, ReturnType>;\\ntemplate <typename F, typename T>\\nusing is_uni_op = is_same_as_invoke_result<T, F, T>;\\ntemplate <typename F, typename T>\\nusing is_bin_op = is_same_as_invoke_result<T, F, T, T>;\\n\\ntemplate <typename Comparator, typename T>\\nusing is_comparator = std::is_same<std::invoke_result_t<Comparator, T, T>, bool>;\\n\\n// ! integral\\ntemplate <typename T, typename = constraints_t<std::is_integral<T>>>\\nconstexpr int bit_num = std::numeric_limits<std::make_unsigned_t<T>>::digits;\\ntemplate <typename T, unsigned int n>\\nstruct is_nbit { static constexpr bool value = bit_num<T> == n; };\\ntemplate <typename T, unsigned int n>\\nstatic constexpr bool is_nbit_v = is_nbit<T, n>::value;\\n\\n// ?\\ntemplate <typename T>\\nstruct safely_multipliable {};\\ntemplate <>\\nstruct safely_multipliable<int> { using type = long long; };\\ntemplate <>\\nstruct safely_multipliable<long long> { using type = __int128_t; };\\ntemplate <>\\nstruct safely_multipliable<unsigned int> { using type = unsigned long long; };\\ntemplate <>\\nstruct safely_multipliable<unsigned long int> { using type = __uint128_t; };\\ntemplate <>\\nstruct safely_multipliable<unsigned long long> { using type = __uint128_t; };\\ntemplate <>\\nstruct safely_multipliable<float> { using type = float; };\\ntemplate <>\\nstruct safely_multipliable<double> { using type = double; };\\ntemplate <>\\nstruct safely_multipliable<long double> { using type = long double; };\\ntemplate <typename T>\\nusing safely_multipliable_t = typename safely_multipliable<T>::type;\\n\\ntemplate <typename T, typename = void>\\nstruct rec_value_type {\\n using type = T;\\n};\\ntemplate <typename T>\\nstruct rec_value_type<T, std::void_t<typename T::value_type>> {\\n using type = typename rec_value_type<typename T::value_type>::type;\\n};\\ntemplate <typename T>\\nusing rec_value_type_t = typename rec_value_type<T>::type;\\n\\n} // namespace suisen\\n\\n// ! type aliases\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\n\\ntemplate <typename T>\\nusing pq_greater = std::priority_queue<T, std::vector<T>, std::greater<T>>;\\ntemplate <typename T, typename U>\\nusing umap = std::unordered_map<T, U>;\\n\\n// ! macros (capital: internal macro)\\n#define OVERLOAD2(_1,_2,name,...) name\\n#define OVERLOAD3(_1,_2,_3,name,...) name\\n#define OVERLOAD4(_1,_2,_3,_4,name,...) name\\n\\n#define REP4(i,l,r,s) for(std::remove_reference_t<std::remove_const_t<decltype(r)>>i=(l);i<(r);i+=(s))\\n#define REP3(i,l,r) REP4(i,l,r,1)\\n#define REP2(i,n) REP3(i,0,n)\\n#define REPINF3(i,l,s) for(std::remove_reference_t<std::remove_const_t<decltype(l)>>i=(l);;i+=(s))\\n#define REPINF2(i,l) REPINF3(i,l,1)\\n#define REPINF1(i) REPINF2(i,0)\\n#define RREP4(i,l,r,s) for(std::remove_reference_t<std::remove_const_t<decltype(r)>>i=(l)+fld((r)-(l)-1,s)*(s);i>=(l);i-=(s))\\n#define RREP3(i,l,r) RREP4(i,l,r,1)\\n#define RREP2(i,n) RREP3(i,0,n)\\n\\n#define rep(...) OVERLOAD4(__VA_ARGS__, REP4 , REP3 , REP2 )(__VA_ARGS__)\\n#define rrep(...) OVERLOAD4(__VA_ARGS__, RREP4 , RREP3 , RREP2 )(__VA_ARGS__)\\n#define repinf(...) OVERLOAD3(__VA_ARGS__, REPINF3, REPINF2, REPINF1)(__VA_ARGS__)\\n\\n#define CAT_I(a, b) a##b\\n#define CAT(a, b) CAT_I(a, b)\\n#define UNIQVAR(tag) CAT(tag, __LINE__)\\n#define loop(n) for (std::remove_reference_t<std::remove_const_t<decltype(n)>> UNIQVAR(loop_variable) = n; UNIQVAR(loop_variable) --> 0;)\\n\\n#define all(iterable) std::begin(iterable), std::end(iterable)\\n#define input(type, ...) type __VA_ARGS__; read(__VA_ARGS__)\\n\\n#ifdef LOCAL\\n# define debug(...) debug_internal(#__VA_ARGS__, __VA_ARGS__)\\n\\ntemplate <class T, class... Args>\\nvoid debug_internal(const char* s, T&& first, Args&&... args) {\\n constexpr const char* prefix = \\\"[\\\\033[32mDEBUG\\\\033[m] \\\";\\n constexpr const char* open_brakets = sizeof...(args) == 0 ? \\\"\\\" : \\\"(\\\";\\n constexpr const char* close_brakets = sizeof...(args) == 0 ? \\\"\\\" : \\\")\\\";\\n std::cerr << prefix << open_brakets << s << close_brakets << \\\": \\\" << open_brakets << std::forward<T>(first);\\n ((std::cerr << \\\", \\\" << std::forward<Args>(args)), ...);\\n std::cerr << close_brakets << \\\"\\\\n\\\";\\n}\\n\\n#else\\n# define debug(...) void(0)\\n#endif\\n\\n// ! I/O utilities\\n\\n// __int128_t\\nstd::ostream& operator<<(std::ostream& dest, __int128_t value) {\\n std::ostream::sentry s(dest);\\n if (s) {\\n __uint128_t tmp = value < 0 ? -value : value;\\n char buffer[128];\\n char* d = std::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 = std::end(buffer) - d;\\n if (dest.rdbuf()->sputn(d, len) != len) {\\n dest.setstate(std::ios_base::badbit);\\n }\\n }\\n return dest;\\n}\\n// __uint128_t\\nstd::ostream& operator<<(std::ostream& dest, __uint128_t value) {\\n std::ostream::sentry s(dest);\\n if (s) {\\n char buffer[128];\\n char* d = std::end(buffer);\\n do {\\n --d;\\n *d = \\\"0123456789\\\"[value % 10];\\n value /= 10;\\n } while (value != 0);\\n int len = std::end(buffer) - d;\\n if (dest.rdbuf()->sputn(d, len) != len) {\\n dest.setstate(std::ios_base::badbit);\\n }\\n }\\n return dest;\\n}\\n\\n// pair\\ntemplate <typename T, typename U>\\nstd::ostream& operator<<(std::ostream& out, const std::pair<T, U>& a) {\\n return out << a.first << ' ' << a.second;\\n}\\n// tuple\\ntemplate <unsigned int N = 0, typename ...Args>\\nstd::ostream& operator<<(std::ostream& out, const std::tuple<Args...>& a) {\\n if constexpr (N >= std::tuple_size_v<std::tuple<Args...>>) {\\n return out;\\n } else {\\n out << std::get<N>(a);\\n if constexpr (N + 1 < std::tuple_size_v<std::tuple<Args...>>) {\\n out << ' ';\\n }\\n return operator<<<N + 1>(out, a);\\n }\\n}\\n// vector\\ntemplate <typename T>\\nstd::ostream& operator<<(std::ostream& out, const std::vector<T>& a) {\\n for (auto it = a.begin(); it != a.end();) {\\n out << *it;\\n if (++it != a.end()) out << ' ';\\n }\\n return out;\\n}\\n// array\\ntemplate <typename T, size_t N>\\nstd::ostream& operator<<(std::ostream& out, const std::array<T, N>& a) {\\n for (auto it = a.begin(); it != a.end();) {\\n out << *it;\\n if (++it != a.end()) out << ' ';\\n }\\n return out;\\n}\\ninline void print() { std::cout << '\\\\n'; }\\ntemplate <typename Head, typename... Tail>\\ninline void print(const Head& head, const Tail &...tails) {\\n std::cout << head;\\n if (sizeof...(tails)) std::cout << ' ';\\n print(tails...);\\n}\\ntemplate <typename Iterable>\\nauto print_all(const Iterable& v, std::string sep = \\\" \\\", std::string end = \\\"\\\\n\\\") -> decltype(std::cout << *v.begin(), void()) {\\n for (auto it = v.begin(); it != v.end();) {\\n std::cout << *it;\\n if (++it != v.end()) std::cout << sep;\\n }\\n std::cout << end;\\n}\\n\\n__int128_t parse_i128(std::string& s) {\\n __int128_t ret = 0;\\n for (int i = 0; i < int(s.size()); i++) if ('0' <= s[i] and s[i] <= '9') ret = 10 * ret + s[i] - '0';\\n if (s[0] == '-') ret = -ret;\\n return ret;\\n}\\n__uint128_t parse_u128(std::string& s) {\\n __uint128_t ret = 0;\\n for (int i = 0; i < int(s.size()); i++) if ('0' <= s[i] and s[i] <= '9') ret = 10 * ret + s[i] - '0';\\n return ret;\\n}\\n// __int128_t\\nstd::istream& operator>>(std::istream& in, __int128_t& v) {\\n std::string s;\\n in >> s;\\n v = parse_i128(s);\\n return in;\\n}\\n// __uint128_t\\nstd::istream& operator>>(std::istream& in, __uint128_t& v) {\\n std::string s;\\n in >> s;\\n v = parse_u128(s);\\n return in;\\n}\\n// pair\\ntemplate <typename T, typename U>\\nstd::istream& operator>>(std::istream& in, std::pair<T, U>& a) {\\n return in >> a.first >> a.second;\\n}\\n// tuple\\ntemplate <unsigned int N = 0, typename ...Args>\\nstd::istream& operator>>(std::istream& in, std::tuple<Args...>& a) {\\n if constexpr (N >= std::tuple_size_v<std::tuple<Args...>>) {\\n return in;\\n } else {\\n return operator>><N + 1>(in >> std::get<N>(a), a);\\n }\\n}\\n// vector\\ntemplate <typename T>\\nstd::istream& operator>>(std::istream& in, std::vector<T>& a) {\\n for (auto it = a.begin(); it != a.end(); ++it) in >> *it;\\n return in;\\n}\\n// array\\ntemplate <typename T, size_t N>\\nstd::istream& operator>>(std::istream& in, std::array<T, N>& a) {\\n for (auto it = a.begin(); it != a.end(); ++it) in >> *it;\\n return in;\\n}\\ntemplate <typename ...Args>\\nvoid read(Args &...args) {\\n (std::cin >> ... >> args);\\n}\\n\\n// ! integral utilities\\n\\n// Returns pow(-1, n)\\ntemplate <typename T>\\nconstexpr inline int pow_m1(T n) {\\n return -(n & 1) | 1;\\n}\\n// Returns pow(-1, n)\\ntemplate <>\\nconstexpr inline int pow_m1<bool>(bool n) {\\n return -int(n) | 1;\\n}\\n\\n// Returns floor(x / y)\\ntemplate <typename T>\\nconstexpr inline T fld(const T x, const T y) {\\n return (x ^ y) >= 0 ? x / y : (x - (y + pow_m1(y >= 0))) / y;\\n}\\ntemplate <typename T>\\nconstexpr inline T cld(const T x, const T y) {\\n return (x ^ y) <= 0 ? x / y : (x + (y + pow_m1(y >= 0))) / y;\\n}\\n\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 16>> = nullptr>\\n__attribute__((target(\\\"popcnt\\\"))) constexpr inline int popcount(const T x) { return _mm_popcnt_u32(x); }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 32>> = nullptr>\\n__attribute__((target(\\\"popcnt\\\"))) constexpr inline int popcount(const T x) { return _mm_popcnt_u32(x); }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 64>> = nullptr>\\n__attribute__((target(\\\"popcnt\\\"))) constexpr inline int popcount(const T x) { return _mm_popcnt_u64(x); }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 16>> = nullptr>\\nconstexpr inline int count_lz(const T x) { return x ? __builtin_clz(x) : suisen::bit_num<T>; }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 32>> = nullptr>\\nconstexpr inline int count_lz(const T x) { return x ? __builtin_clz(x) : suisen::bit_num<T>; }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 64>> = nullptr>\\nconstexpr inline int count_lz(const T x) { return x ? __builtin_clzll(x) : suisen::bit_num<T>; }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 16>> = nullptr>\\nconstexpr inline int count_tz(const T x) { return x ? __builtin_ctz(x) : suisen::bit_num<T>; }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 32>> = nullptr>\\nconstexpr inline int count_tz(const T x) { return x ? __builtin_ctz(x) : suisen::bit_num<T>; }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 64>> = nullptr>\\nconstexpr inline int count_tz(const T x) { return x ? __builtin_ctzll(x) : suisen::bit_num<T>; }\\ntemplate <typename T>\\nconstexpr inline int floor_log2(const T x) { return suisen::bit_num<T> -1 - count_lz(x); }\\ntemplate <typename T>\\nconstexpr inline int ceil_log2(const T x) { return floor_log2(x) + ((x & -x) != x); }\\ntemplate <typename T>\\nconstexpr inline int kth_bit(const T x, const unsigned int k) { return (x >> k) & 1; }\\ntemplate <typename T>\\nconstexpr inline int parity(const T x) { return popcount(x) & 1; }\\n\\n// ! container\\n\\ntemplate <typename T, typename Comparator, suisen::constraints_t<suisen::is_comparator<Comparator, T>> = nullptr>\\nauto priqueue_comp(const Comparator comparator) {\\n return std::priority_queue<T, std::vector<T>, Comparator>(comparator);\\n}\\n\\ntemplate <typename Iterable>\\nauto isize(const Iterable& iterable) -> decltype(int(iterable.size())) {\\n return iterable.size();\\n}\\n\\ntemplate <typename T, typename Gen, suisen::constraints_t<suisen::is_same_as_invoke_result<T, Gen, int>> = nullptr>\\nauto generate_vector(int n, Gen generator) {\\n std::vector<T> v(n);\\n for (int i = 0; i < n; ++i) v[i] = generator(i);\\n return v;\\n}\\ntemplate <typename T>\\nauto generate_range_vector(T l, T r) {\\n return generate_vector(r - l, [l](int i) { return l + i; });\\n}\\ntemplate <typename T>\\nauto generate_range_vector(T n) {\\n return generate_range_vector(0, n);\\n}\\n\\ntemplate <typename T>\\nvoid sort_unique_erase(std::vector<T>& a) {\\n std::sort(a.begin(), a.end());\\n a.erase(std::unique(a.begin(), a.end()), a.end());\\n}\\n\\ntemplate <typename InputIterator, typename BiConsumer>\\nauto foreach_adjacent_values(InputIterator first, InputIterator last, BiConsumer f) -> decltype(f(*first++, *last), void()) {\\n if (first != last) for (auto itr = first, itl = itr++; itr != last; itl = itr++) f(*itl, *itr);\\n}\\ntemplate <typename Container, typename BiConsumer>\\nauto foreach_adjacent_values(Container c, BiConsumer f) -> decltype(c.begin(), c.end(), void()) {\\n foreach_adjacent_values(c.begin(), c.end(), f);\\n}\\n\\n// ! other utilities\\n\\n// x <- min(x, y). returns true iff `x` has chenged.\\ntemplate <typename T>\\ninline bool chmin(T& x, const T& y) {\\n if (y >= x) return false;\\n x = y;\\n return true;\\n}\\n// x <- max(x, y). returns true iff `x` has chenged.\\ntemplate <typename T>\\ninline bool chmax(T& x, const T& y) {\\n if (y <= x) return false;\\n x = y;\\n return true;\\n}\\n\\ntemplate <typename T, std::enable_if_t<std::is_integral_v<T>, std::nullptr_t> = nullptr>\\nstd::string bin(T val, int bit_num = -1) {\\n std::string res;\\n if (bit_num >= 0) {\\n for (int bit = bit_num; bit-- > 0;) res += '0' + ((val >> bit) & 1);\\n } else {\\n for (; val; val >>= 1) res += '0' + (val & 1);\\n std::reverse(res.begin(), res.end());\\n }\\n return res;\\n}\\n\\ntemplate <typename T, std::enable_if_t<std::is_integral_v<T>, std::nullptr_t> = nullptr>\\nstd::vector<T> digits_low_to_high(T val, T base = 10) {\\n std::vector<T> res;\\n for (; val; val /= base) res.push_back(val % base);\\n if (res.empty()) res.push_back(T{ 0 });\\n return res;\\n}\\ntemplate <typename T, std::enable_if_t<std::is_integral_v<T>, std::nullptr_t> = nullptr>\\nstd::vector<T> digits_high_to_low(T val, T base = 10) {\\n auto res = digits_low_to_high(val, base);\\n std::reverse(res.begin(), res.end());\\n return res;\\n}\\n\\ntemplate <typename T>\\nstd::string join(const std::vector<T>& v, const std::string& sep, const std::string& end) {\\n std::ostringstream ss;\\n for (auto it = v.begin(); it != v.end();) {\\n ss << *it;\\n if (++it != v.end()) ss << sep;\\n }\\n ss << end;\\n return ss.str();\\n}\\n\\nnamespace suisen {}\\nusing namespace suisen;\\nusing namespace std;\\n\\nstruct io_setup {\\n io_setup(int precision = 20) {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n std::cout << std::fixed << std::setprecision(precision);\\n }\\n} io_setup_{};\\n\\n// ! code from here\\n\\n#include <cassert>\\n#include <cmath>\\n#include <vector>\\n\\n#include <cstdint>\\n\\nnamespace suisen::internal::sieve {\\n\\nconstexpr std::uint8_t K = 8;\\nconstexpr std::uint8_t PROD = 2 * 3 * 5;\\nconstexpr std::uint8_t RM[K] = { 1, 7, 11, 13, 17, 19, 23, 29 };\\nconstexpr std::uint8_t DR[K] = { 6, 4, 2, 4, 2, 4, 6, 2 };\\nconstexpr std::uint8_t DF[K][K] = {\\n { 0, 0, 0, 0, 0, 0, 0, 1 }, { 1, 1, 1, 0, 1, 1, 1, 1 },\\n { 2, 2, 0, 2, 0, 2, 2, 1 }, { 3, 1, 1, 2, 1, 1, 3, 1 },\\n { 3, 3, 1, 2, 1, 3, 3, 1 }, { 4, 2, 2, 2, 2, 2, 4, 1 },\\n { 5, 3, 1, 4, 1, 3, 5, 1 }, { 6, 4, 2, 4, 2, 4, 6, 1 },\\n};\\nconstexpr std::uint8_t DRP[K] = { 48, 32, 16, 32, 16, 32, 48, 16 };\\nconstexpr std::uint8_t DFP[K][K] = {\\n { 0, 0, 0, 0, 0, 0, 0, 8 }, { 8, 8, 8, 0, 8, 8, 8, 8 },\\n { 16, 16, 0, 16, 0, 16, 16, 8 }, { 24, 8, 8, 16, 8, 8, 24, 8 },\\n { 24, 24, 8, 16, 8, 24, 24, 8 }, { 32, 16, 16, 16, 16, 16, 32, 8 },\\n { 40, 24, 8, 32, 8, 24, 40, 8 }, { 48, 32, 16, 32, 16, 32, 48, 8 },\\n};\\n\\nconstexpr std::uint8_t MASK[K][K] = {\\n { 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80 }, { 0x02, 0x20, 0x10, 0x01, 0x80, 0x08, 0x04, 0x40 },\\n { 0x04, 0x10, 0x01, 0x40, 0x02, 0x80, 0x08, 0x20 }, { 0x08, 0x01, 0x40, 0x20, 0x04, 0x02, 0x80, 0x10 },\\n { 0x10, 0x80, 0x02, 0x04, 0x20, 0x40, 0x01, 0x08 }, { 0x20, 0x08, 0x80, 0x02, 0x40, 0x01, 0x10, 0x04 },\\n { 0x40, 0x04, 0x08, 0x80, 0x01, 0x10, 0x20, 0x02 }, { 0x80, 0x40, 0x20, 0x10, 0x08, 0x04, 0x02, 0x01 },\\n};\\nconstexpr std::uint8_t OFFSET[K][K] = {\\n { 0, 1, 2, 3, 4, 5, 6, 7, },\\n { 1, 5, 4, 0, 7, 3, 2, 6, },\\n { 2, 4, 0, 6, 1, 7, 3, 5, },\\n { 3, 0, 6, 5, 2, 1, 7, 4, },\\n { 4, 7, 1, 2, 5, 6, 0, 3, },\\n { 5, 3, 7, 1, 6, 0, 4, 2, },\\n { 6, 2, 3, 7, 0, 4, 5, 1, },\\n { 7, 6, 5, 4, 3, 2, 1, 0, },\\n};\\n\\nconstexpr std::uint8_t mask_to_index(const std::uint8_t bits) {\\n switch (bits) {\\n case 1 << 0: return 0;\\n case 1 << 1: return 1;\\n case 1 << 2: return 2;\\n case 1 << 3: return 3;\\n case 1 << 4: return 4;\\n case 1 << 5: return 5;\\n case 1 << 6: return 6;\\n case 1 << 7: return 7;\\n default: assert(false);\\n }\\n}\\n} // namespace suisen::internal::sieve\\n\\nnamespace suisen {\\n\\ntemplate <unsigned int N>\\nclass SimpleSieve {\\n private:\\n static constexpr unsigned int siz = N / internal::sieve::PROD + 1;\\n static std::uint8_t flag[siz];\\n public:\\n SimpleSieve() {\\n using namespace internal::sieve;\\n flag[0] |= 1;\\n unsigned int k_max = (unsigned int) std::sqrt(N + 2) / PROD;\\n for (unsigned int kp = 0; kp <= k_max; ++kp) {\\n for (std::uint8_t bits = ~flag[kp]; bits; bits &= bits - 1) {\\n const std::uint8_t mp = mask_to_index(bits & -bits), m = RM[mp];\\n unsigned int kr = kp * (PROD * kp + 2 * m) + m * m / PROD;\\n for (std::uint8_t mq = mp; kr < siz; kr += kp * DR[mq] + DF[mp][mq], ++mq &= 7) {\\n flag[kr] |= MASK[mp][mq];\\n }\\n }\\n }\\n }\\n std::vector<int> prime_list(unsigned int max_val = N) const {\\n using namespace internal::sieve;\\n std::vector<int> res { 2, 3, 5 };\\n res.reserve(max_val / 25);\\n for (unsigned int i = 0, offset = 0; i < siz and offset < max_val; ++i, offset += PROD) {\\n for (uint8_t f = ~flag[i]; f;) {\\n uint8_t g = f & -f;\\n res.push_back(offset + RM[mask_to_index(g)]);\\n f ^= g;\\n }\\n }\\n while (res.size() and (unsigned int) res.back() > max_val) res.pop_back();\\n return res;\\n }\\n bool is_prime(const unsigned int p) const {\\n using namespace internal::sieve;\\n switch (p) {\\n case 2: case 3: case 5: return true;\\n default:\\n switch (p % PROD) {\\n case RM[0]: return ((flag[p / PROD] >> 0) & 1) == 0;\\n case RM[1]: return ((flag[p / PROD] >> 1) & 1) == 0;\\n case RM[2]: return ((flag[p / PROD] >> 2) & 1) == 0;\\n case RM[3]: return ((flag[p / PROD] >> 3) & 1) == 0;\\n case RM[4]: return ((flag[p / PROD] >> 4) & 1) == 0;\\n case RM[5]: return ((flag[p / PROD] >> 5) & 1) == 0;\\n case RM[6]: return ((flag[p / PROD] >> 6) & 1) == 0;\\n case RM[7]: return ((flag[p / PROD] >> 7) & 1) == 0;\\n default: return false;\\n }\\n }\\n }\\n};\\ntemplate <unsigned int N>\\nstd::uint8_t SimpleSieve<N>::flag[SimpleSieve<N>::siz];\\n\\ntemplate <unsigned int N>\\nclass Sieve {\\n private:\\n static constexpr unsigned int base_max = (N + 1) * internal::sieve::K / internal::sieve::PROD;\\n static unsigned int pf[base_max + internal::sieve::K];\\n\\n public:\\n Sieve() {\\n using namespace internal::sieve;\\n pf[0] = 1;\\n unsigned int k_max = ((unsigned int) std::sqrt(N + 1) - 1) / PROD;\\n for (unsigned int kp = 0; kp <= k_max; ++kp) {\\n const int base_i = kp * K, base_act_i = kp * PROD;\\n for (int mp = 0; mp < K; ++mp) {\\n const int m = RM[mp], i = base_i + mp;\\n if (pf[i] == 0) {\\n unsigned int act_i = base_act_i + m;\\n unsigned int base_k = (kp * (PROD * kp + 2 * m) + m * m / PROD) * K;\\n for (std::uint8_t mq = mp; base_k <= base_max; base_k += kp * DRP[mq] + DFP[mp][mq], ++mq &= 7) {\\n pf[base_k + OFFSET[mp][mq]] = act_i;\\n }\\n }\\n }\\n }\\n }\\n bool is_prime(const unsigned int p) const {\\n using namespace internal::sieve;\\n switch (p) {\\n case 2: case 3: case 5: return true;\\n default:\\n switch (p % PROD) {\\n case RM[0]: return pf[p / PROD * K + 0] == 0;\\n case RM[1]: return pf[p / PROD * K + 1] == 0;\\n case RM[2]: return pf[p / PROD * K + 2] == 0;\\n case RM[3]: return pf[p / PROD * K + 3] == 0;\\n case RM[4]: return pf[p / PROD * K + 4] == 0;\\n case RM[5]: return pf[p / PROD * K + 5] == 0;\\n case RM[6]: return pf[p / PROD * K + 6] == 0;\\n case RM[7]: return pf[p / PROD * K + 7] == 0;\\n default: return false;\\n }\\n }\\n }\\n int prime_factor(const unsigned int p) const {\\n using namespace internal::sieve;\\n switch (p % PROD) {\\n case 0: case 2: case 4: case 6: case 8:\\n case 10: case 12: case 14: case 16: case 18:\\n case 20: case 22: case 24: case 26: case 28: return 2;\\n case 3: case 9: case 15: case 21: case 27: return 3;\\n case 5: case 25: return 5;\\n case RM[0]: return pf[p / PROD * K + 0] ? pf[p / PROD * K + 0] : p;\\n case RM[1]: return pf[p / PROD * K + 1] ? pf[p / PROD * K + 1] : p;\\n case RM[2]: return pf[p / PROD * K + 2] ? pf[p / PROD * K + 2] : p;\\n case RM[3]: return pf[p / PROD * K + 3] ? pf[p / PROD * K + 3] : p;\\n case RM[4]: return pf[p / PROD * K + 4] ? pf[p / PROD * K + 4] : p;\\n case RM[5]: return pf[p / PROD * K + 5] ? pf[p / PROD * K + 5] : p;\\n case RM[6]: return pf[p / PROD * K + 6] ? pf[p / PROD * K + 6] : p;\\n case RM[7]: return pf[p / PROD * K + 7] ? pf[p / PROD * K + 7] : p;\\n default: assert(false);\\n }\\n }\\n /**\\n * Returns a vector of `{ prime, index }`.\\n */\\n std::vector<std::pair<int, int>> factorize(unsigned int n) const {\\n assert(0 < n and n <= N);\\n std::vector<std::pair<int, int>> prime_powers;\\n while (n > 1) {\\n int p = prime_factor(n), c = 0;\\n do { n /= p, ++c; } while (n % p == 0);\\n prime_powers.emplace_back(p, c);\\n }\\n return prime_powers;\\n }\\n /**\\n * Returns the divisors of `n`.\\n * It is NOT guaranteed that the returned vector is sorted.\\n */\\n std::vector<int> divisors(unsigned int n) const {\\n assert(0 < n and n <= N);\\n std::vector<int> divs { 1 };\\n for (auto [prime, index] : factorize(n)) {\\n int sz = divs.size();\\n for (int i = 0; i < sz; ++i) {\\n int d = divs[i];\\n for (int j = 0; j < index; ++j) {\\n divs.push_back(d *= prime);\\n }\\n }\\n }\\n return divs;\\n }\\n};\\ntemplate <unsigned int N>\\nunsigned int Sieve<N>::pf[Sieve<N>::base_max + internal::sieve::K];\\n} // namespace suisen\\n\\nSieve<100000> sieve;\\n\\nint main() {\\n vector<int> primes;\\n rep(i, 1, 100000) {\\n if (sieve.is_prime(i)) {\\n primes.push_back(i);\\n }\\n }\\n while (true) {\\n input(int, m, a, b);\\n if (m == 0) break;\\n\\n int ans_p = 0, ans_q = 0;\\n for (int q : primes) {\\n int pl = cld(a * q, b);\\n int pr = min(fld(m, q), q);\\n auto it = upper_bound(all(primes), pr);\\n if (it != primes.begin()) {\\n int p = *--it;\\n if (pl <= p and ans_p * ans_q < p * q) {\\n ans_p = p, ans_q = q;\\n }\\n }\\n }\\n print(ans_p, ans_q);\\n\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 3664,\n \"score_of_the_acc\": -0.2473,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1232_6736721\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef long double ld;\\n\\ntypedef vector<int> vi;\\ntypedef vector<ll> vl;\\ntypedef vector<vector<int>> vvi;\\ntypedef vector<vector<ll>> vvl;\\n\\ntypedef pair<int, int> pii;\\ntypedef pair<ll, ll> pll;\\ntypedef vector<pii> vpii;\\ntypedef vector<pll> vpll;\\n\\n#define FOR(i, a, b) for(ll i=(a); i<(b); ++i)\\n#define REP(i, n) FOR(i, 0, n)\\n#define NREP(i, n) FOR(i, 1, n+1)\\n\\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }\\n\\nbool isfin = 0;\\nconst ll INF = 1e15;\\n\\nconst ll nmax = 1e5 + 1000;\\nll isprime[nmax];\\nll preprime[nmax];\\n\\nvoid init() {\\n REP(i, nmax) {\\n if(i <= 1) {continue;}\\n \\n ll flg = 1;\\n for(ll j = 2; j * j <= i; ++j) {\\n if(i % j == 0) {flg = 0;}\\n }\\n \\n if(flg) {isprime[i] = 1;}\\n }\\n \\n ll now = -1;\\n REP(i, nmax) {\\n if(isprime[i]) {\\n now = i;\\n }\\n preprime[i] = now;\\n }\\n \\n return;\\n}\\n\\nvoid calc() {\\n ll M, A, B; cin >> M >> A >> B;\\n \\n if(M == 0) {\\n isfin = 1;\\n return;\\n }\\n \\n ll P = 2, Q = 2;\\n ll mult = P * Q;\\n \\n REP(q, nmax) {\\n if(q <= 1) {continue;}\\n if(isprime[q] == 0) {continue;}\\n \\n ll mn = (A * q + B - 1) / B;\\n ll mx = min(q, M / q);\\n \\n ll p = preprime[mx];\\n \\n if(p == -1) {continue;} \\n if(p < mn) {continue;}\\n \\n if(chmax(mult, p * q)) {\\n P = p, Q = q;\\n }\\n }\\n \\n cout << P << \\\" \\\" << Q << endl;\\n \\n return;\\n}\\n\\nint main(void) {\\n init();\\n while(1) {\\n calc();\\n if(isfin) {break;}\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 610,\n \"memory_kb\": 4932,\n \"score_of_the_acc\": -0.7779,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1232_6736477\",\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\\nstd::vector<bool> prime_table(int n) {\\n std::vector<bool> prime(n + 1, true);\\n prime[0] = prime[1] = false;\\n for (int j = 4; j <= n; j += 2) prime[j] = false;\\n for (int i = 3; i * i <= n; i += 2) {\\n if (!prime[i]) continue;\\n for (int j = i * i; j <= n; j += 2 * i) prime[j] = false;\\n }\\n return prime;\\n}\\n\\n\\nint main() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n\\n auto table = prime_table(1e5);\\n vector<ll> primes;\\n rep(i,2,1e5) if (table[i]) primes.push_back(i);\\n while (true) {\\n int m, a, b;\\n cin >> m >> a >> b;\\n if (m == 0) break;\\n tuple<ll, int, int> ans(0, 0, 0);\\n rep(i,0,primes.size()) {\\n int lb = i-1, ub = primes.size();\\n ll p = primes[i];\\n while (ub - lb > 1) {\\n int j = (lb + ub) / 2;\\n ll q = primes[j];\\n if (p*q > m || a*q > p*b) ub = j;\\n else lb = j;\\n }\\n if (lb >= i) chmax(ans, {primes[i]*primes[lb], primes[i], primes[lb]});\\n }\\n auto [_, p, q] = ans;\\n cout << p << \\\" \\\" << q << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 260,\n \"memory_kb\": 3460,\n \"score_of_the_acc\": -0.1847,\n \"final_rank\": 9\n }\n]","isConversational":false}}},{"rowIdx":691,"cells":{"group_id":{"kind":"string","value":"aoj_1230_cpp"},"problem_description":{"kind":"string","value":"Problem G:\nNim\nLet's play a traditional game Nim. You and I are seated across a table and we have a hundred stones on the table (we know the number of stones exactly). We play in turn and at each turn, you or I can remove one to four stones from the heap. You play first and the one who removed the last stone loses.\nIn this game, you have a winning strategy. To see this, you first remove four stones and leave 96 stones. No matter how I play, I will end up with leaving 92-95 stones. Then you will in turn leave 91 stones for me (verify this is always possible). This way, you can always leave 5\nk\n+ 1 stones for me and finally I get the last stone, sigh. If we initially had 101 stones, on the other hand, I have a winning strategy and you are doomed to lose.\nLet's generalize the game a little bit. First, let's make it a team game. Each team has\nn\nplayers and the 2\nn\nplayers are seated around the table, with each player having opponents at both sides. Turns round the table so the two teams play alternately. Second, let's vary the maximum number ofstones each player can take. That is, each player has his/her own maximum number ofstones he/she can take at each turn (The minimum is always one). So the game is asymmetric and may even be unfair.\nIn general, when played between two teams of experts, the outcome of a game is completely determined by the initial number ofstones and the minimum number of stones each player can take at each turn. In other words, either team has a winning strategy.\nYou are the head-coach of a team. In each game, the umpire shows both teams the initial number of stones and the maximum number of stones each player can take at each turn. Your team plays first. Your job is, given those numbers, to instantaneously judge whether your team has a winning strategy.\nIncidentally, there is a rumor that Captain Future and her officers of Hakodate-maru love this game, and they are killing their time playing it during their missions. You wonder where the stones are?. Well, they do not have stones but do have plenty of balls in the fuel containers!.\nInput\nThe input is a sequence of lines, followed by the last line containing a zero. Each line except the last is a sequence of integers and has the following format.\nn S\nM\n1\nM\n2\n...\nM\n2\nn\nwhere\nn\nis the number of players in a team,\nS\nthe initial number of stones, and\nM\ni\nthe maximum number of stones i th player can take. 1st, 3rd, 5th, ... players are your team's players and 2nd, 4th, 6th, ... the opponents. Numbers are separated by a single space character. You may assume 1 ≤\nn\n≤ 10, 1 ≤\nM\ni\n≤ 16, and 1 ≤\nS\n≤ 2\n13\n.\nOutput\nThe out put should consist of lines each containing either a one, meaning your team has a winning strategy, or a zero otherwise.\nSample Input\n1 101 4 4\n1 100 4 4\n3 97 8 7 6 5 4 3\n0\nOutput for the Sample Input\n0\n1\n1"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1230_9710661","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint n;\nmap <pair <int, int>, int> mp;\n\nbool get_res(vector <int> &v, int id, int s) {\n if(s == 0) return 1;\n if(mp[{id, s}]) return mp[{id, s}];\n\n bool res = 0;\n for(int i = 1; i <= v[id]; i++) {\n if(s - i < 0)\n break;\n res |= !(get_res(v, id % n + 1, s - i));\n }\n mp[{id, s}] = res;\n return res;\n}\n\nint main() {\n while(cin >> n) {\n if(n == 0) break;\n int s; cin >> s;\n mp.clear();\n n *= 2;\n vector <int> v(n + 1);\n for(int i = 1; i <= n; i++)\n cin >> v[i];\n cout << get_res(v, 1, s) << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":780,"memory_kb":10484,"score_of_the_acc":-2,"final_rank":20},{"submission_id":"aoj_1230_3953533","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <string>\n#include <numeric>\n\n#define REP(i, a, b) for (int i = int(a); i < int(b); i++)\nusing namespace std;\ntypedef long long int ll;\n\n// clang-format off\n#ifdef _DEBUG_\n#define dump(...) do{ cerr << __LINE__ << \":\\t\" << #__VA_ARGS__ << \" = \"; PPPPP(__VA_ARGS__); cerr << endl; } while(false)\ntemplate<typename T> void PPPPP(T t) { cerr << t; }\ntemplate<typename T, typename... S> void PPPPP(T t, S... s) { cerr << t << \", \"; PPPPP(s...); }\n#else\n#define dump(...)\n#endif\ntemplate<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }\ntemplate<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }\ntemplate<typename T>\nbool chmin(T &a, T b) { if (a > b) {a = b; return true; } return false;}\ntemplate<typename T>\nbool chmax(T &a, T b) { if (a < b) {a = b; return true; } return false;}\n// clang-format on\n\n#include <functional>\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int n;\n while (cin >> n, n) {\n int S;\n cin >> S;\n n *= 2;\n vector<int> a(n);\n REP(i, 0, n) {\n cin >> a[i];\n }\n\n auto memo = make_v(S + 1, n, -1);\n function<int(int, int)> rec = [&](int rest, int turn) {\n if (memo[rest][turn] != -1) return memo[rest][turn];\n if (rest == 0) {\n return 1;\n }\n int ans = 1;\n REP(i, 1, a[turn] + 1) {\n if (rest < i) continue;\n ans *= rec(rest - i, (turn + 1) % n);\n }\n return memo[rest][turn] = (ans == 0);\n };\n cout << rec(S, 0) << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":4176,"score_of_the_acc":-0.2922,"final_rank":15},{"submission_id":"aoj_1230_2566784","code_snippet":"#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\nenum Type{\n\tSente,\n\tGote,\n\tUnknown,\n};\n\nint N,stone_num;\nint me[10],enemy[10];\nType memo[2][10][8193];\n\nType recursive(Type turn,int rest_num,int index){\n\n\tif(memo[turn][index][rest_num] != Unknown)return memo[turn][index][rest_num];\n\n\tType result;\n\n\tif(turn == Sente){\n\n\t\tif(rest_num == 1){\n\t\t\treturn memo[turn][index][rest_num] = Gote;\n\t\t}\n\n\t\tresult = Gote;\n\n\t\tfor(int num = 1; num <= me[index] && rest_num-num >= 1; num++){\n\t\t\tif(recursive(Gote,rest_num-num,index) == Sente){\n\t\t\t\tresult = Sente;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t}else{\n\n\t\tif(rest_num == 1){\n\t\t\treturn memo[turn][index][rest_num] = Sente;\n\t\t}\n\n\t\tresult = Sente;\n\n\t\tfor(int num = 1; num <= enemy[index] && rest_num-num >= 1; num++){\n\t\t\tif(recursive(Sente,rest_num-num,(index+1)%N) == Gote){\n\t\t\t\tresult = Gote;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn memo[turn][index][rest_num] = result;\n}\n\n\nvoid func(){\n\tscanf(\"%d\",&stone_num);\n\n\tfor(int i = 0; i < 2; i++){\n\t\tfor(int k = 0; k < N; k++){\n\t\t\tfor(int p = 0; p <= stone_num; p++){\n\t\t\t\tmemo[i][k][p] = Unknown;\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\t\tscanf(\"%d %d\",&me[i],&enemy[i]);\n\t}\n\n\tif(recursive(Sente,stone_num,0) == Sente){\n\t\tprintf(\"1\\n\");\n\t}else{\n\t\tprintf(\"0\\n\");\n\t}\n}\n\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%d\",&N);\n\t\tif(N == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3840,"score_of_the_acc":-0.2409,"final_rank":12},{"submission_id":"aoj_1230_2376144","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint n,a[20],dp[1<<13][20];\n\nint main() {\n while(cin >> n && n) {\n int m;\n cin >> m;\n n*=2;\n for(int i=0; i<n; i++) cin >> a[i];\n for(int i=0; i<n; i++) dp[0][i]=1;\n for(int t=1; t<=m; t++) {\n for(int i=0; i<n; i++) {\n dp[t][i]=0;\n for(int k=1; k<=a[i]; k++) {\n if(t-k>=0) dp[t][i]=max(dp[t][i],dp[t-k][(i+1)%n]^1);\n }\n }\n }\n cout << dp[m][0] << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3500,"score_of_the_acc":-0.202,"final_rank":11},{"submission_id":"aoj_1230_2376104","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nint n;\nint s;\nint m[20];\n\nbool visited[(1<<14)][20];\nint mem[(1<<14)][20];\n\nint solve(int s,int id){\n if(visited[s][id]){\n return mem[s][id];\n }\n\n visited[s][id]=1;\n \n if( s==0 ){\n return mem[s][id]=id%2;\n }\n\n \n if(id%2==1){\n\n for(int i=1;i<=m[id];i++){\n if( solve( max(s-i,0) , (id+1)%(n+n) ) == 1 ){\n return mem[s][id]=1;\n }\n }\n return mem[s][id]=0;\n \n }else{\n\n for(int i=1;i<=m[id];i++){\n if( solve( max(s-i,0) , (id+1)%(n+n) ) == 0 ){\n return mem[s][id]=0;\n }\n }\n return mem[s][id]=1;\n }\n\n assert(0);\n return mem[s][id]=-1; \n}\n\nint main(){\n while(1){\n cin>>n;\n if(n==0)break;\n memset( visited, false , sizeof(visited));\n cin>>s;\n for(int i=0;i<n+n;i++)cin>>m[i];\n cout<<1-solve(s,0)<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":4108,"score_of_the_acc":-0.2715,"final_rank":14},{"submission_id":"aoj_1230_2376102","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define int long long\nint n, S, M[22];\nint dp[1<<15][22];\nsigned main(){\n while(cin >> n, n) {\n cin >> S;\n for(int i = 0; i < 2*n; i++) cin >> M[i];\n memset(dp, -1, sizeof(dp));\n for(int i = 0; i < 2*n; i++) dp[1][i] = 0;\n for(int i = 2; i <= S; i++){\n for(int j = 0; j < 2*n; j++) {\n\tbool flag = false;\t\n\tfor(int k = 1; k <= min(i, M[j]); k++) {\n\t if(!dp[i-k][(j+1)%(2*n)]) flag = true;\n\t}\n\tdp[i][j] = (int)flag;\n }\n }\n cout << dp[S][0] << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":8716,"score_of_the_acc":-0.798,"final_rank":19},{"submission_id":"aoj_1230_2192583","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define rep(i,n) repl(i,0,n)\n#define mp(a,b) make_pair((a),(b))\n#define pb(a) push_back((a))\n#define all(x) (x).begin(),(x).end()\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\n#define fi first\n#define se second\n#define dbg(x) cout<<#x\" = \"<<((x))<<endl\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\"(\"<<p.fi<<\",\"<<p.se<<\")\";return o;}\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\"[\";for(T t:v){o<<t<<\",\";}o<<\"]\";return o;}\n\n#define INF 2147483600\n\nbool memo[2<<14][35];\nbool visited[2<<14][35];\nvector<int> m;\n\nbool dfs(int s, int t){\n if(visited[s][t]) return memo[s][t];\n visited[s][t]=true;\n if(s==0) return memo[s][t]=true;\n if(s==1) return memo[s][t]=false;\n int nt = (t+1)%m.size();\n repl(i,1,m[t]+1){\n if(dfs(s-i,nt)==false) return memo[s][t]=true;\n }\n return memo[s][t]=false;\n}\n\nint main(){\n int n;\n while(cin>>n, n){\n int s;\n cin>>s;\n m.resize(2*n);\n rep(i,2*n) cin>>m[i];\n\n fill(visited[0], visited[2<<14], false);\n if(dfs(s,0)) cout<<1<<endl;\n else cout<<0<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":4840,"score_of_the_acc":-0.3551,"final_rank":18},{"submission_id":"aoj_1230_2095072","code_snippet":"#include<iostream>\nusing namespace std;\nint s, n, a[25], dp[10000][25];\nint solve(int r, int s) {\n\tif (r == 0) { dp[r][s] = 0; return 0; }\n\tif (dp[r][s] >= 0)return dp[r][s];\n\tint flag = 0;\n\tfor (int i = 1; i <= a[s]; i++) {\n\t\tif (r - i < 0)continue;\n\t\tif (solve(r - i, (s + 1) % n) == false)flag = 1;\n\t}\n\tdp[r][s] = flag;\n\treturn flag;\n}\nint main() {\n\twhile (true) {\n\t\tfor (int i = 0; i < 10000; i++) { for (int j = 0; j < 25; j++)dp[i][j] = -1; }\n\t\tcin >> n; if (n == 0)break; cin >> s; s--; n *= 2; for (int i = 0; i < n; i++)cin >> a[i];\n\t\tcout << solve(s, 0) << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":4408,"score_of_the_acc":-0.3058,"final_rank":16},{"submission_id":"aoj_1230_2086343","code_snippet":"#include <vector>\n#include <iostream>\nusing namespace std;\nint n, s; vector<int> a; vector<vector<bool> > vis, dp;\nbool solve(int x, int t) {\n\tif (vis[x][t]) return dp[x][t];\n\tbool ret = false;\n\tfor (int i = 1; i <= a[t] && x - i > 0; i++) {\n\t\tif (!solve(x - i, (t + 1) % (2 * n))) ret = true;\n\t}\n\tvis[x][t] = true;\n\treturn dp[x][t] = ret;\n}\nint main() {\n\twhile (cin >> n, n) {\n\t\tcin >> s; a.resize(2 * n);\n\t\tfor (int i = 0; i < 2 * n; i++) cin >> a[i];\n\t\tvis = vector<vector<bool> >(s + 1, vector<bool>(2 * n, false));\n\t\tdp = vector<vector<bool> >(s + 1, vector<bool>(2 * n));\n\t\tcout << solve(s, 0) << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":4420,"score_of_the_acc":-0.3201,"final_rank":17},{"submission_id":"aoj_1230_1967858","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <string>\n#include <vector>\n#include <deque>\n#include <list>\n#include <algorithm>\n#include <numeric>\n#include <functional>\n#include <cmath>\n#include <cstring>\n#include <cctype>\n#include <sstream>\n#include <set>\n#include <map>\n#include <stack>\n#include <queue>\n#include <complex>\nusing namespace std;\n#define REP(i,n) for(int i = 0; i < (int)n; i++)\n#define FOR(i,a,b) for(int i = a; i < (int)b; i++)\n#define pb push_back\n#define mp make_pair\ntypedef vector<int> vi;\ntypedef pair<int, int> pi;\ntypedef long long ll;\nconst int INF = 1<<28;\nconst ll MOD = 1000000007;\nconst int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};\n\nint n, m[20], dp[20][1<<13 + 1];\n\nint dfs(int idx, int rem){\n\tint &res = dp[idx][rem];\n\tif(res != -1) return res;\n\tif(rem == 1) return res = 0;\n \n\tFOR(i, 1, m[idx]+1) {\n\t\tif(rem - i < 1)\n\t\t\tbreak;\n\t\tif(!dfs((idx + 1) % n, rem - i))\n\t\t\treturn res = 1;\n\t}\n\treturn res = 0;\n}\n \nint main() {\n\tios_base::sync_with_stdio(0);\n\tcin.tie(0);\n\n\twhile(cin >> n, n) {\n\t\tn += n;\n\t\tint s; cin >> s;\n\t\tREP(i, n)\n\t\t\tcin >> m[i];\n\t\tmemset(dp, -1, sizeof(dp));\n\t\tcout << dfs(0, s) << endl;\n\t\t/*\n\t\tREP(i, n*2) {\n\t\t\tREP(j, s)\n\t\t\t\tcout << dp[i][j] << ' ';\n\t\t\tcout << endl;\n\t\t}\n\t\t*/\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":2736,"score_of_the_acc":-0.1277,"final_rank":8},{"submission_id":"aoj_1230_1882002","code_snippet":"#include <bits/stdc++.h>\n \nusing namespace std;\n \n#define MAX_N 10\n#define MAX_S (1<<13)\n \nint N,M[2*MAX_N];\nint memo[2*MAX_N][MAX_S+1];\n \nint solve(int p,int rem){\n if(rem == 0) return memo[p][rem] = 1;\n if(memo[p][rem] >= 0) return memo[p][rem];\n for(int i = 1 ; i <= M[p] ; i++){\n\tif(rem-i < 0) continue;\n\tif(solve((p+1)%N,rem-i) == 0){\n\t return memo[p][rem] = 1;\n\t}\n }\n return memo[p][rem] = 0;\n}\n \nint main(){\n int S;\n while(cin >> N,N){\n\tcin >> S;\n\tN *= 2;\n\tfor(int i = 0 ; i < N ; i++){\n\t cin >> M[i];\n\t}\n\tmemset(memo,-1,sizeof(memo));\n\tcout << solve(0,S) << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3872,"score_of_the_acc":-0.2445,"final_rank":13},{"submission_id":"aoj_1230_1459716","code_snippet":"//Nim\n\n#define _CRT_SECURE_NO_WARNINGS\n#include<cstdio>\n#include<cstring>\n#define clr(a,v) memset((a),(v),sizeof(a))\nconst int MAX_N = 10, MAX_S = 1 << 13;\n\nint n, S, M[2 * MAX_N];\nint dp[2 * MAX_N][MAX_S + 1];\n\nbool rec(int i, int j){\n\tif (j <= 1)return false;\n\tint &ret = dp[i][j];\n\tif (ret != -1)return ret;\n\tfor (int k = 1; k <= M[i]; ++k){\n\t\tif (j - k >= 1){\n\t\t\tif (!rec((i + 1) % (n << 1), j - k))return ret = true;\n\t\t}\n\t}\n\treturn ret = false;\n}\n\nint main(){\n\twhile (scanf(\"%d\", &n), n){\n\t\tscanf(\"%d\", &S);\n\t\tfor (int i = 0; i < (n << 1); ++i){\n\t\t\tscanf(\"%d\", M + i);\n\t\t}\n\t\tclr(dp, -1);\n\t\tprintf(\"%d\\n\", rec(0, S));\n\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1928,"score_of_the_acc":-0.0224,"final_rank":3},{"submission_id":"aoj_1230_1458850","code_snippet":"// AOJ 1230 (http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1230)\n#include<cstdio>\n#include<cstring>\n#define rep(i,a) for(int i=0;i<(a);++i)\n#define clr(a,v) memset((a),(v),sizeof(a))\n\nconst int MAX_N = 10, MAX_S = 1<<13;\n\nint n, S, M[2*MAX_N];\nint dp[2*MAX_N][MAX_S+1];\n\nbool rec( int i, int j )\n{\n\tif( j <= 1 )\n\t\treturn false;\n\n\tint &ret = dp[i][j];\n\n\tif( ~ret )\n\t\treturn ret;\n\n\trep( k, M[i] ) if( j-k-1 >= 1 ) if( !rec( (i+1)%(n<<1), j-k-1 ) )\n\t\treturn ret = true;\n\n\treturn ret = false;\n}\n\nint main()\n{\n\twhile( scanf( \"%d\", &n ), n )\n\t{\n\t\tscanf( \"%d\", &S );\n\t\trep( i, n<<1 )\n\t\t\tscanf( \"%d\", M+i );\n\n\t\tclr( dp, -1 );\n\t\tprintf( \"%d\\n\", rec( 0, S ) );\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1912,"score_of_the_acc":-0.0336,"final_rank":4},{"submission_id":"aoj_1230_1342875","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define MAX_N 10\n#define MAX_S (1<<13)\n\nint N,M[2*MAX_N];\nint memo[2*MAX_N][MAX_S+1];\n\nint solve(int p,int rem){\n if(rem == 0){ return memo[p][rem] = 1; }\n if(memo[p][rem] >= 0){ return memo[p][rem]; }\n for(int i = 1 ; i <= M[p] ; i++){\n if(rem-i < 0){ continue; }\n if(solve((p+1)%N,rem-i) == 0){\n return memo[p][rem] = 1;\n }\n }\n return memo[p][rem] = 0;\n}\n\nint main(){\n int S;\n while(cin >> N,N){\n cin >> S;\n N *= 2;\n for(int i = 0 ; i < N ; i++){\n cin >> M[i];\n }\n memset(memo,-1,sizeof(memo));\n cout << solve(0,S) << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":2060,"score_of_the_acc":-0.0505,"final_rank":6},{"submission_id":"aoj_1230_1144595","code_snippet":"#include <stdio.h>\n#include <cctype>\n#include <limits.h>\n#include <math.h>\n#include <complex>\n#include <bitset>\n#include <vector>\n#include <map>\n#include <set>\n#include <stack>\n#include <queue>\n#include <cstring>\n#include <string>\n#include <sstream>\n#include <algorithm>\n#include <iomanip>\n#include <iostream>\n\n#define VARIABLE(x) cerr << #x << \"=\" << x << endl\n#define BINARY(x) static_cast<bitset<16> >(x)\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define REP(i,m,n) for (int i=m;i<(int)(n);i++)\n#define if_range(x, y, w, h) if (0<=(int)(x) && (int)(x)<(int)(w) && 0<=(int)(y) && (int)(y)<(int)(h))\n\nconst int INF = 1e9;\nconst double EPS = 1e-8;\nconst double PI = 3.14159;\nint dx[4]={0, 1, 0, -1}, dy[4]={-1, 0, 1, 0};\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> P;\n\n/* struct P {\n\tint x, y, n;\n\tP(int n, int x, int y):n(n), x(x), y(y){}\n\tP(){}\n}; */\n\n\n/** Problem1230 : Nim **/\nvector<int> lim;\nint N;\nconst int MAX_N = 20, MAX_S = 1<<13;\nint dp[MAX_S][MAX_N];\n\n\nbool isWinning(int n, int p)\n{\n\tif (n==1) return false;\n\tif (dp[n][p]!=-1) return dp[n][p];\n\t\n\tbool res = false;\n\tfor (int i=1; i<=lim[p]; i++) {\n\t\tif (n-i>=0)\n\t\t\tres |= !isWinning(n-i, (p+1)%(2*N));\n\t}\n\t\n\t//cerr << n << \" \" << p << \" \" << res << endl;\n\t\n\treturn dp[n][p]=res;\n}\n\nint main()\n{\n\tint S;\n\twhile (cin>>N, N) {\n\t\tcin>>S;\n\t\tmemset(dp, -1, sizeof(dp));\n\t\tlim.resize(2*N);\n\t\trep(i, 2*N) cin>>lim[i];\n\t\t\n\t\tcout << isWinning(S, 0) << endl;\n\t}\n}","accuracy":1,"time_ms":30,"memory_kb":2284,"score_of_the_acc":-0.089,"final_rank":7},{"submission_id":"aoj_1230_1131521","code_snippet":"#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nint c[30];\nint n;\nint dp[11000][21];\nint solve(int a,int b){\n\tif(a<=0)return 1;\n\tif(~dp[a][b])return dp[a][b];\n\tfor(int i=1;i<=c[b];i++){\n\t\tif(!solve(a-i,(b+1)%(n*2)))return dp[a][b]=1;\n\t}\n\treturn dp[a][b]=0;\n}\nint main(){\n\tint a;\n\tint b;\n\twhile(scanf(\"%d\",&a),a){\n\t\tn=a;\n\t\tscanf(\"%d\",&b);\n\t\tfor(int i=0;i<a*2;i++)scanf(\"%d\",c+i);\n\t\tfor(int i=0;i<=b;i++)for(int j=0;j<a*2;j++)dp[i][j]=-1;\n\t\tprintf(\"%d\\n\",solve(b,0));\n\t}\n}","accuracy":1,"time_ms":10,"memory_kb":1732,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_1230_1079658","code_snippet":"#include <iostream>\n#include <vector>\n\nusing namespace std;\n\n#define rep(i, n) for(int i=0; i<(n); ++i)\n\nint solve(int n, int S, vector<int>& M){\n vector<vector<int> > dp(S+1, vector<int>(2*n));\n for(int i=2; i<=S; ++i)for(int j=0; j<(int)M.size(); ++j){\n for(int k=1; k<=M[j] && k<=i; ++k){\n if(!dp[i-k][(j+1)%(int)M.size()]){\n dp[i][j] = 1;\n break;\n }\n }\n }\n return dp[S][0];\n}\n\nint main(){\n int n;\n while(cin >> n, n){\n int S;\n cin >> S;\n vector<int> M(2*n);\n rep(i, 2*n)cin >> M[i];\n cout << solve(n, S, M) << '\\n';\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1800,"score_of_the_acc":-0.0078,"final_rank":2},{"submission_id":"aoj_1230_972623","code_snippet":"#include <iostream>\n#include <vector>\nusing namespace std;\n\nlong long int GR[8200][21];\n\nint main() {\n\n for ( long long int i = 0; i < 21; i++ ) {\n GR[1][i] = 0;\n }\n\n long long int n, S, input;\n\n while( true ) {\n\n cin >> n;\n\n if ( n == 0 ) break;\n\n cin >> S;\n\n vector< long long int > m;\n\n for ( long long int i = 0; i < n * 2; i++ ) {\n\n cin >> input;\n\n m.push_back( input );\n\n }\n\n for ( long long int i = 2; i <= S; i++ ) {\n\n for ( long long int j = 0; j < n * 2; j++ ) {\n\n\tbool flag[17] = {};\n\n\tfor ( long long int k = max( 1LL, i - m[j] ); k < i; k++ ) {\n\n\t flag[ GR[k][(j+1)%(n*2)] ] = true;\n\n\t}\n\n\tint cnt = 0;\n\twhile( flag[cnt] ) {cnt++;}\n\tGR[i][j] = cnt;\n\n }\n\n }\n\n cout << ( GR[S][0] == 0 ? \"0\" : \"1\" ) << endl;\n\n }\n\n return 0;\n\n}","accuracy":1,"time_ms":10,"memory_kb":2112,"score_of_the_acc":-0.0434,"final_rank":5},{"submission_id":"aoj_1230_921105","code_snippet":"#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n\n#include <iostream>\n#include <cstdio>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cctype>\n#include <utility>\n \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <int,int> P;\ntypedef pair <int,P> PP;\n \nstatic const double EPS = 1e-8;\n\nint dp[1<<14][21];\n\nint dfs(int total_players,int upto[21],\n\tint current_stones,int player_idx){\n if(dp[current_stones][player_idx] != -1){\n return dp[current_stones][player_idx];\n }\n if(current_stones == 0){\n return 1;\n }\n\n int res = 0;\n\n for(int use = 1; \n use <= upto[player_idx] \n\t&& current_stones - use >= 0; \n use++){\n if(dfs(total_players,upto,\n\t current_stones - use,\n\t (player_idx + 1) % total_players) == 0){\n res = 1;\n break;\n }\n }\n return (dp[current_stones][player_idx] = res);\n}\n\nint main(){\n int total_players;\n while(~scanf(\"%d\",&total_players)){\n if(total_players == 0) break;\n\n int initial_stones;\n scanf(\"%d\",&initial_stones);\n\n int upto[21];\n memset(upto,0,sizeof(upto));\n for(int player_idx=0;player_idx < total_players * 2;player_idx++){\n scanf(\"%d\",upto + player_idx);\n }\n\n memset(dp,-1,sizeof(dp));\n printf(\"%d\\n\",dfs(total_players * 2,upto,initial_stones,0));\n }\n}","accuracy":1,"time_ms":10,"memory_kb":2968,"score_of_the_acc":-0.1412,"final_rank":9},{"submission_id":"aoj_1230_921104","code_snippet":"#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n\n#include <iostream>\n#include <cstdio>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cctype>\n#include <utility>\n \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <int,int> P;\ntypedef pair <int,P> PP;\n \nstatic const double EPS = 1e-8;\n\nint dp[1<<14][21];\n\nint dfs(int total_players,int upto[21],\n\tint current_stones,int player_idx){\n if(dp[current_stones][player_idx] != -1){\n return dp[current_stones][player_idx];\n }\n if(current_stones == 0){\n return 1;\n }\n\n int res = 0;\n\n for(int use = 1; \n use <= upto[player_idx] \n\t&& current_stones - use >= 0; \n use++){\n if(dfs(total_players,upto,\n\t current_stones - use,\n\t (player_idx + 1) % total_players) == 0){\n res = 1;\n }\n }\n return (dp[current_stones][player_idx] = res);\n}\n\nint main(){\n int total_players;\n while(~scanf(\"%d\",&total_players)){\n if(total_players == 0) break;\n\n int initial_stones;\n scanf(\"%d\",&initial_stones);\n\n int upto[21];\n memset(upto,0,sizeof(upto));\n for(int player_idx=0;player_idx < total_players * 2;player_idx++){\n scanf(\"%d\",upto + player_idx);\n }\n\n memset(dp,-1,sizeof(dp));\n printf(\"%d\\n\",dfs(total_players * 2,upto,initial_stones,0));\n }\n}","accuracy":1,"time_ms":20,"memory_kb":2968,"score_of_the_acc":-0.1542,"final_rank":10}],"string":"[\n {\n \"submission_id\": \"aoj_1230_9710661\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint n;\\nmap <pair <int, int>, int> mp;\\n\\nbool get_res(vector <int> &v, int id, int s) {\\n if(s == 0) return 1;\\n if(mp[{id, s}]) return mp[{id, s}];\\n\\n bool res = 0;\\n for(int i = 1; i <= v[id]; i++) {\\n if(s - i < 0)\\n break;\\n res |= !(get_res(v, id % n + 1, s - i));\\n }\\n mp[{id, s}] = res;\\n return res;\\n}\\n\\nint main() {\\n while(cin >> n) {\\n if(n == 0) break;\\n int s; cin >> s;\\n mp.clear();\\n n *= 2;\\n vector <int> v(n + 1);\\n for(int i = 1; i <= n; i++)\\n cin >> v[i];\\n cout << get_res(v, 1, s) << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 780,\n \"memory_kb\": 10484,\n \"score_of_the_acc\": -2,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1230_3953533\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <string>\\n#include <numeric>\\n\\n#define REP(i, a, b) for (int i = int(a); i < int(b); i++)\\nusing namespace std;\\ntypedef long long int ll;\\n\\n// clang-format off\\n#ifdef _DEBUG_\\n#define dump(...) do{ cerr << __LINE__ << \\\":\\\\t\\\" << #__VA_ARGS__ << \\\" = \\\"; PPPPP(__VA_ARGS__); cerr << endl; } while(false)\\ntemplate<typename T> void PPPPP(T t) { cerr << t; }\\ntemplate<typename T, typename... S> void PPPPP(T t, S... s) { cerr << t << \\\", \\\"; PPPPP(s...); }\\n#else\\n#define dump(...)\\n#endif\\ntemplate<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }\\ntemplate<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }\\ntemplate<typename T>\\nbool chmin(T &a, T b) { if (a > b) {a = b; return true; } return false;}\\ntemplate<typename T>\\nbool chmax(T &a, T b) { if (a < b) {a = b; return true; } return false;}\\n// clang-format on\\n\\n#include <functional>\\n\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int n;\\n while (cin >> n, n) {\\n int S;\\n cin >> S;\\n n *= 2;\\n vector<int> a(n);\\n REP(i, 0, n) {\\n cin >> a[i];\\n }\\n\\n auto memo = make_v(S + 1, n, -1);\\n function<int(int, int)> rec = [&](int rest, int turn) {\\n if (memo[rest][turn] != -1) return memo[rest][turn];\\n if (rest == 0) {\\n return 1;\\n }\\n int ans = 1;\\n REP(i, 1, a[turn] + 1) {\\n if (rest < i) continue;\\n ans *= rec(rest - i, (turn + 1) % n);\\n }\\n return memo[rest][turn] = (ans == 0);\\n };\\n cout << rec(S, 0) << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4176,\n \"score_of_the_acc\": -0.2922,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1230_2566784\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <set>\\n#include <map>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\nenum Type{\\n\\tSente,\\n\\tGote,\\n\\tUnknown,\\n};\\n\\nint N,stone_num;\\nint me[10],enemy[10];\\nType memo[2][10][8193];\\n\\nType recursive(Type turn,int rest_num,int index){\\n\\n\\tif(memo[turn][index][rest_num] != Unknown)return memo[turn][index][rest_num];\\n\\n\\tType result;\\n\\n\\tif(turn == Sente){\\n\\n\\t\\tif(rest_num == 1){\\n\\t\\t\\treturn memo[turn][index][rest_num] = Gote;\\n\\t\\t}\\n\\n\\t\\tresult = Gote;\\n\\n\\t\\tfor(int num = 1; num <= me[index] && rest_num-num >= 1; num++){\\n\\t\\t\\tif(recursive(Gote,rest_num-num,index) == Sente){\\n\\t\\t\\t\\tresult = Sente;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t}else{\\n\\n\\t\\tif(rest_num == 1){\\n\\t\\t\\treturn memo[turn][index][rest_num] = Sente;\\n\\t\\t}\\n\\n\\t\\tresult = Sente;\\n\\n\\t\\tfor(int num = 1; num <= enemy[index] && rest_num-num >= 1; num++){\\n\\t\\t\\tif(recursive(Sente,rest_num-num,(index+1)%N) == Gote){\\n\\t\\t\\t\\tresult = Gote;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn memo[turn][index][rest_num] = result;\\n}\\n\\n\\nvoid func(){\\n\\tscanf(\\\"%d\\\",&stone_num);\\n\\n\\tfor(int i = 0; i < 2; i++){\\n\\t\\tfor(int k = 0; k < N; k++){\\n\\t\\t\\tfor(int p = 0; p <= stone_num; p++){\\n\\t\\t\\t\\tmemo[i][k][p] = Unknown;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tscanf(\\\"%d %d\\\",&me[i],&enemy[i]);\\n\\t}\\n\\n\\tif(recursive(Sente,stone_num,0) == Sente){\\n\\t\\tprintf(\\\"1\\\\n\\\");\\n\\t}else{\\n\\t\\tprintf(\\\"0\\\\n\\\");\\n\\t}\\n}\\n\\n\\nint main(){\\n\\n\\twhile(true){\\n\\t\\tscanf(\\\"%d\\\",&N);\\n\\t\\tif(N == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3840,\n \"score_of_the_acc\": -0.2409,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1230_2376144\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint n,a[20],dp[1<<13][20];\\n\\nint main() {\\n while(cin >> n && n) {\\n int m;\\n cin >> m;\\n n*=2;\\n for(int i=0; i<n; i++) cin >> a[i];\\n for(int i=0; i<n; i++) dp[0][i]=1;\\n for(int t=1; t<=m; t++) {\\n for(int i=0; i<n; i++) {\\n dp[t][i]=0;\\n for(int k=1; k<=a[i]; k++) {\\n if(t-k>=0) dp[t][i]=max(dp[t][i],dp[t-k][(i+1)%n]^1);\\n }\\n }\\n }\\n cout << dp[m][0] << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3500,\n \"score_of_the_acc\": -0.202,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1230_2376104\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nint n;\\nint s;\\nint m[20];\\n\\nbool visited[(1<<14)][20];\\nint mem[(1<<14)][20];\\n\\nint solve(int s,int id){\\n if(visited[s][id]){\\n return mem[s][id];\\n }\\n\\n visited[s][id]=1;\\n \\n if( s==0 ){\\n return mem[s][id]=id%2;\\n }\\n\\n \\n if(id%2==1){\\n\\n for(int i=1;i<=m[id];i++){\\n if( solve( max(s-i,0) , (id+1)%(n+n) ) == 1 ){\\n return mem[s][id]=1;\\n }\\n }\\n return mem[s][id]=0;\\n \\n }else{\\n\\n for(int i=1;i<=m[id];i++){\\n if( solve( max(s-i,0) , (id+1)%(n+n) ) == 0 ){\\n return mem[s][id]=0;\\n }\\n }\\n return mem[s][id]=1;\\n }\\n\\n assert(0);\\n return mem[s][id]=-1; \\n}\\n\\nint main(){\\n while(1){\\n cin>>n;\\n if(n==0)break;\\n memset( visited, false , sizeof(visited));\\n cin>>s;\\n for(int i=0;i<n+n;i++)cin>>m[i];\\n cout<<1-solve(s,0)<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4108,\n \"score_of_the_acc\": -0.2715,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1230_2376102\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define int long long\\nint n, S, M[22];\\nint dp[1<<15][22];\\nsigned main(){\\n while(cin >> n, n) {\\n cin >> S;\\n for(int i = 0; i < 2*n; i++) cin >> M[i];\\n memset(dp, -1, sizeof(dp));\\n for(int i = 0; i < 2*n; i++) dp[1][i] = 0;\\n for(int i = 2; i <= S; i++){\\n for(int j = 0; j < 2*n; j++) {\\n\\tbool flag = false;\\t\\n\\tfor(int k = 1; k <= min(i, M[j]); k++) {\\n\\t if(!dp[i-k][(j+1)%(2*n)]) flag = true;\\n\\t}\\n\\tdp[i][j] = (int)flag;\\n }\\n }\\n cout << dp[S][0] << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 8716,\n \"score_of_the_acc\": -0.798,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1230_2192583\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\\n#define rep(i,n) repl(i,0,n)\\n#define mp(a,b) make_pair((a),(b))\\n#define pb(a) push_back((a))\\n#define all(x) (x).begin(),(x).end()\\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\\n#define fi first\\n#define se second\\n#define dbg(x) cout<<#x\\\" = \\\"<<((x))<<endl\\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\\\"(\\\"<<p.fi<<\\\",\\\"<<p.se<<\\\")\\\";return o;}\\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\\\"[\\\";for(T t:v){o<<t<<\\\",\\\";}o<<\\\"]\\\";return o;}\\n\\n#define INF 2147483600\\n\\nbool memo[2<<14][35];\\nbool visited[2<<14][35];\\nvector<int> m;\\n\\nbool dfs(int s, int t){\\n if(visited[s][t]) return memo[s][t];\\n visited[s][t]=true;\\n if(s==0) return memo[s][t]=true;\\n if(s==1) return memo[s][t]=false;\\n int nt = (t+1)%m.size();\\n repl(i,1,m[t]+1){\\n if(dfs(s-i,nt)==false) return memo[s][t]=true;\\n }\\n return memo[s][t]=false;\\n}\\n\\nint main(){\\n int n;\\n while(cin>>n, n){\\n int s;\\n cin>>s;\\n m.resize(2*n);\\n rep(i,2*n) cin>>m[i];\\n\\n fill(visited[0], visited[2<<14], false);\\n if(dfs(s,0)) cout<<1<<endl;\\n else cout<<0<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4840,\n \"score_of_the_acc\": -0.3551,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1230_2095072\",\n \"code_snippet\": \"#include<iostream>\\nusing namespace std;\\nint s, n, a[25], dp[10000][25];\\nint solve(int r, int s) {\\n\\tif (r == 0) { dp[r][s] = 0; return 0; }\\n\\tif (dp[r][s] >= 0)return dp[r][s];\\n\\tint flag = 0;\\n\\tfor (int i = 1; i <= a[s]; i++) {\\n\\t\\tif (r - i < 0)continue;\\n\\t\\tif (solve(r - i, (s + 1) % n) == false)flag = 1;\\n\\t}\\n\\tdp[r][s] = flag;\\n\\treturn flag;\\n}\\nint main() {\\n\\twhile (true) {\\n\\t\\tfor (int i = 0; i < 10000; i++) { for (int j = 0; j < 25; j++)dp[i][j] = -1; }\\n\\t\\tcin >> n; if (n == 0)break; cin >> s; s--; n *= 2; for (int i = 0; i < n; i++)cin >> a[i];\\n\\t\\tcout << solve(s, 0) << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4408,\n \"score_of_the_acc\": -0.3058,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1230_2086343\",\n \"code_snippet\": \"#include <vector>\\n#include <iostream>\\nusing namespace std;\\nint n, s; vector<int> a; vector<vector<bool> > vis, dp;\\nbool solve(int x, int t) {\\n\\tif (vis[x][t]) return dp[x][t];\\n\\tbool ret = false;\\n\\tfor (int i = 1; i <= a[t] && x - i > 0; i++) {\\n\\t\\tif (!solve(x - i, (t + 1) % (2 * n))) ret = true;\\n\\t}\\n\\tvis[x][t] = true;\\n\\treturn dp[x][t] = ret;\\n}\\nint main() {\\n\\twhile (cin >> n, n) {\\n\\t\\tcin >> s; a.resize(2 * n);\\n\\t\\tfor (int i = 0; i < 2 * n; i++) cin >> a[i];\\n\\t\\tvis = vector<vector<bool> >(s + 1, vector<bool>(2 * n, false));\\n\\t\\tdp = vector<vector<bool> >(s + 1, vector<bool>(2 * n));\\n\\t\\tcout << solve(s, 0) << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4420,\n \"score_of_the_acc\": -0.3201,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1230_1967858\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <string>\\n#include <vector>\\n#include <deque>\\n#include <list>\\n#include <algorithm>\\n#include <numeric>\\n#include <functional>\\n#include <cmath>\\n#include <cstring>\\n#include <cctype>\\n#include <sstream>\\n#include <set>\\n#include <map>\\n#include <stack>\\n#include <queue>\\n#include <complex>\\nusing namespace std;\\n#define REP(i,n) for(int i = 0; i < (int)n; i++)\\n#define FOR(i,a,b) for(int i = a; i < (int)b; i++)\\n#define pb push_back\\n#define mp make_pair\\ntypedef vector<int> vi;\\ntypedef pair<int, int> pi;\\ntypedef long long ll;\\nconst int INF = 1<<28;\\nconst ll MOD = 1000000007;\\nconst int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};\\n\\nint n, m[20], dp[20][1<<13 + 1];\\n\\nint dfs(int idx, int rem){\\n\\tint &res = dp[idx][rem];\\n\\tif(res != -1) return res;\\n\\tif(rem == 1) return res = 0;\\n \\n\\tFOR(i, 1, m[idx]+1) {\\n\\t\\tif(rem - i < 1)\\n\\t\\t\\tbreak;\\n\\t\\tif(!dfs((idx + 1) % n, rem - i))\\n\\t\\t\\treturn res = 1;\\n\\t}\\n\\treturn res = 0;\\n}\\n \\nint main() {\\n\\tios_base::sync_with_stdio(0);\\n\\tcin.tie(0);\\n\\n\\twhile(cin >> n, n) {\\n\\t\\tn += n;\\n\\t\\tint s; cin >> s;\\n\\t\\tREP(i, n)\\n\\t\\t\\tcin >> m[i];\\n\\t\\tmemset(dp, -1, sizeof(dp));\\n\\t\\tcout << dfs(0, s) << endl;\\n\\t\\t/*\\n\\t\\tREP(i, n*2) {\\n\\t\\t\\tREP(j, s)\\n\\t\\t\\t\\tcout << dp[i][j] << ' ';\\n\\t\\t\\tcout << endl;\\n\\t\\t}\\n\\t\\t*/\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 2736,\n \"score_of_the_acc\": -0.1277,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1230_1882002\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n \\nusing namespace std;\\n \\n#define MAX_N 10\\n#define MAX_S (1<<13)\\n \\nint N,M[2*MAX_N];\\nint memo[2*MAX_N][MAX_S+1];\\n \\nint solve(int p,int rem){\\n if(rem == 0) return memo[p][rem] = 1;\\n if(memo[p][rem] >= 0) return memo[p][rem];\\n for(int i = 1 ; i <= M[p] ; i++){\\n\\tif(rem-i < 0) continue;\\n\\tif(solve((p+1)%N,rem-i) == 0){\\n\\t return memo[p][rem] = 1;\\n\\t}\\n }\\n return memo[p][rem] = 0;\\n}\\n \\nint main(){\\n int S;\\n while(cin >> N,N){\\n\\tcin >> S;\\n\\tN *= 2;\\n\\tfor(int i = 0 ; i < N ; i++){\\n\\t cin >> M[i];\\n\\t}\\n\\tmemset(memo,-1,sizeof(memo));\\n\\tcout << solve(0,S) << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3872,\n \"score_of_the_acc\": -0.2445,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1230_1459716\",\n \"code_snippet\": \"//Nim\\n\\n#define _CRT_SECURE_NO_WARNINGS\\n#include<cstdio>\\n#include<cstring>\\n#define clr(a,v) memset((a),(v),sizeof(a))\\nconst int MAX_N = 10, MAX_S = 1 << 13;\\n\\nint n, S, M[2 * MAX_N];\\nint dp[2 * MAX_N][MAX_S + 1];\\n\\nbool rec(int i, int j){\\n\\tif (j <= 1)return false;\\n\\tint &ret = dp[i][j];\\n\\tif (ret != -1)return ret;\\n\\tfor (int k = 1; k <= M[i]; ++k){\\n\\t\\tif (j - k >= 1){\\n\\t\\t\\tif (!rec((i + 1) % (n << 1), j - k))return ret = true;\\n\\t\\t}\\n\\t}\\n\\treturn ret = false;\\n}\\n\\nint main(){\\n\\twhile (scanf(\\\"%d\\\", &n), n){\\n\\t\\tscanf(\\\"%d\\\", &S);\\n\\t\\tfor (int i = 0; i < (n << 1); ++i){\\n\\t\\t\\tscanf(\\\"%d\\\", M + i);\\n\\t\\t}\\n\\t\\tclr(dp, -1);\\n\\t\\tprintf(\\\"%d\\\\n\\\", rec(0, S));\\n\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1928,\n \"score_of_the_acc\": -0.0224,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1230_1458850\",\n \"code_snippet\": \"// AOJ 1230 (http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1230)\\n#include<cstdio>\\n#include<cstring>\\n#define rep(i,a) for(int i=0;i<(a);++i)\\n#define clr(a,v) memset((a),(v),sizeof(a))\\n\\nconst int MAX_N = 10, MAX_S = 1<<13;\\n\\nint n, S, M[2*MAX_N];\\nint dp[2*MAX_N][MAX_S+1];\\n\\nbool rec( int i, int j )\\n{\\n\\tif( j <= 1 )\\n\\t\\treturn false;\\n\\n\\tint &ret = dp[i][j];\\n\\n\\tif( ~ret )\\n\\t\\treturn ret;\\n\\n\\trep( k, M[i] ) if( j-k-1 >= 1 ) if( !rec( (i+1)%(n<<1), j-k-1 ) )\\n\\t\\treturn ret = true;\\n\\n\\treturn ret = false;\\n}\\n\\nint main()\\n{\\n\\twhile( scanf( \\\"%d\\\", &n ), n )\\n\\t{\\n\\t\\tscanf( \\\"%d\\\", &S );\\n\\t\\trep( i, n<<1 )\\n\\t\\t\\tscanf( \\\"%d\\\", M+i );\\n\\n\\t\\tclr( dp, -1 );\\n\\t\\tprintf( \\\"%d\\\\n\\\", rec( 0, S ) );\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1912,\n \"score_of_the_acc\": -0.0336,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1230_1342875\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define MAX_N 10\\n#define MAX_S (1<<13)\\n\\nint N,M[2*MAX_N];\\nint memo[2*MAX_N][MAX_S+1];\\n\\nint solve(int p,int rem){\\n if(rem == 0){ return memo[p][rem] = 1; }\\n if(memo[p][rem] >= 0){ return memo[p][rem]; }\\n for(int i = 1 ; i <= M[p] ; i++){\\n if(rem-i < 0){ continue; }\\n if(solve((p+1)%N,rem-i) == 0){\\n return memo[p][rem] = 1;\\n }\\n }\\n return memo[p][rem] = 0;\\n}\\n\\nint main(){\\n int S;\\n while(cin >> N,N){\\n cin >> S;\\n N *= 2;\\n for(int i = 0 ; i < N ; i++){\\n cin >> M[i];\\n }\\n memset(memo,-1,sizeof(memo));\\n cout << solve(0,S) << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 2060,\n \"score_of_the_acc\": -0.0505,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1230_1144595\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cctype>\\n#include <limits.h>\\n#include <math.h>\\n#include <complex>\\n#include <bitset>\\n#include <vector>\\n#include <map>\\n#include <set>\\n#include <stack>\\n#include <queue>\\n#include <cstring>\\n#include <string>\\n#include <sstream>\\n#include <algorithm>\\n#include <iomanip>\\n#include <iostream>\\n\\n#define VARIABLE(x) cerr << #x << \\\"=\\\" << x << endl\\n#define BINARY(x) static_cast<bitset<16> >(x)\\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\\n#define REP(i,m,n) for (int i=m;i<(int)(n);i++)\\n#define if_range(x, y, w, h) if (0<=(int)(x) && (int)(x)<(int)(w) && 0<=(int)(y) && (int)(y)<(int)(h))\\n\\nconst int INF = 1e9;\\nconst double EPS = 1e-8;\\nconst double PI = 3.14159;\\nint dx[4]={0, 1, 0, -1}, dy[4]={-1, 0, 1, 0};\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int, int> P;\\n\\n/* struct P {\\n\\tint x, y, n;\\n\\tP(int n, int x, int y):n(n), x(x), y(y){}\\n\\tP(){}\\n}; */\\n\\n\\n/** Problem1230 : Nim **/\\nvector<int> lim;\\nint N;\\nconst int MAX_N = 20, MAX_S = 1<<13;\\nint dp[MAX_S][MAX_N];\\n\\n\\nbool isWinning(int n, int p)\\n{\\n\\tif (n==1) return false;\\n\\tif (dp[n][p]!=-1) return dp[n][p];\\n\\t\\n\\tbool res = false;\\n\\tfor (int i=1; i<=lim[p]; i++) {\\n\\t\\tif (n-i>=0)\\n\\t\\t\\tres |= !isWinning(n-i, (p+1)%(2*N));\\n\\t}\\n\\t\\n\\t//cerr << n << \\\" \\\" << p << \\\" \\\" << res << endl;\\n\\t\\n\\treturn dp[n][p]=res;\\n}\\n\\nint main()\\n{\\n\\tint S;\\n\\twhile (cin>>N, N) {\\n\\t\\tcin>>S;\\n\\t\\tmemset(dp, -1, sizeof(dp));\\n\\t\\tlim.resize(2*N);\\n\\t\\trep(i, 2*N) cin>>lim[i];\\n\\t\\t\\n\\t\\tcout << isWinning(S, 0) << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 2284,\n \"score_of_the_acc\": -0.089,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1230_1131521\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<algorithm>\\nusing namespace std;\\nint c[30];\\nint n;\\nint dp[11000][21];\\nint solve(int a,int b){\\n\\tif(a<=0)return 1;\\n\\tif(~dp[a][b])return dp[a][b];\\n\\tfor(int i=1;i<=c[b];i++){\\n\\t\\tif(!solve(a-i,(b+1)%(n*2)))return dp[a][b]=1;\\n\\t}\\n\\treturn dp[a][b]=0;\\n}\\nint main(){\\n\\tint a;\\n\\tint b;\\n\\twhile(scanf(\\\"%d\\\",&a),a){\\n\\t\\tn=a;\\n\\t\\tscanf(\\\"%d\\\",&b);\\n\\t\\tfor(int i=0;i<a*2;i++)scanf(\\\"%d\\\",c+i);\\n\\t\\tfor(int i=0;i<=b;i++)for(int j=0;j<a*2;j++)dp[i][j]=-1;\\n\\t\\tprintf(\\\"%d\\\\n\\\",solve(b,0));\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1732,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1230_1079658\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n\\nusing namespace std;\\n\\n#define rep(i, n) for(int i=0; i<(n); ++i)\\n\\nint solve(int n, int S, vector<int>& M){\\n vector<vector<int> > dp(S+1, vector<int>(2*n));\\n for(int i=2; i<=S; ++i)for(int j=0; j<(int)M.size(); ++j){\\n for(int k=1; k<=M[j] && k<=i; ++k){\\n if(!dp[i-k][(j+1)%(int)M.size()]){\\n dp[i][j] = 1;\\n break;\\n }\\n }\\n }\\n return dp[S][0];\\n}\\n\\nint main(){\\n int n;\\n while(cin >> n, n){\\n int S;\\n cin >> S;\\n vector<int> M(2*n);\\n rep(i, 2*n)cin >> M[i];\\n cout << solve(n, S, M) << '\\\\n';\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1800,\n \"score_of_the_acc\": -0.0078,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1230_972623\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\nusing namespace std;\\n\\nlong long int GR[8200][21];\\n\\nint main() {\\n\\n for ( long long int i = 0; i < 21; i++ ) {\\n GR[1][i] = 0;\\n }\\n\\n long long int n, S, input;\\n\\n while( true ) {\\n\\n cin >> n;\\n\\n if ( n == 0 ) break;\\n\\n cin >> S;\\n\\n vector< long long int > m;\\n\\n for ( long long int i = 0; i < n * 2; i++ ) {\\n\\n cin >> input;\\n\\n m.push_back( input );\\n\\n }\\n\\n for ( long long int i = 2; i <= S; i++ ) {\\n\\n for ( long long int j = 0; j < n * 2; j++ ) {\\n\\n\\tbool flag[17] = {};\\n\\n\\tfor ( long long int k = max( 1LL, i - m[j] ); k < i; k++ ) {\\n\\n\\t flag[ GR[k][(j+1)%(n*2)] ] = true;\\n\\n\\t}\\n\\n\\tint cnt = 0;\\n\\twhile( flag[cnt] ) {cnt++;}\\n\\tGR[i][j] = cnt;\\n\\n }\\n\\n }\\n\\n cout << ( GR[S][0] == 0 ? \\\"0\\\" : \\\"1\\\" ) << endl;\\n\\n }\\n\\n return 0;\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 2112,\n \"score_of_the_acc\": -0.0434,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1230_921105\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#define INF 0x3f3f3f3f\\n\\n#include <iostream>\\n#include <cstdio>\\n#include <sstream>\\n#include <cmath>\\n#include <cstdlib>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <limits>\\n#include <map>\\n#include <string>\\n#include <cstring>\\n#include <set>\\n#include <deque>\\n#include <bitset>\\n#include <list>\\n#include <cctype>\\n#include <utility>\\n \\nusing namespace std;\\n \\ntypedef long long ll;\\ntypedef pair <int,int> P;\\ntypedef pair <int,P> PP;\\n \\nstatic const double EPS = 1e-8;\\n\\nint dp[1<<14][21];\\n\\nint dfs(int total_players,int upto[21],\\n\\tint current_stones,int player_idx){\\n if(dp[current_stones][player_idx] != -1){\\n return dp[current_stones][player_idx];\\n }\\n if(current_stones == 0){\\n return 1;\\n }\\n\\n int res = 0;\\n\\n for(int use = 1; \\n use <= upto[player_idx] \\n\\t&& current_stones - use >= 0; \\n use++){\\n if(dfs(total_players,upto,\\n\\t current_stones - use,\\n\\t (player_idx + 1) % total_players) == 0){\\n res = 1;\\n break;\\n }\\n }\\n return (dp[current_stones][player_idx] = res);\\n}\\n\\nint main(){\\n int total_players;\\n while(~scanf(\\\"%d\\\",&total_players)){\\n if(total_players == 0) break;\\n\\n int initial_stones;\\n scanf(\\\"%d\\\",&initial_stones);\\n\\n int upto[21];\\n memset(upto,0,sizeof(upto));\\n for(int player_idx=0;player_idx < total_players * 2;player_idx++){\\n scanf(\\\"%d\\\",upto + player_idx);\\n }\\n\\n memset(dp,-1,sizeof(dp));\\n printf(\\\"%d\\\\n\\\",dfs(total_players * 2,upto,initial_stones,0));\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 2968,\n \"score_of_the_acc\": -0.1412,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1230_921104\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#define INF 0x3f3f3f3f\\n\\n#include <iostream>\\n#include <cstdio>\\n#include <sstream>\\n#include <cmath>\\n#include <cstdlib>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <limits>\\n#include <map>\\n#include <string>\\n#include <cstring>\\n#include <set>\\n#include <deque>\\n#include <bitset>\\n#include <list>\\n#include <cctype>\\n#include <utility>\\n \\nusing namespace std;\\n \\ntypedef long long ll;\\ntypedef pair <int,int> P;\\ntypedef pair <int,P> PP;\\n \\nstatic const double EPS = 1e-8;\\n\\nint dp[1<<14][21];\\n\\nint dfs(int total_players,int upto[21],\\n\\tint current_stones,int player_idx){\\n if(dp[current_stones][player_idx] != -1){\\n return dp[current_stones][player_idx];\\n }\\n if(current_stones == 0){\\n return 1;\\n }\\n\\n int res = 0;\\n\\n for(int use = 1; \\n use <= upto[player_idx] \\n\\t&& current_stones - use >= 0; \\n use++){\\n if(dfs(total_players,upto,\\n\\t current_stones - use,\\n\\t (player_idx + 1) % total_players) == 0){\\n res = 1;\\n }\\n }\\n return (dp[current_stones][player_idx] = res);\\n}\\n\\nint main(){\\n int total_players;\\n while(~scanf(\\\"%d\\\",&total_players)){\\n if(total_players == 0) break;\\n\\n int initial_stones;\\n scanf(\\\"%d\\\",&initial_stones);\\n\\n int upto[21];\\n memset(upto,0,sizeof(upto));\\n for(int player_idx=0;player_idx < total_players * 2;player_idx++){\\n scanf(\\\"%d\\\",upto + player_idx);\\n }\\n\\n memset(dp,-1,sizeof(dp));\\n printf(\\\"%d\\\\n\\\",dfs(total_players * 2,upto,initial_stones,0));\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 2968,\n \"score_of_the_acc\": -0.1542,\n \"final_rank\": 10\n }\n]","isConversational":false}}},{"rowIdx":692,"cells":{"group_id":{"kind":"string","value":"aoj_1237_cpp"},"problem_description":{"kind":"string","value":"Problem F:\nShredding Company\nYou have just been put in charge of developing a new shredder for the Shredding Company. Although a ``normal'' shredder would just shred sheets of paper into little pieces so that the contents would become unreadable, this new shredder needs to have the following unusual basic characteristics.\nThe shredder takes as input a\ntarget number\nand a sheet of paper with a number written on it.\nIt shreds (or cuts) the sheet into pieces each of which has one or more digits on it.\nThe sum of the numbers written on each piece is the closest possible number to the target number, without going over it.\nFor example, suppose that the target number is\n50\n, and the sheet of paper has the number\n12346\n. The shredder would cut the sheet into four pieces, where one piece has\n1\n, another has\n2\n, the third has\n34\n, and the fourth has\n6\n. This is because their sum 43 (= 1 + 2 + 34 + 6) is closest to the target number\n50\nof all possible combinations without going over 50. For example, a combination where the pieces are\n1\n,\n23\n,\n4\n, and\n6\nis not valid, because the sum of this combination 34 (= 1 + 23 + 4 + 6) is less than the above combination's 43. The combination of\n12\n,\n34\n, and\n6\nis not valid either, because the sum 52 (= 12+34+6) is greater than the target number of 50.\nFigure 1. Shredding a sheet of paper having the number\n12346\nwhen the target number is\n50\nThere are also three special rules:\nIf the target number is the same as the number on the sheet of paper, then the paper is not cut. For example, if the target number is\n100\nand the number on the sheet of paper is also\n100\n, then the paper is not cut.\nIf it is not possible to make any combination whose sum is less than or equal to the target number, then error is printed on a display. For example, if the target number is\n1\nand the number on the sheet of paper is\n123\n, it is not possible to make any valid combination, as the combination with the smallest possible sum is\n1\n,\n2\n,\n3\n. The sum for this combination is 6, which is greater than the target number, and thus error is printed.\nIf there is more than one possible combination where the sum is closest to the target number without going over it, then\nrejected\nis printed on a display. For example, if the target number is\n15\n, and the number on the sheet of paper is\n111\n, then there are two possible combinations with the highest possible sum of 12: (a)\n1\nand\n11\nand (b)\n11\nand\n1\n; thus rejected is printed.\nIn order to develop such a shredder, you have decided to first make a simple program that would simulate the above characteristics and rules. Given two numbers, where the first is the target number and the second is the number on the sheet of paper to be shredded, you need to figure out how the shredder should ``cut up'' the second number.\nInput\nThe input consists of several test cases, each on one line, as follows:\nt\n1\nnum\n1\nt\n2\nnum\n2\n...\nt\nn\nnum\nn\n0 0\nEach test case consists of the following two positive integers, which are separated\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1237_3989783","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n//repetition\n#define FOR(i,a,b) for(ll i=(a);i<(b);++i)\n#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)\n\n//container util\n#define all(x) (x).begin(),(x).end()\n\n//typedef\ntypedef long long ll;\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<ll> VLL;\ntypedef vector<VLL> VVLL;\ntypedef vector<string> VS;\ntypedef pair<int, int> PII;\ntypedef pair<ll, ll> PLL;\n\n//const value\n//const ll MOD = 1e9 + 7;\n//const int dx[] = {0,1,0,-1};//{0,0,1,1,1,-1,-1,-1};\n//const int dy[] = {1,0,-1,0};//{1,-1,0,1,-1,0,1,-1};\n\n//conversion\ninline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}\ninline ll toLL(string s) {ll v; istringstream sin(s);sin>>v;return v;}\ntemplate<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}\nll t;\nstring num;\nll ans;\nint dp[1010101];\nvoid dfs(int current,int amari, int cnt){\n if(current == num.size() && cnt == 0){\n dp[amari]++;\n return;\n }\n\n // 区切る場合\n int mm = cnt*10 + (num[current]-'0');\n if(amari - mm >= 0) dfs(current+1, amari-mm, 0);\n else return;\n\n // 区切らない場合\n if(current+1 < num.size()) dfs(current+1, amari, mm);\n\n}\n\nVI ansDFS(int current, int amari, int cnt, VI v){\n VI notAns;\n if(current == num.size()){\n if(ans == amari && cnt == -1) {\n return v;\n }\n else return notAns;\n }\n cnt = max(0,cnt);\n VI ansV0;\n VI ansV1;\n\n int mm = cnt*10 + (num[current]-'0');\n if(amari - mm < 0) return notAns;\n\n // 区切らない場合\n if(not(current > 0 && num[current] == '0' && num[current-1] == '0')) ansV0 = ansDFS(current+1, amari, mm, v);\n\n // 区切る場合\n v.push_back(mm);\n // cout << mm << endl;\n ansV1 = ansDFS(current+1, amari-mm, -1,v);\n\n if(ansV0.size() > 0) return ansV0;\n else return ansV1;\n}\n\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n\n while(true){\n cin >> t >> num;\n if(t == 0 && num == \"0\") break;\n\n\n rep(j,1010101) dp[j] = 0;\n dfs(0,t,0);\n bool flag = false;\n\n rep(i,t+1){\n if(dp[i] == 1){\n ans = i;\n\n VI v;\n VI ansV = ansDFS(0, t ,0, v);\n ans = t - ans;\n cout << ans << \" \";\n // cout << \"Vsize is \" << ansV.size() << endl;\n rep(j,ansV.size()){\n if(ansV.size() == j+1) cout << ansV[j] << endl;\n else cout << ansV[j] << \" \";\n }\n\n flag = true;\n break;\n }else if(dp[i] > 1){\n cout << \"rejected\" << endl;\n flag = true;\n break;\n }\n }\n if(flag == false){\n cout << \"error\" << endl;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":7072,"score_of_the_acc":-0.1297,"final_rank":4},{"submission_id":"aoj_1237_2960830","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\n\nint main(){\n int t;\n string num;\n while(cin>>t>>num,t!=0 || num!=\"0\"){\n vector<vector<int>> dp(num.size()+1,vector<int>(t+1,0));\n dp[0][0]=1;\n for(int i=0;i<num.size();i++){\n for(int j=0;j<=t;j++){\n for(int k=i+1;k<=num.size();k++){\n //cut num[i,k)\n int cutnum=stoi(num.substr(i,k-i));\n if(cutnum+j<=t) dp[k][j+cutnum]+=dp[i][j];\n }\n }\n }\n for(int i=t;i>=-1;i--){\n if(i==-1){\n cout<<\"error\"<<endl;\n break;\n }\n if(dp[num.size()][i]){\n if(dp[num.size()][i]>=2){\n cout<<\"rejected\"<<endl;\n }\n else{\n vector<string> res;\n int pos=num.size();\n int val=i;\n while(pos>0){\n for(int j=0;j<pos;j++){\n //cut num[j,pos)\n int v=stoi(num.substr(j,pos-j));\n if(val-v>=0 && dp[j][val-v]==1){\n res.push_back(num.substr(j,pos-j));\n pos=j;\n val-=v;\n break;\n }\n }\n }\n cout<<i<<\" \";\n reverse(res.begin(),res.end());\n for(int j=0;j<res.size();j++){\n cout<<res[j] <<(j+1==res.size() ? \"\\n\" : \" \");\n }\n }\n break; \n }\n }\n \n }\n\n return 0;\n}","accuracy":1,"time_ms":1490,"memory_kb":29188,"score_of_the_acc":-1.5882,"final_rank":10},{"submission_id":"aoj_1237_2404713","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<ll, ll> P;\n\n#define each(i,a) for (auto&& i : a)\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 REP(i,n) FOR(i,0,n)\n#define RREP(i,n) RFOR(i,0,n)\n#define __GET_MACRO3(_1, _2, _3, NAME, ...) NAME\n#define rep(...) __GET_MACRO3(__VA_ARGS__, FOR, REP)(__VA_ARGS__)\n#define rrep(...) __GET_MACRO3(__VA_ARGS__, RFOR, RREP)(__VA_ARGS__)\n#define pb push_back\n#define all(a) (a).begin(),(a).end()\n#define chmin(x,v) x = min(x, v)\n#define chmax(x,v) x = max(x, v)\n\nconst ll linf = 1e18;\nconst int inf = 1e9;\nconst double eps = 1e-12;\nconst double pi = acos(-1);\n\ntemplate<typename T>\nistream& operator>>(istream& is, vector<T>& vec) {\n each(x,vec) is >> x;\n return is;\n}\ntemplate<typename T>\nostream& operator<<(ostream& os, const vector<T>& vec) {\n rep(i,vec.size()) {\n if (i) os << \" \";\n os << vec[i];\n }\n return os;\n}\ntemplate<typename T>\nostream& operator<<(ostream& os, const vector< vector<T> >& vec) {\n rep(i,vec.size()) {\n if (i) os << endl;\n os << vec[i];\n }\n return os;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n ll n; string s;\n while (cin >> n >> s, n || s != \"0\") {\n ll m = linf;\n vector<ll> ans;\n bool rejected = false;\n try {\n set<vector<ll>> used;\n rep(a, 7) rep(b, 7) rep(c, 7) rep(d, 7) rep(e, 7) rep(f, 7) {\n if (a + b + c + d + e + f != s.size()) continue;\n vector<ll> v;\n if (a) v.pb(a);\n if (b) v.pb(b);\n if (c) v.pb(c);\n if (d) v.pb(d);\n if (e) v.pb(e);\n if (f) v.pb(f);\n if (used.count(v) > 0) continue;\n used.insert(v);\n ll cnt = 0;\n vector<ll> vals;\n bool flag = true;\n rep(i, v.size()) {\n string str = s.substr(cnt, v[i]);\n if (str.size() > 1 && str[0] == '0') {\n // flag = false;\n // break;\n }\n vals.pb(stoll(str));\n cnt += v[i];\n }\n if (!flag) continue;\n ll sum = 0;\n rep(i, vals.size()) sum += vals[i];\n if (sum > n) continue;\n if (n - sum == m) {\n rejected = true;\n }\n else if (n - sum < m) {\n rejected = false;\n m = n - sum;\n ans = vals;\n }\n }\n if (rejected) throw string(\"rejected\");\n if (m == linf) throw string(\"error\");\n cout << n - m << \" \" << ans << endl;\n }\n catch (string err) {\n cout << err << endl;\n }\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3308,"score_of_the_acc":-0.0438,"final_rank":3},{"submission_id":"aoj_1237_2022789","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\n\nint mypow(int x, int y) {\n int ret = 1;\n while(y > 0) {\n ret *= x;\n y--;\n }\n return ret;\n}\nint main() {\n int t, num;\n while(cin >> t >> num, t) {\n vector<vector<vector<int>>> ret(1000000);\n ret[num].push_back({num});\n\n for(int i=1; i<(1<<5); ++i) {\n int top = 0;\n for(int j=4; j>=0; --j) {\n if((i >> j) % 2 == 1) {\n top = j;\n break;\n }\n }\n if(mypow(10, top+1) > num) {\n break;\n }\n int rest = num;\n vector<int> v2;\n int sum=0;\n int prev_b = -1;\n for(int b=0; b<5; ++b) {\n if((i >> b) % 2 == 1) {\n int tmp = 0;\n if(prev_b != -1) {\n tmp = mypow(10, b - prev_b);\n } else {\n tmp = mypow(10, b+1);\n }\n v2.push_back(rest % tmp); // todo\n sum += rest % tmp;\n rest /= tmp;\n prev_b = b;\n if(rest == 0) {\n break;\n }\n }\n }\n if(rest != 0) {\n v2.push_back(rest);\n }\n sum += rest;\n //cout << \"rest = \" << rest << \" sum=\" << sum << endl;\n //cout << endl;\n //for(auto x : v2) {\n // cout << x << endl;\n //}\n //cout << endl;\n if(sum == 0) {\n continue;\n }\n ret[sum].push_back(v2);\n }\n\n bool finded = false;\n for(int i=t; i>=0; --i) {\n if(ret[i].size() >= 2) {\n cout << \"rejected\" << endl;\n finded = true;\n break;\n } else if(ret[i].size() == 1) {\n finded = true;\n cout << i << \" \";\n reverse(ret[i][0].begin(), ret[i][0].end());\n for(int j=0; j<ret[i][0].size()-1; ++j) {\n cout << ret[i][0][j] << \" \";\n }\n cout << ret[i][0][ret[i][0].size()-1] << endl;\n break;\n }\n }\n if(!finded) {\n cout << \"error\" << endl;\n }\n }\n}","accuracy":1,"time_ms":470,"memory_kb":26564,"score_of_the_acc":-0.8438,"final_rank":7},{"submission_id":"aoj_1237_2014259","code_snippet":"#include <iostream>\n#include <vector>\n#include <cstring>\n#include <string>\n#include <algorithm>\n#include <iomanip>\n#include <cmath>\n#include <cassert>\nusing namespace std;\ntypedef pair<int, vector<string> > P;\n\nint t;\nstring s;\n\nP f(string s, vector<bool> cut) {\n\tP ret;\n\tstring a;\n\ta += s[0];\n\tfor(int i = 0; i < cut.size(); i++) {\n\t\tif(cut[i]) {\n\t\t\tret.second.push_back(a);\n\t\t\ta = s[i + 1];\n\t\t}\n\t\telse {\n\t\t\ta += s[i + 1];\n\t\t}\n\t}\n\tret.second.push_back(a);\n\tfor(int i = 0; i < ret.second.size(); i++) {\n\t\ta = ret.second[i];\n\t\twhile(a.size() > 1 && a.front() == '0') a = a.substr(1, a.size() - 1);\n\t\tret.first += atoi(a.c_str());\n\t}\n\treturn ret;\n}\n\nvector<vector<string> > ans[1000000];\n\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\n\twhile(cin >> t >> s, t && s != \"0\") {\n\t\tfor(int i = 0; i < 1000000; i++) {\n\t\t\tans[i].clear();\n\t\t}\n\t\tint n = s.size();\n\t\tint m = -1;\n\t\tfor(int bit = 0; bit < 1 << (n - 1); bit++) {\n\t\t\tvector<bool> cut(n - 1);\n\t\t\tfor(int i = 0; i < n - 1; i++) {\n\t\t\t\tif(bit >> i & 1) cut[i] = true;\n\t\t\t}\n\t\t\tP p = f(s, cut);\n\t\t\tif(p.first > t) continue;\n\t\t\tm = max(m, p.first);\n\t\t\tans[p.first].push_back(p.second);\n\t\t}\n\t\tif(m == -1) {\n\t\t\tcout << \"error\" << endl;\n\t\t}\n\t\telse if(ans[m].size() >= 2) {\n\t\t\tcout << \"rejected\" << endl;\n\t\t}\n\t\telse {\n\t\t\tcout << m;\n\t\t\tfor(string v : ans[m][0]) {\n\t\t\t\tcout << \" \" << v;\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n}","accuracy":1,"time_ms":310,"memory_kb":26644,"score_of_the_acc":-0.7374,"final_rank":6},{"submission_id":"aoj_1237_1060725","code_snippet":"#include <iostream>\n#include <vector>\n#include <string>\n#include <map>\n#include <algorithm>\n\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\n\nusing namespace std;\n\nint dig(int n) {\n if(n<10)return 1;\n else return dig(n/10)+1;\n}\n\nint main() {\n while(1){\n int t,n;\n cin>>t>>n;\n if(!n)break;\n t=min(t,n);\n int s=dig(n);\n string ns=to_string(n);\n vector<vector<int>> dp(s+1,vector<int>(n+1));\n dp[0][0] = 1;\n REP(i,s+1){\n REP(j,i){\n auto sub=ns.substr(j,i-j);\n int m=stoi(sub);\n REP(k,n-m+1){\n if (dp[i][k+m] == 0 && dp[j][k] > 0)\n dp[i][k+m] = j+1;\n else if ((dp[i][k+m] != 0 && dp[j][k] != 0) || dp[j][k] < 0)\n dp[i][k+m] = -1;\n }\n }\n }\n bool ok=false;\n for (int u=t;u>0;--u) {\n if (dp[s][u] > 0) {\n vector<int> res;\n int i=s;\n int j=u;\n do {\n int oldi=i;\n i=dp[i][j]-1;\n auto sub=ns.substr(i,oldi-i);\n res.push_back(stoi(sub));\n j-=stoi(sub);\n } while(i>0);\n reverse(begin(res),end(res));\n cout<<u;\n for(int v:res) cout<<' '<<v;\n cout<<endl;\n ok = true;\n break;\n } else if (dp[s][u] < 0) {\n cout<<\"rejected\"<<endl;\n ok = true;\n break;\n }\n }\n if (!ok)\n cout<<\"error\"<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":760,"memory_kb":35300,"score_of_the_acc":-1.2235,"final_rank":9},{"submission_id":"aoj_1237_720042","code_snippet":"#include <iostream>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\nunsigned short dp[7][1000000];\nunsigned char pr[7][1000000];\nint df[7][1000000];\n\nint main(){\n\twhile(true){\n\t\tint n;\n\t\tstring s;\n\t\tcin >> n >> s;\n\t\tif(n == 0 && s == \"0\"){ break; }\n\t\tconst int m = s.size();\n\t\tfor(int i = 0; i <= m; ++i){\n\t\t\tfor(int j = 0; j <= n; ++j){\n\t\t\t\tdp[i][j] = pr[i][j] = df[i][j] = 0;\n\t\t\t}\n\t\t}\n\t\tdp[0][0] = 1;\n\t\tfor(int i = 0; i < m; ++i){\n\t\t\tint x = 0;\n\t\t\tfor(int j = i; j < m; ++j){\n\t\t\t\tx = (x * 10) + s[j] - '0';\n\t\t\t\tif(x > n){ break; }\n\t\t\t\tfor(int k = 0; k + x <= n; ++k){\n\t\t\t\t\tif(dp[i][k] == 0){ continue; }\n\t\t\t\t\tdp[j + 1][k + x] += dp[i][k];\n\t\t\t\t\tpr[j + 1][k + x] = i;\n\t\t\t\t\tdf[j + 1][k + x] = x;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint answer = -1;\n\t\tfor(int i = n; answer < 0 && i >= 0; --i){\n\t\t\tif(dp[m][i] != 0){ answer = i; }\n\t\t}\n\t\tif(answer < 0){\n\t\t\tcout << \"error\" << endl;\n\t\t}else if(dp[m][answer] >= 2){\n\t\t\tcout << \"rejected\" << endl;\n\t\t}else{\n\t\t\tcout << answer;\n\t\t\tvector<int> cut;\n\t\t\tint r = m, c = answer;\n\t\t\tdo {\n\t\t\t\tconst int d = df[r][c];\n\t\t\t\tcut.push_back(d);\n\t\t\t\tr = pr[r][c];\n\t\t\t\tc -= d;\n\t\t\t} while(r > 0);\n\t\t\tfor(int i = cut.size() - 1; i >= 0; --i){\n\t\t\t\tcout << \" \" << cut[i];\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":48764,"score_of_the_acc":-1.0068,"final_rank":8},{"submission_id":"aoj_1237_654601","code_snippet":"#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <climits>\n#include <cfloat>\n#include <map>\n#include <utility>\n#include <set>\n#include <iostream>\n#include <memory>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <functional>\n#include <sstream>\n#include <complex>\n#include <stack>\n#include <queue>\n#include <cstring>\n#include <sstream>\n#include <cassert>\n#include <ctime>\n#include <list>\n#include <numeric>\n#include <fstream>\n\nusing namespace std;\nstatic const double EPS = 1e-8;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<ll,ll> PI;\n#ifndef M_PI\nconst double M_PI=acos(-1.0);\n#endif\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n#define FORR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();++i)\n#define ALL(c) (c).begin(), (c).end()\n#define mp(a,b) make_pair(a,b)\n#define pb(a) push_back(a)\n#define SZ(a) (int((a).size()))\n#define F first\n#define S second\nvoid pkuassert(bool b){if(!b){int a=0;cout << 1/a << endl;}};\nint dx[]={0,-1,0,1,1,1,-1,-1},dy[]={1,0,-1,0,1,-1,1,-1};\n\nstring in;\n\nint num(int s,int t){\n int ret=0;\n rep(i,t-s) ret=ret*10+in[s+i]-'0';\n return ret;\n}\nint memo[6][1000000];\n\nint rec(int ne,int les,bool pr=false){\n if(les<0) return 0;\n if(ne==SZ(in)) return les==0;\n if(!pr && memo[ne][les]!=-1) return memo[ne][les];\n if(num(ne,SZ(in))<les) return 0;\n int& ret=memo[ne][les]=0;\n \n for(int i=ne+1;i<=SZ(in);++i){\n ret += rec(i,les-num(ne,i));\n if(pr && ret){\n cout << ' ' << in.substr(ne,i-ne);\n rec(i,les-num(ne,i),true);\n return 0;\n }\n if(ret>1) return ret=2;\n }\n return ret;\n}\n\nint t;\nvoid solve(){\n memset(memo,-1,sizeof(memo));\n while(t){\n if(rec(0,t)==1){\n cout << t;\n rec(0,t,true);\n cout << endl;\n return;\n }\n if(rec(0,t)>1){\n cout << \"rejected\" << endl;\n return;\n }\n --t;\n }\n cout << \"error\" << endl;\n}\n\nint main(){\n while(cin >> t >> in && t && in!=\"0\") solve();\n}","accuracy":1,"time_ms":100,"memory_kb":24660,"score_of_the_acc":-0.5537,"final_rank":5},{"submission_id":"aoj_1237_590687","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <algorithm>\n#include <vector>\n#include <map>\n#include <sstream>\nusing namespace std;\n\n#define INF (1<<29)\n\nint toInt(string s){\n istringstream iss(s);\n int a;\n iss >> a;\n return a;\n}\n\nint main(){\n int n;\n string s;\n while(cin >> n >> s){\n if(n == 0 && s == \"0\") break;\n int ans = -1;\n vector<string> ans2;\n map<int, int> is_found;\n \n for(int i = 0 ; i < (1<<s.size()) ; i++){\n vector<string> tmp;\n int pos = 0;\n int point = 0;\n for(int j = 0 ; j < s.size() ; j++){\n\tif(j == s.size()-1){\n\t string t = s.substr(pos, j-pos+1);\n\t tmp.push_back(t);\n\t pos = j+1;\n\t point += toInt(t);\n\t}\n\t\n\telse if((1<<j) & i){\n\t string t = s.substr(pos, j-pos+1);\n\t tmp.push_back(t);\n\t pos = j+1;\n\t point += toInt(t);\n\t}\n }\n \n is_found[point]++;\n if(point <= n && n-point < n-ans){\n\tans = point;\n\tans2 = tmp;\n }\n /*\n cout << point << ' ';\n for(int b = 0 ; b < tmp.size() ; b++){\n\tcout << tmp[b] << ' ';\n }\n cout << endl;\n */\n }\n \n //cout << is_found[ans] << endl;\n bool f = true;\n if(is_found[ans] > 2) f = false;\n \n if(ans == -1) cout << \"error\" << endl;\n else if(!f){\n cout << \"rejected\" << endl;\n }\n else{\n cout << ans << ' ';\n for(int i = 0 ; i < ans2.size() ; i++){\n\tcout << ans2[i];\n\tif(i != ans2.size()-1) cout << ' ';\n\telse cout << endl;\n }\n }\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1228,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_1237_588934","code_snippet":"#include<iostream>\n#include<sstream>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < int(n); ++i)\n\nint main() {\n while (true) {\n int t;\n string n;\n cin >> t >> n;\n if (t == 0 && n == \"0\") break;\n int res = 0, b;\n rep (i, 1 << (n.size() - 1)) {\n int p = 0, r = 0;\n rep (j, n.size() - 1) {\n\tif (i & 1 << j) {\n\t stringstream ss;\n\t ss << n.substr(p, j - p + 1);\n\t int a;\n\t ss >> a;\n\t r += a;\n\t p = j + 1;\n\t}\n }\n stringstream ss;\n ss << n.substr(p);\n int a;\n ss >> a;\n r += a;\n if (r <= t && res < r) {\n\tres = r;\n\tb = i;\n } else if (res == r) {\n\tb = -1;\n }\n }\n if (res == 0) cout << \"error\" << endl;\n else if (b == -1) cout << \"rejected\" << endl;\n else {\n cout << res << \" \" << n[0];\n rep (i, n.size() - 1) {\n\tif (b & 1 << i) cout << \" \";\n\tcout << n[i + 1];\n }\n cout << endl;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1236,"score_of_the_acc":-0.0002,"final_rank":2}],"string":"[\n {\n \"submission_id\": \"aoj_1237_3989783\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n//repetition\\n#define FOR(i,a,b) for(ll i=(a);i<(b);++i)\\n#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)\\n\\n//container util\\n#define all(x) (x).begin(),(x).end()\\n\\n//typedef\\ntypedef long long ll;\\ntypedef vector<int> VI;\\ntypedef vector<VI> VVI;\\ntypedef vector<ll> VLL;\\ntypedef vector<VLL> VVLL;\\ntypedef vector<string> VS;\\ntypedef pair<int, int> PII;\\ntypedef pair<ll, ll> PLL;\\n\\n//const value\\n//const ll MOD = 1e9 + 7;\\n//const int dx[] = {0,1,0,-1};//{0,0,1,1,1,-1,-1,-1};\\n//const int dy[] = {1,0,-1,0};//{1,-1,0,1,-1,0,1,-1};\\n\\n//conversion\\ninline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}\\ninline ll toLL(string s) {ll v; istringstream sin(s);sin>>v;return v;}\\ntemplate<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}\\nll t;\\nstring num;\\nll ans;\\nint dp[1010101];\\nvoid dfs(int current,int amari, int cnt){\\n if(current == num.size() && cnt == 0){\\n dp[amari]++;\\n return;\\n }\\n\\n // 区切る場合\\n int mm = cnt*10 + (num[current]-'0');\\n if(amari - mm >= 0) dfs(current+1, amari-mm, 0);\\n else return;\\n\\n // 区切らない場合\\n if(current+1 < num.size()) dfs(current+1, amari, mm);\\n\\n}\\n\\nVI ansDFS(int current, int amari, int cnt, VI v){\\n VI notAns;\\n if(current == num.size()){\\n if(ans == amari && cnt == -1) {\\n return v;\\n }\\n else return notAns;\\n }\\n cnt = max(0,cnt);\\n VI ansV0;\\n VI ansV1;\\n\\n int mm = cnt*10 + (num[current]-'0');\\n if(amari - mm < 0) return notAns;\\n\\n // 区切らない場合\\n if(not(current > 0 && num[current] == '0' && num[current-1] == '0')) ansV0 = ansDFS(current+1, amari, mm, v);\\n\\n // 区切る場合\\n v.push_back(mm);\\n // cout << mm << endl;\\n ansV1 = ansDFS(current+1, amari-mm, -1,v);\\n\\n if(ansV0.size() > 0) return ansV0;\\n else return ansV1;\\n}\\n\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n\\n while(true){\\n cin >> t >> num;\\n if(t == 0 && num == \\\"0\\\") break;\\n\\n\\n rep(j,1010101) dp[j] = 0;\\n dfs(0,t,0);\\n bool flag = false;\\n\\n rep(i,t+1){\\n if(dp[i] == 1){\\n ans = i;\\n\\n VI v;\\n VI ansV = ansDFS(0, t ,0, v);\\n ans = t - ans;\\n cout << ans << \\\" \\\";\\n // cout << \\\"Vsize is \\\" << ansV.size() << endl;\\n rep(j,ansV.size()){\\n if(ansV.size() == j+1) cout << ansV[j] << endl;\\n else cout << ansV[j] << \\\" \\\";\\n }\\n\\n flag = true;\\n break;\\n }else if(dp[i] > 1){\\n cout << \\\"rejected\\\" << endl;\\n flag = true;\\n break;\\n }\\n }\\n if(flag == false){\\n cout << \\\"error\\\" << endl;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 7072,\n \"score_of_the_acc\": -0.1297,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1237_2960830\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\n\\nint main(){\\n int t;\\n string num;\\n while(cin>>t>>num,t!=0 || num!=\\\"0\\\"){\\n vector<vector<int>> dp(num.size()+1,vector<int>(t+1,0));\\n dp[0][0]=1;\\n for(int i=0;i<num.size();i++){\\n for(int j=0;j<=t;j++){\\n for(int k=i+1;k<=num.size();k++){\\n //cut num[i,k)\\n int cutnum=stoi(num.substr(i,k-i));\\n if(cutnum+j<=t) dp[k][j+cutnum]+=dp[i][j];\\n }\\n }\\n }\\n for(int i=t;i>=-1;i--){\\n if(i==-1){\\n cout<<\\\"error\\\"<<endl;\\n break;\\n }\\n if(dp[num.size()][i]){\\n if(dp[num.size()][i]>=2){\\n cout<<\\\"rejected\\\"<<endl;\\n }\\n else{\\n vector<string> res;\\n int pos=num.size();\\n int val=i;\\n while(pos>0){\\n for(int j=0;j<pos;j++){\\n //cut num[j,pos)\\n int v=stoi(num.substr(j,pos-j));\\n if(val-v>=0 && dp[j][val-v]==1){\\n res.push_back(num.substr(j,pos-j));\\n pos=j;\\n val-=v;\\n break;\\n }\\n }\\n }\\n cout<<i<<\\\" \\\";\\n reverse(res.begin(),res.end());\\n for(int j=0;j<res.size();j++){\\n cout<<res[j] <<(j+1==res.size() ? \\\"\\\\n\\\" : \\\" \\\");\\n }\\n }\\n break; \\n }\\n }\\n \\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1490,\n \"memory_kb\": 29188,\n \"score_of_the_acc\": -1.5882,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1237_2404713\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef pair<ll, ll> P;\\n\\n#define each(i,a) for (auto&& i : a)\\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 REP(i,n) FOR(i,0,n)\\n#define RREP(i,n) RFOR(i,0,n)\\n#define __GET_MACRO3(_1, _2, _3, NAME, ...) NAME\\n#define rep(...) __GET_MACRO3(__VA_ARGS__, FOR, REP)(__VA_ARGS__)\\n#define rrep(...) __GET_MACRO3(__VA_ARGS__, RFOR, RREP)(__VA_ARGS__)\\n#define pb push_back\\n#define all(a) (a).begin(),(a).end()\\n#define chmin(x,v) x = min(x, v)\\n#define chmax(x,v) x = max(x, v)\\n\\nconst ll linf = 1e18;\\nconst int inf = 1e9;\\nconst double eps = 1e-12;\\nconst double pi = acos(-1);\\n\\ntemplate<typename T>\\nistream& operator>>(istream& is, vector<T>& vec) {\\n each(x,vec) is >> x;\\n return is;\\n}\\ntemplate<typename T>\\nostream& operator<<(ostream& os, const vector<T>& vec) {\\n rep(i,vec.size()) {\\n if (i) os << \\\" \\\";\\n os << vec[i];\\n }\\n return os;\\n}\\ntemplate<typename T>\\nostream& operator<<(ostream& os, const vector< vector<T> >& vec) {\\n rep(i,vec.size()) {\\n if (i) os << endl;\\n os << vec[i];\\n }\\n return os;\\n}\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n ll n; string s;\\n while (cin >> n >> s, n || s != \\\"0\\\") {\\n ll m = linf;\\n vector<ll> ans;\\n bool rejected = false;\\n try {\\n set<vector<ll>> used;\\n rep(a, 7) rep(b, 7) rep(c, 7) rep(d, 7) rep(e, 7) rep(f, 7) {\\n if (a + b + c + d + e + f != s.size()) continue;\\n vector<ll> v;\\n if (a) v.pb(a);\\n if (b) v.pb(b);\\n if (c) v.pb(c);\\n if (d) v.pb(d);\\n if (e) v.pb(e);\\n if (f) v.pb(f);\\n if (used.count(v) > 0) continue;\\n used.insert(v);\\n ll cnt = 0;\\n vector<ll> vals;\\n bool flag = true;\\n rep(i, v.size()) {\\n string str = s.substr(cnt, v[i]);\\n if (str.size() > 1 && str[0] == '0') {\\n // flag = false;\\n // break;\\n }\\n vals.pb(stoll(str));\\n cnt += v[i];\\n }\\n if (!flag) continue;\\n ll sum = 0;\\n rep(i, vals.size()) sum += vals[i];\\n if (sum > n) continue;\\n if (n - sum == m) {\\n rejected = true;\\n }\\n else if (n - sum < m) {\\n rejected = false;\\n m = n - sum;\\n ans = vals;\\n }\\n }\\n if (rejected) throw string(\\\"rejected\\\");\\n if (m == linf) throw string(\\\"error\\\");\\n cout << n - m << \\\" \\\" << ans << endl;\\n }\\n catch (string err) {\\n cout << err << endl;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3308,\n \"score_of_the_acc\": -0.0438,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1237_2022789\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\nusing namespace std;\\n\\n\\nint mypow(int x, int y) {\\n int ret = 1;\\n while(y > 0) {\\n ret *= x;\\n y--;\\n }\\n return ret;\\n}\\nint main() {\\n int t, num;\\n while(cin >> t >> num, t) {\\n vector<vector<vector<int>>> ret(1000000);\\n ret[num].push_back({num});\\n\\n for(int i=1; i<(1<<5); ++i) {\\n int top = 0;\\n for(int j=4; j>=0; --j) {\\n if((i >> j) % 2 == 1) {\\n top = j;\\n break;\\n }\\n }\\n if(mypow(10, top+1) > num) {\\n break;\\n }\\n int rest = num;\\n vector<int> v2;\\n int sum=0;\\n int prev_b = -1;\\n for(int b=0; b<5; ++b) {\\n if((i >> b) % 2 == 1) {\\n int tmp = 0;\\n if(prev_b != -1) {\\n tmp = mypow(10, b - prev_b);\\n } else {\\n tmp = mypow(10, b+1);\\n }\\n v2.push_back(rest % tmp); // todo\\n sum += rest % tmp;\\n rest /= tmp;\\n prev_b = b;\\n if(rest == 0) {\\n break;\\n }\\n }\\n }\\n if(rest != 0) {\\n v2.push_back(rest);\\n }\\n sum += rest;\\n //cout << \\\"rest = \\\" << rest << \\\" sum=\\\" << sum << endl;\\n //cout << endl;\\n //for(auto x : v2) {\\n // cout << x << endl;\\n //}\\n //cout << endl;\\n if(sum == 0) {\\n continue;\\n }\\n ret[sum].push_back(v2);\\n }\\n\\n bool finded = false;\\n for(int i=t; i>=0; --i) {\\n if(ret[i].size() >= 2) {\\n cout << \\\"rejected\\\" << endl;\\n finded = true;\\n break;\\n } else if(ret[i].size() == 1) {\\n finded = true;\\n cout << i << \\\" \\\";\\n reverse(ret[i][0].begin(), ret[i][0].end());\\n for(int j=0; j<ret[i][0].size()-1; ++j) {\\n cout << ret[i][0][j] << \\\" \\\";\\n }\\n cout << ret[i][0][ret[i][0].size()-1] << endl;\\n break;\\n }\\n }\\n if(!finded) {\\n cout << \\\"error\\\" << endl;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 470,\n \"memory_kb\": 26564,\n \"score_of_the_acc\": -0.8438,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1237_2014259\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <cstring>\\n#include <string>\\n#include <algorithm>\\n#include <iomanip>\\n#include <cmath>\\n#include <cassert>\\nusing namespace std;\\ntypedef pair<int, vector<string> > P;\\n\\nint t;\\nstring s;\\n\\nP f(string s, vector<bool> cut) {\\n\\tP ret;\\n\\tstring a;\\n\\ta += s[0];\\n\\tfor(int i = 0; i < cut.size(); i++) {\\n\\t\\tif(cut[i]) {\\n\\t\\t\\tret.second.push_back(a);\\n\\t\\t\\ta = s[i + 1];\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\ta += s[i + 1];\\n\\t\\t}\\n\\t}\\n\\tret.second.push_back(a);\\n\\tfor(int i = 0; i < ret.second.size(); i++) {\\n\\t\\ta = ret.second[i];\\n\\t\\twhile(a.size() > 1 && a.front() == '0') a = a.substr(1, a.size() - 1);\\n\\t\\tret.first += atoi(a.c_str());\\n\\t}\\n\\treturn ret;\\n}\\n\\nvector<vector<string> > ans[1000000];\\n\\nint main() {\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\n\\n\\n\\twhile(cin >> t >> s, t && s != \\\"0\\\") {\\n\\t\\tfor(int i = 0; i < 1000000; i++) {\\n\\t\\t\\tans[i].clear();\\n\\t\\t}\\n\\t\\tint n = s.size();\\n\\t\\tint m = -1;\\n\\t\\tfor(int bit = 0; bit < 1 << (n - 1); bit++) {\\n\\t\\t\\tvector<bool> cut(n - 1);\\n\\t\\t\\tfor(int i = 0; i < n - 1; i++) {\\n\\t\\t\\t\\tif(bit >> i & 1) cut[i] = true;\\n\\t\\t\\t}\\n\\t\\t\\tP p = f(s, cut);\\n\\t\\t\\tif(p.first > t) continue;\\n\\t\\t\\tm = max(m, p.first);\\n\\t\\t\\tans[p.first].push_back(p.second);\\n\\t\\t}\\n\\t\\tif(m == -1) {\\n\\t\\t\\tcout << \\\"error\\\" << endl;\\n\\t\\t}\\n\\t\\telse if(ans[m].size() >= 2) {\\n\\t\\t\\tcout << \\\"rejected\\\" << endl;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tcout << m;\\n\\t\\t\\tfor(string v : ans[m][0]) {\\n\\t\\t\\t\\tcout << \\\" \\\" << v;\\n\\t\\t\\t}\\n\\t\\t\\tcout << endl;\\n\\t\\t}\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 310,\n \"memory_kb\": 26644,\n \"score_of_the_acc\": -0.7374,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1237_1060725\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <string>\\n#include <map>\\n#include <algorithm>\\n\\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\\n\\nusing namespace std;\\n\\nint dig(int n) {\\n if(n<10)return 1;\\n else return dig(n/10)+1;\\n}\\n\\nint main() {\\n while(1){\\n int t,n;\\n cin>>t>>n;\\n if(!n)break;\\n t=min(t,n);\\n int s=dig(n);\\n string ns=to_string(n);\\n vector<vector<int>> dp(s+1,vector<int>(n+1));\\n dp[0][0] = 1;\\n REP(i,s+1){\\n REP(j,i){\\n auto sub=ns.substr(j,i-j);\\n int m=stoi(sub);\\n REP(k,n-m+1){\\n if (dp[i][k+m] == 0 && dp[j][k] > 0)\\n dp[i][k+m] = j+1;\\n else if ((dp[i][k+m] != 0 && dp[j][k] != 0) || dp[j][k] < 0)\\n dp[i][k+m] = -1;\\n }\\n }\\n }\\n bool ok=false;\\n for (int u=t;u>0;--u) {\\n if (dp[s][u] > 0) {\\n vector<int> res;\\n int i=s;\\n int j=u;\\n do {\\n int oldi=i;\\n i=dp[i][j]-1;\\n auto sub=ns.substr(i,oldi-i);\\n res.push_back(stoi(sub));\\n j-=stoi(sub);\\n } while(i>0);\\n reverse(begin(res),end(res));\\n cout<<u;\\n for(int v:res) cout<<' '<<v;\\n cout<<endl;\\n ok = true;\\n break;\\n } else if (dp[s][u] < 0) {\\n cout<<\\\"rejected\\\"<<endl;\\n ok = true;\\n break;\\n }\\n }\\n if (!ok)\\n cout<<\\\"error\\\"<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 760,\n \"memory_kb\": 35300,\n \"score_of_the_acc\": -1.2235,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1237_720042\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <vector>\\n\\nusing namespace std;\\n\\nunsigned short dp[7][1000000];\\nunsigned char pr[7][1000000];\\nint df[7][1000000];\\n\\nint main(){\\n\\twhile(true){\\n\\t\\tint n;\\n\\t\\tstring s;\\n\\t\\tcin >> n >> s;\\n\\t\\tif(n == 0 && s == \\\"0\\\"){ break; }\\n\\t\\tconst int m = s.size();\\n\\t\\tfor(int i = 0; i <= m; ++i){\\n\\t\\t\\tfor(int j = 0; j <= n; ++j){\\n\\t\\t\\t\\tdp[i][j] = pr[i][j] = df[i][j] = 0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tdp[0][0] = 1;\\n\\t\\tfor(int i = 0; i < m; ++i){\\n\\t\\t\\tint x = 0;\\n\\t\\t\\tfor(int j = i; j < m; ++j){\\n\\t\\t\\t\\tx = (x * 10) + s[j] - '0';\\n\\t\\t\\t\\tif(x > n){ break; }\\n\\t\\t\\t\\tfor(int k = 0; k + x <= n; ++k){\\n\\t\\t\\t\\t\\tif(dp[i][k] == 0){ continue; }\\n\\t\\t\\t\\t\\tdp[j + 1][k + x] += dp[i][k];\\n\\t\\t\\t\\t\\tpr[j + 1][k + x] = i;\\n\\t\\t\\t\\t\\tdf[j + 1][k + x] = x;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tint answer = -1;\\n\\t\\tfor(int i = n; answer < 0 && i >= 0; --i){\\n\\t\\t\\tif(dp[m][i] != 0){ answer = i; }\\n\\t\\t}\\n\\t\\tif(answer < 0){\\n\\t\\t\\tcout << \\\"error\\\" << endl;\\n\\t\\t}else if(dp[m][answer] >= 2){\\n\\t\\t\\tcout << \\\"rejected\\\" << endl;\\n\\t\\t}else{\\n\\t\\t\\tcout << answer;\\n\\t\\t\\tvector<int> cut;\\n\\t\\t\\tint r = m, c = answer;\\n\\t\\t\\tdo {\\n\\t\\t\\t\\tconst int d = df[r][c];\\n\\t\\t\\t\\tcut.push_back(d);\\n\\t\\t\\t\\tr = pr[r][c];\\n\\t\\t\\t\\tc -= d;\\n\\t\\t\\t} while(r > 0);\\n\\t\\t\\tfor(int i = cut.size() - 1; i >= 0; --i){\\n\\t\\t\\t\\tcout << \\\" \\\" << cut[i];\\n\\t\\t\\t}\\n\\t\\t\\tcout << endl;\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 48764,\n \"score_of_the_acc\": -1.0068,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1237_654601\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstdlib>\\n#include <cmath>\\n#include <climits>\\n#include <cfloat>\\n#include <map>\\n#include <utility>\\n#include <set>\\n#include <iostream>\\n#include <memory>\\n#include <string>\\n#include <vector>\\n#include <algorithm>\\n#include <functional>\\n#include <sstream>\\n#include <complex>\\n#include <stack>\\n#include <queue>\\n#include <cstring>\\n#include <sstream>\\n#include <cassert>\\n#include <ctime>\\n#include <list>\\n#include <numeric>\\n#include <fstream>\\n\\nusing namespace std;\\nstatic const double EPS = 1e-8;\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef pair<ll,ll> PI;\\n#ifndef M_PI\\nconst double M_PI=acos(-1.0);\\n#endif\\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\\n#define FORR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();++i)\\n#define ALL(c) (c).begin(), (c).end()\\n#define mp(a,b) make_pair(a,b)\\n#define pb(a) push_back(a)\\n#define SZ(a) (int((a).size()))\\n#define F first\\n#define S second\\nvoid pkuassert(bool b){if(!b){int a=0;cout << 1/a << endl;}};\\nint dx[]={0,-1,0,1,1,1,-1,-1},dy[]={1,0,-1,0,1,-1,1,-1};\\n\\nstring in;\\n\\nint num(int s,int t){\\n int ret=0;\\n rep(i,t-s) ret=ret*10+in[s+i]-'0';\\n return ret;\\n}\\nint memo[6][1000000];\\n\\nint rec(int ne,int les,bool pr=false){\\n if(les<0) return 0;\\n if(ne==SZ(in)) return les==0;\\n if(!pr && memo[ne][les]!=-1) return memo[ne][les];\\n if(num(ne,SZ(in))<les) return 0;\\n int& ret=memo[ne][les]=0;\\n \\n for(int i=ne+1;i<=SZ(in);++i){\\n ret += rec(i,les-num(ne,i));\\n if(pr && ret){\\n cout << ' ' << in.substr(ne,i-ne);\\n rec(i,les-num(ne,i),true);\\n return 0;\\n }\\n if(ret>1) return ret=2;\\n }\\n return ret;\\n}\\n\\nint t;\\nvoid solve(){\\n memset(memo,-1,sizeof(memo));\\n while(t){\\n if(rec(0,t)==1){\\n cout << t;\\n rec(0,t,true);\\n cout << endl;\\n return;\\n }\\n if(rec(0,t)>1){\\n cout << \\\"rejected\\\" << endl;\\n return;\\n }\\n --t;\\n }\\n cout << \\\"error\\\" << endl;\\n}\\n\\nint main(){\\n while(cin >> t >> in && t && in!=\\\"0\\\") solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 24660,\n \"score_of_the_acc\": -0.5537,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1237_590687\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cstring>\\n#include <algorithm>\\n#include <vector>\\n#include <map>\\n#include <sstream>\\nusing namespace std;\\n\\n#define INF (1<<29)\\n\\nint toInt(string s){\\n istringstream iss(s);\\n int a;\\n iss >> a;\\n return a;\\n}\\n\\nint main(){\\n int n;\\n string s;\\n while(cin >> n >> s){\\n if(n == 0 && s == \\\"0\\\") break;\\n int ans = -1;\\n vector<string> ans2;\\n map<int, int> is_found;\\n \\n for(int i = 0 ; i < (1<<s.size()) ; i++){\\n vector<string> tmp;\\n int pos = 0;\\n int point = 0;\\n for(int j = 0 ; j < s.size() ; j++){\\n\\tif(j == s.size()-1){\\n\\t string t = s.substr(pos, j-pos+1);\\n\\t tmp.push_back(t);\\n\\t pos = j+1;\\n\\t point += toInt(t);\\n\\t}\\n\\t\\n\\telse if((1<<j) & i){\\n\\t string t = s.substr(pos, j-pos+1);\\n\\t tmp.push_back(t);\\n\\t pos = j+1;\\n\\t point += toInt(t);\\n\\t}\\n }\\n \\n is_found[point]++;\\n if(point <= n && n-point < n-ans){\\n\\tans = point;\\n\\tans2 = tmp;\\n }\\n /*\\n cout << point << ' ';\\n for(int b = 0 ; b < tmp.size() ; b++){\\n\\tcout << tmp[b] << ' ';\\n }\\n cout << endl;\\n */\\n }\\n \\n //cout << is_found[ans] << endl;\\n bool f = true;\\n if(is_found[ans] > 2) f = false;\\n \\n if(ans == -1) cout << \\\"error\\\" << endl;\\n else if(!f){\\n cout << \\\"rejected\\\" << endl;\\n }\\n else{\\n cout << ans << ' ';\\n for(int i = 0 ; i < ans2.size() ; i++){\\n\\tcout << ans2[i];\\n\\tif(i != ans2.size()-1) cout << ' ';\\n\\telse cout << endl;\\n }\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1228,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1237_588934\",\n \"code_snippet\": \"#include<iostream>\\n#include<sstream>\\n\\nusing namespace std;\\n\\n#define rep(i, n) for (int i = 0; i < int(n); ++i)\\n\\nint main() {\\n while (true) {\\n int t;\\n string n;\\n cin >> t >> n;\\n if (t == 0 && n == \\\"0\\\") break;\\n int res = 0, b;\\n rep (i, 1 << (n.size() - 1)) {\\n int p = 0, r = 0;\\n rep (j, n.size() - 1) {\\n\\tif (i & 1 << j) {\\n\\t stringstream ss;\\n\\t ss << n.substr(p, j - p + 1);\\n\\t int a;\\n\\t ss >> a;\\n\\t r += a;\\n\\t p = j + 1;\\n\\t}\\n }\\n stringstream ss;\\n ss << n.substr(p);\\n int a;\\n ss >> a;\\n r += a;\\n if (r <= t && res < r) {\\n\\tres = r;\\n\\tb = i;\\n } else if (res == r) {\\n\\tb = -1;\\n }\\n }\\n if (res == 0) cout << \\\"error\\\" << endl;\\n else if (b == -1) cout << \\\"rejected\\\" << endl;\\n else {\\n cout << res << \\\" \\\" << n[0];\\n rep (i, n.size() - 1) {\\n\\tif (b & 1 << i) cout << \\\" \\\";\\n\\tcout << n[i + 1];\\n }\\n cout << endl;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1236,\n \"score_of_the_acc\": -0.0002,\n \"final_rank\": 2\n }\n]","isConversational":false}}},{"rowIdx":693,"cells":{"group_id":{"kind":"string","value":"aoj_1239_cpp"},"problem_description":{"kind":"string","value":"Problem H:\nViva Confetti\nDo you know\nconfetti\n? They are small discs of colored paper, and people throw them around during parties or festivals. Since people throw lots of confetti, they may end up stacked one on another, so there may be hidden ones underneath.\nA handful of various sized confetti have been dropped on a table. Given their positions and sizes, can you tell us how many of them you can see?\nThe following figure represents the disc configuration for the first sample input, where the bottom disc is still visible.\nInput\nThe input is composed of a number of configurations of the following form.\nn\nx\n1\ny\n1\nz\n1\nx\n2\ny\n2\nz\n2\n.\n.\n.\nx\nn\ny\nn\nz\nn\nThe first line in a configuration is the number of discs in the configuration (a positive integer not more than 100), followed by one Ine descriptions of each disc: coordinates of its center and radius, expressed as real numbers in decimal notation, with up to 12 digits after the decimal point. The imprecision margin is ±5 × 10\n-13\n. That is, it is guaranteed that variations of less than ±5 × 10\n-13\non input values do not change which discs are visible. Coordinates of all points contained in discs are between -10 and 10.\nConfetti are listed in their stacking order,\nx\n1\ny\n1\nr\n1\nbeing the bottom one and\nx\nn\ny\nn\nr\nn\nthe top one. You are observing from the top.\nThe end of the input is marked by a zero on a single line.\nOutput\nFor each configuration you should output the number of visible confetti on a single line.\nSample Input\n3\n0 0 0.5\n-0.9 0 1.00000000001\n0.9 0 1.00000000001\n5\n0 1 0.5\n1 1 1.00000000001\n0 2 1.00000000001\n-1 1 1.00000000001\n0 -0.00001 1.00000000001\n5\n0 1 0.5\n1 1 1.00000000001\n0 2 1.00000000001\n-1 1 1.00000000001\n0 0 1.00000000001\n2\n0 0 1.0000001\n0 0 1\n2\n0 0 1\n0.00000001 0 1\n0\nOutput for the Sample Input\n3\n5\n4\n2\n2"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1239_4761256","code_snippet":"#include<iostream>\n#include<cfloat>\n#include<cassert>\n#include<cmath>\n#include<cstdio>\n#include<vector>\n#include<set>\n#include<algorithm>\n\nusing namespace std;\n\n#define EPS (1e-15)\n#define equals(a, b) (fabs((a) - (b)) < EPS )\n#define dle(a, b) (equals(a, b) || a < b )\nstatic const double PI = acos(-1);\n\nclass Point{\npublic:\n double x, y;\n\n Point ( double x = 0, double y = 0): x(x), y(y){}\n\n Point operator + ( Point p ){ return Point(x + p.x, y + p.y); }\n Point operator - ( Point p ){ return Point(x - p.x, y - p.y); }\n Point operator * ( double a ){ return Point(x*a, y*a); }\n Point operator / ( double a ){ return Point(x/a, y/a); }\n Point operator / ( Point p ) { return Point((x*p.x+y*p.y)/(p.x*p.x+p.y*p.y), (y*p.x-x*p.y)/(p.x*p.x+p.y*p.y)); }\n \n double abs() { return sqrt(norm());}\n double norm() { return x*x + y*y; }\n\n bool operator < ( const Point &p ) const {\n return x != p.x ? x < p.x : y < p.y;\n }\n\n bool operator == ( const Point &p ) const {\n return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\n }\n};\n\ntypedef Point Vector;\n\n\nclass Segment{\npublic:\n Point p1, p2;\n Segment(Point s = Point(), Point t = Point()): p1(s), p2(t){}\n\n};\n\ntypedef Segment Line;\n\nstatic const int CIRCLE_NON = 0;\nstatic const int CIRCLE_OUT = 1;\nstatic const int CIRCLE_IN = 2;\nstatic const int CIRCLE_CROSS = 3;\n\nclass Circle{\npublic:\n Point c;\n double r;\n Circle(Point c = Point(), double r = 0.0): c(c), r(r){}\n};\n\ndouble norm( Vector a ){ return a.x*a.x + a.y*a.y; }\ndouble abs( Vector a ){ return sqrt(norm(a)); }\nPoint polar( double a, double r ){ return Point(cos(r)*a, sin(r)*a);}\ndouble getDistance( Vector a, Vector b ){ return abs(a - b); }\ndouble dot( Vector a, Vector b ){ return a.x*b.x + a.y*b.y; }\ndouble cross( Vector a, Vector b ){ return a.x*b.y - a.y*b.x; }\n\nPoint project( Segment s, Point p ){\n Vector base = s.p2 - s.p1;\n double t = dot(p - s.p1, base)/norm(base);\n return s.p1 + base*t;\n}\n\ndouble getAngle(Point p){\n double polar = atan2(p.y, p.x);\n return (dle(0, polar))? polar : 2.0*acos(-1)+polar;\n}\n\nint isIntersect(Circle c1, Circle c2){\n double d = abs(c1.c - c2.c);\n if ( c1.r + c2.r < d ) return CIRCLE_NON; // no overlap\n if ( d + c2.r < c1.r ) return CIRCLE_IN; // c1 includes c2\n if ( d + c1.r < c2.r ) return CIRCLE_OUT; // c2 includes c1\n return CIRCLE_CROSS;\n}\n\ndouble getDistanceLP(Line s, Point p){\n return abs(cross(s.p2 - s.p1, p - s.p1)/abs(s.p2 - s.p1));\n}\n\ndouble arg(Vector p){\n return atan2(p.y, p.x);\n}\n\npair<Point, Point> getCrossPoints(Circle c1, Circle c2){\n assert( isIntersect( c1, c2 ) );\n double d = abs(c1.c - c2.c);\n double a = acos((c1.r*c1.r+d*d-c2.r*c2.r)/(2*c1.r*d));\n double t = arg(c2.c - c1.c);\n return make_pair(c1.c+polar(c1.r, t+a), c1.c+polar(c1.r, t-a));\n}\n\nbool isIntersect( Circle c1, Line l ){\n double d = getDistanceLP(l, c1.c);\n return ( equals(d, c1.r) || d < c1.r );\n}\n\npair<Point, Point> getCrossPoints(Circle c, Line l ){\n assert( isIntersect( c, l ) );\n Vector pr = project(l, c.c);\n Vector e = (l.p2 - l.p1)/abs(l.p2 - l.p1);\n double base = sqrt(c.r*c.r - norm(pr-c.c));\n return make_pair(pr + e*base, pr - e*base);\n}\n\nCircle C[100];\nint n;\n\nvoid compute(){\n vector<Point> candidates;\n vector<double> Y; \n\n Y.push_back(-100.0);\n Y.push_back(100.0);\n\n for ( int i = 0; i < n; i++ ){\n Y.push_back(C[i].c.y - C[i].r);\n Y.push_back(C[i].c.y + C[i].r);\n }\n \n for ( int i = 0; i < n-1; i++ ){\n for ( int j = i+1; j < n; j++ ){\n if ( isIntersect(C[i], C[j]) != CIRCLE_CROSS ) continue;\n pair<Point, Point> pp = getCrossPoints(C[i], C[j]);\n Y.push_back(pp.first.y);\n Y.push_back(pp.second.y);\n }\n }\n\n sort(Y.begin(), Y.end());\n\n for ( int k = 0; k < Y.size()-1; k++ ){\n double my = (Y[k+1] + Y[k])/2;\n Line l = Line(Point(-100, my), Point(100, my));\n vector<double> X;\n X.push_back(-100);\n X.push_back(100);\n for ( int i = 0; i < n; i++ ){\n if ( !isIntersect(C[i], l) ) continue;\n pair<Point, Point> pp = getCrossPoints(C[i], l);\n X.push_back(pp.first.x);\n X.push_back(pp.second.x);\n }\n sort(X.begin(), X.end());\n\n for ( int i = 0; i < X.size()-1; i++ ){\n candidates.push_back(Point((X[i+1]+X[i])/2, my));\n }\n }\n\n int ans = 0;\n for ( int i = 0; i < n; i++ ){\n for ( int c = 0; c < candidates.size(); c++ ){\n Point t = candidates[c];\n bool f = true;\n if ( abs(C[i].c - t) > C[i].r ) {\n\tcontinue;\n }\n for ( int j = i+1; j < n; j++ ){\n\tif ( dle(abs(C[j].c - t), C[j].r) ) {\n\t f = false;\n\t break;\n\t}\n }\n if ( f ) {\n\tans++;\n\tbreak;\n }\n }\n }\n\n printf(\"%d\\n\", ans);\n}\n\nint main(){\n double x, y, r;\n while(1){\n cin >> n;\n if ( n == 0 ) break;\n for ( int i = 0; i < n; i++ ){\n cin >> x >> y >> r; C[i] = Circle( Point(x, y), r);\n }\n compute();\n }\n\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":5544,"score_of_the_acc":-1.5,"final_rank":5},{"submission_id":"aoj_1239_1669020","code_snippet":"#include<bits/stdc++.h>\n\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define EPS (1e-14)\n#define equals(a,b) (fabs((a)-(b)) < EPS)\n#define COUNTER_CLOCKWISE 1\n#define CLOCKWISE -1 \n#define ONLINE_BACK 2\n#define ONLINE_FRONT -2\n#define ON_SEGMENT 0\n\nusing namespace std;\n\nclass Point{\npublic:\n double x,y;\n\n Point(double x = 0,double y = 0): x(x),y(y){}\n\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\n Point operator * (double a){return Point(a*x,a*y);}\n Point operator / (double a){return Point(x/a,y/a);}\n Point operator * (Point a){ return Point(x * a.x - y * a.y, x * a.y + y * a.x); }\n\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:(!equals(y,p.y)&&y<p.y); }\n\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\n\n};\n\nstruct Segment{\n Point p1,p2;\n Segment(Point p1 = Point(),Point p2 = Point()):p1(p1),p2(p2){}\n bool operator < (const Segment& s) const { return ( p2 == s.p2 ) ? p1 < s.p1 : p2 < s.p2; }\n bool operator == (const Segment& s) const { return ( s.p1 == p1 && s.p2 == p2 ) || ( s.p1 == p2 && s.p2 == p1 ); }\n\n};\n\ntypedef Point Vector;\ntypedef Segment Line;\n\ndouble dot(Point a,Point b){ return a.x*b.x + a.y*b.y; }\n\ndouble cross(Point a,Point b){ return a.x*b.y - a.y*b.x; }\n\ndouble norm(Point a){ return a.x*a.x+a.y*a.y; }\n\ndouble abs(Point a){ return sqrt(norm(a)); }\n\nint ccw(Point p0,Point p1,Point p2){\n Point a = p1-p0;\n Point b = p2-p0;\n if(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\n if(cross(a,b) < -EPS)return CLOCKWISE;\n if(dot(a,b) < -EPS)return ONLINE_BACK;\n if(norm(a) < norm(b))return ONLINE_FRONT;\n return ON_SEGMENT;\n}\n\npair<Point, Point> crosspointCC( Point C1, double r1, Point C2, double r2) {\n complex<double> c1(C1.x,C1.y);\n complex<double> c2(C2.x,C2.y);\n complex<double> A = conj(c2-c1), B = (r2*r2-r1*r1-(c2-c1)*conj(c2-c1)), C = r1*r1*(c2-c1);\n complex<double> D = B*B-4.0*A*C;\n complex<double> z1 = (-B+sqrt(D))/(2.0*A)+c1, z2 = (-B-sqrt(D))/(2.0*A)+c1;\n return pair<Point, Point>(Point(z1.real(),z1.imag()),Point(z2.real(),z2.imag()));\n}\n\n// ??? a ?????? b ????????????????????????\nbool insideCC(Point a,double ra,Point b,double rb){\n double d = sqrt(norm(a-b));\n double r1 = max(ra,rb);\n double r2 = min(ra,rb);\n \n if(!equals(d,r1-r2) && d < r1-r2) return ra < rb; \n return false;\n}\n\n\n//cross product of pq and pr\ndouble cross3p(Point p,Point q,Point r) { return (r.x-q.x) * (p.y -q.y) - (r.y - q.y) * (p.x - q.x); }\n \n//returns true if point r is on the same line as the line pq\nbool collinear(Point p,Point q,Point r) { return fabs(cross3p(p,q,r)) < EPS; }\n \n//returns true if point t is on the left side of line pq\nbool ccwtest(Point p,Point q,Point r){\n return cross3p(p,q,r) > 0; //can be modified to accept collinear points\n}\n \nbool onSegment(Point p,Point q,Point r){\n return collinear(p,q,r) && equals(sqrt(pow(p.x-r.x,2)+pow(p.y-r.y,2)) + sqrt(pow(r.x-q.x,2) + pow(r.y-q.y,2) ),sqrt(pow(p.x-q.x,2)+pow(p.y-q.y,2)) ) ;\n}\n\n\n\nbool intersectLL(Line l, Line m) {\n return abs(cross(l.p2-l.p1, m.p2-m.p1)) > EPS || // non-parallel\n abs(cross(l.p2-l.p1, m.p1-l.p1)) < EPS; // same line\n}\nbool intersectLS(Line l, Line s) {\n return cross(l.p2-l.p1, s.p1-l.p1)* // s[0] is left of l\n cross(l.p2-l.p1, s.p2-l.p1) < EPS; // s[1] is right of l\n}\nbool intersectLP(Line l,Point p) {\n return abs(cross(l.p2-p, l.p1-p)) < EPS;\n}\nbool intersectSS(Line s, Line t) {\n return ccw(s.p1,s.p2,t.p1)*ccw(s.p1,s.p2,t.p2) <= 0 &&\n ccw(t.p1,t.p2,s.p1)*ccw(t.p1,t.p2,s.p2) <= 0;\n}\nbool intersectSP(Line s, Point p) {\n return abs(s.p1-p)+abs(s.p2-p)-abs(s.p2-s.p1) < EPS; // triangle inequality\n}\n\nPoint projection(Line l,Point p) {\n double t = dot(p-l.p1, l.p1-l.p2) / norm(l.p1-l.p2);\n return l.p1 + (l.p1-l.p2)*t;\n}\nPoint reflection(Line l,Point p) {\n return p + (projection(l, p) - p) * 2;\n}\ndouble distanceLP(Line l, Point p) {\n return abs(p - projection(l, p));\n}\ndouble distanceLL(Line l, Line m) {\n return intersectLL(l, m) ? 0 : distanceLP(l, m.p1);\n}\n\ndouble distanceLS(Line l, Line s) {\n if (intersectLS(l, s)) return 0;\n return min(distanceLP(l, s.p1), distanceLP(l, s.p2));\n}\ndouble distanceSP(Line s, Point p) {\n Point r = projection(s, p);\n if (intersectSP(s, r)) return abs(r - p);\n return min(abs(s.p1 - p), abs(s.p2 - p));\n}\n\ndouble distanceSS(Line s, Line t) {\n if (intersectSS(s, t)) return 0;\n return min(min(distanceSP(s, t.p1), distanceSP(s, t.p2)),\n min(distanceSP(t, s.p1), distanceSP(t, s.p2)));\n}\n\nPoint crosspoint(Line l,Line m){\n double A = cross(l.p2-l.p1,m.p2-m.p1);\n double B = cross(l.p2-l.p1,l.p2-m.p1);\n if(abs(A) < EPS && abs(B) < EPS){\n vector<Point> vec;\n vec.push_back(l.p1),vec.push_back(l.p2),vec.push_back(m.p1),vec.push_back(m.p2);\n sort(vec.begin(),vec.end());\n assert(vec[1] == vec[2]); //???????????°??????????????????\n return vec[1];\n //return m.p1;\n }\n if(abs(A) < EPS)assert(false);\n return m.p1 + (m.p2-m.p1)*(B/A);\n}\n\n\n\n\n\n// <---------\n\ninline bool LT(double a,double b) { return !equals(a,b) && a < b; }\ninline bool LTE(double a,double b) { return equals(a,b) || a < b; }\n\nint n;\nPoint ps[110];\ndouble rs[110];\n\nbool insideAny(int i) {\n REP(j,i+1,n) if( insideCC(ps[i],rs[i],ps[j],rs[j]) ) return true;\n return false;\n}\n\nbool trivialFail(int i) {\n if( insideAny(i) ) return true;\n REP(j,i+1,n) if( ps[i] == ps[j] && equals(rs[i],rs[j]) ) return true;\n return false;\n}\n\nPoint vir;\nbool comp_angle(const Point &a,const Point &b) {\n return LT(atan2(vir.y-a.y,vir.x-a.x),atan2(vir.y-b.y,vir.x-b.x));\n}\n\nbool comp_dist(Point a,Point b) {\n return LTE(abs(a-vir),abs(b-vir));\n}\n\npair<Point,Point> crosspointCL(Point cp,double r,Line l) {\n double dist = distanceLP(l,cp);\n Vector v = (l.p1-l.p2) / abs(l.p1-l.p2);\n if( equals(dist,0) ) {\n return pair<Point,Point>(Point(cp+v*r),Point(cp-v*r));\n } else {\n double x = sqrt(r*r-dist*dist);\n return pair<Point,Point>(Point(cp+v*x),Point(cp-v*x));\n }\n}\n\nbool visibleCheckPoint(Point p,int i) {\n REP(j,i+1,n) {\n double dist = abs(p-ps[j]);\n if( LT(dist,rs[j]) ) return false;\n }\n return true;\n}\n\nbool visibleCheckSeg(Segment seg,int i) {\n deque<Point> deq;\n deq.push_back(seg.p1);\n deq.push_back(seg.p2);\n rep(j,2) {\n double dist = abs(deq[j]-ps[i]);\n if( equals(dist,rs[i]) || dist < rs[i] ) if( visibleCheckPoint(deq[j],i) ) return true;\n }\n return false;\n REP(j,i+1,n) {\n double dist = distanceLP(seg,ps[j]);\n if( LTE(rs[j],dist) ) continue;\n pair<Point,Point> pp = crosspointCL(ps[j],rs[j],seg);\n if( onSegment(seg.p1,seg.p2,pp.first) ) deq.push_back(pp.first);\n if( onSegment(seg.p1,seg.p2,pp.second) ) deq.push_back(pp.second);\n }\n \n // sort\n vir = seg.p1;\n sort(deq.begin(),deq.end(),comp_dist);\n \n // check\n rep(j,(int)deq.size()-1) {\n Point p1 = deq[j];\n Point p2 = deq[j+1];\n Point mp = (p1+p2)/2.0;\n double dist = abs(mp-ps[i]);\n if( equals(dist,rs[i]) || dist < rs[i] ) if( visibleCheckPoint(mp,i) ) return true;\n }\n return false;\n}\n\nbool visibleCheckArcJ(int i,int j) {\n deque<Point> deq;\n REP(k,i,n) {\n if( ps[j] == ps[k] && equals(rs[j],rs[k]) ) continue;\n {\n double dist = abs(ps[k]-ps[j]); \n double rdist = rs[k]+rs[j];\n if( equals(dist,rdist) || dist > rdist ) continue;\n }\n pair<Point,Point> pp = crosspointCC(ps[j],rs[j],ps[k],rs[k]);\n deq.push_back(pp.first);\n deq.push_back(pp.second);\n }\n vir = ps[j];\n sort(deq.begin(),deq.end(),comp_angle);\n rep(k,(int)deq.size()) {\n Point p1 = deq[k] - ps[j];\n Point p2 = deq[(k+1)%(int)deq.size()] - ps[j];\n Point mp = ( p1 + p2 ) / 2.0;\n mp = mp + ps[j];\n Vector v = ( mp - ps[j] ) / abs( mp - ps[j] );\n Segment seg = Segment(ps[j]+v*rs[j],ps[j]-v*rs[j]);\n if( visibleCheckSeg(seg,i) ) return true;\n }\n return false;\n}\n\nvoid compute() {\n int cnt = 0;\n rep(i,n) { // check the i-th circle whether the circle is visible or not\n if( trivialFail(i) ) continue;\n bool success = false;\n bool success2 = true;\n REP(j,i+1,n) { \n {\n\tdouble dist = abs(ps[i]-ps[j]); \n\tdouble rdist = rs[i]+rs[j];\n\tif( equals(dist,rdist) || dist > rdist ) continue;\n }\n if( insideCC(ps[j],rs[j],ps[i],rs[i]) ) continue; \n success2 = false;\n if( visibleCheckArcJ(i,j) ) { success = true; break; }\n }\n if( success || success2 ) ++cnt;\n }\n cout << cnt << endl;\n}\n\nint main() {\n while( cin >> n, n ) {\n rep(i,n) cin >> ps[i].x >> ps[i].y >> rs[i];\n compute();\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1360,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_1239_1668972","code_snippet":"#include<bits/stdc++.h>\n\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define EPS (1e-14)\n#define equals(a,b) (fabs((a)-(b)) < EPS)\n#define COUNTER_CLOCKWISE 1\n#define CLOCKWISE -1 \n#define ONLINE_BACK 2\n#define ONLINE_FRONT -2\n#define ON_SEGMENT 0\n\nusing namespace std;\n\nclass Point{\npublic:\n double x,y;\n\n Point(double x = 0,double y = 0): x(x),y(y){}\n\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\n Point operator * (double a){return Point(a*x,a*y);}\n Point operator / (double a){return Point(x/a,y/a);}\n Point operator * (Point a){ return Point(x * a.x - y * a.y, x * a.y + y * a.x); }\n\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:(!equals(y,p.y)&&y<p.y); }\n\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\n\n};\n\nstruct Segment{\n Point p1,p2;\n Segment(Point p1 = Point(),Point p2 = Point()):p1(p1),p2(p2){}\n bool operator < (const Segment& s) const { return ( p2 == s.p2 ) ? p1 < s.p1 : p2 < s.p2; }\n bool operator == (const Segment& s) const { return ( s.p1 == p1 && s.p2 == p2 ) || ( s.p1 == p2 && s.p2 == p1 ); }\n\n};\n\ntypedef Point Vector;\ntypedef Segment Line;\n\ndouble dot(Point a,Point b){ return a.x*b.x + a.y*b.y; }\n\ndouble cross(Point a,Point b){ return a.x*b.y - a.y*b.x; }\n\ndouble norm(Point a){ return a.x*a.x+a.y*a.y; }\n\ndouble abs(Point a){ return sqrt(norm(a)); }\n\nint ccw(Point p0,Point p1,Point p2){\n Point a = p1-p0;\n Point b = p2-p0;\n if(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\n if(cross(a,b) < -EPS)return CLOCKWISE;\n if(dot(a,b) < -EPS)return ONLINE_BACK;\n if(norm(a) < norm(b))return ONLINE_FRONT;\n return ON_SEGMENT;\n}\n\npair<Point, Point> crosspointCC( Point C1, double r1, Point C2, double r2) {\n complex<double> c1(C1.x,C1.y);\n complex<double> c2(C2.x,C2.y);\n complex<double> A = conj(c2-c1), B = (r2*r2-r1*r1-(c2-c1)*conj(c2-c1)), C = r1*r1*(c2-c1);\n complex<double> D = B*B-4.0*A*C;\n complex<double> z1 = (-B+sqrt(D))/(2.0*A)+c1, z2 = (-B-sqrt(D))/(2.0*A)+c1;\n return pair<Point, Point>(Point(z1.real(),z1.imag()),Point(z2.real(),z2.imag()));\n}\n\n// ??? a ?????? b ????????????????????????\nbool insideCC(Point a,double ra,Point b,double rb){\n double d = sqrt(norm(a-b));\n double r1 = max(ra,rb);\n double r2 = min(ra,rb);\n \n if(!equals(d,r1-r2) && d < r1-r2) return ra < rb; \n return false;\n}\n\n\n//cross product of pq and pr\ndouble cross3p(Point p,Point q,Point r) { return (r.x-q.x) * (p.y -q.y) - (r.y - q.y) * (p.x - q.x); }\n \n//returns true if point r is on the same line as the line pq\nbool collinear(Point p,Point q,Point r) { return fabs(cross3p(p,q,r)) < EPS; }\n \n//returns true if point t is on the left side of line pq\nbool ccwtest(Point p,Point q,Point r){\n return cross3p(p,q,r) > 0; //can be modified to accept collinear points\n}\n \nbool onSegment(Point p,Point q,Point r){\n return collinear(p,q,r) && equals(sqrt(pow(p.x-r.x,2)+pow(p.y-r.y,2)) + sqrt(pow(r.x-q.x,2) + pow(r.y-q.y,2) ),sqrt(pow(p.x-q.x,2)+pow(p.y-q.y,2)) ) ;\n}\n\n\n\nbool intersectLL(Line l, Line m) {\n return abs(cross(l.p2-l.p1, m.p2-m.p1)) > EPS || // non-parallel\n abs(cross(l.p2-l.p1, m.p1-l.p1)) < EPS; // same line\n}\nbool intersectLS(Line l, Line s) {\n return cross(l.p2-l.p1, s.p1-l.p1)* // s[0] is left of l\n cross(l.p2-l.p1, s.p2-l.p1) < EPS; // s[1] is right of l\n}\nbool intersectLP(Line l,Point p) {\n return abs(cross(l.p2-p, l.p1-p)) < EPS;\n}\nbool intersectSS(Line s, Line t) {\n return ccw(s.p1,s.p2,t.p1)*ccw(s.p1,s.p2,t.p2) <= 0 &&\n ccw(t.p1,t.p2,s.p1)*ccw(t.p1,t.p2,s.p2) <= 0;\n}\nbool intersectSP(Line s, Point p) {\n return abs(s.p1-p)+abs(s.p2-p)-abs(s.p2-s.p1) < EPS; // triangle inequality\n}\n\nPoint projection(Line l,Point p) {\n double t = dot(p-l.p1, l.p1-l.p2) / norm(l.p1-l.p2);\n return l.p1 + (l.p1-l.p2)*t;\n}\nPoint reflection(Line l,Point p) {\n return p + (projection(l, p) - p) * 2;\n}\ndouble distanceLP(Line l, Point p) {\n return abs(p - projection(l, p));\n}\ndouble distanceLL(Line l, Line m) {\n return intersectLL(l, m) ? 0 : distanceLP(l, m.p1);\n}\n\ndouble distanceLS(Line l, Line s) {\n if (intersectLS(l, s)) return 0;\n return min(distanceLP(l, s.p1), distanceLP(l, s.p2));\n}\ndouble distanceSP(Line s, Point p) {\n Point r = projection(s, p);\n if (intersectSP(s, r)) return abs(r - p);\n return min(abs(s.p1 - p), abs(s.p2 - p));\n}\n\ndouble distanceSS(Line s, Line t) {\n if (intersectSS(s, t)) return 0;\n return min(min(distanceSP(s, t.p1), distanceSP(s, t.p2)),\n min(distanceSP(t, s.p1), distanceSP(t, s.p2)));\n}\n\nPoint crosspoint(Line l,Line m){\n double A = cross(l.p2-l.p1,m.p2-m.p1);\n double B = cross(l.p2-l.p1,l.p2-m.p1);\n if(abs(A) < EPS && abs(B) < EPS){\n vector<Point> vec;\n vec.push_back(l.p1),vec.push_back(l.p2),vec.push_back(m.p1),vec.push_back(m.p2);\n sort(vec.begin(),vec.end());\n assert(vec[1] == vec[2]); //???????????°??????????????????\n return vec[1];\n //return m.p1;\n }\n if(abs(A) < EPS)assert(false);\n return m.p1 + (m.p2-m.p1)*(B/A);\n}\n\n\n\n\n\n// <---------\n\ninline bool LT(double a,double b) { return !equals(a,b) && a < b; }\ninline bool LTE(double a,double b) { return equals(a,b) || a < b; }\n\nint n;\nPoint ps[110];\ndouble rs[110];\n\nbool insideAny(int i) {\n REP(j,i+1,n) if( insideCC(ps[i],rs[i],ps[j],rs[j]) ) return true;\n return false;\n}\n\nbool trivialFail(int i) {\n if( insideAny(i) ) return true;\n REP(j,i+1,n) if( ps[i] == ps[j] && equals(rs[i],rs[j]) ) return true;\n return false;\n}\n\nPoint vir;\nbool comp_angle(const Point &a,const Point &b) {\n return LT(atan2(vir.y-a.y,vir.x-a.x),atan2(vir.y-b.y,vir.x-b.x));\n}\n\nbool comp_dist(Point a,Point b) {\n return LTE(abs(a-vir),abs(b-vir));\n}\n\npair<Point,Point> crosspointCL(Point cp,double r,Line l) {\n double dist = distanceLP(l,cp);\n Vector v = (l.p1-l.p2) / abs(l.p1-l.p2);\n if( equals(dist,0) ) {\n return pair<Point,Point>(Point(cp+v*r),Point(cp-v*r));\n } else {\n double x = sqrt(r*r-dist*dist);\n return pair<Point,Point>(Point(cp+v*x),Point(cp-v*x));\n }\n}\n\nbool visibleCheckPoint(Point p,int i) {\n REP(j,i+1,n) {\n double dist = abs(p-ps[j]);\n if( LT(dist,rs[j]) ) return false;\n }\n return true;\n}\n\nbool visibleCheckSeg(Segment seg,int i) {\n deque<Point> deq;\n deq.push_back(seg.p1);\n deq.push_back(seg.p2);\n REP(j,i+1,n) {\n double dist = distanceLP(seg,ps[j]);\n if( LTE(rs[j],dist) ) continue;\n pair<Point,Point> pp = crosspointCL(ps[j],rs[j],seg);\n if( onSegment(seg.p1,seg.p2,pp.first) ) deq.push_back(pp.first);\n if( onSegment(seg.p1,seg.p2,pp.second) ) deq.push_back(pp.second);\n }\n \n // sort\n vir = seg.p1;\n sort(deq.begin(),deq.end(),comp_dist);\n \n // check\n rep(j,(int)deq.size()-1) {\n Point p1 = deq[j];\n Point p2 = deq[j+1];\n Point mp = (p1+p2)/2.0;\n double dist = abs(mp-ps[i]);\n if( equals(dist,rs[i]) || dist < rs[i] ) if( visibleCheckPoint(mp,i) ) return true;\n }\n return false;\n}\n\nbool visibleCheckArcJ(int i,int j) {\n deque<Point> deq;\n REP(k,i,n) {\n if( ps[j] == ps[k] && equals(rs[j],rs[k]) ) continue;\n {\n double dist = abs(ps[k]-ps[j]); \n double rdist = rs[k]+rs[j];\n if( equals(dist,rdist) || dist > rdist ) continue;\n }\n pair<Point,Point> pp = crosspointCC(ps[j],rs[j],ps[k],rs[k]);\n deq.push_back(pp.first);\n deq.push_back(pp.second);\n }\n vir = ps[j];\n sort(deq.begin(),deq.end(),comp_angle);\n rep(k,(int)deq.size()) {\n Point p1 = deq[k] - ps[j];\n Point p2 = deq[(k+1)%(int)deq.size()] - ps[j];\n Point mp = ( p1 + p2 ) / 2.0;\n mp = mp + ps[j];\n Vector v = ( mp - ps[j] ) / abs( mp - ps[j] );\n Segment seg = Segment(ps[j]+v*rs[j],ps[j]-v*rs[j]);\n if( visibleCheckSeg(seg,i) ) return true;\n }\n return false;\n}\n\nvoid compute() {\n int cnt = 0;\n rep(i,n) { // check the i-th circle whether the circle is visible or not\n if( trivialFail(i) ) continue;\n bool success = false;\n bool success2 = true;\n REP(j,i+1,n) { \n {\n\tdouble dist = abs(ps[i]-ps[j]); \n\tdouble rdist = rs[i]+rs[j];\n\tif( equals(dist,rdist) || dist > rdist ) continue;\n }\n if( insideCC(ps[j],rs[j],ps[i],rs[i]) ) continue; \n success2 = false;\n if( visibleCheckArcJ(i,j) ) { success = true; break; }\n }\n if( success || success2 ) ++cnt;\n }\n cout << cnt << endl;\n}\n\nint main() {\n while( cin >> n, n ) {\n rep(i,n) cin >> ps[i].x >> ps[i].y >> rs[i];\n compute();\n }\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":1372,"score_of_the_acc":-0.5029,"final_rank":3},{"submission_id":"aoj_1239_1668936","code_snippet":"#include<bits/stdc++.h>\n\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define EPS (1e-14)\n#define equals(a,b) (fabs((a)-(b)) < EPS)\n#define COUNTER_CLOCKWISE 1\n#define CLOCKWISE -1 \n#define ONLINE_BACK 2\n#define ONLINE_FRONT -2\n#define ON_SEGMENT 0\n\nusing namespace std;\n\nclass Point{\npublic:\n double x,y;\n\n Point(double x = 0,double y = 0): x(x),y(y){}\n\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\n Point operator * (double a){return Point(a*x,a*y);}\n Point operator / (double a){return Point(x/a,y/a);}\n Point operator * (Point a){ return Point(x * a.x - y * a.y, x * a.y + y * a.x); }\n\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:(!equals(y,p.y)&&y<p.y); }\n\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\n\n};\n\nstruct Segment{\n Point p1,p2;\n Segment(Point p1 = Point(),Point p2 = Point()):p1(p1),p2(p2){}\n bool operator < (const Segment& s) const { return ( p2 == s.p2 ) ? p1 < s.p1 : p2 < s.p2; }\n bool operator == (const Segment& s) const { return ( s.p1 == p1 && s.p2 == p2 ) || ( s.p1 == p2 && s.p2 == p1 ); }\n\n};\n\ntypedef Point Vector;\ntypedef Segment Line;\ntypedef vector<Point> Polygon;\n\nostream& operator << (ostream& os,const Point& a){ os << \"(\" << a.x << \",\" << a.y << \")\"; }\n\nostream& operator << (ostream& os,const Segment& a){ os << \"( \" << a.p1 << \" , \" << a.p2 << \" )\"; }\n\ndouble dot(Point a,Point b){ return a.x*b.x + a.y*b.y; }\n\ndouble cross(Point a,Point b){ return a.x*b.y - a.y*b.x; }\n\ndouble norm(Point a){ return a.x*a.x+a.y*a.y; }\n\ndouble abs(Point a){ return sqrt(norm(a)); }\n\n//rad ????§???????????????¢?????§?????????????????¨\nPoint rotate(Point a,double rad){ return Point(cos(rad)*a.x - sin(rad)*a.y,sin(rad)*a.x + cos(rad)*a.y); }\n\n// ??????????????¢????????????\ndouble toRad(double agl){ return agl*M_PI/180.0; }\n\n// a => prev, b => cur, c=> next\n// prev ?????? cur ????????£??? next ????????????????§????????±???????\ndouble getArg(Point a,Point b,Point c){\n double arg1 = atan2(b.y-a.y,b.x-a.x);\n double arg2 = atan2(c.y-b.y,c.x-b.x);\n double arg = fabs( arg1 - arg2 );\n while( arg > M_PI ) arg -= 2.0 * M_PI;\n return fabs(arg);\n}\n\nint ccw(Point p0,Point p1,Point p2){\n Point a = p1-p0;\n Point b = p2-p0;\n if(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\n if(cross(a,b) < -EPS)return CLOCKWISE;\n if(dot(a,b) < -EPS)return ONLINE_BACK;\n if(norm(a) < norm(b))return ONLINE_FRONT;\n return ON_SEGMENT;\n}\n\npair<Point, Point> crosspointCC( Point C1, double r1, Point C2, double r2) {\n complex<double> c1(C1.x,C1.y);\n complex<double> c2(C2.x,C2.y);\n complex<double> A = conj(c2-c1), B = (r2*r2-r1*r1-(c2-c1)*conj(c2-c1)), C = r1*r1*(c2-c1);\n complex<double> D = B*B-4.0*A*C;\n complex<double> z1 = (-B+sqrt(D))/(2.0*A)+c1, z2 = (-B-sqrt(D))/(2.0*A)+c1;\n return pair<Point, Point>(Point(z1.real(),z1.imag()),Point(z2.real(),z2.imag()));\n}\n\n// ??? a ?????? b ????????????????????????\nbool insideCC(Point a,double ra,Point b,double rb){\n double d = sqrt(norm(a-b));\n double r1 = max(ra,rb);\n double r2 = min(ra,rb);\n \n if(!equals(d,r1-r2) && d < r1-r2) return ra < rb; \n return false;\n}\n\n\n//cross product of pq and pr\ndouble cross3p(Point p,Point q,Point r) { return (r.x-q.x) * (p.y -q.y) - (r.y - q.y) * (p.x - q.x); }\n \n//returns true if point r is on the same line as the line pq\nbool collinear(Point p,Point q,Point r) { return fabs(cross3p(p,q,r)) < EPS; }\n \n//returns true if point t is on the left side of line pq\nbool ccwtest(Point p,Point q,Point r){\n return cross3p(p,q,r) > 0; //can be modified to accept collinear points\n}\n \nbool onSegment(Point p,Point q,Point r){\n return collinear(p,q,r) && equals(sqrt(pow(p.x-r.x,2)+pow(p.y-r.y,2)) + sqrt(pow(r.x-q.x,2) + pow(r.y-q.y,2) ),sqrt(pow(p.x-q.x,2)+pow(p.y-q.y,2)) ) ;\n}\n\n\n\nbool intersectLL(Line l, Line m) {\n return abs(cross(l.p2-l.p1, m.p2-m.p1)) > EPS || // non-parallel\n abs(cross(l.p2-l.p1, m.p1-l.p1)) < EPS; // same line\n}\nbool intersectLS(Line l, Line s) {\n return cross(l.p2-l.p1, s.p1-l.p1)* // s[0] is left of l\n cross(l.p2-l.p1, s.p2-l.p1) < EPS; // s[1] is right of l\n}\nbool intersectLP(Line l,Point p) {\n return abs(cross(l.p2-p, l.p1-p)) < EPS;\n}\nbool intersectSS(Line s, Line t) {\n return ccw(s.p1,s.p2,t.p1)*ccw(s.p1,s.p2,t.p2) <= 0 &&\n ccw(t.p1,t.p2,s.p1)*ccw(t.p1,t.p2,s.p2) <= 0;\n}\nbool intersectSP(Line s, Point p) {\n return abs(s.p1-p)+abs(s.p2-p)-abs(s.p2-s.p1) < EPS; // triangle inequality\n}\n\nPoint projection(Line l,Point p) {\n double t = dot(p-l.p1, l.p1-l.p2) / norm(l.p1-l.p2);\n return l.p1 + (l.p1-l.p2)*t;\n}\nPoint reflection(Line l,Point p) {\n return p + (projection(l, p) - p) * 2;\n}\ndouble distanceLP(Line l, Point p) {\n return abs(p - projection(l, p));\n}\ndouble distanceLL(Line l, Line m) {\n return intersectLL(l, m) ? 0 : distanceLP(l, m.p1);\n}\n\ndouble distanceLS(Line l, Line s) {\n if (intersectLS(l, s)) return 0;\n return min(distanceLP(l, s.p1), distanceLP(l, s.p2));\n}\ndouble distanceSP(Line s, Point p) {\n Point r = projection(s, p);\n if (intersectSP(s, r)) return abs(r - p);\n return min(abs(s.p1 - p), abs(s.p2 - p));\n}\n\ndouble distanceSS(Line s, Line t) {\n if (intersectSS(s, t)) return 0;\n return min(min(distanceSP(s, t.p1), distanceSP(s, t.p2)),\n min(distanceSP(t, s.p1), distanceSP(t, s.p2)));\n}\n\nPoint crosspoint(Line l,Line m){\n double A = cross(l.p2-l.p1,m.p2-m.p1);\n double B = cross(l.p2-l.p1,l.p2-m.p1);\n if(abs(A) < EPS && abs(B) < EPS){\n vector<Point> vec;\n vec.push_back(l.p1),vec.push_back(l.p2),vec.push_back(m.p1),vec.push_back(m.p2);\n sort(vec.begin(),vec.end());\n assert(vec[1] == vec[2]); //???????????°??????????????????\n return vec[1];\n //return m.p1;\n }\n if(abs(A) < EPS)assert(false);\n return m.p1 + (m.p2-m.p1)*(B/A);\n}\n\n\n\n\n\n// <---------\n\ninline bool LT(double a,double b) { return !equals(a,b) && a < b; }\ninline bool LTE(double a,double b) { return equals(a,b) || a < b; }\n\nint n;\nPoint ps[110];\ndouble rs[110];\n\nbool insideAny(int i) {\n REP(j,i+1,n) if( insideCC(ps[i],rs[i],ps[j],rs[j]) ) return true;\n return false;\n}\n\nbool trivialFail(int i) {\n if( insideAny(i) ) return true;\n REP(j,i+1,n) if( ps[i] == ps[j] && equals(rs[i],rs[j]) ) return true;\n return false;\n}\n\nPoint vir;\nbool comp_angle(const Point &a,const Point &b) {\n return LT(atan2(vir.y-a.y,vir.x-a.x),atan2(vir.y-b.y,vir.x-b.x));\n}\n\nbool comp_dist(Point a,Point b) {\n return LTE(abs(a-vir),abs(b-vir));\n}\n\npair<Point,Point> crosspointCL(Point cp,double r,Line l) {\n double dist = distanceLP(l,cp);\n Vector v = (l.p1-l.p2) / abs(l.p1-l.p2);\n if( equals(dist,0) ) {\n return pair<Point,Point>(Point(cp+v*r),Point(cp-v*r));\n } else {\n double x = sqrt(r*r-dist*dist);\n return pair<Point,Point>(Point(cp+v*x),Point(cp-v*x));\n }\n}\n\nbool visibleCheckPoint(Point p,int i) {\n REP(j,i+1,n) {\n double dist = abs(p-ps[j]);\n if( LT(dist,rs[j]) ) return false;\n }\n return true;\n}\n\nbool visibleCheckSeg(Segment seg,int i) {\n deque<Point> deq;\n deq.push_back(seg.p1);\n deq.push_back(seg.p2);\n REP(j,i+1,n) {\n double dist = distanceLP(seg,ps[j]);\n if( LTE(rs[j],dist) ) continue;\n pair<Point,Point> pp = crosspointCL(ps[j],rs[j],seg);\n if( onSegment(seg.p1,seg.p2,pp.first) ) deq.push_back(pp.first);\n if( onSegment(seg.p1,seg.p2,pp.second) ) deq.push_back(pp.second);\n }\n \n // sort\n vir = seg.p1;\n sort(deq.begin(),deq.end(),comp_dist);\n \n // check\n rep(j,(int)deq.size()-1) {\n Point p1 = deq[j];\n Point p2 = deq[j+1];\n Point mp = (p1+p2)/2.0;\n double dist = abs(mp-ps[i]);\n if( equals(dist,rs[i]) || dist < rs[i] ) {\n if( visibleCheckPoint(mp,i) ) return true;\n }\n }\n return false;\n}\n\nbool visibleCheckArcJ(int i,int j) {\n deque<Point> deq;\n REP(k,i,n) {\n if( ps[j] == ps[k] && equals(rs[j],rs[k]) ) continue;\n {\n double dist = abs(ps[k]-ps[j]); \n double rdist = rs[k]+rs[j];\n if( equals(dist,rdist) || dist > rdist ) continue;\n }\n pair<Point,Point> pp = crosspointCC(ps[j],rs[j],ps[k],rs[k]);\n deq.push_back(pp.first);\n deq.push_back(pp.second);\n }\n vir = ps[j];\n sort(deq.begin(),deq.end(),comp_angle);\n //deq.erase(unique(deq.begin(),deq.end()),deq.end());\n rep(k,(int)deq.size()) {\n Point p1 = deq[k] - ps[j];\n Point p2 = deq[(k+1)%(int)deq.size()] - ps[j];\n Point mp = ( p1 + p2 ) / 2.0;\n mp = mp + ps[j];\n Vector v = ( mp - ps[j] ) / abs( mp - ps[j] );\n Segment seg = Segment(ps[j]+v*rs[j],ps[j]-v*rs[j]);\n //cout << \"CHECK SEG \" << seg << endl;\n if( visibleCheckSeg(seg,i) ) {\n //cout << \"VISIBLE ARC \" << seg << endl;\n return true;\n }\n }\n return false;\n}\n\nvoid compute() {\n int cnt = 0;\n rep(i,n) { // check the i-th circle whether the circle is visible or not\n //cout << i << \"-th \" << ps[i] << \", \" << rs[i] << endl;\n if( trivialFail(i) ) {\n //cout << i << \" is trivialFail\" << endl;\n continue;\n }\n bool success = false;\n bool success2 = true;\n REP(j,i+1,n) { \n //cout <<\">> \" << j << \" \" << ps[j] << \",\" << rs[j] << endl;\n {\n\tdouble dist = abs(ps[i]-ps[j]); \n\tdouble rdist = rs[i]+rs[j];\n\tif( equals(dist,rdist) || dist > rdist ) {\n\t //puts(\"OVER\");\n\t continue;\n\t}\n }\n if( insideCC(ps[j],rs[j],ps[i],rs[i]) ) {\n\t//puts(\"INSIDE\");\n\tcontinue;\n }\n success2 = false;\n if( visibleCheckArcJ(i,j) ) { \n\t//puts(\"VISIBLE\");\n\tsuccess = true; break; \n }\n //puts(\"INVISIBLE\");\n }\n if( success || success2 ) ++cnt;\n }\n cout << cnt << endl;\n}\n\nint main() {\n while( cin >> n, n ) {\n rep(i,n) cin >> ps[i].x >> ps[i].y >> rs[i];\n compute();\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":1372,"score_of_the_acc":-0.3779,"final_rank":2},{"submission_id":"aoj_1239_1656014","code_snippet":"#include<iostream>\n#include<cfloat>\n#include<cassert>\n#include<cmath>\n#include<cstdio>\n#include<vector>\n#include<set>\n#include<algorithm>\n\nusing namespace std;\n\n#define EPS (1e-15)\n#define equals(a, b) (fabs((a) - (b)) < EPS )\n#define dle(a, b) (equals(a, b) || a < b )\nstatic const double PI = acos(-1);\n\nclass Point{\npublic:\n double x, y;\n\n Point ( double x = 0, double y = 0): x(x), y(y){}\n\n Point operator + ( Point p ){ return Point(x + p.x, y + p.y); }\n Point operator - ( Point p ){ return Point(x - p.x, y - p.y); }\n Point operator * ( double a ){ return Point(x*a, y*a); }\n Point operator / ( double a ){ return Point(x/a, y/a); }\n Point operator / ( Point p ) { return Point((x*p.x+y*p.y)/(p.x*p.x+p.y*p.y), (y*p.x-x*p.y)/(p.x*p.x+p.y*p.y)); }\n \n double abs() { return sqrt(norm());}\n double norm() { return x*x + y*y; }\n\n bool operator < ( const Point &p ) const {\n return x != p.x ? x < p.x : y < p.y;\n }\n\n bool operator == ( const Point &p ) const {\n return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\n }\n};\n\ntypedef Point Vector;\n\n\nclass Segment{\npublic:\n Point p1, p2;\n Segment(Point s = Point(), Point t = Point()): p1(s), p2(t){}\n\n};\n\ntypedef Segment Line;\n\nstatic const int CIRCLE_NON = 0;\nstatic const int CIRCLE_OUT = 1;\nstatic const int CIRCLE_IN = 2;\nstatic const int CIRCLE_CROSS = 3;\n\nclass Circle{\npublic:\n Point c;\n double r;\n Circle(Point c = Point(), double r = 0.0): c(c), r(r){}\n};\n\ndouble norm( Vector a ){ return a.x*a.x + a.y*a.y; }\ndouble abs( Vector a ){ return sqrt(norm(a)); }\nPoint polar( double a, double r ){ return Point(cos(r)*a, sin(r)*a);}\ndouble getDistance( Vector a, Vector b ){ return abs(a - b); }\ndouble dot( Vector a, Vector b ){ return a.x*b.x + a.y*b.y; }\ndouble cross( Vector a, Vector b ){ return a.x*b.y - a.y*b.x; }\n\nPoint project( Segment s, Point p ){\n Vector base = s.p2 - s.p1;\n double t = dot(p - s.p1, base)/norm(base);\n return s.p1 + base*t;\n}\n\ndouble getAngle(Point p){\n double polar = atan2(p.y, p.x);\n return (dle(0, polar))? polar : 2.0*acos(-1)+polar;\n}\n\nint isIntersect(Circle c1, Circle c2){\n double d = abs(c1.c - c2.c);\n if ( c1.r + c2.r < d ) return CIRCLE_NON; // no overlap\n if ( d + c2.r < c1.r ) return CIRCLE_IN; // c1 includes c2\n if ( d + c1.r < c2.r ) return CIRCLE_OUT; // c2 includes c1\n return CIRCLE_CROSS;\n}\n\ndouble getDistanceLP(Line s, Point p){\n return abs(cross(s.p2 - s.p1, p - s.p1)/abs(s.p2 - s.p1));\n}\n\ndouble arg(Vector p){\n return atan2(p.y, p.x);\n}\n\npair<Point, Point> getCrossPoints(Circle c1, Circle c2){\n assert( isIntersect( c1, c2 ) );\n double d = abs(c1.c - c2.c);\n double a = acos((c1.r*c1.r+d*d-c2.r*c2.r)/(2*c1.r*d));\n double t = arg(c2.c - c1.c);\n return make_pair(c1.c+polar(c1.r, t+a), c1.c+polar(c1.r, t-a));\n}\n\nbool isIntersect( Circle c1, Line l ){\n double d = getDistanceLP(l, c1.c);\n return ( equals(d, c1.r) || d < c1.r );\n}\n\npair<Point, Point> getCrossPoints(Circle c, Line l ){\n assert( isIntersect( c, l ) );\n Vector pr = project(l, c.c);\n Vector e = (l.p2 - l.p1)/abs(l.p2 - l.p1);\n double base = sqrt(c.r*c.r - norm(pr-c.c));\n return make_pair(pr + e*base, pr - e*base);\n}\n\nCircle C[100];\nint n;\n\nvoid compute(){\n vector<Point> candidates;\n vector<double> Y; \n\n Y.push_back(-100.0);\n Y.push_back(100.0);\n\n for ( int i = 0; i < n; i++ ){\n Y.push_back(C[i].c.y - C[i].r);\n Y.push_back(C[i].c.y + C[i].r);\n }\n \n for ( int i = 0; i < n-1; i++ ){\n for ( int j = i+1; j < n; j++ ){\n if ( isIntersect(C[i], C[j]) != CIRCLE_CROSS ) continue;\n pair<Point, Point> pp = getCrossPoints(C[i], C[j]);\n Y.push_back(pp.first.y);\n Y.push_back(pp.second.y);\n }\n }\n\n sort(Y.begin(), Y.end());\n\n for ( int k = 0; k < Y.size()-1; k++ ){\n double my = (Y[k+1] + Y[k])/2;\n Line l = Line(Point(-100, my), Point(100, my));\n vector<double> X;\n X.push_back(-100);\n X.push_back(100);\n for ( int i = 0; i < n; i++ ){\n if ( !isIntersect(C[i], l) ) continue;\n pair<Point, Point> pp = getCrossPoints(C[i], l);\n X.push_back(pp.first.x);\n X.push_back(pp.second.x);\n }\n sort(X.begin(), X.end());\n\n for ( int i = 0; i < X.size()-1; i++ ){\n candidates.push_back(Point((X[i+1]+X[i])/2, my));\n }\n }\n\n int ans = 0;\n for ( int i = 0; i < n; i++ ){\n for ( int c = 0; c < candidates.size(); c++ ){\n Point t = candidates[c];\n bool f = true;\n if ( abs(C[i].c - t) > C[i].r ) {\n\tcontinue;\n }\n for ( int j = i+1; j < n; j++ ){\n\tif ( dle(abs(C[j].c - t), C[j].r) ) {\n\t f = false;\n\t break;\n\t}\n }\n if ( f ) {\n\tans++;\n\tbreak;\n }\n }\n }\n\n printf(\"%d\\n\", ans);\n}\n\nint main(){\n double x, y, r;\n while(1){\n cin >> n;\n if ( n == 0 ) break;\n for ( int i = 0; i < n; i++ ){\n cin >> x >> y >> r; C[i] = Circle( Point(x, y), r);\n }\n compute();\n }\n\n return 0;\n}","accuracy":1,"time_ms":90,"memory_kb":3360,"score_of_the_acc":-1.478,"final_rank":4}],"string":"[\n {\n \"submission_id\": \"aoj_1239_4761256\",\n \"code_snippet\": \"#include<iostream>\\n#include<cfloat>\\n#include<cassert>\\n#include<cmath>\\n#include<cstdio>\\n#include<vector>\\n#include<set>\\n#include<algorithm>\\n\\nusing namespace std;\\n\\n#define EPS (1e-15)\\n#define equals(a, b) (fabs((a) - (b)) < EPS )\\n#define dle(a, b) (equals(a, b) || a < b )\\nstatic const double PI = acos(-1);\\n\\nclass Point{\\npublic:\\n double x, y;\\n\\n Point ( double x = 0, double y = 0): x(x), y(y){}\\n\\n Point operator + ( Point p ){ return Point(x + p.x, y + p.y); }\\n Point operator - ( Point p ){ return Point(x - p.x, y - p.y); }\\n Point operator * ( double a ){ return Point(x*a, y*a); }\\n Point operator / ( double a ){ return Point(x/a, y/a); }\\n Point operator / ( Point p ) { return Point((x*p.x+y*p.y)/(p.x*p.x+p.y*p.y), (y*p.x-x*p.y)/(p.x*p.x+p.y*p.y)); }\\n \\n double abs() { return sqrt(norm());}\\n double norm() { return x*x + y*y; }\\n\\n bool operator < ( const Point &p ) const {\\n return x != p.x ? x < p.x : y < p.y;\\n }\\n\\n bool operator == ( const Point &p ) const {\\n return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\\n }\\n};\\n\\ntypedef Point Vector;\\n\\n\\nclass Segment{\\npublic:\\n Point p1, p2;\\n Segment(Point s = Point(), Point t = Point()): p1(s), p2(t){}\\n\\n};\\n\\ntypedef Segment Line;\\n\\nstatic const int CIRCLE_NON = 0;\\nstatic const int CIRCLE_OUT = 1;\\nstatic const int CIRCLE_IN = 2;\\nstatic const int CIRCLE_CROSS = 3;\\n\\nclass Circle{\\npublic:\\n Point c;\\n double r;\\n Circle(Point c = Point(), double r = 0.0): c(c), r(r){}\\n};\\n\\ndouble norm( Vector a ){ return a.x*a.x + a.y*a.y; }\\ndouble abs( Vector a ){ return sqrt(norm(a)); }\\nPoint polar( double a, double r ){ return Point(cos(r)*a, sin(r)*a);}\\ndouble getDistance( Vector a, Vector b ){ return abs(a - b); }\\ndouble dot( Vector a, Vector b ){ return a.x*b.x + a.y*b.y; }\\ndouble cross( Vector a, Vector b ){ return a.x*b.y - a.y*b.x; }\\n\\nPoint project( Segment s, Point p ){\\n Vector base = s.p2 - s.p1;\\n double t = dot(p - s.p1, base)/norm(base);\\n return s.p1 + base*t;\\n}\\n\\ndouble getAngle(Point p){\\n double polar = atan2(p.y, p.x);\\n return (dle(0, polar))? polar : 2.0*acos(-1)+polar;\\n}\\n\\nint isIntersect(Circle c1, Circle c2){\\n double d = abs(c1.c - c2.c);\\n if ( c1.r + c2.r < d ) return CIRCLE_NON; // no overlap\\n if ( d + c2.r < c1.r ) return CIRCLE_IN; // c1 includes c2\\n if ( d + c1.r < c2.r ) return CIRCLE_OUT; // c2 includes c1\\n return CIRCLE_CROSS;\\n}\\n\\ndouble getDistanceLP(Line s, Point p){\\n return abs(cross(s.p2 - s.p1, p - s.p1)/abs(s.p2 - s.p1));\\n}\\n\\ndouble arg(Vector p){\\n return atan2(p.y, p.x);\\n}\\n\\npair<Point, Point> getCrossPoints(Circle c1, Circle c2){\\n assert( isIntersect( c1, c2 ) );\\n double d = abs(c1.c - c2.c);\\n double a = acos((c1.r*c1.r+d*d-c2.r*c2.r)/(2*c1.r*d));\\n double t = arg(c2.c - c1.c);\\n return make_pair(c1.c+polar(c1.r, t+a), c1.c+polar(c1.r, t-a));\\n}\\n\\nbool isIntersect( Circle c1, Line l ){\\n double d = getDistanceLP(l, c1.c);\\n return ( equals(d, c1.r) || d < c1.r );\\n}\\n\\npair<Point, Point> getCrossPoints(Circle c, Line l ){\\n assert( isIntersect( c, l ) );\\n Vector pr = project(l, c.c);\\n Vector e = (l.p2 - l.p1)/abs(l.p2 - l.p1);\\n double base = sqrt(c.r*c.r - norm(pr-c.c));\\n return make_pair(pr + e*base, pr - e*base);\\n}\\n\\nCircle C[100];\\nint n;\\n\\nvoid compute(){\\n vector<Point> candidates;\\n vector<double> Y; \\n\\n Y.push_back(-100.0);\\n Y.push_back(100.0);\\n\\n for ( int i = 0; i < n; i++ ){\\n Y.push_back(C[i].c.y - C[i].r);\\n Y.push_back(C[i].c.y + C[i].r);\\n }\\n \\n for ( int i = 0; i < n-1; i++ ){\\n for ( int j = i+1; j < n; j++ ){\\n if ( isIntersect(C[i], C[j]) != CIRCLE_CROSS ) continue;\\n pair<Point, Point> pp = getCrossPoints(C[i], C[j]);\\n Y.push_back(pp.first.y);\\n Y.push_back(pp.second.y);\\n }\\n }\\n\\n sort(Y.begin(), Y.end());\\n\\n for ( int k = 0; k < Y.size()-1; k++ ){\\n double my = (Y[k+1] + Y[k])/2;\\n Line l = Line(Point(-100, my), Point(100, my));\\n vector<double> X;\\n X.push_back(-100);\\n X.push_back(100);\\n for ( int i = 0; i < n; i++ ){\\n if ( !isIntersect(C[i], l) ) continue;\\n pair<Point, Point> pp = getCrossPoints(C[i], l);\\n X.push_back(pp.first.x);\\n X.push_back(pp.second.x);\\n }\\n sort(X.begin(), X.end());\\n\\n for ( int i = 0; i < X.size()-1; i++ ){\\n candidates.push_back(Point((X[i+1]+X[i])/2, my));\\n }\\n }\\n\\n int ans = 0;\\n for ( int i = 0; i < n; i++ ){\\n for ( int c = 0; c < candidates.size(); c++ ){\\n Point t = candidates[c];\\n bool f = true;\\n if ( abs(C[i].c - t) > C[i].r ) {\\n\\tcontinue;\\n }\\n for ( int j = i+1; j < n; j++ ){\\n\\tif ( dle(abs(C[j].c - t), C[j].r) ) {\\n\\t f = false;\\n\\t break;\\n\\t}\\n }\\n if ( f ) {\\n\\tans++;\\n\\tbreak;\\n }\\n }\\n }\\n\\n printf(\\\"%d\\\\n\\\", ans);\\n}\\n\\nint main(){\\n double x, y, r;\\n while(1){\\n cin >> n;\\n if ( n == 0 ) break;\\n for ( int i = 0; i < n; i++ ){\\n cin >> x >> y >> r; C[i] = Circle( Point(x, y), r);\\n }\\n compute();\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 5544,\n \"score_of_the_acc\": -1.5,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1239_1669020\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define EPS (1e-14)\\n#define equals(a,b) (fabs((a)-(b)) < EPS)\\n#define COUNTER_CLOCKWISE 1\\n#define CLOCKWISE -1 \\n#define ONLINE_BACK 2\\n#define ONLINE_FRONT -2\\n#define ON_SEGMENT 0\\n\\nusing namespace std;\\n\\nclass Point{\\npublic:\\n double x,y;\\n\\n Point(double x = 0,double y = 0): x(x),y(y){}\\n\\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\\n Point operator * (double a){return Point(a*x,a*y);}\\n Point operator / (double a){return Point(x/a,y/a);}\\n Point operator * (Point a){ return Point(x * a.x - y * a.y, x * a.y + y * a.x); }\\n\\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:(!equals(y,p.y)&&y<p.y); }\\n\\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\\n\\n};\\n\\nstruct Segment{\\n Point p1,p2;\\n Segment(Point p1 = Point(),Point p2 = Point()):p1(p1),p2(p2){}\\n bool operator < (const Segment& s) const { return ( p2 == s.p2 ) ? p1 < s.p1 : p2 < s.p2; }\\n bool operator == (const Segment& s) const { return ( s.p1 == p1 && s.p2 == p2 ) || ( s.p1 == p2 && s.p2 == p1 ); }\\n\\n};\\n\\ntypedef Point Vector;\\ntypedef Segment Line;\\n\\ndouble dot(Point a,Point b){ return a.x*b.x + a.y*b.y; }\\n\\ndouble cross(Point a,Point b){ return a.x*b.y - a.y*b.x; }\\n\\ndouble norm(Point a){ return a.x*a.x+a.y*a.y; }\\n\\ndouble abs(Point a){ return sqrt(norm(a)); }\\n\\nint ccw(Point p0,Point p1,Point p2){\\n Point a = p1-p0;\\n Point b = p2-p0;\\n if(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\\n if(cross(a,b) < -EPS)return CLOCKWISE;\\n if(dot(a,b) < -EPS)return ONLINE_BACK;\\n if(norm(a) < norm(b))return ONLINE_FRONT;\\n return ON_SEGMENT;\\n}\\n\\npair<Point, Point> crosspointCC( Point C1, double r1, Point C2, double r2) {\\n complex<double> c1(C1.x,C1.y);\\n complex<double> c2(C2.x,C2.y);\\n complex<double> A = conj(c2-c1), B = (r2*r2-r1*r1-(c2-c1)*conj(c2-c1)), C = r1*r1*(c2-c1);\\n complex<double> D = B*B-4.0*A*C;\\n complex<double> z1 = (-B+sqrt(D))/(2.0*A)+c1, z2 = (-B-sqrt(D))/(2.0*A)+c1;\\n return pair<Point, Point>(Point(z1.real(),z1.imag()),Point(z2.real(),z2.imag()));\\n}\\n\\n// ??? a ?????? b ????????????????????????\\nbool insideCC(Point a,double ra,Point b,double rb){\\n double d = sqrt(norm(a-b));\\n double r1 = max(ra,rb);\\n double r2 = min(ra,rb);\\n \\n if(!equals(d,r1-r2) && d < r1-r2) return ra < rb; \\n return false;\\n}\\n\\n\\n//cross product of pq and pr\\ndouble cross3p(Point p,Point q,Point r) { return (r.x-q.x) * (p.y -q.y) - (r.y - q.y) * (p.x - q.x); }\\n \\n//returns true if point r is on the same line as the line pq\\nbool collinear(Point p,Point q,Point r) { return fabs(cross3p(p,q,r)) < EPS; }\\n \\n//returns true if point t is on the left side of line pq\\nbool ccwtest(Point p,Point q,Point r){\\n return cross3p(p,q,r) > 0; //can be modified to accept collinear points\\n}\\n \\nbool onSegment(Point p,Point q,Point r){\\n return collinear(p,q,r) && equals(sqrt(pow(p.x-r.x,2)+pow(p.y-r.y,2)) + sqrt(pow(r.x-q.x,2) + pow(r.y-q.y,2) ),sqrt(pow(p.x-q.x,2)+pow(p.y-q.y,2)) ) ;\\n}\\n\\n\\n\\nbool intersectLL(Line l, Line m) {\\n return abs(cross(l.p2-l.p1, m.p2-m.p1)) > EPS || // non-parallel\\n abs(cross(l.p2-l.p1, m.p1-l.p1)) < EPS; // same line\\n}\\nbool intersectLS(Line l, Line s) {\\n return cross(l.p2-l.p1, s.p1-l.p1)* // s[0] is left of l\\n cross(l.p2-l.p1, s.p2-l.p1) < EPS; // s[1] is right of l\\n}\\nbool intersectLP(Line l,Point p) {\\n return abs(cross(l.p2-p, l.p1-p)) < EPS;\\n}\\nbool intersectSS(Line s, Line t) {\\n return ccw(s.p1,s.p2,t.p1)*ccw(s.p1,s.p2,t.p2) <= 0 &&\\n ccw(t.p1,t.p2,s.p1)*ccw(t.p1,t.p2,s.p2) <= 0;\\n}\\nbool intersectSP(Line s, Point p) {\\n return abs(s.p1-p)+abs(s.p2-p)-abs(s.p2-s.p1) < EPS; // triangle inequality\\n}\\n\\nPoint projection(Line l,Point p) {\\n double t = dot(p-l.p1, l.p1-l.p2) / norm(l.p1-l.p2);\\n return l.p1 + (l.p1-l.p2)*t;\\n}\\nPoint reflection(Line l,Point p) {\\n return p + (projection(l, p) - p) * 2;\\n}\\ndouble distanceLP(Line l, Point p) {\\n return abs(p - projection(l, p));\\n}\\ndouble distanceLL(Line l, Line m) {\\n return intersectLL(l, m) ? 0 : distanceLP(l, m.p1);\\n}\\n\\ndouble distanceLS(Line l, Line s) {\\n if (intersectLS(l, s)) return 0;\\n return min(distanceLP(l, s.p1), distanceLP(l, s.p2));\\n}\\ndouble distanceSP(Line s, Point p) {\\n Point r = projection(s, p);\\n if (intersectSP(s, r)) return abs(r - p);\\n return min(abs(s.p1 - p), abs(s.p2 - p));\\n}\\n\\ndouble distanceSS(Line s, Line t) {\\n if (intersectSS(s, t)) return 0;\\n return min(min(distanceSP(s, t.p1), distanceSP(s, t.p2)),\\n min(distanceSP(t, s.p1), distanceSP(t, s.p2)));\\n}\\n\\nPoint crosspoint(Line l,Line m){\\n double A = cross(l.p2-l.p1,m.p2-m.p1);\\n double B = cross(l.p2-l.p1,l.p2-m.p1);\\n if(abs(A) < EPS && abs(B) < EPS){\\n vector<Point> vec;\\n vec.push_back(l.p1),vec.push_back(l.p2),vec.push_back(m.p1),vec.push_back(m.p2);\\n sort(vec.begin(),vec.end());\\n assert(vec[1] == vec[2]); //???????????°??????????????????\\n return vec[1];\\n //return m.p1;\\n }\\n if(abs(A) < EPS)assert(false);\\n return m.p1 + (m.p2-m.p1)*(B/A);\\n}\\n\\n\\n\\n\\n\\n// <---------\\n\\ninline bool LT(double a,double b) { return !equals(a,b) && a < b; }\\ninline bool LTE(double a,double b) { return equals(a,b) || a < b; }\\n\\nint n;\\nPoint ps[110];\\ndouble rs[110];\\n\\nbool insideAny(int i) {\\n REP(j,i+1,n) if( insideCC(ps[i],rs[i],ps[j],rs[j]) ) return true;\\n return false;\\n}\\n\\nbool trivialFail(int i) {\\n if( insideAny(i) ) return true;\\n REP(j,i+1,n) if( ps[i] == ps[j] && equals(rs[i],rs[j]) ) return true;\\n return false;\\n}\\n\\nPoint vir;\\nbool comp_angle(const Point &a,const Point &b) {\\n return LT(atan2(vir.y-a.y,vir.x-a.x),atan2(vir.y-b.y,vir.x-b.x));\\n}\\n\\nbool comp_dist(Point a,Point b) {\\n return LTE(abs(a-vir),abs(b-vir));\\n}\\n\\npair<Point,Point> crosspointCL(Point cp,double r,Line l) {\\n double dist = distanceLP(l,cp);\\n Vector v = (l.p1-l.p2) / abs(l.p1-l.p2);\\n if( equals(dist,0) ) {\\n return pair<Point,Point>(Point(cp+v*r),Point(cp-v*r));\\n } else {\\n double x = sqrt(r*r-dist*dist);\\n return pair<Point,Point>(Point(cp+v*x),Point(cp-v*x));\\n }\\n}\\n\\nbool visibleCheckPoint(Point p,int i) {\\n REP(j,i+1,n) {\\n double dist = abs(p-ps[j]);\\n if( LT(dist,rs[j]) ) return false;\\n }\\n return true;\\n}\\n\\nbool visibleCheckSeg(Segment seg,int i) {\\n deque<Point> deq;\\n deq.push_back(seg.p1);\\n deq.push_back(seg.p2);\\n rep(j,2) {\\n double dist = abs(deq[j]-ps[i]);\\n if( equals(dist,rs[i]) || dist < rs[i] ) if( visibleCheckPoint(deq[j],i) ) return true;\\n }\\n return false;\\n REP(j,i+1,n) {\\n double dist = distanceLP(seg,ps[j]);\\n if( LTE(rs[j],dist) ) continue;\\n pair<Point,Point> pp = crosspointCL(ps[j],rs[j],seg);\\n if( onSegment(seg.p1,seg.p2,pp.first) ) deq.push_back(pp.first);\\n if( onSegment(seg.p1,seg.p2,pp.second) ) deq.push_back(pp.second);\\n }\\n \\n // sort\\n vir = seg.p1;\\n sort(deq.begin(),deq.end(),comp_dist);\\n \\n // check\\n rep(j,(int)deq.size()-1) {\\n Point p1 = deq[j];\\n Point p2 = deq[j+1];\\n Point mp = (p1+p2)/2.0;\\n double dist = abs(mp-ps[i]);\\n if( equals(dist,rs[i]) || dist < rs[i] ) if( visibleCheckPoint(mp,i) ) return true;\\n }\\n return false;\\n}\\n\\nbool visibleCheckArcJ(int i,int j) {\\n deque<Point> deq;\\n REP(k,i,n) {\\n if( ps[j] == ps[k] && equals(rs[j],rs[k]) ) continue;\\n {\\n double dist = abs(ps[k]-ps[j]); \\n double rdist = rs[k]+rs[j];\\n if( equals(dist,rdist) || dist > rdist ) continue;\\n }\\n pair<Point,Point> pp = crosspointCC(ps[j],rs[j],ps[k],rs[k]);\\n deq.push_back(pp.first);\\n deq.push_back(pp.second);\\n }\\n vir = ps[j];\\n sort(deq.begin(),deq.end(),comp_angle);\\n rep(k,(int)deq.size()) {\\n Point p1 = deq[k] - ps[j];\\n Point p2 = deq[(k+1)%(int)deq.size()] - ps[j];\\n Point mp = ( p1 + p2 ) / 2.0;\\n mp = mp + ps[j];\\n Vector v = ( mp - ps[j] ) / abs( mp - ps[j] );\\n Segment seg = Segment(ps[j]+v*rs[j],ps[j]-v*rs[j]);\\n if( visibleCheckSeg(seg,i) ) return true;\\n }\\n return false;\\n}\\n\\nvoid compute() {\\n int cnt = 0;\\n rep(i,n) { // check the i-th circle whether the circle is visible or not\\n if( trivialFail(i) ) continue;\\n bool success = false;\\n bool success2 = true;\\n REP(j,i+1,n) { \\n {\\n\\tdouble dist = abs(ps[i]-ps[j]); \\n\\tdouble rdist = rs[i]+rs[j];\\n\\tif( equals(dist,rdist) || dist > rdist ) continue;\\n }\\n if( insideCC(ps[j],rs[j],ps[i],rs[i]) ) continue; \\n success2 = false;\\n if( visibleCheckArcJ(i,j) ) { success = true; break; }\\n }\\n if( success || success2 ) ++cnt;\\n }\\n cout << cnt << endl;\\n}\\n\\nint main() {\\n while( cin >> n, n ) {\\n rep(i,n) cin >> ps[i].x >> ps[i].y >> rs[i];\\n compute();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1360,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1239_1668972\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define EPS (1e-14)\\n#define equals(a,b) (fabs((a)-(b)) < EPS)\\n#define COUNTER_CLOCKWISE 1\\n#define CLOCKWISE -1 \\n#define ONLINE_BACK 2\\n#define ONLINE_FRONT -2\\n#define ON_SEGMENT 0\\n\\nusing namespace std;\\n\\nclass Point{\\npublic:\\n double x,y;\\n\\n Point(double x = 0,double y = 0): x(x),y(y){}\\n\\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\\n Point operator * (double a){return Point(a*x,a*y);}\\n Point operator / (double a){return Point(x/a,y/a);}\\n Point operator * (Point a){ return Point(x * a.x - y * a.y, x * a.y + y * a.x); }\\n\\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:(!equals(y,p.y)&&y<p.y); }\\n\\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\\n\\n};\\n\\nstruct Segment{\\n Point p1,p2;\\n Segment(Point p1 = Point(),Point p2 = Point()):p1(p1),p2(p2){}\\n bool operator < (const Segment& s) const { return ( p2 == s.p2 ) ? p1 < s.p1 : p2 < s.p2; }\\n bool operator == (const Segment& s) const { return ( s.p1 == p1 && s.p2 == p2 ) || ( s.p1 == p2 && s.p2 == p1 ); }\\n\\n};\\n\\ntypedef Point Vector;\\ntypedef Segment Line;\\n\\ndouble dot(Point a,Point b){ return a.x*b.x + a.y*b.y; }\\n\\ndouble cross(Point a,Point b){ return a.x*b.y - a.y*b.x; }\\n\\ndouble norm(Point a){ return a.x*a.x+a.y*a.y; }\\n\\ndouble abs(Point a){ return sqrt(norm(a)); }\\n\\nint ccw(Point p0,Point p1,Point p2){\\n Point a = p1-p0;\\n Point b = p2-p0;\\n if(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\\n if(cross(a,b) < -EPS)return CLOCKWISE;\\n if(dot(a,b) < -EPS)return ONLINE_BACK;\\n if(norm(a) < norm(b))return ONLINE_FRONT;\\n return ON_SEGMENT;\\n}\\n\\npair<Point, Point> crosspointCC( Point C1, double r1, Point C2, double r2) {\\n complex<double> c1(C1.x,C1.y);\\n complex<double> c2(C2.x,C2.y);\\n complex<double> A = conj(c2-c1), B = (r2*r2-r1*r1-(c2-c1)*conj(c2-c1)), C = r1*r1*(c2-c1);\\n complex<double> D = B*B-4.0*A*C;\\n complex<double> z1 = (-B+sqrt(D))/(2.0*A)+c1, z2 = (-B-sqrt(D))/(2.0*A)+c1;\\n return pair<Point, Point>(Point(z1.real(),z1.imag()),Point(z2.real(),z2.imag()));\\n}\\n\\n// ??? a ?????? b ????????????????????????\\nbool insideCC(Point a,double ra,Point b,double rb){\\n double d = sqrt(norm(a-b));\\n double r1 = max(ra,rb);\\n double r2 = min(ra,rb);\\n \\n if(!equals(d,r1-r2) && d < r1-r2) return ra < rb; \\n return false;\\n}\\n\\n\\n//cross product of pq and pr\\ndouble cross3p(Point p,Point q,Point r) { return (r.x-q.x) * (p.y -q.y) - (r.y - q.y) * (p.x - q.x); }\\n \\n//returns true if point r is on the same line as the line pq\\nbool collinear(Point p,Point q,Point r) { return fabs(cross3p(p,q,r)) < EPS; }\\n \\n//returns true if point t is on the left side of line pq\\nbool ccwtest(Point p,Point q,Point r){\\n return cross3p(p,q,r) > 0; //can be modified to accept collinear points\\n}\\n \\nbool onSegment(Point p,Point q,Point r){\\n return collinear(p,q,r) && equals(sqrt(pow(p.x-r.x,2)+pow(p.y-r.y,2)) + sqrt(pow(r.x-q.x,2) + pow(r.y-q.y,2) ),sqrt(pow(p.x-q.x,2)+pow(p.y-q.y,2)) ) ;\\n}\\n\\n\\n\\nbool intersectLL(Line l, Line m) {\\n return abs(cross(l.p2-l.p1, m.p2-m.p1)) > EPS || // non-parallel\\n abs(cross(l.p2-l.p1, m.p1-l.p1)) < EPS; // same line\\n}\\nbool intersectLS(Line l, Line s) {\\n return cross(l.p2-l.p1, s.p1-l.p1)* // s[0] is left of l\\n cross(l.p2-l.p1, s.p2-l.p1) < EPS; // s[1] is right of l\\n}\\nbool intersectLP(Line l,Point p) {\\n return abs(cross(l.p2-p, l.p1-p)) < EPS;\\n}\\nbool intersectSS(Line s, Line t) {\\n return ccw(s.p1,s.p2,t.p1)*ccw(s.p1,s.p2,t.p2) <= 0 &&\\n ccw(t.p1,t.p2,s.p1)*ccw(t.p1,t.p2,s.p2) <= 0;\\n}\\nbool intersectSP(Line s, Point p) {\\n return abs(s.p1-p)+abs(s.p2-p)-abs(s.p2-s.p1) < EPS; // triangle inequality\\n}\\n\\nPoint projection(Line l,Point p) {\\n double t = dot(p-l.p1, l.p1-l.p2) / norm(l.p1-l.p2);\\n return l.p1 + (l.p1-l.p2)*t;\\n}\\nPoint reflection(Line l,Point p) {\\n return p + (projection(l, p) - p) * 2;\\n}\\ndouble distanceLP(Line l, Point p) {\\n return abs(p - projection(l, p));\\n}\\ndouble distanceLL(Line l, Line m) {\\n return intersectLL(l, m) ? 0 : distanceLP(l, m.p1);\\n}\\n\\ndouble distanceLS(Line l, Line s) {\\n if (intersectLS(l, s)) return 0;\\n return min(distanceLP(l, s.p1), distanceLP(l, s.p2));\\n}\\ndouble distanceSP(Line s, Point p) {\\n Point r = projection(s, p);\\n if (intersectSP(s, r)) return abs(r - p);\\n return min(abs(s.p1 - p), abs(s.p2 - p));\\n}\\n\\ndouble distanceSS(Line s, Line t) {\\n if (intersectSS(s, t)) return 0;\\n return min(min(distanceSP(s, t.p1), distanceSP(s, t.p2)),\\n min(distanceSP(t, s.p1), distanceSP(t, s.p2)));\\n}\\n\\nPoint crosspoint(Line l,Line m){\\n double A = cross(l.p2-l.p1,m.p2-m.p1);\\n double B = cross(l.p2-l.p1,l.p2-m.p1);\\n if(abs(A) < EPS && abs(B) < EPS){\\n vector<Point> vec;\\n vec.push_back(l.p1),vec.push_back(l.p2),vec.push_back(m.p1),vec.push_back(m.p2);\\n sort(vec.begin(),vec.end());\\n assert(vec[1] == vec[2]); //???????????°??????????????????\\n return vec[1];\\n //return m.p1;\\n }\\n if(abs(A) < EPS)assert(false);\\n return m.p1 + (m.p2-m.p1)*(B/A);\\n}\\n\\n\\n\\n\\n\\n// <---------\\n\\ninline bool LT(double a,double b) { return !equals(a,b) && a < b; }\\ninline bool LTE(double a,double b) { return equals(a,b) || a < b; }\\n\\nint n;\\nPoint ps[110];\\ndouble rs[110];\\n\\nbool insideAny(int i) {\\n REP(j,i+1,n) if( insideCC(ps[i],rs[i],ps[j],rs[j]) ) return true;\\n return false;\\n}\\n\\nbool trivialFail(int i) {\\n if( insideAny(i) ) return true;\\n REP(j,i+1,n) if( ps[i] == ps[j] && equals(rs[i],rs[j]) ) return true;\\n return false;\\n}\\n\\nPoint vir;\\nbool comp_angle(const Point &a,const Point &b) {\\n return LT(atan2(vir.y-a.y,vir.x-a.x),atan2(vir.y-b.y,vir.x-b.x));\\n}\\n\\nbool comp_dist(Point a,Point b) {\\n return LTE(abs(a-vir),abs(b-vir));\\n}\\n\\npair<Point,Point> crosspointCL(Point cp,double r,Line l) {\\n double dist = distanceLP(l,cp);\\n Vector v = (l.p1-l.p2) / abs(l.p1-l.p2);\\n if( equals(dist,0) ) {\\n return pair<Point,Point>(Point(cp+v*r),Point(cp-v*r));\\n } else {\\n double x = sqrt(r*r-dist*dist);\\n return pair<Point,Point>(Point(cp+v*x),Point(cp-v*x));\\n }\\n}\\n\\nbool visibleCheckPoint(Point p,int i) {\\n REP(j,i+1,n) {\\n double dist = abs(p-ps[j]);\\n if( LT(dist,rs[j]) ) return false;\\n }\\n return true;\\n}\\n\\nbool visibleCheckSeg(Segment seg,int i) {\\n deque<Point> deq;\\n deq.push_back(seg.p1);\\n deq.push_back(seg.p2);\\n REP(j,i+1,n) {\\n double dist = distanceLP(seg,ps[j]);\\n if( LTE(rs[j],dist) ) continue;\\n pair<Point,Point> pp = crosspointCL(ps[j],rs[j],seg);\\n if( onSegment(seg.p1,seg.p2,pp.first) ) deq.push_back(pp.first);\\n if( onSegment(seg.p1,seg.p2,pp.second) ) deq.push_back(pp.second);\\n }\\n \\n // sort\\n vir = seg.p1;\\n sort(deq.begin(),deq.end(),comp_dist);\\n \\n // check\\n rep(j,(int)deq.size()-1) {\\n Point p1 = deq[j];\\n Point p2 = deq[j+1];\\n Point mp = (p1+p2)/2.0;\\n double dist = abs(mp-ps[i]);\\n if( equals(dist,rs[i]) || dist < rs[i] ) if( visibleCheckPoint(mp,i) ) return true;\\n }\\n return false;\\n}\\n\\nbool visibleCheckArcJ(int i,int j) {\\n deque<Point> deq;\\n REP(k,i,n) {\\n if( ps[j] == ps[k] && equals(rs[j],rs[k]) ) continue;\\n {\\n double dist = abs(ps[k]-ps[j]); \\n double rdist = rs[k]+rs[j];\\n if( equals(dist,rdist) || dist > rdist ) continue;\\n }\\n pair<Point,Point> pp = crosspointCC(ps[j],rs[j],ps[k],rs[k]);\\n deq.push_back(pp.first);\\n deq.push_back(pp.second);\\n }\\n vir = ps[j];\\n sort(deq.begin(),deq.end(),comp_angle);\\n rep(k,(int)deq.size()) {\\n Point p1 = deq[k] - ps[j];\\n Point p2 = deq[(k+1)%(int)deq.size()] - ps[j];\\n Point mp = ( p1 + p2 ) / 2.0;\\n mp = mp + ps[j];\\n Vector v = ( mp - ps[j] ) / abs( mp - ps[j] );\\n Segment seg = Segment(ps[j]+v*rs[j],ps[j]-v*rs[j]);\\n if( visibleCheckSeg(seg,i) ) return true;\\n }\\n return false;\\n}\\n\\nvoid compute() {\\n int cnt = 0;\\n rep(i,n) { // check the i-th circle whether the circle is visible or not\\n if( trivialFail(i) ) continue;\\n bool success = false;\\n bool success2 = true;\\n REP(j,i+1,n) { \\n {\\n\\tdouble dist = abs(ps[i]-ps[j]); \\n\\tdouble rdist = rs[i]+rs[j];\\n\\tif( equals(dist,rdist) || dist > rdist ) continue;\\n }\\n if( insideCC(ps[j],rs[j],ps[i],rs[i]) ) continue; \\n success2 = false;\\n if( visibleCheckArcJ(i,j) ) { success = true; break; }\\n }\\n if( success || success2 ) ++cnt;\\n }\\n cout << cnt << endl;\\n}\\n\\nint main() {\\n while( cin >> n, n ) {\\n rep(i,n) cin >> ps[i].x >> ps[i].y >> rs[i];\\n compute();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 1372,\n \"score_of_the_acc\": -0.5029,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1239_1668936\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define EPS (1e-14)\\n#define equals(a,b) (fabs((a)-(b)) < EPS)\\n#define COUNTER_CLOCKWISE 1\\n#define CLOCKWISE -1 \\n#define ONLINE_BACK 2\\n#define ONLINE_FRONT -2\\n#define ON_SEGMENT 0\\n\\nusing namespace std;\\n\\nclass Point{\\npublic:\\n double x,y;\\n\\n Point(double x = 0,double y = 0): x(x),y(y){}\\n\\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\\n Point operator * (double a){return Point(a*x,a*y);}\\n Point operator / (double a){return Point(x/a,y/a);}\\n Point operator * (Point a){ return Point(x * a.x - y * a.y, x * a.y + y * a.x); }\\n\\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:(!equals(y,p.y)&&y<p.y); }\\n\\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\\n\\n};\\n\\nstruct Segment{\\n Point p1,p2;\\n Segment(Point p1 = Point(),Point p2 = Point()):p1(p1),p2(p2){}\\n bool operator < (const Segment& s) const { return ( p2 == s.p2 ) ? p1 < s.p1 : p2 < s.p2; }\\n bool operator == (const Segment& s) const { return ( s.p1 == p1 && s.p2 == p2 ) || ( s.p1 == p2 && s.p2 == p1 ); }\\n\\n};\\n\\ntypedef Point Vector;\\ntypedef Segment Line;\\ntypedef vector<Point> Polygon;\\n\\nostream& operator << (ostream& os,const Point& a){ os << \\\"(\\\" << a.x << \\\",\\\" << a.y << \\\")\\\"; }\\n\\nostream& operator << (ostream& os,const Segment& a){ os << \\\"( \\\" << a.p1 << \\\" , \\\" << a.p2 << \\\" )\\\"; }\\n\\ndouble dot(Point a,Point b){ return a.x*b.x + a.y*b.y; }\\n\\ndouble cross(Point a,Point b){ return a.x*b.y - a.y*b.x; }\\n\\ndouble norm(Point a){ return a.x*a.x+a.y*a.y; }\\n\\ndouble abs(Point a){ return sqrt(norm(a)); }\\n\\n//rad ????§???????????????¢?????§?????????????????¨\\nPoint rotate(Point a,double rad){ return Point(cos(rad)*a.x - sin(rad)*a.y,sin(rad)*a.x + cos(rad)*a.y); }\\n\\n// ??????????????¢????????????\\ndouble toRad(double agl){ return agl*M_PI/180.0; }\\n\\n// a => prev, b => cur, c=> next\\n// prev ?????? cur ????????£??? next ????????????????§????????±???????\\ndouble getArg(Point a,Point b,Point c){\\n double arg1 = atan2(b.y-a.y,b.x-a.x);\\n double arg2 = atan2(c.y-b.y,c.x-b.x);\\n double arg = fabs( arg1 - arg2 );\\n while( arg > M_PI ) arg -= 2.0 * M_PI;\\n return fabs(arg);\\n}\\n\\nint ccw(Point p0,Point p1,Point p2){\\n Point a = p1-p0;\\n Point b = p2-p0;\\n if(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\\n if(cross(a,b) < -EPS)return CLOCKWISE;\\n if(dot(a,b) < -EPS)return ONLINE_BACK;\\n if(norm(a) < norm(b))return ONLINE_FRONT;\\n return ON_SEGMENT;\\n}\\n\\npair<Point, Point> crosspointCC( Point C1, double r1, Point C2, double r2) {\\n complex<double> c1(C1.x,C1.y);\\n complex<double> c2(C2.x,C2.y);\\n complex<double> A = conj(c2-c1), B = (r2*r2-r1*r1-(c2-c1)*conj(c2-c1)), C = r1*r1*(c2-c1);\\n complex<double> D = B*B-4.0*A*C;\\n complex<double> z1 = (-B+sqrt(D))/(2.0*A)+c1, z2 = (-B-sqrt(D))/(2.0*A)+c1;\\n return pair<Point, Point>(Point(z1.real(),z1.imag()),Point(z2.real(),z2.imag()));\\n}\\n\\n// ??? a ?????? b ????????????????????????\\nbool insideCC(Point a,double ra,Point b,double rb){\\n double d = sqrt(norm(a-b));\\n double r1 = max(ra,rb);\\n double r2 = min(ra,rb);\\n \\n if(!equals(d,r1-r2) && d < r1-r2) return ra < rb; \\n return false;\\n}\\n\\n\\n//cross product of pq and pr\\ndouble cross3p(Point p,Point q,Point r) { return (r.x-q.x) * (p.y -q.y) - (r.y - q.y) * (p.x - q.x); }\\n \\n//returns true if point r is on the same line as the line pq\\nbool collinear(Point p,Point q,Point r) { return fabs(cross3p(p,q,r)) < EPS; }\\n \\n//returns true if point t is on the left side of line pq\\nbool ccwtest(Point p,Point q,Point r){\\n return cross3p(p,q,r) > 0; //can be modified to accept collinear points\\n}\\n \\nbool onSegment(Point p,Point q,Point r){\\n return collinear(p,q,r) && equals(sqrt(pow(p.x-r.x,2)+pow(p.y-r.y,2)) + sqrt(pow(r.x-q.x,2) + pow(r.y-q.y,2) ),sqrt(pow(p.x-q.x,2)+pow(p.y-q.y,2)) ) ;\\n}\\n\\n\\n\\nbool intersectLL(Line l, Line m) {\\n return abs(cross(l.p2-l.p1, m.p2-m.p1)) > EPS || // non-parallel\\n abs(cross(l.p2-l.p1, m.p1-l.p1)) < EPS; // same line\\n}\\nbool intersectLS(Line l, Line s) {\\n return cross(l.p2-l.p1, s.p1-l.p1)* // s[0] is left of l\\n cross(l.p2-l.p1, s.p2-l.p1) < EPS; // s[1] is right of l\\n}\\nbool intersectLP(Line l,Point p) {\\n return abs(cross(l.p2-p, l.p1-p)) < EPS;\\n}\\nbool intersectSS(Line s, Line t) {\\n return ccw(s.p1,s.p2,t.p1)*ccw(s.p1,s.p2,t.p2) <= 0 &&\\n ccw(t.p1,t.p2,s.p1)*ccw(t.p1,t.p2,s.p2) <= 0;\\n}\\nbool intersectSP(Line s, Point p) {\\n return abs(s.p1-p)+abs(s.p2-p)-abs(s.p2-s.p1) < EPS; // triangle inequality\\n}\\n\\nPoint projection(Line l,Point p) {\\n double t = dot(p-l.p1, l.p1-l.p2) / norm(l.p1-l.p2);\\n return l.p1 + (l.p1-l.p2)*t;\\n}\\nPoint reflection(Line l,Point p) {\\n return p + (projection(l, p) - p) * 2;\\n}\\ndouble distanceLP(Line l, Point p) {\\n return abs(p - projection(l, p));\\n}\\ndouble distanceLL(Line l, Line m) {\\n return intersectLL(l, m) ? 0 : distanceLP(l, m.p1);\\n}\\n\\ndouble distanceLS(Line l, Line s) {\\n if (intersectLS(l, s)) return 0;\\n return min(distanceLP(l, s.p1), distanceLP(l, s.p2));\\n}\\ndouble distanceSP(Line s, Point p) {\\n Point r = projection(s, p);\\n if (intersectSP(s, r)) return abs(r - p);\\n return min(abs(s.p1 - p), abs(s.p2 - p));\\n}\\n\\ndouble distanceSS(Line s, Line t) {\\n if (intersectSS(s, t)) return 0;\\n return min(min(distanceSP(s, t.p1), distanceSP(s, t.p2)),\\n min(distanceSP(t, s.p1), distanceSP(t, s.p2)));\\n}\\n\\nPoint crosspoint(Line l,Line m){\\n double A = cross(l.p2-l.p1,m.p2-m.p1);\\n double B = cross(l.p2-l.p1,l.p2-m.p1);\\n if(abs(A) < EPS && abs(B) < EPS){\\n vector<Point> vec;\\n vec.push_back(l.p1),vec.push_back(l.p2),vec.push_back(m.p1),vec.push_back(m.p2);\\n sort(vec.begin(),vec.end());\\n assert(vec[1] == vec[2]); //???????????°??????????????????\\n return vec[1];\\n //return m.p1;\\n }\\n if(abs(A) < EPS)assert(false);\\n return m.p1 + (m.p2-m.p1)*(B/A);\\n}\\n\\n\\n\\n\\n\\n// <---------\\n\\ninline bool LT(double a,double b) { return !equals(a,b) && a < b; }\\ninline bool LTE(double a,double b) { return equals(a,b) || a < b; }\\n\\nint n;\\nPoint ps[110];\\ndouble rs[110];\\n\\nbool insideAny(int i) {\\n REP(j,i+1,n) if( insideCC(ps[i],rs[i],ps[j],rs[j]) ) return true;\\n return false;\\n}\\n\\nbool trivialFail(int i) {\\n if( insideAny(i) ) return true;\\n REP(j,i+1,n) if( ps[i] == ps[j] && equals(rs[i],rs[j]) ) return true;\\n return false;\\n}\\n\\nPoint vir;\\nbool comp_angle(const Point &a,const Point &b) {\\n return LT(atan2(vir.y-a.y,vir.x-a.x),atan2(vir.y-b.y,vir.x-b.x));\\n}\\n\\nbool comp_dist(Point a,Point b) {\\n return LTE(abs(a-vir),abs(b-vir));\\n}\\n\\npair<Point,Point> crosspointCL(Point cp,double r,Line l) {\\n double dist = distanceLP(l,cp);\\n Vector v = (l.p1-l.p2) / abs(l.p1-l.p2);\\n if( equals(dist,0) ) {\\n return pair<Point,Point>(Point(cp+v*r),Point(cp-v*r));\\n } else {\\n double x = sqrt(r*r-dist*dist);\\n return pair<Point,Point>(Point(cp+v*x),Point(cp-v*x));\\n }\\n}\\n\\nbool visibleCheckPoint(Point p,int i) {\\n REP(j,i+1,n) {\\n double dist = abs(p-ps[j]);\\n if( LT(dist,rs[j]) ) return false;\\n }\\n return true;\\n}\\n\\nbool visibleCheckSeg(Segment seg,int i) {\\n deque<Point> deq;\\n deq.push_back(seg.p1);\\n deq.push_back(seg.p2);\\n REP(j,i+1,n) {\\n double dist = distanceLP(seg,ps[j]);\\n if( LTE(rs[j],dist) ) continue;\\n pair<Point,Point> pp = crosspointCL(ps[j],rs[j],seg);\\n if( onSegment(seg.p1,seg.p2,pp.first) ) deq.push_back(pp.first);\\n if( onSegment(seg.p1,seg.p2,pp.second) ) deq.push_back(pp.second);\\n }\\n \\n // sort\\n vir = seg.p1;\\n sort(deq.begin(),deq.end(),comp_dist);\\n \\n // check\\n rep(j,(int)deq.size()-1) {\\n Point p1 = deq[j];\\n Point p2 = deq[j+1];\\n Point mp = (p1+p2)/2.0;\\n double dist = abs(mp-ps[i]);\\n if( equals(dist,rs[i]) || dist < rs[i] ) {\\n if( visibleCheckPoint(mp,i) ) return true;\\n }\\n }\\n return false;\\n}\\n\\nbool visibleCheckArcJ(int i,int j) {\\n deque<Point> deq;\\n REP(k,i,n) {\\n if( ps[j] == ps[k] && equals(rs[j],rs[k]) ) continue;\\n {\\n double dist = abs(ps[k]-ps[j]); \\n double rdist = rs[k]+rs[j];\\n if( equals(dist,rdist) || dist > rdist ) continue;\\n }\\n pair<Point,Point> pp = crosspointCC(ps[j],rs[j],ps[k],rs[k]);\\n deq.push_back(pp.first);\\n deq.push_back(pp.second);\\n }\\n vir = ps[j];\\n sort(deq.begin(),deq.end(),comp_angle);\\n //deq.erase(unique(deq.begin(),deq.end()),deq.end());\\n rep(k,(int)deq.size()) {\\n Point p1 = deq[k] - ps[j];\\n Point p2 = deq[(k+1)%(int)deq.size()] - ps[j];\\n Point mp = ( p1 + p2 ) / 2.0;\\n mp = mp + ps[j];\\n Vector v = ( mp - ps[j] ) / abs( mp - ps[j] );\\n Segment seg = Segment(ps[j]+v*rs[j],ps[j]-v*rs[j]);\\n //cout << \\\"CHECK SEG \\\" << seg << endl;\\n if( visibleCheckSeg(seg,i) ) {\\n //cout << \\\"VISIBLE ARC \\\" << seg << endl;\\n return true;\\n }\\n }\\n return false;\\n}\\n\\nvoid compute() {\\n int cnt = 0;\\n rep(i,n) { // check the i-th circle whether the circle is visible or not\\n //cout << i << \\\"-th \\\" << ps[i] << \\\", \\\" << rs[i] << endl;\\n if( trivialFail(i) ) {\\n //cout << i << \\\" is trivialFail\\\" << endl;\\n continue;\\n }\\n bool success = false;\\n bool success2 = true;\\n REP(j,i+1,n) { \\n //cout <<\\\">> \\\" << j << \\\" \\\" << ps[j] << \\\",\\\" << rs[j] << endl;\\n {\\n\\tdouble dist = abs(ps[i]-ps[j]); \\n\\tdouble rdist = rs[i]+rs[j];\\n\\tif( equals(dist,rdist) || dist > rdist ) {\\n\\t //puts(\\\"OVER\\\");\\n\\t continue;\\n\\t}\\n }\\n if( insideCC(ps[j],rs[j],ps[i],rs[i]) ) {\\n\\t//puts(\\\"INSIDE\\\");\\n\\tcontinue;\\n }\\n success2 = false;\\n if( visibleCheckArcJ(i,j) ) { \\n\\t//puts(\\\"VISIBLE\\\");\\n\\tsuccess = true; break; \\n }\\n //puts(\\\"INVISIBLE\\\");\\n }\\n if( success || success2 ) ++cnt;\\n }\\n cout << cnt << endl;\\n}\\n\\nint main() {\\n while( cin >> n, n ) {\\n rep(i,n) cin >> ps[i].x >> ps[i].y >> rs[i];\\n compute();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 1372,\n \"score_of_the_acc\": -0.3779,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1239_1656014\",\n \"code_snippet\": \"#include<iostream>\\n#include<cfloat>\\n#include<cassert>\\n#include<cmath>\\n#include<cstdio>\\n#include<vector>\\n#include<set>\\n#include<algorithm>\\n\\nusing namespace std;\\n\\n#define EPS (1e-15)\\n#define equals(a, b) (fabs((a) - (b)) < EPS )\\n#define dle(a, b) (equals(a, b) || a < b )\\nstatic const double PI = acos(-1);\\n\\nclass Point{\\npublic:\\n double x, y;\\n\\n Point ( double x = 0, double y = 0): x(x), y(y){}\\n\\n Point operator + ( Point p ){ return Point(x + p.x, y + p.y); }\\n Point operator - ( Point p ){ return Point(x - p.x, y - p.y); }\\n Point operator * ( double a ){ return Point(x*a, y*a); }\\n Point operator / ( double a ){ return Point(x/a, y/a); }\\n Point operator / ( Point p ) { return Point((x*p.x+y*p.y)/(p.x*p.x+p.y*p.y), (y*p.x-x*p.y)/(p.x*p.x+p.y*p.y)); }\\n \\n double abs() { return sqrt(norm());}\\n double norm() { return x*x + y*y; }\\n\\n bool operator < ( const Point &p ) const {\\n return x != p.x ? x < p.x : y < p.y;\\n }\\n\\n bool operator == ( const Point &p ) const {\\n return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\\n }\\n};\\n\\ntypedef Point Vector;\\n\\n\\nclass Segment{\\npublic:\\n Point p1, p2;\\n Segment(Point s = Point(), Point t = Point()): p1(s), p2(t){}\\n\\n};\\n\\ntypedef Segment Line;\\n\\nstatic const int CIRCLE_NON = 0;\\nstatic const int CIRCLE_OUT = 1;\\nstatic const int CIRCLE_IN = 2;\\nstatic const int CIRCLE_CROSS = 3;\\n\\nclass Circle{\\npublic:\\n Point c;\\n double r;\\n Circle(Point c = Point(), double r = 0.0): c(c), r(r){}\\n};\\n\\ndouble norm( Vector a ){ return a.x*a.x + a.y*a.y; }\\ndouble abs( Vector a ){ return sqrt(norm(a)); }\\nPoint polar( double a, double r ){ return Point(cos(r)*a, sin(r)*a);}\\ndouble getDistance( Vector a, Vector b ){ return abs(a - b); }\\ndouble dot( Vector a, Vector b ){ return a.x*b.x + a.y*b.y; }\\ndouble cross( Vector a, Vector b ){ return a.x*b.y - a.y*b.x; }\\n\\nPoint project( Segment s, Point p ){\\n Vector base = s.p2 - s.p1;\\n double t = dot(p - s.p1, base)/norm(base);\\n return s.p1 + base*t;\\n}\\n\\ndouble getAngle(Point p){\\n double polar = atan2(p.y, p.x);\\n return (dle(0, polar))? polar : 2.0*acos(-1)+polar;\\n}\\n\\nint isIntersect(Circle c1, Circle c2){\\n double d = abs(c1.c - c2.c);\\n if ( c1.r + c2.r < d ) return CIRCLE_NON; // no overlap\\n if ( d + c2.r < c1.r ) return CIRCLE_IN; // c1 includes c2\\n if ( d + c1.r < c2.r ) return CIRCLE_OUT; // c2 includes c1\\n return CIRCLE_CROSS;\\n}\\n\\ndouble getDistanceLP(Line s, Point p){\\n return abs(cross(s.p2 - s.p1, p - s.p1)/abs(s.p2 - s.p1));\\n}\\n\\ndouble arg(Vector p){\\n return atan2(p.y, p.x);\\n}\\n\\npair<Point, Point> getCrossPoints(Circle c1, Circle c2){\\n assert( isIntersect( c1, c2 ) );\\n double d = abs(c1.c - c2.c);\\n double a = acos((c1.r*c1.r+d*d-c2.r*c2.r)/(2*c1.r*d));\\n double t = arg(c2.c - c1.c);\\n return make_pair(c1.c+polar(c1.r, t+a), c1.c+polar(c1.r, t-a));\\n}\\n\\nbool isIntersect( Circle c1, Line l ){\\n double d = getDistanceLP(l, c1.c);\\n return ( equals(d, c1.r) || d < c1.r );\\n}\\n\\npair<Point, Point> getCrossPoints(Circle c, Line l ){\\n assert( isIntersect( c, l ) );\\n Vector pr = project(l, c.c);\\n Vector e = (l.p2 - l.p1)/abs(l.p2 - l.p1);\\n double base = sqrt(c.r*c.r - norm(pr-c.c));\\n return make_pair(pr + e*base, pr - e*base);\\n}\\n\\nCircle C[100];\\nint n;\\n\\nvoid compute(){\\n vector<Point> candidates;\\n vector<double> Y; \\n\\n Y.push_back(-100.0);\\n Y.push_back(100.0);\\n\\n for ( int i = 0; i < n; i++ ){\\n Y.push_back(C[i].c.y - C[i].r);\\n Y.push_back(C[i].c.y + C[i].r);\\n }\\n \\n for ( int i = 0; i < n-1; i++ ){\\n for ( int j = i+1; j < n; j++ ){\\n if ( isIntersect(C[i], C[j]) != CIRCLE_CROSS ) continue;\\n pair<Point, Point> pp = getCrossPoints(C[i], C[j]);\\n Y.push_back(pp.first.y);\\n Y.push_back(pp.second.y);\\n }\\n }\\n\\n sort(Y.begin(), Y.end());\\n\\n for ( int k = 0; k < Y.size()-1; k++ ){\\n double my = (Y[k+1] + Y[k])/2;\\n Line l = Line(Point(-100, my), Point(100, my));\\n vector<double> X;\\n X.push_back(-100);\\n X.push_back(100);\\n for ( int i = 0; i < n; i++ ){\\n if ( !isIntersect(C[i], l) ) continue;\\n pair<Point, Point> pp = getCrossPoints(C[i], l);\\n X.push_back(pp.first.x);\\n X.push_back(pp.second.x);\\n }\\n sort(X.begin(), X.end());\\n\\n for ( int i = 0; i < X.size()-1; i++ ){\\n candidates.push_back(Point((X[i+1]+X[i])/2, my));\\n }\\n }\\n\\n int ans = 0;\\n for ( int i = 0; i < n; i++ ){\\n for ( int c = 0; c < candidates.size(); c++ ){\\n Point t = candidates[c];\\n bool f = true;\\n if ( abs(C[i].c - t) > C[i].r ) {\\n\\tcontinue;\\n }\\n for ( int j = i+1; j < n; j++ ){\\n\\tif ( dle(abs(C[j].c - t), C[j].r) ) {\\n\\t f = false;\\n\\t break;\\n\\t}\\n }\\n if ( f ) {\\n\\tans++;\\n\\tbreak;\\n }\\n }\\n }\\n\\n printf(\\\"%d\\\\n\\\", ans);\\n}\\n\\nint main(){\\n double x, y, r;\\n while(1){\\n cin >> n;\\n if ( n == 0 ) break;\\n for ( int i = 0; i < n; i++ ){\\n cin >> x >> y >> r; C[i] = Circle( Point(x, y), r);\\n }\\n compute();\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 3360,\n \"score_of_the_acc\": -1.478,\n \"final_rank\": 4\n }\n]","isConversational":false}}},{"rowIdx":694,"cells":{"group_id":{"kind":"string","value":"aoj_1234_cpp"},"problem_description":{"kind":"string","value":"Problem C:\nGIGA Universe Cup\nFollowing FIFA World Cup, a larger competition called ``GIGA Universe Cup'' is taking place somewhere in our universe. Both FIFA World Cup and GIGA Universe Cup are two rounds competitions that consist of the first round, also known as ``group league,'' and the second called ``final tournament.'' In the first round, participating teams are divided into groups of four teams each. Each team in a group plays a match against each of the other teams in the same group. For example, let's say we have a group of the following four teams, ``Engband, Swedon, Argontina, and Nigerua.'' They play the following six matches: Engband - Swedon, Engband - Argontina, Engband - Nigerua, Swedon - Argontina, Swedon - Nigerua, and Argontina - Nigerua.\nThe result of a single match is shown by the number of goals scored by each team, like ``Engband 1 - 0 Argontina,'' which says Engband scored one goal whereas Argontina zero. Based on the result of a match, points are given to the two teams as follows and used to rank teams. If a team wins a match (i.e., scores more goals than the other), three points are given to it and zero to the other. If a match draws (i.e., the two teams score the same number of goals), one point is given to each.\nThe\ngoal difference\nof a team in given matches is the total number of goals it scored minus the total number of goals its opponents scored in these matches. For example, if we have three matches ``Swedon 1 - 2 Engband,'' ``Swedon 3 - 4 Nigerua,'' and ``Swedon 5 - 6 Argontina,'' then the goal difference of Swedon in these three matches is (1 + 3 + 5) - (2 + 4+ 6) = -3.\nGiven the results of all the six matches in a group, teams are ranked by the following criteria, listed in the order of priority (that is, we first apply (a) to determine the ranking, with ties broken by (b), with ties broken by (c), and so on).\n(a) greater number of points in all the group matches;\n(b) greater goal difference in all the group matches;\n(c) greater number of goals scored in all the group matches.\nIf two or more teams are equal on the basis of the above three criteria, their place shall be determined by the following criteria, applied in this order:\n(d) greater number of points obtained in the group matches between the teams concerned;\n(e) greater goal difference resulting from the group matches between the teams concerned;\n(f) greater number of goals scored in the group matches between the teams concerned;\nIf two or more teams are stiIl equal, apply (d), (e), and (f) as necessary to each such group. Repeat this until those three rules to equal teams do not make any further resolution. Finally, teams that still remain equal are ordered by:\n(g) drawing lots by the Organizing Committee for the GIGA Universe Cup.\nThe two teams coming first and second in each group qualify for the second round.\nYour job is to write a program which, given the results of matches played so far in a group and one team specified in the group, calculates the \n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1234_4943973","code_snippet":"#include <stdio.h>\n#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for (int i = 0; i < (n); ++i)\n#define Inf 1000000000\n\nvector<double> p(9);\n\nvector<vector<string>> get(vector<pair<pair<string,string>,pair<int,int>>> S){\n\n\tmap<string,vector<int>> mp;\n\tvector<int> base(3,0);\n\trep(i,S.size()){\n\t\tmp[S[i].first.first]=base;\n\t\tmp[S[i].first.second]=base;\n\t}\n\t\n\trep(i,S.size()){\n\t\tstring TeamA = S[i].first.first;\n\t\tstring TeamB = S[i].first.second;\n\t\tint A = S[i].second.first;\n\t\tint B = S[i].second.second;\n\t\t\n\t\tif(A==B){\n\t\t\tmp[TeamA][0]++;\n\t\t\tmp[TeamB][0]++;\n\t\t}\n\t\telse if(A>B){\n\t\t\tmp[TeamA][0]+=3;\n\t\t}\n\t\telse{\n\t\t\tmp[TeamB][0]+=3;\n\t\t}\n\t\t\n\t\tmp[TeamA][1]+=A-B;\n\t\tmp[TeamB][1]+=B-A;\n\t\t\n\t\tmp[TeamA][2]+=A;\n\t\tmp[TeamB][2]+=B;\n\t}\n\t\n\tvector<pair<vector<int>,string>> V;\n\tfor(auto a:mp){\n\t\tV.emplace_back(a.second,a.first);\n\t}\n\t\n\tsort(V.rbegin(),V.rend());\n\t\n\tvector<vector<string>> ret;\n\trep(i,V.size()){\n\t\tif(i==0 || V[i-1].first!=V[i].first){\n\t\t\tret.push_back(vector<string>(1,V[i].second));\n\t\t}\n\t\telse ret.back().push_back(V[i].second);\n\t}\n\t\n\tif(ret.size()==1)return ret;\n\tvector<vector<string>> temp;\n\trep(i,ret.size()){\n\t\tif(ret[i].size()==1){\n\t\t\ttemp.push_back(ret[i]);\n\t\t\tcontinue;\n\t\t}\n\t\tsort(ret[i].begin(),ret[i].end());\n\t\tvector<pair<pair<string,string>,pair<int,int>>> nS;\n\t\trep(j,S.size()){\n\t\t\tstring x = S[j].first.first,y = S[j].first.second;\n\t\t\tif(binary_search(ret[i].begin(),ret[i].end(),x)&&binary_search(ret[i].begin(),ret[i].end(),y)){\n\t\t\t\tnS.push_back(S[j]);\n\t\t\t}\n\t\t}\n\t\tvector<vector<string>> X = get(nS);\n\t\trep(j,X.size()){\n\t\t\ttemp.push_back(X[j]);\n\t\t}\n\t}\n\t\n\treturn temp;\n\t\n}\n\ndouble get(vector<string> S){\n\tvector<string> names(4);\n\tstring target;\n\trep(i,4){\n\t\tnames[i] = S[i+1].substr(1,3);\n\t\tif(S[i+1][0]=='*'){\n\t\t\ttarget = names[i];\n\t\t}\n\t}\n\n\tvector<pair<pair<string,string>,pair<int,int>>> matches;\n\tvector<int> emp;\n\trep(i,4){\n\t\trep(j,4){\n\t\t\tif(i>=j)continue;\n\t\t\tchar c0 = S[i+1][6+j*5],c1 = S[i+1][6+j*5+2];\n\t\t\tif(c0=='_'){\n\t\t\t\temp.push_back(matches.size());\n\t\t\t\tmatches.emplace_back(make_pair(names[i],names[j]),make_pair(-1,-1));\n\t\t\t}\n\t\t\telse matches.emplace_back(make_pair(names[i],names[j]),make_pair(c0-'0',c1-'0'));\n\t\t}\n\t}\n\n\tdouble ret = 0.0;\n\trep(i,9){\n\t\trep(j,9){\n\t\t\trep(k,9){\n\t\t\t\trep(l,9){\n\t\t\t\t\t\n\t\t\t\t\tmatches[emp[0]].second.first = i;\n\t\t\t\t\tmatches[emp[0]].second.second = j;\n\t\t\t\t\tmatches[emp[1]].second.first = k;\n\t\t\t\t\tmatches[emp[1]].second.second = l;\n\t\t\t\t\tdouble P = p[i]*p[j]*p[k]*p[l];\n\t\t\t\t\tvector<string> temp;\n\t\t\t\t\tvector<vector<string>> result = get(matches);\n\t\t\t\t\tif(result[0].size()==1){\n\t\t\t\t\t\tif(result[0][0]==target){\n\t\t\t\t\t\t\tret += P;\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse{\n\t\t\t\t\t\t\ttemp = result[1];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse temp = result[0];\n\t\t\t\t\t\n\t\t\t\t\tbool f = false;\n\t\t\t\t\trep(x,temp.size()){\n\t\t\t\t\t\tif(temp[x]==target){\n\t\t\t\t\t\t\tf=true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif(f){\n\t\t\t\t\t\tif(result[0].size()==1)ret += P / (double)temp.size();\n\t\t\t\t\t\telse{\n\t\t\t\t\t\t\tdouble s = temp.size();\n\t\t\t\t\t\t\tret += P * (1.0-(s-1.0) * (s-2.0) / s / (s-1.0));\n\t\t\t\t\t\t}\n\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\treturn ret;\n\t\n}\n\nint main(){\n\t\n\trep(i,9){\n\t\tp[i] = pow(0.25,i);\n\t\tp[i] *= pow(0.75,8-i);\n\t\trep(j,8){\n\t\t\tp[i] *= j+1;\n\t\t}\n\t\trep(j,i){\n\t\t\tp[i] /= j+1;\n\t\t}\n\t\trep(j,8-i){\n\t\t\tp[i] /= j+1;\n\t\t}\n\t}\n\t\n\tint t;\n\tcin>>t;\n\t\n\trep(_,t){\n\t\tvector<string> S(5);\n\t\trep(i,5)cin>>S[i];\n\t\t\n\t\tcout<<fixed<<setprecision(10)<<get(S)<<endl;\n\t}\n\t\n return 0;\n}","accuracy":1,"time_ms":1040,"memory_kb":3800,"score_of_the_acc":-1.1914,"final_rank":19},{"submission_id":"aoj_1234_4868319","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint M[4][4];\ndouble score[9];\ndouble p;\n\nint check(int n,vector<int> a,int id){\n\tint m=a.size();\n\tvector<int> P(m),GD(m),GS(m);\n\tfor(int i=0;i<m;i++){\n\t\tfor(int j=i+1;j<m;j++){\n\t\t\tint k=a[i],l=a[j];\n\t\t\tif(M[k][l]>M[l][k])P[i]+=3;\n\t\t\telse if(M[k][l]==M[l][k])P[i]++,P[j]++;\n\t\t\telse P[j]+=3;\n\t\t\tGD[i]+=M[k][l]-M[l][k],GD[j]+=M[l][k]-M[k][l];\n\t\t\tGS[i]+=M[k][l],GS[j]+=M[l][k];\n\t\t}\n\t}\n\tvector<pair<pair<int,int>,pair<int,int>>> v;\n\tfor(int i=0;i<m;i++){\n\t\tv.push_back(make_pair(make_pair(P[i],GD[i]),make_pair(GS[i],a[i])));\n\t}\n\tsort(v.rbegin(), v.rend());\n\tint cnt=0; bool flag=false;\n\tvector<int> na;\n\tfor(int i=0;i<m;i++){\n\t\tif(v[i].first.first==v[0].first.first and v[i].first.second==v[0].first.second and v[i].second.first==v[0].second.first){\n\t\t\tcnt++; na.push_back(v[i].second.second);\n\t\t\tif(v[i].second.second==id)flag=true;\n\t\t}\n\t}\n\tif(cnt<=n and flag)return 1;\n\tif(cnt>=n and !flag)return 0;\n\tif(cnt==1 and n==2 and !flag){\n\t\tna.pop_back();\n\t\tfor(int i=1;i<m;i++){\n\t\t\tif(v[i].first.first==v[1].first.first and v[i].first.second==v[1].first.second and v[i].second.first==v[1].second.first){\n\t\t\t\tna.push_back(v[i].second.second);\n\t\t\t\tif(v[i].second.second==id)flag=true;\n\t\t\t}\n\t\t}\n\t\tif(!flag)return 0;\n\t\telse if(na.size()==1)return 1;\n\t\telse return check(1,na,id);\n\t}\n\telse{\n\t\tif(m==(int)na.size()){\n\t\t\tp*=(double)n;\n\t\t\treturn (int)na.size();\n\t\t}\n\t\telse return check(n,na,id);\n\t}\n}\n\nvoid solve(){\n\tstring T; cin >> T;\n\tint id=-1;\n\tfor(int i=0,j=0;i<4&&j<T.size();){\n\t\tif(T[j]=='_')j++;\n\t\telse if(T[j]=='*')id=i,j++;\n\t\telse i++,j+=3;\n\t}\n\tvector<string> s(4);\n\tfor(int i=0;i<4;i++) cin >> s[i];\n\tvector<int> r;\n\tfor(int i=0;i<4;i++){\n\t\tfor(int j=i+1;j<4;j++){\n\t\t\tif(s[i][j*5+6]=='_'){\n\t\t\t\tr.push_back(i);r.push_back(j);\n\t\t\t}\n\t\t\telse{\n\t\t\t\tint s1=s[i][j*5+6]-'0', s2=s[i][j*5+8]-'0';\n\t\t\t\tM[i][j]=s1, M[j][i]=s2;\n\t\t\t}\n\t\t}\n\t}\n\tdouble res=0.0;\n\tfor(int i=0;i<=8;i++){\n\t\tfor(int j=0;j<=8;j++){\n\t\t\tfor(int k=0;k<=8;k++){\n\t\t\t\tfor(int l=0;l<=8;l++){\n\t\t\t\t\tp=score[i]*score[j]*score[k]*score[l];\n\t\t\t\t\tM[r[0]][r[1]]=i,M[r[1]][r[0]]=j,M[r[2]][r[3]]=k,M[r[3]][r[2]]=l;\n\t\t\t\t\tvector<int> a={0,1,2,3};\n\t\t\t\t\tint t=check(2,a,id);\n\t\t\t\t\tif(t){\n\t\t\t\t\t\tp/=(double)t;\n\t\t\t\t\t\tres+=p;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"%.7f\\n\",res);\n}\n\nint main(){\n\t// 前計算\n\tconst int base=1*2*3*4*5*6*7*8;\n\tfor(int i=0;i<=8;i++){\n\t\tdouble res=base;\n\t\tfor(int j=1;j<=i;j++){\n\t\t\tres/=(double)j;\n\t\t\tres*=(0.25);\n\t\t}\n\t\tfor(int j=1;j<=8-i;j++){\n\t\t\tres/=(double)j;\n\t\t\tres*=(0.75);\n\t\t}\n\t\tscore[i]=res;\n\t}\n\tint q; cin >> q;\n\twhile(q--)solve();\n}","accuracy":1,"time_ms":250,"memory_kb":3136,"score_of_the_acc":-0.072,"final_rank":2},{"submission_id":"aoj_1234_4811441","code_snippet":"#include <iostream>\n#include <string>\n#include <sstream>\n#include <stack>\n#include <algorithm>\n#include <cmath>\n#include <queue>\n#include <bitset>\n#include <iomanip>\n#include <limits>\n#include <chrono>\n#include <random>\n#include <array>\n#include <unordered_map>\n#include <functional>\n#include <complex>\n#include <numeric>\n#include <cctype>\n#include <map>\n#include <set>\n#include <cstdlib>\n#include <bitset>\n#include <tuple>\n#include <assert.h>\n#include <deque>\n#include <utility>\n\n\nusing namespace std;\ntypedef long long ll;\n\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\ntemplate<typename T> T gcd(T a, T b) { a = abs(a), b = abs(b); while (b > 0) { tie(a, b) = make_pair(b, a % b); } return a; }\n//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());\n\nconstexpr long long INF = 1LL << 60;\nconstexpr int inf = 1000000007;\nconstexpr long long mod = 1000000007LL;\n//constexpr long long mod = 998244353LL;\n\nusing Real = double;\nvector<int> hidx = { 1,1,1,2,2,3 };\nvector<int> widx = { 11,16,21,16,21,21 };\nvector<Real> p(10);\nint tidx[50][50];\n\nstruct Data {\n\tint score, diff, goal, id;\n\tData() = default;\n\tData(int score, int diff, int goal, int id) :score(score), diff(diff), goal(goal), id(id) {}\n\tbool operator<(const Data& d)const {\n\t\treturn make_tuple(score, diff, goal) < make_tuple(d.score, d.diff, d.goal);\n\t}\n\tbool operator>(const Data& d)const {\n\t\treturn make_tuple(score, diff, goal) > make_tuple(d.score, d.diff, d.goal);\n\t}\n\tbool operator==(const Data& d)const {\n\t\treturn make_tuple(score, diff, goal) == make_tuple(d.score, d.diff, d.goal);\n\t}\n};\n\nvoid calc_data(Data& a, Data& b, int af, int bf) {\n\ta.diff += af - bf;\n\tb.diff += bf - af;\n\ta.goal += af;\n\tb.goal += bf;\n\tif (af == bf) {\n\t\ta.score += 1;\n\t\tb.score += 1;\n\t}\n\telse if (af > bf) {\n\t\ta.score += 3;\n\t}\n\telse {\n\t\tb.score += 3;\n\t}\n}\nReal calc(array<string, 5>& vs, int my) {\n\tvector<bool> bad(4); int cnt = 0;\n\tbool tw = false;\n\t{\n\t\tvector<Data> d(4); for (int i = 0; i < 4; i++) d[i].id = i;\n\t\tfor (int i = 0; i < 6; i++) {\n\t\t\tint f = vs[hidx[i]][widx[i]] - '0';\n\t\t\tint s = vs[hidx[i]][widx[i] + 2] - '0';\n\t\t\tint fi = tidx[hidx[i]][widx[i]];\n\t\t\tint si = tidx[hidx[i]][widx[i] + 2];\n\t\t\tcalc_data(d[fi], d[si], f, s);\n\t\t}\n\t\tsort(d.rbegin(), d.rend());\n\n\t\tif (d[0] == d.back()) return 0.5;\n\t\telse if (d[0] == d[2]) {\n\t\t\tif (d[3].id == my) return 0.0;\n\t\t\tcnt = 2;\n\t\t\tbad[d[3].id] = true;\n\t\t}\n\t\telse if (d[0] == d[1]) {\n\t\t\tif (d[0].id == my or d[1].id == my) return 1.0;\n\t\t\telse return 0.0;\n\t\t}\n\t\telse {\n\t\t\tif (d[0].id == my) return 1.0;\n\t\t\tif (d[1] > d[2]) {\n\t\t\t\tif (d[1].id == my) return 1.0;\n\t\t\t\telse return 0.0;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (d[2] > d[3]) {\n\t\t\t\t\tif (d[3].id == my) return 0.0;\n\t\t\t\t\tcnt = 1;\n\t\t\t\t\tbad[d[0].id] = true;\n\t\t\t\t\tbad[d[3].id] = true;\n\t\t\t\t\ttw = true;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tcnt = 1;\n\t\t\t\t\tbad[d[0].id] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tif (!tw) {\n\t\tvector<Data> d(4);\n\t\tfor (int i = 0; i < 4; i++) {\n\t\t\td[i].id = i;\n\t\t\tif (bad[i]) d[i].score -= 100000;\n\t\t}\n\t\tfor (int i = 0; i < 6; i++) {\n\t\t\tint f = vs[hidx[i]][widx[i]] - '0';\n\t\t\tint s = vs[hidx[i]][widx[i] + 2] - '0';\n\t\t\tint fi = tidx[hidx[i]][widx[i]];\n\t\t\tint si = tidx[hidx[i]][widx[i] + 2];\n\t\t\tif (bad[fi] or bad[si]) continue;\n\t\t\tcalc_data(d[fi], d[si], f, s);\n\t\t}\n\t\tsort(d.rbegin(), d.rend());\n\t\td.pop_back();\n\t\tif (d[0] == d.back()) return (Real)cnt / 3.0;\n\t\telse if (d[0] == d[1]) {\n\t\t\tif (d[2].id == my) return 0.0;\n\t\t\telse if (cnt == 2) return 1.0;\n\t\t\telse {\n\t\t\t\ttw = true;\n\t\t\t\tbad[d[2].id] = true;\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tif (d[0].id == my) return 1.0;\n\t\t\telse if (cnt == 1) return 0.0;\n\t\t\telse {\n\t\t\t\tif (d[1] > d[2]) {\n\t\t\t\t\tif (d[1].id == my) return 1.0;\n\t\t\t\t\telse return 0.0;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tcnt = 1;\n\t\t\t\t\ttw = true;\n\t\t\t\t\tbad[d[0].id] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tvector<Data> d(4);\n\tfor (int i = 0; i < 4; i++) {\n\t\td[i].id = i;\n\t\tif (bad[i]) d[i].score -= 100000;\n\t}\n\tfor (int i = 0; i < 6; i++) {\n\t\tint f = vs[hidx[i]][widx[i]] - '0';\n\t\tint s = vs[hidx[i]][widx[i] + 2] - '0';\n\t\tint fi = tidx[hidx[i]][widx[i]];\n\t\tint si = tidx[hidx[i]][widx[i] + 2];\n\t\tif (bad[fi] or bad[si]) continue;\n\t\tcalc_data(d[fi], d[si], f, s);\n\t}\n\tsort(d.rbegin(), d.rend());\n\td.pop_back(); d.pop_back();\n\tif (d[0] == d[1]) return 1.0 / 2.0;\n\telse if (d[0].id == my) return 1.0;\n\telse return 0.0;\n}\n\n\nvoid solve() {\n\tarray<string, 5> vs; for (int i = 0; i < 5; i++) cin >> vs[i];\n\tvector<pair<int, int>> r;\n\tint my = -1;\n\tfor (int i = 1; i < 5; i++) if (vs[i][0] == '*') my = i - 1;\n\tReal res = 0.0;\n\tfor (int i = 0; i < 6; i++) {\n\t\tif (vs[hidx[i]][widx[i]] == '_') {\n\t\t\tr.emplace_back(hidx[i], widx[i]);\n\t\t\tr.emplace_back(hidx[i], widx[i] + 2);\n\t\t}\n\t}\n\tint t[4];\n\tfor (t[0] = 0; t[0] < 9; t[0]++)for (t[1] = 0; t[1] < 9; t[1]++)for (t[2] = 0; t[2] < 9; t[2]++) for (t[3] = 0; t[3] < 9; t[3]++) {\n\t\tfor (int i = 0; i < 4; i++) vs[r[i].first][r[i].second] = (char)('0' + t[i]);\n\t\tres += calc(vs, my) * p[t[0]] * p[t[1]] * p[t[2]] * p[t[3]];\n\t\tfor (int i = 0; i < 4; i++) vs[r[i].first][r[i].second] = '_';\n\t}\n\tcout << fixed << setprecision(12) << res << \"\\n\";\n}\nint main()\n{\n\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\n\tvector<Real> f(10); f[0] = f[1] = 1; for (int i = 2; i < 10; i++) f[i] = f[i - 1] * i;\n\tfor (int i = 0; i < 9; i++) {\n\t\tp[i] = f[8] / (f[i] * f[8 - i]) * pow(0.25, i) * pow(0.75, 8 - i);\n\t}\n\tfor (int i = 0; i < 6; i++) {\n\t\ttidx[hidx[i]][widx[i]] = hidx[i] - 1;\n\t\ttidx[hidx[i]][widx[i] + 2] = (widx[i] - 6) / 5;\n\t}\n\tint kkt; cin >> kkt; while (kkt--) solve();\n\treturn 0;\n}","accuracy":1,"time_ms":60,"memory_kb":3416,"score_of_the_acc":-0.4419,"final_rank":14},{"submission_id":"aoj_1234_4806732","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\nvector<long double>p(9);\n\nstruct Team {\n\tvector<int>a, b, c;\n\tint index;\n\tTeam() {\n\t\ta.resize(4);\n\t\tb.resize(4);\n\t\tc.resize(4);\n\t}\n};\n\nint Check_min(Team s, Team t, int bit = 15) {\n\tint sa, sb, sc, ta, tb, tc;\n\tsa = sb = sc = ta = tb = tc = 0;\n\tfor (int i = 0; i < 4; i++) {\n\t\tfor (int j = 0; j < 4; j++) {\n\t\t\tif ((bit >> j) & 1) {\n\t\t\t\tsa += s.a[j];\n\t\t\t\tsb += s.b[j];\n\t\t\t\tsc += s.c[j];\n\t\t\t\tta += t.a[j];\n\t\t\t\ttb += t.b[j];\n\t\t\t\ttc += t.c[j];\n\t\t\t}\n\t\t}\n\t}\n\tauto sbox = make_pair(sa, make_pair(sb, sc));\n\tauto tbox = make_pair(ta, make_pair(tb, tc));\n\tif (sbox < tbox)return 0;\n\tif (sbox == tbox)return 1;\n\treturn 2;\n}\n\nlong double Check(vector<vector<int>>plus, vector<pair<int, int>>vp, vector<int>num, int cnt) {\n\tfor (int i = 0; i < 4; i++) {\n\t\tplus[vp[i].first][vp[i].second] = num[i];\n\t}\n\tvector<Team>team(4);\n\tfor (int i = 0; i < 4; i++) {\n\t\tteam[i].index = i;\n\t\tfor (int j = i + 1; j < 4; j++) {\n\t\t\tteam[i].b[j] += plus[i][j];\n\t\t\tteam[i].b[j] -= plus[j][i];\n\t\t\tteam[j].b[i] += plus[j][i];\n\t\t\tteam[j].b[i] -= plus[i][j];\n\t\t\tteam[i].c[j] += plus[i][j];\n\t\t\tteam[j].c[i] += plus[j][i];\n\t\t\tif (plus[i][j] > plus[j][i]) {\n\t\t\t\tteam[i].a[j] = 3;\n\t\t\t}\n\t\t\telse if (plus[i][j] == plus[j][i]) {\n\t\t\t\tteam[i].a[j] = team[j].a[i] = 1;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tteam[j].a[i] = 3;\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i = 0; i < 4; i++) {\n\t\tfor (int j = 0; j < 3; j++) {\n\t\t\tauto c = Check_min(team[j], team[j + 1]);\n\t\t\tif (c == 0)swap(team[j], team[j + 1]);\n\t\t}\n\t}\n\tif (Check_min(team[0], team[3]) == 1)return 0.5;\n\tif (Check_min(team[0], team[2]) == 1) {\n\t\tif (team[3].index == cnt)return 0;\n\t\tint bit = 0;\n\t\tfor (int i = 0; i < 3; i++) {\n\t\t\tbit |= 1 << team[i].index;\n\t\t}\n\t\tfor (int i = 0; i < 3; i++) {\n\t\t\tfor (int j = 0; j < 2; j++) {\n\t\t\t\tif (Check_min(team[j], team[j + 1], bit) == 0)swap(team[j], team[j + 1]);\n\t\t\t}\n\t\t}\n\t\tif (Check_min(team[0], team[2], bit) == 1)return (long double)2 / 3;\n\t\tif (Check_min(team[0], team[1], bit) == 1) {\n\t\t\tif (team[2].index == cnt)return 0;\n\t\t\treturn 1;\n\t\t}\n\t\tif (Check_min(team[1], team[2]) == 1) {\n\t\t\tif (team[0].index == cnt)return 1;\n\t\t\tbit = 1 << team[1].index;\n\t\t\tbit |= 1 << team[2].index;\n\t\t\tif (Check_min(team[1], team[2], bit) == 0)swap(team[1], team[2]);\n\t\t\tif (Check_min(team[1], team[2], bit) == 1)return 0.5;\n\t\t\tif (team[1].index == cnt)return 1;\n\t\t\treturn 0;\n\t\t}\n\t\tif (team[2].index == cnt)return 0;\n\t\treturn 1;\n\t}\n\tif (Check_min(team[1], team[3]) == 1) {\n\t\tif (team[0].index == cnt)return 1;\n\t\tint bit = 0;\n\t\tfor (int i = 1; i < 4; i++) {\n\t\t\tbit |= 1 << team[i].index;\n\t\t}\n\t\tfor (int i = 0; i < 3; i++) {\n\t\t\tfor (int j = 1; j < 3; j++) {\n\t\t\t\tif (Check_min(team[j], team[j + 1], bit) == 0)swap(team[j], team[j + 1]);\n\t\t\t}\n\t\t}\n\t\tif (Check_min(team[1], team[3], bit) == 1)return (long double)1 / 3;\n\t\tif (Check_min(team[2], team[3], bit) == 1) {\n\t\t\tif (team[1].index == cnt)return 1;\n\t\t\treturn 0;\n\t\t}\n\t\tif (Check_min(team[1], team[2]) == 1) {\n\t\t\tif (team[3].index == cnt)return 0;\n\t\t\tbit = 1 << team[1].index;\n\t\t\tbit |= 1 << team[2].index;\n\t\t\tif (Check_min(team[1], team[2], bit) == 0)swap(team[1], team[2]);\n\t\t\tif (Check_min(team[1], team[2], bit) == 1)return 0.5;\n\t\t\tif (team[1].index == cnt)return 1;\n\t\t\treturn 0;\n\t\t}\n\t\tif (team[1].index == cnt)return 1;\n\t\treturn 0;\n\t}\n\tif (Check_min(team[1], team[2]) == 1) {\n\t\tif (team[0].index == cnt)return 1;\n\t\tif (team[3].index == cnt)return 0;\n\t\tint bit = 1 << team[1].index;\n\t\tbit |= 1 << team[2].index;\n\t\tif (Check_min(team[1], team[2], bit) == 1)return 0.5;\n\t\tif (Check_min(team[1], team[2], bit) == 0)swap(team[1], team[2]);\n\t\tif (team[1].index == cnt)return 1;\n\t\treturn 0;\n\t}\n\tif (team[0].index == cnt || team[1].index == cnt)return 1;\n\treturn 0;\n}\n\nlong double Solve() {\n\tvector<string>s(5);\n\tfor (auto &i : s)cin >> i;\n\tint cnt = -1;\n\tfor (int i = 1; i < s.size(); i++) {\n\t\tif (s[i][0] == '*')cnt = i - 1;\n\t}\n\tvector<vector<int>>plus(4, vector<int>(4));\n\tvector<pair<int, int>>vp;\n\tfor (int i = 0; i < 4; i++) {\n\t\tfor (int j = i + 1; j < 4; j++) {\n\t\t\tif (s[i + 1][j * 5 + 6] == '_') {\n\t\t\t\tvp.push_back({ i,j });\n\t\t\t\tvp.push_back({ j,i });\n\t\t//\t\tcout << i << \" \" << j << endl;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tplus[i][j] = s[i + 1][j * 5 + 6] - '0';\n\t\t\t\tplus[j][i] = s[i + 1][j * 5 + 8] - '0';\n\t\t\t}\n\t\t}\n\t}\n\tvector<int>num(4);\n\tlong double ret = 0;\n\twhile (num[0] < 9) {\n\t\tauto by = Check(plus, vp, num, cnt);\n\t\tret += p[num[0]] * p[num[1]] * p[num[2]] * p[num[3]] * by;\n\t\tnum.back()++;\n\t\tint c = 3;\n\t\twhile (c&&num[c] > 8) {\n\t\t\tnum[c--] = 0;\n\t\t\tnum[c]++;\n\t\t}\n\t}\n\treturn ret;\n}\n\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\n\tfor (int i = 0; i <= 8; i++) {\n\t\tp[i] = 1;\n\t\tfor (int j = 2; j <= 8; j++)p[i] *= j;\n\t\tfor (int j = 1; j <= i; j++) {\n\t\t\tp[i] /= j;\n\t\t}\n\t\tfor (int j = 1; j <= 8 - i; j++) {\n\t\t\tp[i] /= j;\n\t\t\tp[i] *= 3;\n\t\t}\n\t\tfor (int j = 1; j <= 8; j++)p[i] /= 4;\n\t}\n\tcin >> T;\n\twhile (T--) {\n\t\tauto box = Solve();\n\t\tcout << setprecision(20) << box << endl;\n\t}\n}","accuracy":1,"time_ms":2120,"memory_kb":3308,"score_of_the_acc":-0.6872,"final_rank":18},{"submission_id":"aoj_1234_4765387","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n cout << fixed << setprecision(7);\n vector<int> fact(9);\n fact[0] = 1;\n for (int i = 1; i < 9; i++){\n fact[i]= fact[i - 1] * i;\n }\n vector<double> p(9);\n for (int i = 0; i < 9; i++){\n p[i] = (double) fact[8] / fact[i] / fact[8 - i] * pow(0.25, i) * pow(0.75, 8 - i);\n }\n int t;\n cin >> t;\n for (int i = 0; i < t; i++){\n vector<string> S(5);\n for (int j = 0; j < 5; j++){\n cin >> S[j];\n }\n vector<vector<int>> score(4, vector<int>(4, -1));\n for (int j = 0; j < 4; j++){\n for (int k = j + 1; k < 4; k++){\n char c1 = S[j + 1][k * 5 + 6];\n if (c1 != '_'){\n score[j][k] = c1 - '0';\n }\n char c2 = S[j + 1][k * 5 + 8];\n if (c2 != '_'){\n score[k][j] = c2 - '0';\n }\n }\n }\n vector<pair<int, int>> s;\n for (int j = 0; j < 4; j++){\n for (int k = 0; k < 4; k++){\n if (j != k){\n if (score[j][k] == -1){\n s.push_back(make_pair(j, k));\n }\n }\n }\n }\n int team;\n for (int j = 0; j < 4; j++){\n if (S[j + 1][0] == '*'){\n team = j;\n }\n }\n double ans = 0;\n vector<int> r(4);\n for (r[0] = 0; r[0] <= 8; r[0]++){\n for (r[1] = 0; r[1] <= 8; r[1]++){\n for (r[2] = 0; r[2] <= 8; r[2]++){\n for (r[3] = 0; r[3] <= 8; r[3]++){\n double tmp = 1;\n for (int j = 0; j < 4; j++){\n tmp *= p[r[j]];\n }\n vector<vector<int>> result = score;\n for (int j = 0; j < 4; j++){\n result[s[j].first][s[j].second] = r[j];\n }\n vector<set<int>> rank(1);\n for (int j = 0; j < 4; j++){\n rank[0].insert(j);\n }\n while (1){\n bool update = false;\n vector<set<int>> rank2;\n vector<int> points(4, 0);\n vector<int> gdiff(4, 0);\n vector<int> goals(4, 0);\n int cnt = rank.size();\n for (int j = 0; j < cnt; j++){\n int sz = rank[j].size();\n for (int k = 0; k < 4; k++){\n for (int l = k + 1; l < 4; l++){\n if (rank[j].count(k) && rank[j].count(l)){\n if (result[k][l] > result[l][k]){\n points[k] += 3;\n } else if (result[k][l] < result[l][k]){\n points[l] += 3;\n } else {\n points[k]++;\n points[l]++;\n }\n gdiff[k] += result[k][l] - result[l][k];\n gdiff[l] += result[l][k] - result[k][l];\n goals[k] += result[k][l];\n goals[l] += result[l][k];\n }\n }\n }\n map<tuple<int, int, int>, set<int>> mp;\n for (int k : rank[j]){\n mp[make_tuple(points[k], gdiff[k], goals[k])].insert(k);\n }\n if (mp.size() > 1){\n update = true;\n }\n for (auto itr = mp.rbegin(); itr != mp.rend(); itr++){\n rank2.push_back((*itr).second);\n }\n }\n if (!update){\n break;\n } else {\n swap(rank, rank2);\n }\n }\n if (rank[0].count(team)){\n if (rank[0].size() <= 2){\n ans += tmp;\n } else {\n ans += tmp * 2 / rank[0].size();\n }\n } else if (rank[0].size() == 1 && rank[1].count(team)){\n ans += tmp / rank[1].size();\n }\n }\n }\n }\n }\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":1230,"memory_kb":3412,"score_of_the_acc":-0.6646,"final_rank":17},{"submission_id":"aoj_1234_4745741","code_snippet":"#include <bits/stdc++.h>\n#define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i))\n#define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i))\n#define rep(i, n) For((i), 0, (n))\n#define rrep(i, n) rFor((i), (n), 0)\n#define fi first\n#define se second\nusing namespace std;\ntypedef long long lint;\ntypedef unsigned long long ulint;\ntypedef pair<int, int> pii;\ntypedef pair<lint, lint> pll;\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(a>b){a=b; return true;} return false;}\ntemplate<class T> T div_floor(T a, T b){\n if(b < 0) a *= -1, b *= -1;\n return a>=0 ? a/b : (a+1)/b-1;\n}\ntemplate<class T> T div_ceil(T a, T b){\n if(b < 0) a *= -1, b *= -1;\n return a>0 ? (a-1)/b+1 : a/b;\n}\n\nconstexpr lint mod = 1000000007;\nconstexpr lint INF = mod * mod;\nconstexpr int MAX = 100010;\n\nint myteam;\npii board[4][4];\ndouble fact[10], prob[10];\ndouble ans;\n\nvector<int> order(int S){\n vector<int> point(4, 0), diff(4, 0), score(4, 0);\n vector<int> id;\n rep(i, 4)if(S>>i & 1) id.push_back(i);\n rep(x, 4)if(S>>x & 1){\n For(y, x+1, 4)if(S>>y & 1){\n int s, t;\n tie(s, t) = board[x][y];\n score[x] += s; score[y] += t;\n diff[x] += s - t; diff[y] += t - s;\n\n if(s > t) point[x] += 3;\n else if(s < t) point[y] += 3;\n else point[x] += 1, point[y] += 1;\n }\n }\n auto cmp = [&](const int &i, const int &j){\n if(point[i] != point[j]) return point[i] > point[j];\n if(diff[i] != diff[j]) return diff[i] > diff[j];\n return score[i] > score[j];\n };\n sort(id.begin(), id.end(), cmp);\n\n vector<int> pri(4, -1);\n int cur = 0;\n for(int l=0; l<(int)id.size();){\n int r = l;\n int T = 0;\n while(r < (int)id.size() && !cmp(id[l], id[r])){\n T |= (1 << id[r]);\n ++r;\n }\n if(r - l == 1 || S == T){\n For(i, l, r) pri[id[i]] = cur;\n ++cur;\n }\n else{\n auto p = order(T);\n int ncur = cur + 1;\n For(i, l, r) pri[id[i]] = cur + p[id[i]], chmax(ncur, pri[id[i]] + 1);\n cur = ncur;\n }\n l = r;\n }\n\n return pri;\n}\n\nvoid dfs(int cur, double p){\n if(cur == 2){\n auto pri = order((1<<4)-1);\n int mypos, cnt[4];\n rep(i, 4) cnt[i] = 0;\n rep(i, 4){\n if(i == myteam) mypos = pri[i];\n ++cnt[pri[i]];\n }\n\n if(mypos == 0) p *= min(1.0, 2.0 / (double)cnt[0]);\n else if(mypos == 1 && (int)cnt[0] < 2){\n p *= 1.0 / (double)cnt[1];\n }\n else p = 0;\n\n ans += p;\n return;\n }\n\n rep(x, 4)For(y, x+1, 4)if(board[x][y].fi < 0){\n rep(s, 9)rep(t, 9){\n board[x][y] = {s, t};\n dfs(cur + 1, p * prob[s] * prob[t]);\n }\n board[x][y] = {-1, -1};\n return;\n }\n}\n\nvoid solve(){\n char gomi, name[5];\n rep(i, 4) scanf(\" %c\", &gomi);\n rep(i, 4){\n rep(j, 5) scanf(\" %c\", &name[j]);\n if(name[1] == '*') myteam = i;\n }\n\n rep(i, 4)rep(j, 4) board[i][j] = {-1, -1};\n rep(i, 4){\n char gomi, result[5];\n rep(k, 4) scanf(\" %c\", &gomi);\n rep(j, 4){\n rep(k, 5) scanf(\" %c\", &result[k]);\n if(isdigit(result[2])){\n board[i][j] = {result[2] - '0', result[4] - '0'};\n }\n }\n }\n\n ans = 0;\n dfs(0, 1.0);\n printf(\"%.10lf\\n\", ans);\n}\n\nint main(){\n fact[0] = 1;\n For(i, 1, 10) fact[i] = fact[i-1] * i;\n rep(p, 9){\n prob[p] = 40320 / fact[p] / fact[8-p] * pow(0.25, p) * pow(0.75, 8-p);\n }\n int t;\n scanf(\"%d\", &t);\n rep(tt, t){\n solve();\n }\n}","accuracy":1,"time_ms":150,"memory_kb":3412,"score_of_the_acc":-0.4536,"final_rank":15},{"submission_id":"aoj_1234_4683852","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef int64_t Int;\n#define all(x) (x).begin(), (x).end()\n \nconst double EPS = 1e-10;\nconst Int INF = 1e18;\nconst int inf = 1e9;\nconst Int mod = 1e9+7;\n\nbool print_space_enable = false;\nvoid print() { \n cout << endl; \n print_space_enable = false;\n}\n\ntemplate <class Head, class... Tail>\nvoid print(Head&& head, Tail&&... tail) {\n if (print_space_enable) cout << \" \";\n cout << fixed << setprecision(7) << head;\n print_space_enable = true;\n print(std::forward<Tail>(tail)...);\n}\n\ntemplate<typename T>\nvoid print(vector<T> v) {\n for (size_t i = 0; i < v.size(); i++) {\n if (i > 0) std::cout << \" \";\n std::cout << v[i];\n }\n std::cout << std::endl;\n}\n\ndouble pro[10];\npair<Int, Int> score[5][5];\n\nvoid calc_pro() {\n double x[10];\n x[0] = x[1] = 1.0;\n for (int i = 1; i <= 8; i++) {\n x[i + 1] = x[i] * (double)(i + 1);\n }\n for (int i = 0; i <= 8; i++) {\n pro[i] = x[8] / (x[i] * x[8 - i]);\n for (int j = 0; j < i; j++) {\n pro[i] *= 1.0 / 4.0;\n }\n for (int j = 0; j < 8 - i; j++) {\n pro[i] *= 3.0 / 4.0;\n }\n }\n}\n\nvoid s(vector<vector<Int>> &v, Int x) {\n for (Int i = 0; i < (Int)v.size(); i++) {\n for (Int j = 0; j < (Int)v.size() - 1; j++) {\n if (v[j][x] < v[j + 1][x]) {\n swap(v[j], v[j + 1]);\n }\n }\n }\n}\n\ndouble f(vector<vector<Int>> v, Int check_team) {\n s(v, 2);\n s(v, 1);\n s(v, 0);\n vector<Int> rank[4];\n rank[0].push_back(v[0][3]);\n Int pre = 0;\n for (Int i = 1; i < 4; i++) {\n if (v[i - 1][0] == v[i][0] and v[i - 1][1] == v[i][1] and v[i - 1][2] == v[i][2]) {\n rank[pre].push_back(v[i][3]);\n } else {\n pre++;\n rank[pre].push_back(v[i][3]);\n }\n }\n if (rank[0].size() == 4) {\n return 1.0 / 2.0;\n }\n if (rank[0].size() == 3) {\n if (rank[1][0] == check_team) {\n return 0.0;\n } else {\n Int ex = rank[1][0];\n Int mp[4];\n for (Int i = 0; i < 4; i++) {\n mp[v[i][3]] = i;\n }\n for (Int i = 0; i < 4; i++) {\n if (i == ex) continue;\n Int a = score[ex][i].first;\n Int b = score[ex][i].second;\n if (a < b) {\n v[mp[i]][0] -= 3;\n }\n if (a == b) {\n v[mp[i]][0] -= 1;\n }\n v[mp[i]][1] -= b - a;\n v[mp[i]][2] -= b;\n }\n vector<vector<Int>> v2;\n for (Int i = 0; i < 4; i++) {\n if (v[i][3] == ex) continue;\n v2.push_back(v[i]);\n }\n s(v2, 2);\n s(v2, 1);\n s(v2, 0);\n vector<Int> rank2[3];\n rank2[0].push_back(v2[0][3]);\n Int pre = 0;\n for (Int i = 1; i < 3; i++) {\n if (v2[i - 1][0] == v2[i][0] and v2[i - 1][1] == v2[i][1] and v2[i - 1][2] == v2[i][2]) {\n rank2[pre].push_back(v2[i][3]);\n } else {\n pre++;\n rank2[pre].push_back(v2[i][3]);\n }\n }\n if (rank2[0].size() == 3) {\n return 2.0 / 3.0;\n }\n if (rank2[0].size() == 2) {\n if (rank2[1][0] == check_team) {\n return 0.0;\n } else {\n return 1.0;\n }\n }\n if (rank2[0].size() == 1) {\n if (rank2[0][0] == check_team) {\n return 1.0;\n } else {\n if (rank2[1].size() == 1) {\n if (rank2[1][0] == check_team) {\n return 1.0;\n } else {\n return 0.0;\n }\n } else {\n assert(rank2[1].size() == 2);\n Int a = score[rank2[1][0]][rank2[1][1]].first;\n Int b = score[rank2[1][0]][rank2[1][1]].second;\n if (a == b) {\n return 1.0 / 2.0;\n } else {\n if ((a > b and rank2[1][0] == check_team) or (a < b and rank2[1][1] == check_team)) {\n return 1.0;\n } else {\n return 0.0;\n }\n }\n }\n }\n }\n }\n }\n if (rank[0].size() == 2) {\n if (rank[0][0] == check_team or rank[0][1] == check_team) {\n return 1.0;\n } else {\n return 0.0;\n }\n }\n if (rank[0].size() == 1) {\n if (rank[0][0] == check_team) {\n return 1.0;\n } else {\n if (rank[1].size() == 3) {\n Int ex = rank[0][0];\n Int mp[4];\n for (Int i = 0; i < 4; i++) {\n mp[v[i][3]] = i;\n }\n for (Int i = 0; i < 4; i++) {\n if (i == ex) continue;\n Int a = score[ex][i].first;\n Int b = score[ex][i].second;\n if (a < b) {\n v[mp[i]][0] -= 3;\n }\n if (a == b) {\n v[mp[i]][0] -= 1;\n }\n v[mp[i]][1] -= b - a;\n v[mp[i]][2] -= b;\n }\n vector<vector<Int>> v2;\n for (Int i = 0; i < 4; i++) {\n if (v[i][3] == ex) continue;\n v2.push_back(v[i]);\n }\n s(v2, 2);\n s(v2, 1);\n s(v2, 0);\n vector<Int> rank2[3];\n rank2[0].push_back(v2[0][3]);\n Int pre = 0;\n for (Int i = 1; i < 3; i++) {\n if (v2[i - 1][0] == v2[i][0] and v2[i - 1][1] == v2[i][1] and v2[i - 1][2] == v2[i][2]) {\n rank2[pre].push_back(v2[i][3]);\n } else {\n pre++;\n rank2[pre].push_back(v2[i][3]);\n }\n }\n if (rank2[0].size() == 3) {\n return 1.0 / 3.0;\n }\n if (rank2[0].size() == 2) {\n if (rank2[1][0] == check_team) {\n return 0.0;\n } else {\n Int a = score[rank2[0][0]][rank2[0][1]].first;\n Int b = score[rank2[0][0]][rank2[0][1]].second;\n if (a == b) {\n return 1.0 / 2.0;\n } else {\n if ((a > b and rank2[0][0] == check_team) or (a < b and rank2[0][1] == check_team)) { \n return 1.0;\n } else {\n return 0.0;\n }\n }\n }\n }\n if (rank2[0].size() == 1) {\n if (rank2[0][0] == check_team) {\n return 1.0;\n } else {\n return 0.0;\n }\n }\n }\n if (rank[1].size() == 2) {\n if (rank[2][0] == check_team) {\n return 0.0;\n } else {\n Int a = score[rank[1][0]][rank[1][1]].first;\n Int b = score[rank[1][0]][rank[1][1]].second;\n if (a == b) {\n return 1.0 / 2.0;\n } else {\n if ((a > b and rank[1][0] == check_team) or (a < b and rank[1][1] == check_team)) { \n return 1.0;\n } else {\n return 0.0;\n }\n }\n }\n }\n if (rank[1].size() == 1) {\n if (rank[1][0] == check_team) {\n return 1.0;\n } else {\n return 0.0;\n }\n }\n }\n }\n}\n\nint main() {\n Int t;\n cin >> t;\n calc_pro();\n vector<double> r;\n while (t--) {\n vector<vector<Int>> v(4, vector<Int>(4, 0));\n for (Int i = 0; i < 4; i++) v[i][3] = i;\n Int check_team = -1;\n pair<Int, Int> b1 = {-1, -1}, b2 = {-1, -1};\n for (Int i = 0; i <= 4; i++) {\n string s;\n cin >> s;\n if (i == 0) continue;\n if (s[0] == '*') {\n check_team = i - 1;\n }\n for (Int j = (i + 1) * 5; j < (Int)s.size(); j+=5) {\n Int team_A = i - 1;\n Int team_B = j / 5 - 1;\n Int point_A = -1, point_B = -1;\n for (Int k = 0; k < 4; k++) {\n if (k == 1 and s[j + k] != '_') {\n point_A = s[j + k] - '0';\n }\n if (k == 3 and s[j + k] != '_') {\n point_B = s[j + k] - '0';\n }\n }\n score[team_A][team_B] = {point_A, point_B};\n score[team_B][team_A] = {point_B, point_A};\n if (point_A < 0) {\n if (b1.first < 0) {\n b1 = {team_A, team_B};\n } else {\n b2 = {team_A, team_B};\n }\n } else {\n if (point_A > point_B) {\n v[team_A][0] += 3;\n } else if (point_A < point_B) {\n v[team_B][0] += 3;\n } else {\n v[team_A][0] += 1;\n v[team_B][0] += 1;\n }\n v[team_A][1] += point_A - point_B;\n v[team_B][1] += point_B - point_A;\n v[team_A][2] += point_A;\n v[team_B][2] += point_B;\n }\n }\n }\n double res = 0;\n for (Int i = 0; i <= 8; i++) {\n for (Int j = 0; j <= 8; j++) {\n if (i > j) {\n v[b1.first][0] += 3;\n } else if (i < j) {\n v[b1.second][0] += 3;\n } else {\n v[b1.first][0] += 1;\n v[b1.second][0] += 1;\n }\n v[b1.first][1] += i - j;\n v[b1.second][1] += j - i;\n v[b1.first][2] += i;\n v[b1.second][2] += j;\n score[b1.first][b1.second] = {i, j};\n score[b1.second][b1.first] = {j, i};\n for (Int k = 0; k <= 8; k++) {\n for (Int l = 0; l <= 8; l++) {\n if (k > l) {\n v[b2.first][0] += 3;\n } else if (k < l) {\n v[b2.second][0] += 3;\n } else {\n v[b2.first][0] += 1;\n v[b2.second][0] += 1;\n }\n v[b2.first][1] += k - l;\n v[b2.second][1] += l - k;\n v[b2.first][2] += k;\n v[b2.second][2] += l;\n score[b2.first][b2.second] = {k, l};\n score[b2.second][b2.first] = {l, k};\n \n // double p = f(v, check_team);\n\n // if (i > j and k < l and p != 0 and p != 1) {\n // print(\"-------\");\n // for (Int i = 0; i < (Int)v.size(); i++) {\n // print(v[i]);\n // }\n // print(f(v, check_team));\n // }\n\n res += pro[i] * pro[j] * pro[k] * pro[l] * f(v, check_team);\n\n if (k > l) {\n v[b2.first][0] -= 3;\n } else if (k < l) {\n v[b2.second][0] -= 3;\n } else {\n v[b2.first][0] -= 1;\n v[b2.second][0] -= 1;\n }\n v[b2.first][1] -= k - l;\n v[b2.second][1] -= l - k;\n v[b2.first][2] -= k;\n v[b2.second][2] -= l;\n }\n }\n if (i > j) {\n v[b1.first][0] -= 3;\n } else if (i < j) {\n v[b1.second][0] -= 3;\n } else {\n v[b1.first][0] -= 1;\n v[b1.second][0] -= 1;\n }\n v[b1.first][1] -= i - j;\n v[b1.second][1] -= j - i;\n v[b1.first][2] -= i;\n v[b1.second][2] -= j;\n }\n }\n r.push_back(res);\n //print(ma);\n }\n for (Int i = 0; i < (Int)r.size(); i++) {\n print(r[i]);\n }\n return 0;\n}","accuracy":1,"time_ms":180,"memory_kb":3176,"score_of_the_acc":-0.1165,"final_rank":3},{"submission_id":"aoj_1234_4289974","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define all(x) (x).begin(),(x).end()\n#define double long double\nconst int mod=1000000007,MAX=203,INF=1<<20;\n\nstruct data{\n int point;\n int diff;\n int goal;\n int id;\n \n bool operator<(const data &another) const\n {\n if(point==another.point){\n if(diff==another.diff){\n if(goal==another.goal){\n return id<another.id;\n }\n return goal<another.goal;\n }\n return diff<another.diff;\n }\n return point<another.point;\n };\n \n bool operator == (const data &another) const\n {\n return point==another.point&&diff==another.diff&&goal==another.goal;\n };\n};\n\nvector<int> dh={1,1,1,2,2,3},dw={11,16,21,16,21,21};\n\nvoid f(data &a,data &b,int scorea,int scoreb){\n if(scorea==scoreb){\n a.point++;\n b.point++;\n a.goal+=scorea;\n b.goal+=scoreb;\n }else if(scorea>scoreb){\n a.point+=3;\n a.diff+=scorea-scoreb;\n b.diff+=scoreb-scorea;\n a.goal+=scorea;\n b.goal+=scoreb;\n }else{\n b.point+=3;\n a.diff+=scorea-scoreb;\n b.diff+=scoreb-scorea;\n a.goal+=scorea;\n b.goal+=scoreb;\n }\n \n}\n\nint main(){\n \n std::ifstream in(\"text.txt\");\n std::cin.rdbuf(in.rdbuf());\n cin.tie(0);\n ios::sync_with_stdio(false);\n \n int Q;cin>>Q;\n vector<double> p(9);\n for(double i=0.0;i<=8.0;i++){\n p[i]=1.0;\n for(double j=1.0;j<=8.0;j++) p[i]*=j;\n for(double j=1.0;j<=i;j++) p[i]/=j;\n for(double j=1.0;j<=8.0-i;j++) p[i]/=j;\n \n for(double j=1.0;j<=8.0-i;j++) p[i]*=3.0;\n for(double j=1.0;j<=8.0;j++) p[i]/=4.0;\n }\n \n while(Q--){\n vector<string> S(5);\n for(int i=0;i<5;i++) cin>>S[i];\n double ans=0.0;\n int my;\n vector<data> T(4);\n \n for(int i=1;i<5;i++) if(S[i][0]=='*') my=i-1;\n \n vector<pair<int,int>> ch;\n \n for(int k=0;k<6;k++){\n if(S[dh[k]][dw[k]]=='_'){\n ch.push_back({dh[k],dw[k]});\n ch.push_back({dh[k],dw[k]+2});\n }\n }\n \n for(int q1=0;q1<9;q1++){\n for(int q2=0;q2<9;q2++){\n for(int q3=0;q3<9;q3++){\n for(int q4=0;q4<9;q4++){\n double pp=p[q1]*p[q2]*p[q3]*p[q4];\n vector<int> sco(4);\n sco[0]=q1;\n sco[1]=q2;\n sco[2]=q3;\n sco[3]=q4;\n \n for(int k=0;k<4;k++) S[ch[k].first][ch[k].second]=char('0'+sco[k]);\n \n vector<int> use(4,0);\n \n while(1){\n vector<data> T(4);\n int fi=0;\n for(int i=0;i<4;i++){\n T[i].id=i;\n if(use[i]==1) T[i].point+=1000;\n if(use[i]==2) T[i].point-=1000;\n if(use[i]==0) fi++;\n }\n \n for(int k=0;k<6;k++){\n int a=S[dh[k]][dw[k]]-'0',b=S[dh[k]][dw[k]+2]-'0';\n \n if(use[dh[k]-1]||use[(dw[k]-6)/5]) continue;\n \n f(T[dh[k]-1],T[(dw[k]-6)/5],a,b);\n \n //cout<<a<<\" \"<<b<<endl;\n }\n \n int cnta=0,cntb=0;\n for(int i=0;i<4;i++){\n //if(i==my) continue;\n if(!(T[i]==T[my])){\n if(T[i]<T[my]) cntb++;\n if(T[my]<T[i]) cnta++;\n }\n }\n \n int posa,posb;\n posa=cnta;\n posb=3-cntb;\n \n sort(all(T));\n reverse(all(T));\n \n if(posb<=1){\n ans+=pp;\n break;\n }else if(posa>=2){\n break;\n }else{\n if(fi==posb-posa+1){\n double cnt=0;\n for(int i=posa;i<=posb;i++) if(i<=1) cnt++;\n ans+=pp*cnt/(double)(fi);\n break;\n }else{\n for(int i=0;i<posa;i++) use[T[i].id]=1;\n for(int i=posb+1;i<4;i++) use[T[i].id]=2;\n for(int i=posa;i<=posb;i++){\n //if(use[T[i].id]) cout<<\"!\"<<endl;\n use[T[i].id]=0;\n }\n }\n }\n }\n \n for(int k=0;k<4;k++) S[ch[k].first][ch[k].second]='_';\n }\n }\n }\n }\n cout<<fixed<<setprecision(7)<<ans<<endl;\n }\n}","accuracy":1,"time_ms":90,"memory_kb":3304,"score_of_the_acc":-0.2849,"final_rank":9},{"submission_id":"aoj_1234_4252005","code_snippet":"#define _CRT_SECURE_NO_WARNINGS\n#define _USE_MATH_DEFINES\n\n#pragma comment (linker, \"/STACK:526000000\")\n\n#include \"bits/stdc++.h\"\n\nusing namespace std;\ntypedef string::const_iterator State;\n#define eps 1e-11L\n#define MAX_MOD 1000000007LL\n#define GYAKU 500000004LL\n\n#define MOD 998244353LL\n#define seg_size 262144 * 4LL\n#define pb push_back\n#define mp make_pair\ntypedef long long ll;\n#define REP(a,b) for(long long (a) = 0;(a) < (b);++(a))\n#define ALL(x) (x).begin(),(x).end()\n\nvoid init() {\n iostream::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n}\n\n\n//#define int ll\n\nunsigned long xor128() {\n static unsigned long x = 123456789, y = 362436069, z = 521288629, w = 88675123;\n unsigned long t = (x ^ (x << 11));\n x = y; y = z; z = w;\n return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));\n}\nstring names[4];\nint target = 0;\nvector<pair<pair<int, int>, pair<int, int>>> results;\nlong double calc() {\n vector<int> going{ 0,1,2,3 };\n vector<int> winner;\n REP(t, 3) {\n map<tuple<int, int, int>, vector<int>> next;\n tuple<int, int, int> cnter[4] = {};\n REP(i, going.size()) {\n REP(q, going.size()) {\n REP(j, results.size()) {\n if (results[j].first == mp((int)going[i], (int)going[q])) {\n if (results[j].second.first == results[j].second.second) {\n get<0>(cnter[going[i]])--;\n get<0>(cnter[going[q]])--;\n }\n else if (results[j].second.first > results[j].second.second) {\n get<0>(cnter[going[i]]) -= 3;\n }\n else {\n get<0>(cnter[going[q]]) -= 3;\n }\n get<1>(cnter[going[i]]) -= results[j].second.first - results[j].second.second;\n get<1>(cnter[going[q]]) -= results[j].second.second - results[j].second.first;\n get<2>(cnter[going[i]]) -= results[j].second.first;\n get<2>(cnter[going[q]]) -= results[j].second.second;\n }\n }\n }\n }\n REP(i, going.size()) {\n next[cnter[going[i]]].push_back(going[i]);\n }\n if ((*next.begin()).second.size() + winner.size() >= 2) {\n going = (*next.begin()).second;\n }\n else {\n vector<int> hoge = (*next.begin()).second;\n REP(j, hoge.size()) {\n winner.push_back(hoge[j]);\n }\n auto x = next.begin();\n x++;\n if (x != next.end()) {\n going = (*x).second;\n }\n else {\n going.clear();\n break;\n }\n }\n }\n REP(i, winner.size()) {\n if (winner[i] == target) {\n return 1.0L;\n }\n }\n long double now = 2 - (int)winner.size();\n REP(i, going.size()) {\n if (target == going[i]) {\n return now / (long double)(going.size());\n }\n }\n return 0;\n}\nlong double memo[9];\nlong double scoring(int a) {\n if (memo[a]) return memo[a];\n long double ans = 1;\n for (int i = 2; i <= 8; ++i) {\n ans *= (long double)i;\n }\n for (int i = 2; i <= a; ++i) {\n ans /= (long double)i;\n }\n for (int i = 2; i <= 8 - a; ++i) {\n ans /= (long double)i;\n }\n REP(i, a) {\n ans /= (long double)4;\n }\n REP(i, 8 - a) {\n ans /= (long double)4;\n ans *= (long double)3;\n }\n return memo[a] = ans;\n}\nvoid solve() {\n results.clear();\n vector<string> inputs;\n string a;\n cin >> a;\n REP(i, 4) {\n string a;\n cin >> a;\n inputs.push_back(a);\n }\n REP(i, 4) {\n if (inputs[i][0] == '*') {\n target = i;\n }\n names[i] = inputs[i].substr(1, 3);\n }\n vector<pair<int, int>> no;\n REP(i, 4) {\n for (int q = i+1; q < 4; ++q) {\n string b = inputs[i].substr(6 + q * 5, 3);\n if (b[0] == '_') {\n no.push_back(mp(i, q));\n }\n else {\n pair<pair<int, int>, pair<int, int>> now = mp(mp((int)i, (int)q), mp((int)(b[0] - '0'), (int)(b[2] - '0')));\n results.push_back(now);\n }\n }\n }\n results.push_back(mp(no[0], mp(-1, -1)));\n results.push_back(mp(no[1], mp(-1, -1)));\n long double ans = 0;\n REP(i, 9) {\n REP(q, 9) {\n REP(j, 9) {\n REP(t, 9) {\n long double prob = scoring(i) * scoring(q) * scoring(j) * scoring(t);\n results[results.size()-1].second = mp(i, q);\n results[results.size()-2].second = mp(j, t);\n ans += prob * calc();\n }\n }\n }\n }\n cout << ans << endl;\n}\n\n#undef int\nint main() {\n init();\n int t;\n cin >> t;\n REP(tea,t)\n solve();\n}","accuracy":1,"time_ms":350,"memory_kb":3296,"score_of_the_acc":-0.3241,"final_rank":12},{"submission_id":"aoj_1234_3836016","code_snippet":"#include <iomanip>\n#include <iostream>\n#include <cmath>\n#include <vector>\n#include <string>\n\nusing Bool = bool;\nusing Int = long long int;\nusing Real = long double;\nusing Char = char;\nusing String = std::string;\ntemplate <class T>\nusing Vector = std::vector<T>;\ntemplate <class T>\nusing Matrix = Vector<Vector<T>>;\n\nstruct Fout {\n Int precision;\n Fout(Int precision) : precision(precision) {}\n};\nstd::ostream& operator<<(std::ostream& os, const Fout& fio) {\n os << std::fixed << std::setprecision(fio.precision);\n return os;\n}\n\n// p勝する確率\nVector<Real> prob;\n\nvoid init() {\n prob.resize(9);\n prob[0] = std::pow(0.75L, 8);\n for (Int i = 1; i <= 8; ++i) {\n prob[i] = prob[i - 1] * Real(9 - i) / Real(i * 3);\n }\n}\n\n// 入力から得点表を生成\n// 先頭が自チーム、埋まってない箇所は-1 ~ -4が振られる\nMatrix<Int> parse() {\n String s;\n std::cin >> s;\n\n Vector<Vector<Int>> score(4, Vector<Int>(4, 0));\n\n {\n Int me = 0, cnt = -1;\n\n for (Int i = 0; i < 4; ++i) {\n std::cin >> s;\n if (s.front() == '*') me = i;\n\n for (Int j = i + 1; j < 4; ++j) {\n Char x = s[j * 5 + 6];\n score[i][j] = (x == '_' ? cnt-- : x - '0');\n x = s[j * 5 + 8];\n score[j][i] = (x == '_' ? cnt-- : x - '0');\n }\n }\n\n // 自チームを先頭へ移動\n std::swap(score[0], score[me]);\n for (auto& v : score) std::swap(v[0], v[me]);\n }\n\n return score;\n}\n\nvoid solve() {\n auto score = parse();\n Real ans = 0;\n\n // 空欄の点数を全列挙\n for (Int b = 0; b < 6561; ++b) {\n // デコード\n Vector<Int> pts(4);\n {\n Int c = b;\n for (Int i = 0; i < 4; ++i) {\n pts[i] = c % 9;\n c /= 9;\n }\n }\n\n Real pr = 1;\n for (auto p : pts) pr *= prob[p];\n\n // 空欄を埋める\n auto nscore = score;\n for (auto& v : nscore) {\n for (auto& x : v) {\n if (x < 0) x = pts[-x - 1];\n }\n }\n\n Vector<Vector<Int>> result(4);\n\n for (Int q = 0; q < 3; ++q) {\n // 現時点で自チームと同率のチームを列挙\n Vector<Bool> cons(4);\n for (Int i = 0; i < 4; ++i) {\n cons[i] = (result[i] == result[0]);\n }\n\n // 同率チーム間のポイント、得失点差、得点\n Matrix<Int> tmpres(4, Vector<Int>(3, 0));\n for (Int i = 0; i < 4; ++i) {\n if (!cons[i]) continue;\n for (Int j = 0; j < 4; ++j) {\n if (i == j || !cons[j]) continue;\n\n Int me = nscore[i][j], op = nscore[j][i];\n tmpres[i][0] += (me > op ? 3 : me == op);\n tmpres[i][1] += me - op;\n tmpres[i][2] += me;\n }\n }\n\n // テーブルを拡張\n for (Int i = 0; i < 4; ++i) {\n if (cons[i])\n std::move(tmpres[i].begin(), tmpres[i].end(),\n std::back_inserter(result[i]));\n }\n }\n\n Int u = 0, m = 0; // 自チームと比べて上、同率のチーム数\n for (Int i = 0; i < 4; ++i) {\n if (result[i] > result[0]) {\n ++u;\n } else if (result[i] == result[0]) {\n ++m;\n }\n }\n\n if (u >= 2) { // 枠が埋まっている\n pr = 0;\n } else if (u + m >= 3) { // 残り2-u枠をmチームで取り合う\n pr *= Real(2 - u) / Real(m);\n }\n ans += pr;\n }\n\n std::cout << Fout(7) << ans << std::endl;\n}\n\nint main() {\n init();\n Int n;\n std::cin >> n;\n for (Int i = 0; i < n; ++i) solve();\n return 0;\n}","accuracy":1,"time_ms":850,"memory_kb":3184,"score_of_the_acc":-0.2589,"final_rank":8},{"submission_id":"aoj_1234_3836015","code_snippet":"#if __has_include(\"../library/Basic/Debug.hpp\")\n\n#include \"../library/Basic/Debug.hpp\"\n\n#else\n\n/* ----- Header Files ----- */\n// IO\n#include <cstdio>\n#include <iomanip>\n#include <ios>\n#include <iostream>\n\n// algorithm\n#include <algorithm>\n#include <cmath>\n#include <numeric>\n\n// container\n#include <vector>\n#include <string>\n#include <tuple>\n#include <set>\n#include <map>\n#include <stack>\n#include <queue>\n#include <deque>\n\n// others\n#include <random>\n#include <limits>\n#include <functional>\n#include <ctime>\n#include <cassert>\n#include <cstdint>\n\n\n/* ----- Type Alias ----- */\nusing Bool = bool;\nusing Int = long long int;\nusing Real = long double;\nusing Char = char;\nusing String = std::string;\ntemplate <class... Ts>\nusing Tuple = std::tuple<Ts...>;\n\ntemplate <class T>\nusing Vector = std::vector<T>;\ntemplate <class T>\nusing Matrix = Vector<Vector<T>>;\ntemplate <class T>\nusing Queue = std::queue<T>;\ntemplate <class T>\nusing Stack = std::stack<T>;\ntemplate <class T>\nusing Deque = std::deque<T>;\n\ntemplate <class T>\nusing MaxHeap = std::priority_queue<T>;\ntemplate <class T>\nusing MinHeap = std::priority_queue<T, std::vector<T>, std::greater<T>>;\ntemplate <class T>\nusing Set = std::set<T>;\ntemplate <class T, class U>\nusing Map = std::map<T, U>;\n\ntemplate <class T, class... Us>\nusing Func = std::function<T(Us...)>;\n\ntemplate <class T>\nT genv(T v) { return v; }\n\ntemplate <class T, class... Ts>\nauto genv(size_t l, Ts... ts) {\n return Vector<decltype(genv<T>(ts...))>(l, genv<T>(ts...));\n}\n\ntemplate <class Cost = Int>\nstruct Edge {\n Int src, dst;\n Cost cost;\n Edge(Int src = -1, Int dst = -1, Cost cost = 1)\n : src(src), dst(dst), cost(cost){};\n\n bool operator<(const Edge<Cost>& e) const { return this->cost < e.cost; }\n bool operator>(const Edge<Cost>& e) const { return this->cost > e.cost; }\n};\n\ntemplate <class Cost = Int>\nusing Edges = Vector<Edge<Cost>>;\ntemplate <class Cost = Int>\nusing Graph = Vector<Vector<Edge<Cost>>>;\n\n#endif\n\n/* ----- Misc ----- */\nvoid fastio() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n}\n\nstruct Fout {\n Int precision;\n Fout(Int precision) : precision(precision) {}\n};\nstd::ostream& operator<<(std::ostream& os, const Fout& fio) {\n os << std::fixed << std::setprecision(fio.precision);\n return os;\n}\n\n\n/* ----- Constants ----- */\n// constexpr Int INF = std::numeric_limits<Int>::max() / 3;\n// constexpr Int MOD = 1000000007;\n// constexpr Real PI = acos(-1);\n// constexpr Real EPS = 1e-10;\n// std::mt19937 mt(int(std::time(nullptr)));\n\nVector<Real> prob;\n\nvoid init() {\n prob.resize(9);\n prob[0] = std::pow(0.75L, 8);\n for (Int i = 1; i <= 8; ++i) {\n prob[i] = prob[i - 1] * Real(9 - i) / Real(i * 3);\n }\n}\n\nvoid solve() {\n String s;\n std::cin >> s;\n\n Vector<Vector<Int>> score(4, Vector<Int>(4, 0));\n\n {\n Int me = 0, cnt = -1;\n\n for (Int i = 0; i < 4; ++i) {\n std::cin >> s;\n if (s.front() == '*') me = i;\n\n for (Int j = i + 1; j < 4; ++j) {\n Char x = s[j * 5 + 6];\n score[i][j] = (x == '_' ? cnt-- : x - '0');\n x = s[j * 5 + 8];\n score[j][i] = (x == '_' ? cnt-- : x - '0');\n }\n }\n\n std::swap(score[0], score[me]);\n for (auto& v : score) std::swap(v[0], v[me]);\n }\n\n Real ans = 0;\n for (Int b = 0; b < 6561; ++b) {\n Vector<Int> pts(4);\n {\n Int c = b;\n for (Int i = 0; i < 4; ++i) {\n pts[i] = c % 9;\n c /= 9;\n }\n }\n\n Real pr = 1;\n for (auto p : pts) pr *= prob[p];\n\n auto s = score;\n for (auto& v : s) {\n for (auto& x : v) {\n if (x < 0) x = pts[-x - 1];\n }\n }\n\n Vector<Vector<Int>> result(4);\n\n for (Int q = 0; q < 3; ++q) {\n Int cons = 1;\n for (Int i = 1; i < 4; ++i) {\n if (result[i] == result[0]) cons += (1 << i);\n }\n\n Vector<Vector<Int>> tmpres(4, Vector<Int>(3, 0));\n for (Int i = 0; i < 4; ++i) {\n if (((cons >> i) & 1) == 0) continue;\n for (Int j = 0; j < 4; ++j) {\n if (i == j || ((cons >> j) & 1) == 0) continue;\n tmpres[i][0] += (s[i][j] > s[j][i] ? 3 : s[i][j] == s[j][i]);\n tmpres[i][1] += s[i][j] - s[j][i];\n tmpres[i][2] += s[i][j];\n }\n }\n\n for (Int i = 0; i < 4; ++i) {\n if ((cons >> i) & 1)\n std::move(tmpres[i].begin(), tmpres[i].end(),\n std::back_inserter(result[i]));\n }\n }\n\n Int u = 0, m = 0;\n for (Int i = 0; i < 4; ++i) {\n if (result[i] > result[0]) {\n ++u;\n } else if (result[i] == result[0]) {\n ++m;\n }\n }\n\n if (u >= 2) {\n pr = 0;\n } else if (u + m >= 3) {\n pr *= Real(2 - u) / Real(m);\n }\n ans += pr;\n }\n\n std::cout << Fout(7) << ans << std::endl;\n}\n\nint main() {\n init();\n Int n;\n std::cin >> n;\n for (Int i = 0; i < n; ++i) solve();\n return 0;\n}","accuracy":1,"time_ms":870,"memory_kb":3272,"score_of_the_acc":-0.3908,"final_rank":13},{"submission_id":"aoj_1234_3568063","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<iomanip>\n#include<vector>\nusing namespace std;\ndouble W[9];\nint x[4][4]={{0,1,1,1},{1,0,2,2},{1,2,0,3},{1,2,3,0}};\nint y[4][4]={{0,11,16,21},{11,0,16,21},{16,16,0,21},{21,21,21,0}};\nint mx[6]={1,1,1,2,2,3},my[6]={11,16,21,16,21,21};\nint ax[12]={1,1,1,1,1,1,2,2,2,2,3,3},ay[12]={11,13,16,18,21,23,16,18,21,23,21,23};\nstring s[5];\nint winner;\ndouble dfs(int id)\n{\n\tif(id==12)\n\t{\n\t\tvector<pair<pair<int,pair<int,int> >,int> >A(4);\n\t\tfor(int i=0;i<4;i++)\n\t\t{\n\t\t\tint p=0,d=0,g=0;\n\t\t\tfor(int j=0;j<4;j++)\n\t\t\t{\n\t\t\t\tif(i==j)continue;\n\t\t\t\tint a=s[x[i][j]][y[i][j]]-'0';\n\t\t\t\tint b=s[x[i][j]][y[i][j]+2]-'0';\n\t\t\t\tif(x[i][j]>i)\n\t\t\t\t{\n\t\t\t\t\tp+=a>b?3:a==b?1:0;\n\t\t\t\t\td+=a-b;\n\t\t\t\t\tg+=a;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tp+=b>a?3:b==a?1:0;\n\t\t\t\t\td+=b-a;\n\t\t\t\t\tg+=b;\n\t\t\t\t}\n\t\t\t}\n\t\t\tA[i]=make_pair(make_pair(-p,make_pair(-d,-g)),i);\n\t\t}\n\t\tsort(A.begin(),A.end());\n\t\tvector<int>B;\n\t\tint p=0;\n\t\tfor(int i=1;i<=4;i++)\n\t\t{\n\t\t\tif(i<4&&A[p].first==A[i].first)continue;\n\t\t\telse\n\t\t\t{\n\t\t\t\tif(p+1==i)B.push_back(A[p].second);\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tvector<int>I;\n\t\t\t\t\tfor(int j=p;j<i;j++)I.push_back(A[j].second);\n\t\t\t\t\tint pre=114514;\n\t\t\t\t\twhile(I.size()<pre)\n\t\t\t\t\t{\n\t\t\t\t\t\tpre=I.size();\n\t\t\t\t\t\tvector<pair<pair<int,pair<int,int> >,int> >C;\n\t\t\t\t\t\tfor(int j=0;j<I.size();j++)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tint p=0,d=0,g=0;\n\t\t\t\t\t\t\tfor(int k=0;k<I.size();k++)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tif(j==k)continue;\n\t\t\t\t\t\t\t\tint a=s[x[I[j]][I[k]]][y[I[j]][I[k]]]-'0';\n\t\t\t\t\t\t\t\tint b=s[x[I[j]][I[k]]][y[I[j]][I[k]]+2]-'0';\n\t\t\t\t\t\t\t\tif(x[I[j]][I[k]]>I[j])\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tp+=a>b?3:a==b?1:0;\n\t\t\t\t\t\t\t\t\td+=a-b;\n\t\t\t\t\t\t\t\t\tg+=a;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tp+=b>a?3:b==a?1:0;\n\t\t\t\t\t\t\t\t\td+=b-a;\n\t\t\t\t\t\t\t\t\tg+=b;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tC.push_back(make_pair(make_pair(-p,make_pair(-d,-g)),I[j]));\n\t\t\t\t\t\t}\n\t\t\t\t\t\tsort(C.begin(),C.end());\n\t\t\t\t\t\tint q=0;\n\t\t\t\t\t\tvector<int>J;\n\t\t\t\t\t\tfor(int j=1;j<=C.size();j++)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tif(j<C.size()&&C[q].first==C[j].first)continue;\n\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tif(q+1==j)B.push_back(C[q++].second);\n\t\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tbool flag=0;\n\t\t\t\t\t\t\t\t\tfor(int k=0;k<I.size();k++)flag|=I[k]==winner;\n\t\t\t\t\t\t\t\t\tif(!flag)\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\tfor(;q<j;q++)B.push_back(C[q].second);\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\tfor(;q<j;q++)J.push_back(C[q].second);\n\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tI=J;\n\t\t\t\t\t}\n\t\t\t\t\tif(!I.empty())\n\t\t\t\t\t{\n\t\t\t\t\t\tbool flag=0;\n\t\t\t\t\t\tfor(int j=0;j<I.size();j++)flag|=I[j]==winner;\n\t\t\t\t\t\tif(!flag)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tfor(int j=0;j<I.size();j++)B.push_back(I[j]);\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tif(B.size()>=2)return 0;\n\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tdouble rest=2-B.size();\n\t\t\t\t\t\t\t\treturn rest/I.size();\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}\n\t\t\t\tp=i;\n\t\t\t}\n\t\t}\n\t\treturn B[0]==winner||B[1]==winner;\n\t}\n\telse\n\t{\n\t\tif(s[ax[id]][ay[id]]!='_')return dfs(id+1);\n\t\telse\n\t\t{\n\t\t\tdouble ret=0;\n\t\t\tfor(char c='0';c<='8';c++)\n\t\t\t{\n\t\t\t\ts[ax[id]][ay[id]]=c;\n\t\t\t\tret+=W[c-'0']*dfs(id+1);\n\t\t\t\ts[ax[id]][ay[id]]='_';\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\t}\n}\nmain()\n{\n\tfor(int p=0;p<=8;p++)\n\t{\n\t\tW[p]=1;\n\t\tfor(int j=1;j<=8;j++)W[p]*=j;\n\t\tfor(int j=1;j<=p;j++)W[p]/=j;\n\t\tfor(int j=1;j<=8-p;j++)W[p]/=j;\n\t\tfor(int j=1;j<=p;j++)W[p]/=4;\n\t\tfor(int j=1;j<=8-p;j++)W[p]*=3./4;\n\t}\n\tint T;cin>>T;\n\tfor(;T--;)\n\t{\n\t\tfor(int i=0;i<5;i++)\n\t\t{\n\t\t\tcin>>s[i];\n\t\t\tif(s[i][0]=='*')winner=i-1;\n\t\t}\n\t\tcout<<fixed<<setprecision(9)<<dfs(0)<<endl;\n\t}\n}","accuracy":1,"time_ms":120,"memory_kb":3192,"score_of_the_acc":-0.128,"final_rank":4},{"submission_id":"aoj_1234_3321193","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nusing ld=long double;\nstruct Match{\n int lhs,rhs;\n int lhsp,rhsp;\n};\n\nvoid debug(Match x){\n //cerr<<x.lhs<<\"vs\"<<x.rhs<<\" \"<<x.lhsp<<\"-\"<<x.rhsp<<endl;\n}\nvoid debug(vector<Match> x){\n //cerr<<\"#These are match\"<<endl;\n for(int i=0;i<x.size();i++){\n debug(x[i]);\n }\n}\nld winner(const vector<Match> &match,int tar,int place){\n vector<int> pt(4);\n vector<int> gd(4);\n vector<int> sc(4);\n for(auto &m:match){\n pt[m.lhs]++;\n pt[m.rhs]++;\n if(m.lhsp<m.rhsp) pt[m.rhs]+=300;\n else if(m.lhsp>m.rhsp) pt[m.lhs]+=300;\n else pt[m.rhs]+=100,pt[m.lhs]+=100;\n gd[m.lhs]+=m.lhsp-m.rhsp;\n gd[m.rhs]+=m.rhsp-m.lhsp;\n sc[m.lhs]+=m.lhsp;\n sc[m.rhs]+=m.rhsp;\n }\n vector<int> rs(4);\n for(int i=0;i<4;i++) rs[i]=pt[i]*1e5+gd[i]*1e3+sc[i];\n int x=*max_element(rs.begin(),rs.end());\n if(rs[tar]==x){\n if(count(rs.begin(),rs.end(),x)==1) return 1;\n vector<Match> next;\n for(auto &m:match){\n if(rs[m.lhs]==x && rs[m.rhs]==x) next.push_back(m);\n }\n //cerr<<\"#\"<<next.size()<<endl;\n if(match.size()==next.size()){\n int cnt=count(rs.begin(),rs.end(),x);\n if(cnt==1) return 1;\n else return ld(place)/cnt;\n }\n else return winner(next,tar,place);\n }\n if(place<=count(rs.begin(),rs.end(),x)) return 0;\n int sndmax=0;\n for(int i=0;i<4;i++){\n if(rs[i]!=x) sndmax=max(sndmax,rs[i]);\n }\n if(rs[tar]==sndmax){\n if(count(rs.begin(),rs.end(),sndmax)==1) return 1;\n vector<Match> next;\n for(auto &m:match){\n if(rs[m.lhs]==sndmax && rs[m.rhs]==sndmax) next.push_back(m);\n }\n return winner(next,tar,1);\n }\n return 0;\n}\nld pos(int point){\n ld res=1;\n for(int i=0;i<8;i++) res*=(i+1);\n for(int i=0;i<point;i++) res*=0.25/(i+1);\n for(int i=0;i<8-point;i++) res*=0.75/(i+1);\n return res;\n}\nint cnt=0;\nld dfs(int idx,vector<Match> &match,ld p,int tar){\n if(idx==match.size()){\n ld x=winner(match,tar,2);\n cnt++;\n debug(match);\n //cerr<<x<<endl;\n return p*x;\n }\n ld res=0;\n if(match[idx].lhsp==-1){\n for(int i=0;i<=8;i++){\n for(int j=0;j<=8;j++){\n match[idx].lhsp=i;\n match[idx].rhsp=j;\n res+=dfs(idx+1,match,p*pos(i)*pos(j),tar);\n match[idx].lhsp=-1;\n match[idx].rhsp=-1;\n }\n }\n }\n else{\n return dfs(idx+1,match,p,tar);\n }\n return res;\n}\nld solve(){\n array<string,5> table;\n for(int i=0;i<5;i++) cin>>table[i];\n int tar=0;\n for(int i=0;i<4;i++){\n if(table[i+1][0]=='*') tar=i;\n }\n const int WIDTH=5;\n const int LHS=1;\n const int RHS=3;\n vector<Match> match;\n for(int i=0;i<4;i++){\n for(int j=0;j<i;j++){\n char lhsp=table[j+1][WIDTH*(i+1)+LHS];\n char rhsp=table[j+1][WIDTH*(i+1)+RHS];\n if(isdigit(lhsp)){\n assert(isdigit(rhsp));\n match.push_back(Match{j,i,lhsp-'0',rhsp-'0'});\n }\n else{\n match.push_back(Match{j,i,-1,-1});\n }\n }\n }\n assert(match.size()==6);\n return dfs(0,match,1,tar);\n}\nint main(){\n int n;\n cin>>n;\n cout<<setprecision(10)<<fixed;\n for(int i=0;i<n;i++){\n cout<<solve()<<endl; \n }\n\n return 0;\n}","accuracy":1,"time_ms":130,"memory_kb":3212,"score_of_the_acc":-0.159,"final_rank":6},{"submission_id":"aoj_1234_3264952","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>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int ui;\nconst ll mod = 1000000007;\nconst ll INF = (ll)1000000007 * 1000000007;\ntypedef pair<int, int> P;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\ntypedef long double ld;\ntypedef complex<ld> Point;\nconst ld eps = 1e-4;\nconst ld pi = acos(-1.0);\ntypedef pair<ll, ll> LP;\ntypedef pair<ld, ld> LDP;\nstruct result {\n\tint x, y, cx, cy;\n};\nresult a[6];\nint target;\nint c[4];\nvoid a_calc() {\n\trep(i, 4) {\n\t\tc[i] = 0;\n\t}\n\trep(i, 6) {\n\t\tif (a[i].cx > a[i].cy)c[a[i].x] += 3;\n\t\telse if (a[i].cx < a[i].cy)c[a[i].y] += 3;\n\t\telse {\n\t\t\tc[a[i].x]++; c[a[i].y]++;\n\t\t}\n\t}\n}\nvoid b_calc() {\n\trep(i, 4) {\n\t\tc[i] = 0;\n\t}\n\trep(i, 6) {\n\t\tc[a[i].x] += a[i].cx - a[i].cy;\n\t\tc[a[i].y] += a[i].cy - a[i].cx;\n\t}\n}\nvoid c_calc() {\n\trep(i, 4) {\n\t\tc[i] = 0;\n\t}\n\trep(i, 6) {\n\t\tc[a[i].x] += a[i].cx;\n\t\tc[a[i].y] += a[i].cy;\n\t}\n}\nvoid d_calc(vector<int> v) {\n\trep(i, 4) {\n\t\tc[i] = 0;\n\t}\n\tint exi[4] = {};\n\trep(i, v.size()) {\n\t\texi[v[i]] = 1;\n\t}\n\trep(i, 6) {\n\t\tif (!exi[a[i].x] || !exi[a[i].y])continue;\n\t\tif (a[i].cx > a[i].cy)c[a[i].x] += 3;\n\t\telse if (a[i].cx < a[i].cy)c[a[i].y] += 3;\n\t\telse {\n\t\t\tc[a[i].x]++; c[a[i].y]++;\n\t\t}\n\t}\n}\nvoid e_calc(vector<int> v) {\n\trep(i, 4) {\n\t\tc[i] = 0;\n\t}\n\tint exi[4] = {};\n\trep(i, v.size()) {\n\t\texi[v[i]] = 1;\n\t}\n\trep(i, 6) {\n\t\tif (!exi[a[i].x] || !exi[a[i].y])continue;\n\t\tc[a[i].x] += a[i].cx - a[i].cy;\n\t\tc[a[i].y] += a[i].cy - a[i].cx;\n\t}\n}\nvoid f_calc(vector<int> v) {\n\trep(i, 4) {\n\t\tc[i] = 0;\n\t}\n\tint exi[4] = {};\n\trep(i, v.size()) {\n\t\texi[v[i]] = 1;\n\t}\n\trep(i, 6) {\n\t\tif (!exi[a[i].x] || !exi[a[i].y])continue;\n\t\tc[a[i].x] += a[i].cx;\n\t\tc[a[i].y] += a[i].cy;\n\t}\n}\nvector<int> a_rule(vector<int> u) {\n\tvector<int> res;\n\ta_calc();\n\tvector<P> v;\n\trep(i, u.size()) {\n\t\tv.push_back({ c[u[i]],u[i] });\n\t}\n\tsort(v.begin(), v.end(),greater<P>());\n\tint cnt = 0;\n\trep(i, v.size()) {\n\t\tres.push_back(v[i].second);\n\t\twhile (i + 1 < v.size() && v[i].first == v[i + 1].first) {\n\t\t\ti++; res.push_back(v[i].second);\n\t\t}\n\t\tcnt++;\n\t\tif (cnt == 1)break;\n\t}\n\tsort(res.begin(), res.end()); return res;\n}\nvector<int> b_rule(vector<int> v) {\n\tvector<int> res;\n\tb_calc();\n\tvector<P> u;\n\trep(i, v.size()) {\n\t\tu.push_back({ c[v[i]],v[i] });\n\t}\n\tsort(u.begin(), u.end(), greater<P>());\n\tint cnt = 0;\n\trep(i, u.size()) {\n\t\tres.push_back(u[i].second);\n\t\twhile (i + 1 < u.size() && u[i].first == u[i + 1].first) {\n\t\t\ti++; res.push_back(u[i].second);\n\t\t}\n\t\tcnt++; if (cnt == 1)break;\n\t}\n\tsort(res.begin(), res.end()); return res;\n}\nvector<int> c_rule(vector<int> v) {\n\tvector<int> res; c_calc();\n\tvector<P> u;\n\trep(i, v.size()) {\n\t\tu.push_back({ c[v[i]],v[i] });\n\t}\n\tsort(u.begin(), u.end(), greater<P>());\n\tint cnt = 0;\n\trep(i, u.size()) {\n\t\tres.push_back(u[i].second);\n\t\twhile (i + 1 < u.size() && u[i].first == u[i + 1].first) {\n\t\t\ti++; res.push_back(u[i].second);\n\t\t}\n\t\tcnt++; if (cnt == 1)break;\n\t}\n\tsort(res.begin(), res.end()); return res;\n}\nvector<int> d_rule(vector<int> v) {\n\tvector<int> res; d_calc(v);\n\tvector<P> u;\n\trep(i, v.size()) {\n\t\tu.push_back({ c[v[i]],v[i] });\n\t}\n\tsort(u.begin(), u.end(), greater<P>());\n\tint cnt = 0;\n\trep(i, u.size()) {\n\t\tres.push_back(u[i].second);\n\t\twhile (i + 1 < u.size() && u[i].first == u[i + 1].first) {\n\t\t\ti++; res.push_back(u[i].second);\n\t\t}\n\t\tcnt++; if (cnt == 1)break;\n\t}\n\tsort(res.begin(), res.end()); return res;\n}\nvector<int> e_rule(vector<int> v) {\n\tvector<int> res; e_calc(v);\n\tvector<P> u;\n\trep(i, v.size()) {\n\t\tu.push_back({ c[v[i]],v[i] });\n\t}\n\tsort(u.begin(), u.end(), greater<P>());\n\tint cnt = 0;\n\trep(i, u.size()) {\n\t\tres.push_back(u[i].second);\n\t\twhile (i + 1 < u.size() && u[i].first == u[i + 1].first) {\n\t\t\ti++; res.push_back(u[i].second);\n\t\t}\n\t\tcnt++; if (cnt == 1)break;\n\t}\n\tsort(res.begin(), res.end()); return res;\n}\nvector<int> f_rule(vector<int> v) {\n\tvector<int> res; f_calc(v);\n\tvector<P> u;\n\trep(i, v.size()) {\n\t\tu.push_back({ c[v[i]],v[i] });\n\t}\n\tsort(u.begin(), u.end(), greater<P>());\n\tint cnt = 0;\n\trep(i, u.size()) {\n\t\tres.push_back(u[i].second);\n\t\twhile (i + 1 < u.size() && u[i].first == u[i + 1].first) {\n\t\t\ti++; res.push_back(u[i].second);\n\t\t}\n\t\tcnt++; if (cnt == 1)break;\n\t}\n\tsort(res.begin(), res.end()); return res;\n}\nld ret() {\n\tbool one = false;\n\tvector<int> v = { 0,1,2,3 }; vector<int> cop;\n\tcop = v; v = a_rule(v);\n\tif (v.size() == 1 && !one) {\n\t\tone = true;\n\t\tif (v[0] == target)return 1;\n\t\tvector<int> cv;\n\t\trep(i, cop.size()) {\n\t\t\tif (v[0] == cop[i])continue;\n\t\t\tcv.push_back(cop[i]);\n\t\t}\n\t\tv = cv;\n\t\tv = a_rule(v);\n\t}\n\tif (v.size() == 1) {\n\t\tif (v[0] == target)return 1;\n\t\telse return 0;\n\t}\n\tcop = v; v = b_rule(v);\n\tif (v.size() == 1 && !one) {\n\t\tone = true;\n\t\tif (v[0] == target)return 1;\n\t\tvector<int> cv;\n\t\trep(i, cop.size()) {\n\t\t\tif (v[0] == cop[i])continue;\n\t\t\tcv.push_back(cop[i]);\n\t\t}\n\t\tv = cv;\n\t\tv = b_rule(v);\n\t}\n\tif (v.size() == 1) {\n\t\tif (v[0] == target)return 1;\n\t\telse return 0;\n\t}\n\tcop = v; v = c_rule(v);\n\tif (v.size() == 1 && !one) {\n\t\tone = true;\n\t\tif (v[0] == target)return 1;\n\t\tvector<int> cv;\n\t\trep(i, cop.size()) {\n\t\t\tif (v[0] == cop[i])continue;\n\t\t\tcv.push_back(cop[i]);\n\t\t}\n\t\tv = cv;\n\t\tv = c_rule(v);\n\t}\n\tif (v.size() == 1) {\n\t\tif (v[0] == target)return 1;\n\t\telse return 0;\n\t}\n\tcop = v;\n\t\tv = d_rule(v);\n\tif (v.size() == 1 && !one) {\n\t\tone = true;\n\t\tif (v[0] == target)return 1;\n\t\tvector<int> cv;\n\t\trep(i, cop.size()) {\n\t\t\tif (v[0] == cop[i])continue;\n\t\t\tcv.push_back(cop[i]);\n\t\t}\n\t\tv = cv;\n\t\t\tv = d_rule(v);\n\t}\n\tif (v.size() == 1) {\n\t\tif (v[0] == target)return 1;\n\t\telse return 0;\n\t}cop = v;\n\t\tv = e_rule(v);\n\tif (v.size() == 1 && !one) {\n\t\tone = true;\n\t\tif (v[0] == target)return 1;\n\t\tvector<int> cv;\n\t\trep(i, cop.size()) {\n\t\t\tif (v[0] == i)continue;\n\t\t\tcv.push_back(cop[i]);\n\t\t}\n\t\tv = cv;\n\t\t\tv = e_rule(v);\n\t}\n\tif (v.size() == 1) {\n\t\tif (v[0] == target)return 1;\n\t\telse return 0;\n\t}cop = v;\n\t\tv = f_rule(v);\n\tif (v.size() == 1 && !one) {\n\t\tone = true;\n\t\tif (v[0] == target)return 1;\n\t\tvector<int> cv;\n\t\trep(i, cop.size()) {\n\t\t\tif (v[0] == cop[i])continue;\n\t\t\tcv.push_back(cop[i]);\n\t\t}\n\t\tv = cv;\n\t\t\tv =f_rule(v);\n\t}\n\tif (v.size() == 1) {\n\t\tif (v[0] == target)return 1;\n\t\telse return 0;\n\t}cop = v;\n\t\tv = d_rule(v);\n\tif (v.size() == 1 && !one) {\n\t\tone = true;\n\t\tif (v[0] == target)return 1;\n\t\tvector<int> cv;\n\t\trep(i, cop.size()) {\n\t\t\tif (v[0] == cop[i])continue;\n\t\t\tcv.push_back(cop[i]);\n\t\t}\n\t\tv = cv;\n\t\t\tv = d_rule(v);\n\t}\n\tif (v.size() == 1) {\n\t\tif (v[0] == target)return 1;\n\t\telse return 0;\n\t}cop = v;\n\t\tv = e_rule(v);\n\tif (v.size() == 1 && !one) {\n\t\tone = true;\n\t\tif (v[0] == target)return 1;\n\t\tvector<int> cv;\n\t\trep(i, cop.size()) {\n\t\t\tif (v[0] == i)continue;\n\t\t\tcv.push_back(cop[i]);\n\t\t}\n\t\tv = cv;\n\t\tv = e_rule(v);\n\t}\n\tif (v.size() == 1) {\n\t\tif (v[0] == target)return 1;\n\t\telse return 0;\n\t}cop = v;\n\t\tv = f_rule(v);\n\tif (v.size() == 1 && !one) {\n\t\tone = true;\n\t\tif (v[0] == target)return 1;\n\t\tvector<int> cv;\n\t\trep(i, cop.size()) {\n\t\t\tif (v[0] == cop[i])continue;\n\t\t\tcv.push_back(cop[i]);\n\t\t}\n\t\tv = cv;\n\t\t\tv = f_rule(v);\n\t}\n\tif (v.size() == 1) {\n\t\tif (v[0] == target)return 1;\n\t\telse return 0;\n\t}cop = v;\n\t\tv = d_rule(v);\n\tif (v.size() == 1 && !one) {\n\t\tone = true;\n\t\tif (v[0] == target)return 1;\n\t\tvector<int> cv;\n\t\trep(i, cop.size()) {\n\t\t\tif (v[0] == cop[i])continue;\n\t\t\tcv.push_back(cop[i]);\n\t\t}\n\t\tv = cv;\n\t\t\tv = d_rule(v);\n\t}\n\tif (v.size() == 1) {\n\t\tif (v[0] == target)return 1;\n\t\telse return 0;\n\t}cop = v;\n\t\tv = e_rule(v);\n\tif (v.size() == 1 && !one) {\n\t\tone = true;\n\t\tif (v[0] == target)return 1;\n\t\tvector<int> cv;\n\t\trep(i, cop.size()) {\n\t\t\tif (v[0] == i)continue;\n\t\t\tcv.push_back(cop[i]);\n\t\t}\n\t\tv = cv;\n\t\t\tv = e_rule(v);\n\t}\n\tif (v.size() == 1) {\n\t\tif (v[0] == target)return 1;\n\t\telse return 0;\n\t}cop = v;\n\t\tv = f_rule(v);\n\tif (v.size() == 1 && !one) {\n\t\tone = true;\n\t\tif (v[0] == target)return 1;\n\t\tvector<int> cv;\n\t\trep(i, cop.size()) {\n\t\t\tif (v[0] == cop[i])continue;\n\t\t\tcv.push_back(cop[i]);\n\t\t}\n\t\tv = cv;\n\t\t\tv = f_rule(v);\n\t}\n\tif (v.size() == 1) {\n\t\tif (v[0] == target)return 1;\n\t\telse return 0;\n\t}\n\tif (!one) {\n\t\trep(i, v.size()) {\n\t\t\tif (v[i] == target) {\n\t\t\t\treturn 2 / (ld)v.size();\n\t\t\t}\n\t\t}\n\t\treturn 0;\n\t}\n\telse {\n\t\trep(i, v.size()) {\n\t\t\tif (v[i] == target) {\n\t\t\t\treturn 1 / (ld)v.size();\n\t\t\t}\n\t\t}\n\t\treturn 0;\n\t}\n}\nld pos[9];\nld pp[9];\nvoid init() {\n\tpp[0] = 1;\n\trep1(i, 8) {\n\t\tpp[i] = pp[i - 1] * i;\n\t}\n\trep(i, 9) {\n\t\tpos[i] = pp[8] / (pp[i] * pp[8 - i]);\n\t\trep(j, i) {\n\t\t\tpos[i] *= 0.25;\n\t\t}\n\t\trep(j, 8 - i) {\n\t\t\tpos[i] *= 0.75;\n\t\t}\n\t\t//cout << pos[i] << endl;\n\t}\n}\nP check[6] = { {1,11},{1,16},{1,21},{2,16},{2,21},{3,21} };\nP loc[6] = { {0,1},{0,2},{0,3},{1,2},{1,3},{2,3} };\nint main() {\n\tinit();\n\tcout << fixed << setprecision(8);\n\tint n; cin >> n;\n\trep(aa, n) {\n\t\tstring s[5];\n\t\trep(i, 5) {\n\t\t\tcin >> s[i];\n\t\t\tif (s[i][0] == '*')target = i-1;\n\t\t}\n\t\tld out = 0;\n\t\t//int num = 0, hie = 0;\n\t\trep(p1, 9) {\n\t\t\trep(p2, 9) {\n\t\t\t\trep(p3, 9) {\n\t\t\t\t\trep(p4, 9) {\n\t\t\t\t\t\tint now = 0; int cnow = 0;\n\t\t\t\t\t\trep(i, 6) {\n\t\t\t\t\t\t\tint x = check[i].first; int y = check[i].second;\n\t\t\t\t\t\t\tif (s[x][y] == '_') {\n\t\t\t\t\t\t\t\tif (cnow == 0) {\n\t\t\t\t\t\t\t\t\ta[i] = { loc[i].first,loc[i].second,p1,p2 }; cnow++;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\telse {\n\t\t\t\t\t\t\t\t\ta[i] = { loc[i].first,loc[i].second,p3,p4 };\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse {\n\t\t\t\t\t\t\t\ta[i] = { loc[i].first,loc[i].second,s[x][y] - '0',s[x][y + 2] - '0' };\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tout += pos[p1] * pos[p2] * pos[p3] * pos[p4] * ret();\n\t\t\t\t\t\t//if (ret() == 1)num++;\n\t\t\t\t\t\t//if (ret() == 0)hie++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << out << endl;\n\t\t//cout << num << \" \" << hie << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":330,"memory_kb":3280,"score_of_the_acc":-0.2969,"final_rank":10},{"submission_id":"aoj_1234_3075088","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 NUM 4\n\nstruct Info{\n\tbool operator<(const struct Info& arg) const{\n\n\t\tif(points != arg.points){\n\n\t\t\treturn points > arg.points;\n\n\t\t}else if(goal_diff != arg.goal_diff){\n\n\t\t\treturn goal_diff > arg.goal_diff;\n\t\t}else{\n\t\t\treturn sum_goal > arg.sum_goal;\n\t\t}\n\t}\n\tbool operator==(const struct Info &arg) const{\n\t\treturn points == arg.points && goal_diff == arg.goal_diff && sum_goal == arg.sum_goal;\n\t}\n\n\tint team_id,points,goal_diff,sum_goal;\n};\n\nstruct Data{\n\tint from_team,to_team;\n};\n\nstruct State{\n\tState(int arg_team_id,int arg_rank){\n\n\t\tteam_id = arg_team_id;\n\t\trank = arg_rank;\n\t}\n\tint team_id,rank;\n};\n\nint num_case;\nchar table[5][25];\ndouble poss_point[9];\nInfo info[5];\nData data[2];\n\n\nint get_point(char buf[3]){\n\n\tint from_point = buf[0]-'0';\n\tint to_point = buf[2]-'0';\n\n\tif(from_point > to_point){\n\n\t\treturn 3;\n\n\t}else if(from_point == to_point){\n\n\t\treturn 1;\n\n\t}else{\n\n\t\treturn 0;\n\t}\n}\n\nint get_diff(char buf[3]){\n\n\tint from_point = buf[0]-'0';\n\tint to_point = buf[2]-'0';\n\n\treturn from_point-to_point;\n}\n\nvoid init(vector<int> member){\n\n\tfor(int i = 0; i < member.size(); i++){\n\t\tinfo[member[i]].points = 0;\n\t\tinfo[member[i]].goal_diff = 0;\n\t\tinfo[member[i]].sum_goal = 0;\n\t}\n}\n\n//最大2位以内を返す関数(1位が2チーム以上あったら、即返却)\nvector<State> select(vector<int> member){\n\n\tInfo tmp_info[5];\n\tfor(int i = 0; i < member.size(); i++){\n\n\t\ttmp_info[member[i]].points = 0;\n\t\ttmp_info[member[i]].goal_diff = 0;\n\t\ttmp_info[member[i]].sum_goal = 0;\n\t\ttmp_info[member[i]].team_id = member[i];\n\t}\n\n\tint tmp_row,tmp_col,tmp;\n\tchar calc_buf[3];\n\n\tfor(int i = 0; i < member.size()-1; i++){\n\t\tfor(int k = i+1; k < member.size(); k++){\n\n\t\t\ttmp_row = member[i];\n\t\t\ttmp_col = 4+5*(member[k]-1);\n\n\t\t\tfor(int a = 2; a <= 4; a++){\n\t\t\t\tcalc_buf[a-2] = table[tmp_row][tmp_col+a];\n\t\t\t}\n\n\t\t\ttmp = get_point(calc_buf);\n\n\t\t\tif(tmp == 1){\n\n\t\t\t\ttmp_info[member[i]].points += 1;\n\t\t\t\ttmp_info[member[k]].points += 1;\n\n\t\t\t}else{\n\n\t\t\t\ttmp_info[member[i]].points += tmp;\n\t\t\t\ttmp_info[member[k]].points += 3-tmp;\n\t\t\t}\n\n\t\t\ttmp = get_diff(calc_buf);\n\n\t\t\ttmp_info[member[i]].goal_diff += tmp;\n\t\t\ttmp_info[member[k]].goal_diff -= tmp;\n\n\t\t\ttmp_info[member[i]].sum_goal += calc_buf[0]-'0';\n\t\t\ttmp_info[member[k]].sum_goal += calc_buf[2]-'0';\n\t\t}\n\t}\n\n\tvector<State> ret;\n\tvector<Info> calc_info;\n\n\tint num = (int)member.size();\n\t//printf(\"num:%d\\n\",num);\n\n\tfor(int i = 0; i < num; i++){\n\t\tcalc_info.push_back(tmp_info[member[i]]);\n\t}\n\n\tsort(calc_info.begin(),calc_info.end());\n\n\tint base_index = 0,rank = 0,right;\n\n\twhile(ret.size() < 2 && rank < 2 && base_index < num){\n\n\t\tret.push_back(State(calc_info[base_index].team_id,rank));\n\n\t\tright = base_index+1;\n\t\tif(right == num)break;\n\n\t\tif(calc_info[base_index] == calc_info[right]){\n\n\t\t\twhile(right < num && calc_info[base_index] == calc_info[right]){\n\t\t\t\tret.push_back(State(calc_info[right].team_id,rank));\n\t\t\t\tright++;\n\t\t\t}\n\t\t\tbase_index = right;\n\n\t\t}else{\n\n\t\t\tbase_index = right;\n\t\t}\n\t\trank++;\n\t}\n\n\treturn ret;\n}\n\nvoid func(){\n\n\tint base_team,work_index,data_index = 0;\n\n\tchar work[3];\n\tvector<int> member;\n\n\tfor(int i = 1; i <= 4; i++){\n\t\tmember.push_back(i);\n\t\tinfo[i].team_id = i;\n\t}\n\n\tinit(member);\n\n\tint from_team,to_team,tmp;\n\n\tfor(int row = 0; row <= NUM; row++){\n\t\tscanf(\"%s\",table[row]);\n\t\tif(table[row][0] == '*'){\n\t\t\tbase_team = row;\n\t\t}\n\n\t\tif(row == 0)continue;\n\n\t\tfrom_team = row;\n\t\tto_team = from_team+1;\n\n\t\tfor(int start_col = 4+5*row; start_col <= 19; start_col += 5,to_team++){\n\n\t\t\tif(table[row][start_col+2] == '_'){ //★結果不明な組合せ★\n\n\t\t\t\tdata[data_index].from_team = from_team;\n\t\t\t\tdata[data_index++].to_team = to_team;\n\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\twork_index = 0;\n\t\t\tfor(int i = 2; i <= 4; i++){\n\t\t\t\twork[work_index++] = table[row][start_col+i];\n\t\t\t}\n\n\t\t\t//勝ち点\n\t\t\ttmp = get_point(work);\n\n\t\t\tif(tmp == 1){\n\n\t\t\t\tinfo[from_team].points += 1;\n\t\t\t\tinfo[to_team].points += 1;\n\n\t\t\t}else{\n\n\t\t\t\tinfo[from_team].points += tmp;\n\t\t\t\tinfo[to_team].points += 3-tmp;\n\t\t\t}\n\n\t\t\t//goal_diff\n\t\t\ttmp = get_diff(work);\n\t\t\tinfo[from_team].goal_diff += tmp;\n\t\t\tinfo[to_team].goal_diff -= tmp;\n\n\t\t\t//goal総数\n\t\t\tinfo[from_team].sum_goal += work[0]-'0';\n\t\t\tinfo[to_team].sum_goal += work[2]-'0';\n\t\t}\n\t}\n\n\tdouble ans = 0;\n\tdouble tmp_poss;\n\n\tvector<State> Top_Group;\n\n\tint tmp_from,tmp_to;\n\tint pre_size,num_decided,tmp_index,num_rank_0;\n\n\tbool check[5];\n\tbool FLG;\n\n\t//未判明の、2試合の得点を全探索\n\tfor(int from_1 = 0; from_1 <= 8;from_1++){\n\t\tfor(int to_1 = 0; to_1 <= 8; to_1++){\n\t\t\tfor(int from_2 = 0; from_2 <= 8; from_2++){\n\t\t\t\tfor(int to_2 = 0; to_2 <= 8; to_2++){\n\n\t\t\t\t\tTop_Group.clear();\n\t\t\t\t\ttmp_poss = 1.0;\n\n\t\t\t\t\t//まず、このトーナメント表が出来上がる確率を求める\n\t\t\t\t\ttmp_poss *= poss_point[from_1];\n\t\t\t\t\ttmp_poss *= poss_point[to_1];\n\t\t\t\t\ttmp_poss *= poss_point[from_2];\n\t\t\t\t\ttmp_poss *= poss_point[to_2];\n\n\t\t\t\t\tmember.clear();\n\t\t\t\t\tfor(int i = 1; i <= 4; i++){\n\t\t\t\t\t\tmember.push_back(i);\n\t\t\t\t\t}\n\n\t\t\t\t\t//★表を完成させる★\n\n\t\t\t\t\tfor(int loop = 0; loop < 2; loop++){\n\n\t\t\t\t\t\tfrom_team = data[loop].from_team;\n\t\t\t\t\t\tto_team = data[loop].to_team;\n\n\t\t\t\t\t\tif(loop == 0){\n\n\t\t\t\t\t\t\ttmp_from = from_1;\n\t\t\t\t\t\t\ttmp_to = to_1;\n\n\t\t\t\t\t\t}else{\n\n\t\t\t\t\t\t\ttmp_from = from_2;\n\t\t\t\t\t\t\ttmp_to = to_2;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t//★テーブルを埋める★\n\t\t\t\t\t\ttable[from_team][4+5*(to_team-1)+2] = '0'+tmp_from;\n\t\t\t\t\t\ttable[from_team][4+5*(to_team-1)+3] = '-';\n\t\t\t\t\t\ttable[from_team][4+5*(to_team-1)+4] = '0'+tmp_to;\n\t\t\t\t\t}\n\n\t\t\t\t\tnum_decided = 0;\n\t\t\t\t\t//上位チームを選んでみる(1回目)\n\t\t\t\t\tTop_Group = select(member);\n\n\t\t\t\t\tFLG = false;\n\n\t\t\t\t\tnum_rank_0 = 0;\n\t\t\t\t\tfor(int k = 0; k < Top_Group.size(); k++){\n\n\t\t\t\t\t\tif(Top_Group[k].rank == 0)num_rank_0++;\n\n\t\t\t\t\t\tif(base_team == Top_Group[k].team_id){\n\t\t\t\t\t\t\ttmp_index = k;\n\t\t\t\t\t\t\tFLG = true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tif(Top_Group.size() == 2){\n\n\t\t\t\t\t\t//上位2チームに入っていればOK、そうでなければ不可\n\t\t\t\t\t\tif(FLG){\n\t\t\t\t\t\t\tans += tmp_poss;\n\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\t//Do nothing\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcontinue;\n\n\t\t\t\t\t}else if(Top_Group.size() == 3){\n\n\t\t\t\t\t\t//★★上位3チームに含まれていなければ不可★★\n\t\t\t\t\t\tif(!FLG)continue;\n\n\t\t\t\t\t\t//★単独1位ならOK★\n\t\t\t\t\t\tif(Top_Group[tmp_index].rank == 0 && num_rank_0 == 1){\n\t\t\t\t\t\t\tans += tmp_poss;\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}else{ //Top_Group.size() == 4\n\n\t\t\t\t\t\t//★単独1位ならOK★\n\t\t\t\t\t\tif(Top_Group[tmp_index].rank == 0 && num_rank_0 == 1){\n\t\t\t\t\t\t\tans += tmp_poss;\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\t//通過or脱落が確定した人物を取り除く\n\t\t\t\t\tif(num_rank_0 == (int)Top_Group.size()){ //1位が3個か4個\n\n\t\t\t\t\t\tif(num_rank_0 == 3){ //1人脱落\n\n\t\t\t\t\t\t\tfor(int k = 1; k <= 4; k++)check[k] = false;\n\n\t\t\t\t\t\t\tfor(int i = 0; i < Top_Group.size(); i++){\n\t\t\t\t\t\t\t\tcheck[Top_Group[i].team_id] = true;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tmember.clear();\n\n\t\t\t\t\t\t\tfor(int k = 1; k <= 4; k++){\n\t\t\t\t\t\t\t\tif(check[k]){\n\t\t\t\t\t\t\t\t\tmember.push_back(k);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t}else{ //1位が4人\n\t\t\t\t\t\t\t//Do nothing\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}else if(num_rank_0 != (int)Top_Group.size()){ //num_rank_0が2以上なら、1ターン目で返る==Top_Groupのサイズと一致する。よって、num_rank_0 == 1\n\n\t\t\t\t\t\t\tfor(int k = 1; k <= 4; k++)check[k] = false;\n\n\t\t\t\t\t\t\tfor(int i = 0; i < Top_Group.size(); i++){\n\t\t\t\t\t\t\t\tcheck[Top_Group[i].team_id] = true;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tmember.clear();\n\n\t\t\t\t\t\t\tfor(int k = 0; k < Top_Group.size(); k++){\n\t\t\t\t\t\t\t\tif(Top_Group[k].rank != 0)continue;\n\n\t\t\t\t\t\t\t\tnum_decided++;\n\t\t\t\t\t\t\t\tcheck[Top_Group[k].team_id] = false; //通過が確定したので集合から除く\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tfor(int k = 1; k <= 4; k++){\n\t\t\t\t\t\t\t\tif(check[k]){\n\t\t\t\t\t\t\t\t\tmember.push_back(k);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tint debug = (int)member.size();\n\t\t\t\t\tpre_size = (int)member.size();\n\n\t\t\t\t\t//★★2位通過が決定するまで、ループ★★\n\t\t\t\t\twhile(true){\n\n\t\t\t\t\t\tTop_Group = select(member);\n\n\t\t\t\t\t\tFLG = false;\n\t\t\t\t\t\tnum_rank_0 = 0;\n\t\t\t\t\t\tfor(int k = 0; k < Top_Group.size(); k++){\n\n\t\t\t\t\t\t\tif(Top_Group[k].rank == 0)num_rank_0++;\n\n\t\t\t\t\t\t\tif(base_team == Top_Group[k].team_id){\n\t\t\t\t\t\t\t\ttmp_index = k;\n\t\t\t\t\t\t\t\tFLG = true;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif(num_decided+(int)Top_Group.size() == 2){ //上位2チーム決定\n\n\t\t\t\t\t\t\tif(FLG){ //上位2チームに含まれれば良い\n\n\t\t\t\t\t\t\t\tans += tmp_poss;\n\n\t\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\t\t//Do nothing\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\t}else if(num_decided+num_rank_0 == 2){ //1位のチームのみ抜き出せば、上位2チーム決定\n\n\t\t\t\t\t\t\tif(FLG == true && Top_Group[tmp_index].rank == 0){ //1位\n\n\t\t\t\t\t\t\t\tans += tmp_poss;\n\n\t\t\t\t\t\t\t}else{ //★他のチームによって枠が取られた場合★\n\n\t\t\t\t\t\t\t\t//Do nothing\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\n\n\t\t\t\t\t\t//通過or脱落が確定した人物を取り除く\n\t\t\t\t\t\tif(num_rank_0 == (int)Top_Group.size()){ //1位が2～4個\n\n\t\t\t\t\t\t\tif(num_rank_0 <= 3){ //1人～2人脱落\n\n\t\t\t\t\t\t\t\tfor(int k = 1; k <= 4; k++)check[k] = false;\n\n\t\t\t\t\t\t\t\tfor(int i = 0; i < Top_Group.size(); i++){\n\t\t\t\t\t\t\t\t\tcheck[Top_Group[i].team_id] = true;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tmember.clear();\n\n\t\t\t\t\t\t\t\tfor(int k = 1; k <= 4; k++){\n\t\t\t\t\t\t\t\t\tif(check[k]){\n\t\t\t\t\t\t\t\t\t\tmember.push_back(k);\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t}else{ //1位が4人\n\t\t\t\t\t\t\t\t//Do nothing\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t}else if(num_rank_0 != Top_Group.size()){\n\n\t\t\t\t\t\t\t\tif(FLG == true && Top_Group[tmp_index].rank == 0){ //単独1位\n\t\t\t\t\t\t\t\t\tans += tmp_poss;\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\tfor(int k = 1; k <= 4; k++)check[k] = false;\n\n\t\t\t\t\t\t\t\tfor(int i = 0; i < member.size(); i++){\n\t\t\t\t\t\t\t\t\tcheck[member[i]] = true;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tmember.clear();\n\n\t\t\t\t\t\t\t\tfor(int k = 0; k < Top_Group.size(); k++){\n\t\t\t\t\t\t\t\t\tif(Top_Group[k].rank != 0)continue;\n\n\t\t\t\t\t\t\t\t\tnum_decided++;\n\t\t\t\t\t\t\t\t\tcheck[Top_Group[k].team_id] = false; //通過が確定したので集合から除く\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\tfor(int k = 1; k <= 4; k++){\n\t\t\t\t\t\t\t\t\tif(check[k]){\n\t\t\t\t\t\t\t\t\t\tmember.push_back(k);\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\n\n\t\t\t\t\t\tif((int)member.size() == pre_size){\n\n\t\t\t\t\t\t\tif(FLG){\n\n\t\t\t\t\t\t\t\tif(num_decided == 1){ //1つ選ぶ\n\n\t\t\t\t\t\t\t\t\tans += tmp_poss/(double)member.size();\n\n\t\t\t\t\t\t\t\t}else{ //★★★2つ選ぶ★★★\n\n\t\t\t\t\t\t\t\t\tans += tmp_poss*2.0/(double)member.size();\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t}else{\n\n\t\t\t\t\t\t\t\t//Do nothing\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tpre_size = (int)member.size();\n\t\t\t\t\t}\n\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tprintf(\"%.10lf\\n\",ans);\n\n}\n\nvoid calc_poss(){\n\n\tint nCm[9][9];\n\n\tfor(int i = 0; i <= 8; i++){\n\t\tfor(int k = 0; k <= 8; k++)nCm[i][k]= 0;\n\t}\n\n\tnCm[0][0] = 1;\n\tfor(int n = 1; n <= 8; n++) {\n\t\tfor (int k = 0; k <= 8; k++) {\n\t\t\tif(k > 0){\n\t\t\t\tnCm[n][k] = nCm[n-1][k]+nCm[n-1][k-1];\n\t\t\t}else{ //k == 0\n\t\t\t\tnCm[n][k] = 1;\n\t\t\t}\n\t\t}\n\t}\n\n\tdouble poss;\n\n\tfor(int point = 0; point <= 8; point++){\n\n\t\tposs = nCm[8][point];\n\n\t\tfor(int i = 0; i < point; i++){\n\t\t\tposs *= 0.25;\n\t\t}\n\t\tfor(int i = 0; i < 8-point; i++){\n\t\t\tposs *= 0.75;\n\t\t}\n\t\tposs_point[point] = poss;\n\t}\n}\n\nint main(){\n\n\tcalc_poss();\n\n\tscanf(\"%d\",&num_case);\n\n\tfor(int loop = 0; loop < num_case; loop++){\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":150,"memory_kb":3252,"score_of_the_acc":-0.2211,"final_rank":7},{"submission_id":"aoj_1234_3075078","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 NUM 4\n\nstruct Info{\n\tbool operator<(const struct Info& arg) const{\n\n\t\tif(points != arg.points){\n\n\t\t\treturn points > arg.points;\n\n\t\t}else if(goal_diff != arg.goal_diff){\n\n\t\t\treturn goal_diff > arg.goal_diff;\n\t\t}else{\n\t\t\treturn sum_goal > arg.sum_goal;\n\t\t}\n\t}\n\tbool operator==(const struct Info &arg) const{\n\t\treturn points == arg.points && goal_diff == arg.goal_diff && sum_goal == arg.sum_goal;\n\t}\n\n\tint team_id,points,goal_diff,sum_goal;\n};\n\nstruct Data{\n\tint from_team,to_team;\n};\n\nstruct State{\n\tState(int arg_team_id,int arg_rank){\n\n\t\tteam_id = arg_team_id;\n\t\trank = arg_rank;\n\t}\n\tint team_id,rank;\n};\n\nint num_case;\nchar table[5][25];\ndouble poss_point[9];\nInfo info[5];\nData data[2];\n\n\nint get_point(char buf[3]){\n\n\tint from_point = buf[0]-'0';\n\tint to_point = buf[2]-'0';\n\n\tif(from_point > to_point){\n\n\t\treturn 3;\n\n\t}else if(from_point == to_point){\n\n\t\treturn 1;\n\n\t}else{\n\n\t\treturn 0;\n\t}\n}\n\nint get_diff(char buf[3]){\n\n\tint from_point = buf[0]-'0';\n\tint to_point = buf[2]-'0';\n\n\treturn from_point-to_point;\n}\n\nvoid init(vector<int> member){\n\n\tfor(int i = 0; i < member.size(); i++){\n\t\tinfo[member[i]].points = 0;\n\t\tinfo[member[i]].goal_diff = 0;\n\t\tinfo[member[i]].sum_goal = 0;\n\t}\n}\n\n//最大2位以内を返す関数(1位が2チーム以上あったら、即返却)\nvector<State> select(vector<int> member){\n\n\tInfo tmp_info[5];\n\tfor(int i = 0; i < member.size(); i++){\n\n\t\ttmp_info[member[i]].points = 0;\n\t\ttmp_info[member[i]].goal_diff = 0;\n\t\ttmp_info[member[i]].sum_goal = 0;\n\t\ttmp_info[member[i]].team_id = member[i];\n\t}\n\n\tint tmp_row,tmp_col,tmp;\n\tchar calc_buf[3];\n\n\tfor(int i = 0; i < member.size()-1; i++){\n\t\tfor(int k = i+1; k < member.size(); k++){\n\n\t\t\ttmp_row = member[i];\n\t\t\ttmp_col = 4+5*(member[k]-1);\n\n\t\t\tfor(int a = 2; a <= 4; a++){\n\t\t\t\tcalc_buf[a-2] = table[tmp_row][tmp_col+a];\n\t\t\t}\n\n\t\t\ttmp = get_point(calc_buf);\n\n\t\t\tif(tmp == 1){\n\n\t\t\t\ttmp_info[member[i]].points += 1;\n\t\t\t\ttmp_info[member[k]].points += 1;\n\n\t\t\t}else{\n\n\t\t\t\ttmp_info[member[i]].points += tmp;\n\t\t\t\ttmp_info[member[k]].points += 3-tmp;\n\t\t\t}\n\n\t\t\ttmp = get_diff(calc_buf);\n\n\t\t\ttmp_info[member[i]].goal_diff += tmp;\n\t\t\ttmp_info[member[k]].goal_diff -= tmp;\n\n\t\t\ttmp_info[member[i]].sum_goal += calc_buf[0]-'0';\n\t\t\ttmp_info[member[k]].sum_goal += calc_buf[2]-'0';\n\t\t}\n\t}\n\n\tvector<State> ret;\n\tvector<Info> calc_info;\n\n\tint num = (int)member.size();\n\t//printf(\"num:%d\\n\",num);\n\n\tfor(int i = 0; i < num; i++){\n\t\tcalc_info.push_back(tmp_info[member[i]]);\n\t}\n\n\tsort(calc_info.begin(),calc_info.end());\n\n\tint base_index = 0,rank = 0,right;\n\n\twhile(ret.size() < 2 && rank < 2 && base_index < num){\n\n\t\tret.push_back(State(calc_info[base_index].team_id,rank));\n\n\t\tright = base_index+1;\n\t\tif(right == num)break;\n\n\t\tif(calc_info[base_index] == calc_info[right]){\n\n\t\t\twhile(right < num && calc_info[base_index] == calc_info[right]){\n\t\t\t\tret.push_back(State(calc_info[right].team_id,rank));\n\t\t\t\tright++;\n\t\t\t}\n\t\t\tbase_index = right;\n\n\t\t}else{\n\n\t\t\tbase_index = right;\n\t\t}\n\t\trank++;\n\t}\n\n\treturn ret;\n}\n\nvoid func(){\n\n\tint base_team,work_index,data_index = 0;\n\n\tchar work[3];\n\tvector<int> member;\n\n\tfor(int i = 1; i <= 4; i++){\n\t\tmember.push_back(i);\n\t\tinfo[i].team_id = i;\n\t}\n\n\tinit(member);\n\n\tint from_team,to_team,tmp;\n\n\tfor(int row = 0; row <= NUM; row++){\n\t\tscanf(\"%s\",table[row]);\n\t\tif(table[row][0] == '*'){\n\t\t\tbase_team = row;\n\t\t}\n\n\t\tif(row == 0)continue;\n\n\t\tfrom_team = row;\n\t\tto_team = from_team+1;\n\n\t\tfor(int start_col = 4+5*row; start_col <= 19; start_col += 5,to_team++){\n\n\t\t\tif(table[row][start_col+2] == '_'){ //★結果不明な組合せ★\n\n\t\t\t\tdata[data_index].from_team = from_team;\n\t\t\t\tdata[data_index++].to_team = to_team;\n\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\twork_index = 0;\n\t\t\tfor(int i = 2; i <= 4; i++){\n\t\t\t\twork[work_index++] = table[row][start_col+i];\n\t\t\t}\n\n\t\t\t//勝ち点\n\t\t\ttmp = get_point(work);\n\n\t\t\tif(tmp == 1){\n\n\t\t\t\tinfo[from_team].points += 1;\n\t\t\t\tinfo[to_team].points += 1;\n\n\t\t\t}else{\n\n\t\t\t\tinfo[from_team].points += tmp;\n\t\t\t\tinfo[to_team].points += 3-tmp;\n\t\t\t}\n\n\t\t\t//goal_diff\n\t\t\ttmp = get_diff(work);\n\t\t\tinfo[from_team].goal_diff += tmp;\n\t\t\tinfo[to_team].goal_diff -= tmp;\n\n\t\t\t//goal総数\n\t\t\tinfo[from_team].sum_goal += work[0]-'0';\n\t\t\tinfo[to_team].sum_goal += work[2]-'0';\n\t\t}\n\t}\n\n\tdouble ans = 0;\n\tdouble tmp_poss;\n\n\tvector<State> Top_Group;\n\n\tint tmp_from,tmp_to;\n\tint pre_size,num_decided,tmp_index,num_rank_0;\n\n\tbool check[5];\n\tbool FLG;\n\n\t//未判明の、2試合の得点を全探索\n\tfor(int from_1 = 0; from_1 <= 8;from_1++){\n\t\tfor(int to_1 = 0; to_1 <= 8; to_1++){\n\t\t\tfor(int from_2 = 0; from_2 <= 8; from_2++){\n\t\t\t\tfor(int to_2 = 0; to_2 <= 8; to_2++){\n\n\t\t\t\t\tTop_Group.clear();\n\t\t\t\t\ttmp_poss = 1.0;\n\n\t\t\t\t\t//まず、このトーナメント表が出来上がる確率を求める\n\t\t\t\t\ttmp_poss *= poss_point[from_1];\n\t\t\t\t\ttmp_poss *= poss_point[to_1];\n\t\t\t\t\ttmp_poss *= poss_point[from_2];\n\t\t\t\t\ttmp_poss *= poss_point[to_2];\n\n\t\t\t\t\tmember.clear();\n\t\t\t\t\tfor(int i = 1; i <= 4; i++){\n\t\t\t\t\t\tmember.push_back(i);\n\t\t\t\t\t}\n\n\t\t\t\t\t//★表を完成させる★\n\n\t\t\t\t\tfor(int loop = 0; loop < 2; loop++){\n\n\t\t\t\t\t\tfrom_team = data[loop].from_team;\n\t\t\t\t\t\tto_team = data[loop].to_team;\n\n\t\t\t\t\t\tif(loop == 0){\n\n\t\t\t\t\t\t\ttmp_from = from_1;\n\t\t\t\t\t\t\ttmp_to = to_1;\n\n\t\t\t\t\t\t}else{\n\n\t\t\t\t\t\t\ttmp_from = from_2;\n\t\t\t\t\t\t\ttmp_to = to_2;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t//★テーブルを埋める★\n\t\t\t\t\t\ttable[from_team][4+5*(to_team-1)+2] = '0'+tmp_from;\n\t\t\t\t\t\ttable[from_team][4+5*(to_team-1)+3] = '-';\n\t\t\t\t\t\ttable[from_team][4+5*(to_team-1)+4] = '0'+tmp_to;\n\t\t\t\t\t}\n\n\t\t\t\t\tnum_decided = 0;\n\t\t\t\t\t//上位チームを選んでみる(1回目)\n\t\t\t\t\tTop_Group = select(member);\n\n\t\t\t\t\tFLG = false;\n\n\t\t\t\t\tnum_rank_0 = 0;\n\t\t\t\t\tfor(int k = 0; k < Top_Group.size(); k++){\n\n\t\t\t\t\t\tif(Top_Group[k].rank == 0)num_rank_0++;\n\n\t\t\t\t\t\tif(base_team == Top_Group[k].team_id){\n\t\t\t\t\t\t\ttmp_index = k;\n\t\t\t\t\t\t\tFLG = true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tif(Top_Group.size() == 2){\n\n\t\t\t\t\t\t//上位2チームに入っていればOK、そうでなければ不可\n\t\t\t\t\t\tif(FLG){\n\t\t\t\t\t\t\tans += tmp_poss;\n\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\t//Do nothing\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcontinue;\n\n\t\t\t\t\t}else if(Top_Group.size() == 3){\n\n\t\t\t\t\t\t//★★上位3チームに含まれていなければ不可★★\n\t\t\t\t\t\tif(!FLG)continue;\n\n\t\t\t\t\t\t//★単独1位ならOK★\n\t\t\t\t\t\tif(Top_Group[tmp_index].rank == 0 && num_rank_0 == 1){\n\t\t\t\t\t\t\tans += tmp_poss;\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}else{ //Top_Group.size() == 4\n\n\t\t\t\t\t\t//★単独1位ならOK★\n\t\t\t\t\t\tif(Top_Group[tmp_index].rank == 0 && num_rank_0 == 1){\n\t\t\t\t\t\t\tans += tmp_poss;\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\t//通過or脱落が確定した人物を取り除く\n\t\t\t\t\tif(num_rank_0 == (int)Top_Group.size()){ //1位が3個か4個\n\n\t\t\t\t\t\tif(num_rank_0 == 3){ //1人脱落\n\n\t\t\t\t\t\t\tfor(int k = 1; k <= 4; k++)check[k] = false;\n\n\t\t\t\t\t\t\tfor(int i = 0; i < Top_Group.size(); i++){\n\t\t\t\t\t\t\t\tcheck[Top_Group[i].team_id] = true;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tmember.clear();\n\n\t\t\t\t\t\t\tfor(int k = 1; k <= 4; k++){\n\t\t\t\t\t\t\t\tif(check[k]){\n\t\t\t\t\t\t\t\t\tmember.push_back(k);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t}else{ //1位が4人\n\t\t\t\t\t\t\t//Do nothing\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}else if(num_rank_0 != (int)Top_Group.size()){ //num_rank_0が2以上なら、1ターン目で返る==Top_Groupのサイズと一致する。よって、num_rank_0 == 1\n\n\t\t\t\t\t\t\tfor(int k = 1; k <= 4; k++)check[k] = false;\n\n\t\t\t\t\t\t\tfor(int i = 0; i < Top_Group.size(); i++){\n\t\t\t\t\t\t\t\tcheck[Top_Group[i].team_id] = true;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tmember.clear();\n\n\t\t\t\t\t\t\tfor(int k = 0; k < Top_Group.size(); k++){\n\t\t\t\t\t\t\t\tif(Top_Group[k].rank != 0)continue;\n\n\t\t\t\t\t\t\t\tnum_decided++;\n\t\t\t\t\t\t\t\tcheck[Top_Group[k].team_id] = false; //通過が確定したので集合から除く\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tfor(int k = 1; k <= 4; k++){\n\t\t\t\t\t\t\t\tif(check[k]){\n\t\t\t\t\t\t\t\t\tmember.push_back(k);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tint debug = (int)member.size();\n\t\t\t\t\tpre_size = (int)member.size();\n\n\t\t\t\t\t//★★2位通過が決定するまで、ループ★★\n\t\t\t\t\twhile(true){\n\n\t\t\t\t\t\tTop_Group = select(member);\n\n\t\t\t\t\t\tFLG = false;\n\t\t\t\t\t\tnum_rank_0 = 0;\n\t\t\t\t\t\tfor(int k = 0; k < Top_Group.size(); k++){\n\n\t\t\t\t\t\t\tif(Top_Group[k].rank == 0)num_rank_0++;\n\n\t\t\t\t\t\t\tif(base_team == Top_Group[k].team_id){\n\t\t\t\t\t\t\t\ttmp_index = k;\n\t\t\t\t\t\t\t\tFLG = true;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif(num_decided+(int)Top_Group.size() == 2){ //上位2チーム決定\n\n\t\t\t\t\t\t\tif(FLG){ //上位2チームに含まれれば良い\n\n\t\t\t\t\t\t\t\tans += tmp_poss;\n\n\t\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\t\t//Do nothing\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\t}else if(num_decided+num_rank_0 == 2){ //1位のチームのみ抜き出せば、上位2チーム決定\n\n\t\t\t\t\t\t\tif(FLG == true && Top_Group[tmp_index].rank == 0){ //1位\n\n\t\t\t\t\t\t\t\tans += tmp_poss;\n\n\t\t\t\t\t\t\t}else{ //★他のチームによって枠が取られた場合★\n\n\t\t\t\t\t\t\t\t//Do nothing\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\n\n\t\t\t\t\t\t//通過or脱落が確定した人物を取り除く\n\t\t\t\t\t\tif(num_rank_0 == (int)Top_Group.size()){ //1位が2～4個\n\n\t\t\t\t\t\t\tif(num_rank_0 <= 1){\n\t\t\t\t\t\t\t\tprintf(\"Screw\\n\");\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tif(num_rank_0 <= 3){ //1人～2人脱落\n\n\t\t\t\t\t\t\t\tfor(int k = 1; k <= 4; k++)check[k] = false;\n\n\t\t\t\t\t\t\t\tfor(int i = 0; i < Top_Group.size(); i++){\n\t\t\t\t\t\t\t\t\tcheck[Top_Group[i].team_id] = true;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tmember.clear();\n\n\t\t\t\t\t\t\t\tfor(int k = 1; k <= 4; k++){\n\t\t\t\t\t\t\t\t\tif(check[k]){\n\t\t\t\t\t\t\t\t\t\tmember.push_back(k);\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t}else{ //1位が4人\n\t\t\t\t\t\t\t\t//Do nothing\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t}else if(num_rank_0 != Top_Group.size()){\n\n\t\t\t\t\t\t\t\tif(num_rank_0 >= 2){\n\t\t\t\t\t\t\t\t\tprintf(\"ABAB498\\n\");\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\tif(FLG == true && Top_Group[tmp_index].rank == 0){ //単独1位\n\t\t\t\t\t\t\t\t\tans += tmp_poss;\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\tfor(int k = 1; k <= 4; k++)check[k] = false;\n\n\t\t\t\t\t\t\t\tfor(int i = 0; i < member.size(); i++){\n\t\t\t\t\t\t\t\t\tcheck[member[i]] = true;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tmember.clear();\n\n\t\t\t\t\t\t\t\tfor(int k = 0; k < Top_Group.size(); k++){\n\t\t\t\t\t\t\t\t\tif(Top_Group[k].rank != 0)continue;\n\n\t\t\t\t\t\t\t\t\tnum_decided++;\n\t\t\t\t\t\t\t\t\tcheck[Top_Group[k].team_id] = false; //通過が確定したので集合から除く\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\tfor(int k = 1; k <= 4; k++){\n\t\t\t\t\t\t\t\t\tif(check[k]){\n\t\t\t\t\t\t\t\t\t\tmember.push_back(k);\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\n\n\t\t\t\t\t\tif((int)member.size() == pre_size){\n\n\t\t\t\t\t\t\tif(FLG){\n\n\t\t\t\t\t\t\t\tif(num_decided == 1){\n\n\t\t\t\t\t\t\t\t\tans += tmp_poss/(double)member.size();\n\n\t\t\t\t\t\t\t\t}else{\n\n\t\t\t\t\t\t\t\t\tans += tmp_poss*2.0/(double)member.size();\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t}else{\n\n\t\t\t\t\t\t\t\t//Do nothing\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tpre_size = (int)member.size();\n\t\t\t\t\t}\n\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tprintf(\"%.10lf\\n\",ans);\n\n}\n\nvoid calc_poss(){\n\n\tint nCm[9][9];\n\n\tfor(int i = 0; i <= 8; i++){\n\t\tfor(int k = 0; k <= 8; k++)nCm[i][k]= 0;\n\t}\n\n\tnCm[0][0] = 1;\n\tfor(int n = 1; n <= 8; n++) {\n\t\tfor (int k = 0; k <= 8; k++) {\n\t\t\tif(k > 0){\n\t\t\t\tnCm[n][k] = nCm[n-1][k]+nCm[n-1][k-1];\n\t\t\t}else{ //k == 0\n\t\t\t\tnCm[n][k] = 1;\n\t\t\t}\n\t\t}\n\t}\n\n\tdouble poss;\n\n\tfor(int point = 0; point <= 8; point++){\n\n\t\tposs = nCm[8][point];\n\n\t\tfor(int i = 0; i < point; i++){\n\t\t\tposs *= 0.25;\n\t\t}\n\t\tfor(int i = 0; i < 8-point; i++){\n\t\t\tposs *= 0.75;\n\t\t}\n\t\tposs_point[point] = poss;\n\t}\n}\n\nint main(){\n\n\tcalc_poss();\n\t//return 0;\n\n\tscanf(\"%d\",&num_case);\n\n\tfor(int loop = 0; loop < num_case; loop++){\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":150,"memory_kb":3112,"score_of_the_acc":-0.0176,"final_rank":1},{"submission_id":"aoj_1234_3040843","code_snippet":"#include <bits/stdc++.h>\n#define double long double\n#define int long long\nusing namespace std;\n\ntypedef pair<int,int> P;\ntypedef pair<string,string> P1;\ntypedef pair<int,string> P2;\ntypedef pair<P,P2> P3;\n\nint fac(int n){\n int res = 1;\n for(int i=1;i<=n;i++) res *= i;\n return res;\n}\n\ndouble get(int i){\n return fac(8) * pow(1.0/4,i) * pow(3.0/4,8-i) / ( fac(i) * fac( 8 - i ) );\n}\n\nstring s[5];\nstring target;\ndouble ans;\n\nvector<P3> calcOrder(set<string> teams){\n \n map<string,int> points, diff, ggoals;\n \n for(int i=0;i<5;i++){\n \n for(int j=0;j<(int)s[i].size();j++){\n \n if( s[i][j] != '-' ) continue;\n \n string t1 = s[i].substr( 1, 3 );\n string t2 = s[0].substr( j - 1, 3 );\n \n if( teams.count(t1) == 0 ) continue;\n if( teams.count(t2) == 0 ) continue;\n \n int t1p = s[i][j-1] - '0';\n int t2p = s[i][j+1] - '0';\n \n if( t1p > t2p ) points[t1] += 3;\n if( t1p == t2p ) points[t1]++, points[t2]++;\n if( t1p < t2p ) points[t2] += 3;\n \n diff[t1] += t1p - t2p;\n diff[t2] += t2p - t1p;\n \n ggoals[t1] += t1p;\n ggoals[t2] += t2p;\n \n }\n \n }\n \n vector<P3> res;\n \n for(string team : teams){\n res.push_back(P3(P(points[team],diff[team]),P2(ggoals[team],team)));\n }\n \n sort( res.begin(), res.end(), greater<P3>() );\n \n return res;\n}\n\nvoid cal(double p){\n \n set<string> teams;\n \n for(int i=0;i<5;i++){\n \n for(int j=0;j<(int)s[i].size();j++){\n \n if( s[i][j] != '-' ) continue;\n \n string t1 = s[i].substr( 1, 3 );\n string t2 = s[0].substr( j - 1, 3 );\n \n teams.insert(t1);\n teams.insert(t2);\n \n }\n \n }\n \n vector<P3> order = calcOrder( teams );\n \n int cnt = 5, add = 0, L, R;\n \n while(cnt--){\n \n int A, B, C;\n \n for(int i=0;i<(int)order.size();i++){\n \n if( order[i].second.second == target ){\n\tA = order[i].first.first;\n\tB = order[i].first.second;\n\tC = order[i].second.first;\n }\n \n }\n \n int l = 4, r = 0;\n \n for(int i=0;i<(int)order.size();i++){\n \n if( A == order[i].first.first && B == order[i].first.second && C == order[i].second.first ){\n \n\tl = min( l, i );\n\tr = max( r, i );\n \n }\n \n }\n \n teams.clear();\n \n for(int i=l;i<=r;i++) teams.insert( order[i].second.second );\n \n add += l;\n \n L = l, R = r;\n \n order = calcOrder( teams );\n \n }\n \n if( L == R ){\n \n if( add <= 1 ) ans += p;\n \n }else{\n \n if( add <= 1 ){\n \n double chance = 1 - add + 1;\n double all = R - L + 1;\n \n ans += p * chance / all;\n \n }\n \n }\n \n}\n\nvector<P> YX;\n\nsigned main(){\n \n int T;\n cin>>T;\n \n while(T--){\n \n YX.clear();\n ans = 0;\n \n for(int i=0;i<5;i++) cin>>s[i];\n \n for(int i=0;i<(int)s[0].size();i++){\n if( s[0][i] == '*' ) target = s[0].substr( i + 1, 3 );\n }\n \n for(int i=0;i<5;i++){\n for(int j=0;j<(int)s[i].size();j++){\n\tif( s[i][j] == '-' && s[i][j-1] == '_' ) YX.push_back(P(i,j-1));\n\n\tif( s[i][j] == '-' && s[i][j+1] == '_' ) YX.push_back(P(i,j+1));\n }\n }\n \n for(int i=0;i<=8;i++){\n for(int j=0;j<=8;j++){\n\tfor(int k=0;k<=8;k++){\n\t for(int l=0;l<=8;l++){\n\t \n\t s[YX[0].first][YX[0].second] = i + '0';\n\t s[YX[1].first][YX[1].second] = j + '0';\n\t s[YX[2].first][YX[2].second] = k + '0';\n\t s[YX[3].first][YX[3].second] = l + '0';\n\t \n\t cal( get(i) * get(j) * get(k) * get(l) );\n\t \n\t }\n\t}\n }\n }\n \n printf(\"%.7Lf\\n\", ans);\n\n }\n \n return 0;\n}","accuracy":1,"time_ms":5180,"memory_kb":3472,"score_of_the_acc":-1.5233,"final_rank":20},{"submission_id":"aoj_1234_2996375","code_snippet":"#include <bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\nusing namespace std;\ntypedef pair<int,int>P;\ntypedef pair<P,P>P2;\n#define F first\n#define S second\nint a[4][4],kati[4],goal[4],goaled[4],gdiff[4],id;\nstring s[5];\nvoid Perse(){\n\tmemset(a,0,sizeof(a));\n\ta[0][1]=s[1][11]-'0';\n\ta[0][2]=s[1][16]-'0';\n\ta[0][3]=s[1][21]-'0';\n\ta[1][0]=s[1][13]-'0';\n\ta[1][2]=s[2][16]-'0';\n\ta[1][3]=s[2][21]-'0';\n\ta[2][0]=s[1][18]-'0';\n\ta[2][1]=s[2][18]-'0';\n\ta[2][3]=s[3][21]-'0';\n\ta[3][0]=s[1][23]-'0';\n\ta[3][1]=s[2][23]-'0';\n\ta[3][2]=s[3][23]-'0';\n\tr(i,5)if(s[i][0]=='*')id=i-1;\n}\nvector<P>use;\nvoid FILL(vector<char> v){\n\tint c=0;\n\tif(s[1][11]=='_')s[1][11]=v[c++],use.push_back(P(1,11));\n\tif(s[1][16]=='_')s[1][16]=v[c++],use.push_back(P(1,16));\n\tif(s[1][21]=='_')s[1][21]=v[c++],use.push_back(P(1,21));\n\tif(s[1][13]=='_')s[1][13]=v[c++],use.push_back(P(1,13));\n\tif(s[2][16]=='_')s[2][16]=v[c++],use.push_back(P(2,16));\n\tif(s[2][21]=='_')s[2][21]=v[c++],use.push_back(P(2,21));\n\tif(s[1][18]=='_')s[1][18]=v[c++],use.push_back(P(1,18));\n\tif(s[2][18]=='_')s[2][18]=v[c++],use.push_back(P(2,18));\n\tif(s[3][21]=='_')s[3][21]=v[c++],use.push_back(P(3,21));\n\tif(s[1][23]=='_')s[1][23]=v[c++],use.push_back(P(1,23));\n\tif(s[2][23]=='_')s[2][23]=v[c++],use.push_back(P(2,23));\n\tif(s[3][23]=='_')s[3][23]=v[c++],use.push_back(P(3,23));\n}\n\nvoid calc(vector<int> v){\n\tmemset(kati,0,sizeof(kati));\n\tmemset(goal,0,sizeof(goal));\n\tmemset(gdiff,0,sizeof(gdiff));\n\tmemset(goaled,0,sizeof(goaled));\n\tint c[4]={};\n\tr(i,v.size())c[v[i]]=1;\n\tr(i,4)if(c[i]){\n\t\tr(j,4)if(c[j])if(i!=j){\n\t\t\tif(a[i][j]>a[j][i])kati[i]+=3;\n\t\t\telse if(a[i][j]==a[j][i])kati[i]+=1;\n\t\t\tgoal[i]+=a[i][j];\n\t\t\tgoaled[i]+=a[j][i];\n\t\t}\n\t\tgdiff[i]=goal[i]-goaled[i];\n\t}\n}\n\nvoid END(){\n\texit(0);\n}\n\ndouble get_score(){\n\tPerse();\n\tvector<int>v;\n\tint ue=0;\n\tr(i,4)v.push_back(i);\n\tint CC=10;\n\twhile(CC--){\n\t\tcalc(v);\n\t\tvector<P2>sco;\n\t\tr(i,v.size()){\n\t\t\tsco.push_back(P2(P(kati[v[i]],gdiff[v[i]]),P(goal[v[i]],v[i])));\n\t\t}\n\t\tsort(sco.begin(),sco.end(),greater<P2>());\n\t\tint cnt=0;\n\t\tvector<int>vip[4];\n\t\tvip[0].push_back(sco[0].S.S);\n\t\tr(i,sco.size()-1){\n\t\t\tif(sco[i].F.F==sco[i+1].F.F&&\n\t\t\t\tsco[i].F.S==sco[i+1].F.S&&\n\t\t\t\t\tsco[i].S.F==sco[i+1].S.F){\n\t\t\t\t\t\tvip[cnt].push_back(sco[i+1].S.S);\n\t\t\t\t\t}\n\t\t\telse{\n\t\t\t\tvip[++cnt].push_back(sco[i+1].S.S);\n\t\t\t}\n\t\t}\n\t\tv.clear();\n\t\tr(i,4){\n\t\t\tr(j,vip[i].size()){\n\t\t\t\tif(vip[i][j]==id){\n\t\t\t\t\tif(i==0&&vip[i].size()==1){\n\t\t\t\t\t\tif(ue<=1)return 1;\n\t\t\t\t\t\telse return 0;\n\t\t\t\t\t}\n\t\t\t\t\tr(k,vip[i].size()){\n\t\t\t\t\t\tv.push_back(vip[i][k]);\n\t\t\t\t\t}\n\t\t\t\t\tgoto L;\n\t\t\t\t}\n\t\t\t}\n\t\t\tue+=vip[i].size();\n\t\t}\n\t\tL:;\n\t}\n\treturn (2.0-ue)/v.size();\n}\ndouble kai[10];\nint main(){\n\tint test;\n\tcin>>test;\n\tkai[0]=kai[1]=1;\n\tfor(int i=2;i<10;i++) kai[i]=kai[i-1]*i;\n\twhile(test--){\n\t\tdouble ans=0;\n\t\tr(i,5)cin>>s[i];\n\t\tr(i,9)r(j,9)r(k,9)r(l,9){\n\t\t\tdouble d1=(kai[8]/(kai[i]*kai[8-i]))*pow(0.25,i)*pow(0.75,8-i);\n\t\t\tdouble d2=(kai[8]/(kai[j]*kai[8-j]))*pow(0.25,j)*pow(0.75,8-j);\n\t\t\tdouble d3=(kai[8]/(kai[k]*kai[8-k]))*pow(0.25,k)*pow(0.75,8-k);\n\t\t\tdouble d4=(kai[8]/(kai[l]*kai[8-l]))*pow(0.25,l)*pow(0.75,8-l);\n\t\t\tvector<char>v;\n\t\t\tv.push_back(char(i+'0'));\n\t\t\tv.push_back(char(j+'0'));\n\t\t\tv.push_back(char(k+'0'));\n\t\t\tv.push_back(char(l+'0'));\n\t\t\tFILL(v);\n\t\t\tans+=d1*d2*d3*d4*get_score();\n\t\t\tr(m,4){\n\t\t\t\ts[use[m].F][use[m].S]='_';\n\t\t\t}\n\t\t\tuse.clear();\n\t\t}\n\t\tprintf(\"%.9f\\n\",ans);\n\t}\n}","accuracy":1,"time_ms":390,"memory_kb":3276,"score_of_the_acc":-0.3028,"final_rank":11},{"submission_id":"aoj_1234_2832654","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing pii = pair<int, int>;\n\nstruct team {\n int id;\n int goal, score, goal_diff;\n\n team() : id(-1), goal(0), score(0), goal_diff(0) {}\n\n bool operator<(const team& t) const {\n if(score != t.score) return score < t.score;\n if(goal_diff != t.goal_diff) return goal_diff < t.goal_diff;\n return goal < t.goal;\n }\n bool operator==(const team& t) const {\n return score == t.score && goal_diff == t.goal_diff && goal == t.goal;\n }\n};\n\nint main() {\n cout << fixed << setprecision(7);\n\n vector<double> possibility(9);\n vector<double> fact(9, 1);\n for(int i = 2; i <= 8; ++i) {\n fact[i] = fact[i - 1] * i;\n }\n for(int i = 0; i <= 8; ++i) {\n possibility[i] = fact[8] / fact[i] / fact[8 - i] * pow(0.25, i) * pow(0.75, 8 - i);\n }\n\n int T;\n cin >> T;\n while(T--) {\n int target = 0;\n vector<team> teams(4);\n vector<vector<int>> goal(4, vector<int>(4));\n for(int i = 0; i < 4; ++i) {\n teams[i].id = i;\n }\n\n auto calc_scores = [](team& t1, team& t2, int g1, int g2) {\n t1.goal += g1;\n t1.goal_diff += g1 - g2;\n t2.goal += g2;\n t2.goal_diff += g2 - g1;\n if(g1 > g2) {\n t1.score += 3;\n } else if(g2 > g1) {\n t2.score += 3;\n } else {\n t1.score += 1;\n t2.score += 1;\n }\n };\n\n vector<pii> not_yet;\n for(int i = 0; i < 5; ++i) {\n string s;\n cin >> s;\n if(s[0] == '*') {\n target = i - 1;\n }\n if(i == 0) continue;\n for(int j = 6 + i * 5; j <= 21; j += 5) {\n int a = i - 1, b = (j - 6) / 5;\n if(s[j] == '_') {\n not_yet.emplace_back(a, b);\n continue;\n }\n calc_scores(teams[a], teams[b], s[j] - '0', s[j + 2] - '0');\n goal[a][b] = s[j] - '0';\n goal[b][a] = s[j + 2] - '0';\n }\n }\n assert(not_yet.size() == 2);\n\n function<double(vector<team>, int, int)> order = [&](vector<team> teams, int rest, int prev_size) {\n const int n = teams.size();\n double res = 0;\n sort(rbegin(teams), rend(teams));\n for(int i = 0; i < n && rest > 0; ++i) {\n vector<team> concerned(1);\n concerned[0].id = teams[i].id;\n while(i + 1 < n && teams[i] == teams[i + 1]) {\n team new_team;\n new_team.id = teams[++i].id;\n concerned.push_back(move(new_team));\n }\n const int m = concerned.size();\n\n if(m == prev_size) {\n bool found = false;\n for(auto& t : concerned) {\n found |= t.id == target;\n }\n\n return found ? min((double)rest / m, 1.0) : 0.0;\n } else {\n for(int ti = 0; ti < m; ++ti) {\n for(int tj = ti + 1; tj < m; ++tj) {\n const int i1 = concerned[ti].id, i2 = concerned[tj].id;\n calc_scores(concerned[ti], concerned[tj], goal[i1][i2], goal[i2][i1]);\n }\n }\n res += order(concerned, rest, m);\n }\n\n rest -= m;\n }\n\n return res;\n };\n\n double ans = 0;\n for(int i = 0; i <= 8; ++i) {\n for(int j = 0; j <= 8; ++j) {\n for(int k = 0; k <= 8; ++k) {\n for(int l = 0; l <= 8; ++l) {\n const int a = not_yet[0].first, b = not_yet[0].second;\n const int c = not_yet[1].first, d = not_yet[1].second;\n auto tmp_teams = teams;\n calc_scores(tmp_teams[a], tmp_teams[b], i, j);\n calc_scores(tmp_teams[c], tmp_teams[d], k, l);\n goal[a][b] = i, goal[b][a] = j;\n goal[c][d] = k, goal[d][c] = l;\n ans += order(tmp_teams, 2, 4) * possibility[i] * possibility[j] * possibility[k] * possibility[l];\n }\n }\n }\n }\n\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":150,"memory_kb":3420,"score_of_the_acc":-0.4653,"final_rank":16},{"submission_id":"aoj_1234_2709754","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <utility>\n#include <iomanip>\nusing namespace std;\ndouble fact(int n){\n if(n==0) return 1;\n return n*fact(n-1);\n}\n\ndouble solve(int t, int r, vector<int> tl, vector<vector<int> > &score){\n int n = tl.size();\n vector<int> gp(n, 0), gd(n, 0), gn(n, 0);\n vector<pair<pair<pair<int,int>, int>, int> > cmp(n);\n for(int i=0; i<n; i++){\n for(int j=i+1; j<n; j++){\n int ti = tl[i], tj = tl[j];\n gd[i] += score[ti][tj] -score[tj][ti];\n gd[j] += score[tj][ti] -score[ti][tj];\n gn[i] += score[ti][tj];\n gn[j] += score[tj][ti];\n if(score[ti][tj] < score[tj][ti]){\n gp[j] += 3;\n }else if(score[ti][tj] > score[tj][ti]){\n gp[i] += 3;\n }else{\n gp[i]++;\n gp[j]++;\n }\n }\n }\n for(int i=0; i<n; i++){\n cmp[i] = make_pair(make_pair(make_pair(-gp[i], -gd[i]), -gn[i]), i);\n }\n sort(cmp.begin(), cmp.end());\n vector<int> ord(n);\n for(int i=0; i<n; i++) ord[i] = cmp[i].second;\n\n int samecount=1;\n int start=0;\n for(int i=1; i<n; i++){\n if(gp[ord[i]]==gp[ord[0]] && gd[ord[i]]==gd[ord[0]] && gn[ord[i]]==gn[ord[0]]){\n samecount++;\n }else{\n break;\n }\n }\n if(samecount==n){\n return (double)r/n;\n }\n\n if(samecount==1 && r==2){\n if(tl[ord[0]]==t){\n return 1;\n }else{\n start = 1;\n samecount = 1;\n r--;\n for(int i=2; i<n; i++){\n if(gp[ord[i]]==gp[ord[1]] && gd[ord[i]]==gd[ord[1]] && gn[ord[i]]==gn[ord[1]]){\n samecount++;\n }else{\n break;\n }\n }\n }\n }\n\n for(int i=start+samecount; i<n; i++){\n if(tl[ord[i]] == t) return 0;\n }\n if(samecount==r){\n return 1;\n }\n vector<int> ntl(samecount);\n for(int i=0; i<samecount; i++){\n ntl[i] = tl[ord[start +i]];\n }\n return solve(t, r, ntl, score);\n}\n\nint main(){\n double table[9];\n for(int i=0; i<=8; i++){\n table[i] = fact(8) /(fact(i)*fact(8-i)) *pow(0.25, i) *pow(0.75, 8-i);\n }\n cout << fixed;\n cout << setprecision(7);\n \n int ds;\n cin >> ds;\n for(int r=0; r<ds; r++){\n string s;\n cin >> s;\n int t;\n vector<vector<int> > score(4, vector<int>(4, 0));\n vector<vector<int> > emp(2);\n for(int i=0; i<4; i++){\n cin >> s;\n if(s[0]=='*') t=i;\n for(int j=i+1; j<4; j++){\n int fs = 6 +5*j;\n int ss = fs +2;\n if(s[fs]=='_'){\n emp[0].push_back(i);\n emp[1].push_back(j);\n }else{\n score[i][j] = s[fs]-'0';\n score[j][i] = s[ss]-'0';\n }\n }\n }\n\n double ans=0;\n vector<int> tl(4);\n for(int i=0; i<4; i++) tl[i]=i;\n for(int i=0; i<=8; i++){\n for(int j=0; j<=8; j++){\n for(int k=0; k<=8; k++){\n for(int l=0; l<=8; l++){\n score[emp[0][0]][emp[1][0]] = i;\n score[emp[1][0]][emp[0][0]] = j;\n score[emp[0][1]][emp[1][1]] = k;\n score[emp[1][1]][emp[0][1]] = l;\n ans += table[i]*table[j]*table[k]*table[l] *solve(t, 2, tl, score);\n }\n }\n }\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":120,"memory_kb":3212,"score_of_the_acc":-0.1571,"final_rank":5}],"string":"[\n {\n \"submission_id\": \"aoj_1234_4943973\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i,n) for (int i = 0; i < (n); ++i)\\n#define Inf 1000000000\\n\\nvector<double> p(9);\\n\\nvector<vector<string>> get(vector<pair<pair<string,string>,pair<int,int>>> S){\\n\\n\\tmap<string,vector<int>> mp;\\n\\tvector<int> base(3,0);\\n\\trep(i,S.size()){\\n\\t\\tmp[S[i].first.first]=base;\\n\\t\\tmp[S[i].first.second]=base;\\n\\t}\\n\\t\\n\\trep(i,S.size()){\\n\\t\\tstring TeamA = S[i].first.first;\\n\\t\\tstring TeamB = S[i].first.second;\\n\\t\\tint A = S[i].second.first;\\n\\t\\tint B = S[i].second.second;\\n\\t\\t\\n\\t\\tif(A==B){\\n\\t\\t\\tmp[TeamA][0]++;\\n\\t\\t\\tmp[TeamB][0]++;\\n\\t\\t}\\n\\t\\telse if(A>B){\\n\\t\\t\\tmp[TeamA][0]+=3;\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\tmp[TeamB][0]+=3;\\n\\t\\t}\\n\\t\\t\\n\\t\\tmp[TeamA][1]+=A-B;\\n\\t\\tmp[TeamB][1]+=B-A;\\n\\t\\t\\n\\t\\tmp[TeamA][2]+=A;\\n\\t\\tmp[TeamB][2]+=B;\\n\\t}\\n\\t\\n\\tvector<pair<vector<int>,string>> V;\\n\\tfor(auto a:mp){\\n\\t\\tV.emplace_back(a.second,a.first);\\n\\t}\\n\\t\\n\\tsort(V.rbegin(),V.rend());\\n\\t\\n\\tvector<vector<string>> ret;\\n\\trep(i,V.size()){\\n\\t\\tif(i==0 || V[i-1].first!=V[i].first){\\n\\t\\t\\tret.push_back(vector<string>(1,V[i].second));\\n\\t\\t}\\n\\t\\telse ret.back().push_back(V[i].second);\\n\\t}\\n\\t\\n\\tif(ret.size()==1)return ret;\\n\\tvector<vector<string>> temp;\\n\\trep(i,ret.size()){\\n\\t\\tif(ret[i].size()==1){\\n\\t\\t\\ttemp.push_back(ret[i]);\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tsort(ret[i].begin(),ret[i].end());\\n\\t\\tvector<pair<pair<string,string>,pair<int,int>>> nS;\\n\\t\\trep(j,S.size()){\\n\\t\\t\\tstring x = S[j].first.first,y = S[j].first.second;\\n\\t\\t\\tif(binary_search(ret[i].begin(),ret[i].end(),x)&&binary_search(ret[i].begin(),ret[i].end(),y)){\\n\\t\\t\\t\\tnS.push_back(S[j]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvector<vector<string>> X = get(nS);\\n\\t\\trep(j,X.size()){\\n\\t\\t\\ttemp.push_back(X[j]);\\n\\t\\t}\\n\\t}\\n\\t\\n\\treturn temp;\\n\\t\\n}\\n\\ndouble get(vector<string> S){\\n\\tvector<string> names(4);\\n\\tstring target;\\n\\trep(i,4){\\n\\t\\tnames[i] = S[i+1].substr(1,3);\\n\\t\\tif(S[i+1][0]=='*'){\\n\\t\\t\\ttarget = names[i];\\n\\t\\t}\\n\\t}\\n\\n\\tvector<pair<pair<string,string>,pair<int,int>>> matches;\\n\\tvector<int> emp;\\n\\trep(i,4){\\n\\t\\trep(j,4){\\n\\t\\t\\tif(i>=j)continue;\\n\\t\\t\\tchar c0 = S[i+1][6+j*5],c1 = S[i+1][6+j*5+2];\\n\\t\\t\\tif(c0=='_'){\\n\\t\\t\\t\\temp.push_back(matches.size());\\n\\t\\t\\t\\tmatches.emplace_back(make_pair(names[i],names[j]),make_pair(-1,-1));\\n\\t\\t\\t}\\n\\t\\t\\telse matches.emplace_back(make_pair(names[i],names[j]),make_pair(c0-'0',c1-'0'));\\n\\t\\t}\\n\\t}\\n\\n\\tdouble ret = 0.0;\\n\\trep(i,9){\\n\\t\\trep(j,9){\\n\\t\\t\\trep(k,9){\\n\\t\\t\\t\\trep(l,9){\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tmatches[emp[0]].second.first = i;\\n\\t\\t\\t\\t\\tmatches[emp[0]].second.second = j;\\n\\t\\t\\t\\t\\tmatches[emp[1]].second.first = k;\\n\\t\\t\\t\\t\\tmatches[emp[1]].second.second = l;\\n\\t\\t\\t\\t\\tdouble P = p[i]*p[j]*p[k]*p[l];\\n\\t\\t\\t\\t\\tvector<string> temp;\\n\\t\\t\\t\\t\\tvector<vector<string>> result = get(matches);\\n\\t\\t\\t\\t\\tif(result[0].size()==1){\\n\\t\\t\\t\\t\\t\\tif(result[0][0]==target){\\n\\t\\t\\t\\t\\t\\t\\tret += P;\\n\\t\\t\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\t\\t\\ttemp = result[1];\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse temp = result[0];\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tbool f = false;\\n\\t\\t\\t\\t\\trep(x,temp.size()){\\n\\t\\t\\t\\t\\t\\tif(temp[x]==target){\\n\\t\\t\\t\\t\\t\\t\\tf=true;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif(f){\\n\\t\\t\\t\\t\\t\\tif(result[0].size()==1)ret += P / (double)temp.size();\\n\\t\\t\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\t\\t\\tdouble s = temp.size();\\n\\t\\t\\t\\t\\t\\t\\tret += P * (1.0-(s-1.0) * (s-2.0) / s / (s-1.0));\\n\\t\\t\\t\\t\\t\\t}\\n\\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\\treturn ret;\\n\\t\\n}\\n\\nint main(){\\n\\t\\n\\trep(i,9){\\n\\t\\tp[i] = pow(0.25,i);\\n\\t\\tp[i] *= pow(0.75,8-i);\\n\\t\\trep(j,8){\\n\\t\\t\\tp[i] *= j+1;\\n\\t\\t}\\n\\t\\trep(j,i){\\n\\t\\t\\tp[i] /= j+1;\\n\\t\\t}\\n\\t\\trep(j,8-i){\\n\\t\\t\\tp[i] /= j+1;\\n\\t\\t}\\n\\t}\\n\\t\\n\\tint t;\\n\\tcin>>t;\\n\\t\\n\\trep(_,t){\\n\\t\\tvector<string> S(5);\\n\\t\\trep(i,5)cin>>S[i];\\n\\t\\t\\n\\t\\tcout<<fixed<<setprecision(10)<<get(S)<<endl;\\n\\t}\\n\\t\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1040,\n \"memory_kb\": 3800,\n \"score_of_the_acc\": -1.1914,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1234_4868319\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint M[4][4];\\ndouble score[9];\\ndouble p;\\n\\nint check(int n,vector<int> a,int id){\\n\\tint m=a.size();\\n\\tvector<int> P(m),GD(m),GS(m);\\n\\tfor(int i=0;i<m;i++){\\n\\t\\tfor(int j=i+1;j<m;j++){\\n\\t\\t\\tint k=a[i],l=a[j];\\n\\t\\t\\tif(M[k][l]>M[l][k])P[i]+=3;\\n\\t\\t\\telse if(M[k][l]==M[l][k])P[i]++,P[j]++;\\n\\t\\t\\telse P[j]+=3;\\n\\t\\t\\tGD[i]+=M[k][l]-M[l][k],GD[j]+=M[l][k]-M[k][l];\\n\\t\\t\\tGS[i]+=M[k][l],GS[j]+=M[l][k];\\n\\t\\t}\\n\\t}\\n\\tvector<pair<pair<int,int>,pair<int,int>>> v;\\n\\tfor(int i=0;i<m;i++){\\n\\t\\tv.push_back(make_pair(make_pair(P[i],GD[i]),make_pair(GS[i],a[i])));\\n\\t}\\n\\tsort(v.rbegin(), v.rend());\\n\\tint cnt=0; bool flag=false;\\n\\tvector<int> na;\\n\\tfor(int i=0;i<m;i++){\\n\\t\\tif(v[i].first.first==v[0].first.first and v[i].first.second==v[0].first.second and v[i].second.first==v[0].second.first){\\n\\t\\t\\tcnt++; na.push_back(v[i].second.second);\\n\\t\\t\\tif(v[i].second.second==id)flag=true;\\n\\t\\t}\\n\\t}\\n\\tif(cnt<=n and flag)return 1;\\n\\tif(cnt>=n and !flag)return 0;\\n\\tif(cnt==1 and n==2 and !flag){\\n\\t\\tna.pop_back();\\n\\t\\tfor(int i=1;i<m;i++){\\n\\t\\t\\tif(v[i].first.first==v[1].first.first and v[i].first.second==v[1].first.second and v[i].second.first==v[1].second.first){\\n\\t\\t\\t\\tna.push_back(v[i].second.second);\\n\\t\\t\\t\\tif(v[i].second.second==id)flag=true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(!flag)return 0;\\n\\t\\telse if(na.size()==1)return 1;\\n\\t\\telse return check(1,na,id);\\n\\t}\\n\\telse{\\n\\t\\tif(m==(int)na.size()){\\n\\t\\t\\tp*=(double)n;\\n\\t\\t\\treturn (int)na.size();\\n\\t\\t}\\n\\t\\telse return check(n,na,id);\\n\\t}\\n}\\n\\nvoid solve(){\\n\\tstring T; cin >> T;\\n\\tint id=-1;\\n\\tfor(int i=0,j=0;i<4&&j<T.size();){\\n\\t\\tif(T[j]=='_')j++;\\n\\t\\telse if(T[j]=='*')id=i,j++;\\n\\t\\telse i++,j+=3;\\n\\t}\\n\\tvector<string> s(4);\\n\\tfor(int i=0;i<4;i++) cin >> s[i];\\n\\tvector<int> r;\\n\\tfor(int i=0;i<4;i++){\\n\\t\\tfor(int j=i+1;j<4;j++){\\n\\t\\t\\tif(s[i][j*5+6]=='_'){\\n\\t\\t\\t\\tr.push_back(i);r.push_back(j);\\n\\t\\t\\t}\\n\\t\\t\\telse{\\n\\t\\t\\t\\tint s1=s[i][j*5+6]-'0', s2=s[i][j*5+8]-'0';\\n\\t\\t\\t\\tM[i][j]=s1, M[j][i]=s2;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tdouble res=0.0;\\n\\tfor(int i=0;i<=8;i++){\\n\\t\\tfor(int j=0;j<=8;j++){\\n\\t\\t\\tfor(int k=0;k<=8;k++){\\n\\t\\t\\t\\tfor(int l=0;l<=8;l++){\\n\\t\\t\\t\\t\\tp=score[i]*score[j]*score[k]*score[l];\\n\\t\\t\\t\\t\\tM[r[0]][r[1]]=i,M[r[1]][r[0]]=j,M[r[2]][r[3]]=k,M[r[3]][r[2]]=l;\\n\\t\\t\\t\\t\\tvector<int> a={0,1,2,3};\\n\\t\\t\\t\\t\\tint t=check(2,a,id);\\n\\t\\t\\t\\t\\tif(t){\\n\\t\\t\\t\\t\\t\\tp/=(double)t;\\n\\t\\t\\t\\t\\t\\tres+=p;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tprintf(\\\"%.7f\\\\n\\\",res);\\n}\\n\\nint main(){\\n\\t// 前計算\\n\\tconst int base=1*2*3*4*5*6*7*8;\\n\\tfor(int i=0;i<=8;i++){\\n\\t\\tdouble res=base;\\n\\t\\tfor(int j=1;j<=i;j++){\\n\\t\\t\\tres/=(double)j;\\n\\t\\t\\tres*=(0.25);\\n\\t\\t}\\n\\t\\tfor(int j=1;j<=8-i;j++){\\n\\t\\t\\tres/=(double)j;\\n\\t\\t\\tres*=(0.75);\\n\\t\\t}\\n\\t\\tscore[i]=res;\\n\\t}\\n\\tint q; cin >> q;\\n\\twhile(q--)solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 3136,\n \"score_of_the_acc\": -0.072,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1234_4811441\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <sstream>\\n#include <stack>\\n#include <algorithm>\\n#include <cmath>\\n#include <queue>\\n#include <bitset>\\n#include <iomanip>\\n#include <limits>\\n#include <chrono>\\n#include <random>\\n#include <array>\\n#include <unordered_map>\\n#include <functional>\\n#include <complex>\\n#include <numeric>\\n#include <cctype>\\n#include <map>\\n#include <set>\\n#include <cstdlib>\\n#include <bitset>\\n#include <tuple>\\n#include <assert.h>\\n#include <deque>\\n#include <utility>\\n\\n\\nusing namespace std;\\ntypedef long long ll;\\n\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\ntemplate<typename T> T gcd(T a, T b) { a = abs(a), b = abs(b); while (b > 0) { tie(a, b) = make_pair(b, a % b); } return a; }\\n//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());\\n\\nconstexpr long long INF = 1LL << 60;\\nconstexpr int inf = 1000000007;\\nconstexpr long long mod = 1000000007LL;\\n//constexpr long long mod = 998244353LL;\\n\\nusing Real = double;\\nvector<int> hidx = { 1,1,1,2,2,3 };\\nvector<int> widx = { 11,16,21,16,21,21 };\\nvector<Real> p(10);\\nint tidx[50][50];\\n\\nstruct Data {\\n\\tint score, diff, goal, id;\\n\\tData() = default;\\n\\tData(int score, int diff, int goal, int id) :score(score), diff(diff), goal(goal), id(id) {}\\n\\tbool operator<(const Data& d)const {\\n\\t\\treturn make_tuple(score, diff, goal) < make_tuple(d.score, d.diff, d.goal);\\n\\t}\\n\\tbool operator>(const Data& d)const {\\n\\t\\treturn make_tuple(score, diff, goal) > make_tuple(d.score, d.diff, d.goal);\\n\\t}\\n\\tbool operator==(const Data& d)const {\\n\\t\\treturn make_tuple(score, diff, goal) == make_tuple(d.score, d.diff, d.goal);\\n\\t}\\n};\\n\\nvoid calc_data(Data& a, Data& b, int af, int bf) {\\n\\ta.diff += af - bf;\\n\\tb.diff += bf - af;\\n\\ta.goal += af;\\n\\tb.goal += bf;\\n\\tif (af == bf) {\\n\\t\\ta.score += 1;\\n\\t\\tb.score += 1;\\n\\t}\\n\\telse if (af > bf) {\\n\\t\\ta.score += 3;\\n\\t}\\n\\telse {\\n\\t\\tb.score += 3;\\n\\t}\\n}\\nReal calc(array<string, 5>& vs, int my) {\\n\\tvector<bool> bad(4); int cnt = 0;\\n\\tbool tw = false;\\n\\t{\\n\\t\\tvector<Data> d(4); for (int i = 0; i < 4; i++) d[i].id = i;\\n\\t\\tfor (int i = 0; i < 6; i++) {\\n\\t\\t\\tint f = vs[hidx[i]][widx[i]] - '0';\\n\\t\\t\\tint s = vs[hidx[i]][widx[i] + 2] - '0';\\n\\t\\t\\tint fi = tidx[hidx[i]][widx[i]];\\n\\t\\t\\tint si = tidx[hidx[i]][widx[i] + 2];\\n\\t\\t\\tcalc_data(d[fi], d[si], f, s);\\n\\t\\t}\\n\\t\\tsort(d.rbegin(), d.rend());\\n\\n\\t\\tif (d[0] == d.back()) return 0.5;\\n\\t\\telse if (d[0] == d[2]) {\\n\\t\\t\\tif (d[3].id == my) return 0.0;\\n\\t\\t\\tcnt = 2;\\n\\t\\t\\tbad[d[3].id] = true;\\n\\t\\t}\\n\\t\\telse if (d[0] == d[1]) {\\n\\t\\t\\tif (d[0].id == my or d[1].id == my) return 1.0;\\n\\t\\t\\telse return 0.0;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tif (d[0].id == my) return 1.0;\\n\\t\\t\\tif (d[1] > d[2]) {\\n\\t\\t\\t\\tif (d[1].id == my) return 1.0;\\n\\t\\t\\t\\telse return 0.0;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tif (d[2] > d[3]) {\\n\\t\\t\\t\\t\\tif (d[3].id == my) return 0.0;\\n\\t\\t\\t\\t\\tcnt = 1;\\n\\t\\t\\t\\t\\tbad[d[0].id] = true;\\n\\t\\t\\t\\t\\tbad[d[3].id] = true;\\n\\t\\t\\t\\t\\ttw = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tcnt = 1;\\n\\t\\t\\t\\t\\tbad[d[0].id] = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif (!tw) {\\n\\t\\tvector<Data> d(4);\\n\\t\\tfor (int i = 0; i < 4; i++) {\\n\\t\\t\\td[i].id = i;\\n\\t\\t\\tif (bad[i]) d[i].score -= 100000;\\n\\t\\t}\\n\\t\\tfor (int i = 0; i < 6; i++) {\\n\\t\\t\\tint f = vs[hidx[i]][widx[i]] - '0';\\n\\t\\t\\tint s = vs[hidx[i]][widx[i] + 2] - '0';\\n\\t\\t\\tint fi = tidx[hidx[i]][widx[i]];\\n\\t\\t\\tint si = tidx[hidx[i]][widx[i] + 2];\\n\\t\\t\\tif (bad[fi] or bad[si]) continue;\\n\\t\\t\\tcalc_data(d[fi], d[si], f, s);\\n\\t\\t}\\n\\t\\tsort(d.rbegin(), d.rend());\\n\\t\\td.pop_back();\\n\\t\\tif (d[0] == d.back()) return (Real)cnt / 3.0;\\n\\t\\telse if (d[0] == d[1]) {\\n\\t\\t\\tif (d[2].id == my) return 0.0;\\n\\t\\t\\telse if (cnt == 2) return 1.0;\\n\\t\\t\\telse {\\n\\t\\t\\t\\ttw = true;\\n\\t\\t\\t\\tbad[d[2].id] = true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tif (d[0].id == my) return 1.0;\\n\\t\\t\\telse if (cnt == 1) return 0.0;\\n\\t\\t\\telse {\\n\\t\\t\\t\\tif (d[1] > d[2]) {\\n\\t\\t\\t\\t\\tif (d[1].id == my) return 1.0;\\n\\t\\t\\t\\t\\telse return 0.0;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tcnt = 1;\\n\\t\\t\\t\\t\\ttw = true;\\n\\t\\t\\t\\t\\tbad[d[0].id] = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tvector<Data> d(4);\\n\\tfor (int i = 0; i < 4; i++) {\\n\\t\\td[i].id = i;\\n\\t\\tif (bad[i]) d[i].score -= 100000;\\n\\t}\\n\\tfor (int i = 0; i < 6; i++) {\\n\\t\\tint f = vs[hidx[i]][widx[i]] - '0';\\n\\t\\tint s = vs[hidx[i]][widx[i] + 2] - '0';\\n\\t\\tint fi = tidx[hidx[i]][widx[i]];\\n\\t\\tint si = tidx[hidx[i]][widx[i] + 2];\\n\\t\\tif (bad[fi] or bad[si]) continue;\\n\\t\\tcalc_data(d[fi], d[si], f, s);\\n\\t}\\n\\tsort(d.rbegin(), d.rend());\\n\\td.pop_back(); d.pop_back();\\n\\tif (d[0] == d[1]) return 1.0 / 2.0;\\n\\telse if (d[0].id == my) return 1.0;\\n\\telse return 0.0;\\n}\\n\\n\\nvoid solve() {\\n\\tarray<string, 5> vs; for (int i = 0; i < 5; i++) cin >> vs[i];\\n\\tvector<pair<int, int>> r;\\n\\tint my = -1;\\n\\tfor (int i = 1; i < 5; i++) if (vs[i][0] == '*') my = i - 1;\\n\\tReal res = 0.0;\\n\\tfor (int i = 0; i < 6; i++) {\\n\\t\\tif (vs[hidx[i]][widx[i]] == '_') {\\n\\t\\t\\tr.emplace_back(hidx[i], widx[i]);\\n\\t\\t\\tr.emplace_back(hidx[i], widx[i] + 2);\\n\\t\\t}\\n\\t}\\n\\tint t[4];\\n\\tfor (t[0] = 0; t[0] < 9; t[0]++)for (t[1] = 0; t[1] < 9; t[1]++)for (t[2] = 0; t[2] < 9; t[2]++) for (t[3] = 0; t[3] < 9; t[3]++) {\\n\\t\\tfor (int i = 0; i < 4; i++) vs[r[i].first][r[i].second] = (char)('0' + t[i]);\\n\\t\\tres += calc(vs, my) * p[t[0]] * p[t[1]] * p[t[2]] * p[t[3]];\\n\\t\\tfor (int i = 0; i < 4; i++) vs[r[i].first][r[i].second] = '_';\\n\\t}\\n\\tcout << fixed << setprecision(12) << res << \\\"\\\\n\\\";\\n}\\nint main()\\n{\\n\\n\\tcin.tie(nullptr);\\n\\tios::sync_with_stdio(false);\\n\\n\\tvector<Real> f(10); f[0] = f[1] = 1; for (int i = 2; i < 10; i++) f[i] = f[i - 1] * i;\\n\\tfor (int i = 0; i < 9; i++) {\\n\\t\\tp[i] = f[8] / (f[i] * f[8 - i]) * pow(0.25, i) * pow(0.75, 8 - i);\\n\\t}\\n\\tfor (int i = 0; i < 6; i++) {\\n\\t\\ttidx[hidx[i]][widx[i]] = hidx[i] - 1;\\n\\t\\ttidx[hidx[i]][widx[i] + 2] = (widx[i] - 6) / 5;\\n\\t}\\n\\tint kkt; cin >> kkt; while (kkt--) solve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3416,\n \"score_of_the_acc\": -0.4419,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1234_4806732\",\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\\nvector<long double>p(9);\\n\\nstruct Team {\\n\\tvector<int>a, b, c;\\n\\tint index;\\n\\tTeam() {\\n\\t\\ta.resize(4);\\n\\t\\tb.resize(4);\\n\\t\\tc.resize(4);\\n\\t}\\n};\\n\\nint Check_min(Team s, Team t, int bit = 15) {\\n\\tint sa, sb, sc, ta, tb, tc;\\n\\tsa = sb = sc = ta = tb = tc = 0;\\n\\tfor (int i = 0; i < 4; i++) {\\n\\t\\tfor (int j = 0; j < 4; j++) {\\n\\t\\t\\tif ((bit >> j) & 1) {\\n\\t\\t\\t\\tsa += s.a[j];\\n\\t\\t\\t\\tsb += s.b[j];\\n\\t\\t\\t\\tsc += s.c[j];\\n\\t\\t\\t\\tta += t.a[j];\\n\\t\\t\\t\\ttb += t.b[j];\\n\\t\\t\\t\\ttc += t.c[j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tauto sbox = make_pair(sa, make_pair(sb, sc));\\n\\tauto tbox = make_pair(ta, make_pair(tb, tc));\\n\\tif (sbox < tbox)return 0;\\n\\tif (sbox == tbox)return 1;\\n\\treturn 2;\\n}\\n\\nlong double Check(vector<vector<int>>plus, vector<pair<int, int>>vp, vector<int>num, int cnt) {\\n\\tfor (int i = 0; i < 4; i++) {\\n\\t\\tplus[vp[i].first][vp[i].second] = num[i];\\n\\t}\\n\\tvector<Team>team(4);\\n\\tfor (int i = 0; i < 4; i++) {\\n\\t\\tteam[i].index = i;\\n\\t\\tfor (int j = i + 1; j < 4; j++) {\\n\\t\\t\\tteam[i].b[j] += plus[i][j];\\n\\t\\t\\tteam[i].b[j] -= plus[j][i];\\n\\t\\t\\tteam[j].b[i] += plus[j][i];\\n\\t\\t\\tteam[j].b[i] -= plus[i][j];\\n\\t\\t\\tteam[i].c[j] += plus[i][j];\\n\\t\\t\\tteam[j].c[i] += plus[j][i];\\n\\t\\t\\tif (plus[i][j] > plus[j][i]) {\\n\\t\\t\\t\\tteam[i].a[j] = 3;\\n\\t\\t\\t}\\n\\t\\t\\telse if (plus[i][j] == plus[j][i]) {\\n\\t\\t\\t\\tteam[i].a[j] = team[j].a[i] = 1;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tteam[j].a[i] = 3;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor (int i = 0; i < 4; i++) {\\n\\t\\tfor (int j = 0; j < 3; j++) {\\n\\t\\t\\tauto c = Check_min(team[j], team[j + 1]);\\n\\t\\t\\tif (c == 0)swap(team[j], team[j + 1]);\\n\\t\\t}\\n\\t}\\n\\tif (Check_min(team[0], team[3]) == 1)return 0.5;\\n\\tif (Check_min(team[0], team[2]) == 1) {\\n\\t\\tif (team[3].index == cnt)return 0;\\n\\t\\tint bit = 0;\\n\\t\\tfor (int i = 0; i < 3; i++) {\\n\\t\\t\\tbit |= 1 << team[i].index;\\n\\t\\t}\\n\\t\\tfor (int i = 0; i < 3; i++) {\\n\\t\\t\\tfor (int j = 0; j < 2; j++) {\\n\\t\\t\\t\\tif (Check_min(team[j], team[j + 1], bit) == 0)swap(team[j], team[j + 1]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (Check_min(team[0], team[2], bit) == 1)return (long double)2 / 3;\\n\\t\\tif (Check_min(team[0], team[1], bit) == 1) {\\n\\t\\t\\tif (team[2].index == cnt)return 0;\\n\\t\\t\\treturn 1;\\n\\t\\t}\\n\\t\\tif (Check_min(team[1], team[2]) == 1) {\\n\\t\\t\\tif (team[0].index == cnt)return 1;\\n\\t\\t\\tbit = 1 << team[1].index;\\n\\t\\t\\tbit |= 1 << team[2].index;\\n\\t\\t\\tif (Check_min(team[1], team[2], bit) == 0)swap(team[1], team[2]);\\n\\t\\t\\tif (Check_min(team[1], team[2], bit) == 1)return 0.5;\\n\\t\\t\\tif (team[1].index == cnt)return 1;\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t\\tif (team[2].index == cnt)return 0;\\n\\t\\treturn 1;\\n\\t}\\n\\tif (Check_min(team[1], team[3]) == 1) {\\n\\t\\tif (team[0].index == cnt)return 1;\\n\\t\\tint bit = 0;\\n\\t\\tfor (int i = 1; i < 4; i++) {\\n\\t\\t\\tbit |= 1 << team[i].index;\\n\\t\\t}\\n\\t\\tfor (int i = 0; i < 3; i++) {\\n\\t\\t\\tfor (int j = 1; j < 3; j++) {\\n\\t\\t\\t\\tif (Check_min(team[j], team[j + 1], bit) == 0)swap(team[j], team[j + 1]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (Check_min(team[1], team[3], bit) == 1)return (long double)1 / 3;\\n\\t\\tif (Check_min(team[2], team[3], bit) == 1) {\\n\\t\\t\\tif (team[1].index == cnt)return 1;\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t\\tif (Check_min(team[1], team[2]) == 1) {\\n\\t\\t\\tif (team[3].index == cnt)return 0;\\n\\t\\t\\tbit = 1 << team[1].index;\\n\\t\\t\\tbit |= 1 << team[2].index;\\n\\t\\t\\tif (Check_min(team[1], team[2], bit) == 0)swap(team[1], team[2]);\\n\\t\\t\\tif (Check_min(team[1], team[2], bit) == 1)return 0.5;\\n\\t\\t\\tif (team[1].index == cnt)return 1;\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t\\tif (team[1].index == cnt)return 1;\\n\\t\\treturn 0;\\n\\t}\\n\\tif (Check_min(team[1], team[2]) == 1) {\\n\\t\\tif (team[0].index == cnt)return 1;\\n\\t\\tif (team[3].index == cnt)return 0;\\n\\t\\tint bit = 1 << team[1].index;\\n\\t\\tbit |= 1 << team[2].index;\\n\\t\\tif (Check_min(team[1], team[2], bit) == 1)return 0.5;\\n\\t\\tif (Check_min(team[1], team[2], bit) == 0)swap(team[1], team[2]);\\n\\t\\tif (team[1].index == cnt)return 1;\\n\\t\\treturn 0;\\n\\t}\\n\\tif (team[0].index == cnt || team[1].index == cnt)return 1;\\n\\treturn 0;\\n}\\n\\nlong double Solve() {\\n\\tvector<string>s(5);\\n\\tfor (auto &i : s)cin >> i;\\n\\tint cnt = -1;\\n\\tfor (int i = 1; i < s.size(); i++) {\\n\\t\\tif (s[i][0] == '*')cnt = i - 1;\\n\\t}\\n\\tvector<vector<int>>plus(4, vector<int>(4));\\n\\tvector<pair<int, int>>vp;\\n\\tfor (int i = 0; i < 4; i++) {\\n\\t\\tfor (int j = i + 1; j < 4; j++) {\\n\\t\\t\\tif (s[i + 1][j * 5 + 6] == '_') {\\n\\t\\t\\t\\tvp.push_back({ i,j });\\n\\t\\t\\t\\tvp.push_back({ j,i });\\n\\t\\t//\\t\\tcout << i << \\\" \\\" << j << endl;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tplus[i][j] = s[i + 1][j * 5 + 6] - '0';\\n\\t\\t\\t\\tplus[j][i] = s[i + 1][j * 5 + 8] - '0';\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tvector<int>num(4);\\n\\tlong double ret = 0;\\n\\twhile (num[0] < 9) {\\n\\t\\tauto by = Check(plus, vp, num, cnt);\\n\\t\\tret += p[num[0]] * p[num[1]] * p[num[2]] * p[num[3]] * by;\\n\\t\\tnum.back()++;\\n\\t\\tint c = 3;\\n\\t\\twhile (c&&num[c] > 8) {\\n\\t\\t\\tnum[c--] = 0;\\n\\t\\t\\tnum[c]++;\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\n\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\n\\tfor (int i = 0; i <= 8; i++) {\\n\\t\\tp[i] = 1;\\n\\t\\tfor (int j = 2; j <= 8; j++)p[i] *= j;\\n\\t\\tfor (int j = 1; j <= i; j++) {\\n\\t\\t\\tp[i] /= j;\\n\\t\\t}\\n\\t\\tfor (int j = 1; j <= 8 - i; j++) {\\n\\t\\t\\tp[i] /= j;\\n\\t\\t\\tp[i] *= 3;\\n\\t\\t}\\n\\t\\tfor (int j = 1; j <= 8; j++)p[i] /= 4;\\n\\t}\\n\\tcin >> T;\\n\\twhile (T--) {\\n\\t\\tauto box = Solve();\\n\\t\\tcout << setprecision(20) << box << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2120,\n \"memory_kb\": 3308,\n \"score_of_the_acc\": -0.6872,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1234_4765387\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint main(){\\n cout << fixed << setprecision(7);\\n vector<int> fact(9);\\n fact[0] = 1;\\n for (int i = 1; i < 9; i++){\\n fact[i]= fact[i - 1] * i;\\n }\\n vector<double> p(9);\\n for (int i = 0; i < 9; i++){\\n p[i] = (double) fact[8] / fact[i] / fact[8 - i] * pow(0.25, i) * pow(0.75, 8 - i);\\n }\\n int t;\\n cin >> t;\\n for (int i = 0; i < t; i++){\\n vector<string> S(5);\\n for (int j = 0; j < 5; j++){\\n cin >> S[j];\\n }\\n vector<vector<int>> score(4, vector<int>(4, -1));\\n for (int j = 0; j < 4; j++){\\n for (int k = j + 1; k < 4; k++){\\n char c1 = S[j + 1][k * 5 + 6];\\n if (c1 != '_'){\\n score[j][k] = c1 - '0';\\n }\\n char c2 = S[j + 1][k * 5 + 8];\\n if (c2 != '_'){\\n score[k][j] = c2 - '0';\\n }\\n }\\n }\\n vector<pair<int, int>> s;\\n for (int j = 0; j < 4; j++){\\n for (int k = 0; k < 4; k++){\\n if (j != k){\\n if (score[j][k] == -1){\\n s.push_back(make_pair(j, k));\\n }\\n }\\n }\\n }\\n int team;\\n for (int j = 0; j < 4; j++){\\n if (S[j + 1][0] == '*'){\\n team = j;\\n }\\n }\\n double ans = 0;\\n vector<int> r(4);\\n for (r[0] = 0; r[0] <= 8; r[0]++){\\n for (r[1] = 0; r[1] <= 8; r[1]++){\\n for (r[2] = 0; r[2] <= 8; r[2]++){\\n for (r[3] = 0; r[3] <= 8; r[3]++){\\n double tmp = 1;\\n for (int j = 0; j < 4; j++){\\n tmp *= p[r[j]];\\n }\\n vector<vector<int>> result = score;\\n for (int j = 0; j < 4; j++){\\n result[s[j].first][s[j].second] = r[j];\\n }\\n vector<set<int>> rank(1);\\n for (int j = 0; j < 4; j++){\\n rank[0].insert(j);\\n }\\n while (1){\\n bool update = false;\\n vector<set<int>> rank2;\\n vector<int> points(4, 0);\\n vector<int> gdiff(4, 0);\\n vector<int> goals(4, 0);\\n int cnt = rank.size();\\n for (int j = 0; j < cnt; j++){\\n int sz = rank[j].size();\\n for (int k = 0; k < 4; k++){\\n for (int l = k + 1; l < 4; l++){\\n if (rank[j].count(k) && rank[j].count(l)){\\n if (result[k][l] > result[l][k]){\\n points[k] += 3;\\n } else if (result[k][l] < result[l][k]){\\n points[l] += 3;\\n } else {\\n points[k]++;\\n points[l]++;\\n }\\n gdiff[k] += result[k][l] - result[l][k];\\n gdiff[l] += result[l][k] - result[k][l];\\n goals[k] += result[k][l];\\n goals[l] += result[l][k];\\n }\\n }\\n }\\n map<tuple<int, int, int>, set<int>> mp;\\n for (int k : rank[j]){\\n mp[make_tuple(points[k], gdiff[k], goals[k])].insert(k);\\n }\\n if (mp.size() > 1){\\n update = true;\\n }\\n for (auto itr = mp.rbegin(); itr != mp.rend(); itr++){\\n rank2.push_back((*itr).second);\\n }\\n }\\n if (!update){\\n break;\\n } else {\\n swap(rank, rank2);\\n }\\n }\\n if (rank[0].count(team)){\\n if (rank[0].size() <= 2){\\n ans += tmp;\\n } else {\\n ans += tmp * 2 / rank[0].size();\\n }\\n } else if (rank[0].size() == 1 && rank[1].count(team)){\\n ans += tmp / rank[1].size();\\n }\\n }\\n }\\n }\\n }\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1230,\n \"memory_kb\": 3412,\n \"score_of_the_acc\": -0.6646,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1234_4745741\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i))\\n#define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i))\\n#define rep(i, n) For((i), 0, (n))\\n#define rrep(i, n) rFor((i), (n), 0)\\n#define fi first\\n#define se second\\nusing namespace std;\\ntypedef long long lint;\\ntypedef unsigned long long ulint;\\ntypedef pair<int, int> pii;\\ntypedef pair<lint, lint> pll;\\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(a>b){a=b; return true;} return false;}\\ntemplate<class T> T div_floor(T a, T b){\\n if(b < 0) a *= -1, b *= -1;\\n return a>=0 ? a/b : (a+1)/b-1;\\n}\\ntemplate<class T> T div_ceil(T a, T b){\\n if(b < 0) a *= -1, b *= -1;\\n return a>0 ? (a-1)/b+1 : a/b;\\n}\\n\\nconstexpr lint mod = 1000000007;\\nconstexpr lint INF = mod * mod;\\nconstexpr int MAX = 100010;\\n\\nint myteam;\\npii board[4][4];\\ndouble fact[10], prob[10];\\ndouble ans;\\n\\nvector<int> order(int S){\\n vector<int> point(4, 0), diff(4, 0), score(4, 0);\\n vector<int> id;\\n rep(i, 4)if(S>>i & 1) id.push_back(i);\\n rep(x, 4)if(S>>x & 1){\\n For(y, x+1, 4)if(S>>y & 1){\\n int s, t;\\n tie(s, t) = board[x][y];\\n score[x] += s; score[y] += t;\\n diff[x] += s - t; diff[y] += t - s;\\n\\n if(s > t) point[x] += 3;\\n else if(s < t) point[y] += 3;\\n else point[x] += 1, point[y] += 1;\\n }\\n }\\n auto cmp = [&](const int &i, const int &j){\\n if(point[i] != point[j]) return point[i] > point[j];\\n if(diff[i] != diff[j]) return diff[i] > diff[j];\\n return score[i] > score[j];\\n };\\n sort(id.begin(), id.end(), cmp);\\n\\n vector<int> pri(4, -1);\\n int cur = 0;\\n for(int l=0; l<(int)id.size();){\\n int r = l;\\n int T = 0;\\n while(r < (int)id.size() && !cmp(id[l], id[r])){\\n T |= (1 << id[r]);\\n ++r;\\n }\\n if(r - l == 1 || S == T){\\n For(i, l, r) pri[id[i]] = cur;\\n ++cur;\\n }\\n else{\\n auto p = order(T);\\n int ncur = cur + 1;\\n For(i, l, r) pri[id[i]] = cur + p[id[i]], chmax(ncur, pri[id[i]] + 1);\\n cur = ncur;\\n }\\n l = r;\\n }\\n\\n return pri;\\n}\\n\\nvoid dfs(int cur, double p){\\n if(cur == 2){\\n auto pri = order((1<<4)-1);\\n int mypos, cnt[4];\\n rep(i, 4) cnt[i] = 0;\\n rep(i, 4){\\n if(i == myteam) mypos = pri[i];\\n ++cnt[pri[i]];\\n }\\n\\n if(mypos == 0) p *= min(1.0, 2.0 / (double)cnt[0]);\\n else if(mypos == 1 && (int)cnt[0] < 2){\\n p *= 1.0 / (double)cnt[1];\\n }\\n else p = 0;\\n\\n ans += p;\\n return;\\n }\\n\\n rep(x, 4)For(y, x+1, 4)if(board[x][y].fi < 0){\\n rep(s, 9)rep(t, 9){\\n board[x][y] = {s, t};\\n dfs(cur + 1, p * prob[s] * prob[t]);\\n }\\n board[x][y] = {-1, -1};\\n return;\\n }\\n}\\n\\nvoid solve(){\\n char gomi, name[5];\\n rep(i, 4) scanf(\\\" %c\\\", &gomi);\\n rep(i, 4){\\n rep(j, 5) scanf(\\\" %c\\\", &name[j]);\\n if(name[1] == '*') myteam = i;\\n }\\n\\n rep(i, 4)rep(j, 4) board[i][j] = {-1, -1};\\n rep(i, 4){\\n char gomi, result[5];\\n rep(k, 4) scanf(\\\" %c\\\", &gomi);\\n rep(j, 4){\\n rep(k, 5) scanf(\\\" %c\\\", &result[k]);\\n if(isdigit(result[2])){\\n board[i][j] = {result[2] - '0', result[4] - '0'};\\n }\\n }\\n }\\n\\n ans = 0;\\n dfs(0, 1.0);\\n printf(\\\"%.10lf\\\\n\\\", ans);\\n}\\n\\nint main(){\\n fact[0] = 1;\\n For(i, 1, 10) fact[i] = fact[i-1] * i;\\n rep(p, 9){\\n prob[p] = 40320 / fact[p] / fact[8-p] * pow(0.25, p) * pow(0.75, 8-p);\\n }\\n int t;\\n scanf(\\\"%d\\\", &t);\\n rep(tt, t){\\n solve();\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 3412,\n \"score_of_the_acc\": -0.4536,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1234_4683852\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef int64_t Int;\\n#define all(x) (x).begin(), (x).end()\\n \\nconst double EPS = 1e-10;\\nconst Int INF = 1e18;\\nconst int inf = 1e9;\\nconst Int mod = 1e9+7;\\n\\nbool print_space_enable = false;\\nvoid print() { \\n cout << endl; \\n print_space_enable = false;\\n}\\n\\ntemplate <class Head, class... Tail>\\nvoid print(Head&& head, Tail&&... tail) {\\n if (print_space_enable) cout << \\\" \\\";\\n cout << fixed << setprecision(7) << head;\\n print_space_enable = true;\\n print(std::forward<Tail>(tail)...);\\n}\\n\\ntemplate<typename T>\\nvoid print(vector<T> v) {\\n for (size_t i = 0; i < v.size(); i++) {\\n if (i > 0) std::cout << \\\" \\\";\\n std::cout << v[i];\\n }\\n std::cout << std::endl;\\n}\\n\\ndouble pro[10];\\npair<Int, Int> score[5][5];\\n\\nvoid calc_pro() {\\n double x[10];\\n x[0] = x[1] = 1.0;\\n for (int i = 1; i <= 8; i++) {\\n x[i + 1] = x[i] * (double)(i + 1);\\n }\\n for (int i = 0; i <= 8; i++) {\\n pro[i] = x[8] / (x[i] * x[8 - i]);\\n for (int j = 0; j < i; j++) {\\n pro[i] *= 1.0 / 4.0;\\n }\\n for (int j = 0; j < 8 - i; j++) {\\n pro[i] *= 3.0 / 4.0;\\n }\\n }\\n}\\n\\nvoid s(vector<vector<Int>> &v, Int x) {\\n for (Int i = 0; i < (Int)v.size(); i++) {\\n for (Int j = 0; j < (Int)v.size() - 1; j++) {\\n if (v[j][x] < v[j + 1][x]) {\\n swap(v[j], v[j + 1]);\\n }\\n }\\n }\\n}\\n\\ndouble f(vector<vector<Int>> v, Int check_team) {\\n s(v, 2);\\n s(v, 1);\\n s(v, 0);\\n vector<Int> rank[4];\\n rank[0].push_back(v[0][3]);\\n Int pre = 0;\\n for (Int i = 1; i < 4; i++) {\\n if (v[i - 1][0] == v[i][0] and v[i - 1][1] == v[i][1] and v[i - 1][2] == v[i][2]) {\\n rank[pre].push_back(v[i][3]);\\n } else {\\n pre++;\\n rank[pre].push_back(v[i][3]);\\n }\\n }\\n if (rank[0].size() == 4) {\\n return 1.0 / 2.0;\\n }\\n if (rank[0].size() == 3) {\\n if (rank[1][0] == check_team) {\\n return 0.0;\\n } else {\\n Int ex = rank[1][0];\\n Int mp[4];\\n for (Int i = 0; i < 4; i++) {\\n mp[v[i][3]] = i;\\n }\\n for (Int i = 0; i < 4; i++) {\\n if (i == ex) continue;\\n Int a = score[ex][i].first;\\n Int b = score[ex][i].second;\\n if (a < b) {\\n v[mp[i]][0] -= 3;\\n }\\n if (a == b) {\\n v[mp[i]][0] -= 1;\\n }\\n v[mp[i]][1] -= b - a;\\n v[mp[i]][2] -= b;\\n }\\n vector<vector<Int>> v2;\\n for (Int i = 0; i < 4; i++) {\\n if (v[i][3] == ex) continue;\\n v2.push_back(v[i]);\\n }\\n s(v2, 2);\\n s(v2, 1);\\n s(v2, 0);\\n vector<Int> rank2[3];\\n rank2[0].push_back(v2[0][3]);\\n Int pre = 0;\\n for (Int i = 1; i < 3; i++) {\\n if (v2[i - 1][0] == v2[i][0] and v2[i - 1][1] == v2[i][1] and v2[i - 1][2] == v2[i][2]) {\\n rank2[pre].push_back(v2[i][3]);\\n } else {\\n pre++;\\n rank2[pre].push_back(v2[i][3]);\\n }\\n }\\n if (rank2[0].size() == 3) {\\n return 2.0 / 3.0;\\n }\\n if (rank2[0].size() == 2) {\\n if (rank2[1][0] == check_team) {\\n return 0.0;\\n } else {\\n return 1.0;\\n }\\n }\\n if (rank2[0].size() == 1) {\\n if (rank2[0][0] == check_team) {\\n return 1.0;\\n } else {\\n if (rank2[1].size() == 1) {\\n if (rank2[1][0] == check_team) {\\n return 1.0;\\n } else {\\n return 0.0;\\n }\\n } else {\\n assert(rank2[1].size() == 2);\\n Int a = score[rank2[1][0]][rank2[1][1]].first;\\n Int b = score[rank2[1][0]][rank2[1][1]].second;\\n if (a == b) {\\n return 1.0 / 2.0;\\n } else {\\n if ((a > b and rank2[1][0] == check_team) or (a < b and rank2[1][1] == check_team)) {\\n return 1.0;\\n } else {\\n return 0.0;\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n if (rank[0].size() == 2) {\\n if (rank[0][0] == check_team or rank[0][1] == check_team) {\\n return 1.0;\\n } else {\\n return 0.0;\\n }\\n }\\n if (rank[0].size() == 1) {\\n if (rank[0][0] == check_team) {\\n return 1.0;\\n } else {\\n if (rank[1].size() == 3) {\\n Int ex = rank[0][0];\\n Int mp[4];\\n for (Int i = 0; i < 4; i++) {\\n mp[v[i][3]] = i;\\n }\\n for (Int i = 0; i < 4; i++) {\\n if (i == ex) continue;\\n Int a = score[ex][i].first;\\n Int b = score[ex][i].second;\\n if (a < b) {\\n v[mp[i]][0] -= 3;\\n }\\n if (a == b) {\\n v[mp[i]][0] -= 1;\\n }\\n v[mp[i]][1] -= b - a;\\n v[mp[i]][2] -= b;\\n }\\n vector<vector<Int>> v2;\\n for (Int i = 0; i < 4; i++) {\\n if (v[i][3] == ex) continue;\\n v2.push_back(v[i]);\\n }\\n s(v2, 2);\\n s(v2, 1);\\n s(v2, 0);\\n vector<Int> rank2[3];\\n rank2[0].push_back(v2[0][3]);\\n Int pre = 0;\\n for (Int i = 1; i < 3; i++) {\\n if (v2[i - 1][0] == v2[i][0] and v2[i - 1][1] == v2[i][1] and v2[i - 1][2] == v2[i][2]) {\\n rank2[pre].push_back(v2[i][3]);\\n } else {\\n pre++;\\n rank2[pre].push_back(v2[i][3]);\\n }\\n }\\n if (rank2[0].size() == 3) {\\n return 1.0 / 3.0;\\n }\\n if (rank2[0].size() == 2) {\\n if (rank2[1][0] == check_team) {\\n return 0.0;\\n } else {\\n Int a = score[rank2[0][0]][rank2[0][1]].first;\\n Int b = score[rank2[0][0]][rank2[0][1]].second;\\n if (a == b) {\\n return 1.0 / 2.0;\\n } else {\\n if ((a > b and rank2[0][0] == check_team) or (a < b and rank2[0][1] == check_team)) { \\n return 1.0;\\n } else {\\n return 0.0;\\n }\\n }\\n }\\n }\\n if (rank2[0].size() == 1) {\\n if (rank2[0][0] == check_team) {\\n return 1.0;\\n } else {\\n return 0.0;\\n }\\n }\\n }\\n if (rank[1].size() == 2) {\\n if (rank[2][0] == check_team) {\\n return 0.0;\\n } else {\\n Int a = score[rank[1][0]][rank[1][1]].first;\\n Int b = score[rank[1][0]][rank[1][1]].second;\\n if (a == b) {\\n return 1.0 / 2.0;\\n } else {\\n if ((a > b and rank[1][0] == check_team) or (a < b and rank[1][1] == check_team)) { \\n return 1.0;\\n } else {\\n return 0.0;\\n }\\n }\\n }\\n }\\n if (rank[1].size() == 1) {\\n if (rank[1][0] == check_team) {\\n return 1.0;\\n } else {\\n return 0.0;\\n }\\n }\\n }\\n }\\n}\\n\\nint main() {\\n Int t;\\n cin >> t;\\n calc_pro();\\n vector<double> r;\\n while (t--) {\\n vector<vector<Int>> v(4, vector<Int>(4, 0));\\n for (Int i = 0; i < 4; i++) v[i][3] = i;\\n Int check_team = -1;\\n pair<Int, Int> b1 = {-1, -1}, b2 = {-1, -1};\\n for (Int i = 0; i <= 4; i++) {\\n string s;\\n cin >> s;\\n if (i == 0) continue;\\n if (s[0] == '*') {\\n check_team = i - 1;\\n }\\n for (Int j = (i + 1) * 5; j < (Int)s.size(); j+=5) {\\n Int team_A = i - 1;\\n Int team_B = j / 5 - 1;\\n Int point_A = -1, point_B = -1;\\n for (Int k = 0; k < 4; k++) {\\n if (k == 1 and s[j + k] != '_') {\\n point_A = s[j + k] - '0';\\n }\\n if (k == 3 and s[j + k] != '_') {\\n point_B = s[j + k] - '0';\\n }\\n }\\n score[team_A][team_B] = {point_A, point_B};\\n score[team_B][team_A] = {point_B, point_A};\\n if (point_A < 0) {\\n if (b1.first < 0) {\\n b1 = {team_A, team_B};\\n } else {\\n b2 = {team_A, team_B};\\n }\\n } else {\\n if (point_A > point_B) {\\n v[team_A][0] += 3;\\n } else if (point_A < point_B) {\\n v[team_B][0] += 3;\\n } else {\\n v[team_A][0] += 1;\\n v[team_B][0] += 1;\\n }\\n v[team_A][1] += point_A - point_B;\\n v[team_B][1] += point_B - point_A;\\n v[team_A][2] += point_A;\\n v[team_B][2] += point_B;\\n }\\n }\\n }\\n double res = 0;\\n for (Int i = 0; i <= 8; i++) {\\n for (Int j = 0; j <= 8; j++) {\\n if (i > j) {\\n v[b1.first][0] += 3;\\n } else if (i < j) {\\n v[b1.second][0] += 3;\\n } else {\\n v[b1.first][0] += 1;\\n v[b1.second][0] += 1;\\n }\\n v[b1.first][1] += i - j;\\n v[b1.second][1] += j - i;\\n v[b1.first][2] += i;\\n v[b1.second][2] += j;\\n score[b1.first][b1.second] = {i, j};\\n score[b1.second][b1.first] = {j, i};\\n for (Int k = 0; k <= 8; k++) {\\n for (Int l = 0; l <= 8; l++) {\\n if (k > l) {\\n v[b2.first][0] += 3;\\n } else if (k < l) {\\n v[b2.second][0] += 3;\\n } else {\\n v[b2.first][0] += 1;\\n v[b2.second][0] += 1;\\n }\\n v[b2.first][1] += k - l;\\n v[b2.second][1] += l - k;\\n v[b2.first][2] += k;\\n v[b2.second][2] += l;\\n score[b2.first][b2.second] = {k, l};\\n score[b2.second][b2.first] = {l, k};\\n \\n // double p = f(v, check_team);\\n\\n // if (i > j and k < l and p != 0 and p != 1) {\\n // print(\\\"-------\\\");\\n // for (Int i = 0; i < (Int)v.size(); i++) {\\n // print(v[i]);\\n // }\\n // print(f(v, check_team));\\n // }\\n\\n res += pro[i] * pro[j] * pro[k] * pro[l] * f(v, check_team);\\n\\n if (k > l) {\\n v[b2.first][0] -= 3;\\n } else if (k < l) {\\n v[b2.second][0] -= 3;\\n } else {\\n v[b2.first][0] -= 1;\\n v[b2.second][0] -= 1;\\n }\\n v[b2.first][1] -= k - l;\\n v[b2.second][1] -= l - k;\\n v[b2.first][2] -= k;\\n v[b2.second][2] -= l;\\n }\\n }\\n if (i > j) {\\n v[b1.first][0] -= 3;\\n } else if (i < j) {\\n v[b1.second][0] -= 3;\\n } else {\\n v[b1.first][0] -= 1;\\n v[b1.second][0] -= 1;\\n }\\n v[b1.first][1] -= i - j;\\n v[b1.second][1] -= j - i;\\n v[b1.first][2] -= i;\\n v[b1.second][2] -= j;\\n }\\n }\\n r.push_back(res);\\n //print(ma);\\n }\\n for (Int i = 0; i < (Int)r.size(); i++) {\\n print(r[i]);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 3176,\n \"score_of_the_acc\": -0.1165,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1234_4289974\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\n#define all(x) (x).begin(),(x).end()\\n#define double long double\\nconst int mod=1000000007,MAX=203,INF=1<<20;\\n\\nstruct data{\\n int point;\\n int diff;\\n int goal;\\n int id;\\n \\n bool operator<(const data &another) const\\n {\\n if(point==another.point){\\n if(diff==another.diff){\\n if(goal==another.goal){\\n return id<another.id;\\n }\\n return goal<another.goal;\\n }\\n return diff<another.diff;\\n }\\n return point<another.point;\\n };\\n \\n bool operator == (const data &another) const\\n {\\n return point==another.point&&diff==another.diff&&goal==another.goal;\\n };\\n};\\n\\nvector<int> dh={1,1,1,2,2,3},dw={11,16,21,16,21,21};\\n\\nvoid f(data &a,data &b,int scorea,int scoreb){\\n if(scorea==scoreb){\\n a.point++;\\n b.point++;\\n a.goal+=scorea;\\n b.goal+=scoreb;\\n }else if(scorea>scoreb){\\n a.point+=3;\\n a.diff+=scorea-scoreb;\\n b.diff+=scoreb-scorea;\\n a.goal+=scorea;\\n b.goal+=scoreb;\\n }else{\\n b.point+=3;\\n a.diff+=scorea-scoreb;\\n b.diff+=scoreb-scorea;\\n a.goal+=scorea;\\n b.goal+=scoreb;\\n }\\n \\n}\\n\\nint main(){\\n \\n std::ifstream in(\\\"text.txt\\\");\\n std::cin.rdbuf(in.rdbuf());\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n \\n int Q;cin>>Q;\\n vector<double> p(9);\\n for(double i=0.0;i<=8.0;i++){\\n p[i]=1.0;\\n for(double j=1.0;j<=8.0;j++) p[i]*=j;\\n for(double j=1.0;j<=i;j++) p[i]/=j;\\n for(double j=1.0;j<=8.0-i;j++) p[i]/=j;\\n \\n for(double j=1.0;j<=8.0-i;j++) p[i]*=3.0;\\n for(double j=1.0;j<=8.0;j++) p[i]/=4.0;\\n }\\n \\n while(Q--){\\n vector<string> S(5);\\n for(int i=0;i<5;i++) cin>>S[i];\\n double ans=0.0;\\n int my;\\n vector<data> T(4);\\n \\n for(int i=1;i<5;i++) if(S[i][0]=='*') my=i-1;\\n \\n vector<pair<int,int>> ch;\\n \\n for(int k=0;k<6;k++){\\n if(S[dh[k]][dw[k]]=='_'){\\n ch.push_back({dh[k],dw[k]});\\n ch.push_back({dh[k],dw[k]+2});\\n }\\n }\\n \\n for(int q1=0;q1<9;q1++){\\n for(int q2=0;q2<9;q2++){\\n for(int q3=0;q3<9;q3++){\\n for(int q4=0;q4<9;q4++){\\n double pp=p[q1]*p[q2]*p[q3]*p[q4];\\n vector<int> sco(4);\\n sco[0]=q1;\\n sco[1]=q2;\\n sco[2]=q3;\\n sco[3]=q4;\\n \\n for(int k=0;k<4;k++) S[ch[k].first][ch[k].second]=char('0'+sco[k]);\\n \\n vector<int> use(4,0);\\n \\n while(1){\\n vector<data> T(4);\\n int fi=0;\\n for(int i=0;i<4;i++){\\n T[i].id=i;\\n if(use[i]==1) T[i].point+=1000;\\n if(use[i]==2) T[i].point-=1000;\\n if(use[i]==0) fi++;\\n }\\n \\n for(int k=0;k<6;k++){\\n int a=S[dh[k]][dw[k]]-'0',b=S[dh[k]][dw[k]+2]-'0';\\n \\n if(use[dh[k]-1]||use[(dw[k]-6)/5]) continue;\\n \\n f(T[dh[k]-1],T[(dw[k]-6)/5],a,b);\\n \\n //cout<<a<<\\\" \\\"<<b<<endl;\\n }\\n \\n int cnta=0,cntb=0;\\n for(int i=0;i<4;i++){\\n //if(i==my) continue;\\n if(!(T[i]==T[my])){\\n if(T[i]<T[my]) cntb++;\\n if(T[my]<T[i]) cnta++;\\n }\\n }\\n \\n int posa,posb;\\n posa=cnta;\\n posb=3-cntb;\\n \\n sort(all(T));\\n reverse(all(T));\\n \\n if(posb<=1){\\n ans+=pp;\\n break;\\n }else if(posa>=2){\\n break;\\n }else{\\n if(fi==posb-posa+1){\\n double cnt=0;\\n for(int i=posa;i<=posb;i++) if(i<=1) cnt++;\\n ans+=pp*cnt/(double)(fi);\\n break;\\n }else{\\n for(int i=0;i<posa;i++) use[T[i].id]=1;\\n for(int i=posb+1;i<4;i++) use[T[i].id]=2;\\n for(int i=posa;i<=posb;i++){\\n //if(use[T[i].id]) cout<<\\\"!\\\"<<endl;\\n use[T[i].id]=0;\\n }\\n }\\n }\\n }\\n \\n for(int k=0;k<4;k++) S[ch[k].first][ch[k].second]='_';\\n }\\n }\\n }\\n }\\n cout<<fixed<<setprecision(7)<<ans<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 3304,\n \"score_of_the_acc\": -0.2849,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1234_4252005\",\n \"code_snippet\": \"#define _CRT_SECURE_NO_WARNINGS\\n#define _USE_MATH_DEFINES\\n\\n#pragma comment (linker, \\\"/STACK:526000000\\\")\\n\\n#include \\\"bits/stdc++.h\\\"\\n\\nusing namespace std;\\ntypedef string::const_iterator State;\\n#define eps 1e-11L\\n#define MAX_MOD 1000000007LL\\n#define GYAKU 500000004LL\\n\\n#define MOD 998244353LL\\n#define seg_size 262144 * 4LL\\n#define pb push_back\\n#define mp make_pair\\ntypedef long long ll;\\n#define REP(a,b) for(long long (a) = 0;(a) < (b);++(a))\\n#define ALL(x) (x).begin(),(x).end()\\n\\nvoid init() {\\n iostream::sync_with_stdio(false);\\n cout << fixed << setprecision(20);\\n}\\n\\n\\n//#define int ll\\n\\nunsigned long xor128() {\\n static unsigned long x = 123456789, y = 362436069, z = 521288629, w = 88675123;\\n unsigned long t = (x ^ (x << 11));\\n x = y; y = z; z = w;\\n return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));\\n}\\nstring names[4];\\nint target = 0;\\nvector<pair<pair<int, int>, pair<int, int>>> results;\\nlong double calc() {\\n vector<int> going{ 0,1,2,3 };\\n vector<int> winner;\\n REP(t, 3) {\\n map<tuple<int, int, int>, vector<int>> next;\\n tuple<int, int, int> cnter[4] = {};\\n REP(i, going.size()) {\\n REP(q, going.size()) {\\n REP(j, results.size()) {\\n if (results[j].first == mp((int)going[i], (int)going[q])) {\\n if (results[j].second.first == results[j].second.second) {\\n get<0>(cnter[going[i]])--;\\n get<0>(cnter[going[q]])--;\\n }\\n else if (results[j].second.first > results[j].second.second) {\\n get<0>(cnter[going[i]]) -= 3;\\n }\\n else {\\n get<0>(cnter[going[q]]) -= 3;\\n }\\n get<1>(cnter[going[i]]) -= results[j].second.first - results[j].second.second;\\n get<1>(cnter[going[q]]) -= results[j].second.second - results[j].second.first;\\n get<2>(cnter[going[i]]) -= results[j].second.first;\\n get<2>(cnter[going[q]]) -= results[j].second.second;\\n }\\n }\\n }\\n }\\n REP(i, going.size()) {\\n next[cnter[going[i]]].push_back(going[i]);\\n }\\n if ((*next.begin()).second.size() + winner.size() >= 2) {\\n going = (*next.begin()).second;\\n }\\n else {\\n vector<int> hoge = (*next.begin()).second;\\n REP(j, hoge.size()) {\\n winner.push_back(hoge[j]);\\n }\\n auto x = next.begin();\\n x++;\\n if (x != next.end()) {\\n going = (*x).second;\\n }\\n else {\\n going.clear();\\n break;\\n }\\n }\\n }\\n REP(i, winner.size()) {\\n if (winner[i] == target) {\\n return 1.0L;\\n }\\n }\\n long double now = 2 - (int)winner.size();\\n REP(i, going.size()) {\\n if (target == going[i]) {\\n return now / (long double)(going.size());\\n }\\n }\\n return 0;\\n}\\nlong double memo[9];\\nlong double scoring(int a) {\\n if (memo[a]) return memo[a];\\n long double ans = 1;\\n for (int i = 2; i <= 8; ++i) {\\n ans *= (long double)i;\\n }\\n for (int i = 2; i <= a; ++i) {\\n ans /= (long double)i;\\n }\\n for (int i = 2; i <= 8 - a; ++i) {\\n ans /= (long double)i;\\n }\\n REP(i, a) {\\n ans /= (long double)4;\\n }\\n REP(i, 8 - a) {\\n ans /= (long double)4;\\n ans *= (long double)3;\\n }\\n return memo[a] = ans;\\n}\\nvoid solve() {\\n results.clear();\\n vector<string> inputs;\\n string a;\\n cin >> a;\\n REP(i, 4) {\\n string a;\\n cin >> a;\\n inputs.push_back(a);\\n }\\n REP(i, 4) {\\n if (inputs[i][0] == '*') {\\n target = i;\\n }\\n names[i] = inputs[i].substr(1, 3);\\n }\\n vector<pair<int, int>> no;\\n REP(i, 4) {\\n for (int q = i+1; q < 4; ++q) {\\n string b = inputs[i].substr(6 + q * 5, 3);\\n if (b[0] == '_') {\\n no.push_back(mp(i, q));\\n }\\n else {\\n pair<pair<int, int>, pair<int, int>> now = mp(mp((int)i, (int)q), mp((int)(b[0] - '0'), (int)(b[2] - '0')));\\n results.push_back(now);\\n }\\n }\\n }\\n results.push_back(mp(no[0], mp(-1, -1)));\\n results.push_back(mp(no[1], mp(-1, -1)));\\n long double ans = 0;\\n REP(i, 9) {\\n REP(q, 9) {\\n REP(j, 9) {\\n REP(t, 9) {\\n long double prob = scoring(i) * scoring(q) * scoring(j) * scoring(t);\\n results[results.size()-1].second = mp(i, q);\\n results[results.size()-2].second = mp(j, t);\\n ans += prob * calc();\\n }\\n }\\n }\\n }\\n cout << ans << endl;\\n}\\n\\n#undef int\\nint main() {\\n init();\\n int t;\\n cin >> t;\\n REP(tea,t)\\n solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 350,\n \"memory_kb\": 3296,\n \"score_of_the_acc\": -0.3241,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1234_3836016\",\n \"code_snippet\": \"#include <iomanip>\\n#include <iostream>\\n#include <cmath>\\n#include <vector>\\n#include <string>\\n\\nusing Bool = bool;\\nusing Int = long long int;\\nusing Real = long double;\\nusing Char = char;\\nusing String = std::string;\\ntemplate <class T>\\nusing Vector = std::vector<T>;\\ntemplate <class T>\\nusing Matrix = Vector<Vector<T>>;\\n\\nstruct Fout {\\n Int precision;\\n Fout(Int precision) : precision(precision) {}\\n};\\nstd::ostream& operator<<(std::ostream& os, const Fout& fio) {\\n os << std::fixed << std::setprecision(fio.precision);\\n return os;\\n}\\n\\n// p勝する確率\\nVector<Real> prob;\\n\\nvoid init() {\\n prob.resize(9);\\n prob[0] = std::pow(0.75L, 8);\\n for (Int i = 1; i <= 8; ++i) {\\n prob[i] = prob[i - 1] * Real(9 - i) / Real(i * 3);\\n }\\n}\\n\\n// 入力から得点表を生成\\n// 先頭が自チーム、埋まってない箇所は-1 ~ -4が振られる\\nMatrix<Int> parse() {\\n String s;\\n std::cin >> s;\\n\\n Vector<Vector<Int>> score(4, Vector<Int>(4, 0));\\n\\n {\\n Int me = 0, cnt = -1;\\n\\n for (Int i = 0; i < 4; ++i) {\\n std::cin >> s;\\n if (s.front() == '*') me = i;\\n\\n for (Int j = i + 1; j < 4; ++j) {\\n Char x = s[j * 5 + 6];\\n score[i][j] = (x == '_' ? cnt-- : x - '0');\\n x = s[j * 5 + 8];\\n score[j][i] = (x == '_' ? cnt-- : x - '0');\\n }\\n }\\n\\n // 自チームを先頭へ移動\\n std::swap(score[0], score[me]);\\n for (auto& v : score) std::swap(v[0], v[me]);\\n }\\n\\n return score;\\n}\\n\\nvoid solve() {\\n auto score = parse();\\n Real ans = 0;\\n\\n // 空欄の点数を全列挙\\n for (Int b = 0; b < 6561; ++b) {\\n // デコード\\n Vector<Int> pts(4);\\n {\\n Int c = b;\\n for (Int i = 0; i < 4; ++i) {\\n pts[i] = c % 9;\\n c /= 9;\\n }\\n }\\n\\n Real pr = 1;\\n for (auto p : pts) pr *= prob[p];\\n\\n // 空欄を埋める\\n auto nscore = score;\\n for (auto& v : nscore) {\\n for (auto& x : v) {\\n if (x < 0) x = pts[-x - 1];\\n }\\n }\\n\\n Vector<Vector<Int>> result(4);\\n\\n for (Int q = 0; q < 3; ++q) {\\n // 現時点で自チームと同率のチームを列挙\\n Vector<Bool> cons(4);\\n for (Int i = 0; i < 4; ++i) {\\n cons[i] = (result[i] == result[0]);\\n }\\n\\n // 同率チーム間のポイント、得失点差、得点\\n Matrix<Int> tmpres(4, Vector<Int>(3, 0));\\n for (Int i = 0; i < 4; ++i) {\\n if (!cons[i]) continue;\\n for (Int j = 0; j < 4; ++j) {\\n if (i == j || !cons[j]) continue;\\n\\n Int me = nscore[i][j], op = nscore[j][i];\\n tmpres[i][0] += (me > op ? 3 : me == op);\\n tmpres[i][1] += me - op;\\n tmpres[i][2] += me;\\n }\\n }\\n\\n // テーブルを拡張\\n for (Int i = 0; i < 4; ++i) {\\n if (cons[i])\\n std::move(tmpres[i].begin(), tmpres[i].end(),\\n std::back_inserter(result[i]));\\n }\\n }\\n\\n Int u = 0, m = 0; // 自チームと比べて上、同率のチーム数\\n for (Int i = 0; i < 4; ++i) {\\n if (result[i] > result[0]) {\\n ++u;\\n } else if (result[i] == result[0]) {\\n ++m;\\n }\\n }\\n\\n if (u >= 2) { // 枠が埋まっている\\n pr = 0;\\n } else if (u + m >= 3) { // 残り2-u枠をmチームで取り合う\\n pr *= Real(2 - u) / Real(m);\\n }\\n ans += pr;\\n }\\n\\n std::cout << Fout(7) << ans << std::endl;\\n}\\n\\nint main() {\\n init();\\n Int n;\\n std::cin >> n;\\n for (Int i = 0; i < n; ++i) solve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 850,\n \"memory_kb\": 3184,\n \"score_of_the_acc\": -0.2589,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1234_3836015\",\n \"code_snippet\": \"#if __has_include(\\\"../library/Basic/Debug.hpp\\\")\\n\\n#include \\\"../library/Basic/Debug.hpp\\\"\\n\\n#else\\n\\n/* ----- Header Files ----- */\\n// IO\\n#include <cstdio>\\n#include <iomanip>\\n#include <ios>\\n#include <iostream>\\n\\n// algorithm\\n#include <algorithm>\\n#include <cmath>\\n#include <numeric>\\n\\n// container\\n#include <vector>\\n#include <string>\\n#include <tuple>\\n#include <set>\\n#include <map>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n\\n// others\\n#include <random>\\n#include <limits>\\n#include <functional>\\n#include <ctime>\\n#include <cassert>\\n#include <cstdint>\\n\\n\\n/* ----- Type Alias ----- */\\nusing Bool = bool;\\nusing Int = long long int;\\nusing Real = long double;\\nusing Char = char;\\nusing String = std::string;\\ntemplate <class... Ts>\\nusing Tuple = std::tuple<Ts...>;\\n\\ntemplate <class T>\\nusing Vector = std::vector<T>;\\ntemplate <class T>\\nusing Matrix = Vector<Vector<T>>;\\ntemplate <class T>\\nusing Queue = std::queue<T>;\\ntemplate <class T>\\nusing Stack = std::stack<T>;\\ntemplate <class T>\\nusing Deque = std::deque<T>;\\n\\ntemplate <class T>\\nusing MaxHeap = std::priority_queue<T>;\\ntemplate <class T>\\nusing MinHeap = std::priority_queue<T, std::vector<T>, std::greater<T>>;\\ntemplate <class T>\\nusing Set = std::set<T>;\\ntemplate <class T, class U>\\nusing Map = std::map<T, U>;\\n\\ntemplate <class T, class... Us>\\nusing Func = std::function<T(Us...)>;\\n\\ntemplate <class T>\\nT genv(T v) { return v; }\\n\\ntemplate <class T, class... Ts>\\nauto genv(size_t l, Ts... ts) {\\n return Vector<decltype(genv<T>(ts...))>(l, genv<T>(ts...));\\n}\\n\\ntemplate <class Cost = Int>\\nstruct Edge {\\n Int src, dst;\\n Cost cost;\\n Edge(Int src = -1, Int dst = -1, Cost cost = 1)\\n : src(src), dst(dst), cost(cost){};\\n\\n bool operator<(const Edge<Cost>& e) const { return this->cost < e.cost; }\\n bool operator>(const Edge<Cost>& e) const { return this->cost > e.cost; }\\n};\\n\\ntemplate <class Cost = Int>\\nusing Edges = Vector<Edge<Cost>>;\\ntemplate <class Cost = Int>\\nusing Graph = Vector<Vector<Edge<Cost>>>;\\n\\n#endif\\n\\n/* ----- Misc ----- */\\nvoid fastio() {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n}\\n\\nstruct Fout {\\n Int precision;\\n Fout(Int precision) : precision(precision) {}\\n};\\nstd::ostream& operator<<(std::ostream& os, const Fout& fio) {\\n os << std::fixed << std::setprecision(fio.precision);\\n return os;\\n}\\n\\n\\n/* ----- Constants ----- */\\n// constexpr Int INF = std::numeric_limits<Int>::max() / 3;\\n// constexpr Int MOD = 1000000007;\\n// constexpr Real PI = acos(-1);\\n// constexpr Real EPS = 1e-10;\\n// std::mt19937 mt(int(std::time(nullptr)));\\n\\nVector<Real> prob;\\n\\nvoid init() {\\n prob.resize(9);\\n prob[0] = std::pow(0.75L, 8);\\n for (Int i = 1; i <= 8; ++i) {\\n prob[i] = prob[i - 1] * Real(9 - i) / Real(i * 3);\\n }\\n}\\n\\nvoid solve() {\\n String s;\\n std::cin >> s;\\n\\n Vector<Vector<Int>> score(4, Vector<Int>(4, 0));\\n\\n {\\n Int me = 0, cnt = -1;\\n\\n for (Int i = 0; i < 4; ++i) {\\n std::cin >> s;\\n if (s.front() == '*') me = i;\\n\\n for (Int j = i + 1; j < 4; ++j) {\\n Char x = s[j * 5 + 6];\\n score[i][j] = (x == '_' ? cnt-- : x - '0');\\n x = s[j * 5 + 8];\\n score[j][i] = (x == '_' ? cnt-- : x - '0');\\n }\\n }\\n\\n std::swap(score[0], score[me]);\\n for (auto& v : score) std::swap(v[0], v[me]);\\n }\\n\\n Real ans = 0;\\n for (Int b = 0; b < 6561; ++b) {\\n Vector<Int> pts(4);\\n {\\n Int c = b;\\n for (Int i = 0; i < 4; ++i) {\\n pts[i] = c % 9;\\n c /= 9;\\n }\\n }\\n\\n Real pr = 1;\\n for (auto p : pts) pr *= prob[p];\\n\\n auto s = score;\\n for (auto& v : s) {\\n for (auto& x : v) {\\n if (x < 0) x = pts[-x - 1];\\n }\\n }\\n\\n Vector<Vector<Int>> result(4);\\n\\n for (Int q = 0; q < 3; ++q) {\\n Int cons = 1;\\n for (Int i = 1; i < 4; ++i) {\\n if (result[i] == result[0]) cons += (1 << i);\\n }\\n\\n Vector<Vector<Int>> tmpres(4, Vector<Int>(3, 0));\\n for (Int i = 0; i < 4; ++i) {\\n if (((cons >> i) & 1) == 0) continue;\\n for (Int j = 0; j < 4; ++j) {\\n if (i == j || ((cons >> j) & 1) == 0) continue;\\n tmpres[i][0] += (s[i][j] > s[j][i] ? 3 : s[i][j] == s[j][i]);\\n tmpres[i][1] += s[i][j] - s[j][i];\\n tmpres[i][2] += s[i][j];\\n }\\n }\\n\\n for (Int i = 0; i < 4; ++i) {\\n if ((cons >> i) & 1)\\n std::move(tmpres[i].begin(), tmpres[i].end(),\\n std::back_inserter(result[i]));\\n }\\n }\\n\\n Int u = 0, m = 0;\\n for (Int i = 0; i < 4; ++i) {\\n if (result[i] > result[0]) {\\n ++u;\\n } else if (result[i] == result[0]) {\\n ++m;\\n }\\n }\\n\\n if (u >= 2) {\\n pr = 0;\\n } else if (u + m >= 3) {\\n pr *= Real(2 - u) / Real(m);\\n }\\n ans += pr;\\n }\\n\\n std::cout << Fout(7) << ans << std::endl;\\n}\\n\\nint main() {\\n init();\\n Int n;\\n std::cin >> n;\\n for (Int i = 0; i < n; ++i) solve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 870,\n \"memory_kb\": 3272,\n \"score_of_the_acc\": -0.3908,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1234_3568063\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<iomanip>\\n#include<vector>\\nusing namespace std;\\ndouble W[9];\\nint x[4][4]={{0,1,1,1},{1,0,2,2},{1,2,0,3},{1,2,3,0}};\\nint y[4][4]={{0,11,16,21},{11,0,16,21},{16,16,0,21},{21,21,21,0}};\\nint mx[6]={1,1,1,2,2,3},my[6]={11,16,21,16,21,21};\\nint ax[12]={1,1,1,1,1,1,2,2,2,2,3,3},ay[12]={11,13,16,18,21,23,16,18,21,23,21,23};\\nstring s[5];\\nint winner;\\ndouble dfs(int id)\\n{\\n\\tif(id==12)\\n\\t{\\n\\t\\tvector<pair<pair<int,pair<int,int> >,int> >A(4);\\n\\t\\tfor(int i=0;i<4;i++)\\n\\t\\t{\\n\\t\\t\\tint p=0,d=0,g=0;\\n\\t\\t\\tfor(int j=0;j<4;j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif(i==j)continue;\\n\\t\\t\\t\\tint a=s[x[i][j]][y[i][j]]-'0';\\n\\t\\t\\t\\tint b=s[x[i][j]][y[i][j]+2]-'0';\\n\\t\\t\\t\\tif(x[i][j]>i)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tp+=a>b?3:a==b?1:0;\\n\\t\\t\\t\\t\\td+=a-b;\\n\\t\\t\\t\\t\\tg+=a;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tp+=b>a?3:b==a?1:0;\\n\\t\\t\\t\\t\\td+=b-a;\\n\\t\\t\\t\\t\\tg+=b;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tA[i]=make_pair(make_pair(-p,make_pair(-d,-g)),i);\\n\\t\\t}\\n\\t\\tsort(A.begin(),A.end());\\n\\t\\tvector<int>B;\\n\\t\\tint p=0;\\n\\t\\tfor(int i=1;i<=4;i++)\\n\\t\\t{\\n\\t\\t\\tif(i<4&&A[p].first==A[i].first)continue;\\n\\t\\t\\telse\\n\\t\\t\\t{\\n\\t\\t\\t\\tif(p+1==i)B.push_back(A[p].second);\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tvector<int>I;\\n\\t\\t\\t\\t\\tfor(int j=p;j<i;j++)I.push_back(A[j].second);\\n\\t\\t\\t\\t\\tint pre=114514;\\n\\t\\t\\t\\t\\twhile(I.size()<pre)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tpre=I.size();\\n\\t\\t\\t\\t\\t\\tvector<pair<pair<int,pair<int,int> >,int> >C;\\n\\t\\t\\t\\t\\t\\tfor(int j=0;j<I.size();j++)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tint p=0,d=0,g=0;\\n\\t\\t\\t\\t\\t\\t\\tfor(int k=0;k<I.size();k++)\\n\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\tif(j==k)continue;\\n\\t\\t\\t\\t\\t\\t\\t\\tint a=s[x[I[j]][I[k]]][y[I[j]][I[k]]]-'0';\\n\\t\\t\\t\\t\\t\\t\\t\\tint b=s[x[I[j]][I[k]]][y[I[j]][I[k]]+2]-'0';\\n\\t\\t\\t\\t\\t\\t\\t\\tif(x[I[j]][I[k]]>I[j])\\n\\t\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tp+=a>b?3:a==b?1:0;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\td+=a-b;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tg+=a;\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tp+=b>a?3:b==a?1:0;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\td+=b-a;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tg+=b;\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\tC.push_back(make_pair(make_pair(-p,make_pair(-d,-g)),I[j]));\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tsort(C.begin(),C.end());\\n\\t\\t\\t\\t\\t\\tint q=0;\\n\\t\\t\\t\\t\\t\\tvector<int>J;\\n\\t\\t\\t\\t\\t\\tfor(int j=1;j<=C.size();j++)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tif(j<C.size()&&C[q].first==C[j].first)continue;\\n\\t\\t\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\tif(q+1==j)B.push_back(C[q++].second);\\n\\t\\t\\t\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tbool flag=0;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tfor(int k=0;k<I.size();k++)flag|=I[k]==winner;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tif(!flag)\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tfor(;q<j;q++)B.push_back(C[q].second);\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tfor(;q<j;q++)J.push_back(C[q].second);\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tI=J;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif(!I.empty())\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tbool flag=0;\\n\\t\\t\\t\\t\\t\\tfor(int j=0;j<I.size();j++)flag|=I[j]==winner;\\n\\t\\t\\t\\t\\t\\tif(!flag)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tfor(int j=0;j<I.size();j++)B.push_back(I[j]);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tif(B.size()>=2)return 0;\\n\\t\\t\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\tdouble rest=2-B.size();\\n\\t\\t\\t\\t\\t\\t\\t\\treturn rest/I.size();\\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}\\n\\t\\t\\t\\tp=i;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn B[0]==winner||B[1]==winner;\\n\\t}\\n\\telse\\n\\t{\\n\\t\\tif(s[ax[id]][ay[id]]!='_')return dfs(id+1);\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tdouble ret=0;\\n\\t\\t\\tfor(char c='0';c<='8';c++)\\n\\t\\t\\t{\\n\\t\\t\\t\\ts[ax[id]][ay[id]]=c;\\n\\t\\t\\t\\tret+=W[c-'0']*dfs(id+1);\\n\\t\\t\\t\\ts[ax[id]][ay[id]]='_';\\n\\t\\t\\t}\\n\\t\\t\\treturn ret;\\n\\t\\t}\\n\\t}\\n}\\nmain()\\n{\\n\\tfor(int p=0;p<=8;p++)\\n\\t{\\n\\t\\tW[p]=1;\\n\\t\\tfor(int j=1;j<=8;j++)W[p]*=j;\\n\\t\\tfor(int j=1;j<=p;j++)W[p]/=j;\\n\\t\\tfor(int j=1;j<=8-p;j++)W[p]/=j;\\n\\t\\tfor(int j=1;j<=p;j++)W[p]/=4;\\n\\t\\tfor(int j=1;j<=8-p;j++)W[p]*=3./4;\\n\\t}\\n\\tint T;cin>>T;\\n\\tfor(;T--;)\\n\\t{\\n\\t\\tfor(int i=0;i<5;i++)\\n\\t\\t{\\n\\t\\t\\tcin>>s[i];\\n\\t\\t\\tif(s[i][0]=='*')winner=i-1;\\n\\t\\t}\\n\\t\\tcout<<fixed<<setprecision(9)<<dfs(0)<<endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 3192,\n \"score_of_the_acc\": -0.128,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1234_3321193\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nusing ld=long double;\\nstruct Match{\\n int lhs,rhs;\\n int lhsp,rhsp;\\n};\\n\\nvoid debug(Match x){\\n //cerr<<x.lhs<<\\\"vs\\\"<<x.rhs<<\\\" \\\"<<x.lhsp<<\\\"-\\\"<<x.rhsp<<endl;\\n}\\nvoid debug(vector<Match> x){\\n //cerr<<\\\"#These are match\\\"<<endl;\\n for(int i=0;i<x.size();i++){\\n debug(x[i]);\\n }\\n}\\nld winner(const vector<Match> &match,int tar,int place){\\n vector<int> pt(4);\\n vector<int> gd(4);\\n vector<int> sc(4);\\n for(auto &m:match){\\n pt[m.lhs]++;\\n pt[m.rhs]++;\\n if(m.lhsp<m.rhsp) pt[m.rhs]+=300;\\n else if(m.lhsp>m.rhsp) pt[m.lhs]+=300;\\n else pt[m.rhs]+=100,pt[m.lhs]+=100;\\n gd[m.lhs]+=m.lhsp-m.rhsp;\\n gd[m.rhs]+=m.rhsp-m.lhsp;\\n sc[m.lhs]+=m.lhsp;\\n sc[m.rhs]+=m.rhsp;\\n }\\n vector<int> rs(4);\\n for(int i=0;i<4;i++) rs[i]=pt[i]*1e5+gd[i]*1e3+sc[i];\\n int x=*max_element(rs.begin(),rs.end());\\n if(rs[tar]==x){\\n if(count(rs.begin(),rs.end(),x)==1) return 1;\\n vector<Match> next;\\n for(auto &m:match){\\n if(rs[m.lhs]==x && rs[m.rhs]==x) next.push_back(m);\\n }\\n //cerr<<\\\"#\\\"<<next.size()<<endl;\\n if(match.size()==next.size()){\\n int cnt=count(rs.begin(),rs.end(),x);\\n if(cnt==1) return 1;\\n else return ld(place)/cnt;\\n }\\n else return winner(next,tar,place);\\n }\\n if(place<=count(rs.begin(),rs.end(),x)) return 0;\\n int sndmax=0;\\n for(int i=0;i<4;i++){\\n if(rs[i]!=x) sndmax=max(sndmax,rs[i]);\\n }\\n if(rs[tar]==sndmax){\\n if(count(rs.begin(),rs.end(),sndmax)==1) return 1;\\n vector<Match> next;\\n for(auto &m:match){\\n if(rs[m.lhs]==sndmax && rs[m.rhs]==sndmax) next.push_back(m);\\n }\\n return winner(next,tar,1);\\n }\\n return 0;\\n}\\nld pos(int point){\\n ld res=1;\\n for(int i=0;i<8;i++) res*=(i+1);\\n for(int i=0;i<point;i++) res*=0.25/(i+1);\\n for(int i=0;i<8-point;i++) res*=0.75/(i+1);\\n return res;\\n}\\nint cnt=0;\\nld dfs(int idx,vector<Match> &match,ld p,int tar){\\n if(idx==match.size()){\\n ld x=winner(match,tar,2);\\n cnt++;\\n debug(match);\\n //cerr<<x<<endl;\\n return p*x;\\n }\\n ld res=0;\\n if(match[idx].lhsp==-1){\\n for(int i=0;i<=8;i++){\\n for(int j=0;j<=8;j++){\\n match[idx].lhsp=i;\\n match[idx].rhsp=j;\\n res+=dfs(idx+1,match,p*pos(i)*pos(j),tar);\\n match[idx].lhsp=-1;\\n match[idx].rhsp=-1;\\n }\\n }\\n }\\n else{\\n return dfs(idx+1,match,p,tar);\\n }\\n return res;\\n}\\nld solve(){\\n array<string,5> table;\\n for(int i=0;i<5;i++) cin>>table[i];\\n int tar=0;\\n for(int i=0;i<4;i++){\\n if(table[i+1][0]=='*') tar=i;\\n }\\n const int WIDTH=5;\\n const int LHS=1;\\n const int RHS=3;\\n vector<Match> match;\\n for(int i=0;i<4;i++){\\n for(int j=0;j<i;j++){\\n char lhsp=table[j+1][WIDTH*(i+1)+LHS];\\n char rhsp=table[j+1][WIDTH*(i+1)+RHS];\\n if(isdigit(lhsp)){\\n assert(isdigit(rhsp));\\n match.push_back(Match{j,i,lhsp-'0',rhsp-'0'});\\n }\\n else{\\n match.push_back(Match{j,i,-1,-1});\\n }\\n }\\n }\\n assert(match.size()==6);\\n return dfs(0,match,1,tar);\\n}\\nint main(){\\n int n;\\n cin>>n;\\n cout<<setprecision(10)<<fixed;\\n for(int i=0;i<n;i++){\\n cout<<solve()<<endl; \\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 3212,\n \"score_of_the_acc\": -0.159,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1234_3264952\",\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>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned int ui;\\nconst ll mod = 1000000007;\\nconst ll INF = (ll)1000000007 * 1000000007;\\ntypedef pair<int, int> P;\\n#define stop char nyaa;cin>>nyaa;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\ntypedef long double ld;\\ntypedef complex<ld> Point;\\nconst ld eps = 1e-4;\\nconst ld pi = acos(-1.0);\\ntypedef pair<ll, ll> LP;\\ntypedef pair<ld, ld> LDP;\\nstruct result {\\n\\tint x, y, cx, cy;\\n};\\nresult a[6];\\nint target;\\nint c[4];\\nvoid a_calc() {\\n\\trep(i, 4) {\\n\\t\\tc[i] = 0;\\n\\t}\\n\\trep(i, 6) {\\n\\t\\tif (a[i].cx > a[i].cy)c[a[i].x] += 3;\\n\\t\\telse if (a[i].cx < a[i].cy)c[a[i].y] += 3;\\n\\t\\telse {\\n\\t\\t\\tc[a[i].x]++; c[a[i].y]++;\\n\\t\\t}\\n\\t}\\n}\\nvoid b_calc() {\\n\\trep(i, 4) {\\n\\t\\tc[i] = 0;\\n\\t}\\n\\trep(i, 6) {\\n\\t\\tc[a[i].x] += a[i].cx - a[i].cy;\\n\\t\\tc[a[i].y] += a[i].cy - a[i].cx;\\n\\t}\\n}\\nvoid c_calc() {\\n\\trep(i, 4) {\\n\\t\\tc[i] = 0;\\n\\t}\\n\\trep(i, 6) {\\n\\t\\tc[a[i].x] += a[i].cx;\\n\\t\\tc[a[i].y] += a[i].cy;\\n\\t}\\n}\\nvoid d_calc(vector<int> v) {\\n\\trep(i, 4) {\\n\\t\\tc[i] = 0;\\n\\t}\\n\\tint exi[4] = {};\\n\\trep(i, v.size()) {\\n\\t\\texi[v[i]] = 1;\\n\\t}\\n\\trep(i, 6) {\\n\\t\\tif (!exi[a[i].x] || !exi[a[i].y])continue;\\n\\t\\tif (a[i].cx > a[i].cy)c[a[i].x] += 3;\\n\\t\\telse if (a[i].cx < a[i].cy)c[a[i].y] += 3;\\n\\t\\telse {\\n\\t\\t\\tc[a[i].x]++; c[a[i].y]++;\\n\\t\\t}\\n\\t}\\n}\\nvoid e_calc(vector<int> v) {\\n\\trep(i, 4) {\\n\\t\\tc[i] = 0;\\n\\t}\\n\\tint exi[4] = {};\\n\\trep(i, v.size()) {\\n\\t\\texi[v[i]] = 1;\\n\\t}\\n\\trep(i, 6) {\\n\\t\\tif (!exi[a[i].x] || !exi[a[i].y])continue;\\n\\t\\tc[a[i].x] += a[i].cx - a[i].cy;\\n\\t\\tc[a[i].y] += a[i].cy - a[i].cx;\\n\\t}\\n}\\nvoid f_calc(vector<int> v) {\\n\\trep(i, 4) {\\n\\t\\tc[i] = 0;\\n\\t}\\n\\tint exi[4] = {};\\n\\trep(i, v.size()) {\\n\\t\\texi[v[i]] = 1;\\n\\t}\\n\\trep(i, 6) {\\n\\t\\tif (!exi[a[i].x] || !exi[a[i].y])continue;\\n\\t\\tc[a[i].x] += a[i].cx;\\n\\t\\tc[a[i].y] += a[i].cy;\\n\\t}\\n}\\nvector<int> a_rule(vector<int> u) {\\n\\tvector<int> res;\\n\\ta_calc();\\n\\tvector<P> v;\\n\\trep(i, u.size()) {\\n\\t\\tv.push_back({ c[u[i]],u[i] });\\n\\t}\\n\\tsort(v.begin(), v.end(),greater<P>());\\n\\tint cnt = 0;\\n\\trep(i, v.size()) {\\n\\t\\tres.push_back(v[i].second);\\n\\t\\twhile (i + 1 < v.size() && v[i].first == v[i + 1].first) {\\n\\t\\t\\ti++; res.push_back(v[i].second);\\n\\t\\t}\\n\\t\\tcnt++;\\n\\t\\tif (cnt == 1)break;\\n\\t}\\n\\tsort(res.begin(), res.end()); return res;\\n}\\nvector<int> b_rule(vector<int> v) {\\n\\tvector<int> res;\\n\\tb_calc();\\n\\tvector<P> u;\\n\\trep(i, v.size()) {\\n\\t\\tu.push_back({ c[v[i]],v[i] });\\n\\t}\\n\\tsort(u.begin(), u.end(), greater<P>());\\n\\tint cnt = 0;\\n\\trep(i, u.size()) {\\n\\t\\tres.push_back(u[i].second);\\n\\t\\twhile (i + 1 < u.size() && u[i].first == u[i + 1].first) {\\n\\t\\t\\ti++; res.push_back(u[i].second);\\n\\t\\t}\\n\\t\\tcnt++; if (cnt == 1)break;\\n\\t}\\n\\tsort(res.begin(), res.end()); return res;\\n}\\nvector<int> c_rule(vector<int> v) {\\n\\tvector<int> res; c_calc();\\n\\tvector<P> u;\\n\\trep(i, v.size()) {\\n\\t\\tu.push_back({ c[v[i]],v[i] });\\n\\t}\\n\\tsort(u.begin(), u.end(), greater<P>());\\n\\tint cnt = 0;\\n\\trep(i, u.size()) {\\n\\t\\tres.push_back(u[i].second);\\n\\t\\twhile (i + 1 < u.size() && u[i].first == u[i + 1].first) {\\n\\t\\t\\ti++; res.push_back(u[i].second);\\n\\t\\t}\\n\\t\\tcnt++; if (cnt == 1)break;\\n\\t}\\n\\tsort(res.begin(), res.end()); return res;\\n}\\nvector<int> d_rule(vector<int> v) {\\n\\tvector<int> res; d_calc(v);\\n\\tvector<P> u;\\n\\trep(i, v.size()) {\\n\\t\\tu.push_back({ c[v[i]],v[i] });\\n\\t}\\n\\tsort(u.begin(), u.end(), greater<P>());\\n\\tint cnt = 0;\\n\\trep(i, u.size()) {\\n\\t\\tres.push_back(u[i].second);\\n\\t\\twhile (i + 1 < u.size() && u[i].first == u[i + 1].first) {\\n\\t\\t\\ti++; res.push_back(u[i].second);\\n\\t\\t}\\n\\t\\tcnt++; if (cnt == 1)break;\\n\\t}\\n\\tsort(res.begin(), res.end()); return res;\\n}\\nvector<int> e_rule(vector<int> v) {\\n\\tvector<int> res; e_calc(v);\\n\\tvector<P> u;\\n\\trep(i, v.size()) {\\n\\t\\tu.push_back({ c[v[i]],v[i] });\\n\\t}\\n\\tsort(u.begin(), u.end(), greater<P>());\\n\\tint cnt = 0;\\n\\trep(i, u.size()) {\\n\\t\\tres.push_back(u[i].second);\\n\\t\\twhile (i + 1 < u.size() && u[i].first == u[i + 1].first) {\\n\\t\\t\\ti++; res.push_back(u[i].second);\\n\\t\\t}\\n\\t\\tcnt++; if (cnt == 1)break;\\n\\t}\\n\\tsort(res.begin(), res.end()); return res;\\n}\\nvector<int> f_rule(vector<int> v) {\\n\\tvector<int> res; f_calc(v);\\n\\tvector<P> u;\\n\\trep(i, v.size()) {\\n\\t\\tu.push_back({ c[v[i]],v[i] });\\n\\t}\\n\\tsort(u.begin(), u.end(), greater<P>());\\n\\tint cnt = 0;\\n\\trep(i, u.size()) {\\n\\t\\tres.push_back(u[i].second);\\n\\t\\twhile (i + 1 < u.size() && u[i].first == u[i + 1].first) {\\n\\t\\t\\ti++; res.push_back(u[i].second);\\n\\t\\t}\\n\\t\\tcnt++; if (cnt == 1)break;\\n\\t}\\n\\tsort(res.begin(), res.end()); return res;\\n}\\nld ret() {\\n\\tbool one = false;\\n\\tvector<int> v = { 0,1,2,3 }; vector<int> cop;\\n\\tcop = v; v = a_rule(v);\\n\\tif (v.size() == 1 && !one) {\\n\\t\\tone = true;\\n\\t\\tif (v[0] == target)return 1;\\n\\t\\tvector<int> cv;\\n\\t\\trep(i, cop.size()) {\\n\\t\\t\\tif (v[0] == cop[i])continue;\\n\\t\\t\\tcv.push_back(cop[i]);\\n\\t\\t}\\n\\t\\tv = cv;\\n\\t\\tv = a_rule(v);\\n\\t}\\n\\tif (v.size() == 1) {\\n\\t\\tif (v[0] == target)return 1;\\n\\t\\telse return 0;\\n\\t}\\n\\tcop = v; v = b_rule(v);\\n\\tif (v.size() == 1 && !one) {\\n\\t\\tone = true;\\n\\t\\tif (v[0] == target)return 1;\\n\\t\\tvector<int> cv;\\n\\t\\trep(i, cop.size()) {\\n\\t\\t\\tif (v[0] == cop[i])continue;\\n\\t\\t\\tcv.push_back(cop[i]);\\n\\t\\t}\\n\\t\\tv = cv;\\n\\t\\tv = b_rule(v);\\n\\t}\\n\\tif (v.size() == 1) {\\n\\t\\tif (v[0] == target)return 1;\\n\\t\\telse return 0;\\n\\t}\\n\\tcop = v; v = c_rule(v);\\n\\tif (v.size() == 1 && !one) {\\n\\t\\tone = true;\\n\\t\\tif (v[0] == target)return 1;\\n\\t\\tvector<int> cv;\\n\\t\\trep(i, cop.size()) {\\n\\t\\t\\tif (v[0] == cop[i])continue;\\n\\t\\t\\tcv.push_back(cop[i]);\\n\\t\\t}\\n\\t\\tv = cv;\\n\\t\\tv = c_rule(v);\\n\\t}\\n\\tif (v.size() == 1) {\\n\\t\\tif (v[0] == target)return 1;\\n\\t\\telse return 0;\\n\\t}\\n\\tcop = v;\\n\\t\\tv = d_rule(v);\\n\\tif (v.size() == 1 && !one) {\\n\\t\\tone = true;\\n\\t\\tif (v[0] == target)return 1;\\n\\t\\tvector<int> cv;\\n\\t\\trep(i, cop.size()) {\\n\\t\\t\\tif (v[0] == cop[i])continue;\\n\\t\\t\\tcv.push_back(cop[i]);\\n\\t\\t}\\n\\t\\tv = cv;\\n\\t\\t\\tv = d_rule(v);\\n\\t}\\n\\tif (v.size() == 1) {\\n\\t\\tif (v[0] == target)return 1;\\n\\t\\telse return 0;\\n\\t}cop = v;\\n\\t\\tv = e_rule(v);\\n\\tif (v.size() == 1 && !one) {\\n\\t\\tone = true;\\n\\t\\tif (v[0] == target)return 1;\\n\\t\\tvector<int> cv;\\n\\t\\trep(i, cop.size()) {\\n\\t\\t\\tif (v[0] == i)continue;\\n\\t\\t\\tcv.push_back(cop[i]);\\n\\t\\t}\\n\\t\\tv = cv;\\n\\t\\t\\tv = e_rule(v);\\n\\t}\\n\\tif (v.size() == 1) {\\n\\t\\tif (v[0] == target)return 1;\\n\\t\\telse return 0;\\n\\t}cop = v;\\n\\t\\tv = f_rule(v);\\n\\tif (v.size() == 1 && !one) {\\n\\t\\tone = true;\\n\\t\\tif (v[0] == target)return 1;\\n\\t\\tvector<int> cv;\\n\\t\\trep(i, cop.size()) {\\n\\t\\t\\tif (v[0] == cop[i])continue;\\n\\t\\t\\tcv.push_back(cop[i]);\\n\\t\\t}\\n\\t\\tv = cv;\\n\\t\\t\\tv =f_rule(v);\\n\\t}\\n\\tif (v.size() == 1) {\\n\\t\\tif (v[0] == target)return 1;\\n\\t\\telse return 0;\\n\\t}cop = v;\\n\\t\\tv = d_rule(v);\\n\\tif (v.size() == 1 && !one) {\\n\\t\\tone = true;\\n\\t\\tif (v[0] == target)return 1;\\n\\t\\tvector<int> cv;\\n\\t\\trep(i, cop.size()) {\\n\\t\\t\\tif (v[0] == cop[i])continue;\\n\\t\\t\\tcv.push_back(cop[i]);\\n\\t\\t}\\n\\t\\tv = cv;\\n\\t\\t\\tv = d_rule(v);\\n\\t}\\n\\tif (v.size() == 1) {\\n\\t\\tif (v[0] == target)return 1;\\n\\t\\telse return 0;\\n\\t}cop = v;\\n\\t\\tv = e_rule(v);\\n\\tif (v.size() == 1 && !one) {\\n\\t\\tone = true;\\n\\t\\tif (v[0] == target)return 1;\\n\\t\\tvector<int> cv;\\n\\t\\trep(i, cop.size()) {\\n\\t\\t\\tif (v[0] == i)continue;\\n\\t\\t\\tcv.push_back(cop[i]);\\n\\t\\t}\\n\\t\\tv = cv;\\n\\t\\tv = e_rule(v);\\n\\t}\\n\\tif (v.size() == 1) {\\n\\t\\tif (v[0] == target)return 1;\\n\\t\\telse return 0;\\n\\t}cop = v;\\n\\t\\tv = f_rule(v);\\n\\tif (v.size() == 1 && !one) {\\n\\t\\tone = true;\\n\\t\\tif (v[0] == target)return 1;\\n\\t\\tvector<int> cv;\\n\\t\\trep(i, cop.size()) {\\n\\t\\t\\tif (v[0] == cop[i])continue;\\n\\t\\t\\tcv.push_back(cop[i]);\\n\\t\\t}\\n\\t\\tv = cv;\\n\\t\\t\\tv = f_rule(v);\\n\\t}\\n\\tif (v.size() == 1) {\\n\\t\\tif (v[0] == target)return 1;\\n\\t\\telse return 0;\\n\\t}cop = v;\\n\\t\\tv = d_rule(v);\\n\\tif (v.size() == 1 && !one) {\\n\\t\\tone = true;\\n\\t\\tif (v[0] == target)return 1;\\n\\t\\tvector<int> cv;\\n\\t\\trep(i, cop.size()) {\\n\\t\\t\\tif (v[0] == cop[i])continue;\\n\\t\\t\\tcv.push_back(cop[i]);\\n\\t\\t}\\n\\t\\tv = cv;\\n\\t\\t\\tv = d_rule(v);\\n\\t}\\n\\tif (v.size() == 1) {\\n\\t\\tif (v[0] == target)return 1;\\n\\t\\telse return 0;\\n\\t}cop = v;\\n\\t\\tv = e_rule(v);\\n\\tif (v.size() == 1 && !one) {\\n\\t\\tone = true;\\n\\t\\tif (v[0] == target)return 1;\\n\\t\\tvector<int> cv;\\n\\t\\trep(i, cop.size()) {\\n\\t\\t\\tif (v[0] == i)continue;\\n\\t\\t\\tcv.push_back(cop[i]);\\n\\t\\t}\\n\\t\\tv = cv;\\n\\t\\t\\tv = e_rule(v);\\n\\t}\\n\\tif (v.size() == 1) {\\n\\t\\tif (v[0] == target)return 1;\\n\\t\\telse return 0;\\n\\t}cop = v;\\n\\t\\tv = f_rule(v);\\n\\tif (v.size() == 1 && !one) {\\n\\t\\tone = true;\\n\\t\\tif (v[0] == target)return 1;\\n\\t\\tvector<int> cv;\\n\\t\\trep(i, cop.size()) {\\n\\t\\t\\tif (v[0] == cop[i])continue;\\n\\t\\t\\tcv.push_back(cop[i]);\\n\\t\\t}\\n\\t\\tv = cv;\\n\\t\\t\\tv = f_rule(v);\\n\\t}\\n\\tif (v.size() == 1) {\\n\\t\\tif (v[0] == target)return 1;\\n\\t\\telse return 0;\\n\\t}\\n\\tif (!one) {\\n\\t\\trep(i, v.size()) {\\n\\t\\t\\tif (v[i] == target) {\\n\\t\\t\\t\\treturn 2 / (ld)v.size();\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn 0;\\n\\t}\\n\\telse {\\n\\t\\trep(i, v.size()) {\\n\\t\\t\\tif (v[i] == target) {\\n\\t\\t\\t\\treturn 1 / (ld)v.size();\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn 0;\\n\\t}\\n}\\nld pos[9];\\nld pp[9];\\nvoid init() {\\n\\tpp[0] = 1;\\n\\trep1(i, 8) {\\n\\t\\tpp[i] = pp[i - 1] * i;\\n\\t}\\n\\trep(i, 9) {\\n\\t\\tpos[i] = pp[8] / (pp[i] * pp[8 - i]);\\n\\t\\trep(j, i) {\\n\\t\\t\\tpos[i] *= 0.25;\\n\\t\\t}\\n\\t\\trep(j, 8 - i) {\\n\\t\\t\\tpos[i] *= 0.75;\\n\\t\\t}\\n\\t\\t//cout << pos[i] << endl;\\n\\t}\\n}\\nP check[6] = { {1,11},{1,16},{1,21},{2,16},{2,21},{3,21} };\\nP loc[6] = { {0,1},{0,2},{0,3},{1,2},{1,3},{2,3} };\\nint main() {\\n\\tinit();\\n\\tcout << fixed << setprecision(8);\\n\\tint n; cin >> n;\\n\\trep(aa, n) {\\n\\t\\tstring s[5];\\n\\t\\trep(i, 5) {\\n\\t\\t\\tcin >> s[i];\\n\\t\\t\\tif (s[i][0] == '*')target = i-1;\\n\\t\\t}\\n\\t\\tld out = 0;\\n\\t\\t//int num = 0, hie = 0;\\n\\t\\trep(p1, 9) {\\n\\t\\t\\trep(p2, 9) {\\n\\t\\t\\t\\trep(p3, 9) {\\n\\t\\t\\t\\t\\trep(p4, 9) {\\n\\t\\t\\t\\t\\t\\tint now = 0; int cnow = 0;\\n\\t\\t\\t\\t\\t\\trep(i, 6) {\\n\\t\\t\\t\\t\\t\\t\\tint x = check[i].first; int y = check[i].second;\\n\\t\\t\\t\\t\\t\\t\\tif (s[x][y] == '_') {\\n\\t\\t\\t\\t\\t\\t\\t\\tif (cnow == 0) {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\ta[i] = { loc[i].first,loc[i].second,p1,p2 }; cnow++;\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\ta[i] = { loc[i].first,loc[i].second,p3,p4 };\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\t\\t\\ta[i] = { loc[i].first,loc[i].second,s[x][y] - '0',s[x][y + 2] - '0' };\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tout += pos[p1] * pos[p2] * pos[p3] * pos[p4] * ret();\\n\\t\\t\\t\\t\\t\\t//if (ret() == 1)num++;\\n\\t\\t\\t\\t\\t\\t//if (ret() == 0)hie++;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << out << endl;\\n\\t\\t//cout << num << \\\" \\\" << hie << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 330,\n \"memory_kb\": 3280,\n \"score_of_the_acc\": -0.2969,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1234_3075088\",\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 NUM 4\\n\\nstruct Info{\\n\\tbool operator<(const struct Info& arg) const{\\n\\n\\t\\tif(points != arg.points){\\n\\n\\t\\t\\treturn points > arg.points;\\n\\n\\t\\t}else if(goal_diff != arg.goal_diff){\\n\\n\\t\\t\\treturn goal_diff > arg.goal_diff;\\n\\t\\t}else{\\n\\t\\t\\treturn sum_goal > arg.sum_goal;\\n\\t\\t}\\n\\t}\\n\\tbool operator==(const struct Info &arg) const{\\n\\t\\treturn points == arg.points && goal_diff == arg.goal_diff && sum_goal == arg.sum_goal;\\n\\t}\\n\\n\\tint team_id,points,goal_diff,sum_goal;\\n};\\n\\nstruct Data{\\n\\tint from_team,to_team;\\n};\\n\\nstruct State{\\n\\tState(int arg_team_id,int arg_rank){\\n\\n\\t\\tteam_id = arg_team_id;\\n\\t\\trank = arg_rank;\\n\\t}\\n\\tint team_id,rank;\\n};\\n\\nint num_case;\\nchar table[5][25];\\ndouble poss_point[9];\\nInfo info[5];\\nData data[2];\\n\\n\\nint get_point(char buf[3]){\\n\\n\\tint from_point = buf[0]-'0';\\n\\tint to_point = buf[2]-'0';\\n\\n\\tif(from_point > to_point){\\n\\n\\t\\treturn 3;\\n\\n\\t}else if(from_point == to_point){\\n\\n\\t\\treturn 1;\\n\\n\\t}else{\\n\\n\\t\\treturn 0;\\n\\t}\\n}\\n\\nint get_diff(char buf[3]){\\n\\n\\tint from_point = buf[0]-'0';\\n\\tint to_point = buf[2]-'0';\\n\\n\\treturn from_point-to_point;\\n}\\n\\nvoid init(vector<int> member){\\n\\n\\tfor(int i = 0; i < member.size(); i++){\\n\\t\\tinfo[member[i]].points = 0;\\n\\t\\tinfo[member[i]].goal_diff = 0;\\n\\t\\tinfo[member[i]].sum_goal = 0;\\n\\t}\\n}\\n\\n//最大2位以内を返す関数(1位が2チーム以上あったら、即返却)\\nvector<State> select(vector<int> member){\\n\\n\\tInfo tmp_info[5];\\n\\tfor(int i = 0; i < member.size(); i++){\\n\\n\\t\\ttmp_info[member[i]].points = 0;\\n\\t\\ttmp_info[member[i]].goal_diff = 0;\\n\\t\\ttmp_info[member[i]].sum_goal = 0;\\n\\t\\ttmp_info[member[i]].team_id = member[i];\\n\\t}\\n\\n\\tint tmp_row,tmp_col,tmp;\\n\\tchar calc_buf[3];\\n\\n\\tfor(int i = 0; i < member.size()-1; i++){\\n\\t\\tfor(int k = i+1; k < member.size(); k++){\\n\\n\\t\\t\\ttmp_row = member[i];\\n\\t\\t\\ttmp_col = 4+5*(member[k]-1);\\n\\n\\t\\t\\tfor(int a = 2; a <= 4; a++){\\n\\t\\t\\t\\tcalc_buf[a-2] = table[tmp_row][tmp_col+a];\\n\\t\\t\\t}\\n\\n\\t\\t\\ttmp = get_point(calc_buf);\\n\\n\\t\\t\\tif(tmp == 1){\\n\\n\\t\\t\\t\\ttmp_info[member[i]].points += 1;\\n\\t\\t\\t\\ttmp_info[member[k]].points += 1;\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\ttmp_info[member[i]].points += tmp;\\n\\t\\t\\t\\ttmp_info[member[k]].points += 3-tmp;\\n\\t\\t\\t}\\n\\n\\t\\t\\ttmp = get_diff(calc_buf);\\n\\n\\t\\t\\ttmp_info[member[i]].goal_diff += tmp;\\n\\t\\t\\ttmp_info[member[k]].goal_diff -= tmp;\\n\\n\\t\\t\\ttmp_info[member[i]].sum_goal += calc_buf[0]-'0';\\n\\t\\t\\ttmp_info[member[k]].sum_goal += calc_buf[2]-'0';\\n\\t\\t}\\n\\t}\\n\\n\\tvector<State> ret;\\n\\tvector<Info> calc_info;\\n\\n\\tint num = (int)member.size();\\n\\t//printf(\\\"num:%d\\\\n\\\",num);\\n\\n\\tfor(int i = 0; i < num; i++){\\n\\t\\tcalc_info.push_back(tmp_info[member[i]]);\\n\\t}\\n\\n\\tsort(calc_info.begin(),calc_info.end());\\n\\n\\tint base_index = 0,rank = 0,right;\\n\\n\\twhile(ret.size() < 2 && rank < 2 && base_index < num){\\n\\n\\t\\tret.push_back(State(calc_info[base_index].team_id,rank));\\n\\n\\t\\tright = base_index+1;\\n\\t\\tif(right == num)break;\\n\\n\\t\\tif(calc_info[base_index] == calc_info[right]){\\n\\n\\t\\t\\twhile(right < num && calc_info[base_index] == calc_info[right]){\\n\\t\\t\\t\\tret.push_back(State(calc_info[right].team_id,rank));\\n\\t\\t\\t\\tright++;\\n\\t\\t\\t}\\n\\t\\t\\tbase_index = right;\\n\\n\\t\\t}else{\\n\\n\\t\\t\\tbase_index = right;\\n\\t\\t}\\n\\t\\trank++;\\n\\t}\\n\\n\\treturn ret;\\n}\\n\\nvoid func(){\\n\\n\\tint base_team,work_index,data_index = 0;\\n\\n\\tchar work[3];\\n\\tvector<int> member;\\n\\n\\tfor(int i = 1; i <= 4; i++){\\n\\t\\tmember.push_back(i);\\n\\t\\tinfo[i].team_id = i;\\n\\t}\\n\\n\\tinit(member);\\n\\n\\tint from_team,to_team,tmp;\\n\\n\\tfor(int row = 0; row <= NUM; row++){\\n\\t\\tscanf(\\\"%s\\\",table[row]);\\n\\t\\tif(table[row][0] == '*'){\\n\\t\\t\\tbase_team = row;\\n\\t\\t}\\n\\n\\t\\tif(row == 0)continue;\\n\\n\\t\\tfrom_team = row;\\n\\t\\tto_team = from_team+1;\\n\\n\\t\\tfor(int start_col = 4+5*row; start_col <= 19; start_col += 5,to_team++){\\n\\n\\t\\t\\tif(table[row][start_col+2] == '_'){ //★結果不明な組合せ★\\n\\n\\t\\t\\t\\tdata[data_index].from_team = from_team;\\n\\t\\t\\t\\tdata[data_index++].to_team = to_team;\\n\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\n\\t\\t\\twork_index = 0;\\n\\t\\t\\tfor(int i = 2; i <= 4; i++){\\n\\t\\t\\t\\twork[work_index++] = table[row][start_col+i];\\n\\t\\t\\t}\\n\\n\\t\\t\\t//勝ち点\\n\\t\\t\\ttmp = get_point(work);\\n\\n\\t\\t\\tif(tmp == 1){\\n\\n\\t\\t\\t\\tinfo[from_team].points += 1;\\n\\t\\t\\t\\tinfo[to_team].points += 1;\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tinfo[from_team].points += tmp;\\n\\t\\t\\t\\tinfo[to_team].points += 3-tmp;\\n\\t\\t\\t}\\n\\n\\t\\t\\t//goal_diff\\n\\t\\t\\ttmp = get_diff(work);\\n\\t\\t\\tinfo[from_team].goal_diff += tmp;\\n\\t\\t\\tinfo[to_team].goal_diff -= tmp;\\n\\n\\t\\t\\t//goal総数\\n\\t\\t\\tinfo[from_team].sum_goal += work[0]-'0';\\n\\t\\t\\tinfo[to_team].sum_goal += work[2]-'0';\\n\\t\\t}\\n\\t}\\n\\n\\tdouble ans = 0;\\n\\tdouble tmp_poss;\\n\\n\\tvector<State> Top_Group;\\n\\n\\tint tmp_from,tmp_to;\\n\\tint pre_size,num_decided,tmp_index,num_rank_0;\\n\\n\\tbool check[5];\\n\\tbool FLG;\\n\\n\\t//未判明の、2試合の得点を全探索\\n\\tfor(int from_1 = 0; from_1 <= 8;from_1++){\\n\\t\\tfor(int to_1 = 0; to_1 <= 8; to_1++){\\n\\t\\t\\tfor(int from_2 = 0; from_2 <= 8; from_2++){\\n\\t\\t\\t\\tfor(int to_2 = 0; to_2 <= 8; to_2++){\\n\\n\\t\\t\\t\\t\\tTop_Group.clear();\\n\\t\\t\\t\\t\\ttmp_poss = 1.0;\\n\\n\\t\\t\\t\\t\\t//まず、このトーナメント表が出来上がる確率を求める\\n\\t\\t\\t\\t\\ttmp_poss *= poss_point[from_1];\\n\\t\\t\\t\\t\\ttmp_poss *= poss_point[to_1];\\n\\t\\t\\t\\t\\ttmp_poss *= poss_point[from_2];\\n\\t\\t\\t\\t\\ttmp_poss *= poss_point[to_2];\\n\\n\\t\\t\\t\\t\\tmember.clear();\\n\\t\\t\\t\\t\\tfor(int i = 1; i <= 4; i++){\\n\\t\\t\\t\\t\\t\\tmember.push_back(i);\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t//★表を完成させる★\\n\\n\\t\\t\\t\\t\\tfor(int loop = 0; loop < 2; loop++){\\n\\n\\t\\t\\t\\t\\t\\tfrom_team = data[loop].from_team;\\n\\t\\t\\t\\t\\t\\tto_team = data[loop].to_team;\\n\\n\\t\\t\\t\\t\\t\\tif(loop == 0){\\n\\n\\t\\t\\t\\t\\t\\t\\ttmp_from = from_1;\\n\\t\\t\\t\\t\\t\\t\\ttmp_to = to_1;\\n\\n\\t\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\t\\ttmp_from = from_2;\\n\\t\\t\\t\\t\\t\\t\\ttmp_to = to_2;\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t//★テーブルを埋める★\\n\\t\\t\\t\\t\\t\\ttable[from_team][4+5*(to_team-1)+2] = '0'+tmp_from;\\n\\t\\t\\t\\t\\t\\ttable[from_team][4+5*(to_team-1)+3] = '-';\\n\\t\\t\\t\\t\\t\\ttable[from_team][4+5*(to_team-1)+4] = '0'+tmp_to;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tnum_decided = 0;\\n\\t\\t\\t\\t\\t//上位チームを選んでみる(1回目)\\n\\t\\t\\t\\t\\tTop_Group = select(member);\\n\\n\\t\\t\\t\\t\\tFLG = false;\\n\\n\\t\\t\\t\\t\\tnum_rank_0 = 0;\\n\\t\\t\\t\\t\\tfor(int k = 0; k < Top_Group.size(); k++){\\n\\n\\t\\t\\t\\t\\t\\tif(Top_Group[k].rank == 0)num_rank_0++;\\n\\n\\t\\t\\t\\t\\t\\tif(base_team == Top_Group[k].team_id){\\n\\t\\t\\t\\t\\t\\t\\ttmp_index = k;\\n\\t\\t\\t\\t\\t\\t\\tFLG = true;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tif(Top_Group.size() == 2){\\n\\n\\t\\t\\t\\t\\t\\t//上位2チームに入っていればOK、そうでなければ不可\\n\\t\\t\\t\\t\\t\\tif(FLG){\\n\\t\\t\\t\\t\\t\\t\\tans += tmp_poss;\\n\\t\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\t\\t//Do nothing\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tcontinue;\\n\\n\\t\\t\\t\\t\\t}else if(Top_Group.size() == 3){\\n\\n\\t\\t\\t\\t\\t\\t//★★上位3チームに含まれていなければ不可★★\\n\\t\\t\\t\\t\\t\\tif(!FLG)continue;\\n\\n\\t\\t\\t\\t\\t\\t//★単独1位ならOK★\\n\\t\\t\\t\\t\\t\\tif(Top_Group[tmp_index].rank == 0 && num_rank_0 == 1){\\n\\t\\t\\t\\t\\t\\t\\tans += tmp_poss;\\n\\t\\t\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t}else{ //Top_Group.size() == 4\\n\\n\\t\\t\\t\\t\\t\\t//★単独1位ならOK★\\n\\t\\t\\t\\t\\t\\tif(Top_Group[tmp_index].rank == 0 && num_rank_0 == 1){\\n\\t\\t\\t\\t\\t\\t\\tans += tmp_poss;\\n\\t\\t\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t//通過or脱落が確定した人物を取り除く\\n\\t\\t\\t\\t\\tif(num_rank_0 == (int)Top_Group.size()){ //1位が3個か4個\\n\\n\\t\\t\\t\\t\\t\\tif(num_rank_0 == 3){ //1人脱落\\n\\n\\t\\t\\t\\t\\t\\t\\tfor(int k = 1; k <= 4; k++)check[k] = false;\\n\\n\\t\\t\\t\\t\\t\\t\\tfor(int i = 0; i < Top_Group.size(); i++){\\n\\t\\t\\t\\t\\t\\t\\t\\tcheck[Top_Group[i].team_id] = true;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\tmember.clear();\\n\\n\\t\\t\\t\\t\\t\\t\\tfor(int k = 1; k <= 4; k++){\\n\\t\\t\\t\\t\\t\\t\\t\\tif(check[k]){\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tmember.push_back(k);\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t}else{ //1位が4人\\n\\t\\t\\t\\t\\t\\t\\t//Do nothing\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t}else if(num_rank_0 != (int)Top_Group.size()){ //num_rank_0が2以上なら、1ターン目で返る==Top_Groupのサイズと一致する。よって、num_rank_0 == 1\\n\\n\\t\\t\\t\\t\\t\\t\\tfor(int k = 1; k <= 4; k++)check[k] = false;\\n\\n\\t\\t\\t\\t\\t\\t\\tfor(int i = 0; i < Top_Group.size(); i++){\\n\\t\\t\\t\\t\\t\\t\\t\\tcheck[Top_Group[i].team_id] = true;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\tmember.clear();\\n\\n\\t\\t\\t\\t\\t\\t\\tfor(int k = 0; k < Top_Group.size(); k++){\\n\\t\\t\\t\\t\\t\\t\\t\\tif(Top_Group[k].rank != 0)continue;\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tnum_decided++;\\n\\t\\t\\t\\t\\t\\t\\t\\tcheck[Top_Group[k].team_id] = false; //通過が確定したので集合から除く\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t\\tfor(int k = 1; k <= 4; k++){\\n\\t\\t\\t\\t\\t\\t\\t\\tif(check[k]){\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tmember.push_back(k);\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tint debug = (int)member.size();\\n\\t\\t\\t\\t\\tpre_size = (int)member.size();\\n\\n\\t\\t\\t\\t\\t//★★2位通過が決定するまで、ループ★★\\n\\t\\t\\t\\t\\twhile(true){\\n\\n\\t\\t\\t\\t\\t\\tTop_Group = select(member);\\n\\n\\t\\t\\t\\t\\t\\tFLG = false;\\n\\t\\t\\t\\t\\t\\tnum_rank_0 = 0;\\n\\t\\t\\t\\t\\t\\tfor(int k = 0; k < Top_Group.size(); k++){\\n\\n\\t\\t\\t\\t\\t\\t\\tif(Top_Group[k].rank == 0)num_rank_0++;\\n\\n\\t\\t\\t\\t\\t\\t\\tif(base_team == Top_Group[k].team_id){\\n\\t\\t\\t\\t\\t\\t\\t\\ttmp_index = k;\\n\\t\\t\\t\\t\\t\\t\\t\\tFLG = true;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tif(num_decided+(int)Top_Group.size() == 2){ //上位2チーム決定\\n\\n\\t\\t\\t\\t\\t\\t\\tif(FLG){ //上位2チームに含まれれば良い\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tans += tmp_poss;\\n\\n\\t\\t\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\t\\t\\t//Do nothing\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\t\\t\\t\\t}else if(num_decided+num_rank_0 == 2){ //1位のチームのみ抜き出せば、上位2チーム決定\\n\\n\\t\\t\\t\\t\\t\\t\\tif(FLG == true && Top_Group[tmp_index].rank == 0){ //1位\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tans += tmp_poss;\\n\\n\\t\\t\\t\\t\\t\\t\\t}else{ //★他のチームによって枠が取られた場合★\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t//Do nothing\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\n\\t\\t\\t\\t\\t\\t//通過or脱落が確定した人物を取り除く\\n\\t\\t\\t\\t\\t\\tif(num_rank_0 == (int)Top_Group.size()){ //1位が2～4個\\n\\n\\t\\t\\t\\t\\t\\t\\tif(num_rank_0 <= 3){ //1人～2人脱落\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tfor(int k = 1; k <= 4; k++)check[k] = false;\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tfor(int i = 0; i < Top_Group.size(); i++){\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tcheck[Top_Group[i].team_id] = true;\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\tmember.clear();\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tfor(int k = 1; k <= 4; k++){\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tif(check[k]){\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tmember.push_back(k);\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t\\t}else{ //1位が4人\\n\\t\\t\\t\\t\\t\\t\\t\\t//Do nothing\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t}else if(num_rank_0 != Top_Group.size()){\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tif(FLG == true && Top_Group[tmp_index].rank == 0){ //単独1位\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tans += tmp_poss;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tfor(int k = 1; k <= 4; k++)check[k] = false;\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tfor(int i = 0; i < member.size(); i++){\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tcheck[member[i]] = true;\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\tmember.clear();\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tfor(int k = 0; k < Top_Group.size(); k++){\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tif(Top_Group[k].rank != 0)continue;\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tnum_decided++;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tcheck[Top_Group[k].team_id] = false; //通過が確定したので集合から除く\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tfor(int k = 1; k <= 4; k++){\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tif(check[k]){\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tmember.push_back(k);\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\n\\t\\t\\t\\t\\t\\tif((int)member.size() == pre_size){\\n\\n\\t\\t\\t\\t\\t\\t\\tif(FLG){\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tif(num_decided == 1){ //1つ選ぶ\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tans += tmp_poss/(double)member.size();\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t}else{ //★★★2つ選ぶ★★★\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tans += tmp_poss*2.0/(double)member.size();\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t//Do nothing\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tpre_size = (int)member.size();\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%.10lf\\\\n\\\",ans);\\n\\n}\\n\\nvoid calc_poss(){\\n\\n\\tint nCm[9][9];\\n\\n\\tfor(int i = 0; i <= 8; i++){\\n\\t\\tfor(int k = 0; k <= 8; k++)nCm[i][k]= 0;\\n\\t}\\n\\n\\tnCm[0][0] = 1;\\n\\tfor(int n = 1; n <= 8; n++) {\\n\\t\\tfor (int k = 0; k <= 8; k++) {\\n\\t\\t\\tif(k > 0){\\n\\t\\t\\t\\tnCm[n][k] = nCm[n-1][k]+nCm[n-1][k-1];\\n\\t\\t\\t}else{ //k == 0\\n\\t\\t\\t\\tnCm[n][k] = 1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tdouble poss;\\n\\n\\tfor(int point = 0; point <= 8; point++){\\n\\n\\t\\tposs = nCm[8][point];\\n\\n\\t\\tfor(int i = 0; i < point; i++){\\n\\t\\t\\tposs *= 0.25;\\n\\t\\t}\\n\\t\\tfor(int i = 0; i < 8-point; i++){\\n\\t\\t\\tposs *= 0.75;\\n\\t\\t}\\n\\t\\tposs_point[point] = poss;\\n\\t}\\n}\\n\\nint main(){\\n\\n\\tcalc_poss();\\n\\n\\tscanf(\\\"%d\\\",&num_case);\\n\\n\\tfor(int loop = 0; loop < num_case; loop++){\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 3252,\n \"score_of_the_acc\": -0.2211,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1234_3075078\",\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 NUM 4\\n\\nstruct Info{\\n\\tbool operator<(const struct Info& arg) const{\\n\\n\\t\\tif(points != arg.points){\\n\\n\\t\\t\\treturn points > arg.points;\\n\\n\\t\\t}else if(goal_diff != arg.goal_diff){\\n\\n\\t\\t\\treturn goal_diff > arg.goal_diff;\\n\\t\\t}else{\\n\\t\\t\\treturn sum_goal > arg.sum_goal;\\n\\t\\t}\\n\\t}\\n\\tbool operator==(const struct Info &arg) const{\\n\\t\\treturn points == arg.points && goal_diff == arg.goal_diff && sum_goal == arg.sum_goal;\\n\\t}\\n\\n\\tint team_id,points,goal_diff,sum_goal;\\n};\\n\\nstruct Data{\\n\\tint from_team,to_team;\\n};\\n\\nstruct State{\\n\\tState(int arg_team_id,int arg_rank){\\n\\n\\t\\tteam_id = arg_team_id;\\n\\t\\trank = arg_rank;\\n\\t}\\n\\tint team_id,rank;\\n};\\n\\nint num_case;\\nchar table[5][25];\\ndouble poss_point[9];\\nInfo info[5];\\nData data[2];\\n\\n\\nint get_point(char buf[3]){\\n\\n\\tint from_point = buf[0]-'0';\\n\\tint to_point = buf[2]-'0';\\n\\n\\tif(from_point > to_point){\\n\\n\\t\\treturn 3;\\n\\n\\t}else if(from_point == to_point){\\n\\n\\t\\treturn 1;\\n\\n\\t}else{\\n\\n\\t\\treturn 0;\\n\\t}\\n}\\n\\nint get_diff(char buf[3]){\\n\\n\\tint from_point = buf[0]-'0';\\n\\tint to_point = buf[2]-'0';\\n\\n\\treturn from_point-to_point;\\n}\\n\\nvoid init(vector<int> member){\\n\\n\\tfor(int i = 0; i < member.size(); i++){\\n\\t\\tinfo[member[i]].points = 0;\\n\\t\\tinfo[member[i]].goal_diff = 0;\\n\\t\\tinfo[member[i]].sum_goal = 0;\\n\\t}\\n}\\n\\n//最大2位以内を返す関数(1位が2チーム以上あったら、即返却)\\nvector<State> select(vector<int> member){\\n\\n\\tInfo tmp_info[5];\\n\\tfor(int i = 0; i < member.size(); i++){\\n\\n\\t\\ttmp_info[member[i]].points = 0;\\n\\t\\ttmp_info[member[i]].goal_diff = 0;\\n\\t\\ttmp_info[member[i]].sum_goal = 0;\\n\\t\\ttmp_info[member[i]].team_id = member[i];\\n\\t}\\n\\n\\tint tmp_row,tmp_col,tmp;\\n\\tchar calc_buf[3];\\n\\n\\tfor(int i = 0; i < member.size()-1; i++){\\n\\t\\tfor(int k = i+1; k < member.size(); k++){\\n\\n\\t\\t\\ttmp_row = member[i];\\n\\t\\t\\ttmp_col = 4+5*(member[k]-1);\\n\\n\\t\\t\\tfor(int a = 2; a <= 4; a++){\\n\\t\\t\\t\\tcalc_buf[a-2] = table[tmp_row][tmp_col+a];\\n\\t\\t\\t}\\n\\n\\t\\t\\ttmp = get_point(calc_buf);\\n\\n\\t\\t\\tif(tmp == 1){\\n\\n\\t\\t\\t\\ttmp_info[member[i]].points += 1;\\n\\t\\t\\t\\ttmp_info[member[k]].points += 1;\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\ttmp_info[member[i]].points += tmp;\\n\\t\\t\\t\\ttmp_info[member[k]].points += 3-tmp;\\n\\t\\t\\t}\\n\\n\\t\\t\\ttmp = get_diff(calc_buf);\\n\\n\\t\\t\\ttmp_info[member[i]].goal_diff += tmp;\\n\\t\\t\\ttmp_info[member[k]].goal_diff -= tmp;\\n\\n\\t\\t\\ttmp_info[member[i]].sum_goal += calc_buf[0]-'0';\\n\\t\\t\\ttmp_info[member[k]].sum_goal += calc_buf[2]-'0';\\n\\t\\t}\\n\\t}\\n\\n\\tvector<State> ret;\\n\\tvector<Info> calc_info;\\n\\n\\tint num = (int)member.size();\\n\\t//printf(\\\"num:%d\\\\n\\\",num);\\n\\n\\tfor(int i = 0; i < num; i++){\\n\\t\\tcalc_info.push_back(tmp_info[member[i]]);\\n\\t}\\n\\n\\tsort(calc_info.begin(),calc_info.end());\\n\\n\\tint base_index = 0,rank = 0,right;\\n\\n\\twhile(ret.size() < 2 && rank < 2 && base_index < num){\\n\\n\\t\\tret.push_back(State(calc_info[base_index].team_id,rank));\\n\\n\\t\\tright = base_index+1;\\n\\t\\tif(right == num)break;\\n\\n\\t\\tif(calc_info[base_index] == calc_info[right]){\\n\\n\\t\\t\\twhile(right < num && calc_info[base_index] == calc_info[right]){\\n\\t\\t\\t\\tret.push_back(State(calc_info[right].team_id,rank));\\n\\t\\t\\t\\tright++;\\n\\t\\t\\t}\\n\\t\\t\\tbase_index = right;\\n\\n\\t\\t}else{\\n\\n\\t\\t\\tbase_index = right;\\n\\t\\t}\\n\\t\\trank++;\\n\\t}\\n\\n\\treturn ret;\\n}\\n\\nvoid func(){\\n\\n\\tint base_team,work_index,data_index = 0;\\n\\n\\tchar work[3];\\n\\tvector<int> member;\\n\\n\\tfor(int i = 1; i <= 4; i++){\\n\\t\\tmember.push_back(i);\\n\\t\\tinfo[i].team_id = i;\\n\\t}\\n\\n\\tinit(member);\\n\\n\\tint from_team,to_team,tmp;\\n\\n\\tfor(int row = 0; row <= NUM; row++){\\n\\t\\tscanf(\\\"%s\\\",table[row]);\\n\\t\\tif(table[row][0] == '*'){\\n\\t\\t\\tbase_team = row;\\n\\t\\t}\\n\\n\\t\\tif(row == 0)continue;\\n\\n\\t\\tfrom_team = row;\\n\\t\\tto_team = from_team+1;\\n\\n\\t\\tfor(int start_col = 4+5*row; start_col <= 19; start_col += 5,to_team++){\\n\\n\\t\\t\\tif(table[row][start_col+2] == '_'){ //★結果不明な組合せ★\\n\\n\\t\\t\\t\\tdata[data_index].from_team = from_team;\\n\\t\\t\\t\\tdata[data_index++].to_team = to_team;\\n\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\n\\t\\t\\twork_index = 0;\\n\\t\\t\\tfor(int i = 2; i <= 4; i++){\\n\\t\\t\\t\\twork[work_index++] = table[row][start_col+i];\\n\\t\\t\\t}\\n\\n\\t\\t\\t//勝ち点\\n\\t\\t\\ttmp = get_point(work);\\n\\n\\t\\t\\tif(tmp == 1){\\n\\n\\t\\t\\t\\tinfo[from_team].points += 1;\\n\\t\\t\\t\\tinfo[to_team].points += 1;\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tinfo[from_team].points += tmp;\\n\\t\\t\\t\\tinfo[to_team].points += 3-tmp;\\n\\t\\t\\t}\\n\\n\\t\\t\\t//goal_diff\\n\\t\\t\\ttmp = get_diff(work);\\n\\t\\t\\tinfo[from_team].goal_diff += tmp;\\n\\t\\t\\tinfo[to_team].goal_diff -= tmp;\\n\\n\\t\\t\\t//goal総数\\n\\t\\t\\tinfo[from_team].sum_goal += work[0]-'0';\\n\\t\\t\\tinfo[to_team].sum_goal += work[2]-'0';\\n\\t\\t}\\n\\t}\\n\\n\\tdouble ans = 0;\\n\\tdouble tmp_poss;\\n\\n\\tvector<State> Top_Group;\\n\\n\\tint tmp_from,tmp_to;\\n\\tint pre_size,num_decided,tmp_index,num_rank_0;\\n\\n\\tbool check[5];\\n\\tbool FLG;\\n\\n\\t//未判明の、2試合の得点を全探索\\n\\tfor(int from_1 = 0; from_1 <= 8;from_1++){\\n\\t\\tfor(int to_1 = 0; to_1 <= 8; to_1++){\\n\\t\\t\\tfor(int from_2 = 0; from_2 <= 8; from_2++){\\n\\t\\t\\t\\tfor(int to_2 = 0; to_2 <= 8; to_2++){\\n\\n\\t\\t\\t\\t\\tTop_Group.clear();\\n\\t\\t\\t\\t\\ttmp_poss = 1.0;\\n\\n\\t\\t\\t\\t\\t//まず、このトーナメント表が出来上がる確率を求める\\n\\t\\t\\t\\t\\ttmp_poss *= poss_point[from_1];\\n\\t\\t\\t\\t\\ttmp_poss *= poss_point[to_1];\\n\\t\\t\\t\\t\\ttmp_poss *= poss_point[from_2];\\n\\t\\t\\t\\t\\ttmp_poss *= poss_point[to_2];\\n\\n\\t\\t\\t\\t\\tmember.clear();\\n\\t\\t\\t\\t\\tfor(int i = 1; i <= 4; i++){\\n\\t\\t\\t\\t\\t\\tmember.push_back(i);\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t//★表を完成させる★\\n\\n\\t\\t\\t\\t\\tfor(int loop = 0; loop < 2; loop++){\\n\\n\\t\\t\\t\\t\\t\\tfrom_team = data[loop].from_team;\\n\\t\\t\\t\\t\\t\\tto_team = data[loop].to_team;\\n\\n\\t\\t\\t\\t\\t\\tif(loop == 0){\\n\\n\\t\\t\\t\\t\\t\\t\\ttmp_from = from_1;\\n\\t\\t\\t\\t\\t\\t\\ttmp_to = to_1;\\n\\n\\t\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\t\\ttmp_from = from_2;\\n\\t\\t\\t\\t\\t\\t\\ttmp_to = to_2;\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t//★テーブルを埋める★\\n\\t\\t\\t\\t\\t\\ttable[from_team][4+5*(to_team-1)+2] = '0'+tmp_from;\\n\\t\\t\\t\\t\\t\\ttable[from_team][4+5*(to_team-1)+3] = '-';\\n\\t\\t\\t\\t\\t\\ttable[from_team][4+5*(to_team-1)+4] = '0'+tmp_to;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tnum_decided = 0;\\n\\t\\t\\t\\t\\t//上位チームを選んでみる(1回目)\\n\\t\\t\\t\\t\\tTop_Group = select(member);\\n\\n\\t\\t\\t\\t\\tFLG = false;\\n\\n\\t\\t\\t\\t\\tnum_rank_0 = 0;\\n\\t\\t\\t\\t\\tfor(int k = 0; k < Top_Group.size(); k++){\\n\\n\\t\\t\\t\\t\\t\\tif(Top_Group[k].rank == 0)num_rank_0++;\\n\\n\\t\\t\\t\\t\\t\\tif(base_team == Top_Group[k].team_id){\\n\\t\\t\\t\\t\\t\\t\\ttmp_index = k;\\n\\t\\t\\t\\t\\t\\t\\tFLG = true;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tif(Top_Group.size() == 2){\\n\\n\\t\\t\\t\\t\\t\\t//上位2チームに入っていればOK、そうでなければ不可\\n\\t\\t\\t\\t\\t\\tif(FLG){\\n\\t\\t\\t\\t\\t\\t\\tans += tmp_poss;\\n\\t\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\t\\t//Do nothing\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tcontinue;\\n\\n\\t\\t\\t\\t\\t}else if(Top_Group.size() == 3){\\n\\n\\t\\t\\t\\t\\t\\t//★★上位3チームに含まれていなければ不可★★\\n\\t\\t\\t\\t\\t\\tif(!FLG)continue;\\n\\n\\t\\t\\t\\t\\t\\t//★単独1位ならOK★\\n\\t\\t\\t\\t\\t\\tif(Top_Group[tmp_index].rank == 0 && num_rank_0 == 1){\\n\\t\\t\\t\\t\\t\\t\\tans += tmp_poss;\\n\\t\\t\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t}else{ //Top_Group.size() == 4\\n\\n\\t\\t\\t\\t\\t\\t//★単独1位ならOK★\\n\\t\\t\\t\\t\\t\\tif(Top_Group[tmp_index].rank == 0 && num_rank_0 == 1){\\n\\t\\t\\t\\t\\t\\t\\tans += tmp_poss;\\n\\t\\t\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t//通過or脱落が確定した人物を取り除く\\n\\t\\t\\t\\t\\tif(num_rank_0 == (int)Top_Group.size()){ //1位が3個か4個\\n\\n\\t\\t\\t\\t\\t\\tif(num_rank_0 == 3){ //1人脱落\\n\\n\\t\\t\\t\\t\\t\\t\\tfor(int k = 1; k <= 4; k++)check[k] = false;\\n\\n\\t\\t\\t\\t\\t\\t\\tfor(int i = 0; i < Top_Group.size(); i++){\\n\\t\\t\\t\\t\\t\\t\\t\\tcheck[Top_Group[i].team_id] = true;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\tmember.clear();\\n\\n\\t\\t\\t\\t\\t\\t\\tfor(int k = 1; k <= 4; k++){\\n\\t\\t\\t\\t\\t\\t\\t\\tif(check[k]){\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tmember.push_back(k);\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t}else{ //1位が4人\\n\\t\\t\\t\\t\\t\\t\\t//Do nothing\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t}else if(num_rank_0 != (int)Top_Group.size()){ //num_rank_0が2以上なら、1ターン目で返る==Top_Groupのサイズと一致する。よって、num_rank_0 == 1\\n\\n\\t\\t\\t\\t\\t\\t\\tfor(int k = 1; k <= 4; k++)check[k] = false;\\n\\n\\t\\t\\t\\t\\t\\t\\tfor(int i = 0; i < Top_Group.size(); i++){\\n\\t\\t\\t\\t\\t\\t\\t\\tcheck[Top_Group[i].team_id] = true;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\tmember.clear();\\n\\n\\t\\t\\t\\t\\t\\t\\tfor(int k = 0; k < Top_Group.size(); k++){\\n\\t\\t\\t\\t\\t\\t\\t\\tif(Top_Group[k].rank != 0)continue;\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tnum_decided++;\\n\\t\\t\\t\\t\\t\\t\\t\\tcheck[Top_Group[k].team_id] = false; //通過が確定したので集合から除く\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t\\tfor(int k = 1; k <= 4; k++){\\n\\t\\t\\t\\t\\t\\t\\t\\tif(check[k]){\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tmember.push_back(k);\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tint debug = (int)member.size();\\n\\t\\t\\t\\t\\tpre_size = (int)member.size();\\n\\n\\t\\t\\t\\t\\t//★★2位通過が決定するまで、ループ★★\\n\\t\\t\\t\\t\\twhile(true){\\n\\n\\t\\t\\t\\t\\t\\tTop_Group = select(member);\\n\\n\\t\\t\\t\\t\\t\\tFLG = false;\\n\\t\\t\\t\\t\\t\\tnum_rank_0 = 0;\\n\\t\\t\\t\\t\\t\\tfor(int k = 0; k < Top_Group.size(); k++){\\n\\n\\t\\t\\t\\t\\t\\t\\tif(Top_Group[k].rank == 0)num_rank_0++;\\n\\n\\t\\t\\t\\t\\t\\t\\tif(base_team == Top_Group[k].team_id){\\n\\t\\t\\t\\t\\t\\t\\t\\ttmp_index = k;\\n\\t\\t\\t\\t\\t\\t\\t\\tFLG = true;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tif(num_decided+(int)Top_Group.size() == 2){ //上位2チーム決定\\n\\n\\t\\t\\t\\t\\t\\t\\tif(FLG){ //上位2チームに含まれれば良い\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tans += tmp_poss;\\n\\n\\t\\t\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\t\\t\\t//Do nothing\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\t\\t\\t\\t}else if(num_decided+num_rank_0 == 2){ //1位のチームのみ抜き出せば、上位2チーム決定\\n\\n\\t\\t\\t\\t\\t\\t\\tif(FLG == true && Top_Group[tmp_index].rank == 0){ //1位\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tans += tmp_poss;\\n\\n\\t\\t\\t\\t\\t\\t\\t}else{ //★他のチームによって枠が取られた場合★\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t//Do nothing\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\n\\t\\t\\t\\t\\t\\t//通過or脱落が確定した人物を取り除く\\n\\t\\t\\t\\t\\t\\tif(num_rank_0 == (int)Top_Group.size()){ //1位が2～4個\\n\\n\\t\\t\\t\\t\\t\\t\\tif(num_rank_0 <= 1){\\n\\t\\t\\t\\t\\t\\t\\t\\tprintf(\\\"Screw\\\\n\\\");\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t\\tif(num_rank_0 <= 3){ //1人～2人脱落\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tfor(int k = 1; k <= 4; k++)check[k] = false;\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tfor(int i = 0; i < Top_Group.size(); i++){\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tcheck[Top_Group[i].team_id] = true;\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\tmember.clear();\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tfor(int k = 1; k <= 4; k++){\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tif(check[k]){\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tmember.push_back(k);\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t\\t}else{ //1位が4人\\n\\t\\t\\t\\t\\t\\t\\t\\t//Do nothing\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t}else if(num_rank_0 != Top_Group.size()){\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tif(num_rank_0 >= 2){\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tprintf(\\\"ABAB498\\\\n\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tif(FLG == true && Top_Group[tmp_index].rank == 0){ //単独1位\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tans += tmp_poss;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tfor(int k = 1; k <= 4; k++)check[k] = false;\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tfor(int i = 0; i < member.size(); i++){\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tcheck[member[i]] = true;\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\tmember.clear();\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tfor(int k = 0; k < Top_Group.size(); k++){\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tif(Top_Group[k].rank != 0)continue;\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tnum_decided++;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tcheck[Top_Group[k].team_id] = false; //通過が確定したので集合から除く\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tfor(int k = 1; k <= 4; k++){\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tif(check[k]){\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tmember.push_back(k);\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\n\\t\\t\\t\\t\\t\\tif((int)member.size() == pre_size){\\n\\n\\t\\t\\t\\t\\t\\t\\tif(FLG){\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tif(num_decided == 1){\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tans += tmp_poss/(double)member.size();\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tans += tmp_poss*2.0/(double)member.size();\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t//Do nothing\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tpre_size = (int)member.size();\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%.10lf\\\\n\\\",ans);\\n\\n}\\n\\nvoid calc_poss(){\\n\\n\\tint nCm[9][9];\\n\\n\\tfor(int i = 0; i <= 8; i++){\\n\\t\\tfor(int k = 0; k <= 8; k++)nCm[i][k]= 0;\\n\\t}\\n\\n\\tnCm[0][0] = 1;\\n\\tfor(int n = 1; n <= 8; n++) {\\n\\t\\tfor (int k = 0; k <= 8; k++) {\\n\\t\\t\\tif(k > 0){\\n\\t\\t\\t\\tnCm[n][k] = nCm[n-1][k]+nCm[n-1][k-1];\\n\\t\\t\\t}else{ //k == 0\\n\\t\\t\\t\\tnCm[n][k] = 1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tdouble poss;\\n\\n\\tfor(int point = 0; point <= 8; point++){\\n\\n\\t\\tposs = nCm[8][point];\\n\\n\\t\\tfor(int i = 0; i < point; i++){\\n\\t\\t\\tposs *= 0.25;\\n\\t\\t}\\n\\t\\tfor(int i = 0; i < 8-point; i++){\\n\\t\\t\\tposs *= 0.75;\\n\\t\\t}\\n\\t\\tposs_point[point] = poss;\\n\\t}\\n}\\n\\nint main(){\\n\\n\\tcalc_poss();\\n\\t//return 0;\\n\\n\\tscanf(\\\"%d\\\",&num_case);\\n\\n\\tfor(int loop = 0; loop < num_case; loop++){\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 3112,\n \"score_of_the_acc\": -0.0176,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1234_3040843\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define double long double\\n#define int long long\\nusing namespace std;\\n\\ntypedef pair<int,int> P;\\ntypedef pair<string,string> P1;\\ntypedef pair<int,string> P2;\\ntypedef pair<P,P2> P3;\\n\\nint fac(int n){\\n int res = 1;\\n for(int i=1;i<=n;i++) res *= i;\\n return res;\\n}\\n\\ndouble get(int i){\\n return fac(8) * pow(1.0/4,i) * pow(3.0/4,8-i) / ( fac(i) * fac( 8 - i ) );\\n}\\n\\nstring s[5];\\nstring target;\\ndouble ans;\\n\\nvector<P3> calcOrder(set<string> teams){\\n \\n map<string,int> points, diff, ggoals;\\n \\n for(int i=0;i<5;i++){\\n \\n for(int j=0;j<(int)s[i].size();j++){\\n \\n if( s[i][j] != '-' ) continue;\\n \\n string t1 = s[i].substr( 1, 3 );\\n string t2 = s[0].substr( j - 1, 3 );\\n \\n if( teams.count(t1) == 0 ) continue;\\n if( teams.count(t2) == 0 ) continue;\\n \\n int t1p = s[i][j-1] - '0';\\n int t2p = s[i][j+1] - '0';\\n \\n if( t1p > t2p ) points[t1] += 3;\\n if( t1p == t2p ) points[t1]++, points[t2]++;\\n if( t1p < t2p ) points[t2] += 3;\\n \\n diff[t1] += t1p - t2p;\\n diff[t2] += t2p - t1p;\\n \\n ggoals[t1] += t1p;\\n ggoals[t2] += t2p;\\n \\n }\\n \\n }\\n \\n vector<P3> res;\\n \\n for(string team : teams){\\n res.push_back(P3(P(points[team],diff[team]),P2(ggoals[team],team)));\\n }\\n \\n sort( res.begin(), res.end(), greater<P3>() );\\n \\n return res;\\n}\\n\\nvoid cal(double p){\\n \\n set<string> teams;\\n \\n for(int i=0;i<5;i++){\\n \\n for(int j=0;j<(int)s[i].size();j++){\\n \\n if( s[i][j] != '-' ) continue;\\n \\n string t1 = s[i].substr( 1, 3 );\\n string t2 = s[0].substr( j - 1, 3 );\\n \\n teams.insert(t1);\\n teams.insert(t2);\\n \\n }\\n \\n }\\n \\n vector<P3> order = calcOrder( teams );\\n \\n int cnt = 5, add = 0, L, R;\\n \\n while(cnt--){\\n \\n int A, B, C;\\n \\n for(int i=0;i<(int)order.size();i++){\\n \\n if( order[i].second.second == target ){\\n\\tA = order[i].first.first;\\n\\tB = order[i].first.second;\\n\\tC = order[i].second.first;\\n }\\n \\n }\\n \\n int l = 4, r = 0;\\n \\n for(int i=0;i<(int)order.size();i++){\\n \\n if( A == order[i].first.first && B == order[i].first.second && C == order[i].second.first ){\\n \\n\\tl = min( l, i );\\n\\tr = max( r, i );\\n \\n }\\n \\n }\\n \\n teams.clear();\\n \\n for(int i=l;i<=r;i++) teams.insert( order[i].second.second );\\n \\n add += l;\\n \\n L = l, R = r;\\n \\n order = calcOrder( teams );\\n \\n }\\n \\n if( L == R ){\\n \\n if( add <= 1 ) ans += p;\\n \\n }else{\\n \\n if( add <= 1 ){\\n \\n double chance = 1 - add + 1;\\n double all = R - L + 1;\\n \\n ans += p * chance / all;\\n \\n }\\n \\n }\\n \\n}\\n\\nvector<P> YX;\\n\\nsigned main(){\\n \\n int T;\\n cin>>T;\\n \\n while(T--){\\n \\n YX.clear();\\n ans = 0;\\n \\n for(int i=0;i<5;i++) cin>>s[i];\\n \\n for(int i=0;i<(int)s[0].size();i++){\\n if( s[0][i] == '*' ) target = s[0].substr( i + 1, 3 );\\n }\\n \\n for(int i=0;i<5;i++){\\n for(int j=0;j<(int)s[i].size();j++){\\n\\tif( s[i][j] == '-' && s[i][j-1] == '_' ) YX.push_back(P(i,j-1));\\n\\n\\tif( s[i][j] == '-' && s[i][j+1] == '_' ) YX.push_back(P(i,j+1));\\n }\\n }\\n \\n for(int i=0;i<=8;i++){\\n for(int j=0;j<=8;j++){\\n\\tfor(int k=0;k<=8;k++){\\n\\t for(int l=0;l<=8;l++){\\n\\t \\n\\t s[YX[0].first][YX[0].second] = i + '0';\\n\\t s[YX[1].first][YX[1].second] = j + '0';\\n\\t s[YX[2].first][YX[2].second] = k + '0';\\n\\t s[YX[3].first][YX[3].second] = l + '0';\\n\\t \\n\\t cal( get(i) * get(j) * get(k) * get(l) );\\n\\t \\n\\t }\\n\\t}\\n }\\n }\\n \\n printf(\\\"%.7Lf\\\\n\\\", ans);\\n\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5180,\n \"memory_kb\": 3472,\n \"score_of_the_acc\": -1.5233,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1234_2996375\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define r(i,n) for(int i=0;i<n;i++)\\nusing namespace std;\\ntypedef pair<int,int>P;\\ntypedef pair<P,P>P2;\\n#define F first\\n#define S second\\nint a[4][4],kati[4],goal[4],goaled[4],gdiff[4],id;\\nstring s[5];\\nvoid Perse(){\\n\\tmemset(a,0,sizeof(a));\\n\\ta[0][1]=s[1][11]-'0';\\n\\ta[0][2]=s[1][16]-'0';\\n\\ta[0][3]=s[1][21]-'0';\\n\\ta[1][0]=s[1][13]-'0';\\n\\ta[1][2]=s[2][16]-'0';\\n\\ta[1][3]=s[2][21]-'0';\\n\\ta[2][0]=s[1][18]-'0';\\n\\ta[2][1]=s[2][18]-'0';\\n\\ta[2][3]=s[3][21]-'0';\\n\\ta[3][0]=s[1][23]-'0';\\n\\ta[3][1]=s[2][23]-'0';\\n\\ta[3][2]=s[3][23]-'0';\\n\\tr(i,5)if(s[i][0]=='*')id=i-1;\\n}\\nvector<P>use;\\nvoid FILL(vector<char> v){\\n\\tint c=0;\\n\\tif(s[1][11]=='_')s[1][11]=v[c++],use.push_back(P(1,11));\\n\\tif(s[1][16]=='_')s[1][16]=v[c++],use.push_back(P(1,16));\\n\\tif(s[1][21]=='_')s[1][21]=v[c++],use.push_back(P(1,21));\\n\\tif(s[1][13]=='_')s[1][13]=v[c++],use.push_back(P(1,13));\\n\\tif(s[2][16]=='_')s[2][16]=v[c++],use.push_back(P(2,16));\\n\\tif(s[2][21]=='_')s[2][21]=v[c++],use.push_back(P(2,21));\\n\\tif(s[1][18]=='_')s[1][18]=v[c++],use.push_back(P(1,18));\\n\\tif(s[2][18]=='_')s[2][18]=v[c++],use.push_back(P(2,18));\\n\\tif(s[3][21]=='_')s[3][21]=v[c++],use.push_back(P(3,21));\\n\\tif(s[1][23]=='_')s[1][23]=v[c++],use.push_back(P(1,23));\\n\\tif(s[2][23]=='_')s[2][23]=v[c++],use.push_back(P(2,23));\\n\\tif(s[3][23]=='_')s[3][23]=v[c++],use.push_back(P(3,23));\\n}\\n\\nvoid calc(vector<int> v){\\n\\tmemset(kati,0,sizeof(kati));\\n\\tmemset(goal,0,sizeof(goal));\\n\\tmemset(gdiff,0,sizeof(gdiff));\\n\\tmemset(goaled,0,sizeof(goaled));\\n\\tint c[4]={};\\n\\tr(i,v.size())c[v[i]]=1;\\n\\tr(i,4)if(c[i]){\\n\\t\\tr(j,4)if(c[j])if(i!=j){\\n\\t\\t\\tif(a[i][j]>a[j][i])kati[i]+=3;\\n\\t\\t\\telse if(a[i][j]==a[j][i])kati[i]+=1;\\n\\t\\t\\tgoal[i]+=a[i][j];\\n\\t\\t\\tgoaled[i]+=a[j][i];\\n\\t\\t}\\n\\t\\tgdiff[i]=goal[i]-goaled[i];\\n\\t}\\n}\\n\\nvoid END(){\\n\\texit(0);\\n}\\n\\ndouble get_score(){\\n\\tPerse();\\n\\tvector<int>v;\\n\\tint ue=0;\\n\\tr(i,4)v.push_back(i);\\n\\tint CC=10;\\n\\twhile(CC--){\\n\\t\\tcalc(v);\\n\\t\\tvector<P2>sco;\\n\\t\\tr(i,v.size()){\\n\\t\\t\\tsco.push_back(P2(P(kati[v[i]],gdiff[v[i]]),P(goal[v[i]],v[i])));\\n\\t\\t}\\n\\t\\tsort(sco.begin(),sco.end(),greater<P2>());\\n\\t\\tint cnt=0;\\n\\t\\tvector<int>vip[4];\\n\\t\\tvip[0].push_back(sco[0].S.S);\\n\\t\\tr(i,sco.size()-1){\\n\\t\\t\\tif(sco[i].F.F==sco[i+1].F.F&&\\n\\t\\t\\t\\tsco[i].F.S==sco[i+1].F.S&&\\n\\t\\t\\t\\t\\tsco[i].S.F==sco[i+1].S.F){\\n\\t\\t\\t\\t\\t\\tvip[cnt].push_back(sco[i+1].S.S);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\telse{\\n\\t\\t\\t\\tvip[++cnt].push_back(sco[i+1].S.S);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tv.clear();\\n\\t\\tr(i,4){\\n\\t\\t\\tr(j,vip[i].size()){\\n\\t\\t\\t\\tif(vip[i][j]==id){\\n\\t\\t\\t\\t\\tif(i==0&&vip[i].size()==1){\\n\\t\\t\\t\\t\\t\\tif(ue<=1)return 1;\\n\\t\\t\\t\\t\\t\\telse return 0;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tr(k,vip[i].size()){\\n\\t\\t\\t\\t\\t\\tv.push_back(vip[i][k]);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tgoto L;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tue+=vip[i].size();\\n\\t\\t}\\n\\t\\tL:;\\n\\t}\\n\\treturn (2.0-ue)/v.size();\\n}\\ndouble kai[10];\\nint main(){\\n\\tint test;\\n\\tcin>>test;\\n\\tkai[0]=kai[1]=1;\\n\\tfor(int i=2;i<10;i++) kai[i]=kai[i-1]*i;\\n\\twhile(test--){\\n\\t\\tdouble ans=0;\\n\\t\\tr(i,5)cin>>s[i];\\n\\t\\tr(i,9)r(j,9)r(k,9)r(l,9){\\n\\t\\t\\tdouble d1=(kai[8]/(kai[i]*kai[8-i]))*pow(0.25,i)*pow(0.75,8-i);\\n\\t\\t\\tdouble d2=(kai[8]/(kai[j]*kai[8-j]))*pow(0.25,j)*pow(0.75,8-j);\\n\\t\\t\\tdouble d3=(kai[8]/(kai[k]*kai[8-k]))*pow(0.25,k)*pow(0.75,8-k);\\n\\t\\t\\tdouble d4=(kai[8]/(kai[l]*kai[8-l]))*pow(0.25,l)*pow(0.75,8-l);\\n\\t\\t\\tvector<char>v;\\n\\t\\t\\tv.push_back(char(i+'0'));\\n\\t\\t\\tv.push_back(char(j+'0'));\\n\\t\\t\\tv.push_back(char(k+'0'));\\n\\t\\t\\tv.push_back(char(l+'0'));\\n\\t\\t\\tFILL(v);\\n\\t\\t\\tans+=d1*d2*d3*d4*get_score();\\n\\t\\t\\tr(m,4){\\n\\t\\t\\t\\ts[use[m].F][use[m].S]='_';\\n\\t\\t\\t}\\n\\t\\t\\tuse.clear();\\n\\t\\t}\\n\\t\\tprintf(\\\"%.9f\\\\n\\\",ans);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 390,\n \"memory_kb\": 3276,\n \"score_of_the_acc\": -0.3028,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1234_2832654\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing pii = pair<int, int>;\\n\\nstruct team {\\n int id;\\n int goal, score, goal_diff;\\n\\n team() : id(-1), goal(0), score(0), goal_diff(0) {}\\n\\n bool operator<(const team& t) const {\\n if(score != t.score) return score < t.score;\\n if(goal_diff != t.goal_diff) return goal_diff < t.goal_diff;\\n return goal < t.goal;\\n }\\n bool operator==(const team& t) const {\\n return score == t.score && goal_diff == t.goal_diff && goal == t.goal;\\n }\\n};\\n\\nint main() {\\n cout << fixed << setprecision(7);\\n\\n vector<double> possibility(9);\\n vector<double> fact(9, 1);\\n for(int i = 2; i <= 8; ++i) {\\n fact[i] = fact[i - 1] * i;\\n }\\n for(int i = 0; i <= 8; ++i) {\\n possibility[i] = fact[8] / fact[i] / fact[8 - i] * pow(0.25, i) * pow(0.75, 8 - i);\\n }\\n\\n int T;\\n cin >> T;\\n while(T--) {\\n int target = 0;\\n vector<team> teams(4);\\n vector<vector<int>> goal(4, vector<int>(4));\\n for(int i = 0; i < 4; ++i) {\\n teams[i].id = i;\\n }\\n\\n auto calc_scores = [](team& t1, team& t2, int g1, int g2) {\\n t1.goal += g1;\\n t1.goal_diff += g1 - g2;\\n t2.goal += g2;\\n t2.goal_diff += g2 - g1;\\n if(g1 > g2) {\\n t1.score += 3;\\n } else if(g2 > g1) {\\n t2.score += 3;\\n } else {\\n t1.score += 1;\\n t2.score += 1;\\n }\\n };\\n\\n vector<pii> not_yet;\\n for(int i = 0; i < 5; ++i) {\\n string s;\\n cin >> s;\\n if(s[0] == '*') {\\n target = i - 1;\\n }\\n if(i == 0) continue;\\n for(int j = 6 + i * 5; j <= 21; j += 5) {\\n int a = i - 1, b = (j - 6) / 5;\\n if(s[j] == '_') {\\n not_yet.emplace_back(a, b);\\n continue;\\n }\\n calc_scores(teams[a], teams[b], s[j] - '0', s[j + 2] - '0');\\n goal[a][b] = s[j] - '0';\\n goal[b][a] = s[j + 2] - '0';\\n }\\n }\\n assert(not_yet.size() == 2);\\n\\n function<double(vector<team>, int, int)> order = [&](vector<team> teams, int rest, int prev_size) {\\n const int n = teams.size();\\n double res = 0;\\n sort(rbegin(teams), rend(teams));\\n for(int i = 0; i < n && rest > 0; ++i) {\\n vector<team> concerned(1);\\n concerned[0].id = teams[i].id;\\n while(i + 1 < n && teams[i] == teams[i + 1]) {\\n team new_team;\\n new_team.id = teams[++i].id;\\n concerned.push_back(move(new_team));\\n }\\n const int m = concerned.size();\\n\\n if(m == prev_size) {\\n bool found = false;\\n for(auto& t : concerned) {\\n found |= t.id == target;\\n }\\n\\n return found ? min((double)rest / m, 1.0) : 0.0;\\n } else {\\n for(int ti = 0; ti < m; ++ti) {\\n for(int tj = ti + 1; tj < m; ++tj) {\\n const int i1 = concerned[ti].id, i2 = concerned[tj].id;\\n calc_scores(concerned[ti], concerned[tj], goal[i1][i2], goal[i2][i1]);\\n }\\n }\\n res += order(concerned, rest, m);\\n }\\n\\n rest -= m;\\n }\\n\\n return res;\\n };\\n\\n double ans = 0;\\n for(int i = 0; i <= 8; ++i) {\\n for(int j = 0; j <= 8; ++j) {\\n for(int k = 0; k <= 8; ++k) {\\n for(int l = 0; l <= 8; ++l) {\\n const int a = not_yet[0].first, b = not_yet[0].second;\\n const int c = not_yet[1].first, d = not_yet[1].second;\\n auto tmp_teams = teams;\\n calc_scores(tmp_teams[a], tmp_teams[b], i, j);\\n calc_scores(tmp_teams[c], tmp_teams[d], k, l);\\n goal[a][b] = i, goal[b][a] = j;\\n goal[c][d] = k, goal[d][c] = l;\\n ans += order(tmp_teams, 2, 4) * possibility[i] * possibility[j] * possibility[k] * possibility[l];\\n }\\n }\\n }\\n }\\n\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 3420,\n \"score_of_the_acc\": -0.4653,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1234_2709754\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <cmath>\\n#include <utility>\\n#include <iomanip>\\nusing namespace std;\\ndouble fact(int n){\\n if(n==0) return 1;\\n return n*fact(n-1);\\n}\\n\\ndouble solve(int t, int r, vector<int> tl, vector<vector<int> > &score){\\n int n = tl.size();\\n vector<int> gp(n, 0), gd(n, 0), gn(n, 0);\\n vector<pair<pair<pair<int,int>, int>, int> > cmp(n);\\n for(int i=0; i<n; i++){\\n for(int j=i+1; j<n; j++){\\n int ti = tl[i], tj = tl[j];\\n gd[i] += score[ti][tj] -score[tj][ti];\\n gd[j] += score[tj][ti] -score[ti][tj];\\n gn[i] += score[ti][tj];\\n gn[j] += score[tj][ti];\\n if(score[ti][tj] < score[tj][ti]){\\n gp[j] += 3;\\n }else if(score[ti][tj] > score[tj][ti]){\\n gp[i] += 3;\\n }else{\\n gp[i]++;\\n gp[j]++;\\n }\\n }\\n }\\n for(int i=0; i<n; i++){\\n cmp[i] = make_pair(make_pair(make_pair(-gp[i], -gd[i]), -gn[i]), i);\\n }\\n sort(cmp.begin(), cmp.end());\\n vector<int> ord(n);\\n for(int i=0; i<n; i++) ord[i] = cmp[i].second;\\n\\n int samecount=1;\\n int start=0;\\n for(int i=1; i<n; i++){\\n if(gp[ord[i]]==gp[ord[0]] && gd[ord[i]]==gd[ord[0]] && gn[ord[i]]==gn[ord[0]]){\\n samecount++;\\n }else{\\n break;\\n }\\n }\\n if(samecount==n){\\n return (double)r/n;\\n }\\n\\n if(samecount==1 && r==2){\\n if(tl[ord[0]]==t){\\n return 1;\\n }else{\\n start = 1;\\n samecount = 1;\\n r--;\\n for(int i=2; i<n; i++){\\n if(gp[ord[i]]==gp[ord[1]] && gd[ord[i]]==gd[ord[1]] && gn[ord[i]]==gn[ord[1]]){\\n samecount++;\\n }else{\\n break;\\n }\\n }\\n }\\n }\\n\\n for(int i=start+samecount; i<n; i++){\\n if(tl[ord[i]] == t) return 0;\\n }\\n if(samecount==r){\\n return 1;\\n }\\n vector<int> ntl(samecount);\\n for(int i=0; i<samecount; i++){\\n ntl[i] = tl[ord[start +i]];\\n }\\n return solve(t, r, ntl, score);\\n}\\n\\nint main(){\\n double table[9];\\n for(int i=0; i<=8; i++){\\n table[i] = fact(8) /(fact(i)*fact(8-i)) *pow(0.25, i) *pow(0.75, 8-i);\\n }\\n cout << fixed;\\n cout << setprecision(7);\\n \\n int ds;\\n cin >> ds;\\n for(int r=0; r<ds; r++){\\n string s;\\n cin >> s;\\n int t;\\n vector<vector<int> > score(4, vector<int>(4, 0));\\n vector<vector<int> > emp(2);\\n for(int i=0; i<4; i++){\\n cin >> s;\\n if(s[0]=='*') t=i;\\n for(int j=i+1; j<4; j++){\\n int fs = 6 +5*j;\\n int ss = fs +2;\\n if(s[fs]=='_'){\\n emp[0].push_back(i);\\n emp[1].push_back(j);\\n }else{\\n score[i][j] = s[fs]-'0';\\n score[j][i] = s[ss]-'0';\\n }\\n }\\n }\\n\\n double ans=0;\\n vector<int> tl(4);\\n for(int i=0; i<4; i++) tl[i]=i;\\n for(int i=0; i<=8; i++){\\n for(int j=0; j<=8; j++){\\n for(int k=0; k<=8; k++){\\n for(int l=0; l<=8; l++){\\n score[emp[0][0]][emp[1][0]] = i;\\n score[emp[1][0]][emp[0][0]] = j;\\n score[emp[0][1]][emp[1][1]] = k;\\n score[emp[1][1]][emp[0][1]] = l;\\n ans += table[i]*table[j]*table[k]*table[l] *solve(t, 2, tl, score);\\n }\\n }\\n }\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 3212,\n \"score_of_the_acc\": -0.1571,\n \"final_rank\": 5\n }\n]","isConversational":false}}},{"rowIdx":695,"cells":{"group_id":{"kind":"string","value":"aoj_1233_cpp"},"problem_description":{"kind":"string","value":"Problem B:\nEquals are Equals\nMr. Simpson got up with a slight feeling of tiredness. It was the start of another day of hard work. A bunch of papers were waiting for his inspection on his desk in his office. The papers contained his students' answers to questions in his Math class, but the answers looked as if they were just stains of ink.\nHis headache came from the ``creativity'' of his students. They provided him a variety of ways to answer each problem. He has his own answer to each problem, which is correct, of course, and the best from his aesthetic point of view.\nSome of his students wrote algebraic expressions equivalent to the expected answer, but many of them look quite different from Mr. Simpson's answer in terms of their literal forms. Some wrote algebraic expressions not equivalent to his answer, but they look quite similar to it. Only a few of the students' answers were exactly the same as his.\nIt is his duty to check if each expression is mathematically equivalent to the answer he has prepared. This is to prevent expressions that are equivalent to his from being marked as ``incorrect'', even if they are not acceptable to his aesthetic moral.\nHe had now spent five days checking the expressions. Suddenly, he stood up and yelled, ``I've had enough! I must call for help.''\nYour job is to write a program to help Mr. Simpson to judge if each answer is equivalent to the ``correct'' one. Algebraic expressions written on the papers are multi-variable polynomials over variable symbols\na\n,\nb\n,...,\nz\nwith integer coefficients, e.g.,\n\n(\na\n+\nb\n2\n)(\na\n-\nb\n2\n),\nax\n2\n+2\nbx\n+\nc\nand (\nx\n2\n+5\nx\n+ 4)(\nx\n2\n+ 5\nx\n+ 6) + 1.\nMr. Simpson will input every answer expression as it is written on the papers; he promises you that an algebraic expression he inputs is a sequence of terms separated by additive operators `\n+\n' and `\n-\n', representing the sum of the terms with those operators, if any; a term is a juxtaposition of multiplicands, representing their product; and a multiplicand is either (a) a non-negative integer as a digit sequence in decimal, (b) a variable symbol (one of the lowercase letters `\na\n' to `\nz\n'), possibly followed by a symbol `\n^\n' and a non-zero digit, which represents the power of that variable, or (c) a parenthesized algebraic expression, recursively. Note that the operator `\n+\n' or `\n-\n' appears only as a binary operator and not as a unary operator to specify the sing of its operand.\nHe says that he will put one or more space characters before an integer if it immediately follows another integer or a digit following the symbol `\n^\n'. He also says he may put spaces here and there in an expression as an attempt to make it readable, but he will never put a space between two consecutive digits of an integer. He remarks that the expressions are not so complicated, and that any expression, having its `\n-\n's replaced with `\n+\n's, if any, would have no variable raised to its 10th power, nor coefficient more than a billion, even if it is fully e\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1233_8484392","code_snippet":"#include <bits/stdc++.h>\n\nconstexpr int W = 26;\nusing Var = std::array<int, W>;\nstd::ostream& operator<<(std::ostream& os, const Var& var) {\n os << '(';\n for (int i = 0; i < W; i++) {\n if (var[i] == 0) continue;\n os << '(' << (char)(i + 'a') << '^' << var[i] << ')';\n }\n os << ')';\n return os;\n}\n\nVar op(const Var& lhs, const Var& rhs) {\n Var res;\n res.fill(0);\n for (int i = 0; i < W; i++) {\n res[i] = lhs[i] + rhs[i];\n }\n return res;\n}\n\nstruct Poly {\n // data[var] = coef;\n std::map<Var, long long> data;\n\n Poly(long long value = 0) {\n Var var;\n var.fill(0);\n data[var] = value;\n }\n Poly(char c, int exp = 1) {\n Var var;\n var.fill(0);\n var[c - 'a'] += exp;\n data[var] = 1;\n }\n\n friend Poly operator+(const Poly& lhs, const Poly& rhs) {\n if (lhs.data.size() > rhs.data.size()) return rhs + lhs;\n auto res = rhs;\n for (const auto& [var, coef]: lhs.data) {\n res.data[var] += coef;\n }\n return res;\n }\n\n friend Poly operator-(const Poly& lhs, const Poly& rhs) {\n auto res = lhs;\n for (const auto& [var, coef]: rhs.data) {\n res.data[var] -= coef;\n }\n return res;\n }\n\n friend Poly operator*(const Poly& lhs, const Poly& rhs) {\n Poly res;\n for (const auto& [var1, coef1]: lhs.data) {\n for (const auto& [var2, coef2]: rhs.data) {\n res.data[op(var1, var2)] += coef1 * coef2;\n }\n }\n return res;\n }\n\n friend bool operator==(Poly& lhs, Poly& rhs) {\n for (const auto& [var, coef]: lhs.data) {\n if (rhs.data[var] != coef) return false;\n }\n for (const auto& [var, coef]: rhs.data) {\n if (lhs.data[var] != coef) return false;\n }\n return true;\n }\n\n Poly pow(int exp) {\n Poly base(*this);\n Poly res;\n while (exp > 0) {\n if (exp & 1) res = res + base;\n base = base + base;\n exp >>= 1;\n }\n return res;\n }\n\n friend std::ostream& operator<<(std::ostream& os, const Poly& poly) {\n for (const auto& [var, coef]: poly.data) {\n if (coef == 0) continue;\n if (coef > 0) {\n os << '+';\n }\n os << coef << var << ' ';\n }\n return os;\n }\n};\n\nstruct Parser {\n using CopyIter = std::string::const_iterator;\n using Iter = CopyIter&;\n std::string line;\n Parser() {}\n void skip(Iter it, char c) {\n // std::cerr << *it << ' ' << c << std::endl;\n assert(*it == c);\n ++it;\n }\n void skip_space(Iter it) {\n while (it != line.end() && *it == ' ') ++it;\n }\n\n Poly parse(const std::string& s) {\n line = s;\n auto it = line.cbegin();\n auto res = expr(it);\n assert(it == line.end());\n return res;\n }\n\n Poly expr(Iter it) {\n auto res = term(it);\n\n while (it != line.end() && (*it == '+' || *it == '-')) {\n if (*it == '+') {\n skip(it, '+');\n skip_space(it);\n res = res + term(it);\n } else {\n skip(it, '-');\n skip_space(it);\n res = res - term(it);\n }\n }\n\n skip_space(it);\n return res;\n }\n\n Poly term(Iter it) {\n auto res = factor(it);\n\n while (it != line.end() && *it != '+' && *it != '-' && *it != ')') {\n res = res * factor(it);\n }\n\n skip_space(it);\n return res;\n }\n\n Poly factor(Iter it) {\n if (std::isdigit(*it)) {\n return nonnegative_number(it);\n } else if (std::isalpha(*it)) {\n return variable(it);\n } else {\n skip(it, '(');\n skip_space(it);\n auto res = expr(it);\n skip(it, ')');\n skip_space(it);\n return res;\n }\n }\n\n Poly nonnegative_number(Iter it) {\n long long res = 0;\n while (it != line.end() && std::isdigit(*it)) {\n char c = *it;\n skip(it, c);\n res = 10 * res + c - '0';\n }\n skip_space(it);\n return Poly(res);\n }\n\n Poly variable(Iter it) {\n char var = *it;\n assert(std::isalpha(var));\n skip(it, var);\n skip_space(it);\n Poly res(var);\n if (it != line.end() && *it == '^') {\n skip(it, '^');\n skip_space(it);\n char exp = *it;\n assert(std::isdigit(exp) && exp != '0');\n skip(it, exp);\n res = Poly(var, exp - '0');\n }\n skip_space(it);\n return res;\n }\n};\n\nvoid parser_test() {\n std::vector<std::string> tests = {\n \"a+b+c\",\n \"a a a\",\n \"a^2 a a\",\n \"(a^2+b)(a+b)\",\n \"2ab (4a+2b)\",\n \"2 2 3 3 3 a\"\n };\n\n for (auto test: tests) {\n std::cerr << test << \": \";\n Parser parser;\n std::cerr << parser.parse(test) << std::endl;\n }\n}\n\nint main() {\n // parser_test();\n Parser parser;\n while (true) {\n std::string line;\n std::getline(std::cin, line);\n if (line == \".\") break;\n Poly answer = parser.parse(line);\n\n while (true) {\n std::getline(std::cin, line);\n if (line == \".\") break;\n Poly solution = parser.parse(line);\n if (answer == solution) {\n std::cout << \"yes\" << std::endl;\n } else {\n std::cout << \"no\" << std::endl;\n }\n }\n\n std::cout << \".\" << std::endl;\n }\n}","accuracy":1,"time_ms":3480,"memory_kb":9316,"score_of_the_acc":-1.744,"final_rank":20},{"submission_id":"aoj_1233_6058521","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nstruct monomial{\n vector<pair<char, int>> deg;\n monomial(){\n }\n monomial(char c, int x){\n deg.push_back(make_pair(c, x));\n }\n};\nbool operator ==(monomial A, monomial B){\n return A.deg == B.deg;\n}\nbool operator < (monomial A, monomial B){\n return A.deg < B.deg;\n}\nmonomial operator *(monomial A, monomial B){\n int N = A.deg.size();\n int M = B.deg.size();\n for (int i = 0; i < M; i++){\n bool ok = false;\n for (int j = 0; j < N; j++){\n if (A.deg[j].first == B.deg[i].first){\n A.deg[j].second += B.deg[i].second;\n ok = true;\n }\n }\n if (!ok){\n A.deg.push_back(B.deg[i]);\n }\n }\n sort(A.deg.begin(), A.deg.end());\n return A;\n}\nostream& operator <<(ostream& os, monomial A){\n int N = A.deg.size();\n for (int i = 0; i < N; i++){\n cout << A.deg[i].first;\n if (A.deg[i].second >= 2){\n cout << \"^\" << A.deg[i].second;\n }\n }\n return os;\n}\nstruct polynomial{\n vector<pair<monomial, int>> term;\n polynomial(){\n }\n polynomial(int x){\n if (x != 0){\n term.push_back(make_pair(monomial(), x));\n }\n }\n polynomial(char c, int x){\n term.push_back(make_pair(monomial(c, x), 1));\n }\n};\nbool operator ==(polynomial A, polynomial B){\n return A.term == B.term;\n}\npolynomial operator -(polynomial A){\n int N = A.term.size();\n for (int i = 0; i < N; i++){\n A.term[i].second *= -1;\n }\n return A;\n}\npolynomial operator +(polynomial A, polynomial B){\n int N = A.term.size();\n int M = B.term.size();\n for (int i = 0; i < M; i++){\n bool ok = false;\n for (int j = 0; j < N; j++){\n if (A.term[j].first == B.term[i].first){\n A.term[j].second += B.term[i].second;\n ok = true;\n }\n }\n if (!ok){\n A.term.push_back(B.term[i]);\n }\n }\n sort(A.term.begin(), A.term.end());\n int K = A.term.size();\n polynomial ans;\n for (int i = 0; i < K; i++){\n if (A.term[i].second != 0){\n ans.term.push_back(A.term[i]);\n }\n }\n return ans;\n}\npolynomial operator -(polynomial A, polynomial B){\n return A + (-B);\n}\npolynomial operator *(polynomial A, polynomial B){\n int N = A.term.size();\n int M = B.term.size();\n map<monomial, int> mp;\n for (int i = 0; i < N; i++){\n for (int j = 0; j < M; j++){\n monomial X = A.term[i].first * B.term[j].first;\n int coef = A.term[i].second * B.term[j].second;\n mp[X] += coef;\n }\n }\n polynomial ans;\n for (auto P : mp){\n if (P.second != 0){\n ans.term.push_back(P);\n }\n }\n return ans;\n}\nostream& operator <<(ostream& os, polynomial A){\n int N = A.term.size();\n for (int i = 0; i < N; i++){\n if (i > 0 && A.term[i].second > 0){\n cout << '+';\n }\n if (A.term[i].second < 0){\n cout << \"-\" ;\n }\n int x = abs(A.term[i].second);\n if (x > 1){\n cout << x;\n }\n cout << A.term[i].first;\n }\n return os;\n}\nint number(string &S, int &p){\n int ans = 0;\n while (isdigit(S[p]) != 0){\n ans = ans * 10 + (S[p] - '0');\n p++;\n }\n return ans;\n}\npolynomial expression(string &S, int &p);\npolynomial factor(string &S, int &p){\n if (S[p] == '('){\n p++;\n polynomial ans = expression(S, p);\n p++;\n return ans;\n } else if (isdigit(S[p]) != 0){\n int x = number(S, p);\n return polynomial(x);\n } else {\n char c = S[p];\n p++;\n int x = 1;\n if (S[p] == '^'){\n p++;\n x = number(S, p);\n }\n return polynomial(c, x);\n }\n}\npolynomial term(string &S, int &p){\n int p2 = p;\n polynomial ans = factor(S, p);\n while (true){\n if (S[p] == '*'){\n p++;\n }\n if (S[p] == '+' || S[p] == '-' || S[p] == ')' || S[p] == '='){\n break;\n }\n polynomial A = factor(S, p);\n ans = ans * A;\n }\n return ans;\n}\npolynomial expression(string &S, int &p){\n polynomial ans = term(S, p);\n while (true){\n if (S[p] == '+'){\n p++;\n ans = ans + term(S, p);\n } else if (S[p] == '-'){\n p++;\n ans = ans - term(S, p);\n } else {\n break;\n }\n }\n return ans;\n} \nint main(){\n while (true){\n vector<string> S;\n while (true){\n string s;\n getline(cin, s);\n if (s == \".\"){\n break;\n }\n int N = s.size();\n string t;\n t += s[0];\n for (int i = 1; i < N; i++){\n if (s[i] != ' '){\n if (isdigit(s[i]) != 0 && isdigit(t.back()) != 0 && isdigit(s[i - 1]) == 0){\n t += '*';\n }\n t += s[i];\n }\n }\n S.push_back(t);\n }\n if (S.empty()){\n break;\n }\n int N = S.size();\n vector<polynomial> P(N);\n for (int i = 0; i < N; i++){\n S[i] += '=';\n int p = 0;\n P[i] = expression(S[i], p);\n }\n for (int i = 1; i < N; i++){\n if (P[i] == P[0]){\n cout << \"yes\" << endl;\n } else {\n cout << \"no\" << endl;\n }\n }\n cout << \".\" << endl;\n }\n}","accuracy":1,"time_ms":110,"memory_kb":9444,"score_of_the_acc":-0.7842,"final_rank":18},{"submission_id":"aoj_1233_4972347","code_snippet":"#include \"iostream\"\n#include \"climits\"\n#include \"list\"\n#include \"queue\"\n#include \"stack\"\n#include \"set\"\n#include \"functional\"\n#include \"algorithm\"\n#include \"string\"\n#include \"map\"\n#include \"unordered_map\"\n#include \"unordered_set\"\n#include \"iomanip\"\n#include \"cmath\"\n#include \"random\"\n#include \"bitset\"\n#include \"cstdio\"\n#include \"numeric\"\n#include \"cassert\"\n#include \"ctime\"\n#include \"complex\"\n\nusing namespace std;\n\nconstexpr long long int MOD = 1000000007;\n//constexpr int MOD = 1000000007;\n//constexpr int MOD = 998244353;\n//constexpr long long int MOD = 998244353;\nconstexpr double EPS = 1e-12;\n\n//int N, M, K, T, H, W, L, R;\nlong long int N, M, K, T, H, W, L, R;\n\nstruct Component {\n\tvector<long long int>dir;\n\tlong long int by;\n\tComponent() {\n\t\tby = -1;\n\t\tdir.resize(26);\n\t}\n\tComponent(vector<long long int>d, long long int b) :dir(d), by(b) {\n\n\t}\n\tbool operator<(const Component&c)const {\n\t\treturn make_pair(dir, by) < make_pair(c.dir, c.by);\n\t}\n\tbool operator!=(const Component&c)const {\n\t\treturn make_pair(by, dir) != make_pair(c.by, c.dir);\n\t}\n\tComponent operator*(const Component&c)const {\n\t\tComponent ret(dir, by);\n\t\tfor (int i = 0; i < 26; i++) {\n\t\t\tret.dir[i] += c.dir[i];\n\t\t}\n\t\tret.by *= c.by;\n\t\treturn ret;\n\t}\n};\n\nstruct Expression {\n\tvector<Component>v;\n\tExpression() {\n\t}\n\tExpression(vector<Component>vv) :v(vv) {\n\n\t}\n\tvoid ExpSort() {\n\t\tsort(v.begin(), v.end());\n\t\tvector<Component>w;\n\t\tfor (auto i : v) {\n\t\t\tif (w.empty() || w.back().dir != i.dir) {\n\t\t\t\tw.push_back(i);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tw.back().by += i.by;\n\t\t\t}\n\t\t}\n\t\tv.clear();\n\t\tfor (auto i : w) {\n\t\t\tif (i.by)v.push_back(i);\n\t\t}\n\t}\n\tbool operator==(const Expression&e)const {\n\t\tif (v.size() != e.v.size())return false;\n\t\tfor (int i = 0; i < v.size(); i++) {\n\t\t\tif (v[i] != e.v[i])return false;\n\t\t}\n\t\treturn true;\n\t}\n\tExpression operator+(const Expression&e)const {\n\t\tauto ret = Expression(v);\n\t\tfor (auto i : e.v)ret.v.push_back(i);\n\t\treturn ret;\n\t}\n\tExpression operator-(const Expression&e)const {\n\t\tauto ret = Expression(v);\n\t\tfor (auto i : e.v) {\n\t\t\tret.v.push_back(i);\n\t\t\tret.v.back().by *= -1;\n\t\t}\n\t\treturn ret;\n\t}\n\tExpression operator*(const Expression&e)const {\n\t\tauto ret = Expression();\n\t\tfor (auto i : v) {\n\t\t\tfor (auto j : e.v) {\n\t\t\t\tret.v.push_back(i*j);\n\t\t\t}\n\t\t}\n\t\treturn ret;\n\t}\n\tExpression operator^(const Expression&e)const {\n\t\tauto ret = Expression(v);\n\t\tfor (auto &i : ret.v) {\n\t\t\tfor (auto &j : i.dir) j *= e.v.front().by;\n\t\t}\n\t\tret.v.front().by = powl(ret.v.front().by, e.v.front().by);\n\t\treturn ret;\n\t}\n};\n\n\nvoid DEBUG(Expression e) {\n\tcout << e.v.size() << endl;\n\tfor (auto i : e.v) {\n\t\tcout << i.by;\n\t\tfor (auto j : i.dir)cout << \" \" << j;\n\t\tcout << endl;\n\t}\n}\n\nExpression func(string s) {\n//\tcout << s << endl;\n\tint num = 0;\n\tfor (int i = s.size() - 1; i >= 0; i--) {\n\t\tif (s[i] == ')') num++;\n\t\tif (s[i] == '(') num--;\n\t\tif (num == 0) {\n\t\t\tif (s[i] == '+') {\n\t\t\t\tauto a = func(s.substr(0, i));\n\t\t\t\tauto b = func(s.substr(i + 1, s.size() - i - 1));\n\t\t\t\treturn a + b;\n\t\t\t}\n\t\t\tif (s[i] == '-') {\n\t\t\t\tauto a = func(s.substr(0, i));\n\t\t\t\tauto b = func(s.substr(i + 1, s.size() - i - 1));\n\t\t\t\treturn a - b;\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i = s.size() - 1; i >= 0; i--) {\n\t\tif (s[i] == ')') num++;\n\t\tif (s[i] == '(') num--;\n\t\tif (num == 0) {\n\t\t\tif (s[i] == '*') {\n\t\t\t\tauto a = func(s.substr(0, i));\n\t\t\t\tauto b = func(s.substr(i + 1, s.size() - i - 1));\n\t\t\t\treturn a * b;\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i = s.size() - 1; i >= 0; i--) {\n\t\tif (s[i] == ')') num++;\n\t\tif (s[i] == '(') num--;\n\t\tif (num == 0) {\n\t\t\tif (s[i] == '^') {\n\t\t\t\tauto a = func(s.substr(0, i));\n\t\t\t\tauto b = func(s.substr(i + 1, s.size() - i - 1));\n\t\t\t\treturn a ^ b;\n\t\t\t}\n\t\t}\n\t}\n\tif (s.front() == '(') {\n\t\treturn func(s.substr(1, s.size() - 2));\n\t}\n\tComponent ret;\n\tfor (auto i : s) {\n\t\tif (i >= 'a'&&i <= 'z') {\n\t\t\tret.dir[i - 'a']++;\n\t\t}\n\t\telse {\n\t\t\tif (ret.by == -1)ret.by = 0;\n\t\t\tret.by *= 10;\n\t\t\tret.by += i - '0';\n\t\t}\n\t}\n\tif(ret.by==-1)ret.by *= -1;\n\tExpression re;\n\tre.v.push_back(ret);\n\treturn re;\n}\n\nbool IsNum(char c) {\n\treturn (c >= '0'&&c <= '9') ;\n}\n\nbool IsAlpha(char c) {\n\treturn (c >= 'a'&&c <= 'z');\n}\n\nstring EraseSpace(string s) {\n\tstring ret;\n\tfor (auto i : s) {\n\t\tif (i != ' ')ret.push_back(i);\n\t\telse {\n\t\t\tif (!ret.empty() && ret.back() != ' ')ret.push_back(i);\n\t\t}\n\t}\n\twhile (ret.back() == ' ')ret.pop_back();\n\ts = ret;\n\tfor (int i = 1; i + 1 < s.size(); i++) {\n\t\tauto bf = s[i - 1];\n\t\tauto nx = s[i + 1];\n\t\tif (s[i] == ' ') {\n\t\t\tif (IsNum(bf) || IsAlpha(bf) || bf == ')') {\n\t\t\t\tif (IsNum(nx) || IsAlpha(nx) || nx == '(') {\n\t\t\t\t\ts[i] = '*';\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tret.clear();\n\tfor (auto i : s) {\n\t\tif (i == ' ')continue;\n\t\tif (ret.empty()) {\n\t\t\tret.push_back(i);\n\t\t\tcontinue;\n\t\t}\n\t\tif (ret.back() == ')'&&(i == '('||IsNum(i)||IsAlpha(i)))ret.push_back('*');\n\t\telse if ((ret.back() == ')' || IsNum(ret.back()) || IsAlpha(ret.back())) && i == '(')ret.push_back('*');\n\t\telse if (IsNum(ret.back()) && IsAlpha(i))ret.push_back('*');\n\t\telse if (IsAlpha(ret.back()) && IsNum(i))ret.push_back('*');\n\t\telse if (IsAlpha(ret.back()) && IsAlpha(i))ret.push_back('*');\n\t\tret.push_back(i);\n\t}\n\treturn ret;\n}\n\n\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\n\tstring s;\n\twhile (getline(cin, s), s != \".\") {\n\t\tauto ans = func(EraseSpace(s));\n\t\tans.ExpSort();\n\t//\tDEBUG(ans);\n\t\twhile (getline(cin, s), s != \".\") {\n\t\t\tauto box = func(EraseSpace(s));\n\t\t\tbox.ExpSort();\n\t\t//\tDEBUG(box);\n\t\t\tif (ans == box)cout << \"yes\\n\";\n\t\t\telse cout << \"no\\n\";\n\t\t}\n\t\tcout << s << endl;\n\t}\n}","accuracy":1,"time_ms":40,"memory_kb":3816,"score_of_the_acc":-0.1419,"final_rank":12},{"submission_id":"aoj_1233_4962252","code_snippet":"#include<iostream>\n#include<vector>\n#include<map>\nusing namespace std;\nstruct Str{\n\tstring s;\n\tStr():s(){}\n\tconst char operator[](int id)const{return s[id];}\n\tconst size_t size()const{return s.size();}\n\tStr&operator+=(const char c){\n\t\ts+=c;\n\t\treturn*this;\n\t}\n\tStr operator*(const Str&a){\n\t\tStr ret;\n\t\tint i=0,j=0;\n\t\twhile(i<s.size()||j<a.size())\n\t\t{\n\t\t\tif(i<s.size()&&j<a.size())\n\t\t\t{\n\t\t\t\tif(s[i]<a[j])ret+=s[i++];\n\t\t\t\telse ret+=a[j++];\n\t\t\t}\n\t\t\telse if(i<s.size())ret+=s[i++];\n\t\t\telse ret+=a[j++];\n\t\t}\n\t\treturn ret;\n\t}\n\tbool operator<(const Str&a)const{\n\t\treturn s<a.s;\n\t}\n\tbool operator==(const Str&a)const{return s==a.s;}\n};\nstruct exp{\n\tmap<Str,int>mp;\n\texp():mp(){}\n\tint&operator[](const Str&a){return mp[a];}\n\texp norm(){\n\t\texp ret;\n\t\tfor(pair<Str,int>p:mp)if(p.second!=0)ret[p.first]=p.second;\n\t\treturn ret;\n\t}\n\texp operator+(const exp&a){\n\t\texp ret=*this;\n\t\tfor(pair<Str,int>p:a.mp)ret[p.first]+=p.second;\n\t\treturn ret.norm();\n\t}\n\texp operator-(const exp&a){\n\t\texp ret=*this;\n\t\tfor(pair<Str,int>p:a.mp)ret[p.first]-=p.second;\n\t\treturn ret.norm();\n\t}\n\texp operator*(const exp&a){\n\t\texp ret;\n\t\tfor(pair<Str,int>p:mp)for(pair<Str,int>q:a.mp)\n\t\t{\n\t\t\tret[p.first*q.first]+=p.second*q.second;\n\t\t}\n\t\treturn ret.norm();\n\t}\n\tbool operator==(const exp&a)const{return mp==a.mp;}\n\tvoid dump()const{\n\t\tbool fst=true;\n\t\tfor(pair<Str,int>p:mp)\n\t\t{\n\t\t\tif(!fst)cout<<\"+\";\n\t\t\telse fst=false;\n\t\t\tcout<<p.second<<\"*\"<<p.first.s;\n\t\t}\n\t\tcout<<endl;\n\t}\n};\nvector<string>now;\nvoid parse(string s)\n{\n\tnow.clear();\n\tfor(int i=0;i<s.size();i++)\n\t{\n\t\tif(s[i]==' ')continue;\n\t\telse if(isdigit(s[i]))\n\t\t{\n\t\t\tint j=i;\n\t\t\twhile(isdigit(s[j]))j++;\n\t\t\tnow.push_back(s.substr(i,j-i));\n\t\t\ti=j-1;\n\t\t}\n\t\telse now.push_back(string(1,s[i]));\n\t}\n}\nexp f(int&);\nexp g(int&);\nexp term(int&);\nexp f(int&id)\n{\n\texp ret=g(id);\n\twhile(id<now.size()&&(now[id]==\"+\"||now[id]==\"-\"))\n\t{\n\t\tstring op=now[id++];\n\t\texp nxt=g(id);\n\t\tif(op==\"+\")ret=ret+nxt;\n\t\telse ret=ret-nxt;\n\t}\n\treturn ret;\n}\nexp g(int&id)\n{\n\texp ret=term(id);\n\twhile(id<now.size()&&now[id]!=\"+\"&&now[id]!=\"-\"&&now[id]!=\")\")\n\t{\n\t\tret=ret*term(id);\n\t}\n\treturn ret;\n}\nint to_i(string s)\n{\n\tint ret=0;\n\tfor(char c:s)ret=ret*10+c-'0';\n\treturn ret;\n}\nexp term(int&id)\n{\n\texp ret;\n\tif(now[id]==\"(\")\n\t{\n\t\tid++;\n\t\tret=f(id);\n\t\tid++;\n\t}\n\telse if(isdigit(now[id][0]))\n\t{\n\t\tret[Str()]=to_i(now[id++]);\n\t}\n\telse\n\t{\n\t\tStr tmp;\n\t\ttmp.s=now[id++];\n\t\tret[tmp]=1;\n\t}\n\tif(id<now.size()&&now[id]==\"^\")\n\t{\n\t\tid++;\n\t\tint n=to_i(now[id++]);\n\t\texp ans=ret;\n\t\tfor(int i=1;i<n;i++)ans=ans*ret;\n\t\tret=ans;\n\t}\n\treturn ret;\n}\nmain()\n{\n\twhile(true)\n\t{\n\t\tstring s;\n\t\tgetline(cin,s);\n\t\tif(s==\".\")break;\n\t\tparse(s);\n\t\tint id=0;\n\t\texp ans=f(id).norm();\n\t\twhile(true)\n\t\t{\n\t\t\tgetline(cin,s);\n\t\t\tif(s==\".\")break;\n\t\t\tparse(s);\n\t\t\tid=0;\n\t\t\texp ret=f(id).norm();\n\t\t\tcout<<(ans==ret?\"yes\":\"no\")<<endl;\n\t\t}\n\t\tcout<<\".\"<<endl;\n\t}\n}","accuracy":1,"time_ms":150,"memory_kb":3328,"score_of_the_acc":-0.1198,"final_rank":9},{"submission_id":"aoj_1233_4931020","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }\n#define all(x) (x).begin(),(x).end()\n#define fi first\n#define se second\n#define mp make_pair\n#define si(x) int(x.size())\nconst int mod=1000000007,MAX=1005;\nconst int INF=1e6;\n//const ll INF=1LL<<60;\nstring S;\n\nvector<vector<ll>> dai(100,vector<ll>(26));\nvector<ll> ans(100),comp(100);\nint t;\n\nll expr(int &i);\nll term(int &i);\nll rui(int &i);\nll factor(int &i);\nll number(int &i);\n\nll expr(int &i){\n ll res=term(i);\n while(i<si(S)){\n if(S[i]==' ') i++;\n else if(S[i]=='+'){\n i++;\n ll x=term(i);\n res+=x;\n }else if(S[i]=='-'){\n i++;\n ll x=term(i);\n res-=x;\n }else{\n break;\n }\n }\n return res;\n}\n\nll term(int &i){\n ll res=rui(i);\n \n while(i<si(S)){\n if(S[i]==' ') i++;\n else if(S[i]=='+'||S[i]=='-'||S[i]==')') break;\n else{\n ll x=rui(i);\n res*=x;\n }\n }\n \n return res;\n}\n\nll rui(int &i){\n ll res=factor(i);\n \n while(i<si(S)){\n if(S[i]==' ') i++;\n else if(S[i]=='^'){\n i++;\n ll x=factor(i);\n ll k=res;\n res=1;\n for(int j=0;j<x;j++) res*=k;\n }else break;\n }\n \n return res;\n}\n\nll factor(int &i){\n while(S[i]==' ') i++;\n \n if(i<si(S)&&S[i]=='('){\n i++;\n ll x=expr(i);\n while(S[i]==' ') i++;\n assert(S[i]=')');\n i++;\n \n return x;\n }else{\n return number(i);\n }\n}\n\nll number(int &i){\n while(S[i]==' ') i++;\n if(isdigit(S[i])){\n ll res=0;\n while(i<si(S)&&isdigit(S[i])){\n res*=10;\n res+=ll(S[i]-'0');\n i++;\n }\n return res;\n }else{\n ll x=dai[t][S[i]-'a'];\n i++;\n return x;\n }\n}\n\nint main(){\n \n std::ifstream in(\"text.txt\");\n std::cin.rdbuf(in.rdbuf());\n cin.tie(0);\n ios::sync_with_stdio(false);\n \n mt19937_64 rng(58);\n \n for(int i=0;i<100;i++){\n for(int j=0;j<26;j++){\n dai[i][j]=rng()%9+1;\n }\n }\n \n while(1){\n getline(cin,S);\n if(S==\".\") break;\n \n t=0;\n while(t<100){\n int i=0;\n comp[t]=expr(i);\n t++;\n }\n ans=comp;\n \n while(1){\n getline(cin,S);\n if(S==\".\"){\n cout<<\".\\n\";\n break;\n }\n \n t=0;\n \n while(t<100){\n int i=0;\n comp[t]=expr(i);\n t++;\n }\n \n if(ans==comp) cout<<\"yes\"<<endl;\n else cout<<\"no\"<<endl;\n }\n }\n}","accuracy":1,"time_ms":20,"memory_kb":3260,"score_of_the_acc":-0.0747,"final_rank":2},{"submission_id":"aoj_1233_4535459","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\nusing namespace std;\n\nstruct Polynomial{\n map<string, int> terms;\n Polynomial(int a){\n terms[\"\"] = a;\n }\n Polynomial(string s){\n terms[s] = 1;\n }\n Polynomial(){}\n static void erase_zero(Polynomial &a){\n for(auto it=a.terms.begin(); it!=a.terms.end();){\n if(it->second == 0){\n it = a.terms.erase(it);\n }else{\n it++;\n }\n }\n }\n Polynomial operator +(const Polynomial &a) const{\n Polynomial res = *this;\n for(const auto &p: a.terms){\n res.terms[p.first] += p.second;\n }\n erase_zero(res);\n return res;\n }\n Polynomial operator -(const Polynomial &a) const{\n Polynomial res = *this;\n for(const auto &p: a.terms){\n res.terms[p.first] -= p.second;\n }\n erase_zero(res);\n return res;\n }\n Polynomial operator *(const Polynomial &a) const{\n Polynomial res;\n for(const auto &p: terms){\n for(const auto &q: a.terms){\n string key = p.first + q.first;\n sort(key.begin(), key.end());\n res.terms[key] += p.second * q.second;\n }\n }\n erase_zero(res);\n return res;\n }\n bool operator ==(const Polynomial &a) const{\n return terms == a.terms;\n }\n};\n\nint getnum(int &p, const string &s){\n int num = 0;\n while(p<(int)s.length() and '0'<=s[p] and s[p]<='9'){\n num *= 10;\n num += s[p]-'0';\n p++;\n }\n return num;\n}\nPolynomial parse(int &p, const string &s){\n Polynomial res;\n Polynomial term(1);\n int sign = 1;\n while(1){\n if(p<(int)s.length() and s[p] == ' '){\n p++;\n continue;\n }\n if(p>=(int)s.length() or s[p]=='+' or s[p]=='-' or s[p]==')'){\n if(sign == 1) res = res + term;\n else res = res - term;\n term = Polynomial(1);\n if(p>=(int)s.length() or s[p]==')'){\n p++;\n return res;\n }\n if(s[p] == '+') sign = 1;\n else sign = -1;\n p++;\n continue;\n }\n if('0'<=s[p] and s[p]<='9'){\n term = term * Polynomial(getnum(p, s));\n continue;\n }\n if('a'<=s[p] and s[p]<='z'){\n char var = s[p];\n p++;\n int num = 1;\n while(p<(int)s.length() and s[p]==' '){\n p++;\n }\n if(p<(int)s.length() and s[p]=='^'){\n p++;\n while(s[p] == ' ') p++;\n num = getnum(p, s);\n }\n term = term * Polynomial(string(num, var));\n continue;\n }\n if(s[p] == '('){\n p++;\n term = term * parse(p, s);\n continue;\n }\n }\n}\n\nint main(){\n while(1){\n vector<string> s;\n string t;\n while(getline(cin, t), t!=\".\"){\n s.push_back(t);\n }\n if(s.empty()) break;\n\n vector<Polynomial> p;\n for(auto ss: s){\n int i=0;\n p.push_back(parse(i, ss));\n }\n for(int i=1; i<(int)p.size(); i++){\n if(p[i] == p[0]){\n cout << \"yes\" << endl;\n }else{\n cout << \"no\" << endl;\n }\n }\n cout << \".\" << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":11632,"score_of_the_acc":-1.0173,"final_rank":19},{"submission_id":"aoj_1233_3723771","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<bitset>\n#include<stack>\n#include<unordered_map>\n#include<utility>\n#include<cassert>\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef unsigned long long ul;\ntypedef unsigned int ui;\nconst ll mod = 998244353;\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 pair<ll, ll> LP;\ntypedef vector<int> vec;\ntypedef vector<string> svec;\ntypedef long double ld;\ntypedef pair<ld, ld> LDP;\nconst ld eps = 1e-8;\n\nll expr(string& s, int& i);\nll term1(string& s, int& i);\nll term(string& s, int& i);\nll factor(string& s, int& i);\nll number(string& s, int& i);\n\nbool isdigit(char t) {\n\treturn '0' <= t && t <= '9';\n}\nbool isalf(char t) {\n\treturn 'a' <= t && t <= 'z';\n}\n\nll mod_pow(ll x, int n) {\n\tll ret = 1;\n\twhile (n > 0) {\n\t\tif (n % 2)ret = ret * x%mod;\n\t\tx = x * x%mod; n >>= 1;\n\t}\n\treturn ret;\n}\n\nll expr(string& s, int& i) {\n\tll val = term1(s, i);\n\twhile (i < s.length()) {\n\t\tif (s[i] == ' ') {\n\t\t\ti++; continue;\n\t\t}\n\t\tif (s[i] == '+' || s[i] == '-') {\n\t\t\tchar op = s[i];\n\t\t\ti++;\n\t\t\tll val2 = term1(s, i);\n\t\t\tif (op == '+') {\n\t\t\t\tval += val2; if (val >= mod)val -= mod;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tval += mod - val2; while (val >= mod)val -= mod;\n\t\t\t}\n\t\t}\n\t\telse break;\n\t}\n\t//cout << i << \" expr \" << val << endl;\n\treturn val;\n}\nll term1(string& s, int& i) {\n\tll val = term(s, i);\n\twhile (i < s.length() && s[i] == ' ')i++;\n\tif (i >= s.length() || s[i] == '+' || s[i] == '-'||s[i]==')') {\n\t\treturn val;\n\t}\n\telse {\n\t\tll val2 = term1(s, i);\n\t\tval = val * val2%mod;\n\t}\n\t//cout << i << \" term1 \" << val << endl;\n\treturn val;\n}\nll term(string& s, int& i) {\n\tll val = factor(s, i);\n\twhile (i < s.length() && s[i] == ' ')i++;\n\tif (i<s.length() && s[i] == '^') {\n\t\ti++;\n\t\tll val2 = number(s, i);\n\t\tval = mod_pow(val, val2);\n\t}\n\t//cout << i << \" term \" << val << endl;\n\treturn val;\n}\nll factor(string& s, int& i) {\n\twhile (i < s.length() && s[i] == ' ')i++;\n\tif (i<s.length() && isdigit(s[i]))return number(s, i);\n\ti++;\n\twhile (i < s.length() && s[i] == ' ')i++;\n\tll ret = expr(s, i);\n\ti++;\n\twhile (i < s.length() && s[i] == ' ')i++;\n\t//cout << i << \" fact \" << ret << endl;\n\treturn ret;\n}\nll number(string& s, int& i) {\n\twhile (s[i] == ' ')i++;\n\tll ret = s[i++] - '0';\n\twhile (i < s.length() && isdigit(s[i])) {\n\t\tret = ret * 10 + s[i++] - '0';\n\t\tret %= mod;\n\t}\n\t//cout << i << \" numb \" << ret << endl;\n\treturn ret;\n}\n\nvector<vector<ll>> gene(int len) {\n\trandom_device rnd;\n\tmt19937 mt(rnd());\n\tuniform_int_distribution<> u(0, 2147483647);\n\tvector<vector<ll>> ret(len);\n\trep(i, len) {\n\t\tret[i].resize(26);\n\t\trep(j, 26) {\n\t\t\tret[i][j] = u(mt);\n\t\t}\n\t}\n\treturn ret;\n}\n\nll calc(string s, vector<ll> t) {\n\tstring upd;\n\trep(i, s.length()) {\n\t\tif (isalf(s[i])) {\n\t\t\tstring u = to_string(t[s[i] - 'a']);\n\t\t\tupd.push_back(' ');\n\t\t\tupd = upd + u;\n\t\t}\n\t\telse if (isdigit(s[i])) {\n\t\t\tint le = i;\n\t\t\twhile (i + 1 < s.length() && isdigit(s[i + 1]))i++;\n\t\t\tupd.push_back(' ');\n\t\t\tRep1(j, le, i)upd.push_back(s[j]);\n\t\t}\n\t\telse {\n\t\t\tupd.push_back(s[i]);\n\t\t}\n\t}\n\tint i = 0;\n\t//cout << s << endl;\n\t//cout << upd << endl;\n\t//cout << upd << endl;\n\treturn expr(upd, i);\n}\n\nconst int sz = 100;\nbool solve() {\n\tstring s;\n\tvector<string> v;\n\twhile (getline(cin, s)) {\n\t\tif (s[0] == '.') {\n\t\t\tbreak;\n\t\t}\n\t\tv.push_back(s);\n\t}\n\tif (v.size() == 0)return false;\n\tvector<vector<ll>> test = gene(sz);\n\tvector<vector<ll>> ans(v.size());\n\trep(i, v.size()) {\n\t\tans[i].resize(sz);\n\t\trep(j, sz) {\n\t\t\tans[i][j] = calc(v[i], test[j]);\n\t\t\t//cout << i << \" \" << ans[i][j] << endl;\n\t\t}\n\t}\n\tfor (int i = 1; i < v.size(); i++) {\n\t\tbool f = (ans[i] == ans[0]);\n\t\tif (f) {\n\t\t\tcout << \"yes\" << endl;\n\t\t}\n\t\telse {\n\t\t\tcout << \"no\" << endl;\n\t\t}\n\t}\n\tcout << \".\" << endl;\n\treturn true;\n}\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\n\t/*string s = \"a+b+c\";\n\tstring ss = \"(a+b)+c\";\n\tvector<ll> c(26, 0); c[0] = 1, c[1] = 2; c[2] = 3;\n\tcout << calc(s, c) << endl;\n\tcout << calc(ss, c) << endl;*/\n\n\t//cout << fixed << setprecision(10);\n\t//init();\n\twhile (true) {\n\t\tif (!solve())break;\n\t}\n\t//stop\n\t\treturn 0;\n}","accuracy":1,"time_ms":360,"memory_kb":4080,"score_of_the_acc":-0.2636,"final_rank":17},{"submission_id":"aoj_1233_3312395","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\n\n//INSERT ABOVE HERE\n\nstruct T{\n map<string, Int> ms;\n T(){}\n T(string s, Int c){\n sort(s.begin(),s.end());\n ms[s]+=c;\n }\n\n T operator+=(const T &a){\n for(auto p:a.ms)\n ms[p.first]+=p.second;\n return *this;\n }\n \n T operator-=(const T &a){\n for(auto p:a.ms)\n ms[p.first]-=p.second;\n return *this;\n }\n \n T operator+(const T &a) const{\n T res(*this);\n return res+=a;\n }\n \n T operator-(const T &a) const{\n T res(*this);\n return res-=a;\n }\n \n T operator*(const T &a) const{\n T res;\n for(auto p:ms)\n for(auto q:a.ms)\n res+=T(p.first+q.first,p.second*q.second);\n return res;\n }\n\n T pow(Int k) const{\n assert(k>=1);\n T res(*this);\n for(Int i=1;i<k;i++) res=res*(*this);\n return res;\n }\n\n map<string, Int> norm(){\n map<string, Int> res;\n for(auto p:ms)\n if(p.second) res[p.first]=p.second;\n return res;\n }\n};\n\nusing V = vector<string>; \nT expr (const V &vs,Int &p);\nT term (const V &vs,Int &p);\nT factor(const V &vs,Int &p);\nT power (const V &vs,Int &p);\nInt number(const V &vs,Int &p);\n\nT expr (const V &vs,Int &p){\n T res=term(vs,p);\n while(p<(Int)vs.size()){\n if(vs[p]==\"+\"s){\n p++;\n res=res+term(vs,p);\n continue;\n }\n if(vs[p]==\"-\"s){\n p++;\n res=res-term(vs,p);\n continue;\n }\n break;\n }\n return res;\n}\n\nT term (const V &vs,Int &p){ \n T res=factor(vs,p);\n while(p<(Int)vs.size()){\n if(vs[p]==\"+\"s) break;\n if(vs[p]==\"-\"s) break;\n if(vs[p]==\"^\"s) break;\n if(vs[p]==\")\"s) break;\n res=res*factor(vs,p);\n }\n return res;\n}\n\nT factor(const V &vs,Int &p){ \n T res=power(vs,p);\n if(p<(Int)vs.size()&&vs[p]==\"^\"s){\n p++;\n Int k=number(vs,p);\n return res.pow(k);\n } \n return res;\n}\n\nT power (const V &vs,Int &p){\n if(vs[p]==\"(\"s){\n p++;\n T res=expr(vs,p);\n assert(vs[p]==\")\"s);\n p++;\n return res;\n }\n if(isalpha(vs[p][0])) return T(vs[p++],1);\n return T(\"\"s, number(vs,p));\n}\n\nInt number(const V &vs,Int &p){\n return stoll(vs[p++]);\n}\n\nT tran(string s){\n Int n=s.size();\n string t;\n for(Int i=0;i<n;i++){\n if(!isdigit(s[i])) t+=' ';\n t+=s[i];\n if(!isdigit(s[i])) t+=' ';\n } \n V vs;\n stringstream ss(t);\n while(ss>>t) vs.emplace_back(t);\n Int p=0;\n return expr(vs,p);\n}\n\nsigned main(){\n string s;\n while(getline(cin,s)){\n if(s==\".\"s) break;\n auto vs=tran(s);\n while(1){\n string t;\n getline(cin,t); \n if(t==\".\"s) break;\n auto vt=tran(t);\n cout<<(vs.norm()==vt.norm()?\"yes\":\"no\")<<endl;\n } \n cout<<\".\"<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":370,"memory_kb":3476,"score_of_the_acc":-0.1997,"final_rank":13},{"submission_id":"aoj_1233_2984295","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n#define dbg(x) cout<<#x\" = \"<<((x))<<endl\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\"(\"<<p.fi<<\",\"<<p.se<<\")\";return o;}\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\"[\";for(T t:v){o<<t<<\",\";}o<<\"]\";return o;}\n\nusing f = map<string,ll>;\n\nvoid PRINT(f a){\n for(const auto &p:a){\n cout << p.se << p.fi << \" + \";\n }\n cout << endl;\n}\n\nf norm(f a){\n f ret;\n for(const auto &p:a){\n string v = p.fi;\n sort(all(v));\n if(p.se != 0) ret[v] = p.se;\n }\n return ret;\n}\n\nf sub(f a){\n a = norm(a);\n\n f ret;\n for(const auto &p:a){\n string v = p.fi;\n if(p.se != 0) ret[v] = -p.se;\n }\n return ret;\n}\n\nf add(f a, f b){\n a = norm(a);\n b = norm(b);\n\n for(const auto &p:b) a[p.fi] += p.se;\n\n return norm(a);\n}\n\nf mul(f a, f b){\n a = norm(a);\n b = norm(b);\n\n f ret;\n for(const auto &p:a)for(const auto &q:b){\n string var = p.fi+q.fi;\n sort(all(var));\n\n ret[var] += p.se*q.se;\n }\n return norm(ret);\n}\n\nf E(string s);\n\nf T(string s){\n int n = s.size();\n f ret;\n ret[\"\"]=1;\n\n int idx = 0;\n while(idx<n){\n f m;\n if(s[idx]==' '){\n ++idx;\n continue;\n }\n else if(s[idx]=='('){\n int ep = idx;\n int p = 0;\n while(ep<n){\n if(s[ep]=='(') ++p;\n if(s[ep]==')'){\n --p;\n if(p==0) break;\n }\n ++ep;\n }\n assert(ep<n);\n assert(s[ep]==')');\n\n string t = s.substr(idx+1,ep-idx-1);\n m = E(t);\n idx = ep+1;\n }\n else if(isdigit(s[idx])){\n ll val = 0;\n while(idx<n && isdigit(s[idx])){\n val = val*10 + (s[idx]-'0');\n ++idx;\n }\n\n int pw = 1;\n int nx = idx;\n while(nx<n && s[nx]==' ') ++nx;\n if(nx<n && s[nx]=='^'){\n ++nx;\n while(nx<n && s[nx]==' ') ++nx;\n\n assert(nx<n);\n assert(isdigit(s[nx]));\n\n pw = 0;\n while(nx<n && isdigit(s[nx])){\n pw = 10*pw + (s[nx]-'0');\n ++nx;\n }\n }\n\n ll vv = 1;\n rep(_,pw) vv *= val;\n\n m[\"\"] = vv;\n idx = nx;\n }\n else if(islower(s[idx])){\n char c = s[idx];\n ++idx;\n\n int pw = 1;\n int nx = idx;\n while(nx<n && s[nx]==' ') ++nx;\n if(nx<n && s[nx]=='^'){\n ++nx;\n while(nx<n && s[nx]==' ') ++nx;\n\n assert(nx<n);\n assert(isdigit(s[nx]));\n\n pw = 0;\n while(nx<n && isdigit(s[nx])){\n pw = 10*pw + (s[nx]-'0');\n ++nx;\n }\n }\n\n string t = \"\";\n rep(_,pw) t += c;\n\n m[t] = 1;\n idx = nx;\n }\n else assert(false);\n\n ret = mul(ret, m);\n }\n\n return norm(ret);\n}\n\nf E(string s){\n int n = s.size();\n f ret;\n\n int p = 0;\n int start = 0;\n bool plus = true;\n\n rep(i,n){\n if(s[i]=='(') ++p;\n if(s[i]==')') --p;\n\n if(s[i]=='+' || s[i]=='-'){\n if(p==0){\n string term = s.substr(start,i-start);\n f t = norm(T(term));\n if(!plus) t = sub(t);\n plus = (s[i]=='+');\n\n ret = add(ret, t);\n\n start = i+1;\n }\n }\n }\n\n string term = s.substr(start,n-start);\n f t = norm(T(term));\n if(!plus) t = sub(t);\n\n ret = add(ret, t);\n\n return norm(ret);\n}\n\nint main(){\n string s;\n while(getline(cin, s),(s!=\".\")){\n f S = E(s);\n // PRINT(S);\n\n string t;\n while(getline(cin, t),(t!=\".\")){\n f T = E(t);\n // PRINT(T);\n cout << (S==T?\"yes\":\"no\") << endl;\n }\n cout << \".\" << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":350,"memory_kb":3644,"score_of_the_acc":-0.2125,"final_rank":15},{"submission_id":"aoj_1233_2880819","code_snippet":"#include <cstdio>\n#include <cstdint>\n#include <cassert>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <random>\n\nintmax_t ppow(intmax_t base, intmax_t iexp) {\n intmax_t res=1;\n for (intmax_t dbl=base; iexp; iexp>>=1) {\n if (iexp & 1)\n res *= dbl;\n\n dbl *= dbl;\n }\n return res;\n}\n\nintmax_t apply(intmax_t lhs, char op, intmax_t rhs) {\n switch (op) {\n case '+': return lhs + rhs;\n case '-': return lhs - rhs;\n case '*': return lhs * rhs;\n case '^': return ppow(lhs, rhs);\n default: assert(false);\n }\n}\n\nintmax_t fourt(\n const std::string &s, size_t &i, const std::vector<intmax_t> &vars,\n const std::vector<std::string> &ops={\"+-\", \"*\", \"^\", \"\"},\n size_t prec=0) {\n\n /* tsurai parser */\n if (ops[prec].empty()) {\n if (s[i] == '(') {\n intmax_t tmp=fourt(s, ++i, vars, ops, 0);\n assert(s[i] == ')');\n ++i;\n return tmp;\n }\n if (isalpha(s[i])) {\n // we assume only one-character variables\n return vars[s[i++]-'a'];\n }\n intmax_t res=0;\n while (s[i] >= '0' && s[i] <= '9')\n res = res*10 + s[i++]-'0';\n return res;\n }\n\n intmax_t res=fourt(s, i, vars, ops, prec+1);\n while (i < s.length()) {\n char op=s[i];\n if (!std::count(ops[prec].begin(), ops[prec].end(), op))\n break;\n intmax_t tmp=fourt(s, ++i, vars, ops, prec+1);\n res = apply(res, op, tmp);\n }\n return res;\n}\n\nintmax_t parse(const std::string &s, const std::vector<intmax_t> &vars) {\n size_t i=0;\n return fourt(s, i, vars);\n}\n\nstd::string normalize(const std::string &s) {\n // explicit `*' signs and no spaces\n std::string res;\n enum {\n NONE, PAREN, FACTOR, OPERATOR\n } last=NONE;\n for (size_t i=0; i<s.length(); ++i) {\n if (s[i] == '(') {\n if (last == FACTOR) {\n res += '*';\n }\n res += '(';\n last = PAREN;\n } else if (s[i] == ')') {\n res += ')';\n last = FACTOR;\n } else if (isalnum(s[i])) {\n if (last == FACTOR) {\n res += '*';\n }\n res += s[i];\n if (isdigit(s[i])) {\n while (i+1 < s.length() && isdigit(s[i+1]))\n res += s[++i];\n }\n last = FACTOR;\n } else if (!isspace(s[i])) {\n res += s[i];\n last = OPERATOR;\n }\n }\n // fprintf(stderr, \"#< %s\\n\", res.c_str());\n return res;\n}\n\nstd::mt19937 rsk(0315);\nint testcase_ends() {\n char buf[96];\n fgets(buf, sizeof buf, stdin);\n std::string s=buf;\n if (s == \".\\n\")\n return 1;\n\n s = normalize(s);\n while (true) {\n fgets(buf, sizeof buf, stdin);\n std::string t=buf;\n if (t == \".\\n\") {\n printf(\".\\n\");\n return 0;\n }\n\n t = normalize(t);\n bool yes=true;\n for (int i=0; i<810; ++i) {\n std::vector<intmax_t> vars(26);\n for (int j=0; j<26; ++j)\n vars[j] = rsk() % 100;\n \n if (parse(s, vars) != parse(t, vars))\n yes = false;\n }\n\n printf(\"%s\\n\", yes? \"yes\":\"no\");\n }\n}\n\nint main() {\n while (!testcase_ends()) {}\n}","accuracy":1,"time_ms":760,"memory_kb":2584,"score_of_the_acc":-0.2139,"final_rank":16},{"submission_id":"aoj_1233_2880805","code_snippet":"#include <cstdio>\n#include <cstdint>\n#include <cassert>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <map>\n\n//#define fprintf(...) void(0)\n\nclass Poly {\n std::map<std::string, int> coefs;\n // e.g. coefs[\"aab\"] == 2 <=> the polynomial has the term 2 a^2 b\n const std::string s;\n\n Poly &operator ^=(const Poly &oth) {\n if (oth.coefs.size() == 1 && oth.coefs.find(\"\") != oth.coefs.end()) {\n return (*this) ^= oth.coefs.find(\"\")->second;\n } else if (oth.coefs.empty()) {\n // means 0\n coefs.clear();\n coefs[\"\"] = 1; // means 1\n return (*this);\n }\n\n assert(false);\n }\n\n Poly &op_eq(char op, const Poly &rhs) {\n // (*this) @= rhs\n switch (op) {\n case '+': return (*this) += rhs;\n case '-': return (*this) -= rhs;\n case '*': return (*this) *= rhs;\n case '^': return (*this) ^= rhs;\n default: assert(false);\n }\n }\n\n Poly fourt(\n size_t &i, \n const std::vector<std::string> &ops={\"+-\", \"*\", \"^\", \"\"},\n size_t prec=0) {\n\n /* based-on tsurai parser */\n\n if (ops[prec].empty()) {\n if (s[i] == '(') {\n Poly tmp=fourt(++i, ops, 0);\n assert(s[i] == ')');\n ++i;\n return tmp;\n }\n if (isalpha(s[i])) {\n // we assume only one-character variables\n return Poly(s[i++]);\n }\n int coef=0;\n while (s[i] >= '0' && s[i] <= '9')\n coef = coef*10 + s[i++]-'0';\n return Poly(coef);\n }\n\n Poly res=fourt(i, ops, prec+1);\n while (i < s.length()) {\n char op=s[i];\n if (!std::count(ops[prec].begin(), ops[prec].end(), op))\n break;\n Poly tmp=fourt(++i, ops, prec+1);\n res.op_eq(op, tmp);\n }\n return res;\n }\n\n Poly &normalized() {\n for (auto it=coefs.begin(); it!=coefs.end(); ++it)\n if (it->second == 0)\n coefs.erase(it);\n\n return *this;\n }\n\npublic:\n Poly(const std::string &s): s(s) {\n size_t i=0;\n coefs = fourt(i).coefs; // ugh\n }\n\n Poly(char ch): s(1, ch) {\n assert(isalpha(ch));\n coefs[s] = 1;\n }\n\n Poly(int n): s(std::to_string(n)) {\n if (n)\n coefs[\"\"] = n;\n }\n\n Poly &operator +=(const Poly &oth) {\n for (const auto &p: oth.coefs) {\n const std::string ¶m=p.first;\n int coef=p.second;\n coefs[param] += coef;\n }\n return normalized();\n }\n\n Poly &operator -=(const Poly &oth) {\n for (const auto &p: oth.coefs) {\n const std::string ¶m=p.first;\n int coef=p.second;\n coefs[param] -= coef;\n }\n return normalized();\n }\n\n Poly &operator *=(const Poly &oth) {\n Poly tmp(*this);\n coefs.clear();\n for (const auto &pl: tmp.coefs) {\n for (const auto &pr: oth.coefs) {\n std::string param=pl.first+pr.first;\n std::sort(param.begin(), param.end());\n coefs[param] += pl.second*pr.second;\n }\n }\n return normalized();\n }\n\n Poly &operator ^=(int iexp) {\n if (iexp == 0) {\n // does not appear in #1233\n coefs.clear();\n coefs[\"\"] = 1; // means 1\n } else {\n Poly tmp(*this);\n for (int i=1; i<iexp; ++i)\n // O(iexp) multiplications, ugh\n *this *= tmp;\n }\n return normalized();\n }\n\n Poly operator +(const Poly &oth) const { return Poly(*this) += oth; }\n Poly operator -(const Poly &oth) const { return Poly(*this) -= oth; }\n Poly operator *(const Poly &oth) const { return Poly(*this) *= oth; }\n Poly operator ^(int iexp) const { return Poly(*this) ^= iexp; }\n bool operator ==(const Poly &oth) const { return coefs == oth.coefs; }\n\n void debug() const {\n if (coefs.empty()) {\n fprintf(stderr, \"#> 0\\n\");\n return;\n }\n fprintf(stderr, \"#>\");\n for (const auto &p: coefs)\n fprintf(stderr, \" %d%s\", p.second, p.first.c_str());\n fprintf(stderr, \"\\n\");\n }\n};\n\nstd::string normalize(const std::string &s) {\n // explicit `*' signs and no spaces\n std::string res;\n enum {\n NONE, PAREN, FACTOR, OPERATOR\n } last=NONE;\n for (size_t i=0; i<s.length(); ++i) {\n if (s[i] == '(') {\n if (last == FACTOR) {\n res += '*';\n }\n res += '(';\n last = PAREN;\n } else if (s[i] == ')') {\n res += ')';\n last = FACTOR;\n } else if (isalnum(s[i])) {\n if (last == FACTOR) {\n res += '*';\n }\n res += s[i];\n if (isdigit(s[i])) {\n while (i+1 < s.length() && isdigit(s[i+1]))\n res += s[++i];\n }\n last = FACTOR;\n } else if (!isspace(s[i])) {\n res += s[i];\n last = OPERATOR;\n }\n }\n // fprintf(stderr, \"#< %s\\n\", res.c_str());\n return res;\n}\n\nint testcase_ends() {\n char buf[96];\n fgets(buf, sizeof buf, stdin);\n std::string s=buf;\n if (s == \".\\n\")\n return 1;\n\n s = normalize(s);\n Poly ps(s);\n while (true) {\n fgets(buf, sizeof buf, stdin);\n std::string t=buf;\n if (t == \".\\n\") {\n printf(\".\\n\");\n return 0;\n }\n\n t = normalize(t);\n Poly pt(t);\n printf(\"%s\\n\", (ps == pt)? \"yes\":\"no\");\n }\n}\n\nint main() {\n while (!testcase_ends()) {}\n}","accuracy":1,"time_ms":100,"memory_kb":3112,"score_of_the_acc":-0.0815,"final_rank":5},{"submission_id":"aoj_1233_2880804","code_snippet":"#include <cstdio>\n#include <cstdint>\n#include <cassert>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <map>\n\n#define fprintf(...) void(0)\n\nclass Poly {\n std::map<std::string, int> coefs;\n // e.g. coefs[\"aab\"] == 2 <=> the polynomial has the term 2 a^2 b\n const std::string s;\n\n Poly &operator ^=(const Poly &oth) {\n if (oth.coefs.size() == 1 && oth.coefs.find(\"\") != oth.coefs.end()) {\n return (*this) ^= oth.coefs.find(\"\")->second;\n } else if (oth.coefs.empty()) {\n // means 0\n coefs.clear();\n coefs[\"\"] = 1; // means 1\n return (*this);\n }\n\n assert(false);\n }\n\n Poly &op_eq(char op, const Poly &rhs) {\n // (*this) @= rhs\n switch (op) {\n case '+': return (*this) += rhs;\n case '-': return (*this) -= rhs;\n case '*': return (*this) *= rhs;\n case '^': return (*this) ^= rhs;\n default: assert(false);\n }\n }\n\n Poly fourt(\n size_t &i, \n const std::vector<std::string> &ops={\"+-\", \"*\", \"^\", \"\"},\n size_t prec=0) {\n\n if (ops[prec].empty()) {\n if (s[i] == '(') {\n Poly tmp=fourt(++i, ops, 0);\n assert(s[i] == ')');\n ++i;\n return tmp;\n }\n if (isalpha(s[i])) {\n // we assume only one-character variables\n return Poly(s[i++]);\n }\n int coef=0;\n while (s[i] >= '0' && s[i] <= '9')\n coef = coef*10 + s[i++]-'0';\n return Poly(coef);\n }\n\n Poly res=fourt(i, ops, prec+1);\n while (i < s.length()) {\n char op=s[i];\n if (!std::count(ops[prec].begin(), ops[prec].end(), op))\n break;\n Poly tmp=fourt(++i, ops, prec+1);\n res.op_eq(op, tmp);\n }\n return res;\n }\n\n Poly &normalized() {\n for (auto it=coefs.begin(); it!=coefs.end(); ++it) {\n if (it->second == 0) {\n fprintf(stderr, \"Removed: %s\\n\", it->first.c_str());\n coefs.erase(it);\n }\n }\n return *this;\n }\n\npublic:\n Poly(const std::string &s): s(s) {\n size_t i=0;\n coefs = fourt(i).coefs; // ugh\n }\n\n Poly(char ch): s(1, ch) {\n assert(isalpha(ch));\n coefs[s] = 1;\n }\n\n Poly(int n): s(std::to_string(n)) {\n if (n)\n coefs[\"\"] = n;\n }\n\n Poly &operator +=(const Poly &oth) {\n for (const auto &p: oth.coefs) {\n const std::string ¶m=p.first;\n int coef=p.second;\n coefs[param] += coef;\n }\n return normalized();\n }\n\n Poly &operator -=(const Poly &oth) {\n for (const auto &p: oth.coefs) {\n const std::string ¶m=p.first;\n int coef=p.second;\n coefs[param] -= coef;\n }\n return normalized();\n }\n\n Poly &operator *=(const Poly &oth) {\n Poly tmp(*this);\n coefs.clear();\n for (const auto &pl: tmp.coefs) {\n for (const auto &pr: oth.coefs) {\n std::string param=pl.first+pr.first;\n std::sort(param.begin(), param.end());\n coefs[param] += pl.second*pr.second;\n }\n }\n return normalized();\n }\n\n Poly &operator ^=(int iexp) {\n if (iexp == 0) {\n // does not appear in #1233\n coefs.clear();\n coefs[\"\"] = 1; // means 1\n } else {\n Poly tmp(*this);\n for (int i=1; i<iexp; ++i)\n // O(iexp) multiplications, ugh\n *this *= tmp;\n }\n return normalized();\n }\n\n Poly operator +(const Poly &oth) const { return Poly(*this) += oth; }\n Poly operator -(const Poly &oth) const { return Poly(*this) -= oth; }\n Poly operator *(const Poly &oth) const { return Poly(*this) *= oth; }\n Poly operator ^(int iexp) const { return Poly(*this) ^= iexp; }\n bool operator ==(const Poly &oth) const { return coefs == oth.coefs; }\n\n void debug() const {\n if (coefs.empty()) {\n fprintf(stderr, \"#> 0\\n\");\n return;\n }\n fprintf(stderr, \"#>\");\n for (const auto &p: coefs)\n fprintf(stderr, \" %d%s\", p.second, p.first.c_str());\n fprintf(stderr, \"\\n\");\n }\n};\n\nstd::string normalize(const std::string &s) {\n // explicit `*' signs and no spaces\n std::string res;\n enum {\n NONE, PAREN, FACTOR, OPERATOR\n } last=NONE;\n for (size_t i=0; i<s.length(); ++i) {\n if (s[i] == '(') {\n if (last == FACTOR) {\n res += '*';\n }\n res += '(';\n last = PAREN;\n } else if (s[i] == ')') {\n res += ')';\n last = FACTOR;\n } else if (isalnum(s[i])) {\n if (last == FACTOR) {\n res += '*';\n }\n res += s[i];\n if (isdigit(s[i])) {\n while (i+1 < s.length() && isdigit(s[i+1]))\n res += s[++i];\n }\n last = FACTOR;\n } else if (!isspace(s[i])) {\n res += s[i];\n last = OPERATOR;\n }\n }\n fprintf(stderr, \"#< %s\\n\", res.c_str());\n return res;\n}\n\nint testcase_ends() {\n char buf[96];\n fgets(buf, sizeof buf, stdin);\n std::string s=buf;\n if (s == \".\\n\")\n return 1;\n\n s = normalize(s);\n Poly ps(s);\n ps.debug();\n while (true) {\n fgets(buf, sizeof buf, stdin);\n std::string t=buf;\n if (t == \".\\n\") {\n printf(\".\\n\");\n return 0;\n }\n\n t = normalize(t);\n Poly pt(t);\n pt.debug();\n printf(\"%s\\n\", (ps == pt)? \"yes\":\"no\");\n }\n}\n\nint main() {\n while (!testcase_ends()) {}\n}","accuracy":1,"time_ms":80,"memory_kb":3112,"score_of_the_acc":-0.0757,"final_rank":3},{"submission_id":"aoj_1233_2833675","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nstruct term {\n int coff;\n vector<int> deg;\n\n term() : coff(1), deg(26, 0) {}\n\n bool operator<(const term& other) const {\n return deg < other.deg;\n }\n bool operator==(const term& other) const {\n return coff == other.coff && deg == other.deg;\n }\n};\n\nstruct expression {\n void add_term(term new_term) {\n for(auto& t : terms) {\n if(t.deg == new_term.deg) {\n t.coff += new_term.coff;\n return;\n }\n }\n terms.push_back(move(new_term));\n sort(begin(terms), end(terms));\n clean_up();\n }\n\n void add_expr(expression e) {\n for(auto& t : e.terms) {\n add_term(t);\n }\n clean_up();\n }\n\n expression operator-() const {\n expression res;\n res.terms = terms;\n for(auto& t : res.terms) {\n t.coff = -t.coff;\n }\n return res;\n }\n\n bool operator==(expression const& other) const {\n return terms == other.terms;\n }\n\n void clean_up() {\n terms.erase(remove_if(begin(terms), end(terms),\n [](const auto& t1) {\n return t1.coff == 0;\n }),\n end(terms));\n }\n\n void debug_print() const {\n cout << \"sz: \" << terms.size() << endl;\n for(auto& t : terms) {\n cout << \"coff: \" << t.coff << \" deg: \";\n for(int i = 0; i < 26; ++i) {\n cout << t.deg[i] << ' ';\n }\n cout << endl;\n }\n }\n\n vector<term> terms;\n};\n\nterm operator*(term a, term const& rhs) {\n a.coff *= rhs.coff;\n for(int i = 0; i < 26; ++i) {\n a.deg[i] += rhs.deg[i];\n }\n return a;\n}\n\nexpression operator*(expression const& lhs, expression const& rhs) {\n expression res;\n for(auto const& t1 : lhs.terms) {\n for(auto const& t2 : rhs.terms) {\n res.add_term(t1 * t2);\n }\n }\n return res;\n}\n\n\nexpression parse_expr(string const& s, int& p);\nexpression parse_term(string const& s, int& p);\nexpression parse_factor(string const& s, int& p);\nvoid skip_sp(string const& s, int& p);\nint number(string const& s, int& p);\n\nexpression parse_expr(string const& s, int& p) {\n auto e = parse_term(s, p);\n skip_sp(s, p);\n while(p < (int)s.size() && (s[p] == '+' || s[p] == '-')) {\n const char op = s[p++];\n skip_sp(s, p);\n auto t2 = parse_term(s, p);\n if(op == '-') {\n t2 = -t2;\n }\n e.add_expr(t2);\n skip_sp(s, p);\n }\n return e;\n}\n\nexpression parse_term(string const& s, int& p) {\n auto e = parse_factor(s, p);\n skip_sp(s, p);\n while(p < (int)s.size() && s[p] != '+' && s[p] != '-' && s[p] != ')') {\n auto f = parse_factor(s, p);\n e = e * f;\n }\n return e;\n}\n\nexpression parse_factor(string const& s, int& p) {\n expression res;\n skip_sp(s, p);\n\n if(s[p] == '(') {\n skip_sp(s, ++p);\n auto e = parse_expr(s, p);\n res = e;\n skip_sp(s, p);\n assert(s[p] == ')');\n skip_sp(s, ++p); // )\n if(p < (int)s.size() && s[p] == '^') {\n skip_sp(s, ++p);\n int d = number(s, p); // todo: only \"^ (number)\" ?\n for(int i = 0; i < d - 1; ++i) {\n res = res * e;\n }\n }\n skip_sp(s, p);\n } else if(isdigit(s[p])) {\n const int n = number(s, p);\n term t;\n t.coff = n;\n res.add_term(t);\n skip_sp(s, p);\n } else if(isalpha(s[p])) {\n const int idx = s[p++] - 'a';\n term t;\n t.deg[idx] = 1;\n skip_sp(s, p);\n if(p < (int)s.size() && s[p] == '^') {\n skip_sp(s, ++p);\n t.deg[idx] *= number(s, p);\n skip_sp(s, p);\n }\n res.add_term(t);\n } else {\n cout << \"str: \" << s << \" p: \" << p << \" s[p]: \" << s[p] << endl;\n assert(false);\n }\n\n return res;\n}\n\nint number(string const& s, int& p) {\n assert(isdigit(s[p]));\n int res = 0;\n while(p < (int)s.size() && isdigit(s[p])) {\n res *= 10;\n res += s[p++] - '0';\n }\n return res;\n}\n\nvoid skip_sp(string const& s, int& p) {\n while(p < (int)s.size() && s[p] == ' ') {\n p++;\n }\n}\n\nexpression parse(string const& s) {\n int p = 0;\n return parse_expr(s, p);\n}\n\n\nint main() {\n string s;\n while(getline(cin, s), s[0] != '.') {\n if(s.back() == '\\r') s.pop_back();\n const auto target = parse(s);\n string t;\n while(getline(cin, t), t[0] != '.') {\n if(t.back() == '\\r') t.pop_back();\n const auto ss = parse(t);\n if(target == ss) {\n cout << \"yes\" << endl;\n } else {\n cout << \"no\" << endl;\n }\n }\n cout << \".\" << endl;\n }\n}","accuracy":1,"time_ms":420,"memory_kb":3372,"score_of_the_acc":-0.2027,"final_rank":14},{"submission_id":"aoj_1233_2565832","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nusing K = string;\nusing M = map<K, int>;\n\nK mul(K k1, K k2){\n\tk1 += k2;\n\tsort(k1.begin(), k1.end());\n\treturn k1;\n}\n\nM add(M m1, M m2){\n\tfor(auto v : m2){\n\t\tm1[v.first] += v.second;\n\t}\n\treturn m1;\n}\n\nM mul(M m1, M m2){\n\tM ret;\n\tfor(const auto& v1 : m1){\n\t\tfor(const auto& v2 : m2){\n\t\t\tK k = mul(v1.first, v2.first);\n\t\t\tret[k] += v1.second * v2.second;\n\t\t}\n\t}\n\treturn ret;\n}\n\nM pow(M m, int x){\n\tM ret;\n\tret[\"\"] = 1;\n\tM a = m;\n\twhile(x){\n\t\tif(x & 1) ret = mul(ret, a);\n\t\tx /= 2;\n\t\ta = mul(a, a);\n\t}\n\treturn ret;\n}\n\nint c;\nint N;\nstring s;\n\nM exp();\nM term();\nM fact();\n\nvoid skip(){\n\twhile(c < N && (s[c] == ' ')) c++;\n}\n\nM exp(){\n\tskip();\n\tM t1 = term();\n\n\tskip();\n\twhile(c < N && (s[c] == '+' || s[c] == '-')){\n\t\tchar ch = s[c];\n\t\tc++;\n\t\tskip();\n\t\tM t2 = term();\n\t\tif(ch == '-'){\n\t\t\tfor(auto& v : t2){\n\t\t\t\tv.second *= -1;\n\t\t\t}\n\t\t}\n\t\tt1 = add(t1, t2);\n\t}\n\treturn t1;\n}\n\nM term(){\n\tskip();\n\tM f1 = fact();\n\tskip();\n\twhile(c < N && (isalnum(s[c]) || s[c] == '(')){\n\t\tM f2 = fact();\n\t\tskip();\n\t\tf1 = mul(f1, f2);\n\t}\n\treturn f1;\n}\n\nM fact(){\n\tskip();\n\tM r;\n\tif(s[c] == '('){\n\t\tc++;\n\t\tr = exp();\n\t\tc++;\n\t\tskip();\n\t}\n\telse if(isalpha(s[c])){\n\t\tK k;\n\t\tk += s[c];\n\t\tc++;\n\t\tr[k]++;\n\t}\n\telse if(isdigit(s[c])){\n\t\tint x = 0;\n\t\twhile(c < N && isdigit(s[c])){\n\t\t\tx = x * 10 + s[c] - '0';\n\t\t\tc++;\n\t\t}\n\t\tr[\"\"] += x;\n\t}\n\tskip();\n\tif(c < N && s[c] == '^'){\n\t\tc++;\n\t\tskip();\n\t\tint x = s[c] - '0';\n\t\tc++;\n\t\tskip();\n\t\tr = pow(r, x);\n\t}\n\treturn r;\n}\n\nM f(string t){\n\tc = 0;\n\ts = t;\n\tN = s.size();\n\treturn exp();\n}\n\nM filter(M m){\n\tM ret;\n\tfor(auto v : m){\n\t\tif(v.second == 0) continue;\n\t\tret[v.first] = v.second;\n\t}\n\treturn ret;\n}\n\nint main(){\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n#ifdef LOCAL\n\tstd::ifstream in(\"in\");\n\tstd::cin.rdbuf(in.rdbuf());\n#endif\n\n\t//auto ret = f(\"a- (b-c)+2\");\n\n\tstring x, y;\n\twhile(getline(cin, x), x != \".\"){\n\t\tM xm = filter(f(x));\n\t\twhile(getline(cin, y), y != \".\"){\n\t\t\tauto res = filter(f(y));\n\t\t\tif(xm == res){\n\t\t\t\tcout << \"yes\" << endl;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tcout << \"no\" << endl;\n\t\t\t}\n\t\t}\n\t\tcout << \".\" << endl;\n\t}\n}","accuracy":1,"time_ms":90,"memory_kb":3380,"score_of_the_acc":-0.1082,"final_rank":6},{"submission_id":"aoj_1233_2555742","code_snippet":"#include <bits/stdc++.h>\n#define int long long\n#define r(i,n) for(int i=0;i<n;i++)\n#define mod 1000000007\nusing namespace std;\nstring s,t;\nint p;\nmap<char,int>m;\nvoid convertS(){\n r(i,s.size()){\n if(i&&s[i]==' '){\n if(s[i-1]==')'&&s[i+1]=='(')s[i]='*';\n else if(isalpha(s[i-1])&&isalpha(s[i+1]))s[i]='*';\n else if(s[i-1]==')'&&isalpha(s[i+1]))s[i]='*';\n else if(isalpha(s[i-1])&&s[i+1]=='(')s[i]='*';\n else if(s[i-1]==')'&&isdigit(s[i+1]))s[i]='*';\n else if(isdigit(s[i-1])&&s[i+1]=='(')s[i]='*';\n else if(isdigit(s[i-1])&&isalpha(s[i+1]))s[i]='*';\n else if(isalpha(s[i-1])&&isdigit(s[i+1]))s[i]='*';\n else if(isdigit(s[i-1])&&isdigit(s[i+1]))s[i]='*';\n else s.erase(s.begin()+i--);\n }\n if(isdigit(s[i])&&isalpha(s[i+1]))s.insert(s.begin()+i+1,'*');\n if(isalpha(s[i])&&isalpha(s[i+1]))s.insert(s.begin()+i+1,'*');\n if(isalpha(s[i])&&isdigit(s[i+1]))s.insert(s.begin()+i+1,'*');\n if(s[i]==')'&&isalpha(s[i+1]))s.insert(s.begin()+i+1,'*');\n if(s[i]==')'&&isdigit(s[i+1]))s.insert(s.begin()+i+1,'*');\n if(s[i+1]=='('&&isalpha(s[i]))s.insert(s.begin()+i+1,'*');\n if(s[i+1]=='('&&isdigit(s[i]))s.insert(s.begin()+i+1,'*');\n if(s[i+1]=='('&&s[i]==')')s.insert(s.begin()+i+1,'*');\n }\n}\nvoid convertT(){\n r(i,t.size()){\n if(i&&t[i]==' '){\n if(t[i-1]==')'&&t[i+1]=='(')t[i]='*';\n else if(isalpha(t[i-1])&&isalpha(t[i+1]))t[i]='*';\n else if(t[i-1]==')'&&isalpha(t[i+1]))t[i]='*';\n else if(isalpha(t[i-1])&&t[i+1]=='(')t[i]='*';\n else if(t[i-1]==')'&&isdigit(t[i+1]))t[i]='*';\n else if(isdigit(t[i-1])&&t[i+1]=='(')t[i]=='*';\n else if(isdigit(t[i-1])&&isalpha(t[i+1]))t[i]='*';\n else if(isalpha(t[i-1])&&isdigit(t[i+1]))t[i]='*';\n else if(isdigit(t[i-1])&&isdigit(t[i+1]))t[i]='*';\n else t.erase(t.begin()+i--);\n }\n if(isdigit(t[i])&&isalpha(t[i+1]))t.insert(t.begin()+i+1,'*');\n if(isalpha(t[i])&&isalpha(t[i+1]))t.insert(t.begin()+i+1,'*');\n if(isalpha(t[i])&&isdigit(t[i+1]))t.insert(t.begin()+i+1,'*');\n if(t[i]==')'&&isalpha(t[i+1]))t.insert(t.begin()+i+1,'*');\n if(t[i]==')'&&isdigit(t[i+1]))t.insert(t.begin()+i+1,'*');\n if(t[i+1]=='('&&isalpha(t[i]))t.insert(t.begin()+i+1,'*');\n if(t[i+1]=='('&&isdigit(t[i]))t.insert(t.begin()+i+1,'*');\n if(t[i+1]=='('&&t[i]==')')t.insert(t.begin()+i+1,'*');\n }\n}\nint Sbnf1();\nint get_S(){\n int res=0;\n if(s[p]=='(')p++,res=Sbnf1(),p++;\n else if(isdigit(s[p])){\n while(isdigit(s[p])){\n res=res*10+(s[p++]-'0');\n }\n }\n else res=m[s[p++]];\n return res%mod;\n}\nint Sbnf3(){\n int res=get_S();\n while(s[p]=='^'){\n p++;\n int ret=get_S(),kit=res;\n r(i,ret-1){\n res*=kit;\n res=res%mod;\n }\n }\n return res%mod;\n}\nint Sbnf2(){\n int res=Sbnf3();\n while(s[p]=='*'){\n p++;\n res*=Sbnf3();\n res=res%mod;\n }\n return res%mod;\n}\nint Sbnf1(){\n int res=Sbnf2();\n while(s[p]=='+'||s[p]=='-'){\n int pp=p++;\n if(s[pp]=='+')res+=Sbnf2();\n if(s[pp]=='-')res-=Sbnf2();\n while(res<0)res+=mod;\n res=res%mod;\n }\n return res%mod;\n}\nint Tbnf1();\nint get_T(){\n int res=0;\n if(t[p]=='(')p++,res=Tbnf1(),p++;\n else if(isdigit(t[p])){\n while(isdigit(t[p])){\n res=res*10+(t[p++]-'0');\n }\n }\n else res=m[t[p++]];\n return res%mod;\n}\nint Tbnf3(){\n int res=get_T();\n while(t[p]=='^'){\n p++;\n int ret=get_T(),kit=res;\n r(i,ret-1){\n res*=kit;\n res=res%mod;\n }\n }\n return res%mod;\n}\nint Tbnf2(){\n int res=Tbnf3();\n while(t[p]=='*'){\n p++;\n res*=Tbnf3();\n res=res%mod;\n }\n return res%mod;\n}\nint Tbnf1(){\n int res=Tbnf2();\n while(t[p]=='+'||t[p]=='-'){\n int pp=p++;\n if(t[pp]=='+')res+=Tbnf2();\n if(t[pp]=='-')res-=Tbnf2();\n while(res<0)res+=mod;\n res=res%mod;\n }\n return res%mod;\n}\nmain(){\n while(getline(cin,t)){\n if(t==\".\")break;\n convertT();\n while(getline(cin,s)){\n if(s==\".\"){\n cout<<'.'<<endl;\n break;\n }\n int flag = 0;\n convertS();\n r(i,100){\n r(j,26)m[j+'a']=rand()%mod;\n p=0;\n int y=Tbnf1()%mod;\n p=0;\n int x=Sbnf1()%mod;\n if(y!=x)flag++;\n }\n cout<<(flag?\"no\":\"yes\")<<endl;\n }\n }\n}","accuracy":1,"time_ms":70,"memory_kb":3140,"score_of_the_acc":-0.0759,"final_rank":4},{"submission_id":"aoj_1233_2548634","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef unsigned long long ll;\n \nstring s;\nint p;\n \nll A[200][300];\nint idx;\n \nll bnf();\n \nll get_num(){\n \n if(s[p]=='('){\n \n p++;\n \n ll res=bnf();\n \n p++;\n \n return res;\n }\n \n if('a'<=s[p]&&s[p]<='z') return A[idx][s[p++]];\n \n ll num=0;\n \n while('0'<=s[p]&&s[p]<='9') num=num*10+s[p]-'0', p++;\n \n return num;\n \n}\n \nll bnf3(){\n \n ll res=get_num();\n \n while(p<s.size()){\n \n if(s[p]=='^'){\n \n p++;\n \n ll r=get_num();\n \n ll tmp=1;\n \n for(int i=0;i<r;i++) tmp*=res;\n \n res=tmp;\n \n }else break;\n \n }\n \n return res;\n}\n \nll bnf2(){\n \n ll res=bnf3();\n \n while(p<s.size()){\n \n if(s[p]=='*'){\n \n p++;\n \n ll r=bnf3();\n \n res*=r;\n \n }else break;\n \n }\n \n return res;\n}\n \nll bnf(){\n \n ll res=bnf2();\n \n while(p<s.size()){\n \n if(s[p]=='+'){\n \n p++;\n \n ll r=bnf2();\n \n res+=r;\n \n }\n else if(s[p]=='-'){\n \n p++;\n \n ll r=bnf2();\n \n res-=r;\n \n }else break;\n \n }\n \n return res;\n}\n \nvoid change(){\n \n for(int i=0;i<s.size();i++)\n if((s[i]==')'||('a'<=s[i]&&s[i]<='z')||('0'<=s[i]&&s[i]<='9')))\n if((s[i+1]=='('||('a'<=s[i+1]&&s[i+1]<='z')||('0'<=s[i+1]&&s[i+1]<='9')))\n if(!('0'<=s[i]&&s[i]<='9'&&'0'<=s[i+1]&&s[i+1]<='9'))\n s=s.substr(0,i+1)+'*'+s.substr(i+1);\n \n \n for(int i=0;i<s.size();i++)\n \n if(s[i]==' ')\n \n while(s[i]==' '&&i+1<s.size()&&s[i+1]==' ') s.erase(s.begin()+i);\n \n \n if(s[0]==' ') s.erase(s.begin());\n \n if(s[s.size()-1]==' ') s.erase(s.begin()+s.size()-1);\n \n for(int i=0;i<s.size();i++)\n if(s[i]==' ')\n if((s[i-1]==')'||('a'<=s[i-1]&&s[i-1]<='z')||('0'<=s[i-1]&&s[i-1]<='9')))\n if((s[i+1]=='('||('a'<=s[i+1]&&s[i+1]<='z')||('0'<=s[i+1]&&s[i+1]<='9'))) s[i]='*';\n \n for(int i=0;i<s.size();i++)\n \n if(s[i]==' ') s.erase(s.begin()+i), i--;\n \n \n}\n \nint main(){\n \n for(int T=0;T<200;T++)\n \n for(int i=0;i<300;i++) A[T][i]=rand();\n \n while(1){\n \n string tmp=s;\n \n getline(cin,s);\n \n if(s==\".\") break;\n \n change();\n \n ll base[200];\n \n for(int T=0;T<200;T++){\n idx=T;\n p=0;\n base[T]=bnf();\n }\n \n while(1){\n \n getline(cin,s);\n \n if(s==\".\"){\n cout<<\".\"<<endl;\n break;\n }\n \n change();\n \n bool ans=true;\n \n for(int T=0;T<200;T++){\n \n idx=T; \n p=0;\n \n ll r=bnf();\n \n if(base[T]!=r) ans=false;\n \n }\n \n if(ans) cout<<\"yes\"<<endl;\n else cout<<\"no\"<<endl;\n \n }\n \n }\n \n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":3640,"score_of_the_acc":-0.1283,"final_rank":11},{"submission_id":"aoj_1233_2548404","code_snippet":"#include <bits/stdc++.h>\n#define int long long\nusing namespace std;\ntypedef pair<string,int> P;\ntypedef map<string,int> M;\n\nM add(M a,M b){\n for(P p2:b) a[p2.first] += p2.second;\n return a;\n}\n\nM Minus(M a,M b){\n for(P p2:b) a[p2.first] -= p2.second;\n return a;\n}\n \nM mult(M a,M b){\n M res;\n for(P p1:a)\n for(P p2:b){\n string s = p1.first + p2.first; sort(s.begin(),s.end());\n int num = p1.second * p2.second;\n res[s] += num;\n }\n return res;\n}\n \nM bnf();\nint pos;\nstring S;\nvoid skipsp(){while(S[pos] == ' ') pos++;}\n \nint getNum(){\n int res = 0;\n while(isdigit(S[pos])) res = res * 10 + S[pos++]-'0';\n return res;\n}\n \nint getNum2(const string &S,int &pos){\n int res = 0;\n while(isdigit(S[pos])) res = res * 10 + S[pos++]-'0';\n return res;\n}\n\nstring getBlock(){\n string res;\n skipsp();\n while(isdigit(S[pos]) || isalpha(S[pos])) res += S[pos++];\n skipsp();\n if(S[pos] == '^') {\n pos++;\n skipsp();\n assert(isdigit(S[pos])&&\"hut\");\n int p = getNum();\n for(int i=0;i<p-1;i++) res += res.back();\n }\n return res;\n}\n \nM BtoM(string b){\n M res;\n int num = 1;\n string val;\n for(int i=0;i<(int)b.size();i++){\n char ch = b[i];\n if(isalpha(ch)) val += ch;\n else if(isdigit(ch)) num *= getNum2(b,i),i--;\n else assert(ch == ' ' && \"BtoM\");\n }\n res[val] = num;\n return res;\n}\n \nM calc(){\n M res; res[\"\"] = 1;\n while(1){\n skipsp();\n char ch = S[pos];\n if(ch == '(') pos++,res = mult(res,bnf()),pos++;\n else if(isalpha(ch) || isdigit(ch)){\n string block = getBlock();\n res = mult(res,BtoM(block));\n }\n else if(ch == '^') assert(!\"^\");\n else break;\n }\n return res;\n}\n \nM bnf(){\n M res = calc();\n while(1){\n skipsp();\n char ch = S[pos];\n if(isalpha(ch) || isdigit(ch)) res = mult(res,calc());\n else if(ch == '+')pos++,res = add(res,calc());\n else if(ch == '-')pos++,res = Minus(res,calc());\n else if(ch == '(') pos++,res = mult(res,bnf()),pos++;\n else if(ch == '^') assert(!\"^\");\n else break;\n }\n for(auto it=res.begin();it!=res.end();it++) if(it->second == 0) res.erase(it);\n return res;\n}\n \nsigned main(){\n while(1){\n getline(cin,S);\n if(S == \".\") break;\n pos = 0;\n M ori = bnf();\n while(1){\n getline(cin,S);\n if(S == \".\") break;\n pos = 0;\n M res = bnf();\n cout<<((ori == res)? \"yes\":\"no\")<<endl;\n }\n cout<<\".\"<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":3444,"score_of_the_acc":-0.1124,"final_rank":7},{"submission_id":"aoj_1233_2548386","code_snippet":"#include <bits/stdc++.h>\n#define int long long\nusing namespace std;\ntypedef pair<string,int> P;\ntypedef map<string,int> M;\n \nvoid pr(M a,string s=\"\"){\n return;\n cout<<s<<endl;\n for(P p:a) cout<<p.first<<\" \"<<p.second<<endl;\n cout<<\"end\"<<endl;\n}\n \nM add(M a,M b,int f=1){\n for(P p2:b) a[p2.first] += f * p2.second;\n return a;\n}\n \nM mult(M a,M b){\n M res;\n for(P p1:a)\n for(P p2:b){\n string s = p1.first + p2.first; sort(s.begin(),s.end());\n int num = p1.second * p2.second;\n res[s] += num;\n }\n return res;\n}\n \n \nM bnf();\nint pos;\nstring S;\nvoid skipsp(){while(S[pos] == ' ') pos++;}\n \nint getNum(){\n int res = 0;\n while((int)S.size()> pos && isdigit(S[pos])) res = res * 10 + S[pos++]-'0';\n return res;\n}\n \nint getNum2(const string &S,int &pos){\n int res = 0;\n while((int)S.size()>pos && isdigit(S[pos])) res = res * 10 + S[pos++]-'0';\n return res;\n}\n \nstring getBlock(){\n string res;\n skipsp();\n while(isdigit(S[pos]) || isalpha(S[pos])) res += S[pos++];\n skipsp();\n if(S[pos] == '^') {\n pos++;\n skipsp();\n assert(isdigit(S[pos])&&\"hut\");\n int p = getNum();\n for(int i=0;i<p-1;i++) res += res.back();\n }\n return res;\n}\n \nM BtoM(string b){\n M res;\n int num = 1;\n string val;\n for(int i=0;i<(int)b.size();i++){\n char ch = b[i];\n if(isalpha(ch)) val += ch;\n else if(isdigit(ch)) num *= getNum2(b,i),i--;\n else if(ch != ' ') assert(!\"BtoM\");\n }\n res[val] = num;\n return res;\n}\n \nM calc(){\n M res; res[\"\"] = 1;\n while(1){\n skipsp();\n char ch = S[pos];\n if(ch == '(') pos++,res = mult(res,bnf()),pos++;\n else if(isalpha(ch) || isdigit(ch)){\n string block = getBlock();\n res = mult(res,BtoM(block));\n }\n else if(ch == '^') assert(!\"^\");\n else break;\n }\n pr(res,\"calc,res\");\n return res;\n}\n \nM bnf(){\n M res = calc();\n pr(res,\"start bnf\");\n while(1){\n skipsp();\n char ch = S[pos];\n if(isalpha(ch) || isdigit(ch)) res = mult(res,calc());\n else if(ch == '+')pos++,res = add(res,calc());\n else if(ch == '-')pos++,res = add(res,calc(),-1);\n else if(ch == '(') pos++,res = mult(res,bnf()),pos++;\n else if(ch == '^') assert(!\"^\");\n else break;\n }\n \n for(auto it=res.begin();it!=res.end();it++) if(it->second==0) res.erase(it);\n pr(res,\"return bnf\");\n return res;\n}\n \nsigned main(){\n while(1){\n getline(cin,S);\n //cin.ignore();\n if(S == \".\") break;\n pos = 0;\n M ori = bnf();\n pr(ori,\"ori\");\n while(1){\n getline(cin,S);\n if(S == \".\") break;\n pos = 0;\n M res = bnf();\n cout<<((ori == res)? \"yes\":\"no\")<<endl;\n pr(res,S);\n }\n cout<<\".\"<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":90,"memory_kb":3428,"score_of_the_acc":-0.1135,"final_rank":8},{"submission_id":"aoj_1233_2548314","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef unsigned long long ll;\n\nstring s;\nint p;\n\nll A[200][300];\nint idx;\n\nll bnf();\n\nll get_num(){\n\n if(s[p]=='('){\n \n p++;\n\n ll res=bnf();\n \n p++;\n\n return res;\n }\n \n if('a'<=s[p]&&s[p]<='z') return A[idx][s[p++]];\n \n ll num=0;\n \n while('0'<=s[p]&&s[p]<='9') num=num*10+s[p]-'0', p++;\n\n return num;\n \n}\n\nll bnf3(){\n\n ll res=get_num();\n \n while(p<s.size()){\n\n if(s[p]=='^'){\n\n p++;\n\n ll r=get_num();\n\n ll tmp=1;\n\n for(int i=0;i<r;i++) tmp*=res;\n\n res=tmp;\n \n }else break;\n \n }\n \n return res;\n}\n\nll bnf2(){\n\n ll res=bnf3();\n\n while(p<s.size()){\n\n if(s[p]=='*'){\n\n p++;\n\n ll r=bnf3();\n \n res*=r;\n \n }else break;\n \n }\n \n return res;\n}\n\nll bnf(){\n\n ll res=bnf2();\n \n while(p<s.size()){\n \n if(s[p]=='+'){\n\n p++;\n \n ll r=bnf2();\n \n res+=r;\n \n }\n else if(s[p]=='-'){\n\n p++;\n\n ll r=bnf2();\n\n res-=r;\n \n }else break;\n \n }\n \n return res;\n}\n\nvoid change(){\n \n for(int i=0;i<s.size();i++)\n if((s[i]==')'||('a'<=s[i]&&s[i]<='z')||('0'<=s[i]&&s[i]<='9')))\n if((s[i+1]=='('||('a'<=s[i+1]&&s[i+1]<='z')||('0'<=s[i+1]&&s[i+1]<='9')))\n\tif(!('0'<=s[i]&&s[i]<='9'&&'0'<=s[i+1]&&s[i+1]<='9'))\n\t s=s.substr(0,i+1)+'*'+s.substr(i+1);\n\n \n for(int i=0;i<s.size();i++)\n \n if(s[i]==' ')\n \n while(s[i]==' '&&i+1<s.size()&&s[i+1]==' ') s.erase(s.begin()+i);\n \n\n if(s[0]==' ') s.erase(s.begin());\n \n if(s[s.size()-1]==' ') s.erase(s.begin()+s.size()-1);\n\n for(int i=0;i<s.size();i++)\n if(s[i]==' ')\n if((s[i-1]==')'||('a'<=s[i-1]&&s[i-1]<='z')||('0'<=s[i-1]&&s[i-1]<='9')))\n\tif((s[i+1]=='('||('a'<=s[i+1]&&s[i+1]<='z')||('0'<=s[i+1]&&s[i+1]<='9'))) s[i]='*';\n\n for(int i=0;i<s.size();i++)\n \n if(s[i]==' ') s.erase(s.begin()+i), i--;\n \n \n}\n\nint main(){\n \n for(int T=0;T<200;T++)\n \n for(int i=0;i<300;i++) A[T][i]=rand();\n \n while(1){\n\n string tmp=s;\n \n getline(cin,s);\n \n if(s==\".\") break;\n \n change();\n \n ll base[200];\n\n for(int T=0;T<200;T++){\n idx=T;\n p=0;\n base[T]=bnf();\n }\n \n while(1){\n \n getline(cin,s);\n \n if(s==\".\"){\n\tcout<<\".\"<<endl;\n\tbreak;\n }\n \n change();\n \n bool ans=true;\n \n for(int T=0;T<200;T++){\n \n\tidx=T; \n\tp=0;\n \n\tll r=bnf();\n\t\n\tif(base[T]!=r) ans=false;\n\t\n }\n \n if(ans) cout<<\"yes\"<<endl;\n else cout<<\"no\"<<endl;\n \n }\n \n }\n \n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":3632,"score_of_the_acc":-0.1274,"final_rank":10},{"submission_id":"aoj_1233_2469770","code_snippet":"#include <bits/stdc++.h>\n \n#define _overload(_1,_2,_3,name,...) name\n#define _rep(i,n) _range(i,0,n)\n#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)\n#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)\n \n#define _rrep(i,n) _rrange(i,n,0)\n#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)\n#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)\n \n#define _all(arg) begin(arg),end(arg)\n#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))\n#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)\n#define clr(a,b) memset((a),(b),sizeof(a))\n#define bit(n) (1LL<<(n))\n \n// #define DEBUG\n \n#ifdef DEBUG\n #define dump(...) fprintf(stderr, __VA_ARGS__)\n#else\n #define dump(...)\n#endif\n \ntemplate<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}\ntemplate<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}\n \nusing namespace std;\nusing ll=long long;\nusing vi=vector<int>;\nusing vll=vector<ll>;\n \nconst double EPS = 1e-10;\nconst double PI = acos(-1.0);\nconst ll inf =1LL << 62;\nconst ll mod=1000000007LL;\nconst int dx[4]={1,0,-1,0};\nconst int dy[4]={0,1,0,-1};\n \n \nll extgcd(ll a,ll b,ll& x,ll& y){x=1,y=0;ll g=a;if(b!=0) g=extgcd(b,a%b,y,x),y-=a/b*x;return g;}\nll ADD(const ll &a, const ll &b,const ll &mod) { return (a+b)%mod;}\nll SUB(const ll &a, const ll &b,const ll &mod) { return (a-b+mod)%mod;}\nll MUL(const ll &a, const ll &b,const ll &mod) { return (1LL*a*b)%mod;}\nll DIV(const ll &a, const ll &b,const ll &mod) {ll x,y; extgcd(b,mod,x,y);return MUL(a,(x+mod)%mod,mod);}\n \nrandom_device rd;\nmt19937 mt(rd());\nuniform_int_distribution<int> dice(1,6);\nuniform_real_distribution<double> score(0.0,10.0);\n\nstring f;\nint len;\nint p = 0;\n\nll exp();\nll term();\nll fact();\n\nll tbl['z' - 'a' + 1];\ninline ll c2n(char c){\n return tbl[c - 'a'];\n}\n\nchar next_c(){\n while(p < len and f[p] == ' ') p++;\n return f[p];\n}\n\nll exp(){\n ll ret = term();\n\n char c;\n while(c = next_c(), (c == '+' or c == '-')){\n p++;\n ll r = term();\n if(c == '+') ret = ADD(ret, r, mod);\n else ret = SUB(ret, r, mod);\n }\n\n return ret;\n}\n\nconst ll ERR = 2LL * mod;\n\nll term(){\n ll ret = fact();\n\n ll r;\n while((r = fact()) != ERR){\n ret = MUL(ret, r, mod);\n }\n\n return ret;\n}\n\ninline ll num(){\n ll ret = 0LL;\n next_c();\n while(isdigit(f[p])){\n ret = ret * 10 + (f[p] - '0');\n p++; // [0,9]\n }\n return ret % mod;\n} \n\nll fact(){\n ll ret = ERR;\n\n char c = next_c();\n if(c == '('){\n p++; // (\n ret = exp();\n assert(next_c() == ')'); p++;\n }\n else if(islower(c)){\n p++; // [a,z]\n ret = c2n(c);\n\n c = next_c();\n if(c == '^'){\n p++; // ^\n ll d = num();\n ll b = ret;\n rep(loop, d - 1){\n ret = MUL(ret, b, mod);\n }\n }\n }\n else if(isdigit(c)){\n ret = num();\n }\n else {\n // cerr << \"cur... \" << c << endl;\n }\n\n return ret;\n}\n\nint main(void){\n cin.tie(0);\n ios::sync_with_stdio(false);\n auto myrand = bind(uniform_int_distribution<int>(0, (int)1e6), mt19937(static_cast<unsigned int>(time(nullptr))));\n\n while(true){\n string mine;\n getline(cin, mine);\n if(mine == \".\") break;\n \n while(true){\n string opp;\n getline(cin, opp);\n if(opp == \".\") break;\n\n bool ok = true;\n rep(loop, 1000){\n rep(i, 'z' - 'a' + 1) tbl[i] = myrand();\n\n // cerr << \"-> \" << mine << endl;\n f = mine; p = 0; len = f.size(); ll a = exp();\n // cerr << \"-> \" << opp << endl;\n f = opp; p = 0; len = f.size(); ll b = exp();\n\n if(a != b){\n ok = false;\n break;\n }\n }\n\n if(ok){\n cout << \"yes\" << endl;\n }\n else {\n cout << \"no\" << endl;\n }\n }\n cout << \".\" << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3056,"score_of_the_acc":-0.0522,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_1233_8484392\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nconstexpr int W = 26;\\nusing Var = std::array<int, W>;\\nstd::ostream& operator<<(std::ostream& os, const Var& var) {\\n os << '(';\\n for (int i = 0; i < W; i++) {\\n if (var[i] == 0) continue;\\n os << '(' << (char)(i + 'a') << '^' << var[i] << ')';\\n }\\n os << ')';\\n return os;\\n}\\n\\nVar op(const Var& lhs, const Var& rhs) {\\n Var res;\\n res.fill(0);\\n for (int i = 0; i < W; i++) {\\n res[i] = lhs[i] + rhs[i];\\n }\\n return res;\\n}\\n\\nstruct Poly {\\n // data[var] = coef;\\n std::map<Var, long long> data;\\n\\n Poly(long long value = 0) {\\n Var var;\\n var.fill(0);\\n data[var] = value;\\n }\\n Poly(char c, int exp = 1) {\\n Var var;\\n var.fill(0);\\n var[c - 'a'] += exp;\\n data[var] = 1;\\n }\\n\\n friend Poly operator+(const Poly& lhs, const Poly& rhs) {\\n if (lhs.data.size() > rhs.data.size()) return rhs + lhs;\\n auto res = rhs;\\n for (const auto& [var, coef]: lhs.data) {\\n res.data[var] += coef;\\n }\\n return res;\\n }\\n\\n friend Poly operator-(const Poly& lhs, const Poly& rhs) {\\n auto res = lhs;\\n for (const auto& [var, coef]: rhs.data) {\\n res.data[var] -= coef;\\n }\\n return res;\\n }\\n\\n friend Poly operator*(const Poly& lhs, const Poly& rhs) {\\n Poly res;\\n for (const auto& [var1, coef1]: lhs.data) {\\n for (const auto& [var2, coef2]: rhs.data) {\\n res.data[op(var1, var2)] += coef1 * coef2;\\n }\\n }\\n return res;\\n }\\n\\n friend bool operator==(Poly& lhs, Poly& rhs) {\\n for (const auto& [var, coef]: lhs.data) {\\n if (rhs.data[var] != coef) return false;\\n }\\n for (const auto& [var, coef]: rhs.data) {\\n if (lhs.data[var] != coef) return false;\\n }\\n return true;\\n }\\n\\n Poly pow(int exp) {\\n Poly base(*this);\\n Poly res;\\n while (exp > 0) {\\n if (exp & 1) res = res + base;\\n base = base + base;\\n exp >>= 1;\\n }\\n return res;\\n }\\n\\n friend std::ostream& operator<<(std::ostream& os, const Poly& poly) {\\n for (const auto& [var, coef]: poly.data) {\\n if (coef == 0) continue;\\n if (coef > 0) {\\n os << '+';\\n }\\n os << coef << var << ' ';\\n }\\n return os;\\n }\\n};\\n\\nstruct Parser {\\n using CopyIter = std::string::const_iterator;\\n using Iter = CopyIter&;\\n std::string line;\\n Parser() {}\\n void skip(Iter it, char c) {\\n // std::cerr << *it << ' ' << c << std::endl;\\n assert(*it == c);\\n ++it;\\n }\\n void skip_space(Iter it) {\\n while (it != line.end() && *it == ' ') ++it;\\n }\\n\\n Poly parse(const std::string& s) {\\n line = s;\\n auto it = line.cbegin();\\n auto res = expr(it);\\n assert(it == line.end());\\n return res;\\n }\\n\\n Poly expr(Iter it) {\\n auto res = term(it);\\n\\n while (it != line.end() && (*it == '+' || *it == '-')) {\\n if (*it == '+') {\\n skip(it, '+');\\n skip_space(it);\\n res = res + term(it);\\n } else {\\n skip(it, '-');\\n skip_space(it);\\n res = res - term(it);\\n }\\n }\\n\\n skip_space(it);\\n return res;\\n }\\n\\n Poly term(Iter it) {\\n auto res = factor(it);\\n\\n while (it != line.end() && *it != '+' && *it != '-' && *it != ')') {\\n res = res * factor(it);\\n }\\n\\n skip_space(it);\\n return res;\\n }\\n\\n Poly factor(Iter it) {\\n if (std::isdigit(*it)) {\\n return nonnegative_number(it);\\n } else if (std::isalpha(*it)) {\\n return variable(it);\\n } else {\\n skip(it, '(');\\n skip_space(it);\\n auto res = expr(it);\\n skip(it, ')');\\n skip_space(it);\\n return res;\\n }\\n }\\n\\n Poly nonnegative_number(Iter it) {\\n long long res = 0;\\n while (it != line.end() && std::isdigit(*it)) {\\n char c = *it;\\n skip(it, c);\\n res = 10 * res + c - '0';\\n }\\n skip_space(it);\\n return Poly(res);\\n }\\n\\n Poly variable(Iter it) {\\n char var = *it;\\n assert(std::isalpha(var));\\n skip(it, var);\\n skip_space(it);\\n Poly res(var);\\n if (it != line.end() && *it == '^') {\\n skip(it, '^');\\n skip_space(it);\\n char exp = *it;\\n assert(std::isdigit(exp) && exp != '0');\\n skip(it, exp);\\n res = Poly(var, exp - '0');\\n }\\n skip_space(it);\\n return res;\\n }\\n};\\n\\nvoid parser_test() {\\n std::vector<std::string> tests = {\\n \\\"a+b+c\\\",\\n \\\"a a a\\\",\\n \\\"a^2 a a\\\",\\n \\\"(a^2+b)(a+b)\\\",\\n \\\"2ab (4a+2b)\\\",\\n \\\"2 2 3 3 3 a\\\"\\n };\\n\\n for (auto test: tests) {\\n std::cerr << test << \\\": \\\";\\n Parser parser;\\n std::cerr << parser.parse(test) << std::endl;\\n }\\n}\\n\\nint main() {\\n // parser_test();\\n Parser parser;\\n while (true) {\\n std::string line;\\n std::getline(std::cin, line);\\n if (line == \\\".\\\") break;\\n Poly answer = parser.parse(line);\\n\\n while (true) {\\n std::getline(std::cin, line);\\n if (line == \\\".\\\") break;\\n Poly solution = parser.parse(line);\\n if (answer == solution) {\\n std::cout << \\\"yes\\\" << std::endl;\\n } else {\\n std::cout << \\\"no\\\" << std::endl;\\n }\\n }\\n\\n std::cout << \\\".\\\" << std::endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3480,\n \"memory_kb\": 9316,\n \"score_of_the_acc\": -1.744,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1233_6058521\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nstruct monomial{\\n vector<pair<char, int>> deg;\\n monomial(){\\n }\\n monomial(char c, int x){\\n deg.push_back(make_pair(c, x));\\n }\\n};\\nbool operator ==(monomial A, monomial B){\\n return A.deg == B.deg;\\n}\\nbool operator < (monomial A, monomial B){\\n return A.deg < B.deg;\\n}\\nmonomial operator *(monomial A, monomial B){\\n int N = A.deg.size();\\n int M = B.deg.size();\\n for (int i = 0; i < M; i++){\\n bool ok = false;\\n for (int j = 0; j < N; j++){\\n if (A.deg[j].first == B.deg[i].first){\\n A.deg[j].second += B.deg[i].second;\\n ok = true;\\n }\\n }\\n if (!ok){\\n A.deg.push_back(B.deg[i]);\\n }\\n }\\n sort(A.deg.begin(), A.deg.end());\\n return A;\\n}\\nostream& operator <<(ostream& os, monomial A){\\n int N = A.deg.size();\\n for (int i = 0; i < N; i++){\\n cout << A.deg[i].first;\\n if (A.deg[i].second >= 2){\\n cout << \\\"^\\\" << A.deg[i].second;\\n }\\n }\\n return os;\\n}\\nstruct polynomial{\\n vector<pair<monomial, int>> term;\\n polynomial(){\\n }\\n polynomial(int x){\\n if (x != 0){\\n term.push_back(make_pair(monomial(), x));\\n }\\n }\\n polynomial(char c, int x){\\n term.push_back(make_pair(monomial(c, x), 1));\\n }\\n};\\nbool operator ==(polynomial A, polynomial B){\\n return A.term == B.term;\\n}\\npolynomial operator -(polynomial A){\\n int N = A.term.size();\\n for (int i = 0; i < N; i++){\\n A.term[i].second *= -1;\\n }\\n return A;\\n}\\npolynomial operator +(polynomial A, polynomial B){\\n int N = A.term.size();\\n int M = B.term.size();\\n for (int i = 0; i < M; i++){\\n bool ok = false;\\n for (int j = 0; j < N; j++){\\n if (A.term[j].first == B.term[i].first){\\n A.term[j].second += B.term[i].second;\\n ok = true;\\n }\\n }\\n if (!ok){\\n A.term.push_back(B.term[i]);\\n }\\n }\\n sort(A.term.begin(), A.term.end());\\n int K = A.term.size();\\n polynomial ans;\\n for (int i = 0; i < K; i++){\\n if (A.term[i].second != 0){\\n ans.term.push_back(A.term[i]);\\n }\\n }\\n return ans;\\n}\\npolynomial operator -(polynomial A, polynomial B){\\n return A + (-B);\\n}\\npolynomial operator *(polynomial A, polynomial B){\\n int N = A.term.size();\\n int M = B.term.size();\\n map<monomial, int> mp;\\n for (int i = 0; i < N; i++){\\n for (int j = 0; j < M; j++){\\n monomial X = A.term[i].first * B.term[j].first;\\n int coef = A.term[i].second * B.term[j].second;\\n mp[X] += coef;\\n }\\n }\\n polynomial ans;\\n for (auto P : mp){\\n if (P.second != 0){\\n ans.term.push_back(P);\\n }\\n }\\n return ans;\\n}\\nostream& operator <<(ostream& os, polynomial A){\\n int N = A.term.size();\\n for (int i = 0; i < N; i++){\\n if (i > 0 && A.term[i].second > 0){\\n cout << '+';\\n }\\n if (A.term[i].second < 0){\\n cout << \\\"-\\\" ;\\n }\\n int x = abs(A.term[i].second);\\n if (x > 1){\\n cout << x;\\n }\\n cout << A.term[i].first;\\n }\\n return os;\\n}\\nint number(string &S, int &p){\\n int ans = 0;\\n while (isdigit(S[p]) != 0){\\n ans = ans * 10 + (S[p] - '0');\\n p++;\\n }\\n return ans;\\n}\\npolynomial expression(string &S, int &p);\\npolynomial factor(string &S, int &p){\\n if (S[p] == '('){\\n p++;\\n polynomial ans = expression(S, p);\\n p++;\\n return ans;\\n } else if (isdigit(S[p]) != 0){\\n int x = number(S, p);\\n return polynomial(x);\\n } else {\\n char c = S[p];\\n p++;\\n int x = 1;\\n if (S[p] == '^'){\\n p++;\\n x = number(S, p);\\n }\\n return polynomial(c, x);\\n }\\n}\\npolynomial term(string &S, int &p){\\n int p2 = p;\\n polynomial ans = factor(S, p);\\n while (true){\\n if (S[p] == '*'){\\n p++;\\n }\\n if (S[p] == '+' || S[p] == '-' || S[p] == ')' || S[p] == '='){\\n break;\\n }\\n polynomial A = factor(S, p);\\n ans = ans * A;\\n }\\n return ans;\\n}\\npolynomial expression(string &S, int &p){\\n polynomial ans = term(S, p);\\n while (true){\\n if (S[p] == '+'){\\n p++;\\n ans = ans + term(S, p);\\n } else if (S[p] == '-'){\\n p++;\\n ans = ans - term(S, p);\\n } else {\\n break;\\n }\\n }\\n return ans;\\n} \\nint main(){\\n while (true){\\n vector<string> S;\\n while (true){\\n string s;\\n getline(cin, s);\\n if (s == \\\".\\\"){\\n break;\\n }\\n int N = s.size();\\n string t;\\n t += s[0];\\n for (int i = 1; i < N; i++){\\n if (s[i] != ' '){\\n if (isdigit(s[i]) != 0 && isdigit(t.back()) != 0 && isdigit(s[i - 1]) == 0){\\n t += '*';\\n }\\n t += s[i];\\n }\\n }\\n S.push_back(t);\\n }\\n if (S.empty()){\\n break;\\n }\\n int N = S.size();\\n vector<polynomial> P(N);\\n for (int i = 0; i < N; i++){\\n S[i] += '=';\\n int p = 0;\\n P[i] = expression(S[i], p);\\n }\\n for (int i = 1; i < N; i++){\\n if (P[i] == P[0]){\\n cout << \\\"yes\\\" << endl;\\n } else {\\n cout << \\\"no\\\" << endl;\\n }\\n }\\n cout << \\\".\\\" << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 9444,\n \"score_of_the_acc\": -0.7842,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1233_4972347\",\n \"code_snippet\": \"#include \\\"iostream\\\"\\n#include \\\"climits\\\"\\n#include \\\"list\\\"\\n#include \\\"queue\\\"\\n#include \\\"stack\\\"\\n#include \\\"set\\\"\\n#include \\\"functional\\\"\\n#include \\\"algorithm\\\"\\n#include \\\"string\\\"\\n#include \\\"map\\\"\\n#include \\\"unordered_map\\\"\\n#include \\\"unordered_set\\\"\\n#include \\\"iomanip\\\"\\n#include \\\"cmath\\\"\\n#include \\\"random\\\"\\n#include \\\"bitset\\\"\\n#include \\\"cstdio\\\"\\n#include \\\"numeric\\\"\\n#include \\\"cassert\\\"\\n#include \\\"ctime\\\"\\n#include \\\"complex\\\"\\n\\nusing namespace std;\\n\\nconstexpr long long int MOD = 1000000007;\\n//constexpr int MOD = 1000000007;\\n//constexpr int MOD = 998244353;\\n//constexpr long long int MOD = 998244353;\\nconstexpr double EPS = 1e-12;\\n\\n//int N, M, K, T, H, W, L, R;\\nlong long int N, M, K, T, H, W, L, R;\\n\\nstruct Component {\\n\\tvector<long long int>dir;\\n\\tlong long int by;\\n\\tComponent() {\\n\\t\\tby = -1;\\n\\t\\tdir.resize(26);\\n\\t}\\n\\tComponent(vector<long long int>d, long long int b) :dir(d), by(b) {\\n\\n\\t}\\n\\tbool operator<(const Component&c)const {\\n\\t\\treturn make_pair(dir, by) < make_pair(c.dir, c.by);\\n\\t}\\n\\tbool operator!=(const Component&c)const {\\n\\t\\treturn make_pair(by, dir) != make_pair(c.by, c.dir);\\n\\t}\\n\\tComponent operator*(const Component&c)const {\\n\\t\\tComponent ret(dir, by);\\n\\t\\tfor (int i = 0; i < 26; i++) {\\n\\t\\t\\tret.dir[i] += c.dir[i];\\n\\t\\t}\\n\\t\\tret.by *= c.by;\\n\\t\\treturn ret;\\n\\t}\\n};\\n\\nstruct Expression {\\n\\tvector<Component>v;\\n\\tExpression() {\\n\\t}\\n\\tExpression(vector<Component>vv) :v(vv) {\\n\\n\\t}\\n\\tvoid ExpSort() {\\n\\t\\tsort(v.begin(), v.end());\\n\\t\\tvector<Component>w;\\n\\t\\tfor (auto i : v) {\\n\\t\\t\\tif (w.empty() || w.back().dir != i.dir) {\\n\\t\\t\\t\\tw.push_back(i);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tw.back().by += i.by;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tv.clear();\\n\\t\\tfor (auto i : w) {\\n\\t\\t\\tif (i.by)v.push_back(i);\\n\\t\\t}\\n\\t}\\n\\tbool operator==(const Expression&e)const {\\n\\t\\tif (v.size() != e.v.size())return false;\\n\\t\\tfor (int i = 0; i < v.size(); i++) {\\n\\t\\t\\tif (v[i] != e.v[i])return false;\\n\\t\\t}\\n\\t\\treturn true;\\n\\t}\\n\\tExpression operator+(const Expression&e)const {\\n\\t\\tauto ret = Expression(v);\\n\\t\\tfor (auto i : e.v)ret.v.push_back(i);\\n\\t\\treturn ret;\\n\\t}\\n\\tExpression operator-(const Expression&e)const {\\n\\t\\tauto ret = Expression(v);\\n\\t\\tfor (auto i : e.v) {\\n\\t\\t\\tret.v.push_back(i);\\n\\t\\t\\tret.v.back().by *= -1;\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t}\\n\\tExpression operator*(const Expression&e)const {\\n\\t\\tauto ret = Expression();\\n\\t\\tfor (auto i : v) {\\n\\t\\t\\tfor (auto j : e.v) {\\n\\t\\t\\t\\tret.v.push_back(i*j);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t}\\n\\tExpression operator^(const Expression&e)const {\\n\\t\\tauto ret = Expression(v);\\n\\t\\tfor (auto &i : ret.v) {\\n\\t\\t\\tfor (auto &j : i.dir) j *= e.v.front().by;\\n\\t\\t}\\n\\t\\tret.v.front().by = powl(ret.v.front().by, e.v.front().by);\\n\\t\\treturn ret;\\n\\t}\\n};\\n\\n\\nvoid DEBUG(Expression e) {\\n\\tcout << e.v.size() << endl;\\n\\tfor (auto i : e.v) {\\n\\t\\tcout << i.by;\\n\\t\\tfor (auto j : i.dir)cout << \\\" \\\" << j;\\n\\t\\tcout << endl;\\n\\t}\\n}\\n\\nExpression func(string s) {\\n//\\tcout << s << endl;\\n\\tint num = 0;\\n\\tfor (int i = s.size() - 1; i >= 0; i--) {\\n\\t\\tif (s[i] == ')') num++;\\n\\t\\tif (s[i] == '(') num--;\\n\\t\\tif (num == 0) {\\n\\t\\t\\tif (s[i] == '+') {\\n\\t\\t\\t\\tauto a = func(s.substr(0, i));\\n\\t\\t\\t\\tauto b = func(s.substr(i + 1, s.size() - i - 1));\\n\\t\\t\\t\\treturn a + b;\\n\\t\\t\\t}\\n\\t\\t\\tif (s[i] == '-') {\\n\\t\\t\\t\\tauto a = func(s.substr(0, i));\\n\\t\\t\\t\\tauto b = func(s.substr(i + 1, s.size() - i - 1));\\n\\t\\t\\t\\treturn a - b;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor (int i = s.size() - 1; i >= 0; i--) {\\n\\t\\tif (s[i] == ')') num++;\\n\\t\\tif (s[i] == '(') num--;\\n\\t\\tif (num == 0) {\\n\\t\\t\\tif (s[i] == '*') {\\n\\t\\t\\t\\tauto a = func(s.substr(0, i));\\n\\t\\t\\t\\tauto b = func(s.substr(i + 1, s.size() - i - 1));\\n\\t\\t\\t\\treturn a * b;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor (int i = s.size() - 1; i >= 0; i--) {\\n\\t\\tif (s[i] == ')') num++;\\n\\t\\tif (s[i] == '(') num--;\\n\\t\\tif (num == 0) {\\n\\t\\t\\tif (s[i] == '^') {\\n\\t\\t\\t\\tauto a = func(s.substr(0, i));\\n\\t\\t\\t\\tauto b = func(s.substr(i + 1, s.size() - i - 1));\\n\\t\\t\\t\\treturn a ^ b;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif (s.front() == '(') {\\n\\t\\treturn func(s.substr(1, s.size() - 2));\\n\\t}\\n\\tComponent ret;\\n\\tfor (auto i : s) {\\n\\t\\tif (i >= 'a'&&i <= 'z') {\\n\\t\\t\\tret.dir[i - 'a']++;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tif (ret.by == -1)ret.by = 0;\\n\\t\\t\\tret.by *= 10;\\n\\t\\t\\tret.by += i - '0';\\n\\t\\t}\\n\\t}\\n\\tif(ret.by==-1)ret.by *= -1;\\n\\tExpression re;\\n\\tre.v.push_back(ret);\\n\\treturn re;\\n}\\n\\nbool IsNum(char c) {\\n\\treturn (c >= '0'&&c <= '9') ;\\n}\\n\\nbool IsAlpha(char c) {\\n\\treturn (c >= 'a'&&c <= 'z');\\n}\\n\\nstring EraseSpace(string s) {\\n\\tstring ret;\\n\\tfor (auto i : s) {\\n\\t\\tif (i != ' ')ret.push_back(i);\\n\\t\\telse {\\n\\t\\t\\tif (!ret.empty() && ret.back() != ' ')ret.push_back(i);\\n\\t\\t}\\n\\t}\\n\\twhile (ret.back() == ' ')ret.pop_back();\\n\\ts = ret;\\n\\tfor (int i = 1; i + 1 < s.size(); i++) {\\n\\t\\tauto bf = s[i - 1];\\n\\t\\tauto nx = s[i + 1];\\n\\t\\tif (s[i] == ' ') {\\n\\t\\t\\tif (IsNum(bf) || IsAlpha(bf) || bf == ')') {\\n\\t\\t\\t\\tif (IsNum(nx) || IsAlpha(nx) || nx == '(') {\\n\\t\\t\\t\\t\\ts[i] = '*';\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tret.clear();\\n\\tfor (auto i : s) {\\n\\t\\tif (i == ' ')continue;\\n\\t\\tif (ret.empty()) {\\n\\t\\t\\tret.push_back(i);\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tif (ret.back() == ')'&&(i == '('||IsNum(i)||IsAlpha(i)))ret.push_back('*');\\n\\t\\telse if ((ret.back() == ')' || IsNum(ret.back()) || IsAlpha(ret.back())) && i == '(')ret.push_back('*');\\n\\t\\telse if (IsNum(ret.back()) && IsAlpha(i))ret.push_back('*');\\n\\t\\telse if (IsAlpha(ret.back()) && IsNum(i))ret.push_back('*');\\n\\t\\telse if (IsAlpha(ret.back()) && IsAlpha(i))ret.push_back('*');\\n\\t\\tret.push_back(i);\\n\\t}\\n\\treturn ret;\\n}\\n\\n\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\n\\tstring s;\\n\\twhile (getline(cin, s), s != \\\".\\\") {\\n\\t\\tauto ans = func(EraseSpace(s));\\n\\t\\tans.ExpSort();\\n\\t//\\tDEBUG(ans);\\n\\t\\twhile (getline(cin, s), s != \\\".\\\") {\\n\\t\\t\\tauto box = func(EraseSpace(s));\\n\\t\\t\\tbox.ExpSort();\\n\\t\\t//\\tDEBUG(box);\\n\\t\\t\\tif (ans == box)cout << \\\"yes\\\\n\\\";\\n\\t\\t\\telse cout << \\\"no\\\\n\\\";\\n\\t\\t}\\n\\t\\tcout << s << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3816,\n \"score_of_the_acc\": -0.1419,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1233_4962252\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<map>\\nusing namespace std;\\nstruct Str{\\n\\tstring s;\\n\\tStr():s(){}\\n\\tconst char operator[](int id)const{return s[id];}\\n\\tconst size_t size()const{return s.size();}\\n\\tStr&operator+=(const char c){\\n\\t\\ts+=c;\\n\\t\\treturn*this;\\n\\t}\\n\\tStr operator*(const Str&a){\\n\\t\\tStr ret;\\n\\t\\tint i=0,j=0;\\n\\t\\twhile(i<s.size()||j<a.size())\\n\\t\\t{\\n\\t\\t\\tif(i<s.size()&&j<a.size())\\n\\t\\t\\t{\\n\\t\\t\\t\\tif(s[i]<a[j])ret+=s[i++];\\n\\t\\t\\t\\telse ret+=a[j++];\\n\\t\\t\\t}\\n\\t\\t\\telse if(i<s.size())ret+=s[i++];\\n\\t\\t\\telse ret+=a[j++];\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t}\\n\\tbool operator<(const Str&a)const{\\n\\t\\treturn s<a.s;\\n\\t}\\n\\tbool operator==(const Str&a)const{return s==a.s;}\\n};\\nstruct exp{\\n\\tmap<Str,int>mp;\\n\\texp():mp(){}\\n\\tint&operator[](const Str&a){return mp[a];}\\n\\texp norm(){\\n\\t\\texp ret;\\n\\t\\tfor(pair<Str,int>p:mp)if(p.second!=0)ret[p.first]=p.second;\\n\\t\\treturn ret;\\n\\t}\\n\\texp operator+(const exp&a){\\n\\t\\texp ret=*this;\\n\\t\\tfor(pair<Str,int>p:a.mp)ret[p.first]+=p.second;\\n\\t\\treturn ret.norm();\\n\\t}\\n\\texp operator-(const exp&a){\\n\\t\\texp ret=*this;\\n\\t\\tfor(pair<Str,int>p:a.mp)ret[p.first]-=p.second;\\n\\t\\treturn ret.norm();\\n\\t}\\n\\texp operator*(const exp&a){\\n\\t\\texp ret;\\n\\t\\tfor(pair<Str,int>p:mp)for(pair<Str,int>q:a.mp)\\n\\t\\t{\\n\\t\\t\\tret[p.first*q.first]+=p.second*q.second;\\n\\t\\t}\\n\\t\\treturn ret.norm();\\n\\t}\\n\\tbool operator==(const exp&a)const{return mp==a.mp;}\\n\\tvoid dump()const{\\n\\t\\tbool fst=true;\\n\\t\\tfor(pair<Str,int>p:mp)\\n\\t\\t{\\n\\t\\t\\tif(!fst)cout<<\\\"+\\\";\\n\\t\\t\\telse fst=false;\\n\\t\\t\\tcout<<p.second<<\\\"*\\\"<<p.first.s;\\n\\t\\t}\\n\\t\\tcout<<endl;\\n\\t}\\n};\\nvector<string>now;\\nvoid parse(string s)\\n{\\n\\tnow.clear();\\n\\tfor(int i=0;i<s.size();i++)\\n\\t{\\n\\t\\tif(s[i]==' ')continue;\\n\\t\\telse if(isdigit(s[i]))\\n\\t\\t{\\n\\t\\t\\tint j=i;\\n\\t\\t\\twhile(isdigit(s[j]))j++;\\n\\t\\t\\tnow.push_back(s.substr(i,j-i));\\n\\t\\t\\ti=j-1;\\n\\t\\t}\\n\\t\\telse now.push_back(string(1,s[i]));\\n\\t}\\n}\\nexp f(int&);\\nexp g(int&);\\nexp term(int&);\\nexp f(int&id)\\n{\\n\\texp ret=g(id);\\n\\twhile(id<now.size()&&(now[id]==\\\"+\\\"||now[id]==\\\"-\\\"))\\n\\t{\\n\\t\\tstring op=now[id++];\\n\\t\\texp nxt=g(id);\\n\\t\\tif(op==\\\"+\\\")ret=ret+nxt;\\n\\t\\telse ret=ret-nxt;\\n\\t}\\n\\treturn ret;\\n}\\nexp g(int&id)\\n{\\n\\texp ret=term(id);\\n\\twhile(id<now.size()&&now[id]!=\\\"+\\\"&&now[id]!=\\\"-\\\"&&now[id]!=\\\")\\\")\\n\\t{\\n\\t\\tret=ret*term(id);\\n\\t}\\n\\treturn ret;\\n}\\nint to_i(string s)\\n{\\n\\tint ret=0;\\n\\tfor(char c:s)ret=ret*10+c-'0';\\n\\treturn ret;\\n}\\nexp term(int&id)\\n{\\n\\texp ret;\\n\\tif(now[id]==\\\"(\\\")\\n\\t{\\n\\t\\tid++;\\n\\t\\tret=f(id);\\n\\t\\tid++;\\n\\t}\\n\\telse if(isdigit(now[id][0]))\\n\\t{\\n\\t\\tret[Str()]=to_i(now[id++]);\\n\\t}\\n\\telse\\n\\t{\\n\\t\\tStr tmp;\\n\\t\\ttmp.s=now[id++];\\n\\t\\tret[tmp]=1;\\n\\t}\\n\\tif(id<now.size()&&now[id]==\\\"^\\\")\\n\\t{\\n\\t\\tid++;\\n\\t\\tint n=to_i(now[id++]);\\n\\t\\texp ans=ret;\\n\\t\\tfor(int i=1;i<n;i++)ans=ans*ret;\\n\\t\\tret=ans;\\n\\t}\\n\\treturn ret;\\n}\\nmain()\\n{\\n\\twhile(true)\\n\\t{\\n\\t\\tstring s;\\n\\t\\tgetline(cin,s);\\n\\t\\tif(s==\\\".\\\")break;\\n\\t\\tparse(s);\\n\\t\\tint id=0;\\n\\t\\texp ans=f(id).norm();\\n\\t\\twhile(true)\\n\\t\\t{\\n\\t\\t\\tgetline(cin,s);\\n\\t\\t\\tif(s==\\\".\\\")break;\\n\\t\\t\\tparse(s);\\n\\t\\t\\tid=0;\\n\\t\\t\\texp ret=f(id).norm();\\n\\t\\t\\tcout<<(ans==ret?\\\"yes\\\":\\\"no\\\")<<endl;\\n\\t\\t}\\n\\t\\tcout<<\\\".\\\"<<endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 3328,\n \"score_of_the_acc\": -0.1198,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1233_4931020\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }\\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }\\n#define all(x) (x).begin(),(x).end()\\n#define fi first\\n#define se second\\n#define mp make_pair\\n#define si(x) int(x.size())\\nconst int mod=1000000007,MAX=1005;\\nconst int INF=1e6;\\n//const ll INF=1LL<<60;\\nstring S;\\n\\nvector<vector<ll>> dai(100,vector<ll>(26));\\nvector<ll> ans(100),comp(100);\\nint t;\\n\\nll expr(int &i);\\nll term(int &i);\\nll rui(int &i);\\nll factor(int &i);\\nll number(int &i);\\n\\nll expr(int &i){\\n ll res=term(i);\\n while(i<si(S)){\\n if(S[i]==' ') i++;\\n else if(S[i]=='+'){\\n i++;\\n ll x=term(i);\\n res+=x;\\n }else if(S[i]=='-'){\\n i++;\\n ll x=term(i);\\n res-=x;\\n }else{\\n break;\\n }\\n }\\n return res;\\n}\\n\\nll term(int &i){\\n ll res=rui(i);\\n \\n while(i<si(S)){\\n if(S[i]==' ') i++;\\n else if(S[i]=='+'||S[i]=='-'||S[i]==')') break;\\n else{\\n ll x=rui(i);\\n res*=x;\\n }\\n }\\n \\n return res;\\n}\\n\\nll rui(int &i){\\n ll res=factor(i);\\n \\n while(i<si(S)){\\n if(S[i]==' ') i++;\\n else if(S[i]=='^'){\\n i++;\\n ll x=factor(i);\\n ll k=res;\\n res=1;\\n for(int j=0;j<x;j++) res*=k;\\n }else break;\\n }\\n \\n return res;\\n}\\n\\nll factor(int &i){\\n while(S[i]==' ') i++;\\n \\n if(i<si(S)&&S[i]=='('){\\n i++;\\n ll x=expr(i);\\n while(S[i]==' ') i++;\\n assert(S[i]=')');\\n i++;\\n \\n return x;\\n }else{\\n return number(i);\\n }\\n}\\n\\nll number(int &i){\\n while(S[i]==' ') i++;\\n if(isdigit(S[i])){\\n ll res=0;\\n while(i<si(S)&&isdigit(S[i])){\\n res*=10;\\n res+=ll(S[i]-'0');\\n i++;\\n }\\n return res;\\n }else{\\n ll x=dai[t][S[i]-'a'];\\n i++;\\n return x;\\n }\\n}\\n\\nint main(){\\n \\n std::ifstream in(\\\"text.txt\\\");\\n std::cin.rdbuf(in.rdbuf());\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n \\n mt19937_64 rng(58);\\n \\n for(int i=0;i<100;i++){\\n for(int j=0;j<26;j++){\\n dai[i][j]=rng()%9+1;\\n }\\n }\\n \\n while(1){\\n getline(cin,S);\\n if(S==\\\".\\\") break;\\n \\n t=0;\\n while(t<100){\\n int i=0;\\n comp[t]=expr(i);\\n t++;\\n }\\n ans=comp;\\n \\n while(1){\\n getline(cin,S);\\n if(S==\\\".\\\"){\\n cout<<\\\".\\\\n\\\";\\n break;\\n }\\n \\n t=0;\\n \\n while(t<100){\\n int i=0;\\n comp[t]=expr(i);\\n t++;\\n }\\n \\n if(ans==comp) cout<<\\\"yes\\\"<<endl;\\n else cout<<\\\"no\\\"<<endl;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3260,\n \"score_of_the_acc\": -0.0747,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1233_4535459\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <map>\\nusing namespace std;\\n\\nstruct Polynomial{\\n map<string, int> terms;\\n Polynomial(int a){\\n terms[\\\"\\\"] = a;\\n }\\n Polynomial(string s){\\n terms[s] = 1;\\n }\\n Polynomial(){}\\n static void erase_zero(Polynomial &a){\\n for(auto it=a.terms.begin(); it!=a.terms.end();){\\n if(it->second == 0){\\n it = a.terms.erase(it);\\n }else{\\n it++;\\n }\\n }\\n }\\n Polynomial operator +(const Polynomial &a) const{\\n Polynomial res = *this;\\n for(const auto &p: a.terms){\\n res.terms[p.first] += p.second;\\n }\\n erase_zero(res);\\n return res;\\n }\\n Polynomial operator -(const Polynomial &a) const{\\n Polynomial res = *this;\\n for(const auto &p: a.terms){\\n res.terms[p.first] -= p.second;\\n }\\n erase_zero(res);\\n return res;\\n }\\n Polynomial operator *(const Polynomial &a) const{\\n Polynomial res;\\n for(const auto &p: terms){\\n for(const auto &q: a.terms){\\n string key = p.first + q.first;\\n sort(key.begin(), key.end());\\n res.terms[key] += p.second * q.second;\\n }\\n }\\n erase_zero(res);\\n return res;\\n }\\n bool operator ==(const Polynomial &a) const{\\n return terms == a.terms;\\n }\\n};\\n\\nint getnum(int &p, const string &s){\\n int num = 0;\\n while(p<(int)s.length() and '0'<=s[p] and s[p]<='9'){\\n num *= 10;\\n num += s[p]-'0';\\n p++;\\n }\\n return num;\\n}\\nPolynomial parse(int &p, const string &s){\\n Polynomial res;\\n Polynomial term(1);\\n int sign = 1;\\n while(1){\\n if(p<(int)s.length() and s[p] == ' '){\\n p++;\\n continue;\\n }\\n if(p>=(int)s.length() or s[p]=='+' or s[p]=='-' or s[p]==')'){\\n if(sign == 1) res = res + term;\\n else res = res - term;\\n term = Polynomial(1);\\n if(p>=(int)s.length() or s[p]==')'){\\n p++;\\n return res;\\n }\\n if(s[p] == '+') sign = 1;\\n else sign = -1;\\n p++;\\n continue;\\n }\\n if('0'<=s[p] and s[p]<='9'){\\n term = term * Polynomial(getnum(p, s));\\n continue;\\n }\\n if('a'<=s[p] and s[p]<='z'){\\n char var = s[p];\\n p++;\\n int num = 1;\\n while(p<(int)s.length() and s[p]==' '){\\n p++;\\n }\\n if(p<(int)s.length() and s[p]=='^'){\\n p++;\\n while(s[p] == ' ') p++;\\n num = getnum(p, s);\\n }\\n term = term * Polynomial(string(num, var));\\n continue;\\n }\\n if(s[p] == '('){\\n p++;\\n term = term * parse(p, s);\\n continue;\\n }\\n }\\n}\\n\\nint main(){\\n while(1){\\n vector<string> s;\\n string t;\\n while(getline(cin, t), t!=\\\".\\\"){\\n s.push_back(t);\\n }\\n if(s.empty()) break;\\n\\n vector<Polynomial> p;\\n for(auto ss: s){\\n int i=0;\\n p.push_back(parse(i, ss));\\n }\\n for(int i=1; i<(int)p.size(); i++){\\n if(p[i] == p[0]){\\n cout << \\\"yes\\\" << endl;\\n }else{\\n cout << \\\"no\\\" << endl;\\n }\\n }\\n cout << \\\".\\\" << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 11632,\n \"score_of_the_acc\": -1.0173,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1233_3723771\",\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<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<utility>\\n#include<cassert>\\nusing namespace std;\\n\\ntypedef long long ll;\\n\\ntypedef unsigned long long ul;\\ntypedef unsigned int ui;\\nconst ll mod = 998244353;\\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 pair<ll, ll> LP;\\ntypedef vector<int> vec;\\ntypedef vector<string> svec;\\ntypedef long double ld;\\ntypedef pair<ld, ld> LDP;\\nconst ld eps = 1e-8;\\n\\nll expr(string& s, int& i);\\nll term1(string& s, int& i);\\nll term(string& s, int& i);\\nll factor(string& s, int& i);\\nll number(string& s, int& i);\\n\\nbool isdigit(char t) {\\n\\treturn '0' <= t && t <= '9';\\n}\\nbool isalf(char t) {\\n\\treturn 'a' <= t && t <= 'z';\\n}\\n\\nll mod_pow(ll x, int n) {\\n\\tll ret = 1;\\n\\twhile (n > 0) {\\n\\t\\tif (n % 2)ret = ret * x%mod;\\n\\t\\tx = x * x%mod; n >>= 1;\\n\\t}\\n\\treturn ret;\\n}\\n\\nll expr(string& s, int& i) {\\n\\tll val = term1(s, i);\\n\\twhile (i < s.length()) {\\n\\t\\tif (s[i] == ' ') {\\n\\t\\t\\ti++; continue;\\n\\t\\t}\\n\\t\\tif (s[i] == '+' || s[i] == '-') {\\n\\t\\t\\tchar op = s[i];\\n\\t\\t\\ti++;\\n\\t\\t\\tll val2 = term1(s, i);\\n\\t\\t\\tif (op == '+') {\\n\\t\\t\\t\\tval += val2; if (val >= mod)val -= mod;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tval += mod - val2; while (val >= mod)val -= mod;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse break;\\n\\t}\\n\\t//cout << i << \\\" expr \\\" << val << endl;\\n\\treturn val;\\n}\\nll term1(string& s, int& i) {\\n\\tll val = term(s, i);\\n\\twhile (i < s.length() && s[i] == ' ')i++;\\n\\tif (i >= s.length() || s[i] == '+' || s[i] == '-'||s[i]==')') {\\n\\t\\treturn val;\\n\\t}\\n\\telse {\\n\\t\\tll val2 = term1(s, i);\\n\\t\\tval = val * val2%mod;\\n\\t}\\n\\t//cout << i << \\\" term1 \\\" << val << endl;\\n\\treturn val;\\n}\\nll term(string& s, int& i) {\\n\\tll val = factor(s, i);\\n\\twhile (i < s.length() && s[i] == ' ')i++;\\n\\tif (i<s.length() && s[i] == '^') {\\n\\t\\ti++;\\n\\t\\tll val2 = number(s, i);\\n\\t\\tval = mod_pow(val, val2);\\n\\t}\\n\\t//cout << i << \\\" term \\\" << val << endl;\\n\\treturn val;\\n}\\nll factor(string& s, int& i) {\\n\\twhile (i < s.length() && s[i] == ' ')i++;\\n\\tif (i<s.length() && isdigit(s[i]))return number(s, i);\\n\\ti++;\\n\\twhile (i < s.length() && s[i] == ' ')i++;\\n\\tll ret = expr(s, i);\\n\\ti++;\\n\\twhile (i < s.length() && s[i] == ' ')i++;\\n\\t//cout << i << \\\" fact \\\" << ret << endl;\\n\\treturn ret;\\n}\\nll number(string& s, int& i) {\\n\\twhile (s[i] == ' ')i++;\\n\\tll ret = s[i++] - '0';\\n\\twhile (i < s.length() && isdigit(s[i])) {\\n\\t\\tret = ret * 10 + s[i++] - '0';\\n\\t\\tret %= mod;\\n\\t}\\n\\t//cout << i << \\\" numb \\\" << ret << endl;\\n\\treturn ret;\\n}\\n\\nvector<vector<ll>> gene(int len) {\\n\\trandom_device rnd;\\n\\tmt19937 mt(rnd());\\n\\tuniform_int_distribution<> u(0, 2147483647);\\n\\tvector<vector<ll>> ret(len);\\n\\trep(i, len) {\\n\\t\\tret[i].resize(26);\\n\\t\\trep(j, 26) {\\n\\t\\t\\tret[i][j] = u(mt);\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\n\\nll calc(string s, vector<ll> t) {\\n\\tstring upd;\\n\\trep(i, s.length()) {\\n\\t\\tif (isalf(s[i])) {\\n\\t\\t\\tstring u = to_string(t[s[i] - 'a']);\\n\\t\\t\\tupd.push_back(' ');\\n\\t\\t\\tupd = upd + u;\\n\\t\\t}\\n\\t\\telse if (isdigit(s[i])) {\\n\\t\\t\\tint le = i;\\n\\t\\t\\twhile (i + 1 < s.length() && isdigit(s[i + 1]))i++;\\n\\t\\t\\tupd.push_back(' ');\\n\\t\\t\\tRep1(j, le, i)upd.push_back(s[j]);\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tupd.push_back(s[i]);\\n\\t\\t}\\n\\t}\\n\\tint i = 0;\\n\\t//cout << s << endl;\\n\\t//cout << upd << endl;\\n\\t//cout << upd << endl;\\n\\treturn expr(upd, i);\\n}\\n\\nconst int sz = 100;\\nbool solve() {\\n\\tstring s;\\n\\tvector<string> v;\\n\\twhile (getline(cin, s)) {\\n\\t\\tif (s[0] == '.') {\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tv.push_back(s);\\n\\t}\\n\\tif (v.size() == 0)return false;\\n\\tvector<vector<ll>> test = gene(sz);\\n\\tvector<vector<ll>> ans(v.size());\\n\\trep(i, v.size()) {\\n\\t\\tans[i].resize(sz);\\n\\t\\trep(j, sz) {\\n\\t\\t\\tans[i][j] = calc(v[i], test[j]);\\n\\t\\t\\t//cout << i << \\\" \\\" << ans[i][j] << endl;\\n\\t\\t}\\n\\t}\\n\\tfor (int i = 1; i < v.size(); i++) {\\n\\t\\tbool f = (ans[i] == ans[0]);\\n\\t\\tif (f) {\\n\\t\\t\\tcout << \\\"yes\\\" << endl;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tcout << \\\"no\\\" << endl;\\n\\t\\t}\\n\\t}\\n\\tcout << \\\".\\\" << endl;\\n\\treturn true;\\n}\\n\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\n\\t/*string s = \\\"a+b+c\\\";\\n\\tstring ss = \\\"(a+b)+c\\\";\\n\\tvector<ll> c(26, 0); c[0] = 1, c[1] = 2; c[2] = 3;\\n\\tcout << calc(s, c) << endl;\\n\\tcout << calc(ss, c) << endl;*/\\n\\n\\t//cout << fixed << setprecision(10);\\n\\t//init();\\n\\twhile (true) {\\n\\t\\tif (!solve())break;\\n\\t}\\n\\t//stop\\n\\t\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 360,\n \"memory_kb\": 4080,\n \"score_of_the_acc\": -0.2636,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1233_3312395\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\\n\\n//INSERT ABOVE HERE\\n\\nstruct T{\\n map<string, Int> ms;\\n T(){}\\n T(string s, Int c){\\n sort(s.begin(),s.end());\\n ms[s]+=c;\\n }\\n\\n T operator+=(const T &a){\\n for(auto p:a.ms)\\n ms[p.first]+=p.second;\\n return *this;\\n }\\n \\n T operator-=(const T &a){\\n for(auto p:a.ms)\\n ms[p.first]-=p.second;\\n return *this;\\n }\\n \\n T operator+(const T &a) const{\\n T res(*this);\\n return res+=a;\\n }\\n \\n T operator-(const T &a) const{\\n T res(*this);\\n return res-=a;\\n }\\n \\n T operator*(const T &a) const{\\n T res;\\n for(auto p:ms)\\n for(auto q:a.ms)\\n res+=T(p.first+q.first,p.second*q.second);\\n return res;\\n }\\n\\n T pow(Int k) const{\\n assert(k>=1);\\n T res(*this);\\n for(Int i=1;i<k;i++) res=res*(*this);\\n return res;\\n }\\n\\n map<string, Int> norm(){\\n map<string, Int> res;\\n for(auto p:ms)\\n if(p.second) res[p.first]=p.second;\\n return res;\\n }\\n};\\n\\nusing V = vector<string>; \\nT expr (const V &vs,Int &p);\\nT term (const V &vs,Int &p);\\nT factor(const V &vs,Int &p);\\nT power (const V &vs,Int &p);\\nInt number(const V &vs,Int &p);\\n\\nT expr (const V &vs,Int &p){\\n T res=term(vs,p);\\n while(p<(Int)vs.size()){\\n if(vs[p]==\\\"+\\\"s){\\n p++;\\n res=res+term(vs,p);\\n continue;\\n }\\n if(vs[p]==\\\"-\\\"s){\\n p++;\\n res=res-term(vs,p);\\n continue;\\n }\\n break;\\n }\\n return res;\\n}\\n\\nT term (const V &vs,Int &p){ \\n T res=factor(vs,p);\\n while(p<(Int)vs.size()){\\n if(vs[p]==\\\"+\\\"s) break;\\n if(vs[p]==\\\"-\\\"s) break;\\n if(vs[p]==\\\"^\\\"s) break;\\n if(vs[p]==\\\")\\\"s) break;\\n res=res*factor(vs,p);\\n }\\n return res;\\n}\\n\\nT factor(const V &vs,Int &p){ \\n T res=power(vs,p);\\n if(p<(Int)vs.size()&&vs[p]==\\\"^\\\"s){\\n p++;\\n Int k=number(vs,p);\\n return res.pow(k);\\n } \\n return res;\\n}\\n\\nT power (const V &vs,Int &p){\\n if(vs[p]==\\\"(\\\"s){\\n p++;\\n T res=expr(vs,p);\\n assert(vs[p]==\\\")\\\"s);\\n p++;\\n return res;\\n }\\n if(isalpha(vs[p][0])) return T(vs[p++],1);\\n return T(\\\"\\\"s, number(vs,p));\\n}\\n\\nInt number(const V &vs,Int &p){\\n return stoll(vs[p++]);\\n}\\n\\nT tran(string s){\\n Int n=s.size();\\n string t;\\n for(Int i=0;i<n;i++){\\n if(!isdigit(s[i])) t+=' ';\\n t+=s[i];\\n if(!isdigit(s[i])) t+=' ';\\n } \\n V vs;\\n stringstream ss(t);\\n while(ss>>t) vs.emplace_back(t);\\n Int p=0;\\n return expr(vs,p);\\n}\\n\\nsigned main(){\\n string s;\\n while(getline(cin,s)){\\n if(s==\\\".\\\"s) break;\\n auto vs=tran(s);\\n while(1){\\n string t;\\n getline(cin,t); \\n if(t==\\\".\\\"s) break;\\n auto vt=tran(t);\\n cout<<(vs.norm()==vt.norm()?\\\"yes\\\":\\\"no\\\")<<endl;\\n } \\n cout<<\\\".\\\"<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 370,\n \"memory_kb\": 3476,\n \"score_of_the_acc\": -0.1997,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1233_2984295\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\\n#define all(x) (x).begin(),(x).end()\\n#define pb push_back\\n#define fi first\\n#define se second\\n#define dbg(x) cout<<#x\\\" = \\\"<<((x))<<endl\\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\\\"(\\\"<<p.fi<<\\\",\\\"<<p.se<<\\\")\\\";return o;}\\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\\\"[\\\";for(T t:v){o<<t<<\\\",\\\";}o<<\\\"]\\\";return o;}\\n\\nusing f = map<string,ll>;\\n\\nvoid PRINT(f a){\\n for(const auto &p:a){\\n cout << p.se << p.fi << \\\" + \\\";\\n }\\n cout << endl;\\n}\\n\\nf norm(f a){\\n f ret;\\n for(const auto &p:a){\\n string v = p.fi;\\n sort(all(v));\\n if(p.se != 0) ret[v] = p.se;\\n }\\n return ret;\\n}\\n\\nf sub(f a){\\n a = norm(a);\\n\\n f ret;\\n for(const auto &p:a){\\n string v = p.fi;\\n if(p.se != 0) ret[v] = -p.se;\\n }\\n return ret;\\n}\\n\\nf add(f a, f b){\\n a = norm(a);\\n b = norm(b);\\n\\n for(const auto &p:b) a[p.fi] += p.se;\\n\\n return norm(a);\\n}\\n\\nf mul(f a, f b){\\n a = norm(a);\\n b = norm(b);\\n\\n f ret;\\n for(const auto &p:a)for(const auto &q:b){\\n string var = p.fi+q.fi;\\n sort(all(var));\\n\\n ret[var] += p.se*q.se;\\n }\\n return norm(ret);\\n}\\n\\nf E(string s);\\n\\nf T(string s){\\n int n = s.size();\\n f ret;\\n ret[\\\"\\\"]=1;\\n\\n int idx = 0;\\n while(idx<n){\\n f m;\\n if(s[idx]==' '){\\n ++idx;\\n continue;\\n }\\n else if(s[idx]=='('){\\n int ep = idx;\\n int p = 0;\\n while(ep<n){\\n if(s[ep]=='(') ++p;\\n if(s[ep]==')'){\\n --p;\\n if(p==0) break;\\n }\\n ++ep;\\n }\\n assert(ep<n);\\n assert(s[ep]==')');\\n\\n string t = s.substr(idx+1,ep-idx-1);\\n m = E(t);\\n idx = ep+1;\\n }\\n else if(isdigit(s[idx])){\\n ll val = 0;\\n while(idx<n && isdigit(s[idx])){\\n val = val*10 + (s[idx]-'0');\\n ++idx;\\n }\\n\\n int pw = 1;\\n int nx = idx;\\n while(nx<n && s[nx]==' ') ++nx;\\n if(nx<n && s[nx]=='^'){\\n ++nx;\\n while(nx<n && s[nx]==' ') ++nx;\\n\\n assert(nx<n);\\n assert(isdigit(s[nx]));\\n\\n pw = 0;\\n while(nx<n && isdigit(s[nx])){\\n pw = 10*pw + (s[nx]-'0');\\n ++nx;\\n }\\n }\\n\\n ll vv = 1;\\n rep(_,pw) vv *= val;\\n\\n m[\\\"\\\"] = vv;\\n idx = nx;\\n }\\n else if(islower(s[idx])){\\n char c = s[idx];\\n ++idx;\\n\\n int pw = 1;\\n int nx = idx;\\n while(nx<n && s[nx]==' ') ++nx;\\n if(nx<n && s[nx]=='^'){\\n ++nx;\\n while(nx<n && s[nx]==' ') ++nx;\\n\\n assert(nx<n);\\n assert(isdigit(s[nx]));\\n\\n pw = 0;\\n while(nx<n && isdigit(s[nx])){\\n pw = 10*pw + (s[nx]-'0');\\n ++nx;\\n }\\n }\\n\\n string t = \\\"\\\";\\n rep(_,pw) t += c;\\n\\n m[t] = 1;\\n idx = nx;\\n }\\n else assert(false);\\n\\n ret = mul(ret, m);\\n }\\n\\n return norm(ret);\\n}\\n\\nf E(string s){\\n int n = s.size();\\n f ret;\\n\\n int p = 0;\\n int start = 0;\\n bool plus = true;\\n\\n rep(i,n){\\n if(s[i]=='(') ++p;\\n if(s[i]==')') --p;\\n\\n if(s[i]=='+' || s[i]=='-'){\\n if(p==0){\\n string term = s.substr(start,i-start);\\n f t = norm(T(term));\\n if(!plus) t = sub(t);\\n plus = (s[i]=='+');\\n\\n ret = add(ret, t);\\n\\n start = i+1;\\n }\\n }\\n }\\n\\n string term = s.substr(start,n-start);\\n f t = norm(T(term));\\n if(!plus) t = sub(t);\\n\\n ret = add(ret, t);\\n\\n return norm(ret);\\n}\\n\\nint main(){\\n string s;\\n while(getline(cin, s),(s!=\\\".\\\")){\\n f S = E(s);\\n // PRINT(S);\\n\\n string t;\\n while(getline(cin, t),(t!=\\\".\\\")){\\n f T = E(t);\\n // PRINT(T);\\n cout << (S==T?\\\"yes\\\":\\\"no\\\") << endl;\\n }\\n cout << \\\".\\\" << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 350,\n \"memory_kb\": 3644,\n \"score_of_the_acc\": -0.2125,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1233_2880819\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstdint>\\n#include <cassert>\\n#include <string>\\n#include <vector>\\n#include <algorithm>\\n#include <random>\\n\\nintmax_t ppow(intmax_t base, intmax_t iexp) {\\n intmax_t res=1;\\n for (intmax_t dbl=base; iexp; iexp>>=1) {\\n if (iexp & 1)\\n res *= dbl;\\n\\n dbl *= dbl;\\n }\\n return res;\\n}\\n\\nintmax_t apply(intmax_t lhs, char op, intmax_t rhs) {\\n switch (op) {\\n case '+': return lhs + rhs;\\n case '-': return lhs - rhs;\\n case '*': return lhs * rhs;\\n case '^': return ppow(lhs, rhs);\\n default: assert(false);\\n }\\n}\\n\\nintmax_t fourt(\\n const std::string &s, size_t &i, const std::vector<intmax_t> &vars,\\n const std::vector<std::string> &ops={\\\"+-\\\", \\\"*\\\", \\\"^\\\", \\\"\\\"},\\n size_t prec=0) {\\n\\n /* tsurai parser */\\n if (ops[prec].empty()) {\\n if (s[i] == '(') {\\n intmax_t tmp=fourt(s, ++i, vars, ops, 0);\\n assert(s[i] == ')');\\n ++i;\\n return tmp;\\n }\\n if (isalpha(s[i])) {\\n // we assume only one-character variables\\n return vars[s[i++]-'a'];\\n }\\n intmax_t res=0;\\n while (s[i] >= '0' && s[i] <= '9')\\n res = res*10 + s[i++]-'0';\\n return res;\\n }\\n\\n intmax_t res=fourt(s, i, vars, ops, prec+1);\\n while (i < s.length()) {\\n char op=s[i];\\n if (!std::count(ops[prec].begin(), ops[prec].end(), op))\\n break;\\n intmax_t tmp=fourt(s, ++i, vars, ops, prec+1);\\n res = apply(res, op, tmp);\\n }\\n return res;\\n}\\n\\nintmax_t parse(const std::string &s, const std::vector<intmax_t> &vars) {\\n size_t i=0;\\n return fourt(s, i, vars);\\n}\\n\\nstd::string normalize(const std::string &s) {\\n // explicit `*' signs and no spaces\\n std::string res;\\n enum {\\n NONE, PAREN, FACTOR, OPERATOR\\n } last=NONE;\\n for (size_t i=0; i<s.length(); ++i) {\\n if (s[i] == '(') {\\n if (last == FACTOR) {\\n res += '*';\\n }\\n res += '(';\\n last = PAREN;\\n } else if (s[i] == ')') {\\n res += ')';\\n last = FACTOR;\\n } else if (isalnum(s[i])) {\\n if (last == FACTOR) {\\n res += '*';\\n }\\n res += s[i];\\n if (isdigit(s[i])) {\\n while (i+1 < s.length() && isdigit(s[i+1]))\\n res += s[++i];\\n }\\n last = FACTOR;\\n } else if (!isspace(s[i])) {\\n res += s[i];\\n last = OPERATOR;\\n }\\n }\\n // fprintf(stderr, \\\"#< %s\\\\n\\\", res.c_str());\\n return res;\\n}\\n\\nstd::mt19937 rsk(0315);\\nint testcase_ends() {\\n char buf[96];\\n fgets(buf, sizeof buf, stdin);\\n std::string s=buf;\\n if (s == \\\".\\\\n\\\")\\n return 1;\\n\\n s = normalize(s);\\n while (true) {\\n fgets(buf, sizeof buf, stdin);\\n std::string t=buf;\\n if (t == \\\".\\\\n\\\") {\\n printf(\\\".\\\\n\\\");\\n return 0;\\n }\\n\\n t = normalize(t);\\n bool yes=true;\\n for (int i=0; i<810; ++i) {\\n std::vector<intmax_t> vars(26);\\n for (int j=0; j<26; ++j)\\n vars[j] = rsk() % 100;\\n \\n if (parse(s, vars) != parse(t, vars))\\n yes = false;\\n }\\n\\n printf(\\\"%s\\\\n\\\", yes? \\\"yes\\\":\\\"no\\\");\\n }\\n}\\n\\nint main() {\\n while (!testcase_ends()) {}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 760,\n \"memory_kb\": 2584,\n \"score_of_the_acc\": -0.2139,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1233_2880805\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstdint>\\n#include <cassert>\\n#include <string>\\n#include <vector>\\n#include <algorithm>\\n#include <map>\\n\\n//#define fprintf(...) void(0)\\n\\nclass Poly {\\n std::map<std::string, int> coefs;\\n // e.g. coefs[\\\"aab\\\"] == 2 <=> the polynomial has the term 2 a^2 b\\n const std::string s;\\n\\n Poly &operator ^=(const Poly &oth) {\\n if (oth.coefs.size() == 1 && oth.coefs.find(\\\"\\\") != oth.coefs.end()) {\\n return (*this) ^= oth.coefs.find(\\\"\\\")->second;\\n } else if (oth.coefs.empty()) {\\n // means 0\\n coefs.clear();\\n coefs[\\\"\\\"] = 1; // means 1\\n return (*this);\\n }\\n\\n assert(false);\\n }\\n\\n Poly &op_eq(char op, const Poly &rhs) {\\n // (*this) @= rhs\\n switch (op) {\\n case '+': return (*this) += rhs;\\n case '-': return (*this) -= rhs;\\n case '*': return (*this) *= rhs;\\n case '^': return (*this) ^= rhs;\\n default: assert(false);\\n }\\n }\\n\\n Poly fourt(\\n size_t &i, \\n const std::vector<std::string> &ops={\\\"+-\\\", \\\"*\\\", \\\"^\\\", \\\"\\\"},\\n size_t prec=0) {\\n\\n /* based-on tsurai parser */\\n\\n if (ops[prec].empty()) {\\n if (s[i] == '(') {\\n Poly tmp=fourt(++i, ops, 0);\\n assert(s[i] == ')');\\n ++i;\\n return tmp;\\n }\\n if (isalpha(s[i])) {\\n // we assume only one-character variables\\n return Poly(s[i++]);\\n }\\n int coef=0;\\n while (s[i] >= '0' && s[i] <= '9')\\n coef = coef*10 + s[i++]-'0';\\n return Poly(coef);\\n }\\n\\n Poly res=fourt(i, ops, prec+1);\\n while (i < s.length()) {\\n char op=s[i];\\n if (!std::count(ops[prec].begin(), ops[prec].end(), op))\\n break;\\n Poly tmp=fourt(++i, ops, prec+1);\\n res.op_eq(op, tmp);\\n }\\n return res;\\n }\\n\\n Poly &normalized() {\\n for (auto it=coefs.begin(); it!=coefs.end(); ++it)\\n if (it->second == 0)\\n coefs.erase(it);\\n\\n return *this;\\n }\\n\\npublic:\\n Poly(const std::string &s): s(s) {\\n size_t i=0;\\n coefs = fourt(i).coefs; // ugh\\n }\\n\\n Poly(char ch): s(1, ch) {\\n assert(isalpha(ch));\\n coefs[s] = 1;\\n }\\n\\n Poly(int n): s(std::to_string(n)) {\\n if (n)\\n coefs[\\\"\\\"] = n;\\n }\\n\\n Poly &operator +=(const Poly &oth) {\\n for (const auto &p: oth.coefs) {\\n const std::string ¶m=p.first;\\n int coef=p.second;\\n coefs[param] += coef;\\n }\\n return normalized();\\n }\\n\\n Poly &operator -=(const Poly &oth) {\\n for (const auto &p: oth.coefs) {\\n const std::string ¶m=p.first;\\n int coef=p.second;\\n coefs[param] -= coef;\\n }\\n return normalized();\\n }\\n\\n Poly &operator *=(const Poly &oth) {\\n Poly tmp(*this);\\n coefs.clear();\\n for (const auto &pl: tmp.coefs) {\\n for (const auto &pr: oth.coefs) {\\n std::string param=pl.first+pr.first;\\n std::sort(param.begin(), param.end());\\n coefs[param] += pl.second*pr.second;\\n }\\n }\\n return normalized();\\n }\\n\\n Poly &operator ^=(int iexp) {\\n if (iexp == 0) {\\n // does not appear in #1233\\n coefs.clear();\\n coefs[\\\"\\\"] = 1; // means 1\\n } else {\\n Poly tmp(*this);\\n for (int i=1; i<iexp; ++i)\\n // O(iexp) multiplications, ugh\\n *this *= tmp;\\n }\\n return normalized();\\n }\\n\\n Poly operator +(const Poly &oth) const { return Poly(*this) += oth; }\\n Poly operator -(const Poly &oth) const { return Poly(*this) -= oth; }\\n Poly operator *(const Poly &oth) const { return Poly(*this) *= oth; }\\n Poly operator ^(int iexp) const { return Poly(*this) ^= iexp; }\\n bool operator ==(const Poly &oth) const { return coefs == oth.coefs; }\\n\\n void debug() const {\\n if (coefs.empty()) {\\n fprintf(stderr, \\\"#> 0\\\\n\\\");\\n return;\\n }\\n fprintf(stderr, \\\"#>\\\");\\n for (const auto &p: coefs)\\n fprintf(stderr, \\\" %d%s\\\", p.second, p.first.c_str());\\n fprintf(stderr, \\\"\\\\n\\\");\\n }\\n};\\n\\nstd::string normalize(const std::string &s) {\\n // explicit `*' signs and no spaces\\n std::string res;\\n enum {\\n NONE, PAREN, FACTOR, OPERATOR\\n } last=NONE;\\n for (size_t i=0; i<s.length(); ++i) {\\n if (s[i] == '(') {\\n if (last == FACTOR) {\\n res += '*';\\n }\\n res += '(';\\n last = PAREN;\\n } else if (s[i] == ')') {\\n res += ')';\\n last = FACTOR;\\n } else if (isalnum(s[i])) {\\n if (last == FACTOR) {\\n res += '*';\\n }\\n res += s[i];\\n if (isdigit(s[i])) {\\n while (i+1 < s.length() && isdigit(s[i+1]))\\n res += s[++i];\\n }\\n last = FACTOR;\\n } else if (!isspace(s[i])) {\\n res += s[i];\\n last = OPERATOR;\\n }\\n }\\n // fprintf(stderr, \\\"#< %s\\\\n\\\", res.c_str());\\n return res;\\n}\\n\\nint testcase_ends() {\\n char buf[96];\\n fgets(buf, sizeof buf, stdin);\\n std::string s=buf;\\n if (s == \\\".\\\\n\\\")\\n return 1;\\n\\n s = normalize(s);\\n Poly ps(s);\\n while (true) {\\n fgets(buf, sizeof buf, stdin);\\n std::string t=buf;\\n if (t == \\\".\\\\n\\\") {\\n printf(\\\".\\\\n\\\");\\n return 0;\\n }\\n\\n t = normalize(t);\\n Poly pt(t);\\n printf(\\\"%s\\\\n\\\", (ps == pt)? \\\"yes\\\":\\\"no\\\");\\n }\\n}\\n\\nint main() {\\n while (!testcase_ends()) {}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 3112,\n \"score_of_the_acc\": -0.0815,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1233_2880804\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstdint>\\n#include <cassert>\\n#include <string>\\n#include <vector>\\n#include <algorithm>\\n#include <map>\\n\\n#define fprintf(...) void(0)\\n\\nclass Poly {\\n std::map<std::string, int> coefs;\\n // e.g. coefs[\\\"aab\\\"] == 2 <=> the polynomial has the term 2 a^2 b\\n const std::string s;\\n\\n Poly &operator ^=(const Poly &oth) {\\n if (oth.coefs.size() == 1 && oth.coefs.find(\\\"\\\") != oth.coefs.end()) {\\n return (*this) ^= oth.coefs.find(\\\"\\\")->second;\\n } else if (oth.coefs.empty()) {\\n // means 0\\n coefs.clear();\\n coefs[\\\"\\\"] = 1; // means 1\\n return (*this);\\n }\\n\\n assert(false);\\n }\\n\\n Poly &op_eq(char op, const Poly &rhs) {\\n // (*this) @= rhs\\n switch (op) {\\n case '+': return (*this) += rhs;\\n case '-': return (*this) -= rhs;\\n case '*': return (*this) *= rhs;\\n case '^': return (*this) ^= rhs;\\n default: assert(false);\\n }\\n }\\n\\n Poly fourt(\\n size_t &i, \\n const std::vector<std::string> &ops={\\\"+-\\\", \\\"*\\\", \\\"^\\\", \\\"\\\"},\\n size_t prec=0) {\\n\\n if (ops[prec].empty()) {\\n if (s[i] == '(') {\\n Poly tmp=fourt(++i, ops, 0);\\n assert(s[i] == ')');\\n ++i;\\n return tmp;\\n }\\n if (isalpha(s[i])) {\\n // we assume only one-character variables\\n return Poly(s[i++]);\\n }\\n int coef=0;\\n while (s[i] >= '0' && s[i] <= '9')\\n coef = coef*10 + s[i++]-'0';\\n return Poly(coef);\\n }\\n\\n Poly res=fourt(i, ops, prec+1);\\n while (i < s.length()) {\\n char op=s[i];\\n if (!std::count(ops[prec].begin(), ops[prec].end(), op))\\n break;\\n Poly tmp=fourt(++i, ops, prec+1);\\n res.op_eq(op, tmp);\\n }\\n return res;\\n }\\n\\n Poly &normalized() {\\n for (auto it=coefs.begin(); it!=coefs.end(); ++it) {\\n if (it->second == 0) {\\n fprintf(stderr, \\\"Removed: %s\\\\n\\\", it->first.c_str());\\n coefs.erase(it);\\n }\\n }\\n return *this;\\n }\\n\\npublic:\\n Poly(const std::string &s): s(s) {\\n size_t i=0;\\n coefs = fourt(i).coefs; // ugh\\n }\\n\\n Poly(char ch): s(1, ch) {\\n assert(isalpha(ch));\\n coefs[s] = 1;\\n }\\n\\n Poly(int n): s(std::to_string(n)) {\\n if (n)\\n coefs[\\\"\\\"] = n;\\n }\\n\\n Poly &operator +=(const Poly &oth) {\\n for (const auto &p: oth.coefs) {\\n const std::string ¶m=p.first;\\n int coef=p.second;\\n coefs[param] += coef;\\n }\\n return normalized();\\n }\\n\\n Poly &operator -=(const Poly &oth) {\\n for (const auto &p: oth.coefs) {\\n const std::string ¶m=p.first;\\n int coef=p.second;\\n coefs[param] -= coef;\\n }\\n return normalized();\\n }\\n\\n Poly &operator *=(const Poly &oth) {\\n Poly tmp(*this);\\n coefs.clear();\\n for (const auto &pl: tmp.coefs) {\\n for (const auto &pr: oth.coefs) {\\n std::string param=pl.first+pr.first;\\n std::sort(param.begin(), param.end());\\n coefs[param] += pl.second*pr.second;\\n }\\n }\\n return normalized();\\n }\\n\\n Poly &operator ^=(int iexp) {\\n if (iexp == 0) {\\n // does not appear in #1233\\n coefs.clear();\\n coefs[\\\"\\\"] = 1; // means 1\\n } else {\\n Poly tmp(*this);\\n for (int i=1; i<iexp; ++i)\\n // O(iexp) multiplications, ugh\\n *this *= tmp;\\n }\\n return normalized();\\n }\\n\\n Poly operator +(const Poly &oth) const { return Poly(*this) += oth; }\\n Poly operator -(const Poly &oth) const { return Poly(*this) -= oth; }\\n Poly operator *(const Poly &oth) const { return Poly(*this) *= oth; }\\n Poly operator ^(int iexp) const { return Poly(*this) ^= iexp; }\\n bool operator ==(const Poly &oth) const { return coefs == oth.coefs; }\\n\\n void debug() const {\\n if (coefs.empty()) {\\n fprintf(stderr, \\\"#> 0\\\\n\\\");\\n return;\\n }\\n fprintf(stderr, \\\"#>\\\");\\n for (const auto &p: coefs)\\n fprintf(stderr, \\\" %d%s\\\", p.second, p.first.c_str());\\n fprintf(stderr, \\\"\\\\n\\\");\\n }\\n};\\n\\nstd::string normalize(const std::string &s) {\\n // explicit `*' signs and no spaces\\n std::string res;\\n enum {\\n NONE, PAREN, FACTOR, OPERATOR\\n } last=NONE;\\n for (size_t i=0; i<s.length(); ++i) {\\n if (s[i] == '(') {\\n if (last == FACTOR) {\\n res += '*';\\n }\\n res += '(';\\n last = PAREN;\\n } else if (s[i] == ')') {\\n res += ')';\\n last = FACTOR;\\n } else if (isalnum(s[i])) {\\n if (last == FACTOR) {\\n res += '*';\\n }\\n res += s[i];\\n if (isdigit(s[i])) {\\n while (i+1 < s.length() && isdigit(s[i+1]))\\n res += s[++i];\\n }\\n last = FACTOR;\\n } else if (!isspace(s[i])) {\\n res += s[i];\\n last = OPERATOR;\\n }\\n }\\n fprintf(stderr, \\\"#< %s\\\\n\\\", res.c_str());\\n return res;\\n}\\n\\nint testcase_ends() {\\n char buf[96];\\n fgets(buf, sizeof buf, stdin);\\n std::string s=buf;\\n if (s == \\\".\\\\n\\\")\\n return 1;\\n\\n s = normalize(s);\\n Poly ps(s);\\n ps.debug();\\n while (true) {\\n fgets(buf, sizeof buf, stdin);\\n std::string t=buf;\\n if (t == \\\".\\\\n\\\") {\\n printf(\\\".\\\\n\\\");\\n return 0;\\n }\\n\\n t = normalize(t);\\n Poly pt(t);\\n pt.debug();\\n printf(\\\"%s\\\\n\\\", (ps == pt)? \\\"yes\\\":\\\"no\\\");\\n }\\n}\\n\\nint main() {\\n while (!testcase_ends()) {}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3112,\n \"score_of_the_acc\": -0.0757,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1233_2833675\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nstruct term {\\n int coff;\\n vector<int> deg;\\n\\n term() : coff(1), deg(26, 0) {}\\n\\n bool operator<(const term& other) const {\\n return deg < other.deg;\\n }\\n bool operator==(const term& other) const {\\n return coff == other.coff && deg == other.deg;\\n }\\n};\\n\\nstruct expression {\\n void add_term(term new_term) {\\n for(auto& t : terms) {\\n if(t.deg == new_term.deg) {\\n t.coff += new_term.coff;\\n return;\\n }\\n }\\n terms.push_back(move(new_term));\\n sort(begin(terms), end(terms));\\n clean_up();\\n }\\n\\n void add_expr(expression e) {\\n for(auto& t : e.terms) {\\n add_term(t);\\n }\\n clean_up();\\n }\\n\\n expression operator-() const {\\n expression res;\\n res.terms = terms;\\n for(auto& t : res.terms) {\\n t.coff = -t.coff;\\n }\\n return res;\\n }\\n\\n bool operator==(expression const& other) const {\\n return terms == other.terms;\\n }\\n\\n void clean_up() {\\n terms.erase(remove_if(begin(terms), end(terms),\\n [](const auto& t1) {\\n return t1.coff == 0;\\n }),\\n end(terms));\\n }\\n\\n void debug_print() const {\\n cout << \\\"sz: \\\" << terms.size() << endl;\\n for(auto& t : terms) {\\n cout << \\\"coff: \\\" << t.coff << \\\" deg: \\\";\\n for(int i = 0; i < 26; ++i) {\\n cout << t.deg[i] << ' ';\\n }\\n cout << endl;\\n }\\n }\\n\\n vector<term> terms;\\n};\\n\\nterm operator*(term a, term const& rhs) {\\n a.coff *= rhs.coff;\\n for(int i = 0; i < 26; ++i) {\\n a.deg[i] += rhs.deg[i];\\n }\\n return a;\\n}\\n\\nexpression operator*(expression const& lhs, expression const& rhs) {\\n expression res;\\n for(auto const& t1 : lhs.terms) {\\n for(auto const& t2 : rhs.terms) {\\n res.add_term(t1 * t2);\\n }\\n }\\n return res;\\n}\\n\\n\\nexpression parse_expr(string const& s, int& p);\\nexpression parse_term(string const& s, int& p);\\nexpression parse_factor(string const& s, int& p);\\nvoid skip_sp(string const& s, int& p);\\nint number(string const& s, int& p);\\n\\nexpression parse_expr(string const& s, int& p) {\\n auto e = parse_term(s, p);\\n skip_sp(s, p);\\n while(p < (int)s.size() && (s[p] == '+' || s[p] == '-')) {\\n const char op = s[p++];\\n skip_sp(s, p);\\n auto t2 = parse_term(s, p);\\n if(op == '-') {\\n t2 = -t2;\\n }\\n e.add_expr(t2);\\n skip_sp(s, p);\\n }\\n return e;\\n}\\n\\nexpression parse_term(string const& s, int& p) {\\n auto e = parse_factor(s, p);\\n skip_sp(s, p);\\n while(p < (int)s.size() && s[p] != '+' && s[p] != '-' && s[p] != ')') {\\n auto f = parse_factor(s, p);\\n e = e * f;\\n }\\n return e;\\n}\\n\\nexpression parse_factor(string const& s, int& p) {\\n expression res;\\n skip_sp(s, p);\\n\\n if(s[p] == '(') {\\n skip_sp(s, ++p);\\n auto e = parse_expr(s, p);\\n res = e;\\n skip_sp(s, p);\\n assert(s[p] == ')');\\n skip_sp(s, ++p); // )\\n if(p < (int)s.size() && s[p] == '^') {\\n skip_sp(s, ++p);\\n int d = number(s, p); // todo: only \\\"^ (number)\\\" ?\\n for(int i = 0; i < d - 1; ++i) {\\n res = res * e;\\n }\\n }\\n skip_sp(s, p);\\n } else if(isdigit(s[p])) {\\n const int n = number(s, p);\\n term t;\\n t.coff = n;\\n res.add_term(t);\\n skip_sp(s, p);\\n } else if(isalpha(s[p])) {\\n const int idx = s[p++] - 'a';\\n term t;\\n t.deg[idx] = 1;\\n skip_sp(s, p);\\n if(p < (int)s.size() && s[p] == '^') {\\n skip_sp(s, ++p);\\n t.deg[idx] *= number(s, p);\\n skip_sp(s, p);\\n }\\n res.add_term(t);\\n } else {\\n cout << \\\"str: \\\" << s << \\\" p: \\\" << p << \\\" s[p]: \\\" << s[p] << endl;\\n assert(false);\\n }\\n\\n return res;\\n}\\n\\nint number(string const& s, int& p) {\\n assert(isdigit(s[p]));\\n int res = 0;\\n while(p < (int)s.size() && isdigit(s[p])) {\\n res *= 10;\\n res += s[p++] - '0';\\n }\\n return res;\\n}\\n\\nvoid skip_sp(string const& s, int& p) {\\n while(p < (int)s.size() && s[p] == ' ') {\\n p++;\\n }\\n}\\n\\nexpression parse(string const& s) {\\n int p = 0;\\n return parse_expr(s, p);\\n}\\n\\n\\nint main() {\\n string s;\\n while(getline(cin, s), s[0] != '.') {\\n if(s.back() == '\\\\r') s.pop_back();\\n const auto target = parse(s);\\n string t;\\n while(getline(cin, t), t[0] != '.') {\\n if(t.back() == '\\\\r') t.pop_back();\\n const auto ss = parse(t);\\n if(target == ss) {\\n cout << \\\"yes\\\" << endl;\\n } else {\\n cout << \\\"no\\\" << endl;\\n }\\n }\\n cout << \\\".\\\" << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 420,\n \"memory_kb\": 3372,\n \"score_of_the_acc\": -0.2027,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1233_2565832\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\n\\nusing K = string;\\nusing M = map<K, int>;\\n\\nK mul(K k1, K k2){\\n\\tk1 += k2;\\n\\tsort(k1.begin(), k1.end());\\n\\treturn k1;\\n}\\n\\nM add(M m1, M m2){\\n\\tfor(auto v : m2){\\n\\t\\tm1[v.first] += v.second;\\n\\t}\\n\\treturn m1;\\n}\\n\\nM mul(M m1, M m2){\\n\\tM ret;\\n\\tfor(const auto& v1 : m1){\\n\\t\\tfor(const auto& v2 : m2){\\n\\t\\t\\tK k = mul(v1.first, v2.first);\\n\\t\\t\\tret[k] += v1.second * v2.second;\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\n\\nM pow(M m, int x){\\n\\tM ret;\\n\\tret[\\\"\\\"] = 1;\\n\\tM a = m;\\n\\twhile(x){\\n\\t\\tif(x & 1) ret = mul(ret, a);\\n\\t\\tx /= 2;\\n\\t\\ta = mul(a, a);\\n\\t}\\n\\treturn ret;\\n}\\n\\nint c;\\nint N;\\nstring s;\\n\\nM exp();\\nM term();\\nM fact();\\n\\nvoid skip(){\\n\\twhile(c < N && (s[c] == ' ')) c++;\\n}\\n\\nM exp(){\\n\\tskip();\\n\\tM t1 = term();\\n\\n\\tskip();\\n\\twhile(c < N && (s[c] == '+' || s[c] == '-')){\\n\\t\\tchar ch = s[c];\\n\\t\\tc++;\\n\\t\\tskip();\\n\\t\\tM t2 = term();\\n\\t\\tif(ch == '-'){\\n\\t\\t\\tfor(auto& v : t2){\\n\\t\\t\\t\\tv.second *= -1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tt1 = add(t1, t2);\\n\\t}\\n\\treturn t1;\\n}\\n\\nM term(){\\n\\tskip();\\n\\tM f1 = fact();\\n\\tskip();\\n\\twhile(c < N && (isalnum(s[c]) || s[c] == '(')){\\n\\t\\tM f2 = fact();\\n\\t\\tskip();\\n\\t\\tf1 = mul(f1, f2);\\n\\t}\\n\\treturn f1;\\n}\\n\\nM fact(){\\n\\tskip();\\n\\tM r;\\n\\tif(s[c] == '('){\\n\\t\\tc++;\\n\\t\\tr = exp();\\n\\t\\tc++;\\n\\t\\tskip();\\n\\t}\\n\\telse if(isalpha(s[c])){\\n\\t\\tK k;\\n\\t\\tk += s[c];\\n\\t\\tc++;\\n\\t\\tr[k]++;\\n\\t}\\n\\telse if(isdigit(s[c])){\\n\\t\\tint x = 0;\\n\\t\\twhile(c < N && isdigit(s[c])){\\n\\t\\t\\tx = x * 10 + s[c] - '0';\\n\\t\\t\\tc++;\\n\\t\\t}\\n\\t\\tr[\\\"\\\"] += x;\\n\\t}\\n\\tskip();\\n\\tif(c < N && s[c] == '^'){\\n\\t\\tc++;\\n\\t\\tskip();\\n\\t\\tint x = s[c] - '0';\\n\\t\\tc++;\\n\\t\\tskip();\\n\\t\\tr = pow(r, x);\\n\\t}\\n\\treturn r;\\n}\\n\\nM f(string t){\\n\\tc = 0;\\n\\ts = t;\\n\\tN = s.size();\\n\\treturn exp();\\n}\\n\\nM filter(M m){\\n\\tM ret;\\n\\tfor(auto v : m){\\n\\t\\tif(v.second == 0) continue;\\n\\t\\tret[v.first] = v.second;\\n\\t}\\n\\treturn ret;\\n}\\n\\nint main(){\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\n#ifdef LOCAL\\n\\tstd::ifstream in(\\\"in\\\");\\n\\tstd::cin.rdbuf(in.rdbuf());\\n#endif\\n\\n\\t//auto ret = f(\\\"a- (b-c)+2\\\");\\n\\n\\tstring x, y;\\n\\twhile(getline(cin, x), x != \\\".\\\"){\\n\\t\\tM xm = filter(f(x));\\n\\t\\twhile(getline(cin, y), y != \\\".\\\"){\\n\\t\\t\\tauto res = filter(f(y));\\n\\t\\t\\tif(xm == res){\\n\\t\\t\\t\\tcout << \\\"yes\\\" << endl;\\n\\t\\t\\t}\\n\\t\\t\\telse{\\n\\t\\t\\t\\tcout << \\\"no\\\" << endl;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << \\\".\\\" << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 3380,\n \"score_of_the_acc\": -0.1082,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1233_2555742\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define int long long\\n#define r(i,n) for(int i=0;i<n;i++)\\n#define mod 1000000007\\nusing namespace std;\\nstring s,t;\\nint p;\\nmap<char,int>m;\\nvoid convertS(){\\n r(i,s.size()){\\n if(i&&s[i]==' '){\\n if(s[i-1]==')'&&s[i+1]=='(')s[i]='*';\\n else if(isalpha(s[i-1])&&isalpha(s[i+1]))s[i]='*';\\n else if(s[i-1]==')'&&isalpha(s[i+1]))s[i]='*';\\n else if(isalpha(s[i-1])&&s[i+1]=='(')s[i]='*';\\n else if(s[i-1]==')'&&isdigit(s[i+1]))s[i]='*';\\n else if(isdigit(s[i-1])&&s[i+1]=='(')s[i]='*';\\n else if(isdigit(s[i-1])&&isalpha(s[i+1]))s[i]='*';\\n else if(isalpha(s[i-1])&&isdigit(s[i+1]))s[i]='*';\\n else if(isdigit(s[i-1])&&isdigit(s[i+1]))s[i]='*';\\n else s.erase(s.begin()+i--);\\n }\\n if(isdigit(s[i])&&isalpha(s[i+1]))s.insert(s.begin()+i+1,'*');\\n if(isalpha(s[i])&&isalpha(s[i+1]))s.insert(s.begin()+i+1,'*');\\n if(isalpha(s[i])&&isdigit(s[i+1]))s.insert(s.begin()+i+1,'*');\\n if(s[i]==')'&&isalpha(s[i+1]))s.insert(s.begin()+i+1,'*');\\n if(s[i]==')'&&isdigit(s[i+1]))s.insert(s.begin()+i+1,'*');\\n if(s[i+1]=='('&&isalpha(s[i]))s.insert(s.begin()+i+1,'*');\\n if(s[i+1]=='('&&isdigit(s[i]))s.insert(s.begin()+i+1,'*');\\n if(s[i+1]=='('&&s[i]==')')s.insert(s.begin()+i+1,'*');\\n }\\n}\\nvoid convertT(){\\n r(i,t.size()){\\n if(i&&t[i]==' '){\\n if(t[i-1]==')'&&t[i+1]=='(')t[i]='*';\\n else if(isalpha(t[i-1])&&isalpha(t[i+1]))t[i]='*';\\n else if(t[i-1]==')'&&isalpha(t[i+1]))t[i]='*';\\n else if(isalpha(t[i-1])&&t[i+1]=='(')t[i]='*';\\n else if(t[i-1]==')'&&isdigit(t[i+1]))t[i]='*';\\n else if(isdigit(t[i-1])&&t[i+1]=='(')t[i]=='*';\\n else if(isdigit(t[i-1])&&isalpha(t[i+1]))t[i]='*';\\n else if(isalpha(t[i-1])&&isdigit(t[i+1]))t[i]='*';\\n else if(isdigit(t[i-1])&&isdigit(t[i+1]))t[i]='*';\\n else t.erase(t.begin()+i--);\\n }\\n if(isdigit(t[i])&&isalpha(t[i+1]))t.insert(t.begin()+i+1,'*');\\n if(isalpha(t[i])&&isalpha(t[i+1]))t.insert(t.begin()+i+1,'*');\\n if(isalpha(t[i])&&isdigit(t[i+1]))t.insert(t.begin()+i+1,'*');\\n if(t[i]==')'&&isalpha(t[i+1]))t.insert(t.begin()+i+1,'*');\\n if(t[i]==')'&&isdigit(t[i+1]))t.insert(t.begin()+i+1,'*');\\n if(t[i+1]=='('&&isalpha(t[i]))t.insert(t.begin()+i+1,'*');\\n if(t[i+1]=='('&&isdigit(t[i]))t.insert(t.begin()+i+1,'*');\\n if(t[i+1]=='('&&t[i]==')')t.insert(t.begin()+i+1,'*');\\n }\\n}\\nint Sbnf1();\\nint get_S(){\\n int res=0;\\n if(s[p]=='(')p++,res=Sbnf1(),p++;\\n else if(isdigit(s[p])){\\n while(isdigit(s[p])){\\n res=res*10+(s[p++]-'0');\\n }\\n }\\n else res=m[s[p++]];\\n return res%mod;\\n}\\nint Sbnf3(){\\n int res=get_S();\\n while(s[p]=='^'){\\n p++;\\n int ret=get_S(),kit=res;\\n r(i,ret-1){\\n res*=kit;\\n res=res%mod;\\n }\\n }\\n return res%mod;\\n}\\nint Sbnf2(){\\n int res=Sbnf3();\\n while(s[p]=='*'){\\n p++;\\n res*=Sbnf3();\\n res=res%mod;\\n }\\n return res%mod;\\n}\\nint Sbnf1(){\\n int res=Sbnf2();\\n while(s[p]=='+'||s[p]=='-'){\\n int pp=p++;\\n if(s[pp]=='+')res+=Sbnf2();\\n if(s[pp]=='-')res-=Sbnf2();\\n while(res<0)res+=mod;\\n res=res%mod;\\n }\\n return res%mod;\\n}\\nint Tbnf1();\\nint get_T(){\\n int res=0;\\n if(t[p]=='(')p++,res=Tbnf1(),p++;\\n else if(isdigit(t[p])){\\n while(isdigit(t[p])){\\n res=res*10+(t[p++]-'0');\\n }\\n }\\n else res=m[t[p++]];\\n return res%mod;\\n}\\nint Tbnf3(){\\n int res=get_T();\\n while(t[p]=='^'){\\n p++;\\n int ret=get_T(),kit=res;\\n r(i,ret-1){\\n res*=kit;\\n res=res%mod;\\n }\\n }\\n return res%mod;\\n}\\nint Tbnf2(){\\n int res=Tbnf3();\\n while(t[p]=='*'){\\n p++;\\n res*=Tbnf3();\\n res=res%mod;\\n }\\n return res%mod;\\n}\\nint Tbnf1(){\\n int res=Tbnf2();\\n while(t[p]=='+'||t[p]=='-'){\\n int pp=p++;\\n if(t[pp]=='+')res+=Tbnf2();\\n if(t[pp]=='-')res-=Tbnf2();\\n while(res<0)res+=mod;\\n res=res%mod;\\n }\\n return res%mod;\\n}\\nmain(){\\n while(getline(cin,t)){\\n if(t==\\\".\\\")break;\\n convertT();\\n while(getline(cin,s)){\\n if(s==\\\".\\\"){\\n cout<<'.'<<endl;\\n break;\\n }\\n int flag = 0;\\n convertS();\\n r(i,100){\\n r(j,26)m[j+'a']=rand()%mod;\\n p=0;\\n int y=Tbnf1()%mod;\\n p=0;\\n int x=Sbnf1()%mod;\\n if(y!=x)flag++;\\n }\\n cout<<(flag?\\\"no\\\":\\\"yes\\\")<<endl;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3140,\n \"score_of_the_acc\": -0.0759,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1233_2548634\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef unsigned long long ll;\\n \\nstring s;\\nint p;\\n \\nll A[200][300];\\nint idx;\\n \\nll bnf();\\n \\nll get_num(){\\n \\n if(s[p]=='('){\\n \\n p++;\\n \\n ll res=bnf();\\n \\n p++;\\n \\n return res;\\n }\\n \\n if('a'<=s[p]&&s[p]<='z') return A[idx][s[p++]];\\n \\n ll num=0;\\n \\n while('0'<=s[p]&&s[p]<='9') num=num*10+s[p]-'0', p++;\\n \\n return num;\\n \\n}\\n \\nll bnf3(){\\n \\n ll res=get_num();\\n \\n while(p<s.size()){\\n \\n if(s[p]=='^'){\\n \\n p++;\\n \\n ll r=get_num();\\n \\n ll tmp=1;\\n \\n for(int i=0;i<r;i++) tmp*=res;\\n \\n res=tmp;\\n \\n }else break;\\n \\n }\\n \\n return res;\\n}\\n \\nll bnf2(){\\n \\n ll res=bnf3();\\n \\n while(p<s.size()){\\n \\n if(s[p]=='*'){\\n \\n p++;\\n \\n ll r=bnf3();\\n \\n res*=r;\\n \\n }else break;\\n \\n }\\n \\n return res;\\n}\\n \\nll bnf(){\\n \\n ll res=bnf2();\\n \\n while(p<s.size()){\\n \\n if(s[p]=='+'){\\n \\n p++;\\n \\n ll r=bnf2();\\n \\n res+=r;\\n \\n }\\n else if(s[p]=='-'){\\n \\n p++;\\n \\n ll r=bnf2();\\n \\n res-=r;\\n \\n }else break;\\n \\n }\\n \\n return res;\\n}\\n \\nvoid change(){\\n \\n for(int i=0;i<s.size();i++)\\n if((s[i]==')'||('a'<=s[i]&&s[i]<='z')||('0'<=s[i]&&s[i]<='9')))\\n if((s[i+1]=='('||('a'<=s[i+1]&&s[i+1]<='z')||('0'<=s[i+1]&&s[i+1]<='9')))\\n if(!('0'<=s[i]&&s[i]<='9'&&'0'<=s[i+1]&&s[i+1]<='9'))\\n s=s.substr(0,i+1)+'*'+s.substr(i+1);\\n \\n \\n for(int i=0;i<s.size();i++)\\n \\n if(s[i]==' ')\\n \\n while(s[i]==' '&&i+1<s.size()&&s[i+1]==' ') s.erase(s.begin()+i);\\n \\n \\n if(s[0]==' ') s.erase(s.begin());\\n \\n if(s[s.size()-1]==' ') s.erase(s.begin()+s.size()-1);\\n \\n for(int i=0;i<s.size();i++)\\n if(s[i]==' ')\\n if((s[i-1]==')'||('a'<=s[i-1]&&s[i-1]<='z')||('0'<=s[i-1]&&s[i-1]<='9')))\\n if((s[i+1]=='('||('a'<=s[i+1]&&s[i+1]<='z')||('0'<=s[i+1]&&s[i+1]<='9'))) s[i]='*';\\n \\n for(int i=0;i<s.size();i++)\\n \\n if(s[i]==' ') s.erase(s.begin()+i), i--;\\n \\n \\n}\\n \\nint main(){\\n \\n for(int T=0;T<200;T++)\\n \\n for(int i=0;i<300;i++) A[T][i]=rand();\\n \\n while(1){\\n \\n string tmp=s;\\n \\n getline(cin,s);\\n \\n if(s==\\\".\\\") break;\\n \\n change();\\n \\n ll base[200];\\n \\n for(int T=0;T<200;T++){\\n idx=T;\\n p=0;\\n base[T]=bnf();\\n }\\n \\n while(1){\\n \\n getline(cin,s);\\n \\n if(s==\\\".\\\"){\\n cout<<\\\".\\\"<<endl;\\n break;\\n }\\n \\n change();\\n \\n bool ans=true;\\n \\n for(int T=0;T<200;T++){\\n \\n idx=T; \\n p=0;\\n \\n ll r=bnf();\\n \\n if(base[T]!=r) ans=false;\\n \\n }\\n \\n if(ans) cout<<\\\"yes\\\"<<endl;\\n else cout<<\\\"no\\\"<<endl;\\n \\n }\\n \\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3640,\n \"score_of_the_acc\": -0.1283,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1233_2548404\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define int long long\\nusing namespace std;\\ntypedef pair<string,int> P;\\ntypedef map<string,int> M;\\n\\nM add(M a,M b){\\n for(P p2:b) a[p2.first] += p2.second;\\n return a;\\n}\\n\\nM Minus(M a,M b){\\n for(P p2:b) a[p2.first] -= p2.second;\\n return a;\\n}\\n \\nM mult(M a,M b){\\n M res;\\n for(P p1:a)\\n for(P p2:b){\\n string s = p1.first + p2.first; sort(s.begin(),s.end());\\n int num = p1.second * p2.second;\\n res[s] += num;\\n }\\n return res;\\n}\\n \\nM bnf();\\nint pos;\\nstring S;\\nvoid skipsp(){while(S[pos] == ' ') pos++;}\\n \\nint getNum(){\\n int res = 0;\\n while(isdigit(S[pos])) res = res * 10 + S[pos++]-'0';\\n return res;\\n}\\n \\nint getNum2(const string &S,int &pos){\\n int res = 0;\\n while(isdigit(S[pos])) res = res * 10 + S[pos++]-'0';\\n return res;\\n}\\n\\nstring getBlock(){\\n string res;\\n skipsp();\\n while(isdigit(S[pos]) || isalpha(S[pos])) res += S[pos++];\\n skipsp();\\n if(S[pos] == '^') {\\n pos++;\\n skipsp();\\n assert(isdigit(S[pos])&&\\\"hut\\\");\\n int p = getNum();\\n for(int i=0;i<p-1;i++) res += res.back();\\n }\\n return res;\\n}\\n \\nM BtoM(string b){\\n M res;\\n int num = 1;\\n string val;\\n for(int i=0;i<(int)b.size();i++){\\n char ch = b[i];\\n if(isalpha(ch)) val += ch;\\n else if(isdigit(ch)) num *= getNum2(b,i),i--;\\n else assert(ch == ' ' && \\\"BtoM\\\");\\n }\\n res[val] = num;\\n return res;\\n}\\n \\nM calc(){\\n M res; res[\\\"\\\"] = 1;\\n while(1){\\n skipsp();\\n char ch = S[pos];\\n if(ch == '(') pos++,res = mult(res,bnf()),pos++;\\n else if(isalpha(ch) || isdigit(ch)){\\n string block = getBlock();\\n res = mult(res,BtoM(block));\\n }\\n else if(ch == '^') assert(!\\\"^\\\");\\n else break;\\n }\\n return res;\\n}\\n \\nM bnf(){\\n M res = calc();\\n while(1){\\n skipsp();\\n char ch = S[pos];\\n if(isalpha(ch) || isdigit(ch)) res = mult(res,calc());\\n else if(ch == '+')pos++,res = add(res,calc());\\n else if(ch == '-')pos++,res = Minus(res,calc());\\n else if(ch == '(') pos++,res = mult(res,bnf()),pos++;\\n else if(ch == '^') assert(!\\\"^\\\");\\n else break;\\n }\\n for(auto it=res.begin();it!=res.end();it++) if(it->second == 0) res.erase(it);\\n return res;\\n}\\n \\nsigned main(){\\n while(1){\\n getline(cin,S);\\n if(S == \\\".\\\") break;\\n pos = 0;\\n M ori = bnf();\\n while(1){\\n getline(cin,S);\\n if(S == \\\".\\\") break;\\n pos = 0;\\n M res = bnf();\\n cout<<((ori == res)? \\\"yes\\\":\\\"no\\\")<<endl;\\n }\\n cout<<\\\".\\\"<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3444,\n \"score_of_the_acc\": -0.1124,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1233_2548386\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define int long long\\nusing namespace std;\\ntypedef pair<string,int> P;\\ntypedef map<string,int> M;\\n \\nvoid pr(M a,string s=\\\"\\\"){\\n return;\\n cout<<s<<endl;\\n for(P p:a) cout<<p.first<<\\\" \\\"<<p.second<<endl;\\n cout<<\\\"end\\\"<<endl;\\n}\\n \\nM add(M a,M b,int f=1){\\n for(P p2:b) a[p2.first] += f * p2.second;\\n return a;\\n}\\n \\nM mult(M a,M b){\\n M res;\\n for(P p1:a)\\n for(P p2:b){\\n string s = p1.first + p2.first; sort(s.begin(),s.end());\\n int num = p1.second * p2.second;\\n res[s] += num;\\n }\\n return res;\\n}\\n \\n \\nM bnf();\\nint pos;\\nstring S;\\nvoid skipsp(){while(S[pos] == ' ') pos++;}\\n \\nint getNum(){\\n int res = 0;\\n while((int)S.size()> pos && isdigit(S[pos])) res = res * 10 + S[pos++]-'0';\\n return res;\\n}\\n \\nint getNum2(const string &S,int &pos){\\n int res = 0;\\n while((int)S.size()>pos && isdigit(S[pos])) res = res * 10 + S[pos++]-'0';\\n return res;\\n}\\n \\nstring getBlock(){\\n string res;\\n skipsp();\\n while(isdigit(S[pos]) || isalpha(S[pos])) res += S[pos++];\\n skipsp();\\n if(S[pos] == '^') {\\n pos++;\\n skipsp();\\n assert(isdigit(S[pos])&&\\\"hut\\\");\\n int p = getNum();\\n for(int i=0;i<p-1;i++) res += res.back();\\n }\\n return res;\\n}\\n \\nM BtoM(string b){\\n M res;\\n int num = 1;\\n string val;\\n for(int i=0;i<(int)b.size();i++){\\n char ch = b[i];\\n if(isalpha(ch)) val += ch;\\n else if(isdigit(ch)) num *= getNum2(b,i),i--;\\n else if(ch != ' ') assert(!\\\"BtoM\\\");\\n }\\n res[val] = num;\\n return res;\\n}\\n \\nM calc(){\\n M res; res[\\\"\\\"] = 1;\\n while(1){\\n skipsp();\\n char ch = S[pos];\\n if(ch == '(') pos++,res = mult(res,bnf()),pos++;\\n else if(isalpha(ch) || isdigit(ch)){\\n string block = getBlock();\\n res = mult(res,BtoM(block));\\n }\\n else if(ch == '^') assert(!\\\"^\\\");\\n else break;\\n }\\n pr(res,\\\"calc,res\\\");\\n return res;\\n}\\n \\nM bnf(){\\n M res = calc();\\n pr(res,\\\"start bnf\\\");\\n while(1){\\n skipsp();\\n char ch = S[pos];\\n if(isalpha(ch) || isdigit(ch)) res = mult(res,calc());\\n else if(ch == '+')pos++,res = add(res,calc());\\n else if(ch == '-')pos++,res = add(res,calc(),-1);\\n else if(ch == '(') pos++,res = mult(res,bnf()),pos++;\\n else if(ch == '^') assert(!\\\"^\\\");\\n else break;\\n }\\n \\n for(auto it=res.begin();it!=res.end();it++) if(it->second==0) res.erase(it);\\n pr(res,\\\"return bnf\\\");\\n return res;\\n}\\n \\nsigned main(){\\n while(1){\\n getline(cin,S);\\n //cin.ignore();\\n if(S == \\\".\\\") break;\\n pos = 0;\\n M ori = bnf();\\n pr(ori,\\\"ori\\\");\\n while(1){\\n getline(cin,S);\\n if(S == \\\".\\\") break;\\n pos = 0;\\n M res = bnf();\\n cout<<((ori == res)? \\\"yes\\\":\\\"no\\\")<<endl;\\n pr(res,S);\\n }\\n cout<<\\\".\\\"<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 3428,\n \"score_of_the_acc\": -0.1135,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1233_2548314\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef unsigned long long ll;\\n\\nstring s;\\nint p;\\n\\nll A[200][300];\\nint idx;\\n\\nll bnf();\\n\\nll get_num(){\\n\\n if(s[p]=='('){\\n \\n p++;\\n\\n ll res=bnf();\\n \\n p++;\\n\\n return res;\\n }\\n \\n if('a'<=s[p]&&s[p]<='z') return A[idx][s[p++]];\\n \\n ll num=0;\\n \\n while('0'<=s[p]&&s[p]<='9') num=num*10+s[p]-'0', p++;\\n\\n return num;\\n \\n}\\n\\nll bnf3(){\\n\\n ll res=get_num();\\n \\n while(p<s.size()){\\n\\n if(s[p]=='^'){\\n\\n p++;\\n\\n ll r=get_num();\\n\\n ll tmp=1;\\n\\n for(int i=0;i<r;i++) tmp*=res;\\n\\n res=tmp;\\n \\n }else break;\\n \\n }\\n \\n return res;\\n}\\n\\nll bnf2(){\\n\\n ll res=bnf3();\\n\\n while(p<s.size()){\\n\\n if(s[p]=='*'){\\n\\n p++;\\n\\n ll r=bnf3();\\n \\n res*=r;\\n \\n }else break;\\n \\n }\\n \\n return res;\\n}\\n\\nll bnf(){\\n\\n ll res=bnf2();\\n \\n while(p<s.size()){\\n \\n if(s[p]=='+'){\\n\\n p++;\\n \\n ll r=bnf2();\\n \\n res+=r;\\n \\n }\\n else if(s[p]=='-'){\\n\\n p++;\\n\\n ll r=bnf2();\\n\\n res-=r;\\n \\n }else break;\\n \\n }\\n \\n return res;\\n}\\n\\nvoid change(){\\n \\n for(int i=0;i<s.size();i++)\\n if((s[i]==')'||('a'<=s[i]&&s[i]<='z')||('0'<=s[i]&&s[i]<='9')))\\n if((s[i+1]=='('||('a'<=s[i+1]&&s[i+1]<='z')||('0'<=s[i+1]&&s[i+1]<='9')))\\n\\tif(!('0'<=s[i]&&s[i]<='9'&&'0'<=s[i+1]&&s[i+1]<='9'))\\n\\t s=s.substr(0,i+1)+'*'+s.substr(i+1);\\n\\n \\n for(int i=0;i<s.size();i++)\\n \\n if(s[i]==' ')\\n \\n while(s[i]==' '&&i+1<s.size()&&s[i+1]==' ') s.erase(s.begin()+i);\\n \\n\\n if(s[0]==' ') s.erase(s.begin());\\n \\n if(s[s.size()-1]==' ') s.erase(s.begin()+s.size()-1);\\n\\n for(int i=0;i<s.size();i++)\\n if(s[i]==' ')\\n if((s[i-1]==')'||('a'<=s[i-1]&&s[i-1]<='z')||('0'<=s[i-1]&&s[i-1]<='9')))\\n\\tif((s[i+1]=='('||('a'<=s[i+1]&&s[i+1]<='z')||('0'<=s[i+1]&&s[i+1]<='9'))) s[i]='*';\\n\\n for(int i=0;i<s.size();i++)\\n \\n if(s[i]==' ') s.erase(s.begin()+i), i--;\\n \\n \\n}\\n\\nint main(){\\n \\n for(int T=0;T<200;T++)\\n \\n for(int i=0;i<300;i++) A[T][i]=rand();\\n \\n while(1){\\n\\n string tmp=s;\\n \\n getline(cin,s);\\n \\n if(s==\\\".\\\") break;\\n \\n change();\\n \\n ll base[200];\\n\\n for(int T=0;T<200;T++){\\n idx=T;\\n p=0;\\n base[T]=bnf();\\n }\\n \\n while(1){\\n \\n getline(cin,s);\\n \\n if(s==\\\".\\\"){\\n\\tcout<<\\\".\\\"<<endl;\\n\\tbreak;\\n }\\n \\n change();\\n \\n bool ans=true;\\n \\n for(int T=0;T<200;T++){\\n \\n\\tidx=T; \\n\\tp=0;\\n \\n\\tll r=bnf();\\n\\t\\n\\tif(base[T]!=r) ans=false;\\n\\t\\n }\\n \\n if(ans) cout<<\\\"yes\\\"<<endl;\\n else cout<<\\\"no\\\"<<endl;\\n \\n }\\n \\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3632,\n \"score_of_the_acc\": -0.1274,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1233_2469770\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n \\n#define _overload(_1,_2,_3,name,...) name\\n#define _rep(i,n) _range(i,0,n)\\n#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)\\n#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)\\n \\n#define _rrep(i,n) _rrange(i,n,0)\\n#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)\\n#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)\\n \\n#define _all(arg) begin(arg),end(arg)\\n#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))\\n#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)\\n#define clr(a,b) memset((a),(b),sizeof(a))\\n#define bit(n) (1LL<<(n))\\n \\n// #define DEBUG\\n \\n#ifdef DEBUG\\n #define dump(...) fprintf(stderr, __VA_ARGS__)\\n#else\\n #define dump(...)\\n#endif\\n \\ntemplate<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}\\ntemplate<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}\\n \\nusing namespace std;\\nusing ll=long long;\\nusing vi=vector<int>;\\nusing vll=vector<ll>;\\n \\nconst double EPS = 1e-10;\\nconst double PI = acos(-1.0);\\nconst ll inf =1LL << 62;\\nconst ll mod=1000000007LL;\\nconst int dx[4]={1,0,-1,0};\\nconst int dy[4]={0,1,0,-1};\\n \\n \\nll extgcd(ll a,ll b,ll& x,ll& y){x=1,y=0;ll g=a;if(b!=0) g=extgcd(b,a%b,y,x),y-=a/b*x;return g;}\\nll ADD(const ll &a, const ll &b,const ll &mod) { return (a+b)%mod;}\\nll SUB(const ll &a, const ll &b,const ll &mod) { return (a-b+mod)%mod;}\\nll MUL(const ll &a, const ll &b,const ll &mod) { return (1LL*a*b)%mod;}\\nll DIV(const ll &a, const ll &b,const ll &mod) {ll x,y; extgcd(b,mod,x,y);return MUL(a,(x+mod)%mod,mod);}\\n \\nrandom_device rd;\\nmt19937 mt(rd());\\nuniform_int_distribution<int> dice(1,6);\\nuniform_real_distribution<double> score(0.0,10.0);\\n\\nstring f;\\nint len;\\nint p = 0;\\n\\nll exp();\\nll term();\\nll fact();\\n\\nll tbl['z' - 'a' + 1];\\ninline ll c2n(char c){\\n return tbl[c - 'a'];\\n}\\n\\nchar next_c(){\\n while(p < len and f[p] == ' ') p++;\\n return f[p];\\n}\\n\\nll exp(){\\n ll ret = term();\\n\\n char c;\\n while(c = next_c(), (c == '+' or c == '-')){\\n p++;\\n ll r = term();\\n if(c == '+') ret = ADD(ret, r, mod);\\n else ret = SUB(ret, r, mod);\\n }\\n\\n return ret;\\n}\\n\\nconst ll ERR = 2LL * mod;\\n\\nll term(){\\n ll ret = fact();\\n\\n ll r;\\n while((r = fact()) != ERR){\\n ret = MUL(ret, r, mod);\\n }\\n\\n return ret;\\n}\\n\\ninline ll num(){\\n ll ret = 0LL;\\n next_c();\\n while(isdigit(f[p])){\\n ret = ret * 10 + (f[p] - '0');\\n p++; // [0,9]\\n }\\n return ret % mod;\\n} \\n\\nll fact(){\\n ll ret = ERR;\\n\\n char c = next_c();\\n if(c == '('){\\n p++; // (\\n ret = exp();\\n assert(next_c() == ')'); p++;\\n }\\n else if(islower(c)){\\n p++; // [a,z]\\n ret = c2n(c);\\n\\n c = next_c();\\n if(c == '^'){\\n p++; // ^\\n ll d = num();\\n ll b = ret;\\n rep(loop, d - 1){\\n ret = MUL(ret, b, mod);\\n }\\n }\\n }\\n else if(isdigit(c)){\\n ret = num();\\n }\\n else {\\n // cerr << \\\"cur... \\\" << c << endl;\\n }\\n\\n return ret;\\n}\\n\\nint main(void){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n auto myrand = bind(uniform_int_distribution<int>(0, (int)1e6), mt19937(static_cast<unsigned int>(time(nullptr))));\\n\\n while(true){\\n string mine;\\n getline(cin, mine);\\n if(mine == \\\".\\\") break;\\n \\n while(true){\\n string opp;\\n getline(cin, opp);\\n if(opp == \\\".\\\") break;\\n\\n bool ok = true;\\n rep(loop, 1000){\\n rep(i, 'z' - 'a' + 1) tbl[i] = myrand();\\n\\n // cerr << \\\"-> \\\" << mine << endl;\\n f = mine; p = 0; len = f.size(); ll a = exp();\\n // cerr << \\\"-> \\\" << opp << endl;\\n f = opp; p = 0; len = f.size(); ll b = exp();\\n\\n if(a != b){\\n ok = false;\\n break;\\n }\\n }\\n\\n if(ok){\\n cout << \\\"yes\\\" << endl;\\n }\\n else {\\n cout << \\\"no\\\" << endl;\\n }\\n }\\n cout << \\\".\\\" << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3056,\n \"score_of_the_acc\": -0.0522,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":696,"cells":{"group_id":{"kind":"string","value":"aoj_1238_cpp"},"problem_description":{"kind":"string","value":"Problem G:\nTrue Liars\nAfter having drifted about in a small boat for a couple of days, Akira Crusoe Maeda was finally cast ashore on a foggy island. Though he was exhausted and despaired, he was still fortunate to remember a legend of the foggy island, which he had heard from patriarchs in his childhood. This must be the island in the legend.\nIn the legend, two tribes have inhabited the island, one is divine and the other is devilish; once members of the divine tribe bless you, your future is bright and promising, and your soul will eventually go to Heaven; in contrast, once members of the devilish tribe curse you, your future is bleak and hopeless, and your soul will eventually fall down to Hell.\nIn order to prevent the worst-case scenario, Akira should distinguish the devilish from the divine. But how? They looked exactly alike and he could not distinguish one from the other solely by their appearances. He still had his last hope, however. The members of the divine tribe are truth-tellers, that is, they always tell the truth and those of the devilish tribe are liars, that is, they always tell a lie.\nHe asked some of the whether or not some are divine. They knew one another very much and always responded to him \"faithfully\" according to their individual natures (i.e., they always tell the truth or always a lie). He did not dare to ask any other forms of questions, since the legend says that a devilish member would curse a person forever when he did not like the question. He had another piece of useful information: the legend tells the populations of both tribes. These numbers in the legend are trustworthy since everyone living on this island is immortal and none have ever been born at least these millennia.\nYou are a good computer programmer and so requested to help Akira by writing a program that classifies the inhabitants according to their answers to his inquiries.\nInput\nThe input consists of multiple data sets, each in the following format:\nn\np\n1\np\n2\nx\n1\ny\n1\na\n1\nx\n2\ny\n2\na\n2\n...\nx\ni\ny\ni\na\ni\n...\nx\nn\ny\nn\na\nn\nThe first line has three non-negative integers\nn\n,\np\n1\n, and\np\n2\n.\nn\nis the number of questions Akira asked.\np\n1\nand\np\n2\nare the populations of the divine and devilish tribes, respectively, in the legend. Each of the following\nn\nlines has two integers\nx\ni\n,\ny\ni\nand one word\na\ni\n.\nx\ni\nand\ny\ni\nare the identification numbers of inhabitants, each of which is between 1 and\np\n1\n+\np\n2\n, inclusive.\na\ni\nis either \"yes\", if the inhabitant\nx\ni\nsaid that the inhabitant\ny\ni\nwas a member of the divine tribe, or \"no\", otherwise. Note that\nx\ni\nand\ny\ni\ncan be the same number since \"are you a member of the divine tribe?\" is a valid question. Note also that two lines may have the same\nx\n's and\ny\n's since Akira was very upset and might have asked the same question to the same one more than once.\nYou may assume that\nn\nis less than 1000 and that\np\n1\nand\np\n2\nare less than 300. A line with three zeros, i.e., \"0 0 0\", represents the end of the input. You can assume\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1238_5010193","code_snippet":"#include<iostream>\n#include<cstdio>\n#include<cstring>\nusing namespace std;\n\nconst int N = 2010;\nint fa[N], siz[N], a[N], f[N][N], pre[N][N], ans[N], b[N], c[N]; \nbool vis[N], in[N];\nint findfa(int x) {\n\treturn fa[x] == x ? x : fa[x] = findfa(fa[x]);\n}\n\nvoid merge(int x, int y) {\n\tx = findfa(x); y = findfa(y);\n\tif (x == y) return ;\n\tfa[x] = y; siz[y] += siz[x];\n}\n\nint main() {\n\tint n, p1, p2, m;\n\twhile (~scanf(\"%d%d%d\", &n, &p1, &p2) && (n | p1 | p2)) {\n\t\tmemset(f, 0, sizeof(f));\n\t\tmemset(vis, 0, sizeof(vis));\n\t\tmemset(in, 0, sizeof(in));\n\t\tmemset(pre, 0, sizeof(pre));\n\t\tm = p1 + p2;\n\t\tfor (int i = 1; i <= m * 2; i++) fa[i] = i;\n\t\tfor (int i = 1; i <= m; i++) siz[i] = 1, siz[i + m] = 0;\n\t\tfor (int i = 1, x, y; i <= n; i++) {\n\t\t\tchar s[10];\n\t\t\tscanf(\"%d%d%s\", &x, &y, s);\n\t\t\tif (s[0] == 'y') merge(x, y), merge(x + m, y + m);\n\t\t\telse merge(x + m, y), merge(x, y + m);\n\t\t}\n\t\tint cnt = 0;\n\t\tfor (int i = 1; i <= m; i++) {\n\t\t\tint x = findfa(i), y = findfa(i + m);\n\t\t\tif (vis[x] || vis[y]) continue ;\n\t\t\ta[++cnt] = x; b[cnt] = y;\n\t\t\tvis[x] = vis[y] = 1;\n\t\t}\n//\t\tfor (int i = 1; i <= cnt; i++)\n//\t\t\tprintf(\"%d%c\", a[i], \" \\n\"[i == cnt]);\n//\t\tfor (int i = 1; i <= cnt; i++)\n//\t\t\tprintf(\"%d%c\", b[i], \" \\n\"[i == cnt]);\n\t\tf[0][0] = 1;\n\t\tfor (int i = 1; i <= cnt; i++)\n\t\t\tfor (int j = 0; j <= m; j++) \n\t\t\t\tif (f[i - 1][j]) {\n\t\t\t\t\tf[i][j + siz[a[i]]] += f[i - 1][j], pre[i][j + siz[a[i]]] = j;\n\t\t\t\t\tf[i][j + siz[b[i]]] += f[i - 1][j], pre[i][j + siz[b[i]]] = j;\n\t\t\t\t}\n\t\tif (p1 == p2) puts(\"no\");\n\t\telse {\n\t\t\tif (f[cnt][p1] == 1) {\n\t\t\t\tint k = 0, s = p1;\n\t\t\t\tfor (int i = cnt; i >= 1; i--)\n\t\t\t\t\tif (s - siz[a[i]] == pre[i][s]) in[a[i]] = 1, s -= siz[a[i]];\n\t\t\t\t\telse in[b[i]] = 1, s -= siz[b[i]];\n//\t\t\t\tfor (int i = 1; i <= m; i++)\n//\t\t\t\t\tprintf(\"%d%c\", findfa(i), \" \\n\"[i == m]);\n//\t\t\t\tfor (int i = 1; i <= m * 2; i++)\n//\t\t\t\t\tprintf(\"%d%c\", in[i], \" \\n\"[i == m * 2]);\n\t\t\t\tfor (int i = 1; i <= m; i++)\n\t\t\t\t\tif (in[findfa(i)]) ans[++k] = i;\n\t\t\t\tfor (int i = 1; i <= k; i++)\n\t\t\t\t\tprintf(\"%d\\n\", ans[i]);\n\t\t\t\tputs(\"end\");\n\t\t\t}\n\t\t\telse puts(\"no\");\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":40,"memory_kb":34724,"score_of_the_acc":-0.3854,"final_rank":9},{"submission_id":"aoj_1238_4591393","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define _GLIBCXX_DEBUG\n\nvector<int> P; // parent\nvector<int> divine; // 0:not_checked, 1:true, -1:lie\nmap<int, vector<int>> groups; // <根、葉>\nint m;\n\n// 未完成\n\nvoid init() {\n groups.clear();\n P = vector<int>(m + 1);\n divine = vector<int>(m + 1);\n for (int i = 1; i <= m; i++) {\n P[i] = i;\n groups[i].push_back(i);\n }\n}\nint root(int c) {\n if (P[c] == c)\n return c;\n return (P[c] = root(P[c]));\n}\nbool is_same_set(int a, int b) { return root(a) == root(b); }\n// 子のgroupに入っている要素を親のgroupに移し替える。\nvoid unite(int c, int p) {\n groups[root(p)].insert(groups[root(p)].end(), groups[root(c)].begin(),\n groups[root(c)].end());\n groups.erase(root(c));\n P[root(c)] = root(p);\n}\n// 結合して子になるグループのdivineをすべて裏返してから結合\nvoid r_unite(int c, int p) {\n for (int i : groups[root(c)]) {\n divine[i] *= -1;\n }\n unite(c, p);\n}\n\nint main() {\n int n, t, l;\n while (cin >> n >> t >> l) {\n if (!n && !t && !l)\n break;\n\n m = t + l;\n init();\n /* cout << m << endl; */\n // グループ分け\n for (int i = 0; i < n; i++) {\n int x, y;\n string a;\n cin >> x >> y >> a;\n int honest = (a == \"yes\") ? 1 : -1;\n if (x == y || is_same_set(x, y))\n continue;\n int reverse;\n if (divine[x]) {\n reverse = divine[x] * honest;\n } else {\n reverse = honest;\n divine[x] = 1;\n }\n assert(reverse != 0);\n if (divine[y] && reverse != divine[y])\n r_unite(y, x);\n else {\n unite(y, x);\n divine[y] = reverse;\n }\n assert(divine[y] != 0);\n }\n // test------------\n /* for (int i : groups[1]) { */\n /* cout << i << ' ' << divine[i] << endl; */\n /* } */\n //----------------\n map<int, pair<int, int>> pair_t_l; //<root of group, <truth_teller, liar>>\n for (auto group = groups.begin(); group != groups.end(); ++group) {\n int t_teller = 0, liar = 0;\n for (int i : group->second) {\n if (divine[i] == 1)\n t_teller++;\n // 言及されていない人は嘘つきとみなす。\n else { // bug:{}をつけないと行を加えたときにつけ忘れる。\n divine[i] = -1;\n liar++;\n }\n }\n /* cout << t_teller << ' ' << liar << endl; */\n pair_t_l[group->first] = make_pair(t_teller, liar);\n }\n\n int num_g = groups.size();\n vector<vector<int>> dp(\n num_g + 1,\n vector<int>(\n t + 1, 0)); // dp[i][j]:i個のグループでj人の正直者を何通りつくれるか\n vector<vector<set<int>>> p_rev(\n num_g + 1, vector<set<int>>(t + 1)); //裏返るグループを保存する配列\n int gc = 0;\n // 動的計画法\n for (auto P = pair_t_l.begin(); P != pair_t_l.end(); ++P) {\n gc++;\n pair<int, int> p = P->second; //<truth_teller, liar>\n /* // もし正直者と嘘つきの数が同じなら答えはnoなので抜ける */\n /* if (p.first == p.second) { */\n /* dp[num_g][t] = 10; */\n /* break; */\n /* } */\n if (gc == 1) {\n dp[gc][p.first]++;\n dp[gc][p.second]++;\n /* cout << p.second << endl; */\n if (p.second <= t)\n p_rev.at(gc).at(p.second).insert(P->first);\n }\n for (int j = 0; j <= t; j++) { // bug:jを1から始めるとt=0のとき間違う\n /* cout << gc << ' ' << j << ' ' << p.first << ' ' << p.second << ' ' */\n /* << dp[gc - 1][j] << endl; */\n if (p.first + j <= t) {\n dp[gc][p.first + j] += dp[gc - 1][j];\n if (dp[gc - 1][j]) {\n for (auto group : p_rev[gc - 1][j]) {\n p_rev[gc][p.first + j].insert(group);\n }\n }\n }\n if (p.second + j <= t) {\n dp[gc][p.second + j] += dp[gc - 1][j];\n /* assert(!(gc==2&&p.second+j==4)); */\n if (dp[gc - 1][j]) {\n for (auto group : p_rev[gc - 1][j]) {\n p_rev[gc][p.second + j].insert(group);\n }\n p_rev[gc][p.second + j].insert(P->first);\n }\n /* cout<<gc<<' '<<p.second+j<<' '<<dp[gc][p.second + j]<<endl; */\n }\n }\n }\n\n /* for (int i : divine) */\n /* cout << i << endl; */\n vector<int> ans;\n for (int group : p_rev[num_g][t]) {\n /* cout<<1<<endl; */\n /* assert(groups.count(1)==0); */\n for (int person : groups[group]) {\n divine[person] *= -1;\n }\n }\n for (auto group = groups.begin(); group != groups.end(); ++group) {\n /* cout << group->first << ' '; */\n for (int person : group->second) {\n /* cout << person << ' '; */\n if (divine[person] == 1)\n ans.push_back(person);\n }\n /* cout << endl; */\n }\n sort(ans.begin(), ans.end());\n /* cout << groups.size() << endl; */\n /* cout << root(24) << endl; */\n\n if (dp[num_g][t] != 1) {\n cout << \"no\" << endl;\n } else {\n for (int i : ans)\n cout << i << endl;\n cout << \"end\" << endl;\n }\n }\n}","accuracy":1,"time_ms":20,"memory_kb":14724,"score_of_the_acc":-0.1487,"final_rank":7},{"submission_id":"aoj_1238_2803088","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define int short\n\nusing vint = vector<int>;\n\nstruct edge {\n\tint to, kind;\n\tedge(){}\n\tedge(int to, int kind):to(to), kind(kind){}\n};\n\nusing Graph = vector<vector<edge> >;\n\nstruct UF {\n\tvint data;\n\tUF(){}\n\tvoid init(int n) {\n\t\tdata.clear();\n\t\tdata.resize(n, -1);\n\t}\n\tint find(int x) {\n\t\treturn data[x] < 0 ? x : data[x] = find(data[x]);\t \n\t}\n\tint size(int x) {\n\t\treturn -data[find(x)];\n\t}\n\tbool same(int x, int y) {\n\t\treturn find(x) == find(y);\n\t}\n\tvoid unite(int x, int y) {\n\t\tx = find(x), y = find(y);\n\t\tif(x == y) return;\n\t\tif(data[x] > data[y]) swap(x, y);\n\t\tdata[x] += data[y];\n\t\tdata[y] = x;\n\t}\n};\n\nint Q, A, B, N;\nGraph graph;\nGraph rgraph;\nUF uf;\n\nvint col[2];\nvint divines[2];\n\nvoid fillcolor(int s, int c) {\n\tqueue<int> que;\n\tque.push(s);\n\tcol[c][s] = c;\n\tif(!c) ++divines[c][s];\n\twhile(!que.empty()) {\n\t\tint u = que.front(); que.pop();\n\t\tfor(edge e : graph[u]) {\n\t\t\tif(col[c][e.to] == -1) {\n\t\t\t\tque.push(e.to);\n\t\t\t\tcol[c][e.to] = col[c][u]^e.kind;\n\t\t\t\tif(!col[c][e.to]) ++divines[c][s];\n\t\t\t} else if(col[c][e.to] != (col[c][u]^e.kind)) {\n\t\t\t\tdivines[c][s] = -1;\t\t\t\t\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t\tfor(edge e : rgraph[u]) {\n\t\t\tif(col[c][e.to] == -1) {\n\t\t\t\tque.push(e.to);\n\t\t\t\tcol[c][e.to] = col[c][u]^e.kind;\n\t\t\t\tif(!col[c][e.to]) ++divines[c][s];\t\t\t\t\n\t\t\t} else if(col[c][e.to] != (col[c][u]^e.kind)) {\n\t\t\t\tdivines[c][s] = -1;\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t}\n\t//cout << s << \" \" << c << \" \" << divines[c][s] << endl;\n}\n\nvoid init() {\n\tgraph.clear();\n\tgraph.resize(N);\n\trgraph.clear();\n\trgraph.resize(N);\n\tcol[0].clear();\n\tcol[0].resize(N, -1);\n\tcol[1].clear();\n\tcol[1].resize(N, -1);\n\tdivines[0].clear();\n\tdivines[0].resize(N);\n\tdivines[1].clear();\n\tdivines[1].resize(N);\n\tuf.init(N);\n}\n\nusing Pi = pair<int, int>;\n\n//int dp[303][303][303];\nPi rev[303][303][303];\n\nsigned main() {\n\twhile(cin >> Q >> A >> B, Q || A || B) {\n\t\tN = A + B;\t\t\n\t\tinit();\n\t\tfor(int i = 0; i < Q; ++i) {\n\t\t\tint a, b;\n\t\t\tstring s;\n\t\t\tcin >> a >> b >> s;\n\t\t\t--a, --b;\n\t\t\tgraph[a].emplace_back(b, s == \"no\");\n\t\t\trgraph[b].emplace_back(a, s == \"no\");\n\t\t\tuf.unite(a, b);\n\t\t}\n\t\t//map<int, int> mp;\n\t\tvint mp(N);\n\t\tint sz = 0;\n\t\tfor(int i = 0; i < N; ++i) {\n\t\t\tif(uf.find(i) != i) continue;\n\t\t\tmp[sz++] = i;\n\t\t\tfor(int j = 0; j < 2; ++j) {\n\t\t\t\tfillcolor(i, j);\n\t\t\t}\n\t\t}\n\t\tfor(int i = 0; i < 303; ++i) {\n\t\t\tfor(int j = 0; j < 303; ++j) {\n\t\t\t\tfor(int k = 0; k < 303; ++k) {\n\t\t\t\t\t//dp[i][j][k] = 0;\n\t\t\t\t\trev[i][j][k] = Pi(-2, -2);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t//dp[0][0][0] = 1;\n\t\trev[0][0][0] = Pi(-1, -1);\n\t\tfor(int i = 0; i < sz; ++i) {\n\t\t\tfor(int j = 0; j <= A; ++j) {\n\t\t\t\tfor(int k = 0; k <= B; ++k) {\n\t\t\t\t\t//if(!dp[i][j][k]) continue;\n\t\t\t\t\tif(rev[i][j][k].first == -2) continue;\t\t\t\t\t\n\t\t\t\t\tfor(int l = 0; l < 2; ++l) {\n\t\t\t\t\t\tif(divines[l][mp[i]] == -1) continue;\n\t\t\t\t\t\tint x = divines[l][mp[i]];\n\t\t\t\t\t\tint y = uf.size(mp[i])-x;\n\t\t\t\t\t\tif(j+x > A || k+y > B) continue;\n\t\t\t\t\t\t//if(!dp[i+1][j+x][k+y]) {\n\t\t\t\t\t\tif(rev[i+1][j+x][k+y].first == -2) {\n\t\t\t\t\t\t\t//dp[i+1][j+x][k+y] = 1;\n\t\t\t\t\t\t\trev[i+1][j+x][k+y] = Pi(mp[i], l);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t//dp[i+1][j+x][k+y] = 2;\n\t\t\t\t\t\t\trev[i+1][j+x][k+y] = Pi(-1, -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\t//if(dp[sz][A][B] != 1) {\n\t\tif(rev[sz][A][B].first < 0) {\t\t\n\t\t\tcout << \"no\" << endl;\n\t\t\tcontinue;\n\t\t} else {\n\t\t\tvint ans;\n\t\t\tint a = A, b = B;\n\t\t\tfor(int i = sz; i > 0; --i) {\n\t\t\t\tPi p = rev[i][a][b];\n\t\t\t\tfor(int j = 0; j < N; ++j) {\n\t\t\t\t\tif(uf.find(j) != p.first) continue;\n\t\t\t\t\tif(!col[p.second][j]) ans.push_back(j);\n\t\t\t\t}\n\t\t\t\ta -= divines[p.second][p.first];\n\t\t\t\tb -= (uf.size(p.first)-divines[p.second][p.first]);\n\t\t\t}\n\t\t\tsort(ans.begin(), ans.end());\n\t\t\tfor(int id : ans) cout << id+1 << endl;\n\t\t\tcout << \"end\" << endl;\n\t\t}\n\t}\n\t\n\treturn 0;\n}","accuracy":1,"time_ms":370,"memory_kb":111736,"score_of_the_acc":-1.9997,"final_rank":12},{"submission_id":"aoj_1238_2802955","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define int short\n\nusing vint = vector<int>;\n\nstruct edge {\n\tint to, kind;\n\tedge(){}\n\tedge(int to, int kind):to(to), kind(kind){}\n};\n\nusing Graph = vector<vector<edge> >;\n\nstruct UF {\n\tvint data;\n\tUF(){}\n\tvoid init(int n) {\n\t\tdata.clear();\n\t\tdata.resize(n, -1);\n\t}\n\tint find(int x) {\n\t\treturn data[x] < 0 ? x : data[x] = find(data[x]);\t \n\t}\n\tint size(int x) {\n\t\treturn -data[find(x)];\n\t}\n\tbool same(int x, int y) {\n\t\treturn find(x) == find(y);\n\t}\n\tvoid unite(int x, int y) {\n\t\tx = find(x), y = find(y);\n\t\tif(x == y) return;\n\t\tif(data[x] > data[y]) swap(x, y);\n\t\tdata[x] += data[y];\n\t\tdata[y] = x;\n\t}\n};\n\nint Q, A, B, N;\nGraph graph;\nGraph rgraph;\nUF uf;\n\nvint col[2];\nvint divines[2];\n\nvoid fillcolor(int s, int c) {\n\tqueue<int> que;\n\tque.push(s);\n\tcol[c][s] = c;\n\tif(!c) ++divines[c][s];\n\twhile(!que.empty()) {\n\t\tint u = que.front(); que.pop();\n\t\tfor(edge e : graph[u]) {\n\t\t\tif(col[c][e.to] == -1) {\n\t\t\t\tque.push(e.to);\n\t\t\t\tcol[c][e.to] = col[c][u]^e.kind;\n\t\t\t\tif(!col[c][e.to]) ++divines[c][s];\n\t\t\t} else if(col[c][e.to] != (col[c][u]^e.kind)) {\n\t\t\t\tdivines[c][s] = -1;\t\t\t\t\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t\tfor(edge e : rgraph[u]) {\n\t\t\tif(col[c][e.to] == -1) {\n\t\t\t\tque.push(e.to);\n\t\t\t\tcol[c][e.to] = col[c][u]^e.kind;\n\t\t\t\tif(!col[c][e.to]) ++divines[c][s];\t\t\t\t\n\t\t\t} else if(col[c][e.to] != (col[c][u]^e.kind)) {\n\t\t\t\tdivines[c][s] = -1;\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t}\n\t//cout << s << \" \" << c << \" \" << divines[c][s] << endl;\n}\n\nvoid init() {\n\tgraph.clear();\n\tgraph.resize(N);\n\trgraph.clear();\n\trgraph.resize(N);\n\tcol[0].clear();\n\tcol[0].resize(N, -1);\n\tcol[1].clear();\n\tcol[1].resize(N, -1);\n\tdivines[0].clear();\n\tdivines[0].resize(N);\n\tdivines[1].clear();\n\tdivines[1].resize(N);\n\tuf.init(N);\n}\n\nusing Pi = pair<int, int>;\n\n//int dp[303][303][303];\nPi rev[303][303][303];\n\nsigned main() {\n\twhile(cin >> Q >> A >> B, Q || A || B) {\n\t\tN = A + B;\t\t\n\t\tinit();\n\t\tfor(int i = 0; i < Q; ++i) {\n\t\t\tint a, b;\n\t\t\tstring s;\n\t\t\tcin >> a >> b >> s;\n\t\t\t--a, --b;\n\t\t\tgraph[a].emplace_back(b, s == \"no\");\n\t\t\trgraph[b].emplace_back(a, s == \"no\");\n\t\t\tuf.unite(a, b);\n\t\t}\n\t\t//map<int, int> mp;\n\t\tvint mp(N);\n\t\tint sz = 0;\n\t\tfor(int i = 0; i < N; ++i) {\n\t\t\tif(uf.find(i) != i) continue;\n\t\t\tmp[sz++] = i;\n\t\t\tfor(int j = 0; j < 2; ++j) {\n\t\t\t\tfillcolor(i, j);\n\t\t\t}\n\t\t}\n\t\tfor(int i = 0; i < 303; ++i) {\n\t\t\tfor(int j = 0; j < 303; ++j) {\n\t\t\t\tfor(int k = 0; k < 303; ++k) {\n\t\t\t\t\t//dp[i][j][k] = 0;\n\t\t\t\t\trev[i][j][k] = Pi(-2, -2);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t//dp[0][0][0] = 1;\n\t\trev[0][0][0] = Pi(-1, -1);\n\t\tfor(int i = 0; i < sz; ++i) {\n\t\t\tfor(int j = 0; j <= A; ++j) {\n\t\t\t\tfor(int k = 0; k <= B; ++k) {\n\t\t\t\t\t//if(!dp[i][j][k]) continue;\n\t\t\t\t\tif(rev[i][j][k].first == -2) continue;\t\t\t\t\t\n\t\t\t\t\tfor(int l = 0; l < 2; ++l) {\n\t\t\t\t\t\tif(divines[l][mp[i]] == -1) continue;\n\t\t\t\t\t\tint x = divines[l][mp[i]];\n\t\t\t\t\t\tint y = uf.size(mp[i])-x;\n\t\t\t\t\t\tif(j+x > A || k+y > B) continue;\n\t\t\t\t\t\t//if(!dp[i+1][j+x][k+y]) {\n\t\t\t\t\t\tif(rev[i+1][j+x][k+y].first == -2) {\n\t\t\t\t\t\t\t//dp[i+1][j+x][k+y] = 1;\n\t\t\t\t\t\t\trev[i+1][j+x][k+y] = Pi(mp[i], l);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t//dp[i+1][j+x][k+y] = 2;\n\t\t\t\t\t\t\trev[i+1][j+x][k+y] = Pi(-1, -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\t//if(dp[sz][A][B] != 1) {\n\t\tif(rev[sz][A][B].first < 0) {\t\t\n\t\t\tcout << \"no\" << endl;\n\t\t\tcontinue;\n\t\t} else {\n\t\t\tvint ans;\n\t\t\tint a = A, b = B;\n\t\t\tfor(int i = sz; i > 0; --i) {\n\t\t\t\tPi p = rev[i][a][b];\n\t\t\t\tfor(int j = 0; j < N; ++j) {\n\t\t\t\t\tif(uf.find(j) != p.first) continue;\n\t\t\t\t\tif(!col[p.second][j]) ans.push_back(j);\n\t\t\t\t}\n\t\t\t\ta -= divines[p.second][p.first];\n\t\t\t\tb -= (uf.size(p.first)-divines[p.second][p.first]);\n\t\t\t}\n\t\t\tsort(ans.begin(), ans.end());\n\t\t\tfor(int id : ans) cout << id+1 << endl;\n\t\t\tcout << \"end\" << endl;\n\t\t}\n\t}\n\t\n\treturn 0;\n}","accuracy":1,"time_ms":360,"memory_kb":111768,"score_of_the_acc":-1.9722,"final_rank":11},{"submission_id":"aoj_1238_2660712","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define FOR(i,a,b) for (int i=(a);i<(b);i++)\n#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)\n#define REP(i,n) for (int i=0;i<(n);i++)\n#define RREP(i,n) for (int i=(n)-1;i>=0;i--)\ntypedef long long LL;\n//??°????????¨\n#define MAX_N 800\ntypedef pair<int,int>P;\nvector<P>G[MAX_N];\n\nbool used[MAX_N];\nvector<int> color[2][MAX_N+1];\n\nvoid init(){\n\tREP(i,MAX_N){\n\t\tG[i].clear();\n\t\tused[i]=false;\n\t\tcolor[0][i].clear();\n\t\tcolor[1][i].clear();\n\t}\n}\n\nvoid biparate(int v,int num,int c){\n\tif(used[v]==true)return;\n\tused[v]=true;\n\tcolor[c][num].push_back(v);\n\tREP(i,G[v].size()){\n\t\tbiparate(G[v][i].first,num,(c+G[v][i].second)%2);\n\t}\n}\n\n#define NONE 0\n#define UNI 1\n#define MUL 2\n\nint main(){\n\tint n,p1,p2;\n\twhile(cin>>n>>p1>>p2,n+p1+p2){\n\t\tinit();\n\t\tREP(i,n){\n\t\t\tint x,y;\n\t\t\tstring s;\n\t\t\tcin>>x>>y>>s;\n\t\t\tx--;y--;\n\t\t\tint z=0;\n\t\t\tif(s==\"no\")z=1;//no????????¢\n\t\t\tG[x].push_back(P(y,z));\n\t\t\tG[y].push_back(P(x,z));\n\t\t}\n\t\t//?????¨??°??????\n\t\t{\n\t\t\tint num=0;\n\t\t\tREP(i,p1+p2){\n\t\t\t\tif(used[i]==false){\n\t\t\t\t\tbiparate(i,num,0);\n\t\t\t\t\tnum++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t//??????????????????\n\t\tvector<int>np[MAX_N+2];\n\t\t//vector<vector<int>>back(MAX_N);\n\t\tREP(i,MAX_N+1){\n\t\t\tnp[0].push_back(NONE);\n\t\t}\n\t\tnp[0][0]=UNI;\n\t\tREP(i,MAX_N){\n\t\t\tif((color[0][i].size()==0)&&(color[1][i].size()==0)){\n\t\t\t\tnp[i+1]=np[i];\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tREP(j,MAX_N+1){\n\t\t\t\tnp[i+1].push_back(NONE);\n\t\t\t}\n\t\t\tREP(j,MAX_N){\n\t\t\t\t//0?????\\??????\n\t\t\t\tif(np[i][j]==UNI){\n\t\t\t\t\tif(np[i+1][j+color[0][i].size()]==NONE){\n\t\t\t\t\t\tnp[i+1][j+color[0][i].size()]=UNI;\n\t\t\t\t\t}else{\n\t\t\t\t\t\t//if(color[0][i].size()!=0)\n\t\t\t\t\t\tnp[i+1][j+color[0][i].size()]=MUL;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(np[i][j]==MUL){\n\t\t\t\t\tnp[i+1][j+color[0][i].size()]=MUL;\n\t\t\t\t}\n\t\t\t\t//1?????\\??????\n\t\t\t\tif(np[i][j]==UNI){\n\t\t\t\t\tif(np[i+1][j+color[1][i].size()]==NONE){\n\t\t\t\t\t\tnp[i+1][j+color[1][i].size()]=UNI;\n\t\t\t\t\t}else{\n\t\t\t\t\t\t//if(color[1][i].size()!=0)\n\t\t\t\t\t\tnp[i+1][j+color[1][i].size()]=MUL;\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\tif(np[i][j]==MUL){\n\t\t\t\t\tnp[i+1][j+color[1][i].size()]=MUL;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\t\n\t\tif(np[MAX_N][p1]==UNI){\n\t\t\tvector<int>ans;\n\t\t\tint now=p1;\n\t\t\tfor(int i=MAX_N;i>=0;i--){\n\t\t\t\tif((color[0][i].size()==0)&&(color[1][i].size()==0))continue;\n\t\t\t\t//cout<<now<<endl;\n\t\t\t\tif(np[i][now-color[0][i].size()]==1){\n\t\t\t\t\tREP(j,color[0][i].size()){\n\t\t\t\t\t\tans.push_back(color[0][i][j]);\n\t\t\t\t\t}\n\t\t\t\t\tnow-=color[0][i].size();\n\t\t\t\t}else{\n\t\t\t\t\tREP(j,color[1][i].size()){\n\t\t\t\t\t\tans.push_back(color[1][i][j]);\n\t\t\t\t\t}\n\t\t\t\t\tnow-=color[1][i].size();\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\tsort(ans.begin(),ans.end());\n\t\t\tREP(i,ans.size()){\n\t\t\t\tcout<<ans[i]+1<<endl;\n\t\t\t}\n\t\t\tcout<<\"end\"<<endl;\n\t\t}else if(np[MAX_N][p2]==UNI){\n\t\t vector<int>ans;\n\t\t\tint now=p2;\n\t\t\tfor(int i=MAX_N;i>=0;i--){\n\t\t\t\tif((color[0][i].size()==0)&&(color[1][i].size()==0))continue;\n\t\t\t\t//cout<<now<<endl;\n\t\t\t\tif(np[i][now-color[0][i].size()]==1){\n\t\t\t\t\tREP(j,color[1][i].size()){\n\t\t\t\t\t\tans.push_back(color[1][i][j]);\n\t\t\t\t\t}\n\t\t\t\t\tnow-=color[0][i].size();\n\t\t\t\t}else{\n\t\t\t\t\tREP(j,color[0][i].size()){\n\t\t\t\t\t\tans.push_back(color[0][i][j]);\n\t\t\t\t\t}\n\t\t\t\t\tnow-=color[1][i].size();\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\tsort(ans.begin(),ans.end());\n\t\t\tREP(i,ans.size()){\n\t\t\t\tcout<<ans[i]+1<<endl;\n\t\t\t}\n\t\t\t\n\t\t\tcout<<\"end\"<<endl;\n\t\t}else{\n\t\t\tcout<<\"no\"<<endl;\n\t\t}\n\t\t\n\t}\n}","accuracy":1,"time_ms":10,"memory_kb":5676,"score_of_the_acc":-0.039,"final_rank":3},{"submission_id":"aoj_1238_2628577","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing pii = pair<int, int>;\n\nstruct edge {\n int to;\n bool yes;\n};\n\nusing edges = vector<edge>;\nusing graph = vector<edges>;\n\n// (divine, devilish)\npii dfs(graph const& g, int v, bool divine, vector<bool>& checked) {\n auto res = make_pair((int)divine, (int)!divine);\n checked[v] = true;\n for(auto& e : g[v]) {\n if(checked[e.to]) {\n continue;\n }\n bool next_state = (divine && e.yes || !divine && !e.yes);\n auto t = dfs(g, e.to, next_state, checked);\n res.first += t.first;\n res.second += t.second;\n }\n return res;\n}\n\nvoid determine(graph const& g, int v, bool divine, vector<int>& res) {\n res[v] = divine;\n for(auto& e : g[v]) {\n if(res[e.to] != -1) {\n continue;\n }\n bool next_state = (divine && e.yes || !divine && !e.yes);\n determine(g, e.to, next_state, res);\n }\n}\n\nstruct data {\n int person_id;\n bool divine;\n pii each_num; // (divine, devilish)\n data() : person_id(-1), divine(false), each_num(make_pair(0, 0))\n {}\n};\n\nint main() {\n int n, p1, p2;\n while(cin >> n >> p1 >> p2, n || p1 || p2) {\n graph g(p1 + p2);\n if(n == 0) {\n if(p2 == 0) {\n for(int i = 1; i <= p1 + p2; ++i) {\n cout << i << endl;\n }\n } else if(p1 != 0) {\n cout << \"no\" << endl;\n continue;\n }\n cout << \"end\" << endl;\n continue;\n }\n for(int i = 0; i < n; ++i) {\n int x, y;\n string a;\n cin >> x >> y >> a;\n g[x - 1].push_back(edge{y - 1, a == \"yes\"});\n g[y - 1].push_back(edge{x - 1, a == \"yes\"});\n }\n vector<vector<vector<data>>> dp(1, vector<vector<data>>(p1 + 1, vector<data>(p2 + 1)));\n dp[0][0][0].person_id = 0;\n vector<bool> checked(p1 + p2);\n for(int i = 0; i < p1 + p2; ++i) {\n auto now = dp.back();\n vector<vector<data>> nxt(p1 + 1, vector<data>(p2 + 1));\n if(!checked[i]) {\n for(int b = 0; b <= 1; ++b) {\n data d;\n d.person_id = i;\n d.divine = b;\n auto checked2 = checked;\n d.each_num = dfs(g, i, b, checked);\n if(b == 0) {\n checked = checked2; // restore\n }\n for(int j = 0; j <= p1; ++j) {\n for(int k = 0; k <= p2; ++k) {\n if(now[j][k].person_id == -1) {\n continue;\n }\n int nj = j + d.each_num.first, nk = k + d.each_num.second;\n if(nj > p1 || nk > p2 || nxt[nj][nk].person_id == -2) {\n continue;\n }\n if(nxt[nj][nk].person_id >= 0 || now[j][k].person_id == -2) { // ambiguous\n nxt[nj][nk].person_id = -2;\n continue;\n }\n nxt[nj][nk] = d;\n }\n }\n }\n dp.push_back(move(nxt));\n }\n }\n auto now = dp.back()[p1][p2];\n if(now.person_id < 0) {\n cout << \"no\" << endl;\n } else {\n vector<int> res(p1 + p2, -1);\n int P1 = p1, P2 = p2;\n for(int i = dp.size() - 1; i > 0; --i) {\n auto d = dp[i][P1][P2];\n determine(g, d.person_id, d.divine, res);\n P1 -= d.each_num.first;\n P2 -= d.each_num.second;\n }\n for(int i = 0; i < p1 + p2; ++i) {\n if(res[i] == 1) {\n cout << i + 1 << endl;\n }\n }\n cout << \"end\" << endl;\n }\n }\n}","accuracy":1,"time_ms":150,"memory_kb":22876,"score_of_the_acc":-0.5837,"final_rank":10},{"submission_id":"aoj_1238_1822961","code_snippet":"#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\nusing ld = long double;\ntemplate<class T>\nusing Table = vector<vector<T>>;\nconst ld eps=1e-9;\n\n//// < \"D:\\D_Download\\Visual Studio 2015\\Projects\\programing_contest_c++\\Debug\\a.txt\"\n\n\nstruct edge {\n int from;\n int to;\n bool same;\n edge(int f, int t, bool s):from(f), to(t), same(s) {\n\n }\n /*bool operator ==(edge &e) {\n return from == e.from&&to == e.to&&same == e.same;\n }*/\n};\n\nvector<int>types;\nvector<vector<edge>>edges;\npair<vector<int>, vector<int>>dfs(const int now,const bool div) {\n types[now] = div;\n pair<vector<int>, vector<int>>apair;\n if (div)apair.first.push_back(now);\n else apair.second.push_back(now);\n for (auto e : edges[now]) {\n if (types[e.to] == -1) {\n const bool tdiv = e.same ? div : !div;\n auto p(dfs(e.to, tdiv));\n apair.first.insert(apair.first.end(), p.first.begin(), p.first.end());\n apair.second.insert(apair.second.end(), p.second.begin(), p.second.end());\n }\n }\n return apair;\n}\nstruct d{\n int num;\n vector<bool>his;\n d() :num(0), his() {\n\n }\n};\nint main() {\n while (1) {\n edges.clear();\n types.clear();\n int N, P, Q; cin >> N >> P >> Q;\n if (!N&&!P&&!Q)break;\n edges.resize(P+Q);\n types.resize(P + Q);\n fill(types.begin(), types.end(), -1);\n vector<vector<int>>gyou(P + Q, vector<int>(P + Q, -1));\n for (int i = 0; i < N; ++i) {\n int x, y; string a; cin >> x >> y >> a;\n x--; y--;\n if (x == y)continue;\n bool same = a == \"yes\";\n gyou[x][y] = same;\n gyou[y][x] = same;\n\n }\n for (int i = 0; i < P + Q; ++i) {\n for (int j = 0; j < P + Q; ++j) {\n if (gyou[i][j] != -1) {\n edges[i].push_back(edge(i, j, gyou[i][j]));\n }\n }\n }\n vector<pair<vector<int>, vector<int>>>ps;\n for (int i = 0; i < P + Q; ++i) {\n if (types[i] == -1) {\n auto p = dfs(i, true);\n ps.push_back(p);\n }\n }\n //dp[???][?\\???°]\n vector<vector<d>>dp(ps.size() + 1, vector<d>(P + Q +1));\n dp[0][0].num = 1;\n for (int t = 0; t < ps.size(); ++t) {\n for (int dnum = 0; dnum <= P + Q; ++dnum) {\n if (dp[t][dnum].num) {\n for (int i = 0; i < 2; ++i) {\n const int nextdnum = (!i)?dnum + ps[t].first.size():dnum+ps[t].second.size();\n vector<bool>nexthis(dp[t][dnum].his);\n nexthis.push_back(!i);\n dp[t + 1][nextdnum].num+=dp[t][dnum].num;\n if (dp[t + 1][nextdnum].num == 1) {\n dp[t + 1][nextdnum].his = nexthis;\n }\n }\n \n }\n }\n }\n if (dp[ps.size()][P].num == 1) {\n set<int>divs;\n vector<bool>his(dp[ps.size()][P].his);\n for (int t = 0; t < ps.size(); ++t) {\n vector<int>v;\n if (his[t]) {\n v = ps[t].first;\n }\n else {\n v = ps[t].second;\n }\n for (auto n : v) {\n divs.emplace(n);\n }\n }\n for (auto d : divs) {\n cout << d + 1 << endl;\n }\n cout << \"end\" << endl;\n }\n else {\n cout << \"no\" << endl;\n }\n \n }\n \n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":6244,"score_of_the_acc":-0.0441,"final_rank":4},{"submission_id":"aoj_1238_1531341","code_snippet":"#include<iostream>\n#include<vector>\n#include<bitset>\n\nusing namespace std;\n\nvector<int> edges[623][2];\nbool used[623];\nunsigned valid[623][623];\nbitset<623> dp[623][623];\nint dpx;\nint temp[623];\n\nvoid rec(int v,int p,int d){\n if(temp[v]){\n if(temp[v]!=d)throw -1;\n }else{\n temp[v]=d;\n for(int i=0;i<2;i++){\n for(auto e:edges[v][i]){\n\tif(v==p)continue;\n\trec(e,v,(i?1:-1)*d);\n }\n }\n }\n}\n\nvoid srec(int v,int p){\n if(!used[v]++){\n for(int i=0;i<2;i++){\n for(auto e:edges[v][i]){\n\tif(e==p)continue;\n\tsrec(e,v);\n }\n }\n }\n}\n\nbitset<623> record;\n\nvoid dodp(int v){\n for(int i=0;i<2;i++){\n fill(begin(temp),end(temp),0);\n try{\n rec(v,-1,i?1:-1);\n bitset<623> r;\n for(int i=0;i<623;i++){\n\tr[i]=temp[i]==1;\n }\n int ndiv=r.count();\n for(int j=600;j-ndiv>=0;j--){\n\tif(valid[dpx][j-ndiv]){\n\t if(valid[dpx+1][j]==0&&valid[dpx][j-ndiv]==1){\n\t valid[dpx+1][j]=1;\n\t dp[dpx+1][j]=dp[dpx][j-ndiv]|r;\n\t }else{\n\t valid[dpx+1][j]=2;\n\t }\n\t}\n }\n }catch(...){}\n }\n srec(v,-1);\n dpx++;\n}\n\nint main(){\n for(int n,p1,p2;cin>>n>>p1>>p2,n|p1|p2;){\n for(auto &e:edges){\n for(auto &f:e){\n\tf.clear();\n }\n }\n fill(begin(used),end(used),false);\n fill(valid[0],valid[623],0);\n while(n--){\n int x,y;\n char a[9];\n cin>>x>>y>>a;\n edges[x][a[0]=='y'].push_back(y);\n edges[y][a[0]=='y'].push_back(x);\n }\n valid[0][0]=1;\n dpx=0;\n for(int i=1;i<=p1+p2;i++){\n if(!used[i]){\n\tdodp(i);\n }\n }\n if(valid[dpx][p1]!=1){\n cout<<\"no\"<<endl;\n }else{\n for(int i=1;i<=p1+p2;i++){\n\tif(dp[dpx][p1][i]){\n\t cout<<i<<endl;\n\t}\n }\n cout<<\"end\"<<endl;\n }\n }\n}","accuracy":1,"time_ms":10,"memory_kb":33124,"score_of_the_acc":-0.2876,"final_rank":8},{"submission_id":"aoj_1238_1175150","code_snippet":"#include <string> \n#include <algorithm> \n#include <cfloat> \n#include <climits> \n#include <cmath> \n#include <complex> \n#include <cstdio> \n#include <cstdlib> \n#include <cstring> \n#include <functional> \n#include <iostream> \n#include <map> \n#include <memory> \n#include <queue> \n#include <set> \n#include <sstream> \n#include <stack> \n#include <utility> \n#include <vector> \n\n#define EACH(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)\n#define ALL(x) (x).begin(),(x).end() \ntypedef long long ll;\nusing namespace std; \nconst double eps = 1e-10;\n\nstruct UnionFind{\n vector<int> parent, rank;\n UnionFind(int n){ parent = vector<int>(n, -1); rank = vector<int>(n, 0); }\n int find(int x){\n if(parent[x] == -1) return x;\n else return (parent[x] = find(parent[x]));\n }\n bool unite(int x, int y){\n x = find(x);\n y = find(y);\n if(x == y) return false;\n if(rank[x] < rank[y])\n parent[x] = y;\n else\n parent[y] = x;\n if(rank[x] == rank[y])\n ++rank[x];\n return true;\n }\n bool same(int x, int y){\n return find(x) == find(y);\n }\n};\n\nint dp[1010][1010], lst[1010][1010];\nint main(){\n for(;;){\n int n, p1, p2;\n cin >> n >> p1 >> p2;\n if(n == 0 && p1 == 0 && p2==0) return 0;\n int m = p1 + p2;\n UnionFind uf(2 * m);\n for(int i=0;i<n;++i){\n int x, y;\n string s;\n cin >> x >> y >> s;\n --x; --y;\n if(s == \"yes\"){\n uf.unite(x, y);\n uf.unite(x+m, y+m);\n }\n else{\n uf.unite(x, y+m);\n uf.unite(x+m, y);\n }\n }\n map<int, int> mp;\n vector<int> v, w, z;\n map<int, vector<int> > va, vb;\n for(int i=0;i<m;++i){\n int a = uf.find(i);\n int b = uf.find(i + m);\n if(mp.find(a) != mp.end()){\n int pp = mp[a];\n if(a == uf.find(pp))\n va[pp].push_back(i);\n else\n vb[pp].push_back(i);\n }\n else{\n mp[a] = mp[b] = i;\n va[i].push_back(i);\n }\n }\n EACH(i, va){\n v.push_back(i->second.size());\n w.push_back(vb[i->first].size());\n z.push_back(i->first);\n }\n memset(dp, 0, sizeof(dp));\n memset(lst, -1, sizeof(lst));\n dp[0][0] = 1;\n for(int i=0;i<v.size();++i){\n for(int j=0;j<=m;++j){\n if(j >= v[i]){\n dp[i+1][j] += dp[i][j-v[i]];\n if(dp[i][j-v[i]])lst[i+1][j] = j-v[i];\n }\n if(j >= w[i]){\n dp[i+1][j] += dp[i][j-w[i]];\n if(dp[i][j-w[i]])lst[i+1][j] = j-w[i];\n }\n }\n }\n /*\n cout << p1 << endl;\n for(int i=0;i<=3;++i){\n for(int j=0;j<=4;++j){cout.width(3); cout << lst[i][j];}\n cout << endl;\n }\n */\n if(dp[(int)v.size()][p1] != 1)\n cout << \"no\" << endl;\n else{\n vector<int> f(m);\n int num = p1;\n for(int i=v.size()-1;i>=0;--i){\n int bnum = lst[i+1][num];\n if(bnum+v[i] == num){\n EACH(j, va[z[i]]) f[*j] = 1;\n }\n else{\n EACH(j, vb[z[i]]) f[*j] = 1;\n }\n num = bnum;\n }\n for(int i=0;i<m;++i){\n if(f[i]) cout << i+1 << endl;\n }\n cout << \"end\" << endl;\n }\n }\n}","accuracy":1,"time_ms":10,"memory_kb":9264,"score_of_the_acc":-0.0715,"final_rank":6},{"submission_id":"aoj_1238_1105932","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nclass UnionFind {\nprivate:\n vector<int> par, rank;\npublic:\n UnionFind(int n) {\n par = rank = vector<int>(n);\n for(int i = 0; i < n; ++i) par[i] = i;\n }\n\n int find(int x) {\n return par[x] == x ? x : par[x] = find(par[x]);\n }\n\n bool same(int x, int y) {\n return find(x) == find(y);\n }\n\n void unite(int x, int y) {\n x = find(x);\n y = find(y);\n if(x == y) return;\n if(rank[x] < rank[y]) {\n par[x] = y;\n } else {\n par[y] = x;\n if(rank[x] == rank[y]) ++rank[x];\n }\n }\n};\n\nint main() {\n for(int n, p1, p2; cin >> n >> p1 >> p2 && (n|p1|p2); ) {\n int m = p1+p2;\n UnionFind uf(m*2);\n for(int i = 0; i < n; ++i) {\n int x, y;\n string a;\n cin >> x >> y >> a;\n --x; --y;\n if(a == \"yes\") {\n uf.unite(x, y);\n uf.unite(x+m, y+m);\n } else {\n uf.unite(x, y+m);\n uf.unite(x+m, y);\n }\n }\n\n bool no_flag = false;\n map<int, pair<int, int> > group;\n for(int i = 0; i < m; ++i) {\n if(uf.same(i, i+m)) {\n no_flag = true;\n break;\n }\n int root = uf.find(i);\n int add = 1;\n if(root >= m) {\n root -= m;\n add = 0;\n }\n group[root].first++;\n group[root].second += add;\n }\n if(no_flag) {\n cout << \"no\" << endl;\n continue;\n }\n\n vector<int> roots;\n vector<pair<int, int> > v;\n for(map<int, pair<int,int> >::iterator it = group.begin();\n it != group.end(); ++it) {\n roots.push_back(it->first);\n v.push_back(make_pair(it->second.second, \n it->second.first - it->second.second));\n }\n\n int size = v.size();\n vector<vector<int> > dp(size+1, vector<int>(p1+1, 0));\n vector<vector<int> > prev(size+1, vector<int>(p1+1, -1));\n dp[0][0] = 1;\n for(int i = 0; i < v.size(); ++i) {\n for(int j = 0; j <= p1; ++j) {\n if(!dp[i][j]) continue;\n try {\n int nj = j + v[i].first;\n if(nj > p1) throw 0;\n dp[i+1][nj] += 1;\n prev[i+1][nj] = 0;\n } catch(...) {}\n try {\n int nj = j + v[i].second;\n if(nj > p1) throw 0;\n dp[i+1][nj] += 1;\n prev[i+1][nj] = 1;\n } catch(...) {}\n }\n }\n\n if(dp[v.size()][p1] != 1) {\n cout << \"no\" << endl;\n continue;\n }\n\n vector<int> r(m*2);\n {\n int i = v.size();\n int j = p1;\n while(prev[i][j] != -1) {\n if(prev[i][j] == 0) {\n r[roots[i-1]] = 1;\n j -= v[i-1].first;\n } else {\n r[roots[i-1]+m] = 1;\n j -= v[i-1].second;\n }\n --i;\n }\n }\n for(int i = 0; i < m; ++i) {\n if(r[uf.find(i)]) {\n cout << i+1 << endl;\n }\n }\n cout << \"end\" << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1372,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_1238_811989","code_snippet":"#include <bits/stdc++.h>\n#define REP(i,n) for(int i=0; i<(int)(n); ++i)\n\nusing namespace std;\n\nconst int MAX_V = 666;\n\nint N, P1, P2, M;\nint d[MAX_V][MAX_V];\nbool used[MAX_V];\nint id[MAX_V];\nint val[MAX_V];\n\ntypedef pair<int, int> P;\nP dfs(int u, int c, int k){\n if(used[u]) return P(0, 0);\n used[u] = true;\n id[u] = k;\n val[u] = c;\n P res(0, 0);\n if(c == 0) res.first ++;\n if(c == 1) res.second ++;\n REP(v, M) if(d[u][v] >= 0){\n P p = dfs(v, c ^ d[u][v], k);\n res = P(res.first + p.first, res.second + p.second);\n }\n return res;\n}\n\nvoid add(int& x, int y){\n x = min(x + y, 2);\n}\n\nint main(){\n int N, P1, P2;\n while(cin >> N >> P1 >> P2 && !(N == 0 && P1 == 0 && P2 == 0)){\n M = P1 + P2;\n memset(d, -1, sizeof(d));\n REP(i, N){\n int x, y;\n string s;\n cin >> x >> y >> s;\n d[x - 1][y - 1] = d[y - 1][x - 1] = (s[0] == 'y' ? 0 : 1);\n }\n memset(used, 0, sizeof(used));\n int K = 0;\n vector<P> vp;\n REP(i, M) if(!used[i]){\n P p = dfs(i, 0, K++);\n vp.push_back(p);\n }\n\n int dp[MAX_V][MAX_V] = {};\n int back[MAX_V][MAX_V] = {};\n dp[0][0] = 1;\n for(int i = 0; i < vp.size(); i++){\n for(int j = M; j >= 0; j--){\n if(dp[i][j] >= 1){\n add(dp[i + 1][j + vp[i].first], dp[i][j]);\n add(dp[i + 1][j + vp[i].second], dp[i][j]);\n back[i + 1][j + vp[i].first] = 0;\n back[i + 1][j + vp[i].second] = 1;\n }\n }\n }\n if(dp[vp.size()][P1] == 1){\n int curr = P1;\n for(int i = vp.size() - 1; i >= 0; i--){\n if(back[i + 1][curr] == 0){\n curr -= vp[i].first;\n }else{\n curr -= vp[i].second;\n\n for(int u = 0; u < M; u++)\n if(id[u] == i)\n val[u] ^= 1;\n }\n }\n for(int i = 0; i < M; i++){\n if(val[i] == 0){\n cout << i + 1 << endl;\n }\n }\n cout << \"end\" << endl;\n }else{\n cout << \"no\" << endl;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":6432,"score_of_the_acc":-0.0458,"final_rank":5},{"submission_id":"aoj_1238_647391","code_snippet":"#include<iostream>\n#include<sstream>\n#include<algorithm>\n#include<set>\n#include<map>\n#include<queue>\n#include<complex>\n#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cassert>\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<<__LINE__<<\": \"<<#x<<\" = \"<<(x)<<endl\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef pair<int,int> pi;\nconst int inf = (int)1e9;\nconst double INF = 1e12, EPS = 1e-9;\n\nint q, n, m, p[1200], prev[610][610], dp[610][610];\nint root(int x){\n\tif(p[x] == x) return x;\n\treturn p[x] = root(p[x]);\n}\nvoid merge(int a, int b){\n\ta = root(a); b = root(b);\n\tif(a != b) p[b] = a;\n}\n\nint main(){\n\twhile(cin >> q >> n >> m, q + n + m){\n\t\trep(i, 2 * (n + m)) p[i] = i;\n\t\trep(i, q){\n\t\t\tstring c;\n\t\t\tint a, b;\n\t\t\tcin >> a >> b >> c;\n\t\t\ta--; b--;\n\t\t\tif(c == \"yes\") rep(j, 2) merge(2 * a + j, 2 * b + j);\n\t\t\telse rep(j, 2) merge(2 * a + j, 2 * b + 1 - j);\n\t\t}\n\t\tmap<int, vi> s;\n\t\tvector<vi> ys, ns;\n\t\tvector<pi> v;\n\t\tvi ans; int p;\n\t\tbool use[1200] = {};\n\t\t\n\t\trep(i, 2 * (n + m)) s[root(i)].pb(i);\n\t\trep(i, 2 * (n + m)){\n\t\t\tint t = 0, l = 0, r = root(i);\n\t\t\tif(use[r / 2]) continue;\n\t\t\tuse[r / 2] = 1;\n\t\t\tvi a, b;\n\t\t\teach(j, s[r]){\n\t\t\t\tif(*j % 2) l++, b.pb(*j / 2);\n\t\t\t\telse t++, a.pb(*j / 2);\n\t\t\t}\n\t\t\tv.pb(mp(t, l));\n\t\t\tys.pb(a); ns.pb(b);\n\t\t}\n\t\tmemset(dp, 0, sizeof(dp));\n\t\tdp[0][0] = 1;\n\t\trep(i, v.size()) for(int j = n + m; j >= 0; j--) if(dp[i][j]){\n\t\t\tdp[i][j] = min(dp[i][j], 100);\n\t\t\tif(j + v[i].first <= n + m) dp[i + 1][j + v[i].first] += dp[i][j], prev[i + 1][j + v[i].first] = 0;\n\t\t\tif(j + v[i].second<= n + m) dp[i + 1][j + v[i].second]+= dp[i][j], prev[i + 1][j + v[i].second]= 1;\n\t\t}\n\t\tp = v.size() - 1;\n\t\tif(dp[p + 1][n] != 1){\n\t\t\tcout << \"no\" << endl;\n\t\t\tgoto END;\n\t\t}\n\t\twhile(p >= 0){\n\t\t\tif(prev[p + 1][n]) rep(j, ns[p].size()) ans.pb(ns[p][j]);\n\t\t\telse rep(j, ys[p].size()) ans.pb(ys[p][j]);\n\t\t\tn -= prev[p + 1][n] ? ns[p].size() : ys[p].size();\n\t\t\tp--;\n\t\t}\n\t\tsort(all(ans));\n\t\trep(i, ans.size()) cout << ans[i] + 1 << endl;\n\t\tcout << \"end\" << endl;\n\t\tEND:;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3084,"score_of_the_acc":-0.0155,"final_rank":2}],"string":"[\n {\n \"submission_id\": \"aoj_1238_5010193\",\n \"code_snippet\": \"#include<iostream>\\n#include<cstdio>\\n#include<cstring>\\nusing namespace std;\\n\\nconst int N = 2010;\\nint fa[N], siz[N], a[N], f[N][N], pre[N][N], ans[N], b[N], c[N]; \\nbool vis[N], in[N];\\nint findfa(int x) {\\n\\treturn fa[x] == x ? x : fa[x] = findfa(fa[x]);\\n}\\n\\nvoid merge(int x, int y) {\\n\\tx = findfa(x); y = findfa(y);\\n\\tif (x == y) return ;\\n\\tfa[x] = y; siz[y] += siz[x];\\n}\\n\\nint main() {\\n\\tint n, p1, p2, m;\\n\\twhile (~scanf(\\\"%d%d%d\\\", &n, &p1, &p2) && (n | p1 | p2)) {\\n\\t\\tmemset(f, 0, sizeof(f));\\n\\t\\tmemset(vis, 0, sizeof(vis));\\n\\t\\tmemset(in, 0, sizeof(in));\\n\\t\\tmemset(pre, 0, sizeof(pre));\\n\\t\\tm = p1 + p2;\\n\\t\\tfor (int i = 1; i <= m * 2; i++) fa[i] = i;\\n\\t\\tfor (int i = 1; i <= m; i++) siz[i] = 1, siz[i + m] = 0;\\n\\t\\tfor (int i = 1, x, y; i <= n; i++) {\\n\\t\\t\\tchar s[10];\\n\\t\\t\\tscanf(\\\"%d%d%s\\\", &x, &y, s);\\n\\t\\t\\tif (s[0] == 'y') merge(x, y), merge(x + m, y + m);\\n\\t\\t\\telse merge(x + m, y), merge(x, y + m);\\n\\t\\t}\\n\\t\\tint cnt = 0;\\n\\t\\tfor (int i = 1; i <= m; i++) {\\n\\t\\t\\tint x = findfa(i), y = findfa(i + m);\\n\\t\\t\\tif (vis[x] || vis[y]) continue ;\\n\\t\\t\\ta[++cnt] = x; b[cnt] = y;\\n\\t\\t\\tvis[x] = vis[y] = 1;\\n\\t\\t}\\n//\\t\\tfor (int i = 1; i <= cnt; i++)\\n//\\t\\t\\tprintf(\\\"%d%c\\\", a[i], \\\" \\\\n\\\"[i == cnt]);\\n//\\t\\tfor (int i = 1; i <= cnt; i++)\\n//\\t\\t\\tprintf(\\\"%d%c\\\", b[i], \\\" \\\\n\\\"[i == cnt]);\\n\\t\\tf[0][0] = 1;\\n\\t\\tfor (int i = 1; i <= cnt; i++)\\n\\t\\t\\tfor (int j = 0; j <= m; j++) \\n\\t\\t\\t\\tif (f[i - 1][j]) {\\n\\t\\t\\t\\t\\tf[i][j + siz[a[i]]] += f[i - 1][j], pre[i][j + siz[a[i]]] = j;\\n\\t\\t\\t\\t\\tf[i][j + siz[b[i]]] += f[i - 1][j], pre[i][j + siz[b[i]]] = j;\\n\\t\\t\\t\\t}\\n\\t\\tif (p1 == p2) puts(\\\"no\\\");\\n\\t\\telse {\\n\\t\\t\\tif (f[cnt][p1] == 1) {\\n\\t\\t\\t\\tint k = 0, s = p1;\\n\\t\\t\\t\\tfor (int i = cnt; i >= 1; i--)\\n\\t\\t\\t\\t\\tif (s - siz[a[i]] == pre[i][s]) in[a[i]] = 1, s -= siz[a[i]];\\n\\t\\t\\t\\t\\telse in[b[i]] = 1, s -= siz[b[i]];\\n//\\t\\t\\t\\tfor (int i = 1; i <= m; i++)\\n//\\t\\t\\t\\t\\tprintf(\\\"%d%c\\\", findfa(i), \\\" \\\\n\\\"[i == m]);\\n//\\t\\t\\t\\tfor (int i = 1; i <= m * 2; i++)\\n//\\t\\t\\t\\t\\tprintf(\\\"%d%c\\\", in[i], \\\" \\\\n\\\"[i == m * 2]);\\n\\t\\t\\t\\tfor (int i = 1; i <= m; i++)\\n\\t\\t\\t\\t\\tif (in[findfa(i)]) ans[++k] = i;\\n\\t\\t\\t\\tfor (int i = 1; i <= k; i++)\\n\\t\\t\\t\\t\\tprintf(\\\"%d\\\\n\\\", ans[i]);\\n\\t\\t\\t\\tputs(\\\"end\\\");\\n\\t\\t\\t}\\n\\t\\t\\telse puts(\\\"no\\\");\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 34724,\n \"score_of_the_acc\": -0.3854,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1238_4591393\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define _GLIBCXX_DEBUG\\n\\nvector<int> P; // parent\\nvector<int> divine; // 0:not_checked, 1:true, -1:lie\\nmap<int, vector<int>> groups; // <根、葉>\\nint m;\\n\\n// 未完成\\n\\nvoid init() {\\n groups.clear();\\n P = vector<int>(m + 1);\\n divine = vector<int>(m + 1);\\n for (int i = 1; i <= m; i++) {\\n P[i] = i;\\n groups[i].push_back(i);\\n }\\n}\\nint root(int c) {\\n if (P[c] == c)\\n return c;\\n return (P[c] = root(P[c]));\\n}\\nbool is_same_set(int a, int b) { return root(a) == root(b); }\\n// 子のgroupに入っている要素を親のgroupに移し替える。\\nvoid unite(int c, int p) {\\n groups[root(p)].insert(groups[root(p)].end(), groups[root(c)].begin(),\\n groups[root(c)].end());\\n groups.erase(root(c));\\n P[root(c)] = root(p);\\n}\\n// 結合して子になるグループのdivineをすべて裏返してから結合\\nvoid r_unite(int c, int p) {\\n for (int i : groups[root(c)]) {\\n divine[i] *= -1;\\n }\\n unite(c, p);\\n}\\n\\nint main() {\\n int n, t, l;\\n while (cin >> n >> t >> l) {\\n if (!n && !t && !l)\\n break;\\n\\n m = t + l;\\n init();\\n /* cout << m << endl; */\\n // グループ分け\\n for (int i = 0; i < n; i++) {\\n int x, y;\\n string a;\\n cin >> x >> y >> a;\\n int honest = (a == \\\"yes\\\") ? 1 : -1;\\n if (x == y || is_same_set(x, y))\\n continue;\\n int reverse;\\n if (divine[x]) {\\n reverse = divine[x] * honest;\\n } else {\\n reverse = honest;\\n divine[x] = 1;\\n }\\n assert(reverse != 0);\\n if (divine[y] && reverse != divine[y])\\n r_unite(y, x);\\n else {\\n unite(y, x);\\n divine[y] = reverse;\\n }\\n assert(divine[y] != 0);\\n }\\n // test------------\\n /* for (int i : groups[1]) { */\\n /* cout << i << ' ' << divine[i] << endl; */\\n /* } */\\n //----------------\\n map<int, pair<int, int>> pair_t_l; //<root of group, <truth_teller, liar>>\\n for (auto group = groups.begin(); group != groups.end(); ++group) {\\n int t_teller = 0, liar = 0;\\n for (int i : group->second) {\\n if (divine[i] == 1)\\n t_teller++;\\n // 言及されていない人は嘘つきとみなす。\\n else { // bug:{}をつけないと行を加えたときにつけ忘れる。\\n divine[i] = -1;\\n liar++;\\n }\\n }\\n /* cout << t_teller << ' ' << liar << endl; */\\n pair_t_l[group->first] = make_pair(t_teller, liar);\\n }\\n\\n int num_g = groups.size();\\n vector<vector<int>> dp(\\n num_g + 1,\\n vector<int>(\\n t + 1, 0)); // dp[i][j]:i個のグループでj人の正直者を何通りつくれるか\\n vector<vector<set<int>>> p_rev(\\n num_g + 1, vector<set<int>>(t + 1)); //裏返るグループを保存する配列\\n int gc = 0;\\n // 動的計画法\\n for (auto P = pair_t_l.begin(); P != pair_t_l.end(); ++P) {\\n gc++;\\n pair<int, int> p = P->second; //<truth_teller, liar>\\n /* // もし正直者と嘘つきの数が同じなら答えはnoなので抜ける */\\n /* if (p.first == p.second) { */\\n /* dp[num_g][t] = 10; */\\n /* break; */\\n /* } */\\n if (gc == 1) {\\n dp[gc][p.first]++;\\n dp[gc][p.second]++;\\n /* cout << p.second << endl; */\\n if (p.second <= t)\\n p_rev.at(gc).at(p.second).insert(P->first);\\n }\\n for (int j = 0; j <= t; j++) { // bug:jを1から始めるとt=0のとき間違う\\n /* cout << gc << ' ' << j << ' ' << p.first << ' ' << p.second << ' ' */\\n /* << dp[gc - 1][j] << endl; */\\n if (p.first + j <= t) {\\n dp[gc][p.first + j] += dp[gc - 1][j];\\n if (dp[gc - 1][j]) {\\n for (auto group : p_rev[gc - 1][j]) {\\n p_rev[gc][p.first + j].insert(group);\\n }\\n }\\n }\\n if (p.second + j <= t) {\\n dp[gc][p.second + j] += dp[gc - 1][j];\\n /* assert(!(gc==2&&p.second+j==4)); */\\n if (dp[gc - 1][j]) {\\n for (auto group : p_rev[gc - 1][j]) {\\n p_rev[gc][p.second + j].insert(group);\\n }\\n p_rev[gc][p.second + j].insert(P->first);\\n }\\n /* cout<<gc<<' '<<p.second+j<<' '<<dp[gc][p.second + j]<<endl; */\\n }\\n }\\n }\\n\\n /* for (int i : divine) */\\n /* cout << i << endl; */\\n vector<int> ans;\\n for (int group : p_rev[num_g][t]) {\\n /* cout<<1<<endl; */\\n /* assert(groups.count(1)==0); */\\n for (int person : groups[group]) {\\n divine[person] *= -1;\\n }\\n }\\n for (auto group = groups.begin(); group != groups.end(); ++group) {\\n /* cout << group->first << ' '; */\\n for (int person : group->second) {\\n /* cout << person << ' '; */\\n if (divine[person] == 1)\\n ans.push_back(person);\\n }\\n /* cout << endl; */\\n }\\n sort(ans.begin(), ans.end());\\n /* cout << groups.size() << endl; */\\n /* cout << root(24) << endl; */\\n\\n if (dp[num_g][t] != 1) {\\n cout << \\\"no\\\" << endl;\\n } else {\\n for (int i : ans)\\n cout << i << endl;\\n cout << \\\"end\\\" << endl;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 14724,\n \"score_of_the_acc\": -0.1487,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1238_2803088\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define int short\\n\\nusing vint = vector<int>;\\n\\nstruct edge {\\n\\tint to, kind;\\n\\tedge(){}\\n\\tedge(int to, int kind):to(to), kind(kind){}\\n};\\n\\nusing Graph = vector<vector<edge> >;\\n\\nstruct UF {\\n\\tvint data;\\n\\tUF(){}\\n\\tvoid init(int n) {\\n\\t\\tdata.clear();\\n\\t\\tdata.resize(n, -1);\\n\\t}\\n\\tint find(int x) {\\n\\t\\treturn data[x] < 0 ? x : data[x] = find(data[x]);\\t \\n\\t}\\n\\tint size(int x) {\\n\\t\\treturn -data[find(x)];\\n\\t}\\n\\tbool same(int x, int y) {\\n\\t\\treturn find(x) == find(y);\\n\\t}\\n\\tvoid unite(int x, int y) {\\n\\t\\tx = find(x), y = find(y);\\n\\t\\tif(x == y) return;\\n\\t\\tif(data[x] > data[y]) swap(x, y);\\n\\t\\tdata[x] += data[y];\\n\\t\\tdata[y] = x;\\n\\t}\\n};\\n\\nint Q, A, B, N;\\nGraph graph;\\nGraph rgraph;\\nUF uf;\\n\\nvint col[2];\\nvint divines[2];\\n\\nvoid fillcolor(int s, int c) {\\n\\tqueue<int> que;\\n\\tque.push(s);\\n\\tcol[c][s] = c;\\n\\tif(!c) ++divines[c][s];\\n\\twhile(!que.empty()) {\\n\\t\\tint u = que.front(); que.pop();\\n\\t\\tfor(edge e : graph[u]) {\\n\\t\\t\\tif(col[c][e.to] == -1) {\\n\\t\\t\\t\\tque.push(e.to);\\n\\t\\t\\t\\tcol[c][e.to] = col[c][u]^e.kind;\\n\\t\\t\\t\\tif(!col[c][e.to]) ++divines[c][s];\\n\\t\\t\\t} else if(col[c][e.to] != (col[c][u]^e.kind)) {\\n\\t\\t\\t\\tdivines[c][s] = -1;\\t\\t\\t\\t\\n\\t\\t\\t\\treturn;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor(edge e : rgraph[u]) {\\n\\t\\t\\tif(col[c][e.to] == -1) {\\n\\t\\t\\t\\tque.push(e.to);\\n\\t\\t\\t\\tcol[c][e.to] = col[c][u]^e.kind;\\n\\t\\t\\t\\tif(!col[c][e.to]) ++divines[c][s];\\t\\t\\t\\t\\n\\t\\t\\t} else if(col[c][e.to] != (col[c][u]^e.kind)) {\\n\\t\\t\\t\\tdivines[c][s] = -1;\\n\\t\\t\\t\\treturn;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t//cout << s << \\\" \\\" << c << \\\" \\\" << divines[c][s] << endl;\\n}\\n\\nvoid init() {\\n\\tgraph.clear();\\n\\tgraph.resize(N);\\n\\trgraph.clear();\\n\\trgraph.resize(N);\\n\\tcol[0].clear();\\n\\tcol[0].resize(N, -1);\\n\\tcol[1].clear();\\n\\tcol[1].resize(N, -1);\\n\\tdivines[0].clear();\\n\\tdivines[0].resize(N);\\n\\tdivines[1].clear();\\n\\tdivines[1].resize(N);\\n\\tuf.init(N);\\n}\\n\\nusing Pi = pair<int, int>;\\n\\n//int dp[303][303][303];\\nPi rev[303][303][303];\\n\\nsigned main() {\\n\\twhile(cin >> Q >> A >> B, Q || A || B) {\\n\\t\\tN = A + B;\\t\\t\\n\\t\\tinit();\\n\\t\\tfor(int i = 0; i < Q; ++i) {\\n\\t\\t\\tint a, b;\\n\\t\\t\\tstring s;\\n\\t\\t\\tcin >> a >> b >> s;\\n\\t\\t\\t--a, --b;\\n\\t\\t\\tgraph[a].emplace_back(b, s == \\\"no\\\");\\n\\t\\t\\trgraph[b].emplace_back(a, s == \\\"no\\\");\\n\\t\\t\\tuf.unite(a, b);\\n\\t\\t}\\n\\t\\t//map<int, int> mp;\\n\\t\\tvint mp(N);\\n\\t\\tint sz = 0;\\n\\t\\tfor(int i = 0; i < N; ++i) {\\n\\t\\t\\tif(uf.find(i) != i) continue;\\n\\t\\t\\tmp[sz++] = i;\\n\\t\\t\\tfor(int j = 0; j < 2; ++j) {\\n\\t\\t\\t\\tfillcolor(i, j);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor(int i = 0; i < 303; ++i) {\\n\\t\\t\\tfor(int j = 0; j < 303; ++j) {\\n\\t\\t\\t\\tfor(int k = 0; k < 303; ++k) {\\n\\t\\t\\t\\t\\t//dp[i][j][k] = 0;\\n\\t\\t\\t\\t\\trev[i][j][k] = Pi(-2, -2);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//dp[0][0][0] = 1;\\n\\t\\trev[0][0][0] = Pi(-1, -1);\\n\\t\\tfor(int i = 0; i < sz; ++i) {\\n\\t\\t\\tfor(int j = 0; j <= A; ++j) {\\n\\t\\t\\t\\tfor(int k = 0; k <= B; ++k) {\\n\\t\\t\\t\\t\\t//if(!dp[i][j][k]) continue;\\n\\t\\t\\t\\t\\tif(rev[i][j][k].first == -2) continue;\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tfor(int l = 0; l < 2; ++l) {\\n\\t\\t\\t\\t\\t\\tif(divines[l][mp[i]] == -1) continue;\\n\\t\\t\\t\\t\\t\\tint x = divines[l][mp[i]];\\n\\t\\t\\t\\t\\t\\tint y = uf.size(mp[i])-x;\\n\\t\\t\\t\\t\\t\\tif(j+x > A || k+y > B) continue;\\n\\t\\t\\t\\t\\t\\t//if(!dp[i+1][j+x][k+y]) {\\n\\t\\t\\t\\t\\t\\tif(rev[i+1][j+x][k+y].first == -2) {\\n\\t\\t\\t\\t\\t\\t\\t//dp[i+1][j+x][k+y] = 1;\\n\\t\\t\\t\\t\\t\\t\\trev[i+1][j+x][k+y] = Pi(mp[i], l);\\n\\t\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\t\\t//dp[i+1][j+x][k+y] = 2;\\n\\t\\t\\t\\t\\t\\t\\trev[i+1][j+x][k+y] = Pi(-1, -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\\t//if(dp[sz][A][B] != 1) {\\n\\t\\tif(rev[sz][A][B].first < 0) {\\t\\t\\n\\t\\t\\tcout << \\\"no\\\" << endl;\\n\\t\\t\\tcontinue;\\n\\t\\t} else {\\n\\t\\t\\tvint ans;\\n\\t\\t\\tint a = A, b = B;\\n\\t\\t\\tfor(int i = sz; i > 0; --i) {\\n\\t\\t\\t\\tPi p = rev[i][a][b];\\n\\t\\t\\t\\tfor(int j = 0; j < N; ++j) {\\n\\t\\t\\t\\t\\tif(uf.find(j) != p.first) continue;\\n\\t\\t\\t\\t\\tif(!col[p.second][j]) ans.push_back(j);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\ta -= divines[p.second][p.first];\\n\\t\\t\\t\\tb -= (uf.size(p.first)-divines[p.second][p.first]);\\n\\t\\t\\t}\\n\\t\\t\\tsort(ans.begin(), ans.end());\\n\\t\\t\\tfor(int id : ans) cout << id+1 << endl;\\n\\t\\t\\tcout << \\\"end\\\" << endl;\\n\\t\\t}\\n\\t}\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 370,\n \"memory_kb\": 111736,\n \"score_of_the_acc\": -1.9997,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1238_2802955\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define int short\\n\\nusing vint = vector<int>;\\n\\nstruct edge {\\n\\tint to, kind;\\n\\tedge(){}\\n\\tedge(int to, int kind):to(to), kind(kind){}\\n};\\n\\nusing Graph = vector<vector<edge> >;\\n\\nstruct UF {\\n\\tvint data;\\n\\tUF(){}\\n\\tvoid init(int n) {\\n\\t\\tdata.clear();\\n\\t\\tdata.resize(n, -1);\\n\\t}\\n\\tint find(int x) {\\n\\t\\treturn data[x] < 0 ? x : data[x] = find(data[x]);\\t \\n\\t}\\n\\tint size(int x) {\\n\\t\\treturn -data[find(x)];\\n\\t}\\n\\tbool same(int x, int y) {\\n\\t\\treturn find(x) == find(y);\\n\\t}\\n\\tvoid unite(int x, int y) {\\n\\t\\tx = find(x), y = find(y);\\n\\t\\tif(x == y) return;\\n\\t\\tif(data[x] > data[y]) swap(x, y);\\n\\t\\tdata[x] += data[y];\\n\\t\\tdata[y] = x;\\n\\t}\\n};\\n\\nint Q, A, B, N;\\nGraph graph;\\nGraph rgraph;\\nUF uf;\\n\\nvint col[2];\\nvint divines[2];\\n\\nvoid fillcolor(int s, int c) {\\n\\tqueue<int> que;\\n\\tque.push(s);\\n\\tcol[c][s] = c;\\n\\tif(!c) ++divines[c][s];\\n\\twhile(!que.empty()) {\\n\\t\\tint u = que.front(); que.pop();\\n\\t\\tfor(edge e : graph[u]) {\\n\\t\\t\\tif(col[c][e.to] == -1) {\\n\\t\\t\\t\\tque.push(e.to);\\n\\t\\t\\t\\tcol[c][e.to] = col[c][u]^e.kind;\\n\\t\\t\\t\\tif(!col[c][e.to]) ++divines[c][s];\\n\\t\\t\\t} else if(col[c][e.to] != (col[c][u]^e.kind)) {\\n\\t\\t\\t\\tdivines[c][s] = -1;\\t\\t\\t\\t\\n\\t\\t\\t\\treturn;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor(edge e : rgraph[u]) {\\n\\t\\t\\tif(col[c][e.to] == -1) {\\n\\t\\t\\t\\tque.push(e.to);\\n\\t\\t\\t\\tcol[c][e.to] = col[c][u]^e.kind;\\n\\t\\t\\t\\tif(!col[c][e.to]) ++divines[c][s];\\t\\t\\t\\t\\n\\t\\t\\t} else if(col[c][e.to] != (col[c][u]^e.kind)) {\\n\\t\\t\\t\\tdivines[c][s] = -1;\\n\\t\\t\\t\\treturn;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t//cout << s << \\\" \\\" << c << \\\" \\\" << divines[c][s] << endl;\\n}\\n\\nvoid init() {\\n\\tgraph.clear();\\n\\tgraph.resize(N);\\n\\trgraph.clear();\\n\\trgraph.resize(N);\\n\\tcol[0].clear();\\n\\tcol[0].resize(N, -1);\\n\\tcol[1].clear();\\n\\tcol[1].resize(N, -1);\\n\\tdivines[0].clear();\\n\\tdivines[0].resize(N);\\n\\tdivines[1].clear();\\n\\tdivines[1].resize(N);\\n\\tuf.init(N);\\n}\\n\\nusing Pi = pair<int, int>;\\n\\n//int dp[303][303][303];\\nPi rev[303][303][303];\\n\\nsigned main() {\\n\\twhile(cin >> Q >> A >> B, Q || A || B) {\\n\\t\\tN = A + B;\\t\\t\\n\\t\\tinit();\\n\\t\\tfor(int i = 0; i < Q; ++i) {\\n\\t\\t\\tint a, b;\\n\\t\\t\\tstring s;\\n\\t\\t\\tcin >> a >> b >> s;\\n\\t\\t\\t--a, --b;\\n\\t\\t\\tgraph[a].emplace_back(b, s == \\\"no\\\");\\n\\t\\t\\trgraph[b].emplace_back(a, s == \\\"no\\\");\\n\\t\\t\\tuf.unite(a, b);\\n\\t\\t}\\n\\t\\t//map<int, int> mp;\\n\\t\\tvint mp(N);\\n\\t\\tint sz = 0;\\n\\t\\tfor(int i = 0; i < N; ++i) {\\n\\t\\t\\tif(uf.find(i) != i) continue;\\n\\t\\t\\tmp[sz++] = i;\\n\\t\\t\\tfor(int j = 0; j < 2; ++j) {\\n\\t\\t\\t\\tfillcolor(i, j);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor(int i = 0; i < 303; ++i) {\\n\\t\\t\\tfor(int j = 0; j < 303; ++j) {\\n\\t\\t\\t\\tfor(int k = 0; k < 303; ++k) {\\n\\t\\t\\t\\t\\t//dp[i][j][k] = 0;\\n\\t\\t\\t\\t\\trev[i][j][k] = Pi(-2, -2);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//dp[0][0][0] = 1;\\n\\t\\trev[0][0][0] = Pi(-1, -1);\\n\\t\\tfor(int i = 0; i < sz; ++i) {\\n\\t\\t\\tfor(int j = 0; j <= A; ++j) {\\n\\t\\t\\t\\tfor(int k = 0; k <= B; ++k) {\\n\\t\\t\\t\\t\\t//if(!dp[i][j][k]) continue;\\n\\t\\t\\t\\t\\tif(rev[i][j][k].first == -2) continue;\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tfor(int l = 0; l < 2; ++l) {\\n\\t\\t\\t\\t\\t\\tif(divines[l][mp[i]] == -1) continue;\\n\\t\\t\\t\\t\\t\\tint x = divines[l][mp[i]];\\n\\t\\t\\t\\t\\t\\tint y = uf.size(mp[i])-x;\\n\\t\\t\\t\\t\\t\\tif(j+x > A || k+y > B) continue;\\n\\t\\t\\t\\t\\t\\t//if(!dp[i+1][j+x][k+y]) {\\n\\t\\t\\t\\t\\t\\tif(rev[i+1][j+x][k+y].first == -2) {\\n\\t\\t\\t\\t\\t\\t\\t//dp[i+1][j+x][k+y] = 1;\\n\\t\\t\\t\\t\\t\\t\\trev[i+1][j+x][k+y] = Pi(mp[i], l);\\n\\t\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\t\\t//dp[i+1][j+x][k+y] = 2;\\n\\t\\t\\t\\t\\t\\t\\trev[i+1][j+x][k+y] = Pi(-1, -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\\t//if(dp[sz][A][B] != 1) {\\n\\t\\tif(rev[sz][A][B].first < 0) {\\t\\t\\n\\t\\t\\tcout << \\\"no\\\" << endl;\\n\\t\\t\\tcontinue;\\n\\t\\t} else {\\n\\t\\t\\tvint ans;\\n\\t\\t\\tint a = A, b = B;\\n\\t\\t\\tfor(int i = sz; i > 0; --i) {\\n\\t\\t\\t\\tPi p = rev[i][a][b];\\n\\t\\t\\t\\tfor(int j = 0; j < N; ++j) {\\n\\t\\t\\t\\t\\tif(uf.find(j) != p.first) continue;\\n\\t\\t\\t\\t\\tif(!col[p.second][j]) ans.push_back(j);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\ta -= divines[p.second][p.first];\\n\\t\\t\\t\\tb -= (uf.size(p.first)-divines[p.second][p.first]);\\n\\t\\t\\t}\\n\\t\\t\\tsort(ans.begin(), ans.end());\\n\\t\\t\\tfor(int id : ans) cout << id+1 << endl;\\n\\t\\t\\tcout << \\\"end\\\" << endl;\\n\\t\\t}\\n\\t}\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 360,\n \"memory_kb\": 111768,\n \"score_of_the_acc\": -1.9722,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1238_2660712\",\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 RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)\\n#define REP(i,n) for (int i=0;i<(n);i++)\\n#define RREP(i,n) for (int i=(n)-1;i>=0;i--)\\ntypedef long long LL;\\n//??°????????¨\\n#define MAX_N 800\\ntypedef pair<int,int>P;\\nvector<P>G[MAX_N];\\n\\nbool used[MAX_N];\\nvector<int> color[2][MAX_N+1];\\n\\nvoid init(){\\n\\tREP(i,MAX_N){\\n\\t\\tG[i].clear();\\n\\t\\tused[i]=false;\\n\\t\\tcolor[0][i].clear();\\n\\t\\tcolor[1][i].clear();\\n\\t}\\n}\\n\\nvoid biparate(int v,int num,int c){\\n\\tif(used[v]==true)return;\\n\\tused[v]=true;\\n\\tcolor[c][num].push_back(v);\\n\\tREP(i,G[v].size()){\\n\\t\\tbiparate(G[v][i].first,num,(c+G[v][i].second)%2);\\n\\t}\\n}\\n\\n#define NONE 0\\n#define UNI 1\\n#define MUL 2\\n\\nint main(){\\n\\tint n,p1,p2;\\n\\twhile(cin>>n>>p1>>p2,n+p1+p2){\\n\\t\\tinit();\\n\\t\\tREP(i,n){\\n\\t\\t\\tint x,y;\\n\\t\\t\\tstring s;\\n\\t\\t\\tcin>>x>>y>>s;\\n\\t\\t\\tx--;y--;\\n\\t\\t\\tint z=0;\\n\\t\\t\\tif(s==\\\"no\\\")z=1;//no????????¢\\n\\t\\t\\tG[x].push_back(P(y,z));\\n\\t\\t\\tG[y].push_back(P(x,z));\\n\\t\\t}\\n\\t\\t//?????¨??°??????\\n\\t\\t{\\n\\t\\t\\tint num=0;\\n\\t\\t\\tREP(i,p1+p2){\\n\\t\\t\\t\\tif(used[i]==false){\\n\\t\\t\\t\\t\\tbiparate(i,num,0);\\n\\t\\t\\t\\t\\tnum++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//??????????????????\\n\\t\\tvector<int>np[MAX_N+2];\\n\\t\\t//vector<vector<int>>back(MAX_N);\\n\\t\\tREP(i,MAX_N+1){\\n\\t\\t\\tnp[0].push_back(NONE);\\n\\t\\t}\\n\\t\\tnp[0][0]=UNI;\\n\\t\\tREP(i,MAX_N){\\n\\t\\t\\tif((color[0][i].size()==0)&&(color[1][i].size()==0)){\\n\\t\\t\\t\\tnp[i+1]=np[i];\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\tREP(j,MAX_N+1){\\n\\t\\t\\t\\tnp[i+1].push_back(NONE);\\n\\t\\t\\t}\\n\\t\\t\\tREP(j,MAX_N){\\n\\t\\t\\t\\t//0?????\\\\??????\\n\\t\\t\\t\\tif(np[i][j]==UNI){\\n\\t\\t\\t\\t\\tif(np[i+1][j+color[0][i].size()]==NONE){\\n\\t\\t\\t\\t\\t\\tnp[i+1][j+color[0][i].size()]=UNI;\\n\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\t//if(color[0][i].size()!=0)\\n\\t\\t\\t\\t\\t\\tnp[i+1][j+color[0][i].size()]=MUL;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(np[i][j]==MUL){\\n\\t\\t\\t\\t\\tnp[i+1][j+color[0][i].size()]=MUL;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t//1?????\\\\??????\\n\\t\\t\\t\\tif(np[i][j]==UNI){\\n\\t\\t\\t\\t\\tif(np[i+1][j+color[1][i].size()]==NONE){\\n\\t\\t\\t\\t\\t\\tnp[i+1][j+color[1][i].size()]=UNI;\\n\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\t//if(color[1][i].size()!=0)\\n\\t\\t\\t\\t\\t\\tnp[i+1][j+color[1][i].size()]=MUL;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(np[i][j]==MUL){\\n\\t\\t\\t\\t\\tnp[i+1][j+color[1][i].size()]=MUL;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\t\\n\\t\\tif(np[MAX_N][p1]==UNI){\\n\\t\\t\\tvector<int>ans;\\n\\t\\t\\tint now=p1;\\n\\t\\t\\tfor(int i=MAX_N;i>=0;i--){\\n\\t\\t\\t\\tif((color[0][i].size()==0)&&(color[1][i].size()==0))continue;\\n\\t\\t\\t\\t//cout<<now<<endl;\\n\\t\\t\\t\\tif(np[i][now-color[0][i].size()]==1){\\n\\t\\t\\t\\t\\tREP(j,color[0][i].size()){\\n\\t\\t\\t\\t\\t\\tans.push_back(color[0][i][j]);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tnow-=color[0][i].size();\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\tREP(j,color[1][i].size()){\\n\\t\\t\\t\\t\\t\\tans.push_back(color[1][i][j]);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tnow-=color[1][i].size();\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t\\tsort(ans.begin(),ans.end());\\n\\t\\t\\tREP(i,ans.size()){\\n\\t\\t\\t\\tcout<<ans[i]+1<<endl;\\n\\t\\t\\t}\\n\\t\\t\\tcout<<\\\"end\\\"<<endl;\\n\\t\\t}else if(np[MAX_N][p2]==UNI){\\n\\t\\t vector<int>ans;\\n\\t\\t\\tint now=p2;\\n\\t\\t\\tfor(int i=MAX_N;i>=0;i--){\\n\\t\\t\\t\\tif((color[0][i].size()==0)&&(color[1][i].size()==0))continue;\\n\\t\\t\\t\\t//cout<<now<<endl;\\n\\t\\t\\t\\tif(np[i][now-color[0][i].size()]==1){\\n\\t\\t\\t\\t\\tREP(j,color[1][i].size()){\\n\\t\\t\\t\\t\\t\\tans.push_back(color[1][i][j]);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tnow-=color[0][i].size();\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\tREP(j,color[0][i].size()){\\n\\t\\t\\t\\t\\t\\tans.push_back(color[0][i][j]);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tnow-=color[1][i].size();\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t\\tsort(ans.begin(),ans.end());\\n\\t\\t\\tREP(i,ans.size()){\\n\\t\\t\\t\\tcout<<ans[i]+1<<endl;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tcout<<\\\"end\\\"<<endl;\\n\\t\\t}else{\\n\\t\\t\\tcout<<\\\"no\\\"<<endl;\\n\\t\\t}\\n\\t\\t\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5676,\n \"score_of_the_acc\": -0.039,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1238_2628577\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing pii = pair<int, int>;\\n\\nstruct edge {\\n int to;\\n bool yes;\\n};\\n\\nusing edges = vector<edge>;\\nusing graph = vector<edges>;\\n\\n// (divine, devilish)\\npii dfs(graph const& g, int v, bool divine, vector<bool>& checked) {\\n auto res = make_pair((int)divine, (int)!divine);\\n checked[v] = true;\\n for(auto& e : g[v]) {\\n if(checked[e.to]) {\\n continue;\\n }\\n bool next_state = (divine && e.yes || !divine && !e.yes);\\n auto t = dfs(g, e.to, next_state, checked);\\n res.first += t.first;\\n res.second += t.second;\\n }\\n return res;\\n}\\n\\nvoid determine(graph const& g, int v, bool divine, vector<int>& res) {\\n res[v] = divine;\\n for(auto& e : g[v]) {\\n if(res[e.to] != -1) {\\n continue;\\n }\\n bool next_state = (divine && e.yes || !divine && !e.yes);\\n determine(g, e.to, next_state, res);\\n }\\n}\\n\\nstruct data {\\n int person_id;\\n bool divine;\\n pii each_num; // (divine, devilish)\\n data() : person_id(-1), divine(false), each_num(make_pair(0, 0))\\n {}\\n};\\n\\nint main() {\\n int n, p1, p2;\\n while(cin >> n >> p1 >> p2, n || p1 || p2) {\\n graph g(p1 + p2);\\n if(n == 0) {\\n if(p2 == 0) {\\n for(int i = 1; i <= p1 + p2; ++i) {\\n cout << i << endl;\\n }\\n } else if(p1 != 0) {\\n cout << \\\"no\\\" << endl;\\n continue;\\n }\\n cout << \\\"end\\\" << endl;\\n continue;\\n }\\n for(int i = 0; i < n; ++i) {\\n int x, y;\\n string a;\\n cin >> x >> y >> a;\\n g[x - 1].push_back(edge{y - 1, a == \\\"yes\\\"});\\n g[y - 1].push_back(edge{x - 1, a == \\\"yes\\\"});\\n }\\n vector<vector<vector<data>>> dp(1, vector<vector<data>>(p1 + 1, vector<data>(p2 + 1)));\\n dp[0][0][0].person_id = 0;\\n vector<bool> checked(p1 + p2);\\n for(int i = 0; i < p1 + p2; ++i) {\\n auto now = dp.back();\\n vector<vector<data>> nxt(p1 + 1, vector<data>(p2 + 1));\\n if(!checked[i]) {\\n for(int b = 0; b <= 1; ++b) {\\n data d;\\n d.person_id = i;\\n d.divine = b;\\n auto checked2 = checked;\\n d.each_num = dfs(g, i, b, checked);\\n if(b == 0) {\\n checked = checked2; // restore\\n }\\n for(int j = 0; j <= p1; ++j) {\\n for(int k = 0; k <= p2; ++k) {\\n if(now[j][k].person_id == -1) {\\n continue;\\n }\\n int nj = j + d.each_num.first, nk = k + d.each_num.second;\\n if(nj > p1 || nk > p2 || nxt[nj][nk].person_id == -2) {\\n continue;\\n }\\n if(nxt[nj][nk].person_id >= 0 || now[j][k].person_id == -2) { // ambiguous\\n nxt[nj][nk].person_id = -2;\\n continue;\\n }\\n nxt[nj][nk] = d;\\n }\\n }\\n }\\n dp.push_back(move(nxt));\\n }\\n }\\n auto now = dp.back()[p1][p2];\\n if(now.person_id < 0) {\\n cout << \\\"no\\\" << endl;\\n } else {\\n vector<int> res(p1 + p2, -1);\\n int P1 = p1, P2 = p2;\\n for(int i = dp.size() - 1; i > 0; --i) {\\n auto d = dp[i][P1][P2];\\n determine(g, d.person_id, d.divine, res);\\n P1 -= d.each_num.first;\\n P2 -= d.each_num.second;\\n }\\n for(int i = 0; i < p1 + p2; ++i) {\\n if(res[i] == 1) {\\n cout << i + 1 << endl;\\n }\\n }\\n cout << \\\"end\\\" << endl;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 22876,\n \"score_of_the_acc\": -0.5837,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1238_1822961\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\nusing ld = long double;\\ntemplate<class T>\\nusing Table = vector<vector<T>>;\\nconst ld eps=1e-9;\\n\\n//// < \\\"D:\\\\D_Download\\\\Visual Studio 2015\\\\Projects\\\\programing_contest_c++\\\\Debug\\\\a.txt\\\"\\n\\n\\nstruct edge {\\n int from;\\n int to;\\n bool same;\\n edge(int f, int t, bool s):from(f), to(t), same(s) {\\n\\n }\\n /*bool operator ==(edge &e) {\\n return from == e.from&&to == e.to&&same == e.same;\\n }*/\\n};\\n\\nvector<int>types;\\nvector<vector<edge>>edges;\\npair<vector<int>, vector<int>>dfs(const int now,const bool div) {\\n types[now] = div;\\n pair<vector<int>, vector<int>>apair;\\n if (div)apair.first.push_back(now);\\n else apair.second.push_back(now);\\n for (auto e : edges[now]) {\\n if (types[e.to] == -1) {\\n const bool tdiv = e.same ? div : !div;\\n auto p(dfs(e.to, tdiv));\\n apair.first.insert(apair.first.end(), p.first.begin(), p.first.end());\\n apair.second.insert(apair.second.end(), p.second.begin(), p.second.end());\\n }\\n }\\n return apair;\\n}\\nstruct d{\\n int num;\\n vector<bool>his;\\n d() :num(0), his() {\\n\\n }\\n};\\nint main() {\\n while (1) {\\n edges.clear();\\n types.clear();\\n int N, P, Q; cin >> N >> P >> Q;\\n if (!N&&!P&&!Q)break;\\n edges.resize(P+Q);\\n types.resize(P + Q);\\n fill(types.begin(), types.end(), -1);\\n vector<vector<int>>gyou(P + Q, vector<int>(P + Q, -1));\\n for (int i = 0; i < N; ++i) {\\n int x, y; string a; cin >> x >> y >> a;\\n x--; y--;\\n if (x == y)continue;\\n bool same = a == \\\"yes\\\";\\n gyou[x][y] = same;\\n gyou[y][x] = same;\\n\\n }\\n for (int i = 0; i < P + Q; ++i) {\\n for (int j = 0; j < P + Q; ++j) {\\n if (gyou[i][j] != -1) {\\n edges[i].push_back(edge(i, j, gyou[i][j]));\\n }\\n }\\n }\\n vector<pair<vector<int>, vector<int>>>ps;\\n for (int i = 0; i < P + Q; ++i) {\\n if (types[i] == -1) {\\n auto p = dfs(i, true);\\n ps.push_back(p);\\n }\\n }\\n //dp[???][?\\\\???°]\\n vector<vector<d>>dp(ps.size() + 1, vector<d>(P + Q +1));\\n dp[0][0].num = 1;\\n for (int t = 0; t < ps.size(); ++t) {\\n for (int dnum = 0; dnum <= P + Q; ++dnum) {\\n if (dp[t][dnum].num) {\\n for (int i = 0; i < 2; ++i) {\\n const int nextdnum = (!i)?dnum + ps[t].first.size():dnum+ps[t].second.size();\\n vector<bool>nexthis(dp[t][dnum].his);\\n nexthis.push_back(!i);\\n dp[t + 1][nextdnum].num+=dp[t][dnum].num;\\n if (dp[t + 1][nextdnum].num == 1) {\\n dp[t + 1][nextdnum].his = nexthis;\\n }\\n }\\n \\n }\\n }\\n }\\n if (dp[ps.size()][P].num == 1) {\\n set<int>divs;\\n vector<bool>his(dp[ps.size()][P].his);\\n for (int t = 0; t < ps.size(); ++t) {\\n vector<int>v;\\n if (his[t]) {\\n v = ps[t].first;\\n }\\n else {\\n v = ps[t].second;\\n }\\n for (auto n : v) {\\n divs.emplace(n);\\n }\\n }\\n for (auto d : divs) {\\n cout << d + 1 << endl;\\n }\\n cout << \\\"end\\\" << endl;\\n }\\n else {\\n cout << \\\"no\\\" << endl;\\n }\\n \\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 6244,\n \"score_of_the_acc\": -0.0441,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1238_1531341\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<bitset>\\n\\nusing namespace std;\\n\\nvector<int> edges[623][2];\\nbool used[623];\\nunsigned valid[623][623];\\nbitset<623> dp[623][623];\\nint dpx;\\nint temp[623];\\n\\nvoid rec(int v,int p,int d){\\n if(temp[v]){\\n if(temp[v]!=d)throw -1;\\n }else{\\n temp[v]=d;\\n for(int i=0;i<2;i++){\\n for(auto e:edges[v][i]){\\n\\tif(v==p)continue;\\n\\trec(e,v,(i?1:-1)*d);\\n }\\n }\\n }\\n}\\n\\nvoid srec(int v,int p){\\n if(!used[v]++){\\n for(int i=0;i<2;i++){\\n for(auto e:edges[v][i]){\\n\\tif(e==p)continue;\\n\\tsrec(e,v);\\n }\\n }\\n }\\n}\\n\\nbitset<623> record;\\n\\nvoid dodp(int v){\\n for(int i=0;i<2;i++){\\n fill(begin(temp),end(temp),0);\\n try{\\n rec(v,-1,i?1:-1);\\n bitset<623> r;\\n for(int i=0;i<623;i++){\\n\\tr[i]=temp[i]==1;\\n }\\n int ndiv=r.count();\\n for(int j=600;j-ndiv>=0;j--){\\n\\tif(valid[dpx][j-ndiv]){\\n\\t if(valid[dpx+1][j]==0&&valid[dpx][j-ndiv]==1){\\n\\t valid[dpx+1][j]=1;\\n\\t dp[dpx+1][j]=dp[dpx][j-ndiv]|r;\\n\\t }else{\\n\\t valid[dpx+1][j]=2;\\n\\t }\\n\\t}\\n }\\n }catch(...){}\\n }\\n srec(v,-1);\\n dpx++;\\n}\\n\\nint main(){\\n for(int n,p1,p2;cin>>n>>p1>>p2,n|p1|p2;){\\n for(auto &e:edges){\\n for(auto &f:e){\\n\\tf.clear();\\n }\\n }\\n fill(begin(used),end(used),false);\\n fill(valid[0],valid[623],0);\\n while(n--){\\n int x,y;\\n char a[9];\\n cin>>x>>y>>a;\\n edges[x][a[0]=='y'].push_back(y);\\n edges[y][a[0]=='y'].push_back(x);\\n }\\n valid[0][0]=1;\\n dpx=0;\\n for(int i=1;i<=p1+p2;i++){\\n if(!used[i]){\\n\\tdodp(i);\\n }\\n }\\n if(valid[dpx][p1]!=1){\\n cout<<\\\"no\\\"<<endl;\\n }else{\\n for(int i=1;i<=p1+p2;i++){\\n\\tif(dp[dpx][p1][i]){\\n\\t cout<<i<<endl;\\n\\t}\\n }\\n cout<<\\\"end\\\"<<endl;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 33124,\n \"score_of_the_acc\": -0.2876,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1238_1175150\",\n \"code_snippet\": \"#include <string> \\n#include <algorithm> \\n#include <cfloat> \\n#include <climits> \\n#include <cmath> \\n#include <complex> \\n#include <cstdio> \\n#include <cstdlib> \\n#include <cstring> \\n#include <functional> \\n#include <iostream> \\n#include <map> \\n#include <memory> \\n#include <queue> \\n#include <set> \\n#include <sstream> \\n#include <stack> \\n#include <utility> \\n#include <vector> \\n\\n#define EACH(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)\\n#define ALL(x) (x).begin(),(x).end() \\ntypedef long long ll;\\nusing namespace std; \\nconst double eps = 1e-10;\\n\\nstruct UnionFind{\\n vector<int> parent, rank;\\n UnionFind(int n){ parent = vector<int>(n, -1); rank = vector<int>(n, 0); }\\n int find(int x){\\n if(parent[x] == -1) return x;\\n else return (parent[x] = find(parent[x]));\\n }\\n bool unite(int x, int y){\\n x = find(x);\\n y = find(y);\\n if(x == y) return false;\\n if(rank[x] < rank[y])\\n parent[x] = y;\\n else\\n parent[y] = x;\\n if(rank[x] == rank[y])\\n ++rank[x];\\n return true;\\n }\\n bool same(int x, int y){\\n return find(x) == find(y);\\n }\\n};\\n\\nint dp[1010][1010], lst[1010][1010];\\nint main(){\\n for(;;){\\n int n, p1, p2;\\n cin >> n >> p1 >> p2;\\n if(n == 0 && p1 == 0 && p2==0) return 0;\\n int m = p1 + p2;\\n UnionFind uf(2 * m);\\n for(int i=0;i<n;++i){\\n int x, y;\\n string s;\\n cin >> x >> y >> s;\\n --x; --y;\\n if(s == \\\"yes\\\"){\\n uf.unite(x, y);\\n uf.unite(x+m, y+m);\\n }\\n else{\\n uf.unite(x, y+m);\\n uf.unite(x+m, y);\\n }\\n }\\n map<int, int> mp;\\n vector<int> v, w, z;\\n map<int, vector<int> > va, vb;\\n for(int i=0;i<m;++i){\\n int a = uf.find(i);\\n int b = uf.find(i + m);\\n if(mp.find(a) != mp.end()){\\n int pp = mp[a];\\n if(a == uf.find(pp))\\n va[pp].push_back(i);\\n else\\n vb[pp].push_back(i);\\n }\\n else{\\n mp[a] = mp[b] = i;\\n va[i].push_back(i);\\n }\\n }\\n EACH(i, va){\\n v.push_back(i->second.size());\\n w.push_back(vb[i->first].size());\\n z.push_back(i->first);\\n }\\n memset(dp, 0, sizeof(dp));\\n memset(lst, -1, sizeof(lst));\\n dp[0][0] = 1;\\n for(int i=0;i<v.size();++i){\\n for(int j=0;j<=m;++j){\\n if(j >= v[i]){\\n dp[i+1][j] += dp[i][j-v[i]];\\n if(dp[i][j-v[i]])lst[i+1][j] = j-v[i];\\n }\\n if(j >= w[i]){\\n dp[i+1][j] += dp[i][j-w[i]];\\n if(dp[i][j-w[i]])lst[i+1][j] = j-w[i];\\n }\\n }\\n }\\n /*\\n cout << p1 << endl;\\n for(int i=0;i<=3;++i){\\n for(int j=0;j<=4;++j){cout.width(3); cout << lst[i][j];}\\n cout << endl;\\n }\\n */\\n if(dp[(int)v.size()][p1] != 1)\\n cout << \\\"no\\\" << endl;\\n else{\\n vector<int> f(m);\\n int num = p1;\\n for(int i=v.size()-1;i>=0;--i){\\n int bnum = lst[i+1][num];\\n if(bnum+v[i] == num){\\n EACH(j, va[z[i]]) f[*j] = 1;\\n }\\n else{\\n EACH(j, vb[z[i]]) f[*j] = 1;\\n }\\n num = bnum;\\n }\\n for(int i=0;i<m;++i){\\n if(f[i]) cout << i+1 << endl;\\n }\\n cout << \\\"end\\\" << endl;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 9264,\n \"score_of_the_acc\": -0.0715,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1238_1105932\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nclass UnionFind {\\nprivate:\\n vector<int> par, rank;\\npublic:\\n UnionFind(int n) {\\n par = rank = vector<int>(n);\\n for(int i = 0; i < n; ++i) par[i] = i;\\n }\\n\\n int find(int x) {\\n return par[x] == x ? x : par[x] = find(par[x]);\\n }\\n\\n bool same(int x, int y) {\\n return find(x) == find(y);\\n }\\n\\n void unite(int x, int y) {\\n x = find(x);\\n y = find(y);\\n if(x == y) return;\\n if(rank[x] < rank[y]) {\\n par[x] = y;\\n } else {\\n par[y] = x;\\n if(rank[x] == rank[y]) ++rank[x];\\n }\\n }\\n};\\n\\nint main() {\\n for(int n, p1, p2; cin >> n >> p1 >> p2 && (n|p1|p2); ) {\\n int m = p1+p2;\\n UnionFind uf(m*2);\\n for(int i = 0; i < n; ++i) {\\n int x, y;\\n string a;\\n cin >> x >> y >> a;\\n --x; --y;\\n if(a == \\\"yes\\\") {\\n uf.unite(x, y);\\n uf.unite(x+m, y+m);\\n } else {\\n uf.unite(x, y+m);\\n uf.unite(x+m, y);\\n }\\n }\\n\\n bool no_flag = false;\\n map<int, pair<int, int> > group;\\n for(int i = 0; i < m; ++i) {\\n if(uf.same(i, i+m)) {\\n no_flag = true;\\n break;\\n }\\n int root = uf.find(i);\\n int add = 1;\\n if(root >= m) {\\n root -= m;\\n add = 0;\\n }\\n group[root].first++;\\n group[root].second += add;\\n }\\n if(no_flag) {\\n cout << \\\"no\\\" << endl;\\n continue;\\n }\\n\\n vector<int> roots;\\n vector<pair<int, int> > v;\\n for(map<int, pair<int,int> >::iterator it = group.begin();\\n it != group.end(); ++it) {\\n roots.push_back(it->first);\\n v.push_back(make_pair(it->second.second, \\n it->second.first - it->second.second));\\n }\\n\\n int size = v.size();\\n vector<vector<int> > dp(size+1, vector<int>(p1+1, 0));\\n vector<vector<int> > prev(size+1, vector<int>(p1+1, -1));\\n dp[0][0] = 1;\\n for(int i = 0; i < v.size(); ++i) {\\n for(int j = 0; j <= p1; ++j) {\\n if(!dp[i][j]) continue;\\n try {\\n int nj = j + v[i].first;\\n if(nj > p1) throw 0;\\n dp[i+1][nj] += 1;\\n prev[i+1][nj] = 0;\\n } catch(...) {}\\n try {\\n int nj = j + v[i].second;\\n if(nj > p1) throw 0;\\n dp[i+1][nj] += 1;\\n prev[i+1][nj] = 1;\\n } catch(...) {}\\n }\\n }\\n\\n if(dp[v.size()][p1] != 1) {\\n cout << \\\"no\\\" << endl;\\n continue;\\n }\\n\\n vector<int> r(m*2);\\n {\\n int i = v.size();\\n int j = p1;\\n while(prev[i][j] != -1) {\\n if(prev[i][j] == 0) {\\n r[roots[i-1]] = 1;\\n j -= v[i-1].first;\\n } else {\\n r[roots[i-1]+m] = 1;\\n j -= v[i-1].second;\\n }\\n --i;\\n }\\n }\\n for(int i = 0; i < m; ++i) {\\n if(r[uf.find(i)]) {\\n cout << i+1 << endl;\\n }\\n }\\n cout << \\\"end\\\" << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1372,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1238_811989\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define REP(i,n) for(int i=0; i<(int)(n); ++i)\\n\\nusing namespace std;\\n\\nconst int MAX_V = 666;\\n\\nint N, P1, P2, M;\\nint d[MAX_V][MAX_V];\\nbool used[MAX_V];\\nint id[MAX_V];\\nint val[MAX_V];\\n\\ntypedef pair<int, int> P;\\nP dfs(int u, int c, int k){\\n if(used[u]) return P(0, 0);\\n used[u] = true;\\n id[u] = k;\\n val[u] = c;\\n P res(0, 0);\\n if(c == 0) res.first ++;\\n if(c == 1) res.second ++;\\n REP(v, M) if(d[u][v] >= 0){\\n P p = dfs(v, c ^ d[u][v], k);\\n res = P(res.first + p.first, res.second + p.second);\\n }\\n return res;\\n}\\n\\nvoid add(int& x, int y){\\n x = min(x + y, 2);\\n}\\n\\nint main(){\\n int N, P1, P2;\\n while(cin >> N >> P1 >> P2 && !(N == 0 && P1 == 0 && P2 == 0)){\\n M = P1 + P2;\\n memset(d, -1, sizeof(d));\\n REP(i, N){\\n int x, y;\\n string s;\\n cin >> x >> y >> s;\\n d[x - 1][y - 1] = d[y - 1][x - 1] = (s[0] == 'y' ? 0 : 1);\\n }\\n memset(used, 0, sizeof(used));\\n int K = 0;\\n vector<P> vp;\\n REP(i, M) if(!used[i]){\\n P p = dfs(i, 0, K++);\\n vp.push_back(p);\\n }\\n\\n int dp[MAX_V][MAX_V] = {};\\n int back[MAX_V][MAX_V] = {};\\n dp[0][0] = 1;\\n for(int i = 0; i < vp.size(); i++){\\n for(int j = M; j >= 0; j--){\\n if(dp[i][j] >= 1){\\n add(dp[i + 1][j + vp[i].first], dp[i][j]);\\n add(dp[i + 1][j + vp[i].second], dp[i][j]);\\n back[i + 1][j + vp[i].first] = 0;\\n back[i + 1][j + vp[i].second] = 1;\\n }\\n }\\n }\\n if(dp[vp.size()][P1] == 1){\\n int curr = P1;\\n for(int i = vp.size() - 1; i >= 0; i--){\\n if(back[i + 1][curr] == 0){\\n curr -= vp[i].first;\\n }else{\\n curr -= vp[i].second;\\n\\n for(int u = 0; u < M; u++)\\n if(id[u] == i)\\n val[u] ^= 1;\\n }\\n }\\n for(int i = 0; i < M; i++){\\n if(val[i] == 0){\\n cout << i + 1 << endl;\\n }\\n }\\n cout << \\\"end\\\" << endl;\\n }else{\\n cout << \\\"no\\\" << endl;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 6432,\n \"score_of_the_acc\": -0.0458,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1238_647391\",\n \"code_snippet\": \"#include<iostream>\\n#include<sstream>\\n#include<algorithm>\\n#include<set>\\n#include<map>\\n#include<queue>\\n#include<complex>\\n#include<cstdio>\\n#include<cstdlib>\\n#include<cstring>\\n#include<cassert>\\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<<__LINE__<<\\\": \\\"<<#x<<\\\" = \\\"<<(x)<<endl\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef pair<int,int> pi;\\nconst int inf = (int)1e9;\\nconst double INF = 1e12, EPS = 1e-9;\\n\\nint q, n, m, p[1200], prev[610][610], dp[610][610];\\nint root(int x){\\n\\tif(p[x] == x) return x;\\n\\treturn p[x] = root(p[x]);\\n}\\nvoid merge(int a, int b){\\n\\ta = root(a); b = root(b);\\n\\tif(a != b) p[b] = a;\\n}\\n\\nint main(){\\n\\twhile(cin >> q >> n >> m, q + n + m){\\n\\t\\trep(i, 2 * (n + m)) p[i] = i;\\n\\t\\trep(i, q){\\n\\t\\t\\tstring c;\\n\\t\\t\\tint a, b;\\n\\t\\t\\tcin >> a >> b >> c;\\n\\t\\t\\ta--; b--;\\n\\t\\t\\tif(c == \\\"yes\\\") rep(j, 2) merge(2 * a + j, 2 * b + j);\\n\\t\\t\\telse rep(j, 2) merge(2 * a + j, 2 * b + 1 - j);\\n\\t\\t}\\n\\t\\tmap<int, vi> s;\\n\\t\\tvector<vi> ys, ns;\\n\\t\\tvector<pi> v;\\n\\t\\tvi ans; int p;\\n\\t\\tbool use[1200] = {};\\n\\t\\t\\n\\t\\trep(i, 2 * (n + m)) s[root(i)].pb(i);\\n\\t\\trep(i, 2 * (n + m)){\\n\\t\\t\\tint t = 0, l = 0, r = root(i);\\n\\t\\t\\tif(use[r / 2]) continue;\\n\\t\\t\\tuse[r / 2] = 1;\\n\\t\\t\\tvi a, b;\\n\\t\\t\\teach(j, s[r]){\\n\\t\\t\\t\\tif(*j % 2) l++, b.pb(*j / 2);\\n\\t\\t\\t\\telse t++, a.pb(*j / 2);\\n\\t\\t\\t}\\n\\t\\t\\tv.pb(mp(t, l));\\n\\t\\t\\tys.pb(a); ns.pb(b);\\n\\t\\t}\\n\\t\\tmemset(dp, 0, sizeof(dp));\\n\\t\\tdp[0][0] = 1;\\n\\t\\trep(i, v.size()) for(int j = n + m; j >= 0; j--) if(dp[i][j]){\\n\\t\\t\\tdp[i][j] = min(dp[i][j], 100);\\n\\t\\t\\tif(j + v[i].first <= n + m) dp[i + 1][j + v[i].first] += dp[i][j], prev[i + 1][j + v[i].first] = 0;\\n\\t\\t\\tif(j + v[i].second<= n + m) dp[i + 1][j + v[i].second]+= dp[i][j], prev[i + 1][j + v[i].second]= 1;\\n\\t\\t}\\n\\t\\tp = v.size() - 1;\\n\\t\\tif(dp[p + 1][n] != 1){\\n\\t\\t\\tcout << \\\"no\\\" << endl;\\n\\t\\t\\tgoto END;\\n\\t\\t}\\n\\t\\twhile(p >= 0){\\n\\t\\t\\tif(prev[p + 1][n]) rep(j, ns[p].size()) ans.pb(ns[p][j]);\\n\\t\\t\\telse rep(j, ys[p].size()) ans.pb(ys[p][j]);\\n\\t\\t\\tn -= prev[p + 1][n] ? ns[p].size() : ys[p].size();\\n\\t\\t\\tp--;\\n\\t\\t}\\n\\t\\tsort(all(ans));\\n\\t\\trep(i, ans.size()) cout << ans[i] + 1 << endl;\\n\\t\\tcout << \\\"end\\\" << endl;\\n\\t\\tEND:;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3084,\n \"score_of_the_acc\": -0.0155,\n \"final_rank\": 2\n }\n]","isConversational":false}}},{"rowIdx":697,"cells":{"group_id":{"kind":"string","value":"aoj_1241_cpp"},"problem_description":{"kind":"string","value":"Problem B:\nLagrange's Four-Square Theorem\nThe fact that any positive integer has a representation as the sum of at most four positive\nsquares (i.e. squares of positive integers) is known as Lagrange’s Four-Square Theorem. The\nfirst published proof of the theorem was given by Joseph-Louis Lagrange in 1770. Your mission\nhowever is not to explain the original proof nor to discover a new proof but to show that the\ntheorem holds for some specific numbers by counting how many such possible representations\nthere are.\nFor a given positive integer n, you should report the number of all representations of n as the\nsum of at most four positive squares. The order of addition does not matter, e.g. you should\nconsider 4\n2\n+ 3\n2\nand 3\n2\n+ 4\n2\nare the same representation.\nFor example, let’s check the case of 25. This integer has just three representations 1\n2\n+2\n2\n+2\n2\n+4\n2\n,\n3\n2\n+ 4\n2\n, and 5\n2\n. Thus you should report 3 in this case. Be careful not to count 4\n2\n+ 3\n2\nand\n3\n2\n+ 4\n2\nseparately.\nInput\nThe input is composed of at most 255 lines, each containing a single positive integer less than\n2\n15\n, followed by a line containing a single zero. The last line is not a part of the input data.\nOutput\nThe output should be composed of lines, each containing a single integer. No other characters\nshould appear in the output.\nThe output integer corresponding to the input integer\nn\nis the number of all representations\nof\nn\nas the sum of at most four positive squares.\nSample Input\n1\n25\n2003\n211\n20007\n0\nOutput for the Sample Input\n1\n3\n48\n7\n738"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1241_10895268","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 pii = pair<int,int>;\nusing pll = 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,s,n) for(ll i = (ll)s;i < (ll)n;i++)\n#define rrep(i,l,r) for(ll i = r-1;i >= l;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\nint main(){\n \n ios_base::sync_with_stdio(0), cin.tie(0);\n vi pw(1 << 8);\n rep(i,0,1 << 8)pw[i] = i*i;\n while(1){\n int n;cin >> n;\n if(!n)break;\n const int MX = 1 << 8;\n int res = 0;\n rep(i,0,MX)rep(j,i,MX)rep(k,j,MX){\n ll d = n-(i*i + j*j + k*k);\n if(k*k <= d && pw[LB(pw,d)] == d)res++;\n }\n cout << res << \"\\n\";\n }\n \n\n return 0;\n}","accuracy":1,"time_ms":730,"memory_kb":3220,"score_of_the_acc":-0.2155,"final_rank":6},{"submission_id":"aoj_1241_10189432","code_snippet":"#include <vector>\n#include <iostream>\nusing namespace std;\n\nint main() {\n\tconst int LIMIT = 1 << 15;\n\tvector<int> counter(LIMIT + 1);\n\tfor (int a = 0; a * a <= LIMIT; a++) {\n\t\tfor (int b = a; a * a + b * b <= LIMIT; b++) {\n\t\t\tfor (int c = b; a * a + b * b + c * c <= LIMIT; c++) {\n\t\t\t\tfor (int d = c; a * a + b * b + c * c + d * d <= LIMIT; d++) {\n\t\t\t\t\tcounter[a * a + b * b + c * c + d * d]++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\twhile (true) {\n\t\tint N;\n\t\tcin >> N;\n\t\tif (N == 0) {\n\t\t\tbreak;\n\t\t}\n\t\tcout << counter[N] << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3436,"score_of_the_acc":-0.0124,"final_rank":1},{"submission_id":"aoj_1241_10022090","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;\n\nvoid solve() {\n int ans = 0;\n\n for (int i = 0; i*i<n; i++) {\n for (int j = i; i*i+j*j<n; j++) {\n for (int k = j; i*i+j*j+k*k<n; k++) {\n if (n-i*i-j*j-k*k >= k*k && (int)pow(n-i*i-j*j-k*k,0.5)*(int)pow(n-i*i-j*j-k*k,0.5) == n-i*i-j*j-k*k) {\n ans++;\n }\n }\n }\n }\n\n cout << ans << endl;\n return;\n}\n\n\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n\n cin >> n;\n while (n != 0) {\n solve();\n cin >> n;\n }\n}","accuracy":1,"time_ms":1800,"memory_kb":3744,"score_of_the_acc":-0.5391,"final_rank":9},{"submission_id":"aoj_1241_9834899","code_snippet":"#include <iostream>\n#include <vector>\n\nint main() {\n std::cin.tie(nullptr)->sync_with_stdio(false);\n\n std::vector dp(5, std::vector<long long>(1 << 15));\n dp[0][0] = 1;\n for (int v{1} ; v * v < (1 << 15) ; v++) {\n std::vector next{dp};\n for (int i{1} ; i <= 4 ; i++) {\n int add{i * v * v};\n for (int j{} ; j + add < (1 << 15) ; j++) {\n for (int k{} ; k + i <= 4 ; k++) {\n next[k + i][j + add] += dp[k][j];\n }\n }\n }\n dp = std::move(next);\n }\n while (true) {\n int v;\n std::cin >> v;\n if (v == 0) break;\n // std::cout << dp[1][v] << ' ' << dp[2][v] << ' ' << dp[3][v] << ' ' << dp[4][v] << std::endl;\n std::cout << dp[1][v] + dp[2][v] + dp[3][v] + dp[4][v] << '\\n';\n }\n}","accuracy":1,"time_ms":50,"memory_kb":5556,"score_of_the_acc":-0.0785,"final_rank":4},{"submission_id":"aoj_1241_9572679","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 main() {\nwhile(1) {\n int N;\n cin >> N;\n if (N == 0) return 0;\n int ANS = 0;\n rep(i,0,200) {\n rep(j,0,i+1) {\n rep(k,0,j+1) {\n if (i*i+j*j+k*k > N) break;\n int l = sqrt(N-i*i-j*j-k*k);\n if (l <= k && i*i+j*j+k*k+l*l == N) ANS++;\n }\n }\n }\n cout << ANS << endl;\n}\n}","accuracy":1,"time_ms":210,"memory_kb":3496,"score_of_the_acc":-0.0719,"final_rank":3},{"submission_id":"aoj_1241_9028215","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;\nint main(void) {\n while(true) {\n ll n;\n cin >> n;\n if(n == 0) break;\n ll ans = 0;\n rep(i, 1, 200) {\n if(i * i == n) ans++;\n if(i * i > n) break;\n rep(j, i, 200) {\n if(i * i + j * j == n) ans++;\n if(i * i + j * j > n) break;\n rep(k, j, 200) {\n if(i * i + j * j + k * k == n) ans++;\n if(i * i + j * j + k * k > n) break;\n rep(l, k, 200) {\n if(i * i + j * j + k * k + l * l == n) ans++;\n if(i * i + j * j + k * k + l * l > n) break;\n }\n }\n }\n }\n cout << ans << '\\n';\n }\n}","accuracy":1,"time_ms":670,"memory_kb":3220,"score_of_the_acc":-0.1981,"final_rank":5},{"submission_id":"aoj_1241_8993567","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 = 3.141592653589793;\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\nvi sq;\n\nint solve(int N){\n int ans = 0;\n for (int a = 0; a * a <= N; a++) for (int b = a; b * b + a * a <= N; b++) for (int c = b; c * c + b * b + a * a <= N; c++){\n int tmp = a * a + b * b + c * c;\n if (tmp <= N && c <= sq[N - tmp]) ans++;\n }\n return ans;\n}\n\nint main(){\n sq.resize(1 << 15, -1);\n for (int i = 0; i * i < 1 << 15; i++) sq[i * i] = i;\n vc<int> ans;\n while (true){\n int N; cin >> N;\n if (N == 0) break;\n ans.push_back(solve(N));\n }\n for (auto x : ans) cout << fixed << setprecision(16) << x << endl;\n}","accuracy":1,"time_ms":60,"memory_kb":3056,"score_of_the_acc":-0.0171,"final_rank":2},{"submission_id":"aoj_1241_8861691","code_snippet":"#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n#include <algorithm>\n#include <bitset>\n#include <cctype>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <deque>\n#include <iostream>\n#include <limits>\n#include <list>\n#include <map>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <utility>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> P;\ntypedef pair<int, P> PP;\nint tx[] = {0, 1, 0, -1};\nint ty[] = {-1, 0, 1, 0};\nstatic const double EPS = 1e-8;\nint dp[1000000][5];\nint main() {\n int n;\n while (~scanf(\"%d\", &n)) {\n if (n == 0)\n break;\n memset(dp, 0, sizeof(dp));\n dp[0][0] = 1;\n for (int i = 1; i * i <= n; i++) {\n for (int k = 1; k <= 4; k++) {\n for (int j = i * i; j <= n; j++) {\n dp[j][k] += dp[j - i * i][k - 1];\n }\n }\n }\n printf(\"%d\\n\", dp[n][4] + dp[n][3] + dp[n][2] + dp[n][1]);\n }\n}","accuracy":1,"time_ms":1630,"memory_kb":22636,"score_of_the_acc":-0.976,"final_rank":18},{"submission_id":"aoj_1241_8861687","code_snippet":"#include <cstdio>\n#include <cstring>\nusing namespace std;\n\nint dp[1000000][5];\n\nint main() {\n int n;\n while (~scanf(\"%d\", &n)) {\n if (n == 0) break;\n\n memset(dp, 0, sizeof(dp));\n dp[0][0] = 1;\n \n for (int i = 1; i * i <= n; i++) {\n int square = i * i; // Store square value to avoid repeated computation\n for (int k = 1; k <= 4; k++) {\n #pragma omp parallel for // Compiler directive for parallel execution\n for (int j = square; j <= n; j++) {\n dp[j][k] += dp[j - square][k - 1];\n }\n }\n }\n\n printf(\"%d\\n\", dp[n][4] + dp[n][3] + dp[n][2] + dp[n][1]);\n }\n}","accuracy":1,"time_ms":1630,"memory_kb":22216,"score_of_the_acc":-0.9652,"final_rank":15},{"submission_id":"aoj_1241_8861685","code_snippet":"#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n#include <algorithm>\n#include <bitset>\n#include <cctype>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <deque>\n#include <iostream>\n#include <limits>\n#include <list>\n#include <map>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <utility>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> P;\ntypedef pair<int, P> PP;\nint tx[] = {0, 1, 0, -1};\nint ty[] = {-1, 0, 1, 0};\nstatic const double EPS = 1e-8;\nint dp[1000000][5];\nint main() {\n int n;\n while (~scanf(\"%d\", &n)) {\n if (n == 0)\n break;\n memset(dp, 0, sizeof(dp));\n dp[0][0] = 1;\n for (int i = 1; i * i <= n; i++) {\n for (int k = 1; k <= 4; k++) {\n for (int j = 0; j <= n - i * i; j++) { // Optimized loop\n dp[j + i * i][k] += dp[j][k - 1]; // Adjusted the index\n }\n }\n }\n printf(\"%d\\n\", dp[n][4] + dp[n][3] + dp[n][2] + dp[n][1]);\n }\n}","accuracy":1,"time_ms":1640,"memory_kb":22736,"score_of_the_acc":-0.9815,"final_rank":19},{"submission_id":"aoj_1241_8836958","code_snippet":"#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n#include <algorithm>\n#include <bitset>\n#include <cctype>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <deque>\n#include <iostream>\n#include <limits>\n#include <list>\n#include <map>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <utility>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> P;\ntypedef pair<int, P> PP;\nint tx[] = {0, 1, 0, -1};\nint ty[] = {-1, 0, 1, 0};\nstatic const double EPS = 1e-8;\n\nint main() {\n int n;\n while (~scanf(\"%d\", &n)) {\n if (n == 0)\n break;\n int** dp = new int*[n + 1];\n for (int i = 0; i <= n; i++) {\n dp[i] = new int[5];\n memset(dp[i], 0, sizeof(int) * 5);\n }\n dp[0][0] = 1;\n for (int i = 1; i * i <= n; i++) {\n int square = i * i;\n for (int k = 1; k <= 4; k++) {\n for (int j = square; j <= n; j++) {\n dp[j][k] += dp[j - square][k - 1];\n }\n }\n }\n printf(\"%d\\n\", dp[n][4] + dp[n][3] + dp[n][2] + dp[n][1]);\n\n for (int i = 0; i <= n; i++) {\n delete[] dp[i];\n }\n delete[] dp;\n }\n}","accuracy":1,"time_ms":2700,"memory_kb":4112,"score_of_the_acc":-0.8095,"final_rank":12},{"submission_id":"aoj_1241_8819380","code_snippet":"#define _USE_MATH_DEFINES\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\nusing namespace std;\ntypedef long long ll;\nstatic const double EPS = 1e-8;\nint dp[1000000][5];\nint main() {\n int n;\n while (~scanf(\"%d\", &n)) {\n if (n == 0)\n break;\n memset(dp, 0, sizeof(dp));\n dp[0][0] = 1;\n for (int i = 1; i * i <= n; i++) {\n int square = i * i; // Calculate i*i once to avoid repeated calculations\n for (int k = 1; k <= 4; k++) {\n for (int j = square; j <= n; j++) {\n dp[j][k] += dp[j - square][k - 1];\n }\n }\n }\n printf(\"%d\\n\", dp[n][4] + dp[n][3] + dp[n][2] + dp[n][1]);\n }\n}","accuracy":1,"time_ms":1620,"memory_kb":22144,"score_of_the_acc":-0.9604,"final_rank":13},{"submission_id":"aoj_1241_8819378","code_snippet":"#include <cstdio>\n#include <cstring>\nusing namespace std;\n\nstatic const int MAX_N = 100000;\nint dp[MAX_N][5];\n\nint main() {\n int n;\n while (~scanf(\"%d\", &n)) {\n if (n == 0)\n break;\n memset(dp, 0, sizeof(dp));\n dp[0][0] = 1;\n for (int i = 1; i * i <= n; i++) {\n int sq = i * i;\n for (int k = 1; k <= 4; k++) {\n for (int j = sq; j <= n; j++) {\n dp[j][k] += dp[j - sq][k - 1];\n }\n }\n }\n int result = dp[n][4] + dp[n][3] + dp[n][2] + dp[n][1];\n printf(\"%d\\n\", result);\n }\n}","accuracy":1,"time_ms":1370,"memory_kb":4532,"score_of_the_acc":-0.4348,"final_rank":8},{"submission_id":"aoj_1241_8819377","code_snippet":"#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\nusing namespace std;\nint dp[1000000][5];\nint main() {\n int n;\n while (~scanf(\"%d\", &n)) {\n if (n == 0)\n break;\n memset(dp, 0, sizeof(dp));\n dp[0][0] = 1;\n for (int i = 1; i * i <= n; i++) {\n int square = i * i;\n for (int k = 1; k <= 4; k++) {\n for (int j = square; j <= n; j++) {\n dp[j][k] += dp[j - square][k - 1];\n }\n }\n }\n printf(\"%d\\n\", dp[n][4] + dp[n][3] + dp[n][2] + dp[n][1]);\n }\n}","accuracy":1,"time_ms":1640,"memory_kb":22212,"score_of_the_acc":-0.968,"final_rank":17},{"submission_id":"aoj_1241_8819374","code_snippet":"#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n#include <algorithm>\n#include <bitset>\n#include <cctype>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <deque>\n#include <iostream>\n#include <limits>\n#include <list>\n#include <map>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <utility>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> P;\ntypedef pair<int, P> PP;\nint tx[] = {0, 1, 0, -1};\nint ty[] = {-1, 0, 1, 0};\nstatic const double EPS = 1e-8;\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n int n;\n while (~scanf(\"%d\", &n)) {\n if (n == 0)\n break;\n int dp[n+1][5];\n memset(dp, 0, sizeof(dp));\n dp[0][0] = 1;\n for (int i = 1; i * i <= n; i++) {\n int square = i * i;\n for (int k = 1; k <= 4; k++) {\n for (int j = square; j <= n; j++) {\n dp[j][k] += dp[j - square][k - 1];\n }\n }\n }\n printf(\"%d\\n\", dp[n][4] + dp[n][3] + dp[n][2] + dp[n][1]);\n }\n}","accuracy":1,"time_ms":1380,"memory_kb":3864,"score_of_the_acc":-0.4205,"final_rank":7},{"submission_id":"aoj_1241_8807889","code_snippet":"#include <cstdio>\n#include <cstring>\n\nint dp[1000000][5];\n\nint main() {\n int n;\n while (scanf(\"%d\", &n) != EOF) {\n if (n == 0)\n break;\n memset(dp, 0, sizeof(dp));\n dp[0][0] = 1;\n for (int i = 1; i * i <= n; i++) {\n for (int k = 1; k <= 4; k++) {\n for (int j = i * i; j <= n; j++) {\n dp[j][k] += dp[j - i * i][k - 1];\n }\n }\n }\n printf(\"%d\\n\", dp[n][4] + dp[n][3] + dp[n][2] + dp[n][1]);\n }\n}","accuracy":1,"time_ms":1640,"memory_kb":22116,"score_of_the_acc":-0.9655,"final_rank":16},{"submission_id":"aoj_1241_8807888","code_snippet":"#include <cstdio>\n#include <cstring>\n\nconst int MAX_N = 1000000;\nconst int MAX_K = 5;\n\nlong long dp[MAX_N][MAX_K];\n\nint main() {\n int n;\n while (~scanf(\"%d\", &n)) {\n if (n == 0)\n break;\n memset(dp, 0, sizeof(dp));\n dp[0][0] = 1;\n for (int i = 1; i * i <= n; i++) {\n for (int k = 1; k <= 4; k++) {\n for (int j = i * i; j <= n; j++) {\n dp[j][k] += dp[j - i * i][k - 1];\n }\n }\n }\n printf(\"%lld\\n\", dp[n][4] + dp[n][3] + dp[n][2] + dp[n][1]);\n }\n}","accuracy":1,"time_ms":3460,"memory_kb":41816,"score_of_the_acc":-2,"final_rank":20},{"submission_id":"aoj_1241_8807884","code_snippet":"#include <cstdio>\n#include <cstring>\n\nint main() {\n int n;\n while (~scanf(\"%d\", &n)) {\n if (n == 0)\n break;\n \n int** dp = new int*[n+1];\n for (int i = 0; i <= n; i++) {\n dp[i] = new int[5];\n memset(dp[i], 0, sizeof(int) * 5);\n }\n \n dp[0][0] = 1;\n for (int i = 1; i * i <= n; i++) {\n for (int k = 1; k <= 4; k++) {\n for (int j = i * i; j <= n; j++) {\n dp[j][k] += dp[j - i * i][k - 1];\n }\n }\n }\n \n int result = dp[n][4] + dp[n][3] + dp[n][2] + dp[n][1];\n \n for (int i = 0; i <= n; i++) {\n delete[] dp[i];\n }\n delete[] dp;\n \n printf(\"%d\\n\", result);\n }\n}","accuracy":1,"time_ms":2700,"memory_kb":3720,"score_of_the_acc":-0.7994,"final_rank":11},{"submission_id":"aoj_1241_8807879","code_snippet":"#include <cstdio>\n#include <cstring>\n#include <cmath>\n\nconst int MAX_N = 1000000;\nconst int MAX_K = 5;\n\nint dp[MAX_N][MAX_K];\n\nint main() {\n int n;\n while (~scanf(\"%d\", &n)) {\n if (n == 0)\n break;\n memset(dp, 0, sizeof(dp));\n dp[0][0] = 1;\n for (int i = 1; i <= sqrt(n); i++) {\n for (int k = 1; k <= 4; k++) {\n for (int j = i * i; j <= n; j++) {\n dp[j][k] += dp[j - i * i][k - 1];\n }\n }\n }\n printf(\"%d\\n\", dp[n][4] + dp[n][3] + dp[n][2] + dp[n][1]);\n }\n}","accuracy":1,"time_ms":1630,"memory_kb":22212,"score_of_the_acc":-0.9651,"final_rank":14},{"submission_id":"aoj_1241_8396148","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nint sum(long long n, int m, long long ini){\n if(n == 0) return 1;\n if(m == 0) return 0;\n int res = 0;\n for(long long i=ini;i*i<=n;i++){\n res += sum(n-i*i, m-1, i);\n }\n return res;\n}\nint main(){\n long long n;\n while(cin >> n, n){\n cout << sum(n, 4, 1) << endl;\n }\n return(0);\n}","accuracy":1,"time_ms":1920,"memory_kb":2956,"score_of_the_acc":-0.5536,"final_rank":10}],"string":"[\n {\n \"submission_id\": \"aoj_1241_10895268\",\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 pii = pair<int,int>;\\nusing pll = 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,s,n) for(ll i = (ll)s;i < (ll)n;i++)\\n#define rrep(i,l,r) for(ll i = r-1;i >= l;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\\nint main(){\\n \\n ios_base::sync_with_stdio(0), cin.tie(0);\\n vi pw(1 << 8);\\n rep(i,0,1 << 8)pw[i] = i*i;\\n while(1){\\n int n;cin >> n;\\n if(!n)break;\\n const int MX = 1 << 8;\\n int res = 0;\\n rep(i,0,MX)rep(j,i,MX)rep(k,j,MX){\\n ll d = n-(i*i + j*j + k*k);\\n if(k*k <= d && pw[LB(pw,d)] == d)res++;\\n }\\n cout << res << \\\"\\\\n\\\";\\n }\\n \\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 730,\n \"memory_kb\": 3220,\n \"score_of_the_acc\": -0.2155,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1241_10189432\",\n \"code_snippet\": \"#include <vector>\\n#include <iostream>\\nusing namespace std;\\n\\nint main() {\\n\\tconst int LIMIT = 1 << 15;\\n\\tvector<int> counter(LIMIT + 1);\\n\\tfor (int a = 0; a * a <= LIMIT; a++) {\\n\\t\\tfor (int b = a; a * a + b * b <= LIMIT; b++) {\\n\\t\\t\\tfor (int c = b; a * a + b * b + c * c <= LIMIT; c++) {\\n\\t\\t\\t\\tfor (int d = c; a * a + b * b + c * c + d * d <= LIMIT; d++) {\\n\\t\\t\\t\\t\\tcounter[a * a + b * b + c * c + d * d]++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\twhile (true) {\\n\\t\\tint N;\\n\\t\\tcin >> N;\\n\\t\\tif (N == 0) {\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tcout << counter[N] << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3436,\n \"score_of_the_acc\": -0.0124,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1241_10022090\",\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;\\n\\nvoid solve() {\\n int ans = 0;\\n\\n for (int i = 0; i*i<n; i++) {\\n for (int j = i; i*i+j*j<n; j++) {\\n for (int k = j; i*i+j*j+k*k<n; k++) {\\n if (n-i*i-j*j-k*k >= k*k && (int)pow(n-i*i-j*j-k*k,0.5)*(int)pow(n-i*i-j*j-k*k,0.5) == n-i*i-j*j-k*k) {\\n ans++;\\n }\\n }\\n }\\n }\\n\\n cout << ans << endl;\\n return;\\n}\\n\\n\\nint main() {\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n\\n cin >> n;\\n while (n != 0) {\\n solve();\\n cin >> n;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1800,\n \"memory_kb\": 3744,\n \"score_of_the_acc\": -0.5391,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1241_9834899\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n\\nint main() {\\n std::cin.tie(nullptr)->sync_with_stdio(false);\\n\\n std::vector dp(5, std::vector<long long>(1 << 15));\\n dp[0][0] = 1;\\n for (int v{1} ; v * v < (1 << 15) ; v++) {\\n std::vector next{dp};\\n for (int i{1} ; i <= 4 ; i++) {\\n int add{i * v * v};\\n for (int j{} ; j + add < (1 << 15) ; j++) {\\n for (int k{} ; k + i <= 4 ; k++) {\\n next[k + i][j + add] += dp[k][j];\\n }\\n }\\n }\\n dp = std::move(next);\\n }\\n while (true) {\\n int v;\\n std::cin >> v;\\n if (v == 0) break;\\n // std::cout << dp[1][v] << ' ' << dp[2][v] << ' ' << dp[3][v] << ' ' << dp[4][v] << std::endl;\\n std::cout << dp[1][v] + dp[2][v] + dp[3][v] + dp[4][v] << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 5556,\n \"score_of_the_acc\": -0.0785,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1241_9572679\",\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 main() {\\nwhile(1) {\\n int N;\\n cin >> N;\\n if (N == 0) return 0;\\n int ANS = 0;\\n rep(i,0,200) {\\n rep(j,0,i+1) {\\n rep(k,0,j+1) {\\n if (i*i+j*j+k*k > N) break;\\n int l = sqrt(N-i*i-j*j-k*k);\\n if (l <= k && i*i+j*j+k*k+l*l == N) ANS++;\\n }\\n }\\n }\\n cout << ANS << endl;\\n}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 3496,\n \"score_of_the_acc\": -0.0719,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1241_9028215\",\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;\\nint main(void) {\\n while(true) {\\n ll n;\\n cin >> n;\\n if(n == 0) break;\\n ll ans = 0;\\n rep(i, 1, 200) {\\n if(i * i == n) ans++;\\n if(i * i > n) break;\\n rep(j, i, 200) {\\n if(i * i + j * j == n) ans++;\\n if(i * i + j * j > n) break;\\n rep(k, j, 200) {\\n if(i * i + j * j + k * k == n) ans++;\\n if(i * i + j * j + k * k > n) break;\\n rep(l, k, 200) {\\n if(i * i + j * j + k * k + l * l == n) ans++;\\n if(i * i + j * j + k * k + l * l > n) break;\\n }\\n }\\n }\\n }\\n cout << ans << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 670,\n \"memory_kb\": 3220,\n \"score_of_the_acc\": -0.1981,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1241_8993567\",\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 = 3.141592653589793;\\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\\nvi sq;\\n\\nint solve(int N){\\n int ans = 0;\\n for (int a = 0; a * a <= N; a++) for (int b = a; b * b + a * a <= N; b++) for (int c = b; c * c + b * b + a * a <= N; c++){\\n int tmp = a * a + b * b + c * c;\\n if (tmp <= N && c <= sq[N - tmp]) ans++;\\n }\\n return ans;\\n}\\n\\nint main(){\\n sq.resize(1 << 15, -1);\\n for (int i = 0; i * i < 1 << 15; i++) sq[i * i] = i;\\n vc<int> ans;\\n while (true){\\n int N; cin >> N;\\n if (N == 0) break;\\n ans.push_back(solve(N));\\n }\\n for (auto x : ans) cout << fixed << setprecision(16) << x << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3056,\n \"score_of_the_acc\": -0.0171,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1241_8861691\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#define INF 0x3f3f3f3f\\n#include <algorithm>\\n#include <bitset>\\n#include <cctype>\\n#include <cmath>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <deque>\\n#include <iostream>\\n#include <limits>\\n#include <list>\\n#include <map>\\n#include <queue>\\n#include <set>\\n#include <sstream>\\n#include <stack>\\n#include <string>\\n#include <utility>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int, int> P;\\ntypedef pair<int, P> PP;\\nint tx[] = {0, 1, 0, -1};\\nint ty[] = {-1, 0, 1, 0};\\nstatic const double EPS = 1e-8;\\nint dp[1000000][5];\\nint main() {\\n int n;\\n while (~scanf(\\\"%d\\\", &n)) {\\n if (n == 0)\\n break;\\n memset(dp, 0, sizeof(dp));\\n dp[0][0] = 1;\\n for (int i = 1; i * i <= n; i++) {\\n for (int k = 1; k <= 4; k++) {\\n for (int j = i * i; j <= n; j++) {\\n dp[j][k] += dp[j - i * i][k - 1];\\n }\\n }\\n }\\n printf(\\\"%d\\\\n\\\", dp[n][4] + dp[n][3] + dp[n][2] + dp[n][1]);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1630,\n \"memory_kb\": 22636,\n \"score_of_the_acc\": -0.976,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1241_8861687\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstring>\\nusing namespace std;\\n\\nint dp[1000000][5];\\n\\nint main() {\\n int n;\\n while (~scanf(\\\"%d\\\", &n)) {\\n if (n == 0) break;\\n\\n memset(dp, 0, sizeof(dp));\\n dp[0][0] = 1;\\n \\n for (int i = 1; i * i <= n; i++) {\\n int square = i * i; // Store square value to avoid repeated computation\\n for (int k = 1; k <= 4; k++) {\\n #pragma omp parallel for // Compiler directive for parallel execution\\n for (int j = square; j <= n; j++) {\\n dp[j][k] += dp[j - square][k - 1];\\n }\\n }\\n }\\n\\n printf(\\\"%d\\\\n\\\", dp[n][4] + dp[n][3] + dp[n][2] + dp[n][1]);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1630,\n \"memory_kb\": 22216,\n \"score_of_the_acc\": -0.9652,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1241_8861685\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#define INF 0x3f3f3f3f\\n#include <algorithm>\\n#include <bitset>\\n#include <cctype>\\n#include <cmath>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <deque>\\n#include <iostream>\\n#include <limits>\\n#include <list>\\n#include <map>\\n#include <queue>\\n#include <set>\\n#include <sstream>\\n#include <stack>\\n#include <string>\\n#include <utility>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int, int> P;\\ntypedef pair<int, P> PP;\\nint tx[] = {0, 1, 0, -1};\\nint ty[] = {-1, 0, 1, 0};\\nstatic const double EPS = 1e-8;\\nint dp[1000000][5];\\nint main() {\\n int n;\\n while (~scanf(\\\"%d\\\", &n)) {\\n if (n == 0)\\n break;\\n memset(dp, 0, sizeof(dp));\\n dp[0][0] = 1;\\n for (int i = 1; i * i <= n; i++) {\\n for (int k = 1; k <= 4; k++) {\\n for (int j = 0; j <= n - i * i; j++) { // Optimized loop\\n dp[j + i * i][k] += dp[j][k - 1]; // Adjusted the index\\n }\\n }\\n }\\n printf(\\\"%d\\\\n\\\", dp[n][4] + dp[n][3] + dp[n][2] + dp[n][1]);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1640,\n \"memory_kb\": 22736,\n \"score_of_the_acc\": -0.9815,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1241_8836958\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#define INF 0x3f3f3f3f\\n#include <algorithm>\\n#include <bitset>\\n#include <cctype>\\n#include <cmath>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <deque>\\n#include <iostream>\\n#include <limits>\\n#include <list>\\n#include <map>\\n#include <queue>\\n#include <set>\\n#include <sstream>\\n#include <stack>\\n#include <string>\\n#include <utility>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int, int> P;\\ntypedef pair<int, P> PP;\\nint tx[] = {0, 1, 0, -1};\\nint ty[] = {-1, 0, 1, 0};\\nstatic const double EPS = 1e-8;\\n\\nint main() {\\n int n;\\n while (~scanf(\\\"%d\\\", &n)) {\\n if (n == 0)\\n break;\\n int** dp = new int*[n + 1];\\n for (int i = 0; i <= n; i++) {\\n dp[i] = new int[5];\\n memset(dp[i], 0, sizeof(int) * 5);\\n }\\n dp[0][0] = 1;\\n for (int i = 1; i * i <= n; i++) {\\n int square = i * i;\\n for (int k = 1; k <= 4; k++) {\\n for (int j = square; j <= n; j++) {\\n dp[j][k] += dp[j - square][k - 1];\\n }\\n }\\n }\\n printf(\\\"%d\\\\n\\\", dp[n][4] + dp[n][3] + dp[n][2] + dp[n][1]);\\n\\n for (int i = 0; i <= n; i++) {\\n delete[] dp[i];\\n }\\n delete[] dp;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2700,\n \"memory_kb\": 4112,\n \"score_of_the_acc\": -0.8095,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1241_8819380\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\nusing namespace std;\\ntypedef long long ll;\\nstatic const double EPS = 1e-8;\\nint dp[1000000][5];\\nint main() {\\n int n;\\n while (~scanf(\\\"%d\\\", &n)) {\\n if (n == 0)\\n break;\\n memset(dp, 0, sizeof(dp));\\n dp[0][0] = 1;\\n for (int i = 1; i * i <= n; i++) {\\n int square = i * i; // Calculate i*i once to avoid repeated calculations\\n for (int k = 1; k <= 4; k++) {\\n for (int j = square; j <= n; j++) {\\n dp[j][k] += dp[j - square][k - 1];\\n }\\n }\\n }\\n printf(\\\"%d\\\\n\\\", dp[n][4] + dp[n][3] + dp[n][2] + dp[n][1]);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1620,\n \"memory_kb\": 22144,\n \"score_of_the_acc\": -0.9604,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1241_8819378\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstring>\\nusing namespace std;\\n\\nstatic const int MAX_N = 100000;\\nint dp[MAX_N][5];\\n\\nint main() {\\n int n;\\n while (~scanf(\\\"%d\\\", &n)) {\\n if (n == 0)\\n break;\\n memset(dp, 0, sizeof(dp));\\n dp[0][0] = 1;\\n for (int i = 1; i * i <= n; i++) {\\n int sq = i * i;\\n for (int k = 1; k <= 4; k++) {\\n for (int j = sq; j <= n; j++) {\\n dp[j][k] += dp[j - sq][k - 1];\\n }\\n }\\n }\\n int result = dp[n][4] + dp[n][3] + dp[n][2] + dp[n][1];\\n printf(\\\"%d\\\\n\\\", result);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1370,\n \"memory_kb\": 4532,\n \"score_of_the_acc\": -0.4348,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1241_8819377\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#define INF 0x3f3f3f3f\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\nusing namespace std;\\nint dp[1000000][5];\\nint main() {\\n int n;\\n while (~scanf(\\\"%d\\\", &n)) {\\n if (n == 0)\\n break;\\n memset(dp, 0, sizeof(dp));\\n dp[0][0] = 1;\\n for (int i = 1; i * i <= n; i++) {\\n int square = i * i;\\n for (int k = 1; k <= 4; k++) {\\n for (int j = square; j <= n; j++) {\\n dp[j][k] += dp[j - square][k - 1];\\n }\\n }\\n }\\n printf(\\\"%d\\\\n\\\", dp[n][4] + dp[n][3] + dp[n][2] + dp[n][1]);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1640,\n \"memory_kb\": 22212,\n \"score_of_the_acc\": -0.968,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1241_8819374\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#define INF 0x3f3f3f3f\\n#include <algorithm>\\n#include <bitset>\\n#include <cctype>\\n#include <cmath>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <deque>\\n#include <iostream>\\n#include <limits>\\n#include <list>\\n#include <map>\\n#include <queue>\\n#include <set>\\n#include <sstream>\\n#include <stack>\\n#include <string>\\n#include <utility>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int, int> P;\\ntypedef pair<int, P> PP;\\nint tx[] = {0, 1, 0, -1};\\nint ty[] = {-1, 0, 1, 0};\\nstatic const double EPS = 1e-8;\\n\\nint main() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(NULL);\\n int n;\\n while (~scanf(\\\"%d\\\", &n)) {\\n if (n == 0)\\n break;\\n int dp[n+1][5];\\n memset(dp, 0, sizeof(dp));\\n dp[0][0] = 1;\\n for (int i = 1; i * i <= n; i++) {\\n int square = i * i;\\n for (int k = 1; k <= 4; k++) {\\n for (int j = square; j <= n; j++) {\\n dp[j][k] += dp[j - square][k - 1];\\n }\\n }\\n }\\n printf(\\\"%d\\\\n\\\", dp[n][4] + dp[n][3] + dp[n][2] + dp[n][1]);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1380,\n \"memory_kb\": 3864,\n \"score_of_the_acc\": -0.4205,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1241_8807889\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstring>\\n\\nint dp[1000000][5];\\n\\nint main() {\\n int n;\\n while (scanf(\\\"%d\\\", &n) != EOF) {\\n if (n == 0)\\n break;\\n memset(dp, 0, sizeof(dp));\\n dp[0][0] = 1;\\n for (int i = 1; i * i <= n; i++) {\\n for (int k = 1; k <= 4; k++) {\\n for (int j = i * i; j <= n; j++) {\\n dp[j][k] += dp[j - i * i][k - 1];\\n }\\n }\\n }\\n printf(\\\"%d\\\\n\\\", dp[n][4] + dp[n][3] + dp[n][2] + dp[n][1]);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1640,\n \"memory_kb\": 22116,\n \"score_of_the_acc\": -0.9655,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1241_8807888\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstring>\\n\\nconst int MAX_N = 1000000;\\nconst int MAX_K = 5;\\n\\nlong long dp[MAX_N][MAX_K];\\n\\nint main() {\\n int n;\\n while (~scanf(\\\"%d\\\", &n)) {\\n if (n == 0)\\n break;\\n memset(dp, 0, sizeof(dp));\\n dp[0][0] = 1;\\n for (int i = 1; i * i <= n; i++) {\\n for (int k = 1; k <= 4; k++) {\\n for (int j = i * i; j <= n; j++) {\\n dp[j][k] += dp[j - i * i][k - 1];\\n }\\n }\\n }\\n printf(\\\"%lld\\\\n\\\", dp[n][4] + dp[n][3] + dp[n][2] + dp[n][1]);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3460,\n \"memory_kb\": 41816,\n \"score_of_the_acc\": -2,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1241_8807884\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstring>\\n\\nint main() {\\n int n;\\n while (~scanf(\\\"%d\\\", &n)) {\\n if (n == 0)\\n break;\\n \\n int** dp = new int*[n+1];\\n for (int i = 0; i <= n; i++) {\\n dp[i] = new int[5];\\n memset(dp[i], 0, sizeof(int) * 5);\\n }\\n \\n dp[0][0] = 1;\\n for (int i = 1; i * i <= n; i++) {\\n for (int k = 1; k <= 4; k++) {\\n for (int j = i * i; j <= n; j++) {\\n dp[j][k] += dp[j - i * i][k - 1];\\n }\\n }\\n }\\n \\n int result = dp[n][4] + dp[n][3] + dp[n][2] + dp[n][1];\\n \\n for (int i = 0; i <= n; i++) {\\n delete[] dp[i];\\n }\\n delete[] dp;\\n \\n printf(\\\"%d\\\\n\\\", result);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2700,\n \"memory_kb\": 3720,\n \"score_of_the_acc\": -0.7994,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1241_8807879\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstring>\\n#include <cmath>\\n\\nconst int MAX_N = 1000000;\\nconst int MAX_K = 5;\\n\\nint dp[MAX_N][MAX_K];\\n\\nint main() {\\n int n;\\n while (~scanf(\\\"%d\\\", &n)) {\\n if (n == 0)\\n break;\\n memset(dp, 0, sizeof(dp));\\n dp[0][0] = 1;\\n for (int i = 1; i <= sqrt(n); i++) {\\n for (int k = 1; k <= 4; k++) {\\n for (int j = i * i; j <= n; j++) {\\n dp[j][k] += dp[j - i * i][k - 1];\\n }\\n }\\n }\\n printf(\\\"%d\\\\n\\\", dp[n][4] + dp[n][3] + dp[n][2] + dp[n][1]);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1630,\n \"memory_kb\": 22212,\n \"score_of_the_acc\": -0.9651,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1241_8396148\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nint sum(long long n, int m, long long ini){\\n if(n == 0) return 1;\\n if(m == 0) return 0;\\n int res = 0;\\n for(long long i=ini;i*i<=n;i++){\\n res += sum(n-i*i, m-1, i);\\n }\\n return res;\\n}\\nint main(){\\n long long n;\\n while(cin >> n, n){\\n cout << sum(n, 4, 1) << endl;\\n }\\n return(0);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1920,\n \"memory_kb\": 2956,\n \"score_of_the_acc\": -0.5536,\n \"final_rank\": 10\n }\n]","isConversational":false}}},{"rowIdx":698,"cells":{"group_id":{"kind":"string","value":"aoj_1247_cpp"},"problem_description":{"kind":"string","value":"Problem H:\nMonster Trap\nOnce upon a time when people still believed in magic, there was a great wizard Aranyaka\nGondlir. After twenty years of hard training in a deep forest, he had finally mastered ultimate\nmagic, and decided to leave the forest for his home.\nArriving at his home village, Aranyaka was very surprised at the extraordinary desolation. A\ngloom had settled over the village. Even the whisper of the wind could scare villagers. It was a\nmere shadow of what it had been.\nWhat had happened? Soon he recognized a sure sign of an evil monster that is immortal. Even\nthe great wizard could not kill it, and so he resolved to seal it with magic. Aranyaka could cast\na spell to create a monster trap: once he had drawn a line on the ground with his magic rod,\nthe line would function as a barrier wall that any monster could not get over. Since he could\nonly draw straight lines, he had to draw several lines to complete a monster trap, i.e., magic\nbarrier walls enclosing the monster. If there was a gap between barrier walls, the monster could\neasily run away through the gap.\nFor instance, a complete monster trap without any gaps is built by the barrier walls in the left\nfigure, where “M” indicates the position of the monster. In contrast, the barrier walls in the\nright figure have a loophole, even though it is almost complete.\nYour mission is to write a program to tell whether or not the wizard has successfully sealed the\nmonster.\nInput\nThe input consists of multiple data sets, each in the following format.\nn\nx\n1\ny\n1\nx'\n1\ny'\n1\nx\n2\ny\n2\nx'\n2\ny'\n2\n...\nx\nn\ny\nn\nx'\nn\ny'\nn\nThe first line of a data set contains a positive integer n, which is the number of the line segments\ndrawn by the wizard. Each of the following\nn\ninput lines contains four integers\nx\n,\ny\n,\nx'\n, and\ny'\n, which represent the\nx\n- and\ny\n-coordinates of two points (\nx\n,\ny\n) and (\nx'\n,\ny'\n) connected by a line\nsegment. You may assume that all line segments have non-zero lengths. You may also assume\nthat\nn\nis less than or equal to 100 and that all coordinates are between -50 and 50, inclusive.\nFor your convenience, the coordinate system is arranged so that the monster is always on the\norigin (0, 0). The wizard never draws lines crossing (0, 0).\nYou may assume that any two line segments have at most one intersection point and that no\nthree line segments share the same intersection point. You may also assume that the distance\nbetween any two intersection points is greater than 10\n-5\n.\nAn input line containing a zero indicates the end of the input.\nOutput\nFor each data set, print “yes” or “no” in a line. If a monster trap is completed, print “yes”.\nOtherwise, i.e., if there is a loophole, print “no”.\nSample Input\n8\n-7 9 6 9\n-5 5 6 5\n-10 -5 10 -5\n-6 9 -9 -6\n6 9 9 -6\n-1 -2 -3 10\n1 -2 3 10\n-2 -3 2 -3\n8\n-7 9 5 7\n-5 5 6 5\n-10 -5 10 -5\n-6 9 -9 -6\n6 9 9 -6\n-1 -2 -3 10\n1 -2 3 10\n-2 -3 2 -3\n0\nOutput for the Sample Input\nyes\nno"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1247_8388160","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 //オーバーフローに注意\n#define MOD 998244353\n//#define MOD 1000000007\n#define EPS 0.000000001\n\n\n\n#define SIZE 30005\n\n\nstruct Point{\n\tPoint(double arg_x,double arg_y){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t}\n\n\tPoint(){\n\t\tx = y = 0.0;\n\t}\n\n\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\n\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\n\tPoint operator * (double a){ return Point(a*x,a*y); }\n\tPoint operator / (double a){ return Point(x/a,y/a); }\n\n\tdouble abs(){ return sqrt(norm()); }\n\tdouble norm(){ return x*x + y*y; }\n\n\tbool operator<(const Point &p) const{\n\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\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\n\nint N;\nLine line[SIZE];\nPoint point[SIZE];\nvector<Point> V[SIZE];\nvector<int> G[SIZE],ON_SEG[SIZE],CONTAIN[SIZE],EDGES;\nset<int> SET;\nPolygon POL;\nbool CATCH,DEL[SIZE],visited[SIZE];\nmap<pair<int,int>,int> MAP;\nint numE = 0,numDEG[SIZE];\nmap<int,pair<int,int>> REV;\n\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\n\n//交点を求める関数\nPoint calc_Cross_Point(double x1,double x2,double x3,double x4,double y1,double y2,double y3,double y4){\n\tPoint ret;\n\tret.x = ((x2-x1)*(y3*(x4-x3)+x3*(y3-y4))-(x4-x3)*(y1*(x2-x1)+x1*(y1-y2)))/((y2-y1)*(x4-x3)-(y4-y3)*(x2-x1));\n\tif(fabs(x1-x2) > EPS){\n\t\tret.y = ((y2-y1)*ret.x+y1*(x2-x1)+x1*(y1-y2))/(x2-x1);\n\t}else{\n\t\tret.y = ((y4-y3)*ret.x+y3*(x4-x3)+x3*(y3-y4))/(x4-x3);\n\t}\n\treturn ret;\n}\n\n//インタフェース関数\nPoint calc_Cross_Point(Point a,Point b,Point c,Point d){\n\treturn calc_Cross_Point(a.x,b.x,c.x,d.x,a.y,b.y,c.y,d.y);\n}\n\nPoint calc_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\ndouble calc_len(Vector a){\n return sqrt(a.x*a.x+a.y*a.y);\n}\n\n\n//線分ではなく直線と点の距離\ndouble getDistanceLP(Line l,Point p){\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\n}\n\n//点と線分の距離\ndouble getDistanceSP(Line l,Point p){\n\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\n\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\n\treturn getDistanceLP(l,p);\n}\n\n//線分と線分の距離\ndouble getDistance(Line A,Line B){\n\tif(is_Cross(A,B))return 0.0;\n\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\n\t\t\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\n}\n\nPoint calc_Cross_Point(Line A,Line B){\n\n\tif(getDistanceSP(B,A.p[0]) < EPS){\n\n\t\treturn A.p[0];\n\n\t}else if(getDistanceSP(B,A.p[1]) < EPS){\n\n\t\treturn A.p[1];\n\n\t}else if(getDistanceSP(A,B.p[0]) < EPS){\n\n\t\treturn B.p[0];\n\n\t}else if(getDistanceSP(A,B.p[1]) < EPS){\n\n\t\treturn B.p[1];\n\t}\n\n\treturn calc_Cross_Point(A.p[0],A.p[1],B.p[0],B.p[1]);\n}\n\n/*\n * IN 2\n * ON 1\n * OUT 0\n *\n */\nint contains(Polygon g,Point p){\n\tint n = g.size();\n\tbool x = false;\n\tfor(int i = 0; i < n; i++){\n\t\tPoint a = g[i]-p,b = g[(i+1)%n]-p;\n\t\tif(abs(cross(a,b)) < EPS && dot(a,b) < EPS)return 1;\n\t\tif(a.y > b.y)swap(a,b);\n\t\tif(a.y < EPS && EPS < b.y && cross(a,b) > EPS) x = !x;\n\t}\n\treturn (x ? 2:0);\n}\n\n//2つのvectorがなすラジアンを求める関数\ndouble calc_rad(Vector vec1,Vector vec2){\n\n\tdouble tmp = dot(vec1,vec2)/(abs(vec1)*abs(vec2));\n\n\tif(fabs(tmp+1.0) < EPS){\n\n\t\treturn M_PI;\n\t}\n\n\tif(fabs(tmp-1.0) < EPS){\n\n\t\treturn 0.0;\n\t}\n\n\treturn acos(dot(vec1,vec2)/(abs(vec1)*abs(vec2)));\n}\n\n//3点がなすラジアンを求める関数(ccw(base,a,b) == CCW)\ndouble calc_rad(Point base,Point a,Point b){\n\n\tVector vec1 = b-base;\n\tVector vec2 = a-base;\n\n\treturn calc_rad(vec1,vec2);\n}\n\n\n/*\n * ■辺始まり辺終わりにするとWAする\n * 点始まり点終わりにする、ただし途中で訪問した辺は再訪しない■*\n * */\nvoid dfs(int pre,int node){\n\n\tif(CATCH)return;\n\n\tPoint pre_p = point[pre];\n\tPoint now = point[node];\n\n\tdouble mini = BIG_NUM;\n\tint ind = -1;\n\n\tfor(int i = 0; i < G[node].size(); i++){\n\t\tint adj = G[node][i];\n\t\tif(adj == pre)continue;\n\n\t\tPoint next = point[adj];\n\n\t\tdouble tmp_rad;\n\t\tif(ccw(now,pre_p,next) == CLOCKWISE){\n\n\t\t\ttmp_rad = calc_rad(now,next,pre_p);\n\t\t\ttmp_rad = 2*M_PI-tmp_rad;\n\t\t}else{\n\n\t\t\ttmp_rad = calc_rad(now,pre_p,next);\n\t\t}\n\n\n\t\tif(mini > tmp_rad+EPS){\n\n\t\t\tmini = tmp_rad;\n\t\t\tind = i;\n\t\t}\n\t}\n\n\tif(ind == -1)return;\n\n\tint next = G[node][ind];\n\tint next_e_ind = MAP[make_pair(node,G[node][ind])];\n\n\tif(SET.count(next) > 0){\n\n\t\tEDGES.push_back(next_e_ind);\n\n\t\tCATCH = true;\n\t\t//図形が完成した場合、訪問済みの辺は再訪しない\n\t\tfor(int i = 0; i < EDGES.size(); i++){\n\n\t\t\tvisited[EDGES[i]] = true;\n\t\t}\n\n\t\tPolygon work;\n\t\t//■■最初にnextに到達するまでの点は削除する\n\t\tbool FLG = false;\n\t\tfor(int i = 0; i < POL.size(); i++){\n\t\t\tif(POL[i] == point[next]){\n\n\t\t\t\tFLG = true;\n\t\t\t}\n\t\t\tif(!FLG)continue;\n\n\t\t\twork.push_back(POL[i]);\n\t\t}\n\n\t\tPOL.clear();\n\t\tPOL = work;\n\n\t\treturn;\n\t}\n\n\tif(visited[next_e_ind])return;\n\n\tSET.insert(G[node][ind]);\n\tPOL.push_back(point[G[node][ind]]);\n\tEDGES.push_back(next_e_ind);\n\tdfs(node,G[node][ind]);\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\tint num_point = 0;\n\tnumE = 0;\n\n\tMAP.clear();\n\tREV.clear();\n\n\tfor(int i = 0; i < SIZE; i++){\n\n\t\tV[i].clear();\n\t\tG[i].clear();\n\t\tON_SEG[i].clear();\n\t\tCONTAIN[i].clear();\n\t\tvisited[i] = false;\n\t}\n\n\tPoint base = Point(0,0);\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lf %lf %lf %lf\",&line[i].p[0].x,&line[i].p[0].y,&line[i].p[1].x,&line[i].p[1].y);\n\t}\n\n\t//交点を全列挙\n\tfor(int i = 0; i < N-1; i++){\n\t\tfor(int k = i+1; k < N; k++){\n\t\t\tif(!is_Cross(line[i],line[k]))continue;\n\n\t\t\tPoint cross_p = calc_Cross_Point(line[i],line[k]);\n\n\t\t\tbool FLG = true;\n\t\t\tfor(int a = 0; a < num_point; a++){\n\t\t\t\tif(point[a] == cross_p){\n\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)continue;\n\n\t\t\t//辺が持つ点の番号を保存\n\t\t\tCONTAIN[i].push_back(num_point);\n\t\t\tCONTAIN[k].push_back(num_point);\n\n\t\t\t//どの辺の上に乗っているか\n\t\t\tON_SEG[num_point].push_back(i);\n\t\t\tON_SEG[num_point].push_back(k);\n\n\t\t\tpoint[num_point++] = cross_p;\n\t\t\tV[i].push_back(cross_p);\n\t\t\tV[k].push_back(cross_p);\n\t\t}\n\t}\n\n\tfor(int i = 0; i < num_point; i++){\n\n\t\tDEL[i] = false;\n\t}\n\n\n\t//■■交点数が1なら行き止まりなので点を削除\n\tqueue<int> que;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tnumDEG[i] = V[i].size();\n\n\t\tif(numDEG[i] == 1){\n\n\t\t\tint ind = CONTAIN[i][0];\n\n\t\t\tDEL[ind] = true; //点を削除\n\t\t\tque.push(ind);\n\t\t\tnumDEG[i] = 0;\n\t\t}\n\t}\n\n\twhile(!que.empty()){\n\n\t\tint ind = que.front(); //消す点番号\n\t\tque.pop();\n\n\t\tfor(int k = 0; k < ON_SEG[ind].size(); k++){\n\n\t\t\tint seg = ON_SEG[ind][k]; //消す点が含まれている辺番号\n\t\t\tif(numDEG[seg] == 0)continue;\n\n\t\t\tnumDEG[seg]--;\n\t\t\tif(numDEG[seg] == 1){ //■次数が0になった\n\t\t\t\tfor(int a = 0; a < CONTAIN[seg].size(); a++){ //残っている1点を探す\n\n\t\t\t\t\tint tmp_ind = CONTAIN[seg][a]; //点番号\n\t\t\t\t\tif(DEL[tmp_ind])continue;\n\n\t\t\t\t\tDEL[tmp_ind] = true;\n\t\t\t\t\tnumDEG[seg] = 0;\n\t\t\t\t\tque.push(tmp_ind);\n\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\t\tif(V[i].size() <= 1)continue;\n\n\t\tsort(V[i].begin(),V[i].end());\n\n\t\tvector<int> vec; //点番号を並び順に格納\n\n\t\tfor(int k = 0; k < V[i].size(); k++){\n\t\t\tint ind = -1;\n\t\t\tfor(int a = 0; a < num_point; a++){\n\t\t\t\tif(point[a] == V[i][k]){\n\n\t\t\t\t\tind = a;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tvec.push_back(ind);\n\t\t}\n\n\t\tvector<int> work;\n\t\tfor(int k = 0; k < vec.size(); k++){\n\t\t\tif(!DEL[vec[k]]){\n\n\t\t\t\twork.push_back(vec[k]);\n\t\t\t}\n\t\t}\n\n\t\tif(work.size() == 0)continue;\n\n\t\tfor(int k = 0; k < work.size()-1; k++){\n\n\t\t\tint p = work[k];\n\t\t\tint q = work[k+1];\n\n\t\t\t//■辺に向きをつける\n\t\t\tREV[numE] = make_pair(p,q);\n\t\t\tMAP[make_pair(p,q)] = numE++;\n\n\t\t\tREV[numE] = make_pair(q,p);\n\t\t\tMAP[make_pair(q,p)] = numE++;\n\n\t\t\tG[p].push_back(q);\n\t\t\tG[q].push_back(p);\n\t\t}\n\t}\n\n\tfor(int i = 0; i < num_point; i++){\n\t\tif(G[i].size() == 0)continue;\n\n\t\tfor(int k = 0; k < G[i].size(); k++){\n\n\t\t\tint e_ind = MAP[make_pair(i,G[i][k])];\n\t\t\tif(visited[e_ind])continue;\n\n\t\t\tPOL.clear();\n\t\t\tSET.clear();\n\t\t\tEDGES.clear();\n\n\t\t\tPOL.push_back(point[i]);\n\t\t\tPOL.push_back(point[G[i][k]]);\n\n\t\t\tSET.insert(i);\n\t\t\tSET.insert(G[i][k]); //最初の2点を全探索\n\n\t\t\tEDGES.push_back(e_ind);\n\n\t\t\tCATCH = false;\n\t\t\tdfs(i,G[i][k]);\n\t\t\tif(CATCH){\n\n\n\t\t\t\tif(contains(POL,base) == 2){\n\n\t\t\t\t\tprintf(\"yes\\n\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"no\\n\");\n}\n\nint main(){\n\n\twhile(true){\n\n\t\tscanf(\"%d\",&N);\n\t\tif(N == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":60,"memory_kb":11348,"score_of_the_acc":-0.8996,"final_rank":4},{"submission_id":"aoj_1247_8388148","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 //オーバーフローに注意\n#define MOD 998244353\n//#define MOD 1000000007\n#define EPS 0.000000001\n\n\n\n#define SIZE 30005\n\n\nstruct Point{\n\tPoint(double arg_x,double arg_y){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t}\n\n\tPoint(){\n\t\tx = y = 0.0;\n\t}\n\n\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\n\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\n\tPoint operator * (double a){ return Point(a*x,a*y); }\n\tPoint operator / (double a){ return Point(x/a,y/a); }\n\n\tdouble abs(){ return sqrt(norm()); }\n\tdouble norm(){ return x*x + y*y; }\n\n\tbool operator<(const Point &p) const{\n\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\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\n\nint N;\nLine line[SIZE];\nPoint point[SIZE];\nvector<Point> V[SIZE];\nvector<int> G[SIZE],ON_SEG[SIZE],CONTAIN[SIZE],EDGES;\nset<int> SET;\nPolygon POL;\nbool CATCH,DEL[SIZE],visited[SIZE];\nmap<pair<int,int>,int> MAP;\nint numE = 0,numDEG[SIZE];\nmap<int,pair<int,int>> REV;\n\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\n\n//交点を求める関数\nPoint calc_Cross_Point(double x1,double x2,double x3,double x4,double y1,double y2,double y3,double y4){\n\tPoint ret;\n\tret.x = ((x2-x1)*(y3*(x4-x3)+x3*(y3-y4))-(x4-x3)*(y1*(x2-x1)+x1*(y1-y2)))/((y2-y1)*(x4-x3)-(y4-y3)*(x2-x1));\n\tif(fabs(x1-x2) > EPS){\n\t\tret.y = ((y2-y1)*ret.x+y1*(x2-x1)+x1*(y1-y2))/(x2-x1);\n\t}else{\n\t\tret.y = ((y4-y3)*ret.x+y3*(x4-x3)+x3*(y3-y4))/(x4-x3);\n\t}\n\treturn ret;\n}\n\n//インタフェース関数\nPoint calc_Cross_Point(Point a,Point b,Point c,Point d){\n\treturn calc_Cross_Point(a.x,b.x,c.x,d.x,a.y,b.y,c.y,d.y);\n}\n\nPoint calc_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\ndouble calc_len(Vector a){\n return sqrt(a.x*a.x+a.y*a.y);\n}\n\n\n//線分ではなく直線と点の距離\ndouble getDistanceLP(Line l,Point p){\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\n}\n\n//点と線分の距離\ndouble getDistanceSP(Line l,Point p){\n\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\n\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\n\treturn getDistanceLP(l,p);\n}\n\n//線分と線分の距離\ndouble getDistance(Line A,Line B){\n\tif(is_Cross(A,B))return 0.0;\n\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\n\t\t\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\n}\n\nPoint calc_Cross_Point(Line A,Line B){\n\n\tif(getDistanceSP(B,A.p[0]) < EPS){\n\n\t\treturn A.p[0];\n\n\t}else if(getDistanceSP(B,A.p[1]) < EPS){\n\n\t\treturn A.p[1];\n\n\t}else if(getDistanceSP(A,B.p[0]) < EPS){\n\n\t\treturn B.p[0];\n\n\t}else if(getDistanceSP(A,B.p[1]) < EPS){\n\n\t\treturn B.p[1];\n\t}\n\n\treturn calc_Cross_Point(A.p[0],A.p[1],B.p[0],B.p[1]);\n}\n\n/*\n * IN 2\n * ON 1\n * OUT 0\n *\n */\nint contains(Polygon g,Point p){\n\tint n = g.size();\n\tbool x = false;\n\tfor(int i = 0; i < n; i++){\n\t\tPoint a = g[i]-p,b = g[(i+1)%n]-p;\n\t\tif(abs(cross(a,b)) < EPS && dot(a,b) < EPS)return 1;\n\t\tif(a.y > b.y)swap(a,b);\n\t\tif(a.y < EPS && EPS < b.y && cross(a,b) > EPS) x = !x;\n\t}\n\treturn (x ? 2:0);\n}\n\n//2つのvectorがなすラジアンを求める関数\ndouble calc_rad(Vector vec1,Vector vec2){\n\n\tdouble tmp = dot(vec1,vec2)/(abs(vec1)*abs(vec2));\n\n\tif(fabs(tmp+1.0) < EPS){\n\n\t\treturn M_PI;\n\t}\n\n\tif(fabs(tmp-1.0) < EPS){\n\n\t\treturn 0.0;\n\t}\n\n\treturn acos(dot(vec1,vec2)/(abs(vec1)*abs(vec2)));\n}\n\n//3点がなすラジアンを求める関数(ccw(base,a,b) == CCW)\ndouble calc_rad(Point base,Point a,Point b){\n\n\tVector vec1 = b-base;\n\tVector vec2 = a-base;\n\n\treturn calc_rad(vec1,vec2);\n}\n\n\n/*\n * ■辺始まり辺終わりにするとWAする\n * 点始まり点終わりにする、ただし途中で訪問した辺は再訪しない■*\n * */\nvoid dfs(int pre,int node){\n\n\tif(CATCH)return;\n\n\tPoint pre_p = point[pre];\n\tPoint now = point[node];\n\n\tdouble mini = BIG_NUM;\n\tint ind = -1;\n\n\tfor(int i = 0; i < G[node].size(); i++){\n\t\tint adj = G[node][i];\n\t\tif(adj == pre)continue;\n\n\t\tPoint next = point[adj];\n\n\t\tdouble tmp_rad;\n\t\tif(ccw(now,pre_p,next) == CLOCKWISE){\n\n\t\t\ttmp_rad = calc_rad(now,next,pre_p);\n\t\t\ttmp_rad = 2*M_PI-tmp_rad;\n\t\t}else{\n\n\t\t\ttmp_rad = calc_rad(now,pre_p,next);\n\t\t}\n\n\n\t\tif(mini > tmp_rad+EPS){\n\n\t\t\tmini = tmp_rad;\n\t\t\tind = i;\n\t\t}\n\t}\n\n\tif(ind == -1)return;\n\n\tint next = G[node][ind];\n\tint next_e_ind = MAP[make_pair(node,G[node][ind])];\n\n\tif(SET.count(next) > 0){\n\n\t\tEDGES.push_back(next_e_ind);\n\n\t\tCATCH = true;\n\t\t//図形が完成した場合、訪問済みの辺は再訪しない\n\t\tfor(int i = 0; i < EDGES.size(); i++){\n\n\t\t\tvisited[EDGES[i]] = true;\n\t\t}\n\n\t\tPolygon work;\n\t\t//■■最初にnextに到達するまでの点は削除する\n\t\tbool FLG = false;\n\t\tfor(int i = 0; i < POL.size(); i++){\n\t\t\tif(POL[i] == point[next]){\n\n\t\t\t\tFLG = true;\n\t\t\t}\n\t\t\tif(!FLG)continue;\n\n\t\t\twork.push_back(POL[i]);\n\t\t}\n\n\t\tPOL.clear();\n\t\tPOL = work;\n\n\t\treturn;\n\t}\n\n\tif(visited[next_e_ind])return;\n\n\tSET.insert(G[node][ind]);\n\tPOL.push_back(point[G[node][ind]]);\n\tEDGES.push_back(next_e_ind);\n\tdfs(node,G[node][ind]);\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\tint num_point = 0;\n\tnumE = 0;\n\n\tMAP.clear();\n\tREV.clear();\n\n\tfor(int i = 0; i < SIZE; i++){\n\n\t\tV[i].clear();\n\t\tG[i].clear();\n\t\tON_SEG[i].clear();\n\t\tCONTAIN[i].clear();\n\t\tvisited[i] = false;\n\t}\n\n\tPoint base = Point(0,0);\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lf %lf %lf %lf\",&line[i].p[0].x,&line[i].p[0].y,&line[i].p[1].x,&line[i].p[1].y);\n\t}\n\n\t//交点を全列挙\n\tfor(int i = 0; i < N-1; i++){\n\t\tfor(int k = i+1; k < N; k++){\n\t\t\tif(!is_Cross(line[i],line[k]))continue;\n\n\t\t\tPoint cross_p = calc_Cross_Point(line[i],line[k]);\n\n\t\t\tbool FLG = true;\n\t\t\tfor(int a = 0; a < num_point; a++){\n\t\t\t\tif(point[a] == cross_p){\n\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)continue;\n\n\t\t\t//辺が持つ点の番号を保存\n\t\t\tCONTAIN[i].push_back(num_point);\n\t\t\tCONTAIN[k].push_back(num_point);\n\n\t\t\t//どの辺の上に乗っているか\n\t\t\tON_SEG[num_point].push_back(i);\n\t\t\tON_SEG[num_point].push_back(k);\n\n\t\t\tpoint[num_point++] = cross_p;\n\t\t\tV[i].push_back(cross_p);\n\t\t\tV[k].push_back(cross_p);\n\t\t}\n\t}\n\n\tfor(int i = 0; i < num_point; i++){\n\n\t\tDEL[i] = false;\n\t}\n\n\n\t//■■交点数が1なら行き止まりなので点を削除\n\tqueue<int> que;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tnumDEG[i] = V[i].size();\n\n\t\tif(numDEG[i] == 1){\n\n\t\t\tint ind = CONTAIN[i][0];\n\n\t\t\tDEL[ind] = true; //点を削除\n\t\t\tque.push(ind);\n\t\t\tnumDEG[i] = 0;\n\t\t}\n\t}\n\n\twhile(!que.empty()){\n\n\t\tint ind = que.front(); //消す点番号\n\t\tque.pop();\n\n\t\tfor(int k = 0; k < ON_SEG[ind].size(); k++){\n\n\t\t\tint seg = ON_SEG[ind][k]; //消す点が含まれている辺番号\n\t\t\tif(numDEG[seg] == 0)continue;\n\n\t\t\tnumDEG[seg]--;\n\t\t\tif(numDEG[seg] == 1){ //■次数が0になった\n\t\t\t\tfor(int a = 0; a < CONTAIN[seg].size(); a++){ //残っている1点を探す\n\n\t\t\t\t\tint tmp_ind = CONTAIN[seg][a]; //点番号\n\t\t\t\t\tif(DEL[tmp_ind])continue;\n\n\t\t\t\t\tDEL[tmp_ind] = true;\n\t\t\t\t\tnumDEG[seg] = 0;\n\t\t\t\t\tque.push(tmp_ind);\n\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\t\tif(V[i].size() <= 1)continue;\n\n\t\tsort(V[i].begin(),V[i].end());\n\n\t\tvector<int> vec; //点番号を並び順に格納\n\n\t\tfor(int k = 0; k < V[i].size(); k++){\n\t\t\tint ind = -1;\n\t\t\tfor(int a = 0; a < num_point; a++){\n\t\t\t\tif(point[a] == V[i][k]){\n\n\t\t\t\t\tind = a;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tvec.push_back(ind);\n\t\t}\n\n\t\tvector<int> work;\n\t\tfor(int k = 0; k < vec.size(); k++){\n\t\t\tif(!DEL[vec[k]]){\n\n\t\t\t\twork.push_back(vec[k]);\n\t\t\t}\n\t\t}\n\n\t\tif(work.size() == 0)continue;\n\n\t\tfor(int k = 0; k < work.size()-1; k++){\n\n\t\t\tint p = work[k];\n\t\t\tint q = work[k+1];\n\n\t\t\t//■辺に向きをつける\n\t\t\tREV[numE] = make_pair(p,q);\n\t\t\tMAP[make_pair(p,q)] = numE++;\n\n\t\t\tREV[numE] = make_pair(q,p);\n\t\t\tMAP[make_pair(q,p)] = numE++;\n\n\t\t\tG[p].push_back(q);\n\t\t\tG[q].push_back(p);\n\t\t}\n\t}\n\n\tfor(int i = 0; i < num_point; i++){\n\t\tif(G[i].size() == 0)continue;\n\n\t\tvector<pair<double,int>> work;\n\n\t\tfor(int k = 0; k < G[i].size(); k++){\n\n\t\t\tPoint adj = point[G[i][k]]-point[i]; //■注意\n\t\t\tdouble tmp_rad = calc_rad(adj);\n\t\t\twork.push_back(make_pair(tmp_rad,k));\n\t\t}\n\n\t\tsort(work.begin(),work.end());\n\n\t\tint mini_ind = work[0].second;\n\t\tint maxi_ind = work.back().second;\n\n\t\tfor(int k = 0; k < G[i].size(); k++){\n\t\t\tif(k != mini_ind && k != maxi_ind)continue; //■■最も外側の隣接でないならSKIP\n\n\t\t\tint e_ind = MAP[make_pair(i,G[i][k])];\n\t\t\tif(visited[e_ind])continue;\n\n\t\t\tPOL.clear();\n\t\t\tSET.clear();\n\t\t\tEDGES.clear();\n\n\t\t\tPOL.push_back(point[i]);\n\t\t\tPOL.push_back(point[G[i][k]]);\n\n\t\t\tSET.insert(i);\n\t\t\tSET.insert(G[i][k]); //最初の2点を全探索\n\n\t\t\tEDGES.push_back(e_ind);\n\n\t\t\tCATCH = false;\n\t\t\tdfs(i,G[i][k]);\n\t\t\tif(CATCH){\n\n\n\t\t\t\tif(contains(POL,base) == 2){\n\n\t\t\t\t\tprintf(\"yes\\n\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"no\\n\");\n}\n\nint main(){\n\n\twhile(true){\n\n\t\tscanf(\"%d\",&N);\n\t\tif(N == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":50,"memory_kb":11396,"score_of_the_acc":-0.9035,"final_rank":5},{"submission_id":"aoj_1247_8387786","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 //オーバーフローに注意\n#define MOD 998244353\n//#define MOD 1000000007\n#define EPS 0.000000001\n\n\n\n#define SIZE 30005\n\n\nstruct Point{\n\tPoint(double arg_x,double arg_y){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t}\n\n\tPoint(){\n\t\tx = y = 0.0;\n\t}\n\n\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\n\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\n\tPoint operator * (double a){ return Point(a*x,a*y); }\n\tPoint operator / (double a){ return Point(x/a,y/a); }\n\n\tdouble abs(){ return sqrt(norm()); }\n\tdouble norm(){ return x*x + y*y; }\n\n\tbool operator<(const Point &p) const{\n\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\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\n\nint N;\nLine line[SIZE];\nPoint point[SIZE];\nvector<Point> V[SIZE];\nvector<int> G[SIZE],ON_SEG[SIZE],CONTAIN[SIZE],EDGES;\nset<int> SET;\nPolygon POL;\nbool CATCH,DEL[SIZE],visited[SIZE];\nmap<pair<int,int>,int> MAP;\nint numE = 0,numDEG[SIZE];\nmap<int,pair<int,int>> REV;\n\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\n\n//交点を求める関数\nPoint calc_Cross_Point(double x1,double x2,double x3,double x4,double y1,double y2,double y3,double y4){\n\tPoint ret;\n\tret.x = ((x2-x1)*(y3*(x4-x3)+x3*(y3-y4))-(x4-x3)*(y1*(x2-x1)+x1*(y1-y2)))/((y2-y1)*(x4-x3)-(y4-y3)*(x2-x1));\n\tif(fabs(x1-x2) > EPS){\n\t\tret.y = ((y2-y1)*ret.x+y1*(x2-x1)+x1*(y1-y2))/(x2-x1);\n\t}else{\n\t\tret.y = ((y4-y3)*ret.x+y3*(x4-x3)+x3*(y3-y4))/(x4-x3);\n\t}\n\treturn ret;\n}\n\n//インタフェース関数\nPoint calc_Cross_Point(Point a,Point b,Point c,Point d){\n\treturn calc_Cross_Point(a.x,b.x,c.x,d.x,a.y,b.y,c.y,d.y);\n}\n\nPoint calc_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\ndouble calc_len(Vector a){\n return sqrt(a.x*a.x+a.y*a.y);\n}\n\n\n//線分ではなく直線と点の距離\ndouble getDistanceLP(Line l,Point p){\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\n}\n\n//点と線分の距離\ndouble getDistanceSP(Line l,Point p){\n\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\n\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\n\treturn getDistanceLP(l,p);\n}\n\n//線分と線分の距離\ndouble getDistance(Line A,Line B){\n\tif(is_Cross(A,B))return 0.0;\n\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\n\t\t\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\n}\n\nPoint calc_Cross_Point(Line A,Line B){\n\n\tif(getDistanceSP(B,A.p[0]) < EPS){\n\n\t\treturn A.p[0];\n\n\t}else if(getDistanceSP(B,A.p[1]) < EPS){\n\n\t\treturn A.p[1];\n\n\t}else if(getDistanceSP(A,B.p[0]) < EPS){\n\n\t\treturn B.p[0];\n\n\t}else if(getDistanceSP(A,B.p[1]) < EPS){\n\n\t\treturn B.p[1];\n\t}\n\n\treturn calc_Cross_Point(A.p[0],A.p[1],B.p[0],B.p[1]);\n}\n\n/*\n * IN 2\n * ON 1\n * OUT 0\n *\n */\nint contains(Polygon g,Point p){\n\tint n = g.size();\n\tbool x = false;\n\tfor(int i = 0; i < n; i++){\n\t\tPoint a = g[i]-p,b = g[(i+1)%n]-p;\n\t\tif(abs(cross(a,b)) < EPS && dot(a,b) < EPS)return 1;\n\t\tif(a.y > b.y)swap(a,b);\n\t\tif(a.y < EPS && EPS < b.y && cross(a,b) > EPS) x = !x;\n\t}\n\treturn (x ? 2:0);\n}\n\n//2つのvectorがなすラジアンを求める関数\ndouble calc_rad(Vector vec1,Vector vec2){\n\n\tdouble tmp = dot(vec1,vec2)/(abs(vec1)*abs(vec2));\n\n\tif(fabs(tmp+1.0) < EPS){\n\n\t\treturn M_PI;\n\t}\n\n\tif(fabs(tmp-1.0) < EPS){\n\n\t\treturn 0.0;\n\t}\n\n\treturn acos(dot(vec1,vec2)/(abs(vec1)*abs(vec2)));\n}\n\n//3点がなすラジアンを求める関数(ccw(base,a,b) == CCW)\ndouble calc_rad(Point base,Point a,Point b){\n\n\tVector vec1 = b-base;\n\tVector vec2 = a-base;\n\n\treturn calc_rad(vec1,vec2);\n}\n\n\n/*\n * ■辺始まり辺終わりにするとWAする\n * 点始まり点終わりにする、ただし途中で訪問した辺は再訪しない■*\n * */\nvoid dfs(int pre,int node){\n\n\tif(CATCH)return;\n\n\tPoint pre_p = point[pre];\n\tPoint now = point[node];\n\n\tdouble maxi = -BIG_NUM;\n\tint ind = -1;\n\n\tfor(int i = 0; i < G[node].size(); i++){\n\t\tint adj = G[node][i];\n\t\tif(adj == pre)continue;\n\n\t\tPoint next = point[adj];\n\n\t\tdouble tmp_rad = calc_rad(now,pre_p,next);\n\n\t\tif(maxi+EPS < tmp_rad){\n\n\t\t\tmaxi = tmp_rad;\n\t\t\tind = i;\n\t\t}\n\t}\n\n\tif(ind == -1)return;\n\n\tint next = G[node][ind];\n\tint next_e_ind = MAP[make_pair(node,G[node][ind])];\n\n\tif(SET.count(next) > 0){\n\n\t\tEDGES.push_back(next_e_ind);\n\n\t\tCATCH = true;\n\t\t//図形が完成した場合、訪問済みの辺は再訪しない\n\t\tfor(int i = 0; i < EDGES.size(); i++){\n\n\t\t\tvisited[EDGES[i]] = true;\n\t\t}\n\n\t\tPolygon work;\n\t\t//■■最初にnextに到達するまでの点は削除する\n\t\tbool FLG = false;\n\t\tfor(int i = 0; i < POL.size(); i++){\n\t\t\tif(POL[i] == point[next]){\n\n\t\t\t\tFLG = true;\n\t\t\t}\n\t\t\tif(!FLG)continue;\n\n\t\t\twork.push_back(POL[i]);\n\t\t}\n\n\t\tPOL.clear();\n\t\tPOL = work;\n\n\t\treturn;\n\t}\n\n\tif(visited[next_e_ind])return;\n\n\tSET.insert(G[node][ind]);\n\tPOL.push_back(point[G[node][ind]]);\n\tEDGES.push_back(next_e_ind);\n\tdfs(node,G[node][ind]);\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\tint num_point = 0;\n\tnumE = 0;\n\n\tMAP.clear();\n\tREV.clear();\n\n\tfor(int i = 0; i < SIZE; i++){\n\n\t\tV[i].clear();\n\t\tG[i].clear();\n\t\tON_SEG[i].clear();\n\t\tCONTAIN[i].clear();\n\t\tvisited[i] = false;\n\t}\n\n\tPoint base = Point(0,0);\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lf %lf %lf %lf\",&line[i].p[0].x,&line[i].p[0].y,&line[i].p[1].x,&line[i].p[1].y);\n\t}\n\n\t//交点を全列挙\n\tfor(int i = 0; i < N-1; i++){\n\t\tfor(int k = i+1; k < N; k++){\n\t\t\tif(!is_Cross(line[i],line[k]))continue;\n\n\t\t\tPoint cross_p = calc_Cross_Point(line[i],line[k]);\n\n\t\t\tbool FLG = true;\n\t\t\tfor(int a = 0; a < num_point; a++){\n\t\t\t\tif(point[a] == cross_p){\n\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)continue;\n\n\t\t\t//辺が持つ点の番号を保存\n\t\t\tCONTAIN[i].push_back(num_point);\n\t\t\tCONTAIN[k].push_back(num_point);\n\n\t\t\t//どの辺の上に乗っているか\n\t\t\tON_SEG[num_point].push_back(i);\n\t\t\tON_SEG[num_point].push_back(k);\n\n\t\t\tpoint[num_point++] = cross_p;\n\t\t\tV[i].push_back(cross_p);\n\t\t\tV[k].push_back(cross_p);\n\t\t}\n\t}\n\n\tfor(int i = 0; i < num_point; i++){\n\n\t\tDEL[i] = false;\n\t}\n\n\n\t//■■交点数が1なら行き止まりなので点を削除\n\tqueue<int> que;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tnumDEG[i] = V[i].size();\n\n\t\tif(numDEG[i] == 1){\n\n\t\t\tint ind = CONTAIN[i][0];\n\n\t\t\tDEL[ind] = true; //点を削除\n\t\t\tque.push(ind);\n\t\t\tnumDEG[i] = 0;\n\t\t}\n\t}\n\n\twhile(!que.empty()){\n\n\t\tint ind = que.front(); //消す点番号\n\t\tque.pop();\n\n\t\tfor(int k = 0; k < ON_SEG[ind].size(); k++){\n\n\t\t\tint seg = ON_SEG[ind][k]; //消す点が含まれている辺番号\n\t\t\tif(numDEG[seg] == 0)continue;\n\n\t\t\tnumDEG[seg]--;\n\t\t\tif(numDEG[seg] == 1){ //■次数が0になった\n\t\t\t\tfor(int a = 0; a < CONTAIN[seg].size(); a++){ //残っている1点を探す\n\n\t\t\t\t\tint tmp_ind = CONTAIN[seg][a]; //点番号\n\t\t\t\t\tif(DEL[tmp_ind])continue;\n\n\t\t\t\t\tDEL[tmp_ind] = true;\n\t\t\t\t\tnumDEG[seg] = 0;\n\t\t\t\t\tque.push(tmp_ind);\n\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\t\tif(V[i].size() <= 1)continue;\n\n\t\tsort(V[i].begin(),V[i].end());\n\n\t\tvector<int> vec; //点番号を並び順に格納\n\n\t\tfor(int k = 0; k < V[i].size(); k++){\n\t\t\tint ind = -1;\n\t\t\tfor(int a = 0; a < num_point; a++){\n\t\t\t\tif(point[a] == V[i][k]){\n\n\t\t\t\t\tind = a;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tvec.push_back(ind);\n\t\t}\n\n\t\tvector<int> work;\n\t\tfor(int k = 0; k < vec.size(); k++){\n\t\t\tif(!DEL[vec[k]]){\n\n\t\t\t\twork.push_back(vec[k]);\n\t\t\t}\n\t\t}\n\n\t\tif(work.size() == 0)continue;\n\n\t\tfor(int k = 0; k < work.size()-1; k++){\n\n\t\t\tint p = work[k];\n\t\t\tint q = work[k+1];\n\n\t\t\t//■辺に向きをつける\n\t\t\tREV[numE] = make_pair(p,q);\n\t\t\tMAP[make_pair(p,q)] = numE++;\n\n\t\t\tREV[numE] = make_pair(q,p);\n\t\t\tMAP[make_pair(q,p)] = numE++;\n\n\t\t\tG[p].push_back(q);\n\t\t\tG[q].push_back(p);\n\t\t}\n\t}\n\n\tfor(int i = 0; i < num_point; i++){\n\t\tif(G[i].size() == 0)continue;\n\n\t\tvector<pair<double,int>> work;\n\n\t\tfor(int k = 0; k < G[i].size(); k++){\n\n\t\t\tPoint adj = point[G[i][k]]-point[i]; //■注意\n\t\t\tdouble tmp_rad = calc_rad(adj);\n\t\t\twork.push_back(make_pair(tmp_rad,k));\n\t\t}\n\n\t\tsort(work.begin(),work.end());\n\n\t\tint mini_ind = work[0].second;\n\t\tint maxi_ind = work.back().second;\n\n\t\tfor(int k = 0; k < G[i].size(); k++){\n\t\t\tif(k != mini_ind && k != maxi_ind)continue; //■■最も外側の隣接でないならSKIP\n\n\t\t\tint e_ind = MAP[make_pair(i,G[i][k])];\n\t\t\tif(visited[e_ind])continue;\n\n\t\t\tPOL.clear();\n\t\t\tSET.clear();\n\t\t\tEDGES.clear();\n\n\t\t\tPOL.push_back(point[i]);\n\t\t\tPOL.push_back(point[G[i][k]]);\n\n\t\t\tSET.insert(i);\n\t\t\tSET.insert(G[i][k]); //最初の2点を全探索\n\n\t\t\tEDGES.push_back(e_ind);\n\n\t\t\tCATCH = false;\n\t\t\tdfs(i,G[i][k]);\n\t\t\tif(CATCH){\n\n\n\t\t\t\tif(contains(POL,base) == 2){\n\n\t\t\t\t\tprintf(\"yes\\n\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"no\\n\");\n}\n\nint main(){\n\n\twhile(true){\n\n\t\tscanf(\"%d\",&N);\n\t\tif(N == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":170,"memory_kb":11384,"score_of_the_acc":-0.9204,"final_rank":6},{"submission_id":"aoj_1247_8387742","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 //オーバーフローに注意\n#define MOD 998244353\n//#define MOD 1000000007\n#define EPS 0.000000001\n\n\n\n#define SIZE 30005\n\n\nstruct Point{\n\tPoint(double arg_x,double arg_y){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t}\n\n\tPoint(){\n\t\tx = y = 0.0;\n\t}\n\n\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\n\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\n\tPoint operator * (double a){ return Point(a*x,a*y); }\n\tPoint operator / (double a){ return Point(x/a,y/a); }\n\n\tdouble abs(){ return sqrt(norm()); }\n\tdouble norm(){ return x*x + y*y; }\n\n\tbool operator<(const Point &p) const{\n\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\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\n\nint N;\nLine line[SIZE];\nPoint point[SIZE];\nvector<Point> V[SIZE];\nvector<int> G[SIZE],ON_SEG[SIZE],CONTAIN[SIZE],EDGES;\nset<int> SET;\nPolygon POL;\nbool CATCH,DEL[SIZE],visited[SIZE];\nmap<pair<int,int>,int> MAP;\nint numE = 0,numDEG[SIZE];\nmap<int,pair<int,int>> REV;\n\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\n\n//交点を求める関数\nPoint calc_Cross_Point(double x1,double x2,double x3,double x4,double y1,double y2,double y3,double y4){\n\tPoint ret;\n\tret.x = ((x2-x1)*(y3*(x4-x3)+x3*(y3-y4))-(x4-x3)*(y1*(x2-x1)+x1*(y1-y2)))/((y2-y1)*(x4-x3)-(y4-y3)*(x2-x1));\n\tif(fabs(x1-x2) > EPS){\n\t\tret.y = ((y2-y1)*ret.x+y1*(x2-x1)+x1*(y1-y2))/(x2-x1);\n\t}else{\n\t\tret.y = ((y4-y3)*ret.x+y3*(x4-x3)+x3*(y3-y4))/(x4-x3);\n\t}\n\treturn ret;\n}\n\n//インタフェース関数\nPoint calc_Cross_Point(Point a,Point b,Point c,Point d){\n\treturn calc_Cross_Point(a.x,b.x,c.x,d.x,a.y,b.y,c.y,d.y);\n}\n\nPoint calc_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\ndouble calc_len(Vector a){\n return sqrt(a.x*a.x+a.y*a.y);\n}\n\n\n//線分ではなく直線と点の距離\ndouble getDistanceLP(Line l,Point p){\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\n}\n\n//点と線分の距離\ndouble getDistanceSP(Line l,Point p){\n\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\n\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\n\treturn getDistanceLP(l,p);\n}\n\n//線分と線分の距離\ndouble getDistance(Line A,Line B){\n\tif(is_Cross(A,B))return 0.0;\n\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\n\t\t\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\n}\n\nPoint calc_Cross_Point(Line A,Line B){\n\n\tif(getDistanceSP(B,A.p[0]) < EPS){\n\n\t\treturn A.p[0];\n\n\t}else if(getDistanceSP(B,A.p[1]) < EPS){\n\n\t\treturn A.p[1];\n\n\t}else if(getDistanceSP(A,B.p[0]) < EPS){\n\n\t\treturn B.p[0];\n\n\t}else if(getDistanceSP(A,B.p[1]) < EPS){\n\n\t\treturn B.p[1];\n\t}\n\n\treturn calc_Cross_Point(A.p[0],A.p[1],B.p[0],B.p[1]);\n}\n\n/*\n * IN 2\n * ON 1\n * OUT 0\n *\n */\nint contains(Polygon g,Point p){\n\tint n = g.size();\n\tbool x = false;\n\tfor(int i = 0; i < n; i++){\n\t\tPoint a = g[i]-p,b = g[(i+1)%n]-p;\n\t\tif(abs(cross(a,b)) < EPS && dot(a,b) < EPS)return 1;\n\t\tif(a.y > b.y)swap(a,b);\n\t\tif(a.y < EPS && EPS < b.y && cross(a,b) > EPS) x = !x;\n\t}\n\treturn (x ? 2:0);\n}\n\n//2つのvectorがなすラジアンを求める関数\ndouble calc_rad(Vector vec1,Vector vec2){\n\n\tdouble tmp = dot(vec1,vec2)/(abs(vec1)*abs(vec2));\n\n\tif(fabs(tmp+1.0) < EPS){\n\n\t\treturn M_PI;\n\t}\n\n\tif(fabs(tmp-1.0) < EPS){\n\n\t\treturn 0.0;\n\t}\n\n\treturn acos(dot(vec1,vec2)/(abs(vec1)*abs(vec2)));\n}\n\n//3点がなすラジアンを求める関数(ccw(base,a,b) == CCW)\ndouble calc_rad(Point base,Point a,Point b){\n\n\tVector vec1 = b-base;\n\tVector vec2 = a-base;\n\n\treturn calc_rad(vec1,vec2);\n}\n\n\n/*\n * ■辺始まり辺終わりにするとWAする\n * 点始まり点終わりにする、ただし途中で訪問した辺は再訪しない■*\n * */\nvoid dfs(int pre,int node){\n\n\tif(CATCH)return;\n\n\tPoint pre_p = point[pre];\n\tPoint now = point[node];\n\n\tdouble maxi = -BIG_NUM;\n\tint ind = -1;\n\n\tfor(int i = 0; i < G[node].size(); i++){\n\t\tint adj = G[node][i];\n\t\tif(adj == pre)continue;\n\n\t\tPoint next = point[adj];\n\n\t\tdouble tmp_rad = calc_rad(now,pre_p,next);\n\n\t\tif(maxi+EPS < tmp_rad){\n\n\t\t\tmaxi = tmp_rad;\n\t\t\tind = i;\n\t\t}\n\t}\n\n\tif(ind == -1)return;\n\n\tint next = G[node][ind];\n\tint next_e_ind = MAP[make_pair(node,G[node][ind])];\n\n\tif(SET.count(next) > 0){\n\n\t\tCATCH = true;\n\t\t//図形が完成した場合、訪問済みの辺は再訪しない\n\t\tfor(int i = 0; i < EDGES.size(); i++){\n\n\t\t\tvisited[EDGES[i]] = true;\n\t\t}\n\n\t\tPolygon work;\n\t\t//■■最初にnextに到達するまでの点は削除する\n\t\tbool FLG = false;\n\t\tfor(int i = 0; i < POL.size(); i++){\n\t\t\tif(POL[i] == point[next]){\n\n\t\t\t\tFLG = true;\n\t\t\t}\n\t\t\tif(!FLG)continue;\n\n\t\t\twork.push_back(POL[i]);\n\t\t}\n\n\t\tPOL.clear();\n\t\tPOL = work;\n\n\t\treturn;\n\t}\n\n\tif(visited[next_e_ind])return;\n\n\tSET.insert(G[node][ind]);\n\tPOL.push_back(point[G[node][ind]]);\n\t//EDGES.push_back(next_e_ind);\n\tdfs(node,G[node][ind]);\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\tint num_point = 0;\n\tnumE = 0;\n\n\tMAP.clear();\n\tREV.clear();\n\n\tfor(int i = 0; i < SIZE; i++){\n\n\t\tV[i].clear();\n\t\tG[i].clear();\n\t\tON_SEG[i].clear();\n\t\tCONTAIN[i].clear();\n\t\tvisited[i] = false;\n\t}\n\n\tPoint base = Point(0,0);\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lf %lf %lf %lf\",&line[i].p[0].x,&line[i].p[0].y,&line[i].p[1].x,&line[i].p[1].y);\n\t}\n\n\t//交点を全列挙\n\tfor(int i = 0; i < N-1; i++){\n\t\tfor(int k = i+1; k < N; k++){\n\t\t\tif(!is_Cross(line[i],line[k]))continue;\n\n\t\t\tPoint cross_p = calc_Cross_Point(line[i],line[k]);\n\n\t\t\tbool FLG = true;\n\t\t\tfor(int a = 0; a < num_point; a++){\n\t\t\t\tif(point[a] == cross_p){\n\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)continue;\n\n\t\t\t//辺が持つ点の番号を保存\n\t\t\tCONTAIN[i].push_back(num_point);\n\t\t\tCONTAIN[k].push_back(num_point);\n\n\t\t\t//どの辺の上に乗っているか\n\t\t\tON_SEG[num_point].push_back(i);\n\t\t\tON_SEG[num_point].push_back(k);\n\n\t\t\tpoint[num_point++] = cross_p;\n\t\t\tV[i].push_back(cross_p);\n\t\t\tV[k].push_back(cross_p);\n\t\t}\n\t}\n\n\tfor(int i = 0; i < num_point; i++){\n\n\t\tDEL[i] = false;\n\t}\n\n\n\t//■■交点数が1なら行き止まりなので点を削除\n\tqueue<int> que;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tnumDEG[i] = V[i].size();\n\n\t\tif(numDEG[i] == 1){\n\n\t\t\tint ind = CONTAIN[i][0];\n\n\t\t\tDEL[ind] = true; //点を削除\n\t\t\tque.push(ind);\n\t\t\tnumDEG[i] = 0;\n\t\t}\n\t}\n\n\twhile(!que.empty()){\n\n\t\tint ind = que.front(); //消す点番号\n\t\tque.pop();\n\n\t\tfor(int k = 0; k < ON_SEG[ind].size(); k++){\n\n\t\t\tint seg = ON_SEG[ind][k]; //消す点が含まれている辺番号\n\t\t\tif(numDEG[seg] == 0)continue;\n\n\t\t\tnumDEG[seg]--;\n\t\t\tif(numDEG[seg] == 1){ //■次数が0になった\n\t\t\t\tfor(int a = 0; a < CONTAIN[seg].size(); a++){ //残っている1点を探す\n\n\t\t\t\t\tint tmp_ind = CONTAIN[seg][a]; //点番号\n\t\t\t\t\tif(DEL[tmp_ind])continue;\n\n\t\t\t\t\tDEL[tmp_ind] = true;\n\t\t\t\t\tnumDEG[seg] = 0;\n\t\t\t\t\tque.push(tmp_ind);\n\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\t\tif(V[i].size() <= 1)continue;\n\n\t\tsort(V[i].begin(),V[i].end());\n\n\t\tvector<int> vec; //点番号を並び順に格納\n\n\t\tfor(int k = 0; k < V[i].size(); k++){\n\t\t\tint ind = -1;\n\t\t\tfor(int a = 0; a < num_point; a++){\n\t\t\t\tif(point[a] == V[i][k]){\n\n\t\t\t\t\tind = a;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tvec.push_back(ind);\n\t\t}\n\n\t\tvector<int> work;\n\t\tfor(int k = 0; k < vec.size(); k++){\n\t\t\tif(!DEL[vec[k]]){\n\n\t\t\t\twork.push_back(vec[k]);\n\t\t\t}\n\t\t}\n\n\t\tif(work.size() == 0)continue;\n\n\t\tfor(int k = 0; k < work.size()-1; k++){\n\n\t\t\tint p = work[k];\n\t\t\tint q = work[k+1];\n\n\t\t\t//■辺に向きをつける\n\t\t\tREV[numE] = make_pair(p,q);\n\t\t\tMAP[make_pair(p,q)] = numE++;\n\n\t\t\tREV[numE] = make_pair(q,p);\n\t\t\tMAP[make_pair(q,p)] = numE++;\n\n\t\t\tG[p].push_back(q);\n\t\t\tG[q].push_back(p);\n\t\t}\n\t}\n\n\tfor(int i = 0; i < num_point; i++){\n\t\tif(G[i].size() == 0)continue;\n\n\t\tvector<pair<double,int>> work;\n\n\t\tfor(int k = 0; k < G[i].size(); k++){\n\n\t\t\tPoint adj = point[G[i][k]]-point[i]; //■注意\n\t\t\tdouble tmp_rad = calc_rad(adj);\n\t\t\twork.push_back(make_pair(tmp_rad,k));\n\t\t}\n\n\t\tsort(work.begin(),work.end());\n\n\t\tint mini_ind = work[0].second;\n\t\tint maxi_ind = work.back().second;\n\n\t\tfor(int k = 0; k < G[i].size(); k++){\n\t\t\tif(k != mini_ind && k != maxi_ind)continue; //■■最も外側の隣接でないならSKIP\n\n\t\t\tint e_ind = MAP[make_pair(i,G[i][k])];\n\t\t\tif(visited[e_ind])continue;\n\n\t\t\tPOL.clear();\n\t\t\tSET.clear();\n\t\t\tEDGES.clear();\n\n\t\t\tPOL.push_back(point[i]);\n\t\t\tPOL.push_back(point[G[i][k]]);\n\n\t\t\tSET.insert(i);\n\t\t\tSET.insert(G[i][k]); //最初の2点を全探索\n\n\t\t\tEDGES.push_back(e_ind);\n\n\t\t\tCATCH = false;\n\t\t\tdfs(i,G[i][k]);\n\t\t\tif(CATCH){\n\n\n\t\t\t\tif(contains(POL,base) == 2){\n\n\t\t\t\t\tprintf(\"yes\\n\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"no\\n\");\n}\n\nint main(){\n\n\twhile(true){\n\n\t\tscanf(\"%d\",&N);\n\t\tif(N == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":360,"memory_kb":11244,"score_of_the_acc":-0.9337,"final_rank":9},{"submission_id":"aoj_1247_8387201","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 //オーバーフローに注意\n#define MOD 998244353\n//#define MOD 1000000007\n#define EPS 0.000000001\n\n\n\n#define SIZE 30005\n\n\nstruct Point{\n\tPoint(double arg_x,double arg_y){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t}\n\n\tPoint(){\n\t\tx = y = 0.0;\n\t}\n\n\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\n\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\n\tPoint operator * (double a){ return Point(a*x,a*y); }\n\tPoint operator / (double a){ return Point(x/a,y/a); }\n\n\tdouble abs(){ return sqrt(norm()); }\n\tdouble norm(){ return x*x + y*y; }\n\n\tbool operator<(const Point &p) const{\n\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\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\n\nint N;\nLine line[SIZE];\nPoint point[SIZE];\nvector<Point> V[SIZE];\nvector<int> G[SIZE],ON_SEG[SIZE],CONTAIN[SIZE],EDGES;\nset<int> SET;\nPolygon POL;\nbool CATCH,DEL[SIZE],visited[SIZE];\nmap<pair<int,int>,int> MAP;\nint numE = 0,numDEG[SIZE];\nmap<int,pair<int,int>> REV;\n\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\n\n//交点を求める関数\nPoint calc_Cross_Point(double x1,double x2,double x3,double x4,double y1,double y2,double y3,double y4){\n\tPoint ret;\n\tret.x = ((x2-x1)*(y3*(x4-x3)+x3*(y3-y4))-(x4-x3)*(y1*(x2-x1)+x1*(y1-y2)))/((y2-y1)*(x4-x3)-(y4-y3)*(x2-x1));\n\tif(fabs(x1-x2) > EPS){\n\t\tret.y = ((y2-y1)*ret.x+y1*(x2-x1)+x1*(y1-y2))/(x2-x1);\n\t}else{\n\t\tret.y = ((y4-y3)*ret.x+y3*(x4-x3)+x3*(y3-y4))/(x4-x3);\n\t}\n\treturn ret;\n}\n\n//インタフェース関数\nPoint calc_Cross_Point(Point a,Point b,Point c,Point d){\n\treturn calc_Cross_Point(a.x,b.x,c.x,d.x,a.y,b.y,c.y,d.y);\n}\n\nPoint calc_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\ndouble calc_len(Vector a){\n return sqrt(a.x*a.x+a.y*a.y);\n}\n\n\n//線分ではなく直線と点の距離\ndouble getDistanceLP(Line l,Point p){\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\n}\n\n//点と線分の距離\ndouble getDistanceSP(Line l,Point p){\n\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\n\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\n\treturn getDistanceLP(l,p);\n}\n\n//線分と線分の距離\ndouble getDistance(Line A,Line B){\n\tif(is_Cross(A,B))return 0.0;\n\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\n\t\t\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\n}\n\nPoint calc_Cross_Point(Line A,Line B){\n\n\tif(getDistanceSP(B,A.p[0]) < EPS){\n\n\t\treturn A.p[0];\n\n\t}else if(getDistanceSP(B,A.p[1]) < EPS){\n\n\t\treturn A.p[1];\n\n\t}else if(getDistanceSP(A,B.p[0]) < EPS){\n\n\t\treturn B.p[0];\n\n\t}else if(getDistanceSP(A,B.p[1]) < EPS){\n\n\t\treturn B.p[1];\n\t}\n\n\treturn calc_Cross_Point(A.p[0],A.p[1],B.p[0],B.p[1]);\n}\n\n/*\n * IN 2\n * ON 1\n * OUT 0\n *\n */\nint contains(Polygon g,Point p){\n\tint n = g.size();\n\tbool x = false;\n\tfor(int i = 0; i < n; i++){\n\t\tPoint a = g[i]-p,b = g[(i+1)%n]-p;\n\t\tif(abs(cross(a,b)) < EPS && dot(a,b) < EPS)return 1;\n\t\tif(a.y > b.y)swap(a,b);\n\t\tif(a.y < EPS && EPS < b.y && cross(a,b) > EPS) x = !x;\n\t}\n\treturn (x ? 2:0);\n}\n\n//2つのvectorがなすラジアンを求める関数\ndouble calc_rad(Vector vec1,Vector vec2){\n\n\tdouble tmp = dot(vec1,vec2)/(abs(vec1)*abs(vec2));\n\n\tif(fabs(tmp+1.0) < EPS){\n\n\t\treturn M_PI;\n\t}\n\n\tif(fabs(tmp-1.0) < EPS){\n\n\t\treturn 0.0;\n\t}\n\n\treturn acos(dot(vec1,vec2)/(abs(vec1)*abs(vec2)));\n}\n\n//3点がなすラジアンを求める関数(ccw(base,a,b) == CCW)\ndouble calc_rad(Point base,Point a,Point b){\n\n\tVector vec1 = b-base;\n\tVector vec2 = a-base;\n\n\treturn calc_rad(vec1,vec2);\n}\n\n\n/*\n * ■辺始まり辺終わりにするとWAする\n * 点始まり点終わりにする、ただし途中で訪問した辺は再訪しない■*\n * */\nvoid dfs(int pre,int node){\n\n\tif(CATCH)return;\n\n\tPoint pre_p = point[pre];\n\tPoint now = point[node];\n\n\tdouble maxi = -BIG_NUM;\n\tint ind = -1;\n\n\tfor(int i = 0; i < G[node].size(); i++){\n\t\tint adj = G[node][i];\n\t\tif(adj == pre)continue;\n\n\t\tPoint next = point[adj];\n\n\t\tdouble tmp_rad = calc_rad(now,pre_p,next);\n\n\t\tif(maxi+EPS < tmp_rad){\n\n\t\t\tmaxi = tmp_rad;\n\t\t\tind = i;\n\t\t}\n\t}\n\n\tif(ind == -1)return;\n\n\tint next = G[node][ind];\n\tif(SET.count(next) > 0){\n\n\t\tCATCH = true;\n\t\t//図形が完成した場合、訪問済みの辺は再訪しない\n\t\tfor(int i = 0; i < EDGES.size(); i++){\n\n\t\t\tvisited[EDGES[i]] = true;\n\t\t}\n\n\t\tPolygon work;\n\t\t//■■最初にnextに到達するまでの点は削除する\n\t\tbool FLG = false;\n\t\tfor(int i = 0; i < POL.size(); i++){\n\t\t\tif(POL[i] == point[next]){\n\n\t\t\t\tFLG = true;\n\t\t\t}\n\t\t\tif(!FLG)continue;\n\n\t\t\twork.push_back(POL[i]);\n\t\t}\n\n\t\tPOL.clear();\n\t\tPOL = work;\n\n\t\treturn;\n\t}\n\tint next_e_ind = MAP[make_pair(node,G[node][ind])];\n\tif(visited[next_e_ind])return;\n\n\tSET.insert(G[node][ind]);\n\tPOL.push_back(point[G[node][ind]]);\n\tEDGES.push_back(next_e_ind);\n\tdfs(node,G[node][ind]);\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\tint num_point = 0;\n\tnumE = 0;\n\n\tMAP.clear();\n\tREV.clear();\n\n\tfor(int i = 0; i < SIZE; i++){\n\n\t\tV[i].clear();\n\t\tG[i].clear();\n\t\tON_SEG[i].clear();\n\t\tCONTAIN[i].clear();\n\t\tvisited[i] = false;\n\t}\n\n\tPoint base = Point(0,0);\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lf %lf %lf %lf\",&line[i].p[0].x,&line[i].p[0].y,&line[i].p[1].x,&line[i].p[1].y);\n\t}\n\n\t//交点を全列挙\n\tfor(int i = 0; i < N-1; i++){\n\t\tfor(int k = i+1; k < N; k++){\n\t\t\tif(!is_Cross(line[i],line[k]))continue;\n\n\t\t\tPoint cross_p = calc_Cross_Point(line[i],line[k]);\n\n\t\t\tbool FLG = true;\n\t\t\tfor(int a = 0; a < num_point; a++){\n\t\t\t\tif(point[a] == cross_p){\n\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)continue;\n\n\t\t\t//辺が持つ点の番号を保存\n\t\t\tCONTAIN[i].push_back(num_point);\n\t\t\tCONTAIN[k].push_back(num_point);\n\n\t\t\t//どの辺の上に乗っているか\n\t\t\tON_SEG[num_point].push_back(i);\n\t\t\tON_SEG[num_point].push_back(k);\n\n\t\t\tpoint[num_point++] = cross_p;\n\t\t\tV[i].push_back(cross_p);\n\t\t\tV[k].push_back(cross_p);\n\t\t}\n\t}\n\n\tfor(int i = 0; i < num_point; i++){\n\n\t\tDEL[i] = false;\n\t}\n\n\n\t//■■交点数が1なら行き止まりなので点を削除\n\tqueue<int> que;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tnumDEG[i] = V[i].size();\n\n\t\tif(numDEG[i] == 1){\n\n\t\t\tint ind = CONTAIN[i][0];\n\n\t\t\tDEL[ind] = true; //点を削除\n\t\t\tque.push(ind);\n\t\t\tnumDEG[i] = 0;\n\t\t}\n\t}\n\n\twhile(!que.empty()){\n\n\t\tint ind = que.front(); //消す点番号\n\t\tque.pop();\n\n\t\tfor(int k = 0; k < ON_SEG[ind].size(); k++){\n\n\t\t\tint seg = ON_SEG[ind][k]; //消す点が含まれている辺番号\n\t\t\tif(numDEG[seg] == 0)continue;\n\n\t\t\tnumDEG[seg]--;\n\t\t\tif(numDEG[seg] == 1){ //■次数が0になった\n\t\t\t\tfor(int a = 0; a < CONTAIN[seg].size(); a++){ //残っている1点を探す\n\n\t\t\t\t\tint tmp_ind = CONTAIN[seg][a]; //点番号\n\t\t\t\t\tif(DEL[tmp_ind])continue;\n\n\t\t\t\t\tDEL[tmp_ind] = true;\n\t\t\t\t\tnumDEG[seg] = 0;\n\t\t\t\t\tque.push(tmp_ind);\n\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\t\tif(V[i].size() <= 1)continue;\n\n\t\tsort(V[i].begin(),V[i].end());\n\n\t\tvector<int> vec; //点番号を並び順に格納\n\n\t\tfor(int k = 0; k < V[i].size(); k++){\n\t\t\tint ind = -1;\n\t\t\tfor(int a = 0; a < num_point; a++){\n\t\t\t\tif(point[a] == V[i][k]){\n\n\t\t\t\t\tind = a;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tvec.push_back(ind);\n\t\t}\n\n\t\tvector<int> work;\n\t\tfor(int k = 0; k < vec.size(); k++){\n\t\t\tif(!DEL[vec[k]]){\n\n\t\t\t\twork.push_back(vec[k]);\n\t\t\t}\n\t\t}\n\n\t\tif(work.size() == 0)continue;\n\n\t\tfor(int k = 0; k < work.size()-1; k++){\n\n\t\t\tint p = work[k];\n\t\t\tint q = work[k+1];\n\n\t\t\t//■辺に向きをつける\n\t\t\tREV[numE] = make_pair(p,q);\n\t\t\tMAP[make_pair(p,q)] = numE++;\n\n\t\t\tREV[numE] = make_pair(q,p);\n\t\t\tMAP[make_pair(q,p)] = numE++;\n\n\t\t\tG[p].push_back(q);\n\t\t\tG[q].push_back(p);\n\t\t}\n\t}\n\n\tfor(int i = 0; i < num_point; i++){\n\t\tif(G[i].size() == 0)continue;\n\n\t\tvector<pair<double,int>> work;\n\n\t\tfor(int k = 0; k < G[i].size(); k++){\n\n\t\t\tPoint adj = point[G[i][k]]-point[i]; //■注意\n\t\t\tdouble tmp_rad = calc_rad(adj);\n\t\t\twork.push_back(make_pair(tmp_rad,k));\n\t\t}\n\n\t\tsort(work.begin(),work.end());\n\n\t\tint mini_ind = work[0].second;\n\t\tint maxi_ind = work.back().second;\n\n\t\tfor(int k = 0; k < G[i].size(); k++){\n\t\t\tif(k != mini_ind && k != maxi_ind)continue; //■■最も外側の隣接でないならSKIP\n\n\t\t\tint e_ind = MAP[make_pair(i,G[i][k])];\n\t\t\tif(visited[e_ind])continue;\n\n\t\t\tPOL.clear();\n\t\t\tSET.clear();\n\t\t\tEDGES.clear();\n\n\t\t\tPOL.push_back(point[i]);\n\t\t\tPOL.push_back(point[G[i][k]]);\n\n\t\t\tSET.insert(i);\n\t\t\tSET.insert(G[i][k]); //最初の2点を全探索\n\n\t\t\tEDGES.push_back(e_ind);\n\n\t\t\tCATCH = false;\n\t\t\tdfs(i,G[i][k]);\n\t\t\tif(CATCH){\n\n\n\t\t\t\tif(contains(POL,base) == 2){\n\n\t\t\t\t\tprintf(\"yes\\n\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"no\\n\");\n}\n\nint main(){\n\n\twhile(true){\n\n\t\tscanf(\"%d\",&N);\n\t\tif(N == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":190,"memory_kb":11368,"score_of_the_acc":-0.9217,"final_rank":7},{"submission_id":"aoj_1247_8387133","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 //オーバーフローに注意\n#define MOD 998244353\n//#define MOD 1000000007\n#define EPS 0.000000001\n\n\n\n#define SIZE 30005\n\n\nstruct Point{\n\tPoint(double arg_x,double arg_y){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t}\n\n\tPoint(){\n\t\tx = y = 0.0;\n\t}\n\n\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\n\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\n\tPoint operator * (double a){ return Point(a*x,a*y); }\n\tPoint operator / (double a){ return Point(x/a,y/a); }\n\n\tdouble abs(){ return sqrt(norm()); }\n\tdouble norm(){ return x*x + y*y; }\n\n\tbool operator<(const Point &p) const{\n\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\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\n\nint N;\nLine line[SIZE];\nPoint point[SIZE];\nvector<Point> V[SIZE];\nvector<int> G[SIZE],ON_SEG[SIZE],CONTAIN[SIZE],EDGES;\nset<int> SET;\nPolygon POL;\nbool CATCH,DEL[SIZE],visited[SIZE];\nmap<pair<int,int>,int> MAP;\nint numE = 0,numDEG[SIZE];\nmap<int,pair<int,int>> REV;\n\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\n\n//交点を求める関数\nPoint calc_Cross_Point(double x1,double x2,double x3,double x4,double y1,double y2,double y3,double y4){\n\tPoint ret;\n\tret.x = ((x2-x1)*(y3*(x4-x3)+x3*(y3-y4))-(x4-x3)*(y1*(x2-x1)+x1*(y1-y2)))/((y2-y1)*(x4-x3)-(y4-y3)*(x2-x1));\n\tif(fabs(x1-x2) > EPS){\n\t\tret.y = ((y2-y1)*ret.x+y1*(x2-x1)+x1*(y1-y2))/(x2-x1);\n\t}else{\n\t\tret.y = ((y4-y3)*ret.x+y3*(x4-x3)+x3*(y3-y4))/(x4-x3);\n\t}\n\treturn ret;\n}\n\n//インタフェース関数\nPoint calc_Cross_Point(Point a,Point b,Point c,Point d){\n\treturn calc_Cross_Point(a.x,b.x,c.x,d.x,a.y,b.y,c.y,d.y);\n}\n\nPoint calc_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\ndouble calc_len(Vector a){\n return sqrt(a.x*a.x+a.y*a.y);\n}\n\n\n//線分ではなく直線と点の距離\ndouble getDistanceLP(Line l,Point p){\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\n}\n\n//点と線分の距離\ndouble getDistanceSP(Line l,Point p){\n\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\n\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\n\treturn getDistanceLP(l,p);\n}\n\n//線分と線分の距離\ndouble getDistance(Line A,Line B){\n\tif(is_Cross(A,B))return 0.0;\n\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\n\t\t\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\n}\n\nPoint calc_Cross_Point(Line A,Line B){\n\n\tif(getDistanceSP(B,A.p[0]) < EPS){\n\n\t\treturn A.p[0];\n\n\t}else if(getDistanceSP(B,A.p[1]) < EPS){\n\n\t\treturn A.p[1];\n\n\t}else if(getDistanceSP(A,B.p[0]) < EPS){\n\n\t\treturn B.p[0];\n\n\t}else if(getDistanceSP(A,B.p[1]) < EPS){\n\n\t\treturn B.p[1];\n\t}\n\n\treturn calc_Cross_Point(A.p[0],A.p[1],B.p[0],B.p[1]);\n}\n\n/*\n * IN 2\n * ON 1\n * OUT 0\n *\n */\nint contains(Polygon g,Point p){\n\tint n = g.size();\n\tbool x = false;\n\tfor(int i = 0; i < n; i++){\n\t\tPoint a = g[i]-p,b = g[(i+1)%n]-p;\n\t\tif(abs(cross(a,b)) < EPS && dot(a,b) < EPS)return 1;\n\t\tif(a.y > b.y)swap(a,b);\n\t\tif(a.y < EPS && EPS < b.y && cross(a,b) > EPS) x = !x;\n\t}\n\treturn (x ? 2:0);\n}\n\n//2つのvectorがなすラジアンを求める関数\ndouble calc_rad(Vector vec1,Vector vec2){\n\n\tdouble tmp = dot(vec1,vec2)/(abs(vec1)*abs(vec2));\n\n\tif(fabs(tmp+1.0) < EPS){\n\n\t\treturn M_PI;\n\t}\n\n\tif(fabs(tmp-1.0) < EPS){\n\n\t\treturn 0.0;\n\t}\n\n\treturn acos(dot(vec1,vec2)/(abs(vec1)*abs(vec2)));\n}\n\n//3点がなすラジアンを求める関数(ccw(base,a,b) == CCW)\ndouble calc_rad(Point base,Point a,Point b){\n\n\tVector vec1 = b-base;\n\tVector vec2 = a-base;\n\n\treturn calc_rad(vec1,vec2);\n}\n\n\n/*\n * ■辺始まり辺終わりにするとWAする\n * 点始まり点終わりにする、ただし途中で訪問した辺は再訪しない■*\n * */\nvoid dfs(int pre,int node){\n\n\tif(CATCH)return;\n\n\tPoint pre_p = point[pre];\n\tPoint now = point[node];\n\n\tdouble maxi = -BIG_NUM;\n\tint ind = -1;\n\n\tfor(int i = 0; i < G[node].size(); i++){\n\t\tint adj = G[node][i];\n\t\tif(adj == pre)continue;\n\n\t\tPoint next = point[adj];\n\n\t\tdouble tmp_rad = calc_rad(now,pre_p,next);\n\n\t\tif(maxi+EPS < tmp_rad){\n\n\t\t\tmaxi = tmp_rad;\n\t\t\tind = i;\n\t\t}\n\t}\n\n\tif(ind == -1)return;\n\n\tint next = G[node][ind];\n\tif(SET.count(next) > 0){\n\n\t\tCATCH = true;\n\t\t//図形が完成した場合、訪問済みの辺は再訪しない\n\t\tfor(int i = 0; i < EDGES.size(); i++){\n\n\t\t\tvisited[EDGES[i]] = true;\n\t\t}\n\n\t\tPolygon work;\n\t\t//■■最初にnextに到達するまでの点は削除する\n\t\tbool FLG = false;\n\t\tfor(int i = 0; i < POL.size(); i++){\n\t\t\tif(POL[i] == point[next]){\n\n\t\t\t\tFLG = true;\n\t\t\t}\n\t\t\tif(!FLG)continue;\n\n\t\t\twork.push_back(POL[i]);\n\t\t}\n\n\t\tPOL.clear();\n\t\tPOL = work;\n\n\t\treturn;\n\t}\n\tint next_e_ind = MAP[make_pair(node,G[node][ind])];\n\tif(visited[next_e_ind])return;\n\n\tSET.insert(G[node][ind]);\n\tPOL.push_back(point[G[node][ind]]);\n\tEDGES.push_back(next_e_ind);\n\tdfs(node,G[node][ind]);\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\tint num_point = 0;\n\tnumE = 0;\n\n\tMAP.clear();\n\tREV.clear();\n\n\tfor(int i = 0; i < SIZE; i++){\n\n\t\tV[i].clear();\n\t\tG[i].clear();\n\t\tON_SEG[i].clear();\n\t\tCONTAIN[i].clear();\n\t\tvisited[i] = false;\n\t}\n\n\tPoint base = Point(0,0);\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lf %lf %lf %lf\",&line[i].p[0].x,&line[i].p[0].y,&line[i].p[1].x,&line[i].p[1].y);\n\t}\n\n\t//交点を全列挙\n\tfor(int i = 0; i < N-1; i++){\n\t\tfor(int k = i+1; k < N; k++){\n\t\t\tif(!is_Cross(line[i],line[k]))continue;\n\n\t\t\tPoint cross_p = calc_Cross_Point(line[i],line[k]);\n\n\t\t\tbool FLG = true;\n\t\t\tfor(int a = 0; a < num_point; a++){\n\t\t\t\tif(point[a] == cross_p){\n\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)continue;\n\n\t\t\t//辺が持つ点の番号を保存\n\t\t\tCONTAIN[i].push_back(num_point);\n\t\t\tCONTAIN[k].push_back(num_point);\n\n\t\t\t//どの辺の上に乗っているか\n\t\t\tON_SEG[num_point].push_back(i);\n\t\t\tON_SEG[num_point].push_back(k);\n\n\t\t\tpoint[num_point++] = cross_p;\n\t\t\tV[i].push_back(cross_p);\n\t\t\tV[k].push_back(cross_p);\n\t\t}\n\t}\n\n\tfor(int i = 0; i < num_point; i++){\n\n\t\tDEL[i] = false;\n\t}\n\n\n\t//■■交点数が1なら行き止まりなので点を削除\n\tqueue<int> que;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tnumDEG[i] = V[i].size();\n\n\t\tif(numDEG[i] == 1){\n\n\t\t\tint ind = CONTAIN[i][0];\n\n\t\t\tDEL[ind] = true; //点を削除\n\t\t\tque.push(ind);\n\t\t\tnumDEG[i] = 0;\n\t\t}\n\t}\n\n\twhile(!que.empty()){\n\n\t\tint ind = que.front(); //消す点番号\n\t\tque.pop();\n\n\t\tfor(int k = 0; k < ON_SEG[ind].size(); k++){\n\n\t\t\tint seg = ON_SEG[ind][k]; //消す点が含まれている辺番号\n\t\t\tif(numDEG[seg] == 0)continue;\n\n\t\t\tnumDEG[seg]--;\n\t\t\tif(numDEG[seg] == 1){ //■次数が0になった\n\t\t\t\tfor(int a = 0; a < CONTAIN[seg].size(); a++){ //残っている1点を探す\n\n\t\t\t\t\tint tmp_ind = CONTAIN[seg][a]; //点番号\n\t\t\t\t\tif(DEL[tmp_ind])continue;\n\n\t\t\t\t\tDEL[tmp_ind] = true;\n\t\t\t\t\tnumDEG[seg] = 0;\n\t\t\t\t\tque.push(tmp_ind);\n\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\t\tif(V[i].size() <= 1)continue;\n\n\t\tsort(V[i].begin(),V[i].end());\n\n\t\tvector<int> vec; //点番号を並び順に格納\n\n\t\tfor(int k = 0; k < V[i].size(); k++){\n\t\t\tint ind = -1;\n\t\t\tfor(int a = 0; a < num_point; a++){\n\t\t\t\tif(point[a] == V[i][k]){\n\n\t\t\t\t\tind = a;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tvec.push_back(ind);\n\t\t}\n\n\t\tvector<int> work;\n\t\tfor(int k = 0; k < vec.size(); k++){\n\t\t\tif(!DEL[vec[k]]){\n\n\t\t\t\twork.push_back(vec[k]);\n\t\t\t}\n\t\t}\n\n\t\tif(work.size() == 0)continue;\n\n\t\tfor(int k = 0; k < work.size()-1; k++){\n\n\t\t\tint p = work[k];\n\t\t\tint q = work[k+1];\n\n\t\t\t//■辺に向きをつける\n\t\t\tREV[numE] = make_pair(p,q);\n\t\t\tMAP[make_pair(p,q)] = numE++;\n\n\t\t\tREV[numE] = make_pair(q,p);\n\t\t\tMAP[make_pair(q,p)] = numE++;\n\n\t\t\tG[p].push_back(q);\n\t\t\tG[q].push_back(p);\n\t\t}\n\t}\n\n\tfor(int i = 0; i < num_point; i++){\n\t\tif(G[i].size() == 0)continue;\n\n\t\tvector<pair<double,int>> work;\n\n\t\tfor(int k = 0; k < G[i].size(); k++){\n\n\t\t\tPoint adj = point[G[i][k]];\n\t\t\tdouble tmp_rad = calc_rad(adj);\n\t\t\twork.push_back(make_pair(tmp_rad,k));\n\t\t}\n\n\t\tsort(work.begin(),work.end());\n\n\t\tint mini_ind = work[0].second;\n\t\tint maxi_ind = work.back().second;\n\n\t\tfor(int k = 0; k < G[i].size(); k++){\n\t\t\tif(k != mini_ind && k != maxi_ind)continue; //■■最も外側の隣接でないならSKIP\n\n\t\t\tint e_ind = MAP[make_pair(i,G[i][k])];\n\t\t\tif(visited[e_ind])continue;\n\n\t\t\tPOL.clear();\n\t\t\tSET.clear();\n\t\t\tEDGES.clear();\n\n\t\t\tPOL.push_back(point[i]);\n\t\t\tPOL.push_back(point[G[i][k]]);\n\n\t\t\tSET.insert(i);\n\t\t\tSET.insert(G[i][k]); //最初の2点を全探索\n\n\t\t\tEDGES.push_back(e_ind);\n\n\t\t\tCATCH = false;\n\t\t\tdfs(i,G[i][k]);\n\t\t\tif(CATCH){\n\n\n\t\t\t\tif(contains(POL,base) == 2){\n\n\t\t\t\t\tprintf(\"yes\\n\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"no\\n\");\n}\n\nint main(){\n\n\twhile(true){\n\n\t\tscanf(\"%d\",&N);\n\t\tif(N == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":210,"memory_kb":11380,"score_of_the_acc":-0.9261,"final_rank":8},{"submission_id":"aoj_1247_8385725","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 //オーバーフローに注意\n#define MOD 998244353\n//#define MOD 1000000007\n#define EPS 0.000000001\n\n\n\n#define SIZE 30005\n\n\nstruct Point{\n\tPoint(double arg_x,double arg_y){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t}\n\n\tPoint(){\n\t\tx = y = 0.0;\n\t}\n\n\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\n\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\n\tPoint operator * (double a){ return Point(a*x,a*y); }\n\tPoint operator / (double a){ return Point(x/a,y/a); }\n\n\tdouble abs(){ return sqrt(norm()); }\n\tdouble norm(){ return x*x + y*y; }\n\n\tbool operator<(const Point &p) const{\n\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\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\n\nint N;\nLine line[SIZE];\nPoint point[SIZE];\nvector<Point> V[SIZE];\nvector<int> G[SIZE],ON_SEG[SIZE],CONTAIN[SIZE],EDGES;\nset<int> SET;\nPolygon POL;\nbool CATCH,DEL[SIZE],visited[SIZE];\nmap<pair<int,int>,int> MAP;\nint numE = 0,numDEG[SIZE];\nmap<int,pair<int,int>> REV;\n\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\n\n//交点を求める関数\nPoint calc_Cross_Point(double x1,double x2,double x3,double x4,double y1,double y2,double y3,double y4){\n\tPoint ret;\n\tret.x = ((x2-x1)*(y3*(x4-x3)+x3*(y3-y4))-(x4-x3)*(y1*(x2-x1)+x1*(y1-y2)))/((y2-y1)*(x4-x3)-(y4-y3)*(x2-x1));\n\tif(fabs(x1-x2) > EPS){\n\t\tret.y = ((y2-y1)*ret.x+y1*(x2-x1)+x1*(y1-y2))/(x2-x1);\n\t}else{\n\t\tret.y = ((y4-y3)*ret.x+y3*(x4-x3)+x3*(y3-y4))/(x4-x3);\n\t}\n\treturn ret;\n}\n\n//インタフェース関数\nPoint calc_Cross_Point(Point a,Point b,Point c,Point d){\n\treturn calc_Cross_Point(a.x,b.x,c.x,d.x,a.y,b.y,c.y,d.y);\n}\n\nPoint calc_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\ndouble calc_len(Vector a){\n return sqrt(a.x*a.x+a.y*a.y);\n}\n\n\n//線分ではなく直線と点の距離\ndouble getDistanceLP(Line l,Point p){\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\n}\n\n//点と線分の距離\ndouble getDistanceSP(Line l,Point p){\n\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\n\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\n\treturn getDistanceLP(l,p);\n}\n\n//線分と線分の距離\ndouble getDistance(Line A,Line B){\n\tif(is_Cross(A,B))return 0.0;\n\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\n\t\t\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\n}\n\nPoint calc_Cross_Point(Line A,Line B){\n\n\tif(getDistanceSP(B,A.p[0]) < EPS){\n\n\t\treturn A.p[0];\n\n\t}else if(getDistanceSP(B,A.p[1]) < EPS){\n\n\t\treturn A.p[1];\n\n\t}else if(getDistanceSP(A,B.p[0]) < EPS){\n\n\t\treturn B.p[0];\n\n\t}else if(getDistanceSP(A,B.p[1]) < EPS){\n\n\t\treturn B.p[1];\n\t}\n\n\treturn calc_Cross_Point(A.p[0],A.p[1],B.p[0],B.p[1]);\n}\n\n/*\n * IN 2\n * ON 1\n * OUT 0\n *\n */\nint contains(Polygon g,Point p){\n\tint n = g.size();\n\tbool x = false;\n\tfor(int i = 0; i < n; i++){\n\t\tPoint a = g[i]-p,b = g[(i+1)%n]-p;\n\t\tif(abs(cross(a,b)) < EPS && dot(a,b) < EPS)return 1;\n\t\tif(a.y > b.y)swap(a,b);\n\t\tif(a.y < EPS && EPS < b.y && cross(a,b) > EPS) x = !x;\n\t}\n\treturn (x ? 2:0);\n}\n\n//2つのvectorがなすラジアンを求める関数\ndouble calc_rad(Vector vec1,Vector vec2){\n\n\tdouble tmp = dot(vec1,vec2)/(abs(vec1)*abs(vec2));\n\n\tif(fabs(tmp+1.0) < EPS){\n\n\t\treturn M_PI;\n\t}\n\n\tif(fabs(tmp-1.0) < EPS){\n\n\t\treturn 0.0;\n\t}\n\n\treturn acos(dot(vec1,vec2)/(abs(vec1)*abs(vec2)));\n}\n\n//3点がなすラジアンを求める関数(ccw(base,a,b) == CCW)\ndouble calc_rad(Point base,Point a,Point b){\n\n\tVector vec1 = b-base;\n\tVector vec2 = a-base;\n\n\treturn calc_rad(vec1,vec2);\n}\n\n\n/*\n * ■辺始まり辺終わりにするとWAする\n * 点始まり点終わりにする、ただし途中で訪問した辺は再訪しない■*\n * */\nvoid dfs(int pre,int node){\n\n\tif(CATCH)return;\n\n\tPoint pre_p = point[pre];\n\tPoint now = point[node];\n\n\tdouble maxi = -BIG_NUM;\n\tint ind = -1;\n\n\tfor(int i = 0; i < G[node].size(); i++){\n\t\tint adj = G[node][i];\n\t\tif(adj == pre)continue;\n\n\t\tPoint next = point[adj];\n\n\t\tdouble tmp_rad = calc_rad(now,pre_p,next);\n\n\t\tif(maxi+EPS < tmp_rad){\n\n\t\t\tmaxi = tmp_rad;\n\t\t\tind = i;\n\t\t}\n\t}\n\n\tif(ind == -1)return;\n\n\tint next = G[node][ind];\n\tif(SET.count(next) > 0){\n\n\t\tCATCH = true;\n\t\t//図形が完成した場合、訪問済みの辺は再訪しない\n\t\tfor(int i = 0; i < EDGES.size(); i++){\n\n\t\t\tvisited[EDGES[i]] = true;\n\t\t}\n\n\t\tPolygon work;\n\t\t//■■最初にnextに到達するまでの点は削除する\n\t\tbool FLG = false;\n\t\tfor(int i = 0; i < POL.size(); i++){\n\t\t\tif(POL[i] == point[next]){\n\n\t\t\t\tFLG = true;\n\t\t\t}\n\t\t\tif(!FLG)continue;\n\n\t\t\twork.push_back(POL[i]);\n\t\t}\n\n\t\tPOL.clear();\n\t\tPOL = work;\n\n\t\treturn;\n\t}\n\n\n\tint next_e_ind = MAP[make_pair(node,G[node][ind])];\n\n\tSET.insert(G[node][ind]);\n\tPOL.push_back(point[G[node][ind]]);\n\tEDGES.push_back(next_e_ind);\n\tdfs(node,G[node][ind]);\n}\n\nvoid func(){\n\n\tint num_point = 0;\n\tnumE = 0;\n\n\tMAP.clear();\n\tREV.clear();\n\n\tfor(int i = 0; i < SIZE; i++){\n\n\t\tV[i].clear();\n\t\tG[i].clear();\n\t\tON_SEG[i].clear();\n\t\tCONTAIN[i].clear();\n\t\tvisited[i] = false;\n\t}\n\n\tPoint base = Point(0,0);\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lf %lf %lf %lf\",&line[i].p[0].x,&line[i].p[0].y,&line[i].p[1].x,&line[i].p[1].y);\n\t}\n\n\t//交点を全列挙\n\tfor(int i = 0; i < N-1; i++){\n\t\tfor(int k = i+1; k < N; k++){\n\t\t\tif(!is_Cross(line[i],line[k]))continue;\n\n\t\t\tPoint cross_p = calc_Cross_Point(line[i],line[k]);\n\n\t\t\tbool FLG = true;\n\t\t\tfor(int a = 0; a < num_point; a++){\n\t\t\t\tif(point[a] == cross_p){\n\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)continue;\n\n\t\t\t//辺が持つ点の番号を保存\n\t\t\tCONTAIN[i].push_back(num_point);\n\t\t\tCONTAIN[k].push_back(num_point);\n\n\t\t\t//どの辺の上に乗っているか\n\t\t\tON_SEG[num_point].push_back(i);\n\t\t\tON_SEG[num_point].push_back(k);\n\n\t\t\tpoint[num_point++] = cross_p;\n\t\t\tV[i].push_back(cross_p);\n\t\t\tV[k].push_back(cross_p);\n\t\t}\n\t}\n\n\tfor(int i = 0; i < num_point; i++){\n\n\t\tDEL[i] = false;\n\t}\n\n\n\t//■■交点数が1なら行き止まりなので点を削除\n\tqueue<int> que;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tnumDEG[i] = V[i].size();\n\n\t\tif(numDEG[i] == 1){\n\n\t\t\tint ind = CONTAIN[i][0];\n\n\t\t\tDEL[ind] = true; //点を削除\n\t\t\tque.push(ind);\n\t\t\tnumDEG[i] = 0;\n\t\t}\n\t}\n\n\twhile(!que.empty()){\n\n\t\tint ind = que.front(); //消す点番号\n\t\tque.pop();\n\n\t\tfor(int k = 0; k < ON_SEG[ind].size(); k++){\n\n\t\t\tint seg = ON_SEG[ind][k]; //消す点が含まれている辺番号\n\t\t\tif(numDEG[seg] == 0)continue;\n\n\t\t\tnumDEG[seg]--;\n\t\t\tif(numDEG[seg] == 1){ //■次数が0になった\n\t\t\t\tfor(int a = 0; a < CONTAIN[seg].size(); a++){ //残っている1点を探す\n\n\t\t\t\t\tint tmp_ind = CONTAIN[seg][a]; //点番号\n\t\t\t\t\tif(DEL[tmp_ind])continue;\n\n\t\t\t\t\tDEL[tmp_ind] = true;\n\t\t\t\t\tnumDEG[seg] = 0;\n\t\t\t\t\tque.push(tmp_ind);\n\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\t\tif(V[i].size() <= 1)continue;\n\n\t\tsort(V[i].begin(),V[i].end());\n\n\t\tvector<int> vec; //点番号を並び順に格納\n\n\t\tfor(int k = 0; k < V[i].size(); k++){\n\t\t\tint ind = -1;\n\t\t\tfor(int a = 0; a < num_point; a++){\n\t\t\t\tif(point[a] == V[i][k]){\n\n\t\t\t\t\tind = a;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tvec.push_back(ind);\n\t\t}\n\n\t\tvector<int> work;\n\t\tfor(int k = 0; k < vec.size(); k++){\n\t\t\tif(!DEL[vec[k]]){\n\n\t\t\t\twork.push_back(vec[k]);\n\t\t\t}\n\t\t}\n\n\t\tif(work.size() == 0)continue;\n\n\t\tfor(int k = 0; k < work.size()-1; k++){\n\n\t\t\tint p = work[k];\n\t\t\tint q = work[k+1];\n\n\t\t\t//■辺に向きをつける\n\t\t\tREV[numE] = make_pair(p,q);\n\t\t\tMAP[make_pair(p,q)] = numE++;\n\n\t\t\tREV[numE] = make_pair(q,p);\n\t\t\tMAP[make_pair(q,p)] = numE++;\n\n\t\t\tG[p].push_back(q);\n\t\t\tG[q].push_back(p);\n\t\t}\n\t}\n\n\tfor(int i = 0; i < num_point; i++){\n\t\tif(G[i].size() == 0)continue;\n\n\t\tfor(int k = 0; k < G[i].size(); k++){\n\n\t\t\tint e_ind = MAP[make_pair(i,G[i][k])];\n\t\t\tif(visited[e_ind])continue;\n\n\t\t\tPOL.clear();\n\t\t\tSET.clear();\n\t\t\tEDGES.clear();\n\n\t\t\tPOL.push_back(point[i]);\n\t\t\tPOL.push_back(point[G[i][k]]);\n\n\t\t\tSET.insert(i);\n\t\t\tSET.insert(G[i][k]); //最初の2点を全探索\n\n\t\t\tEDGES.push_back(e_ind);\n\n\t\t\tCATCH = false;\n\t\t\tdfs(i,G[i][k]);\n\t\t\tif(CATCH){\n\n\n\t\t\t\tif(contains(POL,base) == 2){\n\n\t\t\t\t\tprintf(\"yes\\n\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"no\\n\");\n}\n\nint main(){\n\n\twhile(true){\n\n\t\tscanf(\"%d\",&N);\n\t\tif(N == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":480,"memory_kb":11280,"score_of_the_acc":-0.956,"final_rank":12},{"submission_id":"aoj_1247_8385719","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 //オーバーフローに注意\n#define MOD 998244353\n//#define MOD 1000000007\n#define EPS 0.000000001\n\n\n\n#define SIZE 30005\n\n\nstruct Point{\n\tPoint(double arg_x,double arg_y){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t}\n\n\tPoint(){\n\t\tx = y = 0.0;\n\t}\n\n\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\n\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\n\tPoint operator * (double a){ return Point(a*x,a*y); }\n\tPoint operator / (double a){ return Point(x/a,y/a); }\n\n\tdouble abs(){ return sqrt(norm()); }\n\tdouble norm(){ return x*x + y*y; }\n\n\tbool operator<(const Point &p) const{\n\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\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\n\nint N;\nLine line[SIZE];\nPoint point[SIZE];\nvector<Point> V[SIZE];\nvector<int> G[SIZE],ON_SEG[SIZE],CONTAIN[SIZE],EDGES;\nset<int> SET;\nPolygon POL;\nbool CATCH,DEL[SIZE],visited[SIZE];\nmap<pair<int,int>,int> MAP;\nint numE = 0,numDEG[SIZE];\nmap<int,pair<int,int>> REV;\n\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\n\n//交点を求める関数\nPoint calc_Cross_Point(double x1,double x2,double x3,double x4,double y1,double y2,double y3,double y4){\n\tPoint ret;\n\tret.x = ((x2-x1)*(y3*(x4-x3)+x3*(y3-y4))-(x4-x3)*(y1*(x2-x1)+x1*(y1-y2)))/((y2-y1)*(x4-x3)-(y4-y3)*(x2-x1));\n\tif(fabs(x1-x2) > EPS){\n\t\tret.y = ((y2-y1)*ret.x+y1*(x2-x1)+x1*(y1-y2))/(x2-x1);\n\t}else{\n\t\tret.y = ((y4-y3)*ret.x+y3*(x4-x3)+x3*(y3-y4))/(x4-x3);\n\t}\n\treturn ret;\n}\n\n//インタフェース関数\nPoint calc_Cross_Point(Point a,Point b,Point c,Point d){\n\treturn calc_Cross_Point(a.x,b.x,c.x,d.x,a.y,b.y,c.y,d.y);\n}\n\nPoint calc_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\ndouble calc_len(Vector a){\n return sqrt(a.x*a.x+a.y*a.y);\n}\n\n\n//線分ではなく直線と点の距離\ndouble getDistanceLP(Line l,Point p){\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\n}\n\n//点と線分の距離\ndouble getDistanceSP(Line l,Point p){\n\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\n\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\n\treturn getDistanceLP(l,p);\n}\n\n//線分と線分の距離\ndouble getDistance(Line A,Line B){\n\tif(is_Cross(A,B))return 0.0;\n\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\n\t\t\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\n}\n\nPoint calc_Cross_Point(Line A,Line B){\n\n\tif(getDistanceSP(B,A.p[0]) < EPS){\n\n\t\treturn A.p[0];\n\n\t}else if(getDistanceSP(B,A.p[1]) < EPS){\n\n\t\treturn A.p[1];\n\n\t}else if(getDistanceSP(A,B.p[0]) < EPS){\n\n\t\treturn B.p[0];\n\n\t}else if(getDistanceSP(A,B.p[1]) < EPS){\n\n\t\treturn B.p[1];\n\t}\n\n\treturn calc_Cross_Point(A.p[0],A.p[1],B.p[0],B.p[1]);\n}\n\n/*\n * IN 2\n * ON 1\n * OUT 0\n *\n */\nint contains(Polygon g,Point p){\n\tint n = g.size();\n\tbool x = false;\n\tfor(int i = 0; i < n; i++){\n\t\tPoint a = g[i]-p,b = g[(i+1)%n]-p;\n\t\tif(abs(cross(a,b)) < EPS && dot(a,b) < EPS)return 1;\n\t\tif(a.y > b.y)swap(a,b);\n\t\tif(a.y < EPS && EPS < b.y && cross(a,b) > EPS) x = !x;\n\t}\n\treturn (x ? 2:0);\n}\n\n//2つのvectorがなすラジアンを求める関数\ndouble calc_rad(Vector vec1,Vector vec2){\n\n\tdouble tmp = dot(vec1,vec2)/(abs(vec1)*abs(vec2));\n\n\tif(fabs(tmp+1.0) < EPS){\n\n\t\treturn M_PI;\n\t}\n\n\tif(fabs(tmp-1.0) < EPS){\n\n\t\treturn 0.0;\n\t}\n\n\treturn acos(dot(vec1,vec2)/(abs(vec1)*abs(vec2)));\n}\n\n//3点がなすラジアンを求める関数(ccw(base,a,b) == CCW)\ndouble calc_rad(Point base,Point a,Point b){\n\n\tVector vec1 = b-base;\n\tVector vec2 = a-base;\n\n\treturn calc_rad(vec1,vec2);\n}\n\n\n/*\n * ■辺始まり辺終わりにするとWAする\n * 点始まり点終わりにする、ただし途中で訪問した辺は再訪しない■*\n * */\nvoid dfs(int pre,int node){\n\n\tif(CATCH)return;\n\n\t/*if(node == start && pre != start){\n\n\t\t//図形が完成した場合、訪問済みの辺は再訪しない\n\t\tfor(int i = 0; i < EDGES.size(); i++){\n\n\t\t\tvisited[EDGES[i]] = true;\n\t\t}\n\n\t\tCATCH = true;\n\t\treturn;\n\t}*/\n\n\tPoint pre_p = point[pre];\n\tPoint now = point[node];\n\n\tdouble maxi = -BIG_NUM;\n\tint ind = -1;\n\n\tfor(int i = 0; i < G[node].size(); i++){\n\t\tint adj = G[node][i];\n\t\tif(adj == pre)continue;\n\n\t\tPoint next = point[adj];\n\n\t\tdouble tmp_rad = calc_rad(now,pre_p,next);\n\n\t\tif(maxi+EPS < tmp_rad){\n\n\t\t\tmaxi = tmp_rad;\n\t\t\tind = i;\n\t\t}\n\t}\n\n\tif(ind == -1)return;\n\n\tint next = G[node][ind];\n\tif(SET.count(next) > 0){\n\n\t\tCATCH = true;\n\t\t//図形が完成した場合、訪問済みの辺は再訪しない\n\t\tfor(int i = 0; i < EDGES.size(); i++){\n\n\t\t\tvisited[EDGES[i]] = true;\n\t\t}\n\n\t\tPolygon work;\n\t\t//■■最初にnextに到達するまでの点は削除する\n\t\tbool FLG = false;\n\t\tfor(int i = 0; i < POL.size(); i++){\n\t\t\tif(POL[i] == point[next]){\n\n\t\t\t\tFLG = true;\n\t\t\t}\n\t\t\tif(!FLG)continue;\n\n\t\t\twork.push_back(POL[i]);\n\t\t}\n\n\t\tPOL.clear();\n\t\tPOL = work;\n\n\t\treturn;\n\t}\n\n\n\tint next_e_ind = MAP[make_pair(node,G[node][ind])];\n\n\tSET.insert(G[node][ind]);\n\tPOL.push_back(point[G[node][ind]]);\n\tEDGES.push_back(next_e_ind);\n\tdfs(node,G[node][ind]);\n}\n\nvoid func(){\n\n\tint num_point = 0;\n\tnumE = 0;\n\n\tMAP.clear();\n\tREV.clear();\n\n\tfor(int i = 0; i < SIZE; i++){\n\n\t\tV[i].clear();\n\t\tG[i].clear();\n\t\tON_SEG[i].clear();\n\t\tCONTAIN[i].clear();\n\t\tvisited[i] = false;\n\t}\n\n\tPoint base = Point(0,0);\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lf %lf %lf %lf\",&line[i].p[0].x,&line[i].p[0].y,&line[i].p[1].x,&line[i].p[1].y);\n\t}\n\n\t//交点を全列挙\n\tfor(int i = 0; i < N-1; i++){\n\t\tfor(int k = i+1; k < N; k++){\n\t\t\tif(!is_Cross(line[i],line[k]))continue;\n\n\t\t\tPoint cross_p = calc_Cross_Point(line[i],line[k]);\n\n\t\t\tbool FLG = true;\n\t\t\tfor(int a = 0; a < num_point; a++){\n\t\t\t\tif(point[a] == cross_p){\n\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)continue;\n\n\t\t\t//辺が持つ点の番号を保存\n\t\t\tCONTAIN[i].push_back(num_point);\n\t\t\tCONTAIN[k].push_back(num_point);\n\n\t\t\t//どの辺の上に乗っているか\n\t\t\tON_SEG[num_point].push_back(i);\n\t\t\tON_SEG[num_point].push_back(k);\n\n\t\t\tpoint[num_point++] = cross_p;\n\t\t\tV[i].push_back(cross_p);\n\t\t\tV[k].push_back(cross_p);\n\t\t}\n\t}\n\n\tfor(int i = 0; i < num_point; i++){\n\n\t\tDEL[i] = false;\n\t}\n\n\n\t//■■交点数が1なら行き止まりなので点を削除\n\tqueue<int> que;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tnumDEG[i] = V[i].size();\n\n\t\tif(numDEG[i] == 1){\n\n\t\t\tint ind = CONTAIN[i][0];\n\n\t\t\tDEL[ind] = true; //点を削除\n\t\t\tque.push(ind);\n\t\t\tnumDEG[i] = 0;\n\t\t}\n\t}\n\n\twhile(!que.empty()){\n\n\t\tint ind = que.front(); //消す点番号\n\t\tque.pop();\n\n\t\tfor(int k = 0; k < ON_SEG[ind].size(); k++){\n\n\t\t\tint seg = ON_SEG[ind][k]; //消す点が含まれている辺番号\n\t\t\tif(numDEG[seg] == 0)continue;\n\n\t\t\tnumDEG[seg]--;\n\t\t\tif(numDEG[seg] == 1){ //■次数が0になった\n\t\t\t\tfor(int a = 0; a < CONTAIN[seg].size(); a++){ //残っている1点を探す\n\n\t\t\t\t\tint tmp_ind = CONTAIN[seg][a]; //点番号\n\t\t\t\t\tif(DEL[tmp_ind])continue;\n\n\t\t\t\t\tDEL[tmp_ind] = true;\n\t\t\t\t\tnumDEG[seg] = 0;\n\t\t\t\t\tque.push(tmp_ind);\n\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\t\tif(V[i].size() <= 1)continue;\n\n\t\tsort(V[i].begin(),V[i].end());\n\n\t\tvector<int> vec; //点番号を並び順に格納\n\n\t\tfor(int k = 0; k < V[i].size(); k++){\n\t\t\tint ind = -1;\n\t\t\tfor(int a = 0; a < num_point; a++){\n\t\t\t\tif(point[a] == V[i][k]){\n\n\t\t\t\t\tind = a;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tvec.push_back(ind);\n\t\t}\n\n\t\tvector<int> work;\n\t\tfor(int k = 0; k < vec.size(); k++){\n\t\t\tif(!DEL[vec[k]]){\n\n\t\t\t\twork.push_back(vec[k]);\n\t\t\t}\n\t\t}\n\n\t\tif(work.size() == 0)continue;\n\n\t\tfor(int k = 0; k < work.size()-1; k++){\n\n\t\t\tint p = work[k];\n\t\t\tint q = work[k+1];\n\n\t\t\tREV[numE] = make_pair(p,q);\n\t\t\tMAP[make_pair(p,q)] = numE++;\n\n\t\t\tREV[numE] = make_pair(q,p);\n\t\t\tMAP[make_pair(q,p)] = numE++;\n\n\t\t\tG[p].push_back(q);\n\t\t\tG[q].push_back(p);\n\t\t}\n\t}\n\n\tfor(int i = 0; i < num_point; i++){\n\t\tif(G[i].size() == 0)continue;\n\n\t\tfor(int k = 0; k < G[i].size(); k++){\n\n\t\t\tint e_ind = MAP[make_pair(i,G[i][k])];\n\t\t\tif(visited[e_ind])continue;\n\n\t\t\tPOL.clear();\n\t\t\tSET.clear();\n\t\t\tEDGES.clear();\n\n\t\t\tPOL.push_back(point[i]);\n\t\t\tPOL.push_back(point[G[i][k]]);\n\n\t\t\tSET.insert(i);\n\t\t\tSET.insert(G[i][k]); //最初の2点を全探索\n\n\t\t\tEDGES.push_back(e_ind);\n\n\t\t\tCATCH = false;\n\t\t\tdfs(i,G[i][k]);\n\t\t\tif(CATCH){\n\n\n\t\t\t\tif(contains(POL,base) == 2){\n\n\t\t\t\t\tprintf(\"yes\\n\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"no\\n\");\n}\n\nint main(){\n\n\twhile(true){\n\n\t\tscanf(\"%d\",&N);\n\t\tif(N == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":480,"memory_kb":11164,"score_of_the_acc":-0.9431,"final_rank":11},{"submission_id":"aoj_1247_8385708","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 //オーバーフローに注意\n#define MOD 998244353\n//#define MOD 1000000007\n#define EPS 0.000000001\n\n\n\n#define SIZE 30005\n\n\nstruct Point{\n\tPoint(double arg_x,double arg_y){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t}\n\n\tPoint(){\n\t\tx = y = 0.0;\n\t}\n\n\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\n\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\n\tPoint operator * (double a){ return Point(a*x,a*y); }\n\tPoint operator / (double a){ return Point(x/a,y/a); }\n\n\tdouble abs(){ return sqrt(norm()); }\n\tdouble norm(){ return x*x + y*y; }\n\n\tbool operator<(const Point &p) const{\n\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\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\n\nint N;\nLine line[SIZE];\nPoint point[SIZE];\nvector<Point> V[SIZE];\nvector<int> G[SIZE],ON_SEG[SIZE],CONTAIN[SIZE],EDGES;\nset<int> SET;\nPolygon POL;\nbool CATCH,DEL[SIZE],visited[SIZE];\nmap<pair<int,int>,int> MAP;\nint numE = 0,numDEG[SIZE];\nmap<int,pair<int,int>> REV;\n\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\n\n//交点を求める関数\nPoint calc_Cross_Point(double x1,double x2,double x3,double x4,double y1,double y2,double y3,double y4){\n\tPoint ret;\n\tret.x = ((x2-x1)*(y3*(x4-x3)+x3*(y3-y4))-(x4-x3)*(y1*(x2-x1)+x1*(y1-y2)))/((y2-y1)*(x4-x3)-(y4-y3)*(x2-x1));\n\tif(fabs(x1-x2) > EPS){\n\t\tret.y = ((y2-y1)*ret.x+y1*(x2-x1)+x1*(y1-y2))/(x2-x1);\n\t}else{\n\t\tret.y = ((y4-y3)*ret.x+y3*(x4-x3)+x3*(y3-y4))/(x4-x3);\n\t}\n\treturn ret;\n}\n\n//インタフェース関数\nPoint calc_Cross_Point(Point a,Point b,Point c,Point d){\n\treturn calc_Cross_Point(a.x,b.x,c.x,d.x,a.y,b.y,c.y,d.y);\n}\n\nPoint calc_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\ndouble calc_len(Vector a){\n return sqrt(a.x*a.x+a.y*a.y);\n}\n\n\n//線分ではなく直線と点の距離\ndouble getDistanceLP(Line l,Point p){\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\n}\n\n//点と線分の距離\ndouble getDistanceSP(Line l,Point p){\n\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\n\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\n\treturn getDistanceLP(l,p);\n}\n\n//線分と線分の距離\ndouble getDistance(Line A,Line B){\n\tif(is_Cross(A,B))return 0.0;\n\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\n\t\t\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\n}\n\nPoint calc_Cross_Point(Line A,Line B){\n\n\tif(getDistanceSP(B,A.p[0]) < EPS){\n\n\t\treturn A.p[0];\n\n\t}else if(getDistanceSP(B,A.p[1]) < EPS){\n\n\t\treturn A.p[1];\n\n\t}else if(getDistanceSP(A,B.p[0]) < EPS){\n\n\t\treturn B.p[0];\n\n\t}else if(getDistanceSP(A,B.p[1]) < EPS){\n\n\t\treturn B.p[1];\n\t}\n\n\treturn calc_Cross_Point(A.p[0],A.p[1],B.p[0],B.p[1]);\n}\n\n/*\n * IN 2\n * ON 1\n * OUT 0\n *\n */\nint contains(Polygon g,Point p){\n\tint n = g.size();\n\tbool x = false;\n\tfor(int i = 0; i < n; i++){\n\t\tPoint a = g[i]-p,b = g[(i+1)%n]-p;\n\t\tif(abs(cross(a,b)) < EPS && dot(a,b) < EPS)return 1;\n\t\tif(a.y > b.y)swap(a,b);\n\t\tif(a.y < EPS && EPS < b.y && cross(a,b) > EPS) x = !x;\n\t}\n\treturn (x ? 2:0);\n}\n\n//2つのvectorがなすラジアンを求める関数\ndouble calc_rad(Vector vec1,Vector vec2){\n\n\tdouble tmp = dot(vec1,vec2)/(abs(vec1)*abs(vec2));\n\n\tif(fabs(tmp+1.0) < EPS){\n\n\t\treturn M_PI;\n\t}\n\n\tif(fabs(tmp-1.0) < EPS){\n\n\t\treturn 0.0;\n\t}\n\n\treturn acos(dot(vec1,vec2)/(abs(vec1)*abs(vec2)));\n}\n\n//3点がなすラジアンを求める関数(ccw(base,a,b) == CCW)\ndouble calc_rad(Point base,Point a,Point b){\n\n\tVector vec1 = b-base;\n\tVector vec2 = a-base;\n\n\treturn calc_rad(vec1,vec2);\n}\n\n\nvoid dfs(int start,int pre,int node){\n\n\tif(CATCH)return;\n\n\tif(node == start && pre != start){\n\n\t\t//図形が完成した場合、訪問済みの両端点は再訪しない\n\t\tfor(int i = 0; i < EDGES.size(); i++){\n\n\t\t\tvisited[EDGES[i]] = true;\n\t\t}\n\n\t\tCATCH = true;\n\t\treturn;\n\t}\n\n\tPoint pre_p = point[pre];\n\tPoint now = point[node];\n\n\tdouble maxi = -BIG_NUM;\n\tint ind = -1;\n\n\tfor(int i = 0; i < G[node].size(); i++){\n\t\tint adj = G[node][i];\n\t\tif(adj == pre)continue;\n\n\t\tif(adj != start && SET.count(adj) > 0)continue;\n\t\tif(adj == start && pre == start)continue;\n\n\t\tPoint next = point[adj];\n\n\t\tdouble tmp_rad = calc_rad(now,pre_p,next);\n\n\t\tif(maxi+EPS < tmp_rad){\n\n\t\t\tmaxi = tmp_rad;\n\t\t\tind = i;\n\t\t}\n\t}\n\n\tif(ind == -1)return;\n\n\tint next_e_ind = MAP[make_pair(node,G[node][ind])];\n\n\tSET.insert(G[node][ind]);\n\tPOL.push_back(point[G[node][ind]]);\n\tEDGES.push_back(next_e_ind);\n\tdfs(start,node,G[node][ind]);\n}\n\nvoid func(){\n\n\tint num_point = 0;\n\tnumE = 0;\n\n\tMAP.clear();\n\tREV.clear();\n\n\tfor(int i = 0; i < SIZE; i++){\n\n\t\tV[i].clear();\n\t\tG[i].clear();\n\t\tON_SEG[i].clear();\n\t\tCONTAIN[i].clear();\n\t\tvisited[i] = false;\n\t}\n\n\tPoint base = Point(0,0);\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lf %lf %lf %lf\",&line[i].p[0].x,&line[i].p[0].y,&line[i].p[1].x,&line[i].p[1].y);\n\t}\n\n\t//交点を全列挙\n\tfor(int i = 0; i < N-1; i++){\n\t\tfor(int k = i+1; k < N; k++){\n\t\t\tif(!is_Cross(line[i],line[k]))continue;\n\n\t\t\tPoint cross_p = calc_Cross_Point(line[i],line[k]);\n\n\t\t\tbool FLG = true;\n\t\t\tfor(int a = 0; a < num_point; a++){\n\t\t\t\tif(point[a] == cross_p){\n\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)continue;\n\n\t\t\t//辺が持つ点の番号を保存\n\t\t\tCONTAIN[i].push_back(num_point);\n\t\t\tCONTAIN[k].push_back(num_point);\n\n\t\t\t//どの辺の上に乗っているか\n\t\t\tON_SEG[num_point].push_back(i);\n\t\t\tON_SEG[num_point].push_back(k);\n\n\t\t\tpoint[num_point++] = cross_p;\n\t\t\tV[i].push_back(cross_p);\n\t\t\tV[k].push_back(cross_p);\n\t\t}\n\t}\n\n\tfor(int i = 0; i < num_point; i++){\n\n\t\tDEL[i] = false;\n\t}\n\n\n\t//■■交点数が1なら行き止まりなので点を削除\n\tqueue<int> que;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tnumDEG[i] = V[i].size();\n\n\t\tif(numDEG[i] == 1){\n\n\t\t\tint ind = CONTAIN[i][0];\n\n\t\t\tDEL[ind] = true; //点を削除\n\t\t\tque.push(ind);\n\t\t\tnumDEG[i] = 0;\n\t\t}\n\t}\n\n\twhile(!que.empty()){\n\n\t\tint ind = que.front(); //消す点番号\n\t\tque.pop();\n\n\t\tfor(int k = 0; k < ON_SEG[ind].size(); k++){\n\n\t\t\tint seg = ON_SEG[ind][k]; //消す点が含まれている辺番号\n\t\t\tif(numDEG[seg] == 0)continue;\n\n\t\t\tnumDEG[seg]--;\n\t\t\tif(numDEG[seg] == 1){ //■次数が0になった\n\t\t\t\tfor(int a = 0; a < CONTAIN[seg].size(); a++){ //残っている1点を探す\n\n\t\t\t\t\tint tmp_ind = CONTAIN[seg][a]; //点番号\n\t\t\t\t\tif(DEL[tmp_ind])continue;\n\n\t\t\t\t\tDEL[tmp_ind] = true;\n\t\t\t\t\tnumDEG[seg] = 0;\n\t\t\t\t\tque.push(tmp_ind);\n\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\t\tif(V[i].size() <= 1)continue;\n\n\t\tsort(V[i].begin(),V[i].end());\n\n\t\tvector<int> vec; //点番号を並び順に格納\n\n\t\tfor(int k = 0; k < V[i].size(); k++){\n\t\t\tint ind = -1;\n\t\t\tfor(int a = 0; a < num_point; a++){\n\t\t\t\tif(point[a] == V[i][k]){\n\n\t\t\t\t\tind = a;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tvec.push_back(ind);\n\t\t}\n\n\t\tvector<int> work;\n\t\tfor(int k = 0; k < vec.size(); k++){\n\t\t\tif(!DEL[vec[k]]){\n\n\t\t\t\twork.push_back(vec[k]);\n\t\t\t}\n\t\t}\n\n\t\tif(work.size() == 0)continue;\n\n\t\tfor(int k = 0; k < work.size()-1; k++){\n\n\t\t\tint p = work[k];\n\t\t\tint q = work[k+1];\n\n\t\t\tREV[numE] = make_pair(p,q);\n\t\t\tMAP[make_pair(p,q)] = numE++;\n\n\t\t\tREV[numE] = make_pair(q,p);\n\t\t\tMAP[make_pair(q,p)] = numE++;\n\n\t\t\tG[p].push_back(q);\n\t\t\tG[q].push_back(p);\n\t\t}\n\t}\n\n\tfor(int i = 0; i < num_point; i++){\n\t\tif(G[i].size() == 0)continue;\n\n\t\tfor(int k = 0; k < G[i].size(); k++){\n\n\t\t\tint e_ind = MAP[make_pair(i,G[i][k])];\n\t\t\tif(visited[e_ind])continue;\n\n\t\t\tPOL.clear();\n\t\t\tSET.clear();\n\t\t\tEDGES.clear();\n\n\t\t\tPOL.push_back(point[i]);\n\t\t\tPOL.push_back(point[G[i][k]]);\n\n\t\t\tSET.insert(i);\n\t\t\tSET.insert(G[i][k]); //最初の2点を全探索\n\n\t\t\tEDGES.push_back(e_ind);\n\n\t\t\tCATCH = false;\n\t\t\tdfs(i,i,G[i][k]);\n\t\t\tif(CATCH){\n\n\n\t\t\t\tif(contains(POL,base) == 2){\n\n\t\t\t\t\tprintf(\"yes\\n\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"no\\n\");\n}\n\nint main(){\n\n\twhile(true){\n\n\t\tscanf(\"%d\",&N);\n\t\tif(N == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":3750,"memory_kb":12288,"score_of_the_acc":-1.5671,"final_rank":20},{"submission_id":"aoj_1247_8385265","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 //オーバーフローに注意\n#define MOD 998244353\n//#define MOD 1000000007\n#define EPS 0.000000001\n\n\n\n#define SIZE 10005\n\n\nstruct Point{\n\tPoint(double arg_x,double arg_y){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t}\n\n\tPoint(){\n\t\tx = y = 0.0;\n\t}\n\n\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\n\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\n\tPoint operator * (double a){ return Point(a*x,a*y); }\n\tPoint operator / (double a){ return Point(x/a,y/a); }\n\n\tdouble abs(){ return sqrt(norm()); }\n\tdouble norm(){ return x*x + y*y; }\n\n\tbool operator<(const Point &p) const{\n\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\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\n\nint N;\nLine line[SIZE];\nPoint point[SIZE];\nvector<Point> V[SIZE];\nvector<int> G[SIZE],ON_SEG[SIZE],CONTAIN[SIZE];\nset<int> SET;\nPolygon POL;\nbool CATCH,DEL[SIZE],visited[SIZE];\nmap<pair<int,int>,int> MAP;\nint numE = 0,numDEG[SIZE];\n\n\ndouble norm(Vector a){\n\treturn a.x*a.x+a.y*a.y;\n}\n\ndouble abs(Vector a){\n\treturn sqrt(norm(a));\n}\n\ndouble cross(Vector a,Vector b){\n return a.x*b.y-a.y*b.x;\n}\n\ndouble dot(Vector a,Vector b){\n return a.x*b.x + a.y*b.y;\n}\n\nstatic const int COUNTER_CLOCKWISE = 1;\nstatic const int CLOCKWISE = -1;\nstatic const int ONLINE_BACK = 2;\nstatic const int ONLINE_FRONT = -2;\nstatic const int ON_SEGMENT = 0;\n\n/*\n * p0を基準点として、p1から見てp2が\n * 反時計回り側にあれば\n * COUNTER_CLOCKWISE\n * */\nint ccw(Point p0,Point p1,Point p2){\n\n\tVector a = p1 - p0;\n\tVector b = p2 - p0;\n\n\tif(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\n\tif(cross(a,b) < -EPS)return CLOCKWISE;\n\tif(dot(a,b) < -EPS)return ONLINE_BACK;\n\tif(a.norm() < b.norm())return ONLINE_FRONT;\n\n\treturn ON_SEGMENT;\n}\n\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\n\n//交点を求める関数\nPoint calc_Cross_Point(double x1,double x2,double x3,double x4,double y1,double y2,double y3,double y4){\n\tPoint ret;\n\tret.x = ((x2-x1)*(y3*(x4-x3)+x3*(y3-y4))-(x4-x3)*(y1*(x2-x1)+x1*(y1-y2)))/((y2-y1)*(x4-x3)-(y4-y3)*(x2-x1));\n\tif(fabs(x1-x2) > EPS){\n\t\tret.y = ((y2-y1)*ret.x+y1*(x2-x1)+x1*(y1-y2))/(x2-x1);\n\t}else{\n\t\tret.y = ((y4-y3)*ret.x+y3*(x4-x3)+x3*(y3-y4))/(x4-x3);\n\t}\n\treturn ret;\n}\n\n//インタフェース関数\nPoint calc_Cross_Point(Point a,Point b,Point c,Point d){\n\treturn calc_Cross_Point(a.x,b.x,c.x,d.x,a.y,b.y,c.y,d.y);\n}\n\nPoint calc_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\ndouble calc_len(Vector a){\n return sqrt(a.x*a.x+a.y*a.y);\n}\n\n\n//線分ではなく直線と点の距離\ndouble getDistanceLP(Line l,Point p){\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\n}\n\n//点と線分の距離\ndouble getDistanceSP(Line l,Point p){\n\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\n\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\n\treturn getDistanceLP(l,p);\n}\n\n//線分と線分の距離\ndouble getDistance(Line A,Line B){\n\tif(is_Cross(A,B))return 0.0;\n\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\n\t\t\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\n}\n\nPoint calc_Cross_Point(Line A,Line B){\n\n\tif(getDistanceSP(B,A.p[0]) < EPS){\n\n\t\treturn A.p[0];\n\n\t}else if(getDistanceSP(B,A.p[1]) < EPS){\n\n\t\treturn A.p[1];\n\n\t}else if(getDistanceSP(A,B.p[0]) < EPS){\n\n\t\treturn B.p[0];\n\n\t}else if(getDistanceSP(A,B.p[1]) < EPS){\n\n\t\treturn B.p[1];\n\t}\n\n\treturn calc_Cross_Point(A.p[0],A.p[1],B.p[0],B.p[1]);\n}\n\n/*\n * IN 2\n * ON 1\n * OUT 0\n *\n */\nint contains(Polygon g,Point p){\n\tint n = g.size();\n\tbool x = false;\n\tfor(int i = 0; i < n; i++){\n\t\tPoint a = g[i]-p,b = g[(i+1)%n]-p;\n\t\tif(abs(cross(a,b)) < EPS && dot(a,b) < EPS)return 1;\n\t\tif(a.y > b.y)swap(a,b);\n\t\tif(a.y < EPS && EPS < b.y && cross(a,b) > EPS) x = !x;\n\t}\n\treturn (x ? 2:0);\n}\n\n//2つのvectorがなすラジアンを求める関数\ndouble calc_rad(Vector vec1,Vector vec2){\n\n\tdouble tmp = dot(vec1,vec2)/(abs(vec1)*abs(vec2));\n\n\tif(fabs(tmp+1.0) < EPS){\n\n\t\treturn M_PI;\n\t}\n\n\tif(fabs(tmp-1.0) < EPS){\n\n\t\treturn 0.0;\n\t}\n\n\treturn acos(dot(vec1,vec2)/(abs(vec1)*abs(vec2)));\n}\n\n//3点がなすラジアンを求める関数(ccw(base,a,b) == CCW)\ndouble calc_rad(Point base,Point a,Point b){\n\n\tVector vec1 = b-base;\n\tVector vec2 = a-base;\n\n\treturn calc_rad(vec1,vec2);\n}\n\n\nvoid dfs(int start,int pre,int node){\n\n\tif(CATCH)return;\n\n\tif(node == start && pre != start){\n\n\t\tCATCH = true;\n\t\treturn;\n\t}\n\n\tPoint pre_p = point[pre];\n\tPoint now = point[node];\n\n\tdouble maxi = -BIG_NUM;\n\tint ind = -1;\n\n\tfor(int i = 0; i < G[node].size(); i++){\n\t\tint adj = G[node][i];\n\t\tif(adj == pre)continue;\n\n\t\tif(adj != start && SET.count(adj) > 0)continue;\n\t\tif(adj == start && pre == start)continue;\n\n\t\tPoint next = point[adj];\n\n\t\tdouble tmp_rad = calc_rad(now,pre_p,next);\n\n\t\tif(maxi+EPS < tmp_rad){\n\n\t\t\tmaxi = tmp_rad;\n\t\t\tind = i;\n\t\t}\n\t}\n\n\tif(ind == -1)return;\n\n\tSET.insert(G[node][ind]);\n\tPOL.push_back(point[G[node][ind]]);\n\tdfs(start,node,G[node][ind]);\n}\n\nvoid func(){\n\n\tint num_point = 0;\n\tfor(int i = 0; i < SIZE; i++){\n\n\t\tV[i].clear();\n\t\tG[i].clear();\n\t\tON_SEG[i].clear();\n\t\tCONTAIN[i].clear();\n\t}\n\n\tPoint base = Point(0,0);\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lf %lf %lf %lf\",&line[i].p[0].x,&line[i].p[0].y,&line[i].p[1].x,&line[i].p[1].y);\n\t}\n\n\t//交点を全列挙\n\tfor(int i = 0; i < N-1; i++){\n\t\tfor(int k = i+1; k < N; k++){\n\t\t\tif(!is_Cross(line[i],line[k]))continue;\n\n\t\t\tPoint cross_p = calc_Cross_Point(line[i],line[k]);\n\n\t\t\tbool FLG = true;\n\t\t\tfor(int a = 0; a < num_point; a++){\n\t\t\t\tif(point[a] == cross_p){\n\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)continue;\n\n\t\t\t//辺が持つ点の番号を保存\n\t\t\tCONTAIN[i].push_back(num_point);\n\t\t\tCONTAIN[k].push_back(num_point);\n\n\t\t\t//どの辺の上に乗っているか\n\t\t\tON_SEG[num_point].push_back(i);\n\t\t\tON_SEG[num_point].push_back(k);\n\n\t\t\tpoint[num_point++] = cross_p;\n\t\t\tV[i].push_back(cross_p);\n\t\t\tV[k].push_back(cross_p);\n\t\t}\n\t}\n\n\tfor(int i = 0; i < num_point; i++){\n\n\t\tDEL[i] = false;\n\t}\n\n\n\t//■■交点数が1なら行き止まりなので点を削除\n\tqueue<int> que;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tnumDEG[i] = V[i].size();\n\n\t\tif(numDEG[i] == 1){\n\n\t\t\tint ind = CONTAIN[i][0];\n\n\t\t\tDEL[ind] = true; //点を削除\n\t\t\tque.push(ind);\n\t\t\tnumDEG[i] = 0;\n\t\t}\n\t}\n\n\twhile(!que.empty()){\n\n\t\tint ind = que.front(); //消す点番号\n\t\tque.pop();\n\n\t\tfor(int k = 0; k < ON_SEG[ind].size(); k++){\n\n\t\t\tint seg = ON_SEG[ind][k]; //消す点が含まれている辺番号\n\t\t\tif(numDEG[seg] == 0)continue;\n\n\t\t\tnumDEG[seg]--;\n\t\t\tif(numDEG[seg] == 1){ //■次数が0になった\n\t\t\t\tfor(int a = 0; a < CONTAIN[seg].size(); a++){ //残っている1点を探す\n\n\t\t\t\t\tint tmp_ind = CONTAIN[seg][a]; //点番号\n\t\t\t\t\tif(DEL[tmp_ind])continue;\n\n\t\t\t\t\tDEL[tmp_ind] = true;\n\t\t\t\t\tnumDEG[seg] = 0;\n\t\t\t\t\tque.push(tmp_ind);\n\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\t\tif(V[i].size() <= 1)continue;\n\n\t\tsort(V[i].begin(),V[i].end());\n\n\t\tvector<int> vec; //点番号を並び順に格納\n\n\t\tfor(int k = 0; k < V[i].size(); k++){\n\t\t\tint ind = -1;\n\t\t\tfor(int a = 0; a < num_point; a++){\n\t\t\t\tif(point[a] == V[i][k]){\n\n\t\t\t\t\tind = a;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tvec.push_back(ind);\n\t\t}\n\n\t\tvector<int> work;\n\t\tfor(int k = 0; k < vec.size(); k++){\n\t\t\tif(!DEL[vec[k]]){\n\n\t\t\t\twork.push_back(vec[k]);\n\t\t\t}\n\t\t}\n\n\t\tif(work.size() == 0)continue;\n\n\t\tfor(int k = 0; k < work.size()-1; k++){\n\n\t\t\tint p = work[k];\n\t\t\tint q = work[k+1];\n\n\t\t\tG[p].push_back(q);\n\t\t\tG[q].push_back(p);\n\t\t}\n\t}\n\n\tfor(int i = 0; i < num_point; i++){\n\t\tif(G[i].size() == 0)continue;\n\n\t\tfor(int k = 0; k < G[i].size(); k++){\n\n\t\t\tPOL.clear();\n\t\t\tSET.clear();\n\n\t\t\tPOL.push_back(point[i]);\n\t\t\tPOL.push_back(point[G[i][k]]);\n\n\t\t\tSET.insert(i);\n\t\t\tSET.insert(G[i][k]); //最初の2点を全探索\n\n\t\t\tCATCH = false;\n\t\t\tdfs(i,i,G[i][k]);\n\t\t\tif(CATCH){\n\n\n\t\t\t\tif(contains(POL,base) == 2){\n\n\t\t\t\t\tprintf(\"yes\\n\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"no\\n\");\n}\n\nint main(){\n\n\twhile(true){\n\n\t\tscanf(\"%d\",&N);\n\t\tif(N == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":6590,"memory_kb":5680,"score_of_the_acc":-1.2622,"final_rank":19},{"submission_id":"aoj_1247_8367553","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 //オーバーフローに注意\n#define MOD 998244353\n//#define MOD 1000000007\n#define EPS 0.000000001\n\n\n\n#define SIZE 10005\n\n\nstruct Point{\n\tPoint(double arg_x,double arg_y){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t}\n\n\tPoint(){\n\t\tx = y = 0.0;\n\t}\n\n\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\n\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\n\tPoint operator * (double a){ return Point(a*x,a*y); }\n\tPoint operator / (double a){ return Point(x/a,y/a); }\n\n\tdouble abs(){ return sqrt(norm()); }\n\tdouble norm(){ return x*x + y*y; }\n\n\tbool operator<(const Point &p) const{\n\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\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\n\nint N;\nLine line[SIZE];\nPoint point[SIZE];\nvector<Point> V[SIZE];\nvector<int> G[SIZE];\nset<int> SET;\nPolygon POL;\nbool CATCH,DEL[SIZE];\n\n\ndouble norm(Vector a){\n\treturn a.x*a.x+a.y*a.y;\n}\n\ndouble abs(Vector a){\n\treturn sqrt(norm(a));\n}\n\ndouble cross(Vector a,Vector b){\n return a.x*b.y-a.y*b.x;\n}\n\ndouble dot(Vector a,Vector b){\n return a.x*b.x + a.y*b.y;\n}\n\nstatic const int COUNTER_CLOCKWISE = 1;\nstatic const int CLOCKWISE = -1;\nstatic const int ONLINE_BACK = 2;\nstatic const int ONLINE_FRONT = -2;\nstatic const int ON_SEGMENT = 0;\n\n/*\n * p0を基準点として、p1から見てp2が\n * 反時計回り側にあれば\n * COUNTER_CLOCKWISE\n * */\nint ccw(Point p0,Point p1,Point p2){\n\n\tVector a = p1 - p0;\n\tVector b = p2 - p0;\n\n\tif(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\n\tif(cross(a,b) < -EPS)return CLOCKWISE;\n\tif(dot(a,b) < -EPS)return ONLINE_BACK;\n\tif(a.norm() < b.norm())return ONLINE_FRONT;\n\n\treturn ON_SEGMENT;\n}\n\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\n\n//交点を求める関数\nPoint calc_Cross_Point(double x1,double x2,double x3,double x4,double y1,double y2,double y3,double y4){\n\tPoint ret;\n\tret.x = ((x2-x1)*(y3*(x4-x3)+x3*(y3-y4))-(x4-x3)*(y1*(x2-x1)+x1*(y1-y2)))/((y2-y1)*(x4-x3)-(y4-y3)*(x2-x1));\n\tif(fabs(x1-x2) > EPS){\n\t\tret.y = ((y2-y1)*ret.x+y1*(x2-x1)+x1*(y1-y2))/(x2-x1);\n\t}else{\n\t\tret.y = ((y4-y3)*ret.x+y3*(x4-x3)+x3*(y3-y4))/(x4-x3);\n\t}\n\treturn ret;\n}\n\n//インタフェース関数\nPoint calc_Cross_Point(Point a,Point b,Point c,Point d){\n\treturn calc_Cross_Point(a.x,b.x,c.x,d.x,a.y,b.y,c.y,d.y);\n}\n\nPoint calc_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\ndouble calc_len(Vector a){\n return sqrt(a.x*a.x+a.y*a.y);\n}\n\n\n//線分ではなく直線と点の距離\ndouble getDistanceLP(Line l,Point p){\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\n}\n\n//点と線分の距離\ndouble getDistanceSP(Line l,Point p){\n\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\n\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\n\treturn getDistanceLP(l,p);\n}\n\n//線分と線分の距離\ndouble getDistance(Line A,Line B){\n\tif(is_Cross(A,B))return 0.0;\n\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\n\t\t\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\n}\n\nPoint calc_Cross_Point(Line A,Line B){\n\n\tif(getDistanceSP(B,A.p[0]) < EPS){\n\n\t\treturn A.p[0];\n\n\t}else if(getDistanceSP(B,A.p[1]) < EPS){\n\n\t\treturn A.p[1];\n\n\t}else if(getDistanceSP(A,B.p[0]) < EPS){\n\n\t\treturn B.p[0];\n\n\t}else if(getDistanceSP(A,B.p[1]) < EPS){\n\n\t\treturn B.p[1];\n\t}\n\n\treturn calc_Cross_Point(A.p[0],A.p[1],B.p[0],B.p[1]);\n}\n\n/*\n * IN 2\n * ON 1\n * OUT 0\n *\n */\nint contains(Polygon g,Point p){\n\tint n = g.size();\n\tbool x = false;\n\tfor(int i = 0; i < n; i++){\n\t\tPoint a = g[i]-p,b = g[(i+1)%n]-p;\n\t\tif(abs(cross(a,b)) < EPS && dot(a,b) < EPS)return 1;\n\t\tif(a.y > b.y)swap(a,b);\n\t\tif(a.y < EPS && EPS < b.y && cross(a,b) > EPS) x = !x;\n\t}\n\treturn (x ? 2:0);\n}\n\n//2つのvectorがなすラジアンを求める関数\ndouble calc_rad(Vector vec1,Vector vec2){\n\n\tdouble tmp = dot(vec1,vec2)/(abs(vec1)*abs(vec2));\n\n\tif(fabs(tmp+1.0) < EPS){\n\n\t\treturn M_PI;\n\t}\n\n\tif(fabs(tmp-1.0) < EPS){\n\n\t\treturn 0.0;\n\t}\n\n\treturn acos(dot(vec1,vec2)/(abs(vec1)*abs(vec2)));\n}\n\n//3点がなすラジアンを求める関数(ccw(base,a,b) == CCW)\ndouble calc_rad(Point base,Point a,Point b){\n\n\tVector vec1 = b-base;\n\tVector vec2 = a-base;\n\n\treturn calc_rad(vec1,vec2);\n}\n\n\nvoid dfs(int start,int pre,int node){\n\n\tif(CATCH)return;\n\n\tif(node == start && pre != start){\n\n\t\tCATCH = true;\n\t\treturn;\n\t}\n\n\tPoint pre_p = point[pre];\n\tPoint now = point[node];\n\n\tdouble maxi = -BIG_NUM;\n\tint ind = -1;\n\n\tfor(int i = 0; i < G[node].size(); i++){\n\t\tint adj = G[node][i];\n\t\tif(adj == pre)continue;\n\n\t\tif(adj != start && SET.count(adj) > 0)continue;\n\t\tif(adj == start && pre == start)continue;\n\n\t\tPoint next = point[adj];\n\n\t\tdouble tmp_rad = calc_rad(now,pre_p,next);\n\n\t\tif(maxi+EPS < tmp_rad){\n\n\t\t\tmaxi = tmp_rad;\n\t\t\tind = i;\n\t\t}\n\t}\n\n\tif(ind == -1)return;\n\n\tSET.insert(G[node][ind]);\n\tPOL.push_back(point[G[node][ind]]);\n\tdfs(start,node,G[node][ind]);\n}\n\nvoid func(){\n\n\tint num_point = 0;\n\tfor(int i = 0; i < SIZE; i++){\n\n\t\tV[i].clear();\n\t\tG[i].clear();\n\t}\n\n\tPoint base = Point(0,0);\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lf %lf %lf %lf\",&line[i].p[0].x,&line[i].p[0].y,&line[i].p[1].x,&line[i].p[1].y);\n\t}\n\n\t//交点を全列挙\n\tfor(int i = 0; i < N-1; i++){\n\t\tfor(int k = i+1; k < N; k++){\n\t\t\tif(!is_Cross(line[i],line[k]))continue;\n\n\t\t\tPoint cross_p = calc_Cross_Point(line[i],line[k]);\n\n\t\t\tbool FLG = true;\n\t\t\tfor(int a = 0; a < num_point; a++){\n\t\t\t\tif(point[a] == cross_p){\n\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)continue;\n\n\t\t\tpoint[num_point++] = cross_p;\n\t\t\tV[i].push_back(cross_p);\n\t\t\tV[k].push_back(cross_p);\n\t\t}\n\t}\n\n\tfor(int i = 0; i < num_point; i++){\n\n\t\tDEL[i] = false;\n\t}\n\t//■■交点数が1なら行き止まりなので点を削除\n\tfor(int i = 0; i < N; i++){\n\t\tif(V[i].size() == 1){\n\n\t\t\tint ind = -1;\n\t\t\tfor(int k = 0; k < num_point; k++){\n\t\t\t\tif(point[k] == V[i][0]){\n\n\t\t\t\t\tind = k;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tDEL[ind] = true;\n\t\t}\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\t\tif(V[i].size() <= 1)continue;\n\n\t\tsort(V[i].begin(),V[i].end());\n\n\t\tvector<int> vec;\n\n\t\tfor(int k = 0; k < V[i].size(); k++){\n\t\t\tint ind = -1;\n\t\t\tfor(int a = 0; a < num_point; a++){\n\t\t\t\tif(point[a] == V[i][k]){\n\n\t\t\t\t\tind = a;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tvec.push_back(ind);\n\t\t}\n\n\t\tvector<int> work;\n\t\tfor(int k = 0; k < vec.size(); k++){\n\t\t\tif(!DEL[vec[k]]){\n\n\t\t\t\twork.push_back(vec[k]);\n\t\t\t}\n\t\t}\n\n\t\tvec = work;\n\n\t\tfor(int k = 0; k < vec.size()-1; k++){\n\n\t\t\tint p = vec[k];\n\t\t\tint q = vec[k+1];\n\n\t\t\tG[p].push_back(q);\n\t\t\tG[q].push_back(p);\n\t\t}\n\t}\n\n\tfor(int i = 0; i < num_point; i++){\n\t\tif(G[i].size() == 0)continue;\n\n\t\tfor(int k = 0; k < G[i].size(); k++){\n\n\t\t\tPOL.clear();\n\t\t\tSET.clear();\n\n\t\t\tPOL.push_back(point[i]);\n\t\t\tPOL.push_back(point[G[i][k]]);\n\n\t\t\tSET.insert(i);\n\t\t\tSET.insert(G[i][k]); //最初の2点を全探索\n\n\t\t\tCATCH = false;\n\t\t\tdfs(i,i,G[i][k]);\n\t\t\tif(CATCH){\n\n\n\t\t\t\tif(contains(POL,base) == 2){\n\n\t\t\t\t\tprintf(\"yes\\n\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"no\\n\");\n}\n\nint main(){\n\n\twhile(true){\n\n\t\tscanf(\"%d\",&N);\n\t\tif(N == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":6550,"memory_kb":5016,"score_of_the_acc":-1.1819,"final_rank":18},{"submission_id":"aoj_1247_8367548","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 //オーバーフローに注意\n#define MOD 998244353\n//#define MOD 1000000007\n#define EPS 0.000000001\n\n\n\n#define SIZE 10005\n\n\nstruct Point{\n\tPoint(double arg_x,double arg_y){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t}\n\n\tPoint(){\n\t\tx = y = 0.0;\n\t}\n\n\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\n\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\n\tPoint operator * (double a){ return Point(a*x,a*y); }\n\tPoint operator / (double a){ return Point(x/a,y/a); }\n\n\tdouble abs(){ return sqrt(norm()); }\n\tdouble norm(){ return x*x + y*y; }\n\n\tbool operator<(const Point &p) const{\n\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\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\n\nint N;\nLine line[SIZE];\nPoint point[SIZE];\nvector<Point> V[SIZE];\nvector<int> G[SIZE];\nset<int> SET;\nPolygon POL;\nbool CATCH,DEL[SIZE];\n\n\ndouble norm(Vector a){\n\treturn a.x*a.x+a.y*a.y;\n}\n\ndouble abs(Vector a){\n\treturn sqrt(norm(a));\n}\n\ndouble cross(Vector a,Vector b){\n return a.x*b.y-a.y*b.x;\n}\n\ndouble dot(Vector a,Vector b){\n return a.x*b.x + a.y*b.y;\n}\n\nstatic const int COUNTER_CLOCKWISE = 1;\nstatic const int CLOCKWISE = -1;\nstatic const int ONLINE_BACK = 2;\nstatic const int ONLINE_FRONT = -2;\nstatic const int ON_SEGMENT = 0;\n\n/*\n * p0を基準点として、p1から見てp2が\n * 反時計回り側にあれば\n * COUNTER_CLOCKWISE\n * */\nint ccw(Point p0,Point p1,Point p2){\n\n\tVector a = p1 - p0;\n\tVector b = p2 - p0;\n\n\tif(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\n\tif(cross(a,b) < -EPS)return CLOCKWISE;\n\tif(dot(a,b) < -EPS)return ONLINE_BACK;\n\tif(a.norm() < b.norm())return ONLINE_FRONT;\n\n\treturn ON_SEGMENT;\n}\n\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\n\n//交点を求める関数\nPoint calc_Cross_Point(double x1,double x2,double x3,double x4,double y1,double y2,double y3,double y4){\n\tPoint ret;\n\tret.x = ((x2-x1)*(y3*(x4-x3)+x3*(y3-y4))-(x4-x3)*(y1*(x2-x1)+x1*(y1-y2)))/((y2-y1)*(x4-x3)-(y4-y3)*(x2-x1));\n\tif(fabs(x1-x2) > EPS){\n\t\tret.y = ((y2-y1)*ret.x+y1*(x2-x1)+x1*(y1-y2))/(x2-x1);\n\t}else{\n\t\tret.y = ((y4-y3)*ret.x+y3*(x4-x3)+x3*(y3-y4))/(x4-x3);\n\t}\n\treturn ret;\n}\n\n//インタフェース関数\nPoint calc_Cross_Point(Point a,Point b,Point c,Point d){\n\treturn calc_Cross_Point(a.x,b.x,c.x,d.x,a.y,b.y,c.y,d.y);\n}\n\nPoint calc_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\ndouble calc_len(Vector a){\n return sqrt(a.x*a.x+a.y*a.y);\n}\n\n\n//線分ではなく直線と点の距離\ndouble getDistanceLP(Line l,Point p){\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\n}\n\n//点と線分の距離\ndouble getDistanceSP(Line l,Point p){\n\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\n\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\n\treturn getDistanceLP(l,p);\n}\n\n//線分と線分の距離\ndouble getDistance(Line A,Line B){\n\tif(is_Cross(A,B))return 0.0;\n\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\n\t\t\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\n}\n\nPoint calc_Cross_Point(Line A,Line B){\n\n\tif(getDistanceSP(B,A.p[0]) < EPS){\n\n\t\treturn A.p[0];\n\n\t}else if(getDistanceSP(B,A.p[1]) < EPS){\n\n\t\treturn A.p[1];\n\n\t}else if(getDistanceSP(A,B.p[0]) < EPS){\n\n\t\treturn B.p[0];\n\n\t}else if(getDistanceSP(A,B.p[1]) < EPS){\n\n\t\treturn B.p[1];\n\t}\n\n\treturn calc_Cross_Point(A.p[0],A.p[1],B.p[0],B.p[1]);\n}\n\n/*\n * IN 2\n * ON 1\n * OUT 0\n *\n */\nint contains(Polygon g,Point p){\n\tint n = g.size();\n\tbool x = false;\n\tfor(int i = 0; i < n; i++){\n\t\tPoint a = g[i]-p,b = g[(i+1)%n]-p;\n\t\tif(abs(cross(a,b)) < EPS && dot(a,b) < EPS)return 1;\n\t\tif(a.y > b.y)swap(a,b);\n\t\tif(a.y < EPS && EPS < b.y && cross(a,b) > EPS) x = !x;\n\t}\n\treturn (x ? 2:0);\n}\n\n//2つのvectorがなすラジアンを求める関数\ndouble calc_rad(Vector vec1,Vector vec2){\n\n\tdouble tmp = dot(vec1,vec2)/(abs(vec1)*abs(vec2));\n\n\tif(fabs(tmp+1.0) < EPS){\n\n\t\treturn M_PI;\n\t}\n\n\tif(fabs(tmp-1.0) < EPS){\n\n\t\treturn 0.0;\n\t}\n\n\treturn acos(dot(vec1,vec2)/(abs(vec1)*abs(vec2)));\n}\n\n//3点がなすラジアンを求める関数(ccw(base,a,b) == CCW)\ndouble calc_rad(Point base,Point a,Point b){\n\n\tVector vec1 = b-base;\n\tVector vec2 = a-base;\n\n\treturn calc_rad(vec1,vec2);\n}\n\nbool DEBUG = false;\n\n\nvoid dfs(int start,int pre,int node){\n\n\tif(CATCH)return;\n\n\tif(DEBUG){\n\n\t\tprintf(\"start:%d pre:%d node:%d ■現在の座標\\n\",start,pre,node);\n\t\tpoint[node].debug();\n\t}\n\n\tif(node == start && pre != start){\n\n\t\tCATCH = true;\n\t\tif(DEBUG){\n\t\t\tprintf(\"■■とらえた\\n\");\n\t\t\tprintf(\"start: [%d] \",start);\n\t\t\tpoint[start].debug();\n\t\t\tprintf(\"pre: [%d] \",pre);\n\t\t\tpoint[pre].debug();\n\t\t}\n\t\treturn;\n\t}\n\n\tPoint pre_p = point[pre];\n\tPoint now = point[node];\n\n\tdouble maxi = -BIG_NUM;\n\tint ind = -1;\n\n\tfor(int i = 0; i < G[node].size(); i++){\n\t\tint adj = G[node][i];\n\t\tif(adj == pre)continue;\n\n\t\tif(adj != start && SET.count(adj) > 0)continue;\n\t\tif(adj == start && pre == start)continue;\n\n\t\tPoint next = point[adj];\n\n\t\t//if(ccw(now,next,pre_p) == CLOCKWISE)continue;\n\n\n\t\tdouble tmp_rad = calc_rad(now,pre_p,next);\n\t\t//printf(\"tmp_rad:%.3lf\\n\",tmp_rad);\n\t\tif(maxi+EPS < tmp_rad){\n\n\t\t\t//printf(\"tmp_rad:%.3lf\\n\",tmp_rad);\n\t\t\tmaxi = tmp_rad;\n\t\t\tind = i;\n\t\t}\n\t}\n\n\tif(ind == -1)return;\n\n\tSET.insert(G[node][ind]);\n\tPOL.push_back(point[G[node][ind]]);\n\tdfs(start,node,G[node][ind]);\n}\n\nvoid func(){\n\n\tint num_point = 0;\n\tfor(int i = 0; i < SIZE; i++){\n\n\t\tV[i].clear();\n\t\tG[i].clear();\n\t}\n\n\tPoint base = Point(0,0);\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lf %lf %lf %lf\",&line[i].p[0].x,&line[i].p[0].y,&line[i].p[1].x,&line[i].p[1].y);\n\t}\n\n\t//交点を全列挙\n\tfor(int i = 0; i < N-1; i++){\n\t\tfor(int k = i+1; k < N; k++){\n\t\t\tif(!is_Cross(line[i],line[k]))continue;\n\n\t\t\tPoint cross_p = calc_Cross_Point(line[i],line[k]);\n\n\t\t\tbool FLG = true;\n\t\t\tfor(int a = 0; a < num_point; a++){\n\t\t\t\tif(point[a] == cross_p){\n\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)continue;\n\n\t\t\t//cross_p.debug();\n\n\t\t\tpoint[num_point++] = cross_p;\n\t\t\tV[i].push_back(cross_p);\n\t\t\tV[k].push_back(cross_p);\n\t\t}\n\t}\n\n\tfor(int i = 0; i < num_point; i++){\n\n\t\tDEL[i] = false;\n\t}\n\t//交点数が1なら行き止まりなので点を削除\n\tfor(int i = 0; i < N; i++){\n\t\tif(V[i].size() == 1){\n\n\t\t\tint ind = -1;\n\t\t\tfor(int k = 0; k < num_point; k++){\n\t\t\t\tif(point[k] == V[i][0]){\n\n\t\t\t\t\tind = k;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tDEL[ind] = true;\n\t\t}\n\t}\n\n/*\n\tfor(int i = 0; i < num_point; i++){\n\n\t\tprintf(\"点%d \",i);\n\t\tpoint[i].debug();\n\t}*/\n\n\tfor(int i = 0; i < N; i++){\n\t\tif(V[i].size() <= 1)continue;\n\n\t\tsort(V[i].begin(),V[i].end());\n\n\t\t/*printf(\"\\n線分%d\",i);\n\t\tfor(int a = 0; a < V[i].size(); a++){\n\n\t\t\tV[i][a].debug();\n\t\t}*/\n\n\t\tvector<int> vec;\n\n\t\tfor(int k = 0; k < V[i].size(); k++){\n\t\t\tint ind = -1;\n\t\t\tfor(int a = 0; a < num_point; a++){\n\t\t\t\tif(point[a] == V[i][k]){\n\n\t\t\t\t\tind = a;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tvec.push_back(ind);\n\t\t}\n\n\t\tvector<int> work;\n\t\tfor(int k = 0; k < vec.size(); k++){\n\t\t\tif(!DEL[vec[k]]){\n\n\t\t\t\twork.push_back(vec[k]);\n\t\t\t}\n\t\t}\n\n\t\tvec = work;\n\n\t\tfor(int k = 0; k < vec.size()-1; k++){\n\n\t\t\tint p = vec[k];\n\t\t\tint q = vec[k+1];\n\n\t\t\tG[p].push_back(q);\n\t\t\tG[q].push_back(p);\n\t\t}\n\t}\n/*\n\tfor(int i = 0; i < num_point; i++){\n\t\t//f(i != 0 && i != 1)continue;\n\n\t\tprintf(\"\\n点%dです\\n\",i);\n\t\tfor(int k = 0; k < G[i].size(); k++){\n\n\t\t\tprintf(\"点%dと隣接\\n\",G[i][k]);\n\t\t}\n\t}\n\treturn;*/\n\n\tfor(int i = 0; i < num_point; i++){\n\t\tif(G[i].size() == 0)continue;\n\n\t\tfor(int k = 0; k < G[i].size(); k++){\n\n\t\t\tPOL.clear();\n\t\t\tSET.clear();\n\n\t\t\tPOL.push_back(point[i]);\n\t\t\tPOL.push_back(point[G[i][k]]);\n\n\t\t\tSET.insert(i);\n\t\t\tSET.insert(G[i][k]); //最初の2点を全探索\n\n\t\t\tif(DEBUG){\n\t\t\t\tprintf(\"\\n◎◎◎dfs\\n\");\n\t\t\t}\n\n\t\t\tCATCH = false;\n\t\t\tdfs(i,i,G[i][k]);\n\t\t\tif(CATCH){\n\n\n\t\t\t\tif(contains(POL,base) == 2){\n\n\t\t\t\t\tif(DEBUG){\n\t\t\t\t\t\tfor(int a = 0; a < POL.size(); a++){\n\n\t\t\t\t\t\t\tPOL[a].debug();\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tprintf(\"yes\\n\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"no\\n\");\n}\n\nint main(){\n\n\twhile(true){\n\n\t\tscanf(\"%d\",&N);\n\t\tif(N == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":6560,"memory_kb":4848,"score_of_the_acc":-1.1647,"final_rank":17},{"submission_id":"aoj_1247_4320286","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n#pragma GCC optimize(\"unroll-loops\")\n#include\"bits/stdc++.h\"\n\nusing namespace std;\n\n#define REP(i,n) for(int i=0;i<(n);i++)\n#define FOR(i,m,n) for(int i=(m);i<(n);i++)\n\nconst bool DEBUG = false;\n\nconst double EPS = 1e-8;\ntypedef complex<double> point;\nistream &operator>>(istream &is, point &p) {\n\tdouble a, b;\n\tis >> a >> b;\n\tp = point(a, b);\n\treturn is;\n}\npoint operator*(const point&p, const double &d) {\n\treturn point(real(p)*d, imag(p)*d);\n}\nnamespace std {\n\tbool operator < (const point& a, const point& b) {\n\t\treturn real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n\t}\n}\n\n//直線or線分\nstruct Line : public vector<point> {\n\tLine(const point &a, const point &b) {\n\t\tpush_back(a); push_back(b);\n\t}\n};\ntypedef vector<Line>Lines;\n\n\ndouble cross(const point& a, const point& b) {\n\treturn real(a)*imag(b) - imag(a)*real(b);\n}\ndouble dot(const point& a, const point& b) {\n\treturn real(a)*real(b) + imag(a)*imag(b);\n}\nint ccw(point a, point b, point c) {\n\tb = b - a; c = c - a;\n\tif (cross(b, c) > EPS) return +1; // counter clockwise\n\tif (cross(b, c) < -EPS) return -1; // clockwise\n\tif (dot(b, c) < -EPS) return +2; // c--a--b on line\n\tif (norm(b) < norm(c)) return -2; // a--b--c on line\n\treturn 0;\n}\n//交差判定\nbool intersectLL(const Line &l1, const Line &l2) {\n\treturn abs(cross(l1[1] - l1[0], l2[1] - l2[0])) > EPS || //non-parallel\n\t\tabs(cross(l1[1] - l1[0], l2[0] - l1[0])) < EPS; //same line\n}\nbool intersectLS(const Line &l, const Line &s) {\n\treturn cross(l[1] - l[0], s[0] - l[0])* // s[0] is left of l\n\t\tcross(l[1] - l[0], s[1] - l[0]) < EPS; // s[1] is right of l\n}\nbool intersectLP(const Line &l, const point &p) {\n\treturn abs(cross(l[1] - p, l[0] - p)) < EPS;\n}\n//端点に乗ってたらfalse\nbool intersectSP_without_endpoint(const Line &s, const point &p) {\n\tif (abs(s[0] - p) < EPS || abs(s[1] - p) < EPS)return false;\n\treturn abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < EPS; //triangle inequality\n}\n\nbool intersectSP(const Line &s, const point &p) { //verified on 2020/04/03 https://onlinejudge.u-aizu.ac.jp/status/users/Mojumbo/submissions/1/1157/judge/4316978/C++14\n\treturn abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < EPS; //triangle inequality\n}\nbool connectSS(const Line &s, const Line &t) {\n\tif (intersectSP(s, t[0]) || intersectSP(s, t[1]) || intersectSP(t, s[0]) || intersectSP(t, s[1]))return true;\n\telse return false;\n}\nbool isSamePoint(const point &p1, const point &p2) {\n\treturn abs(p1 - p2)<EPS;\n}\nbool connectSS_with_endpoint(const Line &s, const Line &t) {\n\tREP(i, 2)REP(j, 2) {\n\t\t//if(isSamePoint(s[i],t[j]))return true;\n\t\tif (s[i] == t[j])return true;\n\t}\n\treturn false;\n}\nbool intersectSS(const Line &s, const Line &t) {\n\treturn ccw(s[0], s[1], t[0])*ccw(s[0], s[1], t[1]) <= 0 &&\n\t\tccw(t[0], t[1], s[0])*ccw(t[0], t[1], s[1]) <= 0;\n}\nbool intersectSS_strict(const Line &s, const Line &t) {\n\t//端点が線分上に乗っている場合はfalseにする\n\tif (connectSS(s, t))return false;\n\treturn ccw(s[0], s[1], t[0])*ccw(s[0], s[1], t[1]) <= 0 &&\n\t\tccw(t[0], t[1], s[0])*ccw(t[0], t[1], s[1]) <= 0;\n}\n\nbool isOn(const Line &l, const point &p) {\n\tif (l[0] == p || l[1] == p)return false;\n\tpoint d = l[1] - l[0];\n\tpoint p0 = (p - l[0]) / d;\n\treturn p0.imag() == 0.0&&0.0<p0.real() && p0.real()<1.0;\n}\nbool intersect(const Line &l0, const Line &l1, point &p) {\n\tif (connectSS_with_endpoint(l0, l1) || isOn(l0, l1[0]) || isOn(l0, l1[1]) || isOn(l1, l0[0]) || isOn(l1, l0[1]))return false;\n\tpoint d = l0[1] - l0[0];\n\tpoint p0 = (l1[0] - l0[0]) / d;\n\tpoint p1 = (l1[1] - l0[0]) / d;\n\tif (p0.imag()*p1.imag() >= 0)return false;\n\tdouble t = p0.imag() / (p0.imag() - p1.imag());\n\tdouble s = p0.real()*(1 - t) + p1.real()*t;\n\tif (s <= 0.0 || 1.0 <= s)return false;\n\tp = l0[0] + d * s;\n\treturn true;\n}\n\n//距離,交点\n//射影 直線lにpから下した垂線との交点\n\npoint projection(const Line &l, const point &p) { //verified on 2020/04/03 https://onlinejudge.u-aizu.ac.jp/status/users/Mojumbo/submissions/1/1157/judge/4316978/C++14\n\tdouble t = dot(p - l[0], l[0] - l[1]) / norm(l[0] - l[1]);\n\treturn l[0] + (l[0] - l[1])*t;\n}\n//射影 直線lを対象軸としてpと線対称にある点\npoint reflection(const Line &l, const point &p) {\n\treturn p + (projection(l, p) - p) * 2;\n}\ndouble distancePP(const point& a, const point& b) {\n\treturn sqrt(norm(a - b));\n}\ndouble distanceLP(const Line &l, const point &p) {\n\treturn abs(p - projection(l, p));\n}\ndouble distanceLL(const Line&l, const Line &m) {\n\treturn intersectLL(l, m) ? 0 : distanceLP(l, m[0]);\n}\ndouble distanceLS(const Line &l, const Line &s) {\n\tif (intersectLS(l, s))return 0;\n\treturn min(distanceLP(l, s[0]), distanceLP(l, s[1]));\n}\ndouble distanceSP(const Line &s, const point &p) {\n\tconst point r = projection(s, p);\n\tif (intersectSP(s, r))return abs(r - p);\n\treturn min(abs(s[0] - p), abs(s[1] - p));\n}\ndouble distanceSS(const Line &s, const Line &t) { //verified on 2020/04/03 https://onlinejudge.u-aizu.ac.jp/status/users/Mojumbo/submissions/1/1157/judge/4316978/C++14\n\tif (intersectSS(s, t))return 0;\n\treturn min({ distanceSP(s,t[0]),distanceSP(s,t[1]),distanceSP(t,s[0]),distanceSP(t,s[1]) });\n}\npoint crosspoint(const Line &l, const Line &m) {\n\tdouble A = cross(l[1] - l[0], m[1] - m[0]);\n\tdouble B = cross(l[1] - l[0], l[1] - m[0]);\n\tif (abs(A) < EPS&&abs(B) < EPS)return m[0];//same line\n\tif (abs(A) < EPS)assert(false); // Precondition not satisfied\n\treturn m[0] + B / A * (m[1] - m[0]);\n}\ndouble dist(point &p1, point &p2) {\n\treturn abs(p1 - p2);\n}\n\n//線分同士の交点で分割して端点以外の共有点を持たないようにする\nvoid splitSegments(Lines &ls) {\n\t//端点が線分上に乗っている場合の分割\n\tfor (int i = 0; i < (int)ls.size(); i++){\n\t\tint mx = ls.size();\n\t\tfor (int j = i + 1; j < (int)ls.size(); j++) {\n\t\t\tif (j >= mx)break;\n\t\t\tfor (int k = 0; k < 2; k++) {\n\t\t\t\t//if(isOn(ls[i],ls[j][k])){\n\t\t\t\tif (intersectSP_without_endpoint(ls[i], ls[j][k])) {\n\t\t\t\t\tls.push_back(Line(ls[i][0], ls[j][k]));\n\t\t\t\t\tls[i][0] = ls[j][k];\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t//else if(isOn(ls[j],ls[i][k])){\n\t\t\t\telse if (intersectSP_without_endpoint(ls[j], ls[i][k])) {\n\t\t\t\t\tls.push_back(Line(ls[j][0], ls[i][k]));\n\t\t\t\t\tls[j][0] = ls[i][k];\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t//cerr << \"split-1\" << endl;\n\t//線分が交差している場合の分割\n\tfor (int i = 0; i < (int)ls.size(); i++) {\n\t\tLine li = ls[i];\n\t\tint mx = ls.size();\n\t\tfor (int j = i + 1; j < (int)ls.size(); j++) {\n\t\t\tpoint cross_p;\n\t\t\tif (j >= mx)break;\n\t\t\t//if (intersect(ls[i], ls[j], cross_p)) {\n\t\t\tif (intersectSS_strict(ls[i], ls[j])) {\n\t\t\t\tcross_p = crosspoint(ls[i], ls[j]);\n\t\t\t\tls.push_back(Line(ls[i][0], cross_p));\n\t\t\t\tls[i][0] = cross_p;\n\t\t\t\tls.push_back(Line(ls[j][0], cross_p));\n\t\t\t\tls[j][0] = cross_p;\n\t\t\t}\n\t\t}\n\t}\n}\n\n//線分の集合(split済み)を連結成分に分解する(union-find)\n\nstruct Equiv {\n\tvector<int>links;\n\t//大きさ1の同値類をn個作る\n\tEquiv(int n) :links(n) {\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tlinks[i] = i;\n\t\t}\n\t}\n\t//xの属する同値類の代表元を返す\n\tint find(int x) {\n\t\tint xx = links[x];\n\t\tif (xx == x)return x;\n\t\treturn links[x] = find(xx);\n\t}\n\tvoid unify(int x, int y) {\n\t\tint xx = find(x), yy = find(y);\n\t\tif (xx <= yy)links[yy] = xx;\n\t\telse links[xx] = yy;\n\t}\n};\n\ntypedef vector<Lines>vLines;\nvLines connectedComponent(const Lines &ls) {\n\tvLines ret;\n\tEquiv equiv(ls.size());\n\tfor (int i = 0; i < (int)ls.size(); i++) {\n\t\tfor (int j = 0; j < i; j++) {\n\t\t\tif (connectSS_with_endpoint(ls[i], ls[j])) {\n\t\t\t\tequiv.unify(i, j);\n\t\t\t}\n\t\t}\n\t}\n\t//cerr << \"connected-1\" << endl;\n\tfor (int i = 0; i < (int)ls.size(); i++) {\n\t\tif (equiv.find(i) == i) {\n\t\t\tLines newLs;\n\t\t\tnewLs.push_back(ls[i]);\n\t\t\tfor (int j = i + 1; j < (int)ls.size(); j++) {\n\t\t\t\tif (equiv.find(j) == i)newLs.push_back(ls[j]);\n\t\t\t}\n\t\t\tret.push_back(newLs);\n\t\t}\n\t}\n\treturn ret;\n}\n//左手法でのトレース\n//偏角でソートされた隣接点のvectorを得る\ntypedef pair<double, point>doublePoint;\ntypedef vector<doublePoint> vDoublePoint;\ntypedef map<point, vDoublePoint> adjPoint;\ntypedef vector<point>points;\n//移動前の点と隣接点のリストから移動先を決定\npoint findNext(const vDoublePoint &vdp, const point &p) {\n\tfor (int i = 0; i < (int)vdp.size() - 1; i++) {\n\t\tif (p == vdp[i].second) {\n\t\t\treturn vdp[i + 1].second;\n\t\t}\n\t}\n\treturn vdp[0].second;\n}\n//左手法でトレースして通った点の列を返す\npoints trace(const Lines &ls) {\n\tadjPoint aPoint;\n\t//隣接点(偏角付き)のリストを作成\n\tfor (int i = 0; i < (int)ls.size(); i++) {\n\t\taPoint[ls[i][0]].push_back(doublePoint(arg(ls[i][1] - ls[i][0]), ls[i][1]));\n\t\taPoint[ls[i][1]].push_back(doublePoint(arg(ls[i][0] - ls[i][1]), ls[i][0]));\n\t}\n\t//x座標最小の点の計算と隣接点リストのソート\n\tpoint minPoint(INT_MAX, INT_MAX);\n\tadjPoint::iterator it;\n\tfor (it = aPoint.begin(); it != aPoint.end(); ++it) {\n\t\tpoint p = it->first;\n\t\tminPoint = min(minPoint, p);\n\t\tvDoublePoint &vdp = it->second;\n\t\tsort(vdp.begin(), vdp.end());\n\t}\n\tpoints ret;\n\tret.push_back(minPoint);\n\t//最初の移動先\n\tpoint curP = aPoint[minPoint][0].second;\n\tpoint lastP = minPoint;\n\t//トレースの繰り返し\n\twhile (curP != minPoint) {\n\t\tif (DEBUG)cerr << curP << endl;\n\t\tret.push_back(curP);\n\t\tpoint nextP = findNext(aPoint[curP], lastP);\n\t\t//if(isSamePoint(curP,nextP))break;\n\t\tlastP = curP;\n\t\tcurP = nextP;\n\t}\n\t//開始点を最後にも追加\n\tret.push_back(minPoint);\n\treturn ret;\n}\n\nbool isInside(const points &ps) {\n\tLine l0(point(0, 0), point(51.0, 1.0 / 20000.0));\n\tint count = 0;\n\tfor (int i = 0; i < (int)ps.size() - 1; i++) {\n\t\tpoint dummy;\n\t\tLine l1(ps[i], ps[i + 1]);\n\t\tif (intersect(l0, l1, dummy))count++;\n\t}\n\treturn (count & 1) == 1;\n}\n\n\n//円\nstruct Circle {\n\tpoint p; double r;\n\tCircle(const point &p_, double r_) : p(p_), r(r_) { }\n};\n\n//凸包\nvector<point> convex_hull(vector<point> ps) {\n\tint n = ps.size(), k = 0;\n\tsort(ps.begin(), ps.end());\n\tvector<point> ch(2 * n);\n\tfor (int i = 0; i < n; ch[k++] = ps[i++]) // lower-hull\n\t\twhile (k >= 2 && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\n\tfor (int i = n - 2, t = k + 1; i >= 0; ch[k++] = ps[i--]) // upper-hull\n\t\twhile (k >= t && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\n\tch.resize(k - 1);\n\treturn ch;\n}\n\n//2点を通る半径Rの円の中心\npair<point, point> get_circle_from_2points(point &p1, point &p2, double R) {\n\tdouble d = dist(p1, p2);\n\tdouble x1 = p1.real(), x2 = p2.real();\n\tdouble y1 = p1.imag(), y2 = p2.imag();\n\tif (p1.imag() == p2.imag()) {\n\t\tdouble x = (x1 + x2) / 2.0;\n\t\tdouble dy = sqrt(R - d * d / 4);\n\t\treturn { { x,y1 + dy },{ x,y1 - dy } };\n\t}\n\telse {\n\t\tdouble m = (x1 - x2) / (y2 - y1);\n\t\tdouble t = sqrt(R*R - d * d / 4);\n\t\tdouble dx = sqrt((t*t) / (m*m + 1));\n\t\tdouble dy = sqrt(t*t - dx * dx);\n\t\tdouble gx = (x1 + x2) / 2;\n\t\tdouble gy = (y1 + y2) / 2;\n\t\tif (m > EPS) {\n\t\t\treturn { { gx + dx,gy + dy },{ gx - dx,gy - dy } };\n\t\t}\n\t\telse {\n\t\t\treturn { { gx + dx,gy - dy },{ gx - dx,gy + dy } };\n\t\t}\n\t}\n}\n//長方形\nstruct Square {\n\tdouble lx, ly, rx, ry;\n\tSquare(double lx_, double ly_, double rx_, double ry_) :lx(lx_), ly(ly_), rx(rx_), ry(ry_) {};\n\tbool include(point &p) {\n\t\treturn p.real() + EPS >= lx && p.real() - EPS <= rx && p.imag() + EPS >= ly && p.imag() - EPS <= ry;\n\t}\n};\n\nstruct Polygon : public vector<point> {\n\t//0->OUT, 1->ON, 2->IN\n\tint contains(const point &p) {\n\t\tbool in = false;\n\t\tint N = this->size();\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tpoint a = this->at(i) - p;\n\t\t\tpoint b = this->at((i + 1) % N) - p;\n\t\t\tif (imag(a) > imag(b)) {\n\t\t\t\tstd::swap(a, b);\n\t\t\t}\n\t\t\tif (imag(a) <= 0 && 0 < imag(b))\n\t\t\t\tif (cross(a, b) < 0)in = !in;\n\t\t\tif (cross(a, b) == 0 && dot(a, b) <= 0)return 1;\n\t\t}\n\t\treturn in ? 2 : 0;\n\t}\n};\nclock_t START, END;\nbool trapAll() {\n\tint N; cin >> N;\n\tif (N == 0) {\n\t\tEND = clock();\n\t\tdouble t = (double)(END - START) / CLOCKS_PER_SEC;\n\t\t//cerr << \"elapsed time\" << t << \"[sec]\" << endl;\n\t\texit(0);\n\t}\n\tLines ls;\n\tREP(i, N) {\n\t\tdouble x1, y1, x2, y2;\n\t\tcin >> x1 >> y1 >> x2 >> y2;\n\t\tpoint p1(x1, y1);\n\t\tpoint p2(x2, y2);\n\t\tls.push_back(Line(p1, p2));\n\t}\n\tsplitSegments(ls);\n\t// for(auto l:ls){\n\t// \tcerr<<l[0]<<\" \"<<l[1]<<endl;\n\t// }\n\t//cerr << \"splitted\" << endl;\n\tvLines vls = connectedComponent(ls);\n\tfor (auto lines : vls) {\n\t\t//if(isInside(trace(lines)))return true;\n\t\tPolygon poly;\n\t\tpoints ps = trace(lines);\n\t\tfor (auto p : ps) {\n\t\t\tpoly.push_back(p);\n\t\t}\n\t\tif (poly.contains(point(0, 0)))return true;\n\t}\n\treturn false;\n}\n\nvoid solve() {\n\tif (trapAll())cout << \"yes\" << endl;\n\telse cout << \"no\" << endl;\n\tif (DEBUG)cerr << \"+++++++++++++\" << endl;\n}\nsigned main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tSTART = clock();\n\twhile (true)\n\t\tsolve();\n\n}","accuracy":1,"time_ms":3930,"memory_kb":6452,"score_of_the_acc":-0.9429,"final_rank":10},{"submission_id":"aoj_1247_4320285","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n#pragma GCC optimize(\"unroll-loops\")\n#include\"bits/stdc++.h\"\n\nusing namespace std;\n\n#define REP(i,n) for(int i=0;i<(n);i++)\n#define FOR(i,m,n) for(int i=(m);i<(n);i++)\n\nconst bool DEBUG = false;\n\nconst double EPS = 1e-8;\ntypedef complex<double> point;\nistream &operator>>(istream &is, point &p) {\n\tdouble a, b;\n\tis >> a >> b;\n\tp = point(a, b);\n\treturn is;\n}\npoint operator*(const point&p, const double &d) {\n\treturn point(real(p)*d, imag(p)*d);\n}\nnamespace std {\n\tbool operator < (const point& a, const point& b) {\n\t\treturn real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n\t}\n}\n\n//直線or線分\nstruct Line : public vector<point> {\n\tLine(const point &a, const point &b) {\n\t\tpush_back(a); push_back(b);\n\t}\n};\ntypedef vector<Line>Lines;\n\n\ndouble cross(const point& a, const point& b) {\n\treturn real(a)*imag(b) - imag(a)*real(b);\n}\ndouble dot(const point& a, const point& b) {\n\treturn real(a)*real(b) + imag(a)*imag(b);\n}\nint ccw(point a, point b, point c) {\n\tb = b - a; c = c - a;\n\tif (cross(b, c) > EPS) return +1; // counter clockwise\n\tif (cross(b, c) < -EPS) return -1; // clockwise\n\tif (dot(b, c) < -EPS) return +2; // c--a--b on line\n\tif (norm(b) < norm(c)) return -2; // a--b--c on line\n\treturn 0;\n}\n//交差判定\nbool intersectLL(const Line &l1, const Line &l2) {\n\treturn abs(cross(l1[1] - l1[0], l2[1] - l2[0])) > EPS || //non-parallel\n\t\tabs(cross(l1[1] - l1[0], l2[0] - l1[0])) < EPS; //same line\n}\nbool intersectLS(const Line &l, const Line &s) {\n\treturn cross(l[1] - l[0], s[0] - l[0])* // s[0] is left of l\n\t\tcross(l[1] - l[0], s[1] - l[0]) < EPS; // s[1] is right of l\n}\nbool intersectLP(const Line &l, const point &p) {\n\treturn abs(cross(l[1] - p, l[0] - p)) < EPS;\n}\n//端点に乗ってたらfalse\nbool intersectSP_without_endpoint(const Line &s, const point &p) {\n\tif (abs(s[0] - p) < EPS || abs(s[1] - p) < EPS)return false;\n\treturn abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < EPS; //triangle inequality\n}\n\nbool intersectSP(const Line &s, const point &p) { //verified on 2020/04/03 https://onlinejudge.u-aizu.ac.jp/status/users/Mojumbo/submissions/1/1157/judge/4316978/C++14\n\treturn abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < EPS; //triangle inequality\n}\nbool connectSS(const Line &s, const Line &t) {\n\tif (intersectSP(s, t[0]) || intersectSP(s, t[1]) || intersectSP(t, s[0]) || intersectSP(t, s[1]))return true;\n\telse return false;\n}\nbool isSamePoint(const point &p1, const point &p2) {\n\treturn abs(p1 - p2)<EPS;\n}\nbool connectSS_with_endpoint(const Line &s, const Line &t) {\n\tREP(i, 2)REP(j, 2) {\n\t\t//if(isSamePoint(s[i],t[j]))return true;\n\t\tif (s[i] == t[j])return true;\n\t}\n\treturn false;\n}\nbool intersectSS(const Line &s, const Line &t) {\n\treturn ccw(s[0], s[1], t[0])*ccw(s[0], s[1], t[1]) <= 0 &&\n\t\tccw(t[0], t[1], s[0])*ccw(t[0], t[1], s[1]) <= 0;\n}\nbool intersectSS_strict(const Line &s, const Line &t) {\n\t//端点が線分上に乗っている場合はfalseにする\n\tif (connectSS(s, t))return false;\n\treturn ccw(s[0], s[1], t[0])*ccw(s[0], s[1], t[1]) <= 0 &&\n\t\tccw(t[0], t[1], s[0])*ccw(t[0], t[1], s[1]) <= 0;\n}\n\nbool isOn(const Line &l, const point &p) {\n\tif (l[0] == p || l[1] == p)return false;\n\tpoint d = l[1] - l[0];\n\tpoint p0 = (p - l[0]) / d;\n\treturn p0.imag() == 0.0&&0.0<p0.real() && p0.real()<1.0;\n}\nbool intersect(const Line &l0, const Line &l1, point &p) {\n\tif (connectSS_with_endpoint(l0, l1) || isOn(l0, l1[0]) || isOn(l0, l1[1]) || isOn(l1, l0[0]) || isOn(l1, l0[1]))return false;\n\tpoint d = l0[1] - l0[0];\n\tpoint p0 = (l1[0] - l0[0]) / d;\n\tpoint p1 = (l1[1] - l0[0]) / d;\n\tif (p0.imag()*p1.imag() >= 0)return false;\n\tdouble t = p0.imag() / (p0.imag() - p1.imag());\n\tdouble s = p0.real()*(1 - t) + p1.real()*t;\n\tif (s <= 0.0 || 1.0 <= s)return false;\n\tp = l0[0] + d * s;\n\treturn true;\n}\n\n//距離,交点\n//射影 直線lにpから下した垂線との交点\n\npoint projection(const Line &l, const point &p) { //verified on 2020/04/03 https://onlinejudge.u-aizu.ac.jp/status/users/Mojumbo/submissions/1/1157/judge/4316978/C++14\n\tdouble t = dot(p - l[0], l[0] - l[1]) / norm(l[0] - l[1]);\n\treturn l[0] + (l[0] - l[1])*t;\n}\n//射影 直線lを対象軸としてpと線対称にある点\npoint reflection(const Line &l, const point &p) {\n\treturn p + (projection(l, p) - p) * 2;\n}\ndouble distancePP(const point& a, const point& b) {\n\treturn sqrt(norm(a - b));\n}\ndouble distanceLP(const Line &l, const point &p) {\n\treturn abs(p - projection(l, p));\n}\ndouble distanceLL(const Line&l, const Line &m) {\n\treturn intersectLL(l, m) ? 0 : distanceLP(l, m[0]);\n}\ndouble distanceLS(const Line &l, const Line &s) {\n\tif (intersectLS(l, s))return 0;\n\treturn min(distanceLP(l, s[0]), distanceLP(l, s[1]));\n}\ndouble distanceSP(const Line &s, const point &p) {\n\tconst point r = projection(s, p);\n\tif (intersectSP(s, r))return abs(r - p);\n\treturn min(abs(s[0] - p), abs(s[1] - p));\n}\ndouble distanceSS(const Line &s, const Line &t) { //verified on 2020/04/03 https://onlinejudge.u-aizu.ac.jp/status/users/Mojumbo/submissions/1/1157/judge/4316978/C++14\n\tif (intersectSS(s, t))return 0;\n\treturn min({ distanceSP(s,t[0]),distanceSP(s,t[1]),distanceSP(t,s[0]),distanceSP(t,s[1]) });\n}\npoint crosspoint(const Line &l, const Line &m) {\n\tdouble A = cross(l[1] - l[0], m[1] - m[0]);\n\tdouble B = cross(l[1] - l[0], l[1] - m[0]);\n\tif (abs(A) < EPS&&abs(B) < EPS)return m[0];//same line\n\tif (abs(A) < EPS)assert(false); // Precondition not satisfied\n\treturn m[0] + B / A * (m[1] - m[0]);\n}\ndouble dist(point &p1, point &p2) {\n\treturn abs(p1 - p2);\n}\n\n//線分同士の交点で分割して端点以外の共有点を持たないようにする\nvoid splitSegments(Lines &ls) {\n\t//端点が線分上に乗っている場合の分割\n\tfor (int i = 0; i < (int)ls.size(); i++){\n\t\tint mx = ls.size();\n\t\tfor (int j = i + 1; j < (int)ls.size(); j++) {\n\t\t\tif (j >= mx)break;\n\t\t\tfor (int k = 0; k < 2; k++) {\n\t\t\t\t//if(isOn(ls[i],ls[j][k])){\n\t\t\t\tif (intersectSP_without_endpoint(ls[i], ls[j][k])) {\n\t\t\t\t\tls.push_back(Line(ls[i][0], ls[j][k]));\n\t\t\t\t\tls[i][0] = ls[j][k];\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t//else if(isOn(ls[j],ls[i][k])){\n\t\t\t\telse if (intersectSP_without_endpoint(ls[j], ls[i][k])) {\n\t\t\t\t\tls.push_back(Line(ls[j][0], ls[i][k]));\n\t\t\t\t\tls[j][0] = ls[i][k];\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t//cerr << \"split-1\" << endl;\n\t//線分が交差している場合の分割\n\tfor (int i = 0; i < (int)ls.size(); i++) {\n\t\tLine li = ls[i];\n\t\tint mx = ls.size();\n\t\tfor (int j = i + 1; j < (int)ls.size(); j++) {\n\t\t\tpoint cross_p;\n\t\t\tif (j >= mx)break;\n\t\t\tif (intersect(ls[i], ls[j], cross_p)) {\n\t\t\t\t//if (intersectSS_strict(ls[i], ls[j])) {\n\t\t\t\t//point cross_p = crosspoint(ls[i], ls[j]);\n\t\t\t\tls.push_back(Line(ls[i][0], cross_p));\n\t\t\t\tls[i][0] = cross_p;\n\t\t\t\tls.push_back(Line(ls[j][0], cross_p));\n\t\t\t\tls[j][0] = cross_p;\n\t\t\t}\n\t\t}\n\t}\n}\n\n//線分の集合(split済み)を連結成分に分解する(union-find)\n\nstruct Equiv {\n\tvector<int>links;\n\t//大きさ1の同値類をn個作る\n\tEquiv(int n) :links(n) {\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tlinks[i] = i;\n\t\t}\n\t}\n\t//xの属する同値類の代表元を返す\n\tint find(int x) {\n\t\tint xx = links[x];\n\t\tif (xx == x)return x;\n\t\treturn links[x] = find(xx);\n\t}\n\tvoid unify(int x, int y) {\n\t\tint xx = find(x), yy = find(y);\n\t\tif (xx <= yy)links[yy] = xx;\n\t\telse links[xx] = yy;\n\t}\n};\n\ntypedef vector<Lines>vLines;\nvLines connectedComponent(const Lines &ls) {\n\tvLines ret;\n\tEquiv equiv(ls.size());\n\tfor (int i = 0; i < (int)ls.size(); i++) {\n\t\tfor (int j = 0; j < i; j++) {\n\t\t\tif (connectSS_with_endpoint(ls[i], ls[j])) {\n\t\t\t\tequiv.unify(i, j);\n\t\t\t}\n\t\t}\n\t}\n\t//cerr << \"connected-1\" << endl;\n\tfor (int i = 0; i < (int)ls.size(); i++) {\n\t\tif (equiv.find(i) == i) {\n\t\t\tLines newLs;\n\t\t\tnewLs.push_back(ls[i]);\n\t\t\tfor (int j = i + 1; j < (int)ls.size(); j++) {\n\t\t\t\tif (equiv.find(j) == i)newLs.push_back(ls[j]);\n\t\t\t}\n\t\t\tret.push_back(newLs);\n\t\t}\n\t}\n\treturn ret;\n}\n//左手法でのトレース\n//偏角でソートされた隣接点のvectorを得る\ntypedef pair<double, point>doublePoint;\ntypedef vector<doublePoint> vDoublePoint;\ntypedef map<point, vDoublePoint> adjPoint;\ntypedef vector<point>points;\n//移動前の点と隣接点のリストから移動先を決定\npoint findNext(const vDoublePoint &vdp, const point &p) {\n\tfor (int i = 0; i < (int)vdp.size() - 1; i++) {\n\t\tif (p == vdp[i].second) {\n\t\t\treturn vdp[i + 1].second;\n\t\t}\n\t}\n\treturn vdp[0].second;\n}\n//左手法でトレースして通った点の列を返す\npoints trace(const Lines &ls) {\n\tadjPoint aPoint;\n\t//隣接点(偏角付き)のリストを作成\n\tfor (int i = 0; i < (int)ls.size(); i++) {\n\t\taPoint[ls[i][0]].push_back(doublePoint(arg(ls[i][1] - ls[i][0]), ls[i][1]));\n\t\taPoint[ls[i][1]].push_back(doublePoint(arg(ls[i][0] - ls[i][1]), ls[i][0]));\n\t}\n\t//x座標最小の点の計算と隣接点リストのソート\n\tpoint minPoint(INT_MAX, INT_MAX);\n\tadjPoint::iterator it;\n\tfor (it = aPoint.begin(); it != aPoint.end(); ++it) {\n\t\tpoint p = it->first;\n\t\tminPoint = min(minPoint, p);\n\t\tvDoublePoint &vdp = it->second;\n\t\tsort(vdp.begin(), vdp.end());\n\t}\n\tpoints ret;\n\tret.push_back(minPoint);\n\t//最初の移動先\n\tpoint curP = aPoint[minPoint][0].second;\n\tpoint lastP = minPoint;\n\t//トレースの繰り返し\n\twhile (curP != minPoint) {\n\t\tif (DEBUG)cerr << curP << endl;\n\t\tret.push_back(curP);\n\t\tpoint nextP = findNext(aPoint[curP], lastP);\n\t\t//if(isSamePoint(curP,nextP))break;\n\t\tlastP = curP;\n\t\tcurP = nextP;\n\t}\n\t//開始点を最後にも追加\n\tret.push_back(minPoint);\n\treturn ret;\n}\n\nbool isInside(const points &ps) {\n\tLine l0(point(0, 0), point(51.0, 1.0 / 20000.0));\n\tint count = 0;\n\tfor (int i = 0; i < (int)ps.size() - 1; i++) {\n\t\tpoint dummy;\n\t\tLine l1(ps[i], ps[i + 1]);\n\t\tif (intersect(l0, l1, dummy))count++;\n\t}\n\treturn (count & 1) == 1;\n}\n\n\n//円\nstruct Circle {\n\tpoint p; double r;\n\tCircle(const point &p_, double r_) : p(p_), r(r_) { }\n};\n\n//凸包\nvector<point> convex_hull(vector<point> ps) {\n\tint n = ps.size(), k = 0;\n\tsort(ps.begin(), ps.end());\n\tvector<point> ch(2 * n);\n\tfor (int i = 0; i < n; ch[k++] = ps[i++]) // lower-hull\n\t\twhile (k >= 2 && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\n\tfor (int i = n - 2, t = k + 1; i >= 0; ch[k++] = ps[i--]) // upper-hull\n\t\twhile (k >= t && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\n\tch.resize(k - 1);\n\treturn ch;\n}\n\n//2点を通る半径Rの円の中心\npair<point, point> get_circle_from_2points(point &p1, point &p2, double R) {\n\tdouble d = dist(p1, p2);\n\tdouble x1 = p1.real(), x2 = p2.real();\n\tdouble y1 = p1.imag(), y2 = p2.imag();\n\tif (p1.imag() == p2.imag()) {\n\t\tdouble x = (x1 + x2) / 2.0;\n\t\tdouble dy = sqrt(R - d * d / 4);\n\t\treturn { { x,y1 + dy },{ x,y1 - dy } };\n\t}\n\telse {\n\t\tdouble m = (x1 - x2) / (y2 - y1);\n\t\tdouble t = sqrt(R*R - d * d / 4);\n\t\tdouble dx = sqrt((t*t) / (m*m + 1));\n\t\tdouble dy = sqrt(t*t - dx * dx);\n\t\tdouble gx = (x1 + x2) / 2;\n\t\tdouble gy = (y1 + y2) / 2;\n\t\tif (m > EPS) {\n\t\t\treturn { { gx + dx,gy + dy },{ gx - dx,gy - dy } };\n\t\t}\n\t\telse {\n\t\t\treturn { { gx + dx,gy - dy },{ gx - dx,gy + dy } };\n\t\t}\n\t}\n}\n//長方形\nstruct Square {\n\tdouble lx, ly, rx, ry;\n\tSquare(double lx_, double ly_, double rx_, double ry_) :lx(lx_), ly(ly_), rx(rx_), ry(ry_) {};\n\tbool include(point &p) {\n\t\treturn p.real() + EPS >= lx && p.real() - EPS <= rx && p.imag() + EPS >= ly && p.imag() - EPS <= ry;\n\t}\n};\n\nstruct Polygon : public vector<point> {\n\t//0->OUT, 1->ON, 2->IN\n\tint contains(const point &p) {\n\t\tbool in = false;\n\t\tint N = this->size();\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tpoint a = this->at(i) - p;\n\t\t\tpoint b = this->at((i + 1) % N) - p;\n\t\t\tif (imag(a) > imag(b)) {\n\t\t\t\tstd::swap(a, b);\n\t\t\t}\n\t\t\tif (imag(a) <= 0 && 0 < imag(b))\n\t\t\t\tif (cross(a, b) < 0)in = !in;\n\t\t\tif (cross(a, b) == 0 && dot(a, b) <= 0)return 1;\n\t\t}\n\t\treturn in ? 2 : 0;\n\t}\n};\nclock_t START, END;\nbool trapAll() {\n\tint N; cin >> N;\n\tif (N == 0) {\n\t\tEND = clock();\n\t\tdouble t = (double)(END - START) / CLOCKS_PER_SEC;\n\t\t//cerr << \"elapsed time\" << t << \"[sec]\" << endl;\n\t\texit(0);\n\t}\n\tLines ls;\n\tREP(i, N) {\n\t\tdouble x1, y1, x2, y2;\n\t\tcin >> x1 >> y1 >> x2 >> y2;\n\t\tpoint p1(x1, y1);\n\t\tpoint p2(x2, y2);\n\t\tls.push_back(Line(p1, p2));\n\t}\n\tsplitSegments(ls);\n\t// for(auto l:ls){\n\t// \tcerr<<l[0]<<\" \"<<l[1]<<endl;\n\t// }\n\t//cerr << \"splitted\" << endl;\n\tvLines vls = connectedComponent(ls);\n\tfor (auto lines : vls) {\n\t\tif(isInside(trace(lines)))return true;\n\t\t// Polygon poly;\n\t\t// points ps = trace(lines);\n\t\t// for (auto p : ps) {\n\t\t// \tpoly.push_back(p);\n\t\t// }\n\t\t// if (poly.contains(point(0, 0)))return true;\n\t}\n\treturn false;\n}\n\nvoid solve() {\n\tif (trapAll())cout << \"yes\" << endl;\n\telse cout << \"no\" << endl;\n\tif (DEBUG)cerr << \"+++++++++++++\" << endl;\n}\nsigned main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tSTART = clock();\n\twhile (true)\n\t\tsolve();\n\n}","accuracy":1,"time_ms":5130,"memory_kb":6292,"score_of_the_acc":-1.1079,"final_rank":13},{"submission_id":"aoj_1247_4320282","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n#pragma GCC optimize(\"unroll-loops\")\n#include\"bits/stdc++.h\"\n\nusing namespace std;\n\n#define REP(i,n) for(int i=0;i<(n);i++)\n#define FOR(i,m,n) for(int i=(m);i<(n);i++)\n\nconst bool DEBUG = false;\n\nconst double EPS = 1e-8;\ntypedef complex<double> point;\nistream &operator>>(istream &is, point &p) {\n double a, b;\n is >> a >> b;\n p = point(a, b);\n return is;\n}\npoint operator*(const point&p, const double &d) {\n\treturn point(real(p)*d, imag(p)*d);\n}\nnamespace std {\n\tbool operator < (const point& a, const point& b) {\n\t\treturn real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n\t}\n}\n\n//直線or線分\nstruct Line : public vector<point> {\n\tLine(const point &a, const point &b) {\n\t\tpush_back(a); push_back(b);\n\t}\n};\ntypedef vector<Line>Lines;\n\n\ndouble cross(const point& a, const point& b) {\n return real(a)*imag(b)-imag(a)*real(b);\n}\ndouble dot(const point& a, const point& b) {\n return real(a)*real(b)+imag(a)*imag(b);\n}\nint ccw(point a, point b, point c) {\n\tb =b-a; c =c - a;\n\tif (cross(b, c) > EPS) return +1; // counter clockwise\n\tif (cross(b, c) < -EPS) return -1; // clockwise\n\tif (dot(b, c) < -EPS) return +2; // c--a--b on line\n\tif (norm(b) < norm(c)) return -2; // a--b--c on line\n\treturn 0;\n}\n//交差判定\nbool intersectLL(const Line &l1, const Line &l2) {\n\treturn abs(cross(l1[1] - l1[0], l2[1] - l2[0])) > EPS || //non-parallel\n\t\tabs(cross(l1[1] - l1[0], l2[0] - l1[0])) < EPS; //same line\n}\nbool intersectLS(const Line &l, const Line &s) {\n\treturn cross(l[1] - l[0], s[0] - l[0])* // s[0] is left of l\n\t\tcross(l[1] - l[0], s[1] - l[0]) < EPS; // s[1] is right of l\n}\nbool intersectLP(const Line &l, const point &p) {\n\treturn abs(cross(l[1] - p, l[0] - p)) < EPS;\n}\n//端点に乗ってたらfalse\nbool intersectSP_without_endpoint(const Line &s, const point &p) {\n\tif (abs(s[0] - p) < EPS || abs(s[1] - p) < EPS)return false;\n\treturn abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < EPS; //triangle inequality\n}\n\nbool intersectSP(const Line &s, const point &p) { //verified on 2020/04/03 https://onlinejudge.u-aizu.ac.jp/status/users/Mojumbo/submissions/1/1157/judge/4316978/C++14\n\treturn abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < EPS; //triangle inequality\n}\nbool connectSS(const Line &s, const Line &t) {\n\tif (intersectSP(s, t[0]) || intersectSP(s, t[1]) || intersectSP(t, s[0]) || intersectSP(t, s[1]))return true;\n\telse return false;\n}\nbool isSamePoint(const point &p1,const point &p2){\n\treturn abs(p1-p2)<EPS;\n}\nbool connectSS_with_endpoint(const Line &s,const Line &t){\n\tREP(i,2)REP(j,2){\n\t\t//if(isSamePoint(s[i],t[j]))return true;\n\t\tif(s[i]==t[j])return true;\n\t}\n\treturn false;\n}\nbool intersectSS(const Line &s, const Line &t) {\n\treturn ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1]) <= 0 &&\n\t\tccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1]) <= 0;\n}\nbool intersectSS_strict(const Line &s, const Line &t) {\n\t//端点が線分上に乗っている場合はfalseにする\n\tif (connectSS(s, t))return false;\n\treturn ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1]) <= 0 &&\n\t\tccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1]) <= 0;\n}\n\nbool isOn(const Line &l,const point &p){\n\tif(l[0]==p||l[1]==p)return false;\n\tpoint d=l[1]-l[0];\n\tpoint p0=(p-l[0])/d;\n\treturn p0.imag()==0.0&&0.0<p0.real()&&p0.real()<1.0;\n}\nbool intersect(const Line &l0,const Line &l1, point &p){\n\tif(connectSS_with_endpoint(l0,l1)||isOn(l0,l1[0])||isOn(l0,l1[1])||isOn(l1,l0[0])||isOn(l1,l0[1]))return false;\n\tpoint d = l0[1]-l0[0];\n\tpoint p0=(l1[0]-l0[0])/d;\n\tpoint p1=(l1[1]-l0[0])/d;\n\tif(p0.imag()*p1.imag()>=0)return false;\n\tdouble t=p0.imag()/(p0.imag()-p1.imag());\n\tdouble s=p0.real()*(1-t)+p1.real()*t;\n\tif(s<=0.0||1.0<=s)return false;\n\tp=l0[0]+d*s;\n\treturn true;\n}\n\n//距離,交点\n//射影 直線lにpから下した垂線との交点\n\npoint projection(const Line &l, const point &p) { //verified on 2020/04/03 https://onlinejudge.u-aizu.ac.jp/status/users/Mojumbo/submissions/1/1157/judge/4316978/C++14\n\tdouble t = dot(p - l[0], l[0] - l[1]) / norm(l[0] - l[1]);\n\treturn l[0] + (l[0] - l[1])*t;\n}\n//射影 直線lを対象軸としてpと線対称にある点\npoint reflection(const Line &l, const point &p) {\n\treturn p + (projection(l, p) - p) * 2;\n}\ndouble distancePP(const point& a, const point& b) {\n\treturn sqrt(norm(a - b));\n}\ndouble distanceLP(const Line &l, const point &p) {\n\treturn abs(p - projection(l, p));\n}\ndouble distanceLL(const Line&l, const Line &m) {\n\treturn intersectLL(l, m) ? 0 : distanceLP(l, m[0]);\n}\ndouble distanceLS(const Line &l, const Line &s) {\n\tif (intersectLS(l, s))return 0;\n\treturn min(distanceLP(l, s[0]), distanceLP(l, s[1]));\n}\ndouble distanceSP(const Line &s, const point &p) {\n\tconst point r = projection(s, p);\n\tif (intersectSP(s, r))return abs(r - p);\n\treturn min(abs(s[0] - p), abs(s[1] - p));\n}\ndouble distanceSS(const Line &s, const Line &t) { //verified on 2020/04/03 https://onlinejudge.u-aizu.ac.jp/status/users/Mojumbo/submissions/1/1157/judge/4316978/C++14\n\tif (intersectSS(s, t))return 0;\n\treturn min({ distanceSP(s,t[0]),distanceSP(s,t[1]),distanceSP(t,s[0]),distanceSP(t,s[1]) });\n}\npoint crosspoint(const Line &l, const Line &m) {\n\tdouble A = cross(l[1] - l[0], m[1] - m[0]);\n\tdouble B = cross(l[1] - l[0], l[1] - m[0]);\n\tif (abs(A) < EPS&&abs(B) < EPS)return m[0];//same line\n\tif (abs(A) < EPS)assert(false); // Precondition not satisfied\n\treturn m[0] + B / A * (m[1] - m[0]);\n}\ndouble dist(point &p1, point &p2) {\n\treturn abs(p1 - p2);\n}\n\n//線分同士の交点で分割して端点以外の共有点を持たないようにする\nvoid splitSegments(Lines &ls) {\n\t//端点が線分上に乗っている場合の分割\n\tfor (size_t i = 0; i < ls.size(); i++)for (size_t j = i + 1; j < ls.size(); j++) {\n\t\tfor (int k = 0; k < 2; k++) {\n\t\t\t//if(isOn(ls[i],ls[j][k])){\n\t\t\tif (intersectSP_without_endpoint(ls[i], ls[j][k])) {\n\t\t\t\tls.push_back(Line(ls[i][0], ls[j][k]));\n\t\t\t\tls[i][0] = ls[j][k];\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t//else if(isOn(ls[j],ls[i][k])){\n\t\t\telse if (intersectSP_without_endpoint(ls[j], ls[i][k])) {\n\t\t\t\tls.push_back(Line(ls[j][0], ls[i][k]));\n\t\t\t\tls[j][0] = ls[i][k];\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\t//cerr << \"split-1\" << endl;\n\t//線分が交差している場合の分割\n\tfor (size_t i = 0; i < ls.size(); i++) {\n\t\tLine li = ls[i];\n\t\tfor (size_t j = i + 1; j < ls.size(); j++) {\n\t\t\tpoint cross_p;\n\t\t\tif(intersect(ls[i],ls[j],cross_p)){\n\t\t\t//if (intersectSS_strict(ls[i], ls[j])) {\n\t\t\t\t//point cross_p = crosspoint(ls[i], ls[j]);\n\t\t\t\tls.push_back(Line(ls[i][0], cross_p));\n\t\t\t\tls[i][0] = cross_p;\n\t\t\t\tls.push_back(Line(ls[j][0], cross_p));\n\t\t\t\tls[j][0] = cross_p;\n\t\t\t}\n\t\t}\n\t}\n}\n\n//線分の集合(split済み)を連結成分に分解する(union-find)\n\nstruct Equiv {\n\tvector<int>links;\n\t//大きさ1の同値類をn個作る\n\tEquiv(int n):links(n){\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tlinks[i] = i;\n\t\t}\n\t}\n\t//xの属する同値類の代表元を返す\n\tint find(int x) {\n\t\tint xx = links[x];\n\t\tif (xx == x)return x;\n\t\treturn links[x] = find(xx);\n\t}\n\tvoid unify(int x, int y) {\n\t\tint xx = find(x), yy = find(y);\n\t\tif (xx <= yy)links[yy] = xx;\n\t\telse links[xx] = yy;\n\t}\n};\n\ntypedef vector<Lines>vLines;\nvLines connectedComponent(const Lines &ls) {\n\tvLines ret;\n\tEquiv equiv(ls.size());\n\tfor (int i = 0; i < (int)ls.size(); i++) {\n\t\tfor (int j = 0; j < i; j++) {\n\t\t\tif (connectSS_with_endpoint(ls[i], ls[j])) {\n\t\t\t\tequiv.unify(i, j);\n\t\t\t}\n\t\t}\n\t}\n\t//cerr << \"connected-1\" << endl;\n\tfor (int i = 0; i < (int)ls.size(); i++) {\n\t\tif (equiv.find(i) == i) {\n\t\t\tLines newLs;\n\t\t\tnewLs.push_back(ls[i]);\n\t\t\tfor (int j = i + 1; j < (int)ls.size(); j++) {\n\t\t\t\tif (equiv.find(j) == i)newLs.push_back(ls[j]);\n\t\t\t}\n\t\t\tret.push_back(newLs);\n\t\t}\n\t}\n\treturn ret;\n}\n//左手法でのトレース\n//偏角でソートされた隣接点のvectorを得る\ntypedef pair<double, point>doublePoint;\ntypedef vector<doublePoint> vDoublePoint;\ntypedef map<point, vDoublePoint> adjPoint;\ntypedef vector<point>points;\n//移動前の点と隣接点のリストから移動先を決定\npoint findNext(const vDoublePoint &vdp, const point &p) {\n\tfor (int i = 0; i < (int)vdp.size() - 1; i++) {\n\t\tif (p == vdp[i].second) {\n\t\t\treturn vdp[i + 1].second;\n\t\t}\n\t}\n\treturn vdp[0].second;\n}\n//左手法でトレースして通った点の列を返す\npoints trace(const Lines &ls) {\n\tadjPoint aPoint;\n\t//隣接点(偏角付き)のリストを作成\n\tfor (int i = 0; i < (int)ls.size(); i++) {\n\t\taPoint[ls[i][0]].push_back(doublePoint(arg(ls[i][1] - ls[i][0]), ls[i][1]));\n\t\taPoint[ls[i][1]].push_back(doublePoint(arg(ls[i][0] - ls[i][1]), ls[i][0]));\n\t}\n\t//x座標最小の点の計算と隣接点リストのソート\n\tpoint minPoint(INT_MAX, INT_MAX);\n\tadjPoint::iterator it;\n\tfor (it = aPoint.begin(); it != aPoint.end(); ++it) {\n\t\tpoint p = it->first;\n\t\tminPoint = min(minPoint, p);\n\t\tvDoublePoint &vdp = it->second;\n\t\tsort(vdp.begin(), vdp.end());\n\t}\n\tpoints ret;\n\tret.push_back(minPoint);\n\t//最初の移動先\n\tpoint curP = aPoint[minPoint][0].second;\n\tpoint lastP = minPoint;\n\t//トレースの繰り返し\n\twhile (curP != minPoint) {\n\t\tif(DEBUG)cerr<<curP<<endl;\n\t\tret.push_back(curP);\n\t\tpoint nextP = findNext(aPoint[curP], lastP);\n\t\t//if(isSamePoint(curP,nextP))break;\n\t\tlastP = curP;\n\t\tcurP = nextP;\n\t}\n\t//開始点を最後にも追加\n\tret.push_back(minPoint);\n\treturn ret;\n}\n\nbool isInside(const points &ps) {\n\tLine l0(point(0, 0), point(51.0, 1.0 / 20000.0));\n\tint count = 0;\n\tfor (int i = 0; i < (int)ps.size() - 1; i++) {\n\t\tpoint dummy;\n\t\tLine l1(ps[i], ps[i + 1]);\n\t\tif (intersect(l0, l1,dummy))count++;\n\t}\n\treturn (count & 1) == 1;\n}\n\n\n//円\nstruct Circle {\n\tpoint p; double r;\n\tCircle(const point &p_, double r_) : p(p_), r(r_) { }\n};\n\n//凸包\nvector<point> convex_hull(vector<point> ps) {\n\tint n = ps.size(), k = 0;\n\tsort(ps.begin(), ps.end());\n\tvector<point> ch(2 * n);\n\tfor (int i = 0; i < n; ch[k++] = ps[i++]) // lower-hull\n\t\twhile (k >= 2 && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\n\tfor (int i = n - 2, t = k + 1; i >= 0; ch[k++] = ps[i--]) // upper-hull\n\t\twhile (k >= t && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\n\tch.resize(k - 1);\n\treturn ch;\n}\n\n//2点を通る半径Rの円の中心\npair<point, point> get_circle_from_2points(point &p1, point &p2, double R) {\n\tdouble d = dist(p1, p2);\n\tdouble x1 = p1.real(), x2 = p2.real();\n\tdouble y1 = p1.imag(), y2 = p2.imag();\n\tif (p1.imag() == p2.imag()) {\n\t\tdouble x = (x1 + x2) / 2.0;\n\t\tdouble dy = sqrt(R - d * d / 4);\n\t\treturn { { x,y1 + dy },{ x,y1 - dy } };\n\t}\n\telse {\n\t\tdouble m = (x1 - x2) / (y2 - y1);\n\t\tdouble t = sqrt(R*R - d * d / 4);\n\t\tdouble dx = sqrt((t*t) / (m*m + 1));\n\t\tdouble dy = sqrt(t*t - dx * dx);\n\t\tdouble gx = (x1 + x2) / 2;\n\t\tdouble gy = (y1 + y2) / 2;\n\t\tif (m > EPS) {\n\t\t\treturn { { gx + dx,gy + dy },{ gx - dx,gy - dy } };\n\t\t}\n\t\telse {\n\t\t\treturn { { gx + dx,gy - dy },{ gx - dx,gy + dy } };\n\t\t}\n\t}\n}\n//長方形\nstruct Square {\n\tdouble lx, ly, rx, ry;\n\tSquare(double lx_, double ly_, double rx_, double ry_) :lx(lx_), ly(ly_), rx(rx_), ry(ry_) {};\n\tbool include(point &p) {\n\t\treturn p.real() + EPS >= lx && p.real() - EPS <= rx && p.imag() + EPS >= ly && p.imag() - EPS <= ry;\n\t}\n};\n\nstruct Polygon : public vector<point> {\n\t//0->OUT, 1->ON, 2->IN\n\tint contains(const point &p) {\n\t\tbool in = false;\n\t\tint N = this->size();\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tpoint a = this->at(i) - p;\n\t\t\tpoint b = this->at((i + 1) % N) - p;\n\t\t\tif (imag(a) > imag(b)) {\n\t\t\t\tstd::swap(a, b);\n\t\t\t}\n\t\t\tif (imag(a) <= 0 && 0 < imag(b))\n\t\t\t\tif (cross(a, b) < 0)in = !in;\n\t\t\tif (cross(a, b) == 0 && dot(a, b) <= 0)return 1;\n\t\t}\n\t\treturn in ? 2 : 0;\n\t}\n};\nclock_t START,END;\nbool trapAll() {\n\tint N; cin >> N;\n\tif (N == 0){\n\t\tEND=clock();\n\t\tdouble t=(double)(END-START)/CLOCKS_PER_SEC;\n\t\tif(DEBUG)cerr<<\"elapsed time\"<<t<<\"[sec]\"<<endl;\n\t\texit(0);\n\t}\n\tLines ls;\n\tREP(i, N) {\n\t\tdouble x1, y1, x2, y2;\n\t\tcin >> x1 >> y1 >> x2 >> y2;\n\t\tpoint p1(x1, y1);\n\t\tpoint p2(x2, y2);\n\t\tls.push_back(Line(p1, p2));\n\t}\n\tsplitSegments(ls);\n\t// for(auto l:ls){\n\t// \tcerr<<l[0]<<\" \"<<l[1]<<endl;\n\t// }\n\t//cerr << \"splitted\" << endl;\n\tvLines vls = connectedComponent(ls);\n\tfor (auto lines : vls) {\n\t\tPolygon poly;\n\t\tpoints ps= trace(lines);\n\t\tfor (auto p : ps) {\n\t\t\tpoly.push_back(p);\n\t\t}\n\t\tif (poly.contains(point(0, 0)))return true;\n\t}\n\treturn false;\n}\n\nvoid solve() {\n\tif (trapAll())cout << \"yes\" << endl;\n\telse cout << \"no\" << endl;\n\tif(DEBUG)cerr<<\"+++++++++++++\"<<endl;\n}\nsigned main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tSTART = clock();\n\twhile (true)\n\t\tsolve();\n\n}","accuracy":1,"time_ms":5140,"memory_kb":6448,"score_of_the_acc":-1.1269,"final_rank":14},{"submission_id":"aoj_1247_4320281","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n#pragma GCC optimize(\"unroll-loops\")\n#include\"bits/stdc++.h\"\n\nusing namespace std;\n\n#define REP(i,n) for(int i=0;i<(n);i++)\n#define FOR(i,m,n) for(int i=(m);i<(n);i++)\n\nconst bool DEBUG = false;\n\nconst double EPS = 1e-8;\ntypedef complex<double> point;\nistream &operator>>(istream &is, point &p) {\n double a, b;\n is >> a >> b;\n p = point(a, b);\n return is;\n}\npoint operator*(const point&p, const double &d) {\n\treturn point(real(p)*d, imag(p)*d);\n}\nnamespace std {\n\tbool operator < (const point& a, const point& b) {\n\t\treturn real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n\t}\n}\n\n//直線or線分\nstruct Line : public vector<point> {\n\tLine(const point &a, const point &b) {\n\t\tpush_back(a); push_back(b);\n\t}\n};\ntypedef vector<Line>Lines;\n\n\ndouble cross(const point& a, const point& b) {\n return real(a)*imag(b)-imag(a)*real(b);\n}\ndouble dot(const point& a, const point& b) {\n return real(a)*real(b)+imag(a)*imag(b);\n}\nint ccw(point a, point b, point c) {\n\tb =b-a; c =c - a;\n\tif (cross(b, c) > EPS) return +1; // counter clockwise\n\tif (cross(b, c) < -EPS) return -1; // clockwise\n\tif (dot(b, c) < -EPS) return +2; // c--a--b on line\n\tif (norm(b) < norm(c)) return -2; // a--b--c on line\n\treturn 0;\n}\n//交差判定\nbool intersectLL(const Line &l1, const Line &l2) {\n\treturn abs(cross(l1[1] - l1[0], l2[1] - l2[0])) > EPS || //non-parallel\n\t\tabs(cross(l1[1] - l1[0], l2[0] - l1[0])) < EPS; //same line\n}\nbool intersectLS(const Line &l, const Line &s) {\n\treturn cross(l[1] - l[0], s[0] - l[0])* // s[0] is left of l\n\t\tcross(l[1] - l[0], s[1] - l[0]) < EPS; // s[1] is right of l\n}\nbool intersectLP(const Line &l, const point &p) {\n\treturn abs(cross(l[1] - p, l[0] - p)) < EPS;\n}\n//端点に乗ってたらfalse\nbool intersectSP_without_endpoint(const Line &s, const point &p) {\n\tif (abs(s[0] - p) < EPS || abs(s[1] - p) < EPS)return false;\n\treturn abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < EPS; //triangle inequality\n}\n\nbool intersectSP(const Line &s, const point &p) { //verified on 2020/04/03 https://onlinejudge.u-aizu.ac.jp/status/users/Mojumbo/submissions/1/1157/judge/4316978/C++14\n\treturn abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < EPS; //triangle inequality\n}\nbool connectSS(const Line &s, const Line &t) {\n\tif (intersectSP(s, t[0]) || intersectSP(s, t[1]) || intersectSP(t, s[0]) || intersectSP(t, s[1]))return true;\n\telse return false;\n}\nbool isSamePoint(const point &p1,const point &p2){\n\treturn abs(p1-p2)<EPS;\n}\nbool connectSS_with_endpoint(const Line &s,const Line &t){\n\tREP(i,2)REP(j,2){\n\t\t//if(isSamePoint(s[i],t[j]))return true;\n\t\tif(s[i]==t[j])return true;\n\t}\n\treturn false;\n}\nbool intersectSS(const Line &s, const Line &t) {\n\treturn ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1]) <= 0 &&\n\t\tccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1]) <= 0;\n}\nbool intersectSS_strict(const Line &s, const Line &t) {\n\t//端点が線分上に乗っている場合はfalseにする\n\tif (connectSS(s, t))return false;\n\treturn ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1]) <= 0 &&\n\t\tccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1]) <= 0;\n}\n\nbool isOn(const Line &l,const point &p){\n\tif(l[0]==p||l[1]==p)return false;\n\tpoint d=l[1]-l[0];\n\tpoint p0=(p-l[0])/d;\n\treturn p0.imag()==0.0&&0.0<p0.real()&&p0.real()<1.0;\n}\nbool intersect(const Line &l0,const Line &l1, point &p){\n\tif(connectSS_with_endpoint(l0,l1)||isOn(l0,l1[0])||isOn(l0,l1[1])||isOn(l1,l0[0])||isOn(l1,l0[1]))return false;\n\tpoint d = l0[1]-l0[0];\n\tpoint p0=(l1[0]-l0[0])/d;\n\tpoint p1=(l1[1]-l0[0])/d;\n\tif(p0.imag()*p1.imag()>=0)return false;\n\tdouble t=p0.imag()/(p0.imag()-p1.imag());\n\tdouble s=p0.real()*(1-t)+p1.real()*t;\n\tif(s<=0.0||1.0<=s)return false;\n\tp=l0[0]+d*s;\n\treturn true;\n}\n\n//距離,交点\n//射影 直線lにpから下した垂線との交点\n\npoint projection(const Line &l, const point &p) { //verified on 2020/04/03 https://onlinejudge.u-aizu.ac.jp/status/users/Mojumbo/submissions/1/1157/judge/4316978/C++14\n\tdouble t = dot(p - l[0], l[0] - l[1]) / norm(l[0] - l[1]);\n\treturn l[0] + (l[0] - l[1])*t;\n}\n//射影 直線lを対象軸としてpと線対称にある点\npoint reflection(const Line &l, const point &p) {\n\treturn p + (projection(l, p) - p) * 2;\n}\ndouble distancePP(const point& a, const point& b) {\n\treturn sqrt(norm(a - b));\n}\ndouble distanceLP(const Line &l, const point &p) {\n\treturn abs(p - projection(l, p));\n}\ndouble distanceLL(const Line&l, const Line &m) {\n\treturn intersectLL(l, m) ? 0 : distanceLP(l, m[0]);\n}\ndouble distanceLS(const Line &l, const Line &s) {\n\tif (intersectLS(l, s))return 0;\n\treturn min(distanceLP(l, s[0]), distanceLP(l, s[1]));\n}\ndouble distanceSP(const Line &s, const point &p) {\n\tconst point r = projection(s, p);\n\tif (intersectSP(s, r))return abs(r - p);\n\treturn min(abs(s[0] - p), abs(s[1] - p));\n}\ndouble distanceSS(const Line &s, const Line &t) { //verified on 2020/04/03 https://onlinejudge.u-aizu.ac.jp/status/users/Mojumbo/submissions/1/1157/judge/4316978/C++14\n\tif (intersectSS(s, t))return 0;\n\treturn min({ distanceSP(s,t[0]),distanceSP(s,t[1]),distanceSP(t,s[0]),distanceSP(t,s[1]) });\n}\npoint crosspoint(const Line &l, const Line &m) {\n\tdouble A = cross(l[1] - l[0], m[1] - m[0]);\n\tdouble B = cross(l[1] - l[0], l[1] - m[0]);\n\tif (abs(A) < EPS&&abs(B) < EPS)return m[0];//same line\n\tif (abs(A) < EPS)assert(false); // Precondition not satisfied\n\treturn m[0] + B / A * (m[1] - m[0]);\n}\ndouble dist(point &p1, point &p2) {\n\treturn abs(p1 - p2);\n}\n\n//線分同士の交点で分割して端点以外の共有点を持たないようにする\nvoid splitSegments(Lines &ls) {\n\t//端点が線分上に乗っている場合の分割\n\tfor (size_t i = 0; i < ls.size(); i++)for (size_t j = i + 1; j < ls.size(); j++) {\n\t\tfor (int k = 0; k < 2; k++) {\n\t\t\tif(isOn(ls[i],ls[j][k])){\n\t\t\t//if (intersectSP_without_endpoint(ls[i], ls[j][k])) {\n\t\t\t\tls.push_back(Line(ls[i][0], ls[j][k]));\n\t\t\t\tls[i][0] = ls[j][k];\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse if(isOn(ls[j],ls[i][k])){\n\t\t\t//else if (intersectSP_without_endpoint(ls[j], ls[i][k])) {\n\t\t\t\tls.push_back(Line(ls[j][0], ls[i][k]));\n\t\t\t\tls[j][0] = ls[i][k];\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\t//cerr << \"split-1\" << endl;\n\t//線分が交差している場合の分割\n\tfor (size_t i = 0; i < ls.size(); i++) {\n\t\tLine li = ls[i];\n\t\tfor (size_t j = i + 1; j < ls.size(); j++) {\n\t\t\tpoint cross_p;\n\t\t\tif(intersect(ls[i],ls[j],cross_p)){\n\t\t\t//if (intersectSS_strict(ls[i], ls[j])) {\n\t\t\t\t//point cross_p = crosspoint(ls[i], ls[j]);\n\t\t\t\tls.push_back(Line(ls[i][0], cross_p));\n\t\t\t\tls[i][0] = cross_p;\n\t\t\t\tls.push_back(Line(ls[j][0], cross_p));\n\t\t\t\tls[j][0] = cross_p;\n\t\t\t}\n\t\t}\n\t}\n}\n\n//線分の集合(split済み)を連結成分に分解する(union-find)\n\nstruct Equiv {\n\tvector<int>links;\n\t//大きさ1の同値類をn個作る\n\tEquiv(int n):links(n){\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tlinks[i] = i;\n\t\t}\n\t}\n\t//xの属する同値類の代表元を返す\n\tint find(int x) {\n\t\tint xx = links[x];\n\t\tif (xx == x)return x;\n\t\treturn links[x] = find(xx);\n\t}\n\tvoid unify(int x, int y) {\n\t\tint xx = find(x), yy = find(y);\n\t\tif (xx <= yy)links[yy] = xx;\n\t\telse links[xx] = yy;\n\t}\n};\n\ntypedef vector<Lines>vLines;\nvLines connectedComponent(const Lines &ls) {\n\tvLines ret;\n\tEquiv equiv(ls.size());\n\tfor (int i = 0; i < (int)ls.size(); i++) {\n\t\tfor (int j = 0; j < i; j++) {\n\t\t\tif (connectSS_with_endpoint(ls[i], ls[j])) {\n\t\t\t\tequiv.unify(i, j);\n\t\t\t}\n\t\t}\n\t}\n\t//cerr << \"connected-1\" << endl;\n\tfor (int i = 0; i < (int)ls.size(); i++) {\n\t\tif (equiv.find(i) == i) {\n\t\t\tLines newLs;\n\t\t\tnewLs.push_back(ls[i]);\n\t\t\tfor (int j = i + 1; j < (int)ls.size(); j++) {\n\t\t\t\tif (equiv.find(j) == i)newLs.push_back(ls[j]);\n\t\t\t}\n\t\t\tret.push_back(newLs);\n\t\t}\n\t}\n\treturn ret;\n}\n//左手法でのトレース\n//偏角でソートされた隣接点のvectorを得る\ntypedef pair<double, point>doublePoint;\ntypedef vector<doublePoint> vDoublePoint;\ntypedef map<point, vDoublePoint> adjPoint;\ntypedef vector<point>points;\n//移動前の点と隣接点のリストから移動先を決定\npoint findNext(const vDoublePoint &vdp, const point &p) {\n\tfor (int i = 0; i < (int)vdp.size() - 1; i++) {\n\t\tif (p == vdp[i].second) {\n\t\t\treturn vdp[i + 1].second;\n\t\t}\n\t}\n\treturn vdp[0].second;\n}\n//左手法でトレースして通った点の列を返す\npoints trace(const Lines &ls) {\n\tadjPoint aPoint;\n\t//隣接点(偏角付き)のリストを作成\n\tfor (int i = 0; i < (int)ls.size(); i++) {\n\t\taPoint[ls[i][0]].push_back(doublePoint(arg(ls[i][1] - ls[i][0]), ls[i][1]));\n\t\taPoint[ls[i][1]].push_back(doublePoint(arg(ls[i][0] - ls[i][1]), ls[i][0]));\n\t}\n\t//x座標最小の点の計算と隣接点リストのソート\n\tpoint minPoint(INT_MAX, INT_MAX);\n\tadjPoint::iterator it;\n\tfor (it = aPoint.begin(); it != aPoint.end(); ++it) {\n\t\tpoint p = it->first;\n\t\tminPoint = min(minPoint, p);\n\t\tvDoublePoint &vdp = it->second;\n\t\tsort(vdp.begin(), vdp.end());\n\t}\n\tpoints ret;\n\tret.push_back(minPoint);\n\t//最初の移動先\n\tpoint curP = aPoint[minPoint][0].second;\n\tpoint lastP = minPoint;\n\t//トレースの繰り返し\n\twhile (curP != minPoint) {\n\t\tif(DEBUG)cerr<<curP<<endl;\n\t\tret.push_back(curP);\n\t\tpoint nextP = findNext(aPoint[curP], lastP);\n\t\t//if(isSamePoint(curP,nextP))break;\n\t\tlastP = curP;\n\t\tcurP = nextP;\n\t}\n\t//開始点を最後にも追加\n\tret.push_back(minPoint);\n\treturn ret;\n}\n\nbool isInside(const points &ps) {\n\tLine l0(point(0, 0), point(51.0, 1.0 / 20000.0));\n\tint count = 0;\n\tfor (int i = 0; i < (int)ps.size() - 1; i++) {\n\t\tpoint dummy;\n\t\tLine l1(ps[i], ps[i + 1]);\n\t\tif (intersect(l0, l1,dummy))count++;\n\t}\n\treturn (count & 1) == 1;\n}\n\n\n//円\nstruct Circle {\n\tpoint p; double r;\n\tCircle(const point &p_, double r_) : p(p_), r(r_) { }\n};\n\n//凸包\nvector<point> convex_hull(vector<point> ps) {\n\tint n = ps.size(), k = 0;\n\tsort(ps.begin(), ps.end());\n\tvector<point> ch(2 * n);\n\tfor (int i = 0; i < n; ch[k++] = ps[i++]) // lower-hull\n\t\twhile (k >= 2 && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\n\tfor (int i = n - 2, t = k + 1; i >= 0; ch[k++] = ps[i--]) // upper-hull\n\t\twhile (k >= t && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\n\tch.resize(k - 1);\n\treturn ch;\n}\n\n//2点を通る半径Rの円の中心\npair<point, point> get_circle_from_2points(point &p1, point &p2, double R) {\n\tdouble d = dist(p1, p2);\n\tdouble x1 = p1.real(), x2 = p2.real();\n\tdouble y1 = p1.imag(), y2 = p2.imag();\n\tif (p1.imag() == p2.imag()) {\n\t\tdouble x = (x1 + x2) / 2.0;\n\t\tdouble dy = sqrt(R - d * d / 4);\n\t\treturn { { x,y1 + dy },{ x,y1 - dy } };\n\t}\n\telse {\n\t\tdouble m = (x1 - x2) / (y2 - y1);\n\t\tdouble t = sqrt(R*R - d * d / 4);\n\t\tdouble dx = sqrt((t*t) / (m*m + 1));\n\t\tdouble dy = sqrt(t*t - dx * dx);\n\t\tdouble gx = (x1 + x2) / 2;\n\t\tdouble gy = (y1 + y2) / 2;\n\t\tif (m > EPS) {\n\t\t\treturn { { gx + dx,gy + dy },{ gx - dx,gy - dy } };\n\t\t}\n\t\telse {\n\t\t\treturn { { gx + dx,gy - dy },{ gx - dx,gy + dy } };\n\t\t}\n\t}\n}\n//長方形\nstruct Square {\n\tdouble lx, ly, rx, ry;\n\tSquare(double lx_, double ly_, double rx_, double ry_) :lx(lx_), ly(ly_), rx(rx_), ry(ry_) {};\n\tbool include(point &p) {\n\t\treturn p.real() + EPS >= lx && p.real() - EPS <= rx && p.imag() + EPS >= ly && p.imag() - EPS <= ry;\n\t}\n};\n\nstruct Polygon : public vector<point> {\n\t//0->OUT, 1->ON, 2->IN\n\tint contains(const point &p) {\n\t\tbool in = false;\n\t\tint N = this->size();\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tpoint a = this->at(i) - p;\n\t\t\tpoint b = this->at((i + 1) % N) - p;\n\t\t\tif (imag(a) > imag(b)) {\n\t\t\t\tstd::swap(a, b);\n\t\t\t}\n\t\t\tif (imag(a) <= 0 && 0 < imag(b))\n\t\t\t\tif (cross(a, b) < 0)in = !in;\n\t\t\tif (cross(a, b) == 0 && dot(a, b) <= 0)return 1;\n\t\t}\n\t\treturn in ? 2 : 0;\n\t}\n};\nclock_t START,END;\nbool trapAll() {\n\tint N; cin >> N;\n\tif (N == 0){\n\t\tEND=clock();\n\t\tdouble t=(double)(END-START)/CLOCKS_PER_SEC;\n\t\t//cerr<<\"elapsed time\"<<t<<\"[sec]\"<<endl;\n\t\texit(0);\n\t}\n\tLines ls;\n\tREP(i, N) {\n\t\tdouble x1, y1, x2, y2;\n\t\tcin >> x1 >> y1 >> x2 >> y2;\n\t\tpoint p1(x1, y1);\n\t\tpoint p2(x2, y2);\n\t\tls.push_back(Line(p1, p2));\n\t}\n\tsplitSegments(ls);\n\t// for(auto l:ls){\n\t// \tcerr<<l[0]<<\" \"<<l[1]<<endl;\n\t// }\n\t//cerr << \"splitted\" << endl;\n\tvLines vls = connectedComponent(ls);\n\tfor (auto lines : vls) {\n\t\tPolygon poly;\n\t\tpoints ps= trace(lines);\n\t\tfor (auto p : ps) {\n\t\t\tpoly.push_back(p);\n\t\t}\n\t\tif (poly.contains(point(0, 0)))return true;\n\t}\n\treturn false;\n}\n\nvoid solve() {\n\tif (trapAll())cout << \"yes\" << endl;\n\telse cout << \"no\" << endl;\n\tif(DEBUG)cerr<<\"+++++++++++++\"<<endl;\n}\nsigned main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tSTART = clock();\n\twhile (true)\n\t\tsolve();\n\n}","accuracy":1,"time_ms":5150,"memory_kb":6436,"score_of_the_acc":-1.1271,"final_rank":15},{"submission_id":"aoj_1247_4320251","code_snippet":"#include\"bits/stdc++.h\"\n\nusing namespace std;\n\n#define REP(i,n) for(int i=0;i<(n);i++)\n#define FOR(i,m,n) for(int i=(m);i<(n);i++)\n\nconst double EPS = 1e-8;\ntypedef complex<double> point;\npoint operator*(const point&p, const double &d) {\n\treturn point(real(p)*d, imag(p)*d);\n}\nnamespace std {\n\tbool operator < (const point& a, const point& b) {\n\t\treturn real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n\t}\n\n\t//istream &operator>>(istream &stream, point &p) {\n\t//\tstream >> p.real >> p.imag;\n\t//\treturn stream;\n\t//}\n}\n//bool intersectLL(const Line &l1, const Line &l2);\n//bool intersectLS(const Line &l, const Line &s);\n//bool intersectLP(const Line &l, const point &p);\n//bool intersectSS(const Line &s, const Line &t);\n//bool intersectSP(const Line &s, const point &p);\n\n//直線or線分\nstruct Line : public vector<point> {\n\tLine(const point &a, const point &b) {\n\t\tpush_back(a); push_back(b);\n\t}\n};\ntypedef vector<Line>Lines;\n\n\n//外積\ndouble cross(const point& a, const point& b) {\n\treturn imag(conj(a)*b);\n}\n//内積\ndouble dot(const point& a, const point& b) {\n\treturn real(conj(a)*b);\n}\nint ccw(point a, point b, point c) {\n\tb -= a; c -= a;\n\tif (cross(b, c) > 0) return +1; // counter clockwise\n\tif (cross(b, c) < 0) return -1; // clockwise\n\tif (dot(b, c) < 0) return +2; // c--a--b on line\n\tif (norm(b) < norm(c)) return -2; // a--b--c on line\n\treturn 0;\n}\n//交差判定\nbool intersectLL(const Line &l1, const Line &l2) {\n\treturn abs(cross(l1[1] - l1[0], l2[1] - l2[0])) > EPS || //non-parallel\n\t\tabs(cross(l1[1] - l1[0], l2[0] - l1[0])) < EPS; //same line\n}\nbool intersectLS(const Line &l, const Line &s) {\n\treturn cross(l[1] - l[0], s[0] - l[0])* // s[0] is left of l\n\t\tcross(l[1] - l[0], s[1] - l[0]) < EPS; // s[1] is right of l\n}\nbool intersectLP(const Line &l, const point &p) {\n\treturn abs(cross(l[1] - p, l[0] - p)) < EPS;\n}\n//端点に乗ってたらfalse\nbool intersectSP_without_endpoint(const Line &s, const point &p) {\n\tif (abs(s[0] - p) < EPS || abs(s[1] - p) < EPS)return false;\n\treturn abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < EPS; //triangle inequality\n}\n\nbool intersectSP(const Line &s, const point &p) { //verified on 2020/04/03 https://onlinejudge.u-aizu.ac.jp/status/users/Mojumbo/submissions/1/1157/judge/4316978/C++14\n\treturn abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < EPS; //triangle inequality\n}\nbool connectSS(const Line &s, const Line &t) {\n\tif (intersectSP(s, t[0]) || intersectSP(s, t[1]) || intersectSP(t, s[0]) || intersectSP(t, s[1]))return true;\n\telse return false;\n}\nbool isSamePoint(const point &p1,const point &p2){\n\treturn abs(p1-p2)<EPS;\n}\nbool connectSS_with_endpoint(const Line &s,const Line &t){\n\tREP(i,2)REP(j,2){\n\t\t//if(isSamePoint(s[i],t[j]))return true;\n\t\tif(s[i]==t[j])return true;\n\t}\n\treturn false;\n}\nbool intersectSS(const Line &s, const Line &t) {\n\t//端点が線分上に乗っている場合はfalseにする\n\tif (connectSS(s, t))return false;\n\treturn ccw(s[0], s[1], t[0])*ccw(s[0], s[1], t[1]) <= 0 &&\n\t\tccw(t[0], t[1], s[0])*ccw(t[0], t[1], s[1]) <= 0;\n}\n\nbool isOn(const Line &l,const point &p){\n\tif(l[0]==p||l[1]==p)return false;\n\tpoint d=l[1]-l[0];\n\tpoint p0=(p-l[0])/d;\n\treturn p0.imag()==0.0&&0.0<p0.real()&&p0.real()<1.0;\n}\nbool intersect(const Line &l0,const Line &l1, point &p){\n\tif(connectSS_with_endpoint(l0,l1)||isOn(l0,l1[0])||isOn(l0,l1[1])||isOn(l1,l0[0])||isOn(l1,l0[1]))return false;\n\tpoint d = l0[1]-l0[0];\n\tpoint p0=(l1[0]-l0[0])/d;\n\tpoint p1=(l1[1]-l0[0])/d;\n\tif(p0.imag()*p1.imag()>=0)return false;\n\tdouble t=p0.imag()/(p0.imag()-p1.imag());\n\tdouble s=p0.real()*(1-t)+p1.real()*t;\n\tif(s<=0.0||1.0<=s)return false;\n\tp=l0[0]+d*s;\n\treturn true;\n}\n\n//距離,交点\n//射影 直線lにpから下した垂線との交点\n\npoint projection(const Line &l, const point &p) { //verified on 2020/04/03 https://onlinejudge.u-aizu.ac.jp/status/users/Mojumbo/submissions/1/1157/judge/4316978/C++14\n\tdouble t = dot(p - l[0], l[0] - l[1]) / norm(l[0] - l[1]);\n\treturn l[0] + (l[0] - l[1])*t;\n}\n//射影 直線lを対象軸としてpと線対称にある点\npoint reflection(const Line &l, const point &p) {\n\treturn p + (projection(l, p) - p) * 2;\n}\ndouble distancePP(const point& a, const point& b) {\n\treturn sqrt(norm(a - b));\n}\ndouble distanceLP(const Line &l, const point &p) {\n\treturn abs(p - projection(l, p));\n}\ndouble distanceLL(const Line&l, const Line &m) {\n\treturn intersectLL(l, m) ? 0 : distanceLP(l, m[0]);\n}\ndouble distanceLS(const Line &l, const Line &s) {\n\tif (intersectLS(l, s))return 0;\n\treturn min(distanceLP(l, s[0]), distanceLP(l, s[1]));\n}\ndouble distanceSP(const Line &s, const point &p) {\n\tconst point r = projection(s, p);\n\tif (intersectSP(s, r))return abs(r - p);\n\treturn min(abs(s[0] - p), abs(s[1] - p));\n}\ndouble distanceSS(const Line &s, const Line &t) { //verified on 2020/04/03 https://onlinejudge.u-aizu.ac.jp/status/users/Mojumbo/submissions/1/1157/judge/4316978/C++14\n\tif (intersectSS(s, t))return 0;\n\treturn min({ distanceSP(s,t[0]),distanceSP(s,t[1]),distanceSP(t,s[0]),distanceSP(t,s[1]) });\n}\npoint crosspoint(const Line &l, const Line &m) {\n\tdouble A = cross(l[1] - l[0], m[1] - m[0]);\n\tdouble B = cross(l[1] - l[0], l[1] - m[0]);\n\tif (abs(A) < EPS&&abs(B) < EPS)return m[0];//same line\n\tif (abs(A) < EPS)assert(false); // Precondition not satisfied\n\treturn m[0] + B / A * (m[1] - m[0]);\n}\ndouble dist(point &p1, point &p2) {\n\treturn abs(p1 - p2);\n}\n\n//線分同士の交点で分割して端点以外の共有点を持たないようにする\nvoid splitSegments(Lines &ls) {\n\t//端点が線分上に乗っている場合の分割\n\tfor (size_t i = 0; i < ls.size(); i++)for (size_t j = i + 1; j < ls.size(); j++) {\n\t\tfor (int k = 0; k < 2; k++) {\n\t\t\tif(isOn(ls[i],ls[j][k])){\n\t\t\t//if (intersectSP_without_endpoint(ls[i], ls[j][k])) {\n\t\t\t\tls.push_back(Line(ls[i][0], ls[j][k]));\n\t\t\t\tls[i][0] = ls[j][k];\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse if(isOn(ls[j],ls[i][k])){\n\t\t\t//else if (intersectSP_without_endpoint(ls[j], ls[i][k])) {\n\t\t\t\tls.push_back(Line(ls[j][0], ls[i][k]));\n\t\t\t\tls[j][0] = ls[i][k];\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\t//cerr << \"split-1\" << endl;\n\t//線分が交差している場合の分割\n\tfor (size_t i = 0; i < ls.size(); i++) {\n\t\tLine li = ls[i];\n\t\tfor (size_t j = i + 1; j < ls.size(); j++) {\n\t\t\tpoint cross_p;\n\t\t\tif(intersect(ls[i],ls[j],cross_p)){\n\t\t\t//if (intersectSS(ls[i], ls[j])) {\n\t\t\t\t//point cross_p = crosspoint(ls[i], ls[j]);\n\t\t\t\tls.push_back(Line(ls[i][0], cross_p));\n\t\t\t\tls[i][0] = cross_p;\n\t\t\t\tls.push_back(Line(ls[j][0], cross_p));\n\t\t\t\tls[j][0] = cross_p;\n\t\t\t}\n\t\t}\n\t}\n}\n\n//線分の集合(split済み)を連結成分に分解する(union-find)\nstruct Equiv {\n\tvector<int>links;\n\t//大きさ1の同値類をn個作る\n\tEquiv(int n) :links(n) {\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tlinks[i] = i;\n\t\t}\n\t}\n\t//xの属する同値類の代表元を返す\n\tint find(int x) {\n\t\tint xx = links[x];\n\t\tif (xx == x)return x;\n\t\treturn links[x] = find(xx);\n\t}\n\tvoid unify(int x, int y) {\n\t\tint xx = find(x), yy = find(y);\n\t\tif (xx <= yy)links[yy] = xx;\n\t\telse links[xx] = yy;\n\t}\n};\n\ntypedef vector<Lines>vLines;\nvLines connectedComponent(const Lines &ls) {\n\tvLines ret;\n\tEquiv equiv(ls.size());\n\tfor (int i = 0; i < (int)ls.size(); i++) {\n\t\tfor (int j = 0; j < i; j++) {\n\t\t\tif (connectSS_with_endpoint(ls[i], ls[j])) {\n\t\t\t\tequiv.unify(i, j);\n\t\t\t}\n\t\t}\n\t}\n\t//cerr << \"connected-1\" << endl;\n\tfor (int i = 0; i < (int)ls.size(); i++) {\n\t\tif (equiv.find(i) == i) {\n\t\t\tLines newLs;\n\t\t\tnewLs.push_back(ls[i]);\n\t\t\tfor (int j = i + 1; j < (int)ls.size(); j++) {\n\t\t\t\tif (equiv.find(j) == i)newLs.push_back(ls[j]);\n\t\t\t}\n\t\t\tret.push_back(newLs);\n\t\t}\n\t}\n\treturn ret;\n}\n//左手法でのトレース\n//偏角でソートされた隣接点のvectorを得る\ntypedef pair<double, point>doublePoint;\ntypedef vector<doublePoint> vDoublePoint;\ntypedef map<point, vDoublePoint> adjPoint;\ntypedef vector<point>points;\n//移動前の点と隣接点のリストから移動先を決定\npoint findNext(const vDoublePoint &vdp, const point &p) {\n\tfor (int i = 0; i < (int)vdp.size() - 1; i++) {\n\t\tif (p == vdp[i].second) {\n\t\t\treturn vdp[i + 1].second;\n\t\t}\n\t}\n\treturn vdp[0].second;\n}\n//左手法でトレースして通った点の列を返す\npoints trace(const Lines &ls) {\n\tadjPoint aPoint;\n\t//隣接点(偏角付き)のリストを作成\n\tfor (int i = 0; i < (int)ls.size(); i++) {\n\t\taPoint[ls[i][0]].push_back(doublePoint(arg(ls[i][1] - ls[i][0]), ls[i][1]));\n\t\taPoint[ls[i][1]].push_back(doublePoint(arg(ls[i][0] - ls[i][1]), ls[i][0]));\n\t}\n\t//x座標最小の点の計算と隣接点リストのソート\n\tpoint minPoint(INT_MAX, INT_MAX);\n\tadjPoint::iterator it;\n\tfor (it = aPoint.begin(); it != aPoint.end(); ++it) {\n\t\tpoint p = it->first;\n\t\tminPoint = min(minPoint, p);\n\t\tvDoublePoint &vdp = it->second;\n\t\tsort(vdp.begin(), vdp.end());\n\t}\n\tpoints ret;\n\tret.push_back(minPoint);\n\t//最初の移動先\n\tpoint curP = aPoint[minPoint][0].second;\n\tpoint lastP = minPoint;\n\t//トレースの繰り返し\n\tint cnt =0;\n\twhile (curP != minPoint) {\n\t\t//cerr<<curP<<endl;\n\t\tcnt++;\n\t\tassert(cnt<1000000);\n\t\tret.push_back(curP);\n\t\tpoint nextP = findNext(aPoint[curP], lastP);\n\t\t//if(isSamePoint(curP,nextP))break;\n\t\tlastP = curP;\n\t\tcurP = nextP;\n\t}\n\t//開始点を最後にも追加\n\tret.push_back(minPoint);\n\treturn ret;\n}\n\nbool isInside(const points &ps) {\n\tLine l0(point(0, 0), point(51.0, 1.0 / 20000.0));\n\tint count = 0;\n\tfor (int i = 0; i < (int)ps.size() - 1; i++) {\n\t\tpoint dummy;\n\t\tLine l1(ps[i], ps[i + 1]);\n\t\tif (intersect(l0, l1,dummy))count++;\n\t}\n\treturn (count & 1) == 1;\n}\n\n\n//円\nstruct Circle {\n\tpoint p; double r;\n\tCircle(const point &p_, double r_) : p(p_), r(r_) { }\n};\n\n//凸包\nvector<point> convex_hull(vector<point> ps) {\n\tint n = ps.size(), k = 0;\n\tsort(ps.begin(), ps.end());\n\tvector<point> ch(2 * n);\n\tfor (int i = 0; i < n; ch[k++] = ps[i++]) // lower-hull\n\t\twhile (k >= 2 && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\n\tfor (int i = n - 2, t = k + 1; i >= 0; ch[k++] = ps[i--]) // upper-hull\n\t\twhile (k >= t && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\n\tch.resize(k - 1);\n\treturn ch;\n}\n\n//2点を通る半径Rの円の中心\npair<point, point> get_circle_from_2points(point &p1, point &p2, double R) {\n\tdouble d = dist(p1, p2);\n\tdouble x1 = p1.real(), x2 = p2.real();\n\tdouble y1 = p1.imag(), y2 = p2.imag();\n\tif (p1.imag() == p2.imag()) {\n\t\tdouble x = (x1 + x2) / 2.0;\n\t\tdouble dy = sqrt(R - d * d / 4);\n\t\treturn { { x,y1 + dy },{ x,y1 - dy } };\n\t}\n\telse {\n\t\tdouble m = (x1 - x2) / (y2 - y1);\n\t\tdouble t = sqrt(R*R - d * d / 4);\n\t\tdouble dx = sqrt((t*t) / (m*m + 1));\n\t\tdouble dy = sqrt(t*t - dx * dx);\n\t\tdouble gx = (x1 + x2) / 2;\n\t\tdouble gy = (y1 + y2) / 2;\n\t\tif (m > EPS) {\n\t\t\treturn { { gx + dx,gy + dy },{ gx - dx,gy - dy } };\n\t\t}\n\t\telse {\n\t\t\treturn { { gx + dx,gy - dy },{ gx - dx,gy + dy } };\n\t\t}\n\t}\n}\n//長方形\nstruct Square {\n\tdouble lx, ly, rx, ry;\n\tSquare(double lx_, double ly_, double rx_, double ry_) :lx(lx_), ly(ly_), rx(rx_), ry(ry_) {};\n\tbool include(point &p) {\n\t\treturn p.real() + EPS >= lx && p.real() - EPS <= rx && p.imag() + EPS >= ly && p.imag() - EPS <= ry;\n\t}\n};\n\nstruct Polygon : public vector<point> {\n\t//0->OUT, 1->ON, 2->IN\n\tint contains(const point &p) {\n\t\tbool in = false;\n\t\tint N = this->size();\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tpoint a = this->at(i) - p;\n\t\t\tpoint b = this->at((i + 1) % N) - p;\n\t\t\tif (imag(a) > imag(b)) {\n\t\t\t\tstd::swap(a, b);\n\t\t\t}\n\t\t\tif (imag(a) <= 0 && 0 < imag(b))\n\t\t\t\tif (cross(a, b) < 0)in = !in;\n\t\t\tif (cross(a, b) == 0 && dot(a, b) <= 0)return 1;\n\t\t}\n\t\treturn in ? 2 : 0;\n\t}\n};\n\nbool trapAll() {\n\tint N; cin >> N;\n\tif (N == 0)exit(0);\n\tLines ls;\n\tREP(i, N) {\n\t\tdouble x1, y1, x2, y2;\n\t\tcin >> x1 >> y1 >> x2 >> y2;\n\t\tpoint p1(x1, y1);\n\t\tpoint p2(x2, y2);\n\t\tls.push_back(Line(p1, p2));\n\t}\n\tsplitSegments(ls);\n\t// for(auto l:ls){\n\t// \tcerr<<l[0]<<\" \"<<l[1]<<endl;\n\t// }\n\t//cerr << \"splitted\" << endl;\n\tvLines vls = connectedComponent(ls);\n\tfor (auto lines : vls) {\n\t\tPolygon poly;\n\t\tpoints ps= trace(lines);\n\t\tfor (auto p : ps) {\n\t\t\tpoly.push_back(p);\n\t\t}\n\t\tif (poly.contains(point(0, 0)))return true;\n\t}\n\treturn false;\n}\nvoid solve() {\n\tif (trapAll())cout << \"yes\" << endl;\n\telse cout << \"no\" << endl;\n\t//cerr<<\"+++++++++++++\"<<endl;\n}\nsigned main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\twhile (true)\n\t\tsolve();\n}","accuracy":1,"time_ms":5390,"memory_kb":6372,"score_of_the_acc":-1.1565,"final_rank":16},{"submission_id":"aoj_1247_3352563","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <algorithm>\n#include <cmath>\n#include <queue>\n#include <vector>\n#include <utility>\n#include <set>\n//#define LOCAL\n#define maxv 205\n#define maxn 105\n#define EPS 1e-10\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> P;\nstruct Point{\n\tdouble x,y;\n\tPoint(double x = 0.0,double y = 0.0): x(x),y(y) {}\n\tPoint operator + (Point p){\n\t\treturn Point(x + p.x,y + p.y);\n\t}\n\tPoint operator - (Point p){\n\t\treturn Point(x - p.x,y - p.y);\n\t}\n\tPoint operator * (double lambda){\n\t\treturn Point(x * lambda,y * lambda);\n\t}\n\tPoint operator / (double lambda){\n\t\treturn Point(x / lambda,y / lambda);\n\t}\n\tdouble norm(){\n\t\treturn x * x + y * y;\n\t}\n\tdouble abs_(){\n\t\treturn sqrt(norm());\n\t}\n\tdouble pol(){\n\t\treturn atan2(y,x);\n\t}\n\tbool operator == (const Point &p)const\n\t{\n\t\treturn abs(x - p.x) < EPS && abs(y - p.y) < EPS;\n\t}\n\tbool operator < (const Point &p)const\n\t{\n\t\tif(abs(x - p.x) < EPS) return y < p.y;\n\t\telse return x < p.x;\n\t}\n};\ntypedef Point Vector;\nstruct Segment{\n\tPoint p1,p2;\n\tSegment(Point p1 = Point(),Point p2 = Point()): p1(p1),p2(p2) {}\n};\nPoint front(Segment s){\n\tVector a = s.p2 - s.p1;\n\ta = a / a.abs_() * 5e-4;\n\treturn s.p2 + a;\n}\nPoint back(Segment s){\n\tVector a = s.p2 - s.p1;\n\ta = a / a.abs_() * 5e-4;\n\treturn s.p1 - a;\n}\ntypedef Segment Line;\ntypedef vector<Point> Polygon;\ndouble dot(Vector a,Vector b){ return a.x * b.x + a.y * b.y; }\ndouble det(Vector a,Vector b){ return a.x * b.y - a.y * b.x; }\nvector <int> adj[maxv];\nPoint p[maxv]; int pk;\nSegment s[maxn]; int n;\nint ccw(Point p,Segment l){\n\tif(det(l.p2 - l.p1,p - l.p1) > EPS) return 1;\n\tif(det(l.p2 - l.p1,p - l.p1) < -EPS) return -1;\n\tif(dot(l.p2 - l.p1,p - l.p1) < -EPS) return 2;\n\tif((l.p2 - l.p1).norm() < (p - l.p1).norm()) return -2;\n\treturn 0;\n}\nbool cross(Segment s1,Segment s2){\n\treturn ccw(s1.p1,s2) * ccw(s1.p2,s2) <= 0 && ccw(s2.p1,s1) * ccw(s2.p2,s1) <= 0;\n}\nbool check(Point p1,Point p2){\n\tfor(int i=1;i<=n;i++){\n\t\tif(cross(Segment(p1,p2),s[i])) return false;\n\t}\n\treturn true;\n}\nbool vis[maxv];\nvoid dfs(int u){\n\tvis[u] = true;\n\tfor(int i=0;i<(int)adj[u].size();i++){\n\t\tint v = adj[u][i];\n\t\tif(!vis[v]) dfs(v);\n\t}\n}\nint main(){\n\t#ifdef LOCAL\n\tfreopen(\"sample.in\",\"r\",stdin);\n\tfreopen(\"sample.out\",\"w\",stdout);\n\t#endif\n\twhile(~scanf(\"%d\",&n) && n){\n\t\tfor(int i=1;i<=n;i++) scanf(\"%lf%lf%lf%lf\",&s[i].p1.x,&s[i].p1.y,&s[i].p2.x,&s[i].p2.y);\n\t\tpk = 0;\n\t\tp[++pk] = Point(0,0);\n\t\tp[++pk] = Point(100,100);\n\t\tfor(int i=1;i<=n;i++){\n\t\t\tp[++pk] = front(s[i]);\n\t\t\tp[++pk] = back(s[i]);\n\t\t}\n\t\tfor(int i=1;i<=pk;i++) adj[i].clear();\n\t\tfor(int i=1;i<=pk;i++){\n\t\t\tfor(int j=i+1;j<=pk;j++){\n\t\t\t\tif(check(p[i],p[j])){\n\t\t\t\t\tadj[i].push_back(j);\n\t\t\t\t\tadj[j].push_back(i);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tmemset(vis,0,sizeof(vis));\n\t\tdfs(1);\n\t\tif(vis[2]) puts(\"no\");\n\t\telse puts(\"yes\");\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3388,"score_of_the_acc":-0.0078,"final_rank":2},{"submission_id":"aoj_1247_3213715","code_snippet":"#include <iostream>\n#include <complex>\n#include <vector>\n#include <utility>\n#include <algorithm>\nusing namespace std;\nusing P = complex<double>;\nusing L = pair<P,P>;\n#define X real()\n#define Y imag()\nconst double EPS = 1e-6, INF = 1e12;\n\ndouble dot(P &a, P &b){ return a.X*b.X + a.Y*b.Y;}\ndouble cross(P &a, P &b){ return a.X*b.Y - a.Y*b.X;}\n\nint ccw(P a, P b, P c){\n b -= a, c -= a;\n if(cross(b,c) > EPS) return 1;\n if(cross(b,c) < -EPS) return -1;\n if(dot(b,c) < EPS) return 2;\n if(norm(b) - EPS < norm(c)) return -2;\n return 0;\n}\n\nbool is_cross(L a, L b){\n P af = a.first, as = a.second, bf = b.first, bs = b.second;\n return (ccw(af,as,bs)*ccw(af,as,bf) <= 0) and (ccw(bf,bs,af)*ccw(bf,bs,as) <= 0);\n}\n\nint main(){\n int n;\n while(cin >> n, n){\n vector<L> Lines;\n for(int i = 0; i < n; ++i){\n double x, y, z, w;\n cin >> x >> y >> z >> w;\n x *= 200;\n y *= 200;\n z *= 200;\n w *= 200;\n Lines.emplace_back(P(x,y),P(z,w));\n }\n for(int i = 0; i < n; ++i){\n P d = Lines[i].second - Lines[i].first;\n d /= abs(d);\n Lines[i].second += d;\n Lines[i].first -= d;\n }\n vector< vector<int> > Adj(2*n+2, vector<int>(2*n+2,true));\n int M = 2*n + 2;\n vector<P> Points(M);\n for(int i = 0; i < n; ++i){\n Points[2*i] = Lines[i].first;\n Points[2*i+1] = Lines[i].second;\n }\n Points[2*n] = P(0,0);\n Points[2*n+1] = P(200000,200000);\n for(int i = 0; i < M; ++i){\n for(int j = 0; j < i; ++j){\n if(i == j) continue;\n if(i < 2*n and i%2 == 0 and (j-i) == 1) continue;\n for(int k = 0; k < n; ++k){\n if(is_cross(L(Points[i],Points[j]),Lines[k])){\n Adj[i][j] = false;\n Adj[j][i] = false;\n break;\n }\n }\n }\n }\n for(int k = 0; k < M; ++k){\n for(int i = 0; i < M; ++i)\n for(int j = 0; j < M; ++j)\n Adj[i][j] |= Adj[i][k]&Adj[k][j];\n }\n if(Adj[M-1][M-2]) cout << \"no\" << endl;\n else cout << \"yes\" << endl;\n }\n}","accuracy":1,"time_ms":60,"memory_kb":3332,"score_of_the_acc":-0.0046,"final_rank":1},{"submission_id":"aoj_1247_3213671","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <complex>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <array>\n#include <map>\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};\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\nbool intersectSS(const L& a, const L& b){\n return ( ccw(a[0],a[1],b[0]) *ccw(a[0],a[1],b[1]) <= 0 ) &&\n ( ccw(b[0],b[1],a[0]) *ccw(b[0],b[1],a[1]) <= 0 );\n}\nbool intersectSP(const L& s, const P &p){\n return abs(cross(s[0]-p, s[1]-p))<EPS && dot(s[0]-p, s[1]-p)<EPS;\n}\n\nbool isParallel(const P &a, const P &b){\n return abs(cross(a,b)) < EPS;\n}\nbool isParallel(const L &a, const L &b){\n return isParallel(a[1]-a[0], b[1]-b[0]);\n}\n\nP crosspointLL(const L &l, const L &m) {\n double A = cross(l[1]-l[0], m[1]-m[0]);\n double B = cross(l[1]-l[0], l[1]-m[0]);\n return m[0] + B/A *(m[1]-m[0]);\n}\n\ndouble getarea(const VP &poly){\n double ret = 0;\n for (int i=0; i<(int)poly.size(); i++){ \n ret += cross(poly[i], poly[(i+1)%poly.size()]);\n }\n return ret*0.5;\n}\n\nint in_poly(const P &p, const VP &poly){\n int n = poly.size();\n int ret = -1;\n for(int i=0; i<n; i++){\n P a = poly[i]-p;\n P b = poly[(i+1)%n]-p;\n if(a.Y > b.Y) swap(a,b);\n if(intersectSP(L(a,b), P(0,0))) return 0;\n if(a.Y<=0 && b.Y>0 && cross(a,b)<0) ret = -ret;\n }\n return ret;\n}\n\nint leftmostpoint(int &pidx, int &cidx, vector<int> &vec, VP &plist){\n P ptoc = plist[cidx] -plist[pidx];\n int nextidx = -1;\n double maxangle = -INF;\n for(int i=0; i<(int)vec.size(); i++){\n P cton = plist[vec[i]] -plist[cidx];\n double angle;\n if(abs(cross(ptoc, cton)) < EPS && dot(ptoc, cton) <EPS){\n angle = -PI;\n }else{\n angle = arg(cton/ ptoc);\n }\n if(angle > maxangle){\n maxangle = angle;\n nextidx = i;\n }\n }\n pidx = cidx;\n cidx = vec[nextidx];\n return nextidx;\n}\n\nvector<vector<int> > makeDualGraph(vector<vector<int> > &adj, VP &plist, vector<VP> &vlist){\n map<pair<int,int>, int> edgelist;\n vector<vector<int> > poly;\n vector<vector<bool> > used(adj.size());\n for(int i=0; i<(int)adj.size(); i++){\n used[i] = vector<bool>(adj[i].size(), false);\n }\n vlist = vector<VP>();\n \n int numarea=0;\n for(int i=0; i<(int)adj.size(); i++){\n for(int j=0; j<(int)adj[i].size(); j++){\n if(used[i][j]) continue;\n used[i][j] = true;\n vlist.push_back(VP());\n vector<int> border;\n border.push_back(i);\n vlist[numarea].push_back(plist[i]);\n int prev = i;\n int curr = adj[i][j];\n while(curr!=i){\n border.push_back(curr);\n vlist[numarea].push_back(plist[curr]);\n int idx = leftmostpoint(prev, curr, adj[curr], plist);\n used[prev][idx] = true;\n }\n poly.push_back(border);\n numarea++;\n }\n }\n \n vector<vector<int> > dual(numarea);\n for(int i=0; i<numarea; i++){\n for(int j=0; j<(int)poly[i].size(); j++){\n int a = poly[i][j];\n int b = poly[i][(j+1)%(int)poly[i].size()];\n pair<int,int> key = make_pair(min(a,b), max(a,b));\n if(edgelist.count(key) == 0){\n edgelist[key] = i;\n }else{\n dual[i].push_back(edgelist[key]);\n dual[edgelist[key]].push_back(i);\n }\n }\n }\n \n for(int i=0; i<(int)dual.size(); i++){\n sort(dual[i].begin(), dual[i].end());\n dual[i].erase(unique(dual[i].begin(), dual[i].end()), dual[i].end());\n }\n return dual;\n}\n\npair<vector<vector<int> >, VP> arrangement(const vector<L> &l){\n vector<VP> cp(l.size());\n VP plist;\n for(int i=0; i<(int)l.size(); i++){\n for(int j=i+1; j<(int)l.size(); j++){\n if(!isParallel(l[i], l[j]) && intersectSS(l[i], l[j])){\n P cpij = crosspointLL(l[i], l[j]);\n cp[i].push_back(cpij);\n cp[j].push_back(cpij);\n plist.push_back(cpij);\n }\n }\n cp[i].push_back(l[i][0]);\n cp[i].push_back(l[i][1]);\n plist.push_back(l[i][0]);\n plist.push_back(l[i][1]);\n sort(cp[i].begin(), cp[i].end());\n cp[i].erase(unique(cp[i].begin(), cp[i].end()), cp[i].end());\n }\n sort(plist.begin(), plist.end());\n plist.erase(unique(plist.begin(), plist.end()), plist.end());\n\n int n = plist.size();\n map<P, int> conv;\n for(int i=0; i<n; i++){\n conv[plist[i]] = i;\n }\n vector<vector<int> > adj(n);\n for(int i=0; i<(int)cp.size(); i++){\n for(int j=0; j<(int)cp[i].size()-1; j++){\n int jidx = conv[cp[i][j]];\n int jp1idx = conv[cp[i][j+1]];\n adj[jidx].push_back(jp1idx);\n adj[jp1idx].push_back(jidx);\n }\n }\n for(int i=0; i<n; i++){\n sort(adj[i].begin(), adj[i].end());\n adj[i].erase(unique(adj[i].begin(), adj[i].end()), adj[i].end());\n }\n return make_pair(adj, plist);\n}\n\nint main(){\n while(1){\n int n;\n cin >> n;\n if(n == 0) break;\n\n vector<L> l(n);\n for(int i=0; i<n; i++){\n double xs,ys,xt,yt;\n cin >> xs >> ys >> xt >> yt;\n l[i] = L(P(xs, ys), P(xt, yt));\n }\n\n auto ret = arrangement(l);\n auto &adj = ret.first;\n VP &plist = ret.second;\n vector<VP> vlist;\n makeDualGraph(adj, plist, vlist);\n bool ok = false;\n for(const VP &poly: vlist){\n if(getarea(poly) < EPS) continue;\n if(in_poly(P(0, 0), poly) == 1){\n ok = true;\n break;\n }\n }\n if(ok){\n cout << \"yes\" << endl;\n }else{\n cout << \"no\" << endl;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":5872,"score_of_the_acc":-0.2836,"final_rank":3}],"string":"[\n {\n \"submission_id\": \"aoj_1247_8388160\",\n \"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 //オーバーフローに注意\\n#define MOD 998244353\\n//#define MOD 1000000007\\n#define EPS 0.000000001\\n\\n\\n\\n#define SIZE 30005\\n\\n\\nstruct Point{\\n\\tPoint(double arg_x,double arg_y){\\n\\t\\tx = arg_x;\\n\\t\\ty = arg_y;\\n\\t}\\n\\n\\tPoint(){\\n\\t\\tx = y = 0.0;\\n\\t}\\n\\n\\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\\n\\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\\n\\tPoint operator * (double a){ return Point(a*x,a*y); }\\n\\tPoint operator / (double a){ return Point(x/a,y/a); }\\n\\n\\tdouble abs(){ return sqrt(norm()); }\\n\\tdouble norm(){ return x*x + y*y; }\\n\\n\\tbool operator<(const Point &p) const{\\n\\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\\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\\n\\nint N;\\nLine line[SIZE];\\nPoint point[SIZE];\\nvector<Point> V[SIZE];\\nvector<int> G[SIZE],ON_SEG[SIZE],CONTAIN[SIZE],EDGES;\\nset<int> SET;\\nPolygon POL;\\nbool CATCH,DEL[SIZE],visited[SIZE];\\nmap<pair<int,int>,int> MAP;\\nint numE = 0,numDEG[SIZE];\\nmap<int,pair<int,int>> REV;\\n\\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\\n\\n//交点を求める関数\\nPoint calc_Cross_Point(double x1,double x2,double x3,double x4,double y1,double y2,double y3,double y4){\\n\\tPoint ret;\\n\\tret.x = ((x2-x1)*(y3*(x4-x3)+x3*(y3-y4))-(x4-x3)*(y1*(x2-x1)+x1*(y1-y2)))/((y2-y1)*(x4-x3)-(y4-y3)*(x2-x1));\\n\\tif(fabs(x1-x2) > EPS){\\n\\t\\tret.y = ((y2-y1)*ret.x+y1*(x2-x1)+x1*(y1-y2))/(x2-x1);\\n\\t}else{\\n\\t\\tret.y = ((y4-y3)*ret.x+y3*(x4-x3)+x3*(y3-y4))/(x4-x3);\\n\\t}\\n\\treturn ret;\\n}\\n\\n//インタフェース関数\\nPoint calc_Cross_Point(Point a,Point b,Point c,Point d){\\n\\treturn calc_Cross_Point(a.x,b.x,c.x,d.x,a.y,b.y,c.y,d.y);\\n}\\n\\nPoint calc_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\\ndouble calc_len(Vector a){\\n return sqrt(a.x*a.x+a.y*a.y);\\n}\\n\\n\\n//線分ではなく直線と点の距離\\ndouble getDistanceLP(Line l,Point p){\\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\\n}\\n\\n//点と線分の距離\\ndouble getDistanceSP(Line l,Point p){\\n\\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\\n\\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\\n\\treturn getDistanceLP(l,p);\\n}\\n\\n//線分と線分の距離\\ndouble getDistance(Line A,Line B){\\n\\tif(is_Cross(A,B))return 0.0;\\n\\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\\n\\t\\t\\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\\n}\\n\\nPoint calc_Cross_Point(Line A,Line B){\\n\\n\\tif(getDistanceSP(B,A.p[0]) < EPS){\\n\\n\\t\\treturn A.p[0];\\n\\n\\t}else if(getDistanceSP(B,A.p[1]) < EPS){\\n\\n\\t\\treturn A.p[1];\\n\\n\\t}else if(getDistanceSP(A,B.p[0]) < EPS){\\n\\n\\t\\treturn B.p[0];\\n\\n\\t}else if(getDistanceSP(A,B.p[1]) < EPS){\\n\\n\\t\\treturn B.p[1];\\n\\t}\\n\\n\\treturn calc_Cross_Point(A.p[0],A.p[1],B.p[0],B.p[1]);\\n}\\n\\n/*\\n * IN 2\\n * ON 1\\n * OUT 0\\n *\\n */\\nint contains(Polygon g,Point p){\\n\\tint n = g.size();\\n\\tbool x = false;\\n\\tfor(int i = 0; i < n; i++){\\n\\t\\tPoint a = g[i]-p,b = g[(i+1)%n]-p;\\n\\t\\tif(abs(cross(a,b)) < EPS && dot(a,b) < EPS)return 1;\\n\\t\\tif(a.y > b.y)swap(a,b);\\n\\t\\tif(a.y < EPS && EPS < b.y && cross(a,b) > EPS) x = !x;\\n\\t}\\n\\treturn (x ? 2:0);\\n}\\n\\n//2つのvectorがなすラジアンを求める関数\\ndouble calc_rad(Vector vec1,Vector vec2){\\n\\n\\tdouble tmp = dot(vec1,vec2)/(abs(vec1)*abs(vec2));\\n\\n\\tif(fabs(tmp+1.0) < EPS){\\n\\n\\t\\treturn M_PI;\\n\\t}\\n\\n\\tif(fabs(tmp-1.0) < EPS){\\n\\n\\t\\treturn 0.0;\\n\\t}\\n\\n\\treturn acos(dot(vec1,vec2)/(abs(vec1)*abs(vec2)));\\n}\\n\\n//3点がなすラジアンを求める関数(ccw(base,a,b) == CCW)\\ndouble calc_rad(Point base,Point a,Point b){\\n\\n\\tVector vec1 = b-base;\\n\\tVector vec2 = a-base;\\n\\n\\treturn calc_rad(vec1,vec2);\\n}\\n\\n\\n/*\\n * ■辺始まり辺終わりにするとWAする\\n * 点始まり点終わりにする、ただし途中で訪問した辺は再訪しない■*\\n * */\\nvoid dfs(int pre,int node){\\n\\n\\tif(CATCH)return;\\n\\n\\tPoint pre_p = point[pre];\\n\\tPoint now = point[node];\\n\\n\\tdouble mini = BIG_NUM;\\n\\tint ind = -1;\\n\\n\\tfor(int i = 0; i < G[node].size(); i++){\\n\\t\\tint adj = G[node][i];\\n\\t\\tif(adj == pre)continue;\\n\\n\\t\\tPoint next = point[adj];\\n\\n\\t\\tdouble tmp_rad;\\n\\t\\tif(ccw(now,pre_p,next) == CLOCKWISE){\\n\\n\\t\\t\\ttmp_rad = calc_rad(now,next,pre_p);\\n\\t\\t\\ttmp_rad = 2*M_PI-tmp_rad;\\n\\t\\t}else{\\n\\n\\t\\t\\ttmp_rad = calc_rad(now,pre_p,next);\\n\\t\\t}\\n\\n\\n\\t\\tif(mini > tmp_rad+EPS){\\n\\n\\t\\t\\tmini = tmp_rad;\\n\\t\\t\\tind = i;\\n\\t\\t}\\n\\t}\\n\\n\\tif(ind == -1)return;\\n\\n\\tint next = G[node][ind];\\n\\tint next_e_ind = MAP[make_pair(node,G[node][ind])];\\n\\n\\tif(SET.count(next) > 0){\\n\\n\\t\\tEDGES.push_back(next_e_ind);\\n\\n\\t\\tCATCH = true;\\n\\t\\t//図形が完成した場合、訪問済みの辺は再訪しない\\n\\t\\tfor(int i = 0; i < EDGES.size(); i++){\\n\\n\\t\\t\\tvisited[EDGES[i]] = true;\\n\\t\\t}\\n\\n\\t\\tPolygon work;\\n\\t\\t//■■最初にnextに到達するまでの点は削除する\\n\\t\\tbool FLG = false;\\n\\t\\tfor(int i = 0; i < POL.size(); i++){\\n\\t\\t\\tif(POL[i] == point[next]){\\n\\n\\t\\t\\t\\tFLG = true;\\n\\t\\t\\t}\\n\\t\\t\\tif(!FLG)continue;\\n\\n\\t\\t\\twork.push_back(POL[i]);\\n\\t\\t}\\n\\n\\t\\tPOL.clear();\\n\\t\\tPOL = work;\\n\\n\\t\\treturn;\\n\\t}\\n\\n\\tif(visited[next_e_ind])return;\\n\\n\\tSET.insert(G[node][ind]);\\n\\tPOL.push_back(point[G[node][ind]]);\\n\\tEDGES.push_back(next_e_ind);\\n\\tdfs(node,G[node][ind]);\\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\\tint num_point = 0;\\n\\tnumE = 0;\\n\\n\\tMAP.clear();\\n\\tREV.clear();\\n\\n\\tfor(int i = 0; i < SIZE; i++){\\n\\n\\t\\tV[i].clear();\\n\\t\\tG[i].clear();\\n\\t\\tON_SEG[i].clear();\\n\\t\\tCONTAIN[i].clear();\\n\\t\\tvisited[i] = false;\\n\\t}\\n\\n\\tPoint base = Point(0,0);\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%lf %lf %lf %lf\\\",&line[i].p[0].x,&line[i].p[0].y,&line[i].p[1].x,&line[i].p[1].y);\\n\\t}\\n\\n\\t//交点を全列挙\\n\\tfor(int i = 0; i < N-1; i++){\\n\\t\\tfor(int k = i+1; k < N; k++){\\n\\t\\t\\tif(!is_Cross(line[i],line[k]))continue;\\n\\n\\t\\t\\tPoint cross_p = calc_Cross_Point(line[i],line[k]);\\n\\n\\t\\t\\tbool FLG = true;\\n\\t\\t\\tfor(int a = 0; a < num_point; a++){\\n\\t\\t\\t\\tif(point[a] == cross_p){\\n\\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)continue;\\n\\n\\t\\t\\t//辺が持つ点の番号を保存\\n\\t\\t\\tCONTAIN[i].push_back(num_point);\\n\\t\\t\\tCONTAIN[k].push_back(num_point);\\n\\n\\t\\t\\t//どの辺の上に乗っているか\\n\\t\\t\\tON_SEG[num_point].push_back(i);\\n\\t\\t\\tON_SEG[num_point].push_back(k);\\n\\n\\t\\t\\tpoint[num_point++] = cross_p;\\n\\t\\t\\tV[i].push_back(cross_p);\\n\\t\\t\\tV[k].push_back(cross_p);\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < num_point; i++){\\n\\n\\t\\tDEL[i] = false;\\n\\t}\\n\\n\\n\\t//■■交点数が1なら行き止まりなので点を削除\\n\\tqueue<int> que;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tnumDEG[i] = V[i].size();\\n\\n\\t\\tif(numDEG[i] == 1){\\n\\n\\t\\t\\tint ind = CONTAIN[i][0];\\n\\n\\t\\t\\tDEL[ind] = true; //点を削除\\n\\t\\t\\tque.push(ind);\\n\\t\\t\\tnumDEG[i] = 0;\\n\\t\\t}\\n\\t}\\n\\n\\twhile(!que.empty()){\\n\\n\\t\\tint ind = que.front(); //消す点番号\\n\\t\\tque.pop();\\n\\n\\t\\tfor(int k = 0; k < ON_SEG[ind].size(); k++){\\n\\n\\t\\t\\tint seg = ON_SEG[ind][k]; //消す点が含まれている辺番号\\n\\t\\t\\tif(numDEG[seg] == 0)continue;\\n\\n\\t\\t\\tnumDEG[seg]--;\\n\\t\\t\\tif(numDEG[seg] == 1){ //■次数が0になった\\n\\t\\t\\t\\tfor(int a = 0; a < CONTAIN[seg].size(); a++){ //残っている1点を探す\\n\\n\\t\\t\\t\\t\\tint tmp_ind = CONTAIN[seg][a]; //点番号\\n\\t\\t\\t\\t\\tif(DEL[tmp_ind])continue;\\n\\n\\t\\t\\t\\t\\tDEL[tmp_ind] = true;\\n\\t\\t\\t\\t\\tnumDEG[seg] = 0;\\n\\t\\t\\t\\t\\tque.push(tmp_ind);\\n\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tif(V[i].size() <= 1)continue;\\n\\n\\t\\tsort(V[i].begin(),V[i].end());\\n\\n\\t\\tvector<int> vec; //点番号を並び順に格納\\n\\n\\t\\tfor(int k = 0; k < V[i].size(); k++){\\n\\t\\t\\tint ind = -1;\\n\\t\\t\\tfor(int a = 0; a < num_point; a++){\\n\\t\\t\\t\\tif(point[a] == V[i][k]){\\n\\n\\t\\t\\t\\t\\tind = a;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tvec.push_back(ind);\\n\\t\\t}\\n\\n\\t\\tvector<int> work;\\n\\t\\tfor(int k = 0; k < vec.size(); k++){\\n\\t\\t\\tif(!DEL[vec[k]]){\\n\\n\\t\\t\\t\\twork.push_back(vec[k]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(work.size() == 0)continue;\\n\\n\\t\\tfor(int k = 0; k < work.size()-1; k++){\\n\\n\\t\\t\\tint p = work[k];\\n\\t\\t\\tint q = work[k+1];\\n\\n\\t\\t\\t//■辺に向きをつける\\n\\t\\t\\tREV[numE] = make_pair(p,q);\\n\\t\\t\\tMAP[make_pair(p,q)] = numE++;\\n\\n\\t\\t\\tREV[numE] = make_pair(q,p);\\n\\t\\t\\tMAP[make_pair(q,p)] = numE++;\\n\\n\\t\\t\\tG[p].push_back(q);\\n\\t\\t\\tG[q].push_back(p);\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < num_point; i++){\\n\\t\\tif(G[i].size() == 0)continue;\\n\\n\\t\\tfor(int k = 0; k < G[i].size(); k++){\\n\\n\\t\\t\\tint e_ind = MAP[make_pair(i,G[i][k])];\\n\\t\\t\\tif(visited[e_ind])continue;\\n\\n\\t\\t\\tPOL.clear();\\n\\t\\t\\tSET.clear();\\n\\t\\t\\tEDGES.clear();\\n\\n\\t\\t\\tPOL.push_back(point[i]);\\n\\t\\t\\tPOL.push_back(point[G[i][k]]);\\n\\n\\t\\t\\tSET.insert(i);\\n\\t\\t\\tSET.insert(G[i][k]); //最初の2点を全探索\\n\\n\\t\\t\\tEDGES.push_back(e_ind);\\n\\n\\t\\t\\tCATCH = false;\\n\\t\\t\\tdfs(i,G[i][k]);\\n\\t\\t\\tif(CATCH){\\n\\n\\n\\t\\t\\t\\tif(contains(POL,base) == 2){\\n\\n\\t\\t\\t\\t\\tprintf(\\\"yes\\\\n\\\");\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tprintf(\\\"no\\\\n\\\");\\n}\\n\\nint main(){\\n\\n\\twhile(true){\\n\\n\\t\\tscanf(\\\"%d\\\",&N);\\n\\t\\tif(N == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 11348,\n \"score_of_the_acc\": -0.8996,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1247_8388148\",\n \"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 //オーバーフローに注意\\n#define MOD 998244353\\n//#define MOD 1000000007\\n#define EPS 0.000000001\\n\\n\\n\\n#define SIZE 30005\\n\\n\\nstruct Point{\\n\\tPoint(double arg_x,double arg_y){\\n\\t\\tx = arg_x;\\n\\t\\ty = arg_y;\\n\\t}\\n\\n\\tPoint(){\\n\\t\\tx = y = 0.0;\\n\\t}\\n\\n\\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\\n\\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\\n\\tPoint operator * (double a){ return Point(a*x,a*y); }\\n\\tPoint operator / (double a){ return Point(x/a,y/a); }\\n\\n\\tdouble abs(){ return sqrt(norm()); }\\n\\tdouble norm(){ return x*x + y*y; }\\n\\n\\tbool operator<(const Point &p) const{\\n\\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\\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\\n\\nint N;\\nLine line[SIZE];\\nPoint point[SIZE];\\nvector<Point> V[SIZE];\\nvector<int> G[SIZE],ON_SEG[SIZE],CONTAIN[SIZE],EDGES;\\nset<int> SET;\\nPolygon POL;\\nbool CATCH,DEL[SIZE],visited[SIZE];\\nmap<pair<int,int>,int> MAP;\\nint numE = 0,numDEG[SIZE];\\nmap<int,pair<int,int>> REV;\\n\\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\\n\\n//交点を求める関数\\nPoint calc_Cross_Point(double x1,double x2,double x3,double x4,double y1,double y2,double y3,double y4){\\n\\tPoint ret;\\n\\tret.x = ((x2-x1)*(y3*(x4-x3)+x3*(y3-y4))-(x4-x3)*(y1*(x2-x1)+x1*(y1-y2)))/((y2-y1)*(x4-x3)-(y4-y3)*(x2-x1));\\n\\tif(fabs(x1-x2) > EPS){\\n\\t\\tret.y = ((y2-y1)*ret.x+y1*(x2-x1)+x1*(y1-y2))/(x2-x1);\\n\\t}else{\\n\\t\\tret.y = ((y4-y3)*ret.x+y3*(x4-x3)+x3*(y3-y4))/(x4-x3);\\n\\t}\\n\\treturn ret;\\n}\\n\\n//インタフェース関数\\nPoint calc_Cross_Point(Point a,Point b,Point c,Point d){\\n\\treturn calc_Cross_Point(a.x,b.x,c.x,d.x,a.y,b.y,c.y,d.y);\\n}\\n\\nPoint calc_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\\ndouble calc_len(Vector a){\\n return sqrt(a.x*a.x+a.y*a.y);\\n}\\n\\n\\n//線分ではなく直線と点の距離\\ndouble getDistanceLP(Line l,Point p){\\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\\n}\\n\\n//点と線分の距離\\ndouble getDistanceSP(Line l,Point p){\\n\\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\\n\\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\\n\\treturn getDistanceLP(l,p);\\n}\\n\\n//線分と線分の距離\\ndouble getDistance(Line A,Line B){\\n\\tif(is_Cross(A,B))return 0.0;\\n\\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\\n\\t\\t\\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\\n}\\n\\nPoint calc_Cross_Point(Line A,Line B){\\n\\n\\tif(getDistanceSP(B,A.p[0]) < EPS){\\n\\n\\t\\treturn A.p[0];\\n\\n\\t}else if(getDistanceSP(B,A.p[1]) < EPS){\\n\\n\\t\\treturn A.p[1];\\n\\n\\t}else if(getDistanceSP(A,B.p[0]) < EPS){\\n\\n\\t\\treturn B.p[0];\\n\\n\\t}else if(getDistanceSP(A,B.p[1]) < EPS){\\n\\n\\t\\treturn B.p[1];\\n\\t}\\n\\n\\treturn calc_Cross_Point(A.p[0],A.p[1],B.p[0],B.p[1]);\\n}\\n\\n/*\\n * IN 2\\n * ON 1\\n * OUT 0\\n *\\n */\\nint contains(Polygon g,Point p){\\n\\tint n = g.size();\\n\\tbool x = false;\\n\\tfor(int i = 0; i < n; i++){\\n\\t\\tPoint a = g[i]-p,b = g[(i+1)%n]-p;\\n\\t\\tif(abs(cross(a,b)) < EPS && dot(a,b) < EPS)return 1;\\n\\t\\tif(a.y > b.y)swap(a,b);\\n\\t\\tif(a.y < EPS && EPS < b.y && cross(a,b) > EPS) x = !x;\\n\\t}\\n\\treturn (x ? 2:0);\\n}\\n\\n//2つのvectorがなすラジアンを求める関数\\ndouble calc_rad(Vector vec1,Vector vec2){\\n\\n\\tdouble tmp = dot(vec1,vec2)/(abs(vec1)*abs(vec2));\\n\\n\\tif(fabs(tmp+1.0) < EPS){\\n\\n\\t\\treturn M_PI;\\n\\t}\\n\\n\\tif(fabs(tmp-1.0) < EPS){\\n\\n\\t\\treturn 0.0;\\n\\t}\\n\\n\\treturn acos(dot(vec1,vec2)/(abs(vec1)*abs(vec2)));\\n}\\n\\n//3点がなすラジアンを求める関数(ccw(base,a,b) == CCW)\\ndouble calc_rad(Point base,Point a,Point b){\\n\\n\\tVector vec1 = b-base;\\n\\tVector vec2 = a-base;\\n\\n\\treturn calc_rad(vec1,vec2);\\n}\\n\\n\\n/*\\n * ■辺始まり辺終わりにするとWAする\\n * 点始まり点終わりにする、ただし途中で訪問した辺は再訪しない■*\\n * */\\nvoid dfs(int pre,int node){\\n\\n\\tif(CATCH)return;\\n\\n\\tPoint pre_p = point[pre];\\n\\tPoint now = point[node];\\n\\n\\tdouble mini = BIG_NUM;\\n\\tint ind = -1;\\n\\n\\tfor(int i = 0; i < G[node].size(); i++){\\n\\t\\tint adj = G[node][i];\\n\\t\\tif(adj == pre)continue;\\n\\n\\t\\tPoint next = point[adj];\\n\\n\\t\\tdouble tmp_rad;\\n\\t\\tif(ccw(now,pre_p,next) == CLOCKWISE){\\n\\n\\t\\t\\ttmp_rad = calc_rad(now,next,pre_p);\\n\\t\\t\\ttmp_rad = 2*M_PI-tmp_rad;\\n\\t\\t}else{\\n\\n\\t\\t\\ttmp_rad = calc_rad(now,pre_p,next);\\n\\t\\t}\\n\\n\\n\\t\\tif(mini > tmp_rad+EPS){\\n\\n\\t\\t\\tmini = tmp_rad;\\n\\t\\t\\tind = i;\\n\\t\\t}\\n\\t}\\n\\n\\tif(ind == -1)return;\\n\\n\\tint next = G[node][ind];\\n\\tint next_e_ind = MAP[make_pair(node,G[node][ind])];\\n\\n\\tif(SET.count(next) > 0){\\n\\n\\t\\tEDGES.push_back(next_e_ind);\\n\\n\\t\\tCATCH = true;\\n\\t\\t//図形が完成した場合、訪問済みの辺は再訪しない\\n\\t\\tfor(int i = 0; i < EDGES.size(); i++){\\n\\n\\t\\t\\tvisited[EDGES[i]] = true;\\n\\t\\t}\\n\\n\\t\\tPolygon work;\\n\\t\\t//■■最初にnextに到達するまでの点は削除する\\n\\t\\tbool FLG = false;\\n\\t\\tfor(int i = 0; i < POL.size(); i++){\\n\\t\\t\\tif(POL[i] == point[next]){\\n\\n\\t\\t\\t\\tFLG = true;\\n\\t\\t\\t}\\n\\t\\t\\tif(!FLG)continue;\\n\\n\\t\\t\\twork.push_back(POL[i]);\\n\\t\\t}\\n\\n\\t\\tPOL.clear();\\n\\t\\tPOL = work;\\n\\n\\t\\treturn;\\n\\t}\\n\\n\\tif(visited[next_e_ind])return;\\n\\n\\tSET.insert(G[node][ind]);\\n\\tPOL.push_back(point[G[node][ind]]);\\n\\tEDGES.push_back(next_e_ind);\\n\\tdfs(node,G[node][ind]);\\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\\tint num_point = 0;\\n\\tnumE = 0;\\n\\n\\tMAP.clear();\\n\\tREV.clear();\\n\\n\\tfor(int i = 0; i < SIZE; i++){\\n\\n\\t\\tV[i].clear();\\n\\t\\tG[i].clear();\\n\\t\\tON_SEG[i].clear();\\n\\t\\tCONTAIN[i].clear();\\n\\t\\tvisited[i] = false;\\n\\t}\\n\\n\\tPoint base = Point(0,0);\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%lf %lf %lf %lf\\\",&line[i].p[0].x,&line[i].p[0].y,&line[i].p[1].x,&line[i].p[1].y);\\n\\t}\\n\\n\\t//交点を全列挙\\n\\tfor(int i = 0; i < N-1; i++){\\n\\t\\tfor(int k = i+1; k < N; k++){\\n\\t\\t\\tif(!is_Cross(line[i],line[k]))continue;\\n\\n\\t\\t\\tPoint cross_p = calc_Cross_Point(line[i],line[k]);\\n\\n\\t\\t\\tbool FLG = true;\\n\\t\\t\\tfor(int a = 0; a < num_point; a++){\\n\\t\\t\\t\\tif(point[a] == cross_p){\\n\\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)continue;\\n\\n\\t\\t\\t//辺が持つ点の番号を保存\\n\\t\\t\\tCONTAIN[i].push_back(num_point);\\n\\t\\t\\tCONTAIN[k].push_back(num_point);\\n\\n\\t\\t\\t//どの辺の上に乗っているか\\n\\t\\t\\tON_SEG[num_point].push_back(i);\\n\\t\\t\\tON_SEG[num_point].push_back(k);\\n\\n\\t\\t\\tpoint[num_point++] = cross_p;\\n\\t\\t\\tV[i].push_back(cross_p);\\n\\t\\t\\tV[k].push_back(cross_p);\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < num_point; i++){\\n\\n\\t\\tDEL[i] = false;\\n\\t}\\n\\n\\n\\t//■■交点数が1なら行き止まりなので点を削除\\n\\tqueue<int> que;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tnumDEG[i] = V[i].size();\\n\\n\\t\\tif(numDEG[i] == 1){\\n\\n\\t\\t\\tint ind = CONTAIN[i][0];\\n\\n\\t\\t\\tDEL[ind] = true; //点を削除\\n\\t\\t\\tque.push(ind);\\n\\t\\t\\tnumDEG[i] = 0;\\n\\t\\t}\\n\\t}\\n\\n\\twhile(!que.empty()){\\n\\n\\t\\tint ind = que.front(); //消す点番号\\n\\t\\tque.pop();\\n\\n\\t\\tfor(int k = 0; k < ON_SEG[ind].size(); k++){\\n\\n\\t\\t\\tint seg = ON_SEG[ind][k]; //消す点が含まれている辺番号\\n\\t\\t\\tif(numDEG[seg] == 0)continue;\\n\\n\\t\\t\\tnumDEG[seg]--;\\n\\t\\t\\tif(numDEG[seg] == 1){ //■次数が0になった\\n\\t\\t\\t\\tfor(int a = 0; a < CONTAIN[seg].size(); a++){ //残っている1点を探す\\n\\n\\t\\t\\t\\t\\tint tmp_ind = CONTAIN[seg][a]; //点番号\\n\\t\\t\\t\\t\\tif(DEL[tmp_ind])continue;\\n\\n\\t\\t\\t\\t\\tDEL[tmp_ind] = true;\\n\\t\\t\\t\\t\\tnumDEG[seg] = 0;\\n\\t\\t\\t\\t\\tque.push(tmp_ind);\\n\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tif(V[i].size() <= 1)continue;\\n\\n\\t\\tsort(V[i].begin(),V[i].end());\\n\\n\\t\\tvector<int> vec; //点番号を並び順に格納\\n\\n\\t\\tfor(int k = 0; k < V[i].size(); k++){\\n\\t\\t\\tint ind = -1;\\n\\t\\t\\tfor(int a = 0; a < num_point; a++){\\n\\t\\t\\t\\tif(point[a] == V[i][k]){\\n\\n\\t\\t\\t\\t\\tind = a;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tvec.push_back(ind);\\n\\t\\t}\\n\\n\\t\\tvector<int> work;\\n\\t\\tfor(int k = 0; k < vec.size(); k++){\\n\\t\\t\\tif(!DEL[vec[k]]){\\n\\n\\t\\t\\t\\twork.push_back(vec[k]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(work.size() == 0)continue;\\n\\n\\t\\tfor(int k = 0; k < work.size()-1; k++){\\n\\n\\t\\t\\tint p = work[k];\\n\\t\\t\\tint q = work[k+1];\\n\\n\\t\\t\\t//■辺に向きをつける\\n\\t\\t\\tREV[numE] = make_pair(p,q);\\n\\t\\t\\tMAP[make_pair(p,q)] = numE++;\\n\\n\\t\\t\\tREV[numE] = make_pair(q,p);\\n\\t\\t\\tMAP[make_pair(q,p)] = numE++;\\n\\n\\t\\t\\tG[p].push_back(q);\\n\\t\\t\\tG[q].push_back(p);\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < num_point; i++){\\n\\t\\tif(G[i].size() == 0)continue;\\n\\n\\t\\tvector<pair<double,int>> work;\\n\\n\\t\\tfor(int k = 0; k < G[i].size(); k++){\\n\\n\\t\\t\\tPoint adj = point[G[i][k]]-point[i]; //■注意\\n\\t\\t\\tdouble tmp_rad = calc_rad(adj);\\n\\t\\t\\twork.push_back(make_pair(tmp_rad,k));\\n\\t\\t}\\n\\n\\t\\tsort(work.begin(),work.end());\\n\\n\\t\\tint mini_ind = work[0].second;\\n\\t\\tint maxi_ind = work.back().second;\\n\\n\\t\\tfor(int k = 0; k < G[i].size(); k++){\\n\\t\\t\\tif(k != mini_ind && k != maxi_ind)continue; //■■最も外側の隣接でないならSKIP\\n\\n\\t\\t\\tint e_ind = MAP[make_pair(i,G[i][k])];\\n\\t\\t\\tif(visited[e_ind])continue;\\n\\n\\t\\t\\tPOL.clear();\\n\\t\\t\\tSET.clear();\\n\\t\\t\\tEDGES.clear();\\n\\n\\t\\t\\tPOL.push_back(point[i]);\\n\\t\\t\\tPOL.push_back(point[G[i][k]]);\\n\\n\\t\\t\\tSET.insert(i);\\n\\t\\t\\tSET.insert(G[i][k]); //最初の2点を全探索\\n\\n\\t\\t\\tEDGES.push_back(e_ind);\\n\\n\\t\\t\\tCATCH = false;\\n\\t\\t\\tdfs(i,G[i][k]);\\n\\t\\t\\tif(CATCH){\\n\\n\\n\\t\\t\\t\\tif(contains(POL,base) == 2){\\n\\n\\t\\t\\t\\t\\tprintf(\\\"yes\\\\n\\\");\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tprintf(\\\"no\\\\n\\\");\\n}\\n\\nint main(){\\n\\n\\twhile(true){\\n\\n\\t\\tscanf(\\\"%d\\\",&N);\\n\\t\\tif(N == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 11396,\n \"score_of_the_acc\": -0.9035,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1247_8387786\",\n \"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 //オーバーフローに注意\\n#define MOD 998244353\\n//#define MOD 1000000007\\n#define EPS 0.000000001\\n\\n\\n\\n#define SIZE 30005\\n\\n\\nstruct Point{\\n\\tPoint(double arg_x,double arg_y){\\n\\t\\tx = arg_x;\\n\\t\\ty = arg_y;\\n\\t}\\n\\n\\tPoint(){\\n\\t\\tx = y = 0.0;\\n\\t}\\n\\n\\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\\n\\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\\n\\tPoint operator * (double a){ return Point(a*x,a*y); }\\n\\tPoint operator / (double a){ return Point(x/a,y/a); }\\n\\n\\tdouble abs(){ return sqrt(norm()); }\\n\\tdouble norm(){ return x*x + y*y; }\\n\\n\\tbool operator<(const Point &p) const{\\n\\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\\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\\n\\nint N;\\nLine line[SIZE];\\nPoint point[SIZE];\\nvector<Point> V[SIZE];\\nvector<int> G[SIZE],ON_SEG[SIZE],CONTAIN[SIZE],EDGES;\\nset<int> SET;\\nPolygon POL;\\nbool CATCH,DEL[SIZE],visited[SIZE];\\nmap<pair<int,int>,int> MAP;\\nint numE = 0,numDEG[SIZE];\\nmap<int,pair<int,int>> REV;\\n\\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\\n\\n//交点を求める関数\\nPoint calc_Cross_Point(double x1,double x2,double x3,double x4,double y1,double y2,double y3,double y4){\\n\\tPoint ret;\\n\\tret.x = ((x2-x1)*(y3*(x4-x3)+x3*(y3-y4))-(x4-x3)*(y1*(x2-x1)+x1*(y1-y2)))/((y2-y1)*(x4-x3)-(y4-y3)*(x2-x1));\\n\\tif(fabs(x1-x2) > EPS){\\n\\t\\tret.y = ((y2-y1)*ret.x+y1*(x2-x1)+x1*(y1-y2))/(x2-x1);\\n\\t}else{\\n\\t\\tret.y = ((y4-y3)*ret.x+y3*(x4-x3)+x3*(y3-y4))/(x4-x3);\\n\\t}\\n\\treturn ret;\\n}\\n\\n//インタフェース関数\\nPoint calc_Cross_Point(Point a,Point b,Point c,Point d){\\n\\treturn calc_Cross_Point(a.x,b.x,c.x,d.x,a.y,b.y,c.y,d.y);\\n}\\n\\nPoint calc_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\\ndouble calc_len(Vector a){\\n return sqrt(a.x*a.x+a.y*a.y);\\n}\\n\\n\\n//線分ではなく直線と点の距離\\ndouble getDistanceLP(Line l,Point p){\\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\\n}\\n\\n//点と線分の距離\\ndouble getDistanceSP(Line l,Point p){\\n\\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\\n\\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\\n\\treturn getDistanceLP(l,p);\\n}\\n\\n//線分と線分の距離\\ndouble getDistance(Line A,Line B){\\n\\tif(is_Cross(A,B))return 0.0;\\n\\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\\n\\t\\t\\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\\n}\\n\\nPoint calc_Cross_Point(Line A,Line B){\\n\\n\\tif(getDistanceSP(B,A.p[0]) < EPS){\\n\\n\\t\\treturn A.p[0];\\n\\n\\t}else if(getDistanceSP(B,A.p[1]) < EPS){\\n\\n\\t\\treturn A.p[1];\\n\\n\\t}else if(getDistanceSP(A,B.p[0]) < EPS){\\n\\n\\t\\treturn B.p[0];\\n\\n\\t}else if(getDistanceSP(A,B.p[1]) < EPS){\\n\\n\\t\\treturn B.p[1];\\n\\t}\\n\\n\\treturn calc_Cross_Point(A.p[0],A.p[1],B.p[0],B.p[1]);\\n}\\n\\n/*\\n * IN 2\\n * ON 1\\n * OUT 0\\n *\\n */\\nint contains(Polygon g,Point p){\\n\\tint n = g.size();\\n\\tbool x = false;\\n\\tfor(int i = 0; i < n; i++){\\n\\t\\tPoint a = g[i]-p,b = g[(i+1)%n]-p;\\n\\t\\tif(abs(cross(a,b)) < EPS && dot(a,b) < EPS)return 1;\\n\\t\\tif(a.y > b.y)swap(a,b);\\n\\t\\tif(a.y < EPS && EPS < b.y && cross(a,b) > EPS) x = !x;\\n\\t}\\n\\treturn (x ? 2:0);\\n}\\n\\n//2つのvectorがなすラジアンを求める関数\\ndouble calc_rad(Vector vec1,Vector vec2){\\n\\n\\tdouble tmp = dot(vec1,vec2)/(abs(vec1)*abs(vec2));\\n\\n\\tif(fabs(tmp+1.0) < EPS){\\n\\n\\t\\treturn M_PI;\\n\\t}\\n\\n\\tif(fabs(tmp-1.0) < EPS){\\n\\n\\t\\treturn 0.0;\\n\\t}\\n\\n\\treturn acos(dot(vec1,vec2)/(abs(vec1)*abs(vec2)));\\n}\\n\\n//3点がなすラジアンを求める関数(ccw(base,a,b) == CCW)\\ndouble calc_rad(Point base,Point a,Point b){\\n\\n\\tVector vec1 = b-base;\\n\\tVector vec2 = a-base;\\n\\n\\treturn calc_rad(vec1,vec2);\\n}\\n\\n\\n/*\\n * ■辺始まり辺終わりにするとWAする\\n * 点始まり点終わりにする、ただし途中で訪問した辺は再訪しない■*\\n * */\\nvoid dfs(int pre,int node){\\n\\n\\tif(CATCH)return;\\n\\n\\tPoint pre_p = point[pre];\\n\\tPoint now = point[node];\\n\\n\\tdouble maxi = -BIG_NUM;\\n\\tint ind = -1;\\n\\n\\tfor(int i = 0; i < G[node].size(); i++){\\n\\t\\tint adj = G[node][i];\\n\\t\\tif(adj == pre)continue;\\n\\n\\t\\tPoint next = point[adj];\\n\\n\\t\\tdouble tmp_rad = calc_rad(now,pre_p,next);\\n\\n\\t\\tif(maxi+EPS < tmp_rad){\\n\\n\\t\\t\\tmaxi = tmp_rad;\\n\\t\\t\\tind = i;\\n\\t\\t}\\n\\t}\\n\\n\\tif(ind == -1)return;\\n\\n\\tint next = G[node][ind];\\n\\tint next_e_ind = MAP[make_pair(node,G[node][ind])];\\n\\n\\tif(SET.count(next) > 0){\\n\\n\\t\\tEDGES.push_back(next_e_ind);\\n\\n\\t\\tCATCH = true;\\n\\t\\t//図形が完成した場合、訪問済みの辺は再訪しない\\n\\t\\tfor(int i = 0; i < EDGES.size(); i++){\\n\\n\\t\\t\\tvisited[EDGES[i]] = true;\\n\\t\\t}\\n\\n\\t\\tPolygon work;\\n\\t\\t//■■最初にnextに到達するまでの点は削除する\\n\\t\\tbool FLG = false;\\n\\t\\tfor(int i = 0; i < POL.size(); i++){\\n\\t\\t\\tif(POL[i] == point[next]){\\n\\n\\t\\t\\t\\tFLG = true;\\n\\t\\t\\t}\\n\\t\\t\\tif(!FLG)continue;\\n\\n\\t\\t\\twork.push_back(POL[i]);\\n\\t\\t}\\n\\n\\t\\tPOL.clear();\\n\\t\\tPOL = work;\\n\\n\\t\\treturn;\\n\\t}\\n\\n\\tif(visited[next_e_ind])return;\\n\\n\\tSET.insert(G[node][ind]);\\n\\tPOL.push_back(point[G[node][ind]]);\\n\\tEDGES.push_back(next_e_ind);\\n\\tdfs(node,G[node][ind]);\\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\\tint num_point = 0;\\n\\tnumE = 0;\\n\\n\\tMAP.clear();\\n\\tREV.clear();\\n\\n\\tfor(int i = 0; i < SIZE; i++){\\n\\n\\t\\tV[i].clear();\\n\\t\\tG[i].clear();\\n\\t\\tON_SEG[i].clear();\\n\\t\\tCONTAIN[i].clear();\\n\\t\\tvisited[i] = false;\\n\\t}\\n\\n\\tPoint base = Point(0,0);\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%lf %lf %lf %lf\\\",&line[i].p[0].x,&line[i].p[0].y,&line[i].p[1].x,&line[i].p[1].y);\\n\\t}\\n\\n\\t//交点を全列挙\\n\\tfor(int i = 0; i < N-1; i++){\\n\\t\\tfor(int k = i+1; k < N; k++){\\n\\t\\t\\tif(!is_Cross(line[i],line[k]))continue;\\n\\n\\t\\t\\tPoint cross_p = calc_Cross_Point(line[i],line[k]);\\n\\n\\t\\t\\tbool FLG = true;\\n\\t\\t\\tfor(int a = 0; a < num_point; a++){\\n\\t\\t\\t\\tif(point[a] == cross_p){\\n\\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)continue;\\n\\n\\t\\t\\t//辺が持つ点の番号を保存\\n\\t\\t\\tCONTAIN[i].push_back(num_point);\\n\\t\\t\\tCONTAIN[k].push_back(num_point);\\n\\n\\t\\t\\t//どの辺の上に乗っているか\\n\\t\\t\\tON_SEG[num_point].push_back(i);\\n\\t\\t\\tON_SEG[num_point].push_back(k);\\n\\n\\t\\t\\tpoint[num_point++] = cross_p;\\n\\t\\t\\tV[i].push_back(cross_p);\\n\\t\\t\\tV[k].push_back(cross_p);\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < num_point; i++){\\n\\n\\t\\tDEL[i] = false;\\n\\t}\\n\\n\\n\\t//■■交点数が1なら行き止まりなので点を削除\\n\\tqueue<int> que;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tnumDEG[i] = V[i].size();\\n\\n\\t\\tif(numDEG[i] == 1){\\n\\n\\t\\t\\tint ind = CONTAIN[i][0];\\n\\n\\t\\t\\tDEL[ind] = true; //点を削除\\n\\t\\t\\tque.push(ind);\\n\\t\\t\\tnumDEG[i] = 0;\\n\\t\\t}\\n\\t}\\n\\n\\twhile(!que.empty()){\\n\\n\\t\\tint ind = que.front(); //消す点番号\\n\\t\\tque.pop();\\n\\n\\t\\tfor(int k = 0; k < ON_SEG[ind].size(); k++){\\n\\n\\t\\t\\tint seg = ON_SEG[ind][k]; //消す点が含まれている辺番号\\n\\t\\t\\tif(numDEG[seg] == 0)continue;\\n\\n\\t\\t\\tnumDEG[seg]--;\\n\\t\\t\\tif(numDEG[seg] == 1){ //■次数が0になった\\n\\t\\t\\t\\tfor(int a = 0; a < CONTAIN[seg].size(); a++){ //残っている1点を探す\\n\\n\\t\\t\\t\\t\\tint tmp_ind = CONTAIN[seg][a]; //点番号\\n\\t\\t\\t\\t\\tif(DEL[tmp_ind])continue;\\n\\n\\t\\t\\t\\t\\tDEL[tmp_ind] = true;\\n\\t\\t\\t\\t\\tnumDEG[seg] = 0;\\n\\t\\t\\t\\t\\tque.push(tmp_ind);\\n\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tif(V[i].size() <= 1)continue;\\n\\n\\t\\tsort(V[i].begin(),V[i].end());\\n\\n\\t\\tvector<int> vec; //点番号を並び順に格納\\n\\n\\t\\tfor(int k = 0; k < V[i].size(); k++){\\n\\t\\t\\tint ind = -1;\\n\\t\\t\\tfor(int a = 0; a < num_point; a++){\\n\\t\\t\\t\\tif(point[a] == V[i][k]){\\n\\n\\t\\t\\t\\t\\tind = a;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tvec.push_back(ind);\\n\\t\\t}\\n\\n\\t\\tvector<int> work;\\n\\t\\tfor(int k = 0; k < vec.size(); k++){\\n\\t\\t\\tif(!DEL[vec[k]]){\\n\\n\\t\\t\\t\\twork.push_back(vec[k]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(work.size() == 0)continue;\\n\\n\\t\\tfor(int k = 0; k < work.size()-1; k++){\\n\\n\\t\\t\\tint p = work[k];\\n\\t\\t\\tint q = work[k+1];\\n\\n\\t\\t\\t//■辺に向きをつける\\n\\t\\t\\tREV[numE] = make_pair(p,q);\\n\\t\\t\\tMAP[make_pair(p,q)] = numE++;\\n\\n\\t\\t\\tREV[numE] = make_pair(q,p);\\n\\t\\t\\tMAP[make_pair(q,p)] = numE++;\\n\\n\\t\\t\\tG[p].push_back(q);\\n\\t\\t\\tG[q].push_back(p);\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < num_point; i++){\\n\\t\\tif(G[i].size() == 0)continue;\\n\\n\\t\\tvector<pair<double,int>> work;\\n\\n\\t\\tfor(int k = 0; k < G[i].size(); k++){\\n\\n\\t\\t\\tPoint adj = point[G[i][k]]-point[i]; //■注意\\n\\t\\t\\tdouble tmp_rad = calc_rad(adj);\\n\\t\\t\\twork.push_back(make_pair(tmp_rad,k));\\n\\t\\t}\\n\\n\\t\\tsort(work.begin(),work.end());\\n\\n\\t\\tint mini_ind = work[0].second;\\n\\t\\tint maxi_ind = work.back().second;\\n\\n\\t\\tfor(int k = 0; k < G[i].size(); k++){\\n\\t\\t\\tif(k != mini_ind && k != maxi_ind)continue; //■■最も外側の隣接でないならSKIP\\n\\n\\t\\t\\tint e_ind = MAP[make_pair(i,G[i][k])];\\n\\t\\t\\tif(visited[e_ind])continue;\\n\\n\\t\\t\\tPOL.clear();\\n\\t\\t\\tSET.clear();\\n\\t\\t\\tEDGES.clear();\\n\\n\\t\\t\\tPOL.push_back(point[i]);\\n\\t\\t\\tPOL.push_back(point[G[i][k]]);\\n\\n\\t\\t\\tSET.insert(i);\\n\\t\\t\\tSET.insert(G[i][k]); //最初の2点を全探索\\n\\n\\t\\t\\tEDGES.push_back(e_ind);\\n\\n\\t\\t\\tCATCH = false;\\n\\t\\t\\tdfs(i,G[i][k]);\\n\\t\\t\\tif(CATCH){\\n\\n\\n\\t\\t\\t\\tif(contains(POL,base) == 2){\\n\\n\\t\\t\\t\\t\\tprintf(\\\"yes\\\\n\\\");\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tprintf(\\\"no\\\\n\\\");\\n}\\n\\nint main(){\\n\\n\\twhile(true){\\n\\n\\t\\tscanf(\\\"%d\\\",&N);\\n\\t\\tif(N == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 11384,\n \"score_of_the_acc\": -0.9204,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1247_8387742\",\n \"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 //オーバーフローに注意\\n#define MOD 998244353\\n//#define MOD 1000000007\\n#define EPS 0.000000001\\n\\n\\n\\n#define SIZE 30005\\n\\n\\nstruct Point{\\n\\tPoint(double arg_x,double arg_y){\\n\\t\\tx = arg_x;\\n\\t\\ty = arg_y;\\n\\t}\\n\\n\\tPoint(){\\n\\t\\tx = y = 0.0;\\n\\t}\\n\\n\\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\\n\\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\\n\\tPoint operator * (double a){ return Point(a*x,a*y); }\\n\\tPoint operator / (double a){ return Point(x/a,y/a); }\\n\\n\\tdouble abs(){ return sqrt(norm()); }\\n\\tdouble norm(){ return x*x + y*y; }\\n\\n\\tbool operator<(const Point &p) const{\\n\\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\\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\\n\\nint N;\\nLine line[SIZE];\\nPoint point[SIZE];\\nvector<Point> V[SIZE];\\nvector<int> G[SIZE],ON_SEG[SIZE],CONTAIN[SIZE],EDGES;\\nset<int> SET;\\nPolygon POL;\\nbool CATCH,DEL[SIZE],visited[SIZE];\\nmap<pair<int,int>,int> MAP;\\nint numE = 0,numDEG[SIZE];\\nmap<int,pair<int,int>> REV;\\n\\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\\n\\n//交点を求める関数\\nPoint calc_Cross_Point(double x1,double x2,double x3,double x4,double y1,double y2,double y3,double y4){\\n\\tPoint ret;\\n\\tret.x = ((x2-x1)*(y3*(x4-x3)+x3*(y3-y4))-(x4-x3)*(y1*(x2-x1)+x1*(y1-y2)))/((y2-y1)*(x4-x3)-(y4-y3)*(x2-x1));\\n\\tif(fabs(x1-x2) > EPS){\\n\\t\\tret.y = ((y2-y1)*ret.x+y1*(x2-x1)+x1*(y1-y2))/(x2-x1);\\n\\t}else{\\n\\t\\tret.y = ((y4-y3)*ret.x+y3*(x4-x3)+x3*(y3-y4))/(x4-x3);\\n\\t}\\n\\treturn ret;\\n}\\n\\n//インタフェース関数\\nPoint calc_Cross_Point(Point a,Point b,Point c,Point d){\\n\\treturn calc_Cross_Point(a.x,b.x,c.x,d.x,a.y,b.y,c.y,d.y);\\n}\\n\\nPoint calc_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\\ndouble calc_len(Vector a){\\n return sqrt(a.x*a.x+a.y*a.y);\\n}\\n\\n\\n//線分ではなく直線と点の距離\\ndouble getDistanceLP(Line l,Point p){\\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\\n}\\n\\n//点と線分の距離\\ndouble getDistanceSP(Line l,Point p){\\n\\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\\n\\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\\n\\treturn getDistanceLP(l,p);\\n}\\n\\n//線分と線分の距離\\ndouble getDistance(Line A,Line B){\\n\\tif(is_Cross(A,B))return 0.0;\\n\\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\\n\\t\\t\\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\\n}\\n\\nPoint calc_Cross_Point(Line A,Line B){\\n\\n\\tif(getDistanceSP(B,A.p[0]) < EPS){\\n\\n\\t\\treturn A.p[0];\\n\\n\\t}else if(getDistanceSP(B,A.p[1]) < EPS){\\n\\n\\t\\treturn A.p[1];\\n\\n\\t}else if(getDistanceSP(A,B.p[0]) < EPS){\\n\\n\\t\\treturn B.p[0];\\n\\n\\t}else if(getDistanceSP(A,B.p[1]) < EPS){\\n\\n\\t\\treturn B.p[1];\\n\\t}\\n\\n\\treturn calc_Cross_Point(A.p[0],A.p[1],B.p[0],B.p[1]);\\n}\\n\\n/*\\n * IN 2\\n * ON 1\\n * OUT 0\\n *\\n */\\nint contains(Polygon g,Point p){\\n\\tint n = g.size();\\n\\tbool x = false;\\n\\tfor(int i = 0; i < n; i++){\\n\\t\\tPoint a = g[i]-p,b = g[(i+1)%n]-p;\\n\\t\\tif(abs(cross(a,b)) < EPS && dot(a,b) < EPS)return 1;\\n\\t\\tif(a.y > b.y)swap(a,b);\\n\\t\\tif(a.y < EPS && EPS < b.y && cross(a,b) > EPS) x = !x;\\n\\t}\\n\\treturn (x ? 2:0);\\n}\\n\\n//2つのvectorがなすラジアンを求める関数\\ndouble calc_rad(Vector vec1,Vector vec2){\\n\\n\\tdouble tmp = dot(vec1,vec2)/(abs(vec1)*abs(vec2));\\n\\n\\tif(fabs(tmp+1.0) < EPS){\\n\\n\\t\\treturn M_PI;\\n\\t}\\n\\n\\tif(fabs(tmp-1.0) < EPS){\\n\\n\\t\\treturn 0.0;\\n\\t}\\n\\n\\treturn acos(dot(vec1,vec2)/(abs(vec1)*abs(vec2)));\\n}\\n\\n//3点がなすラジアンを求める関数(ccw(base,a,b) == CCW)\\ndouble calc_rad(Point base,Point a,Point b){\\n\\n\\tVector vec1 = b-base;\\n\\tVector vec2 = a-base;\\n\\n\\treturn calc_rad(vec1,vec2);\\n}\\n\\n\\n/*\\n * ■辺始まり辺終わりにするとWAする\\n * 点始まり点終わりにする、ただし途中で訪問した辺は再訪しない■*\\n * */\\nvoid dfs(int pre,int node){\\n\\n\\tif(CATCH)return;\\n\\n\\tPoint pre_p = point[pre];\\n\\tPoint now = point[node];\\n\\n\\tdouble maxi = -BIG_NUM;\\n\\tint ind = -1;\\n\\n\\tfor(int i = 0; i < G[node].size(); i++){\\n\\t\\tint adj = G[node][i];\\n\\t\\tif(adj == pre)continue;\\n\\n\\t\\tPoint next = point[adj];\\n\\n\\t\\tdouble tmp_rad = calc_rad(now,pre_p,next);\\n\\n\\t\\tif(maxi+EPS < tmp_rad){\\n\\n\\t\\t\\tmaxi = tmp_rad;\\n\\t\\t\\tind = i;\\n\\t\\t}\\n\\t}\\n\\n\\tif(ind == -1)return;\\n\\n\\tint next = G[node][ind];\\n\\tint next_e_ind = MAP[make_pair(node,G[node][ind])];\\n\\n\\tif(SET.count(next) > 0){\\n\\n\\t\\tCATCH = true;\\n\\t\\t//図形が完成した場合、訪問済みの辺は再訪しない\\n\\t\\tfor(int i = 0; i < EDGES.size(); i++){\\n\\n\\t\\t\\tvisited[EDGES[i]] = true;\\n\\t\\t}\\n\\n\\t\\tPolygon work;\\n\\t\\t//■■最初にnextに到達するまでの点は削除する\\n\\t\\tbool FLG = false;\\n\\t\\tfor(int i = 0; i < POL.size(); i++){\\n\\t\\t\\tif(POL[i] == point[next]){\\n\\n\\t\\t\\t\\tFLG = true;\\n\\t\\t\\t}\\n\\t\\t\\tif(!FLG)continue;\\n\\n\\t\\t\\twork.push_back(POL[i]);\\n\\t\\t}\\n\\n\\t\\tPOL.clear();\\n\\t\\tPOL = work;\\n\\n\\t\\treturn;\\n\\t}\\n\\n\\tif(visited[next_e_ind])return;\\n\\n\\tSET.insert(G[node][ind]);\\n\\tPOL.push_back(point[G[node][ind]]);\\n\\t//EDGES.push_back(next_e_ind);\\n\\tdfs(node,G[node][ind]);\\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\\tint num_point = 0;\\n\\tnumE = 0;\\n\\n\\tMAP.clear();\\n\\tREV.clear();\\n\\n\\tfor(int i = 0; i < SIZE; i++){\\n\\n\\t\\tV[i].clear();\\n\\t\\tG[i].clear();\\n\\t\\tON_SEG[i].clear();\\n\\t\\tCONTAIN[i].clear();\\n\\t\\tvisited[i] = false;\\n\\t}\\n\\n\\tPoint base = Point(0,0);\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%lf %lf %lf %lf\\\",&line[i].p[0].x,&line[i].p[0].y,&line[i].p[1].x,&line[i].p[1].y);\\n\\t}\\n\\n\\t//交点を全列挙\\n\\tfor(int i = 0; i < N-1; i++){\\n\\t\\tfor(int k = i+1; k < N; k++){\\n\\t\\t\\tif(!is_Cross(line[i],line[k]))continue;\\n\\n\\t\\t\\tPoint cross_p = calc_Cross_Point(line[i],line[k]);\\n\\n\\t\\t\\tbool FLG = true;\\n\\t\\t\\tfor(int a = 0; a < num_point; a++){\\n\\t\\t\\t\\tif(point[a] == cross_p){\\n\\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)continue;\\n\\n\\t\\t\\t//辺が持つ点の番号を保存\\n\\t\\t\\tCONTAIN[i].push_back(num_point);\\n\\t\\t\\tCONTAIN[k].push_back(num_point);\\n\\n\\t\\t\\t//どの辺の上に乗っているか\\n\\t\\t\\tON_SEG[num_point].push_back(i);\\n\\t\\t\\tON_SEG[num_point].push_back(k);\\n\\n\\t\\t\\tpoint[num_point++] = cross_p;\\n\\t\\t\\tV[i].push_back(cross_p);\\n\\t\\t\\tV[k].push_back(cross_p);\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < num_point; i++){\\n\\n\\t\\tDEL[i] = false;\\n\\t}\\n\\n\\n\\t//■■交点数が1なら行き止まりなので点を削除\\n\\tqueue<int> que;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tnumDEG[i] = V[i].size();\\n\\n\\t\\tif(numDEG[i] == 1){\\n\\n\\t\\t\\tint ind = CONTAIN[i][0];\\n\\n\\t\\t\\tDEL[ind] = true; //点を削除\\n\\t\\t\\tque.push(ind);\\n\\t\\t\\tnumDEG[i] = 0;\\n\\t\\t}\\n\\t}\\n\\n\\twhile(!que.empty()){\\n\\n\\t\\tint ind = que.front(); //消す点番号\\n\\t\\tque.pop();\\n\\n\\t\\tfor(int k = 0; k < ON_SEG[ind].size(); k++){\\n\\n\\t\\t\\tint seg = ON_SEG[ind][k]; //消す点が含まれている辺番号\\n\\t\\t\\tif(numDEG[seg] == 0)continue;\\n\\n\\t\\t\\tnumDEG[seg]--;\\n\\t\\t\\tif(numDEG[seg] == 1){ //■次数が0になった\\n\\t\\t\\t\\tfor(int a = 0; a < CONTAIN[seg].size(); a++){ //残っている1点を探す\\n\\n\\t\\t\\t\\t\\tint tmp_ind = CONTAIN[seg][a]; //点番号\\n\\t\\t\\t\\t\\tif(DEL[tmp_ind])continue;\\n\\n\\t\\t\\t\\t\\tDEL[tmp_ind] = true;\\n\\t\\t\\t\\t\\tnumDEG[seg] = 0;\\n\\t\\t\\t\\t\\tque.push(tmp_ind);\\n\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tif(V[i].size() <= 1)continue;\\n\\n\\t\\tsort(V[i].begin(),V[i].end());\\n\\n\\t\\tvector<int> vec; //点番号を並び順に格納\\n\\n\\t\\tfor(int k = 0; k < V[i].size(); k++){\\n\\t\\t\\tint ind = -1;\\n\\t\\t\\tfor(int a = 0; a < num_point; a++){\\n\\t\\t\\t\\tif(point[a] == V[i][k]){\\n\\n\\t\\t\\t\\t\\tind = a;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tvec.push_back(ind);\\n\\t\\t}\\n\\n\\t\\tvector<int> work;\\n\\t\\tfor(int k = 0; k < vec.size(); k++){\\n\\t\\t\\tif(!DEL[vec[k]]){\\n\\n\\t\\t\\t\\twork.push_back(vec[k]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(work.size() == 0)continue;\\n\\n\\t\\tfor(int k = 0; k < work.size()-1; k++){\\n\\n\\t\\t\\tint p = work[k];\\n\\t\\t\\tint q = work[k+1];\\n\\n\\t\\t\\t//■辺に向きをつける\\n\\t\\t\\tREV[numE] = make_pair(p,q);\\n\\t\\t\\tMAP[make_pair(p,q)] = numE++;\\n\\n\\t\\t\\tREV[numE] = make_pair(q,p);\\n\\t\\t\\tMAP[make_pair(q,p)] = numE++;\\n\\n\\t\\t\\tG[p].push_back(q);\\n\\t\\t\\tG[q].push_back(p);\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < num_point; i++){\\n\\t\\tif(G[i].size() == 0)continue;\\n\\n\\t\\tvector<pair<double,int>> work;\\n\\n\\t\\tfor(int k = 0; k < G[i].size(); k++){\\n\\n\\t\\t\\tPoint adj = point[G[i][k]]-point[i]; //■注意\\n\\t\\t\\tdouble tmp_rad = calc_rad(adj);\\n\\t\\t\\twork.push_back(make_pair(tmp_rad,k));\\n\\t\\t}\\n\\n\\t\\tsort(work.begin(),work.end());\\n\\n\\t\\tint mini_ind = work[0].second;\\n\\t\\tint maxi_ind = work.back().second;\\n\\n\\t\\tfor(int k = 0; k < G[i].size(); k++){\\n\\t\\t\\tif(k != mini_ind && k != maxi_ind)continue; //■■最も外側の隣接でないならSKIP\\n\\n\\t\\t\\tint e_ind = MAP[make_pair(i,G[i][k])];\\n\\t\\t\\tif(visited[e_ind])continue;\\n\\n\\t\\t\\tPOL.clear();\\n\\t\\t\\tSET.clear();\\n\\t\\t\\tEDGES.clear();\\n\\n\\t\\t\\tPOL.push_back(point[i]);\\n\\t\\t\\tPOL.push_back(point[G[i][k]]);\\n\\n\\t\\t\\tSET.insert(i);\\n\\t\\t\\tSET.insert(G[i][k]); //最初の2点を全探索\\n\\n\\t\\t\\tEDGES.push_back(e_ind);\\n\\n\\t\\t\\tCATCH = false;\\n\\t\\t\\tdfs(i,G[i][k]);\\n\\t\\t\\tif(CATCH){\\n\\n\\n\\t\\t\\t\\tif(contains(POL,base) == 2){\\n\\n\\t\\t\\t\\t\\tprintf(\\\"yes\\\\n\\\");\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tprintf(\\\"no\\\\n\\\");\\n}\\n\\nint main(){\\n\\n\\twhile(true){\\n\\n\\t\\tscanf(\\\"%d\\\",&N);\\n\\t\\tif(N == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 360,\n \"memory_kb\": 11244,\n \"score_of_the_acc\": -0.9337,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1247_8387201\",\n \"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 //オーバーフローに注意\\n#define MOD 998244353\\n//#define MOD 1000000007\\n#define EPS 0.000000001\\n\\n\\n\\n#define SIZE 30005\\n\\n\\nstruct Point{\\n\\tPoint(double arg_x,double arg_y){\\n\\t\\tx = arg_x;\\n\\t\\ty = arg_y;\\n\\t}\\n\\n\\tPoint(){\\n\\t\\tx = y = 0.0;\\n\\t}\\n\\n\\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\\n\\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\\n\\tPoint operator * (double a){ return Point(a*x,a*y); }\\n\\tPoint operator / (double a){ return Point(x/a,y/a); }\\n\\n\\tdouble abs(){ return sqrt(norm()); }\\n\\tdouble norm(){ return x*x + y*y; }\\n\\n\\tbool operator<(const Point &p) const{\\n\\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\\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\\n\\nint N;\\nLine line[SIZE];\\nPoint point[SIZE];\\nvector<Point> V[SIZE];\\nvector<int> G[SIZE],ON_SEG[SIZE],CONTAIN[SIZE],EDGES;\\nset<int> SET;\\nPolygon POL;\\nbool CATCH,DEL[SIZE],visited[SIZE];\\nmap<pair<int,int>,int> MAP;\\nint numE = 0,numDEG[SIZE];\\nmap<int,pair<int,int>> REV;\\n\\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\\n\\n//交点を求める関数\\nPoint calc_Cross_Point(double x1,double x2,double x3,double x4,double y1,double y2,double y3,double y4){\\n\\tPoint ret;\\n\\tret.x = ((x2-x1)*(y3*(x4-x3)+x3*(y3-y4))-(x4-x3)*(y1*(x2-x1)+x1*(y1-y2)))/((y2-y1)*(x4-x3)-(y4-y3)*(x2-x1));\\n\\tif(fabs(x1-x2) > EPS){\\n\\t\\tret.y = ((y2-y1)*ret.x+y1*(x2-x1)+x1*(y1-y2))/(x2-x1);\\n\\t}else{\\n\\t\\tret.y = ((y4-y3)*ret.x+y3*(x4-x3)+x3*(y3-y4))/(x4-x3);\\n\\t}\\n\\treturn ret;\\n}\\n\\n//インタフェース関数\\nPoint calc_Cross_Point(Point a,Point b,Point c,Point d){\\n\\treturn calc_Cross_Point(a.x,b.x,c.x,d.x,a.y,b.y,c.y,d.y);\\n}\\n\\nPoint calc_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\\ndouble calc_len(Vector a){\\n return sqrt(a.x*a.x+a.y*a.y);\\n}\\n\\n\\n//線分ではなく直線と点の距離\\ndouble getDistanceLP(Line l,Point p){\\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\\n}\\n\\n//点と線分の距離\\ndouble getDistanceSP(Line l,Point p){\\n\\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\\n\\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\\n\\treturn getDistanceLP(l,p);\\n}\\n\\n//線分と線分の距離\\ndouble getDistance(Line A,Line B){\\n\\tif(is_Cross(A,B))return 0.0;\\n\\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\\n\\t\\t\\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\\n}\\n\\nPoint calc_Cross_Point(Line A,Line B){\\n\\n\\tif(getDistanceSP(B,A.p[0]) < EPS){\\n\\n\\t\\treturn A.p[0];\\n\\n\\t}else if(getDistanceSP(B,A.p[1]) < EPS){\\n\\n\\t\\treturn A.p[1];\\n\\n\\t}else if(getDistanceSP(A,B.p[0]) < EPS){\\n\\n\\t\\treturn B.p[0];\\n\\n\\t}else if(getDistanceSP(A,B.p[1]) < EPS){\\n\\n\\t\\treturn B.p[1];\\n\\t}\\n\\n\\treturn calc_Cross_Point(A.p[0],A.p[1],B.p[0],B.p[1]);\\n}\\n\\n/*\\n * IN 2\\n * ON 1\\n * OUT 0\\n *\\n */\\nint contains(Polygon g,Point p){\\n\\tint n = g.size();\\n\\tbool x = false;\\n\\tfor(int i = 0; i < n; i++){\\n\\t\\tPoint a = g[i]-p,b = g[(i+1)%n]-p;\\n\\t\\tif(abs(cross(a,b)) < EPS && dot(a,b) < EPS)return 1;\\n\\t\\tif(a.y > b.y)swap(a,b);\\n\\t\\tif(a.y < EPS && EPS < b.y && cross(a,b) > EPS) x = !x;\\n\\t}\\n\\treturn (x ? 2:0);\\n}\\n\\n//2つのvectorがなすラジアンを求める関数\\ndouble calc_rad(Vector vec1,Vector vec2){\\n\\n\\tdouble tmp = dot(vec1,vec2)/(abs(vec1)*abs(vec2));\\n\\n\\tif(fabs(tmp+1.0) < EPS){\\n\\n\\t\\treturn M_PI;\\n\\t}\\n\\n\\tif(fabs(tmp-1.0) < EPS){\\n\\n\\t\\treturn 0.0;\\n\\t}\\n\\n\\treturn acos(dot(vec1,vec2)/(abs(vec1)*abs(vec2)));\\n}\\n\\n//3点がなすラジアンを求める関数(ccw(base,a,b) == CCW)\\ndouble calc_rad(Point base,Point a,Point b){\\n\\n\\tVector vec1 = b-base;\\n\\tVector vec2 = a-base;\\n\\n\\treturn calc_rad(vec1,vec2);\\n}\\n\\n\\n/*\\n * ■辺始まり辺終わりにするとWAする\\n * 点始まり点終わりにする、ただし途中で訪問した辺は再訪しない■*\\n * */\\nvoid dfs(int pre,int node){\\n\\n\\tif(CATCH)return;\\n\\n\\tPoint pre_p = point[pre];\\n\\tPoint now = point[node];\\n\\n\\tdouble maxi = -BIG_NUM;\\n\\tint ind = -1;\\n\\n\\tfor(int i = 0; i < G[node].size(); i++){\\n\\t\\tint adj = G[node][i];\\n\\t\\tif(adj == pre)continue;\\n\\n\\t\\tPoint next = point[adj];\\n\\n\\t\\tdouble tmp_rad = calc_rad(now,pre_p,next);\\n\\n\\t\\tif(maxi+EPS < tmp_rad){\\n\\n\\t\\t\\tmaxi = tmp_rad;\\n\\t\\t\\tind = i;\\n\\t\\t}\\n\\t}\\n\\n\\tif(ind == -1)return;\\n\\n\\tint next = G[node][ind];\\n\\tif(SET.count(next) > 0){\\n\\n\\t\\tCATCH = true;\\n\\t\\t//図形が完成した場合、訪問済みの辺は再訪しない\\n\\t\\tfor(int i = 0; i < EDGES.size(); i++){\\n\\n\\t\\t\\tvisited[EDGES[i]] = true;\\n\\t\\t}\\n\\n\\t\\tPolygon work;\\n\\t\\t//■■最初にnextに到達するまでの点は削除する\\n\\t\\tbool FLG = false;\\n\\t\\tfor(int i = 0; i < POL.size(); i++){\\n\\t\\t\\tif(POL[i] == point[next]){\\n\\n\\t\\t\\t\\tFLG = true;\\n\\t\\t\\t}\\n\\t\\t\\tif(!FLG)continue;\\n\\n\\t\\t\\twork.push_back(POL[i]);\\n\\t\\t}\\n\\n\\t\\tPOL.clear();\\n\\t\\tPOL = work;\\n\\n\\t\\treturn;\\n\\t}\\n\\tint next_e_ind = MAP[make_pair(node,G[node][ind])];\\n\\tif(visited[next_e_ind])return;\\n\\n\\tSET.insert(G[node][ind]);\\n\\tPOL.push_back(point[G[node][ind]]);\\n\\tEDGES.push_back(next_e_ind);\\n\\tdfs(node,G[node][ind]);\\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\\tint num_point = 0;\\n\\tnumE = 0;\\n\\n\\tMAP.clear();\\n\\tREV.clear();\\n\\n\\tfor(int i = 0; i < SIZE; i++){\\n\\n\\t\\tV[i].clear();\\n\\t\\tG[i].clear();\\n\\t\\tON_SEG[i].clear();\\n\\t\\tCONTAIN[i].clear();\\n\\t\\tvisited[i] = false;\\n\\t}\\n\\n\\tPoint base = Point(0,0);\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%lf %lf %lf %lf\\\",&line[i].p[0].x,&line[i].p[0].y,&line[i].p[1].x,&line[i].p[1].y);\\n\\t}\\n\\n\\t//交点を全列挙\\n\\tfor(int i = 0; i < N-1; i++){\\n\\t\\tfor(int k = i+1; k < N; k++){\\n\\t\\t\\tif(!is_Cross(line[i],line[k]))continue;\\n\\n\\t\\t\\tPoint cross_p = calc_Cross_Point(line[i],line[k]);\\n\\n\\t\\t\\tbool FLG = true;\\n\\t\\t\\tfor(int a = 0; a < num_point; a++){\\n\\t\\t\\t\\tif(point[a] == cross_p){\\n\\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)continue;\\n\\n\\t\\t\\t//辺が持つ点の番号を保存\\n\\t\\t\\tCONTAIN[i].push_back(num_point);\\n\\t\\t\\tCONTAIN[k].push_back(num_point);\\n\\n\\t\\t\\t//どの辺の上に乗っているか\\n\\t\\t\\tON_SEG[num_point].push_back(i);\\n\\t\\t\\tON_SEG[num_point].push_back(k);\\n\\n\\t\\t\\tpoint[num_point++] = cross_p;\\n\\t\\t\\tV[i].push_back(cross_p);\\n\\t\\t\\tV[k].push_back(cross_p);\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < num_point; i++){\\n\\n\\t\\tDEL[i] = false;\\n\\t}\\n\\n\\n\\t//■■交点数が1なら行き止まりなので点を削除\\n\\tqueue<int> que;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tnumDEG[i] = V[i].size();\\n\\n\\t\\tif(numDEG[i] == 1){\\n\\n\\t\\t\\tint ind = CONTAIN[i][0];\\n\\n\\t\\t\\tDEL[ind] = true; //点を削除\\n\\t\\t\\tque.push(ind);\\n\\t\\t\\tnumDEG[i] = 0;\\n\\t\\t}\\n\\t}\\n\\n\\twhile(!que.empty()){\\n\\n\\t\\tint ind = que.front(); //消す点番号\\n\\t\\tque.pop();\\n\\n\\t\\tfor(int k = 0; k < ON_SEG[ind].size(); k++){\\n\\n\\t\\t\\tint seg = ON_SEG[ind][k]; //消す点が含まれている辺番号\\n\\t\\t\\tif(numDEG[seg] == 0)continue;\\n\\n\\t\\t\\tnumDEG[seg]--;\\n\\t\\t\\tif(numDEG[seg] == 1){ //■次数が0になった\\n\\t\\t\\t\\tfor(int a = 0; a < CONTAIN[seg].size(); a++){ //残っている1点を探す\\n\\n\\t\\t\\t\\t\\tint tmp_ind = CONTAIN[seg][a]; //点番号\\n\\t\\t\\t\\t\\tif(DEL[tmp_ind])continue;\\n\\n\\t\\t\\t\\t\\tDEL[tmp_ind] = true;\\n\\t\\t\\t\\t\\tnumDEG[seg] = 0;\\n\\t\\t\\t\\t\\tque.push(tmp_ind);\\n\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tif(V[i].size() <= 1)continue;\\n\\n\\t\\tsort(V[i].begin(),V[i].end());\\n\\n\\t\\tvector<int> vec; //点番号を並び順に格納\\n\\n\\t\\tfor(int k = 0; k < V[i].size(); k++){\\n\\t\\t\\tint ind = -1;\\n\\t\\t\\tfor(int a = 0; a < num_point; a++){\\n\\t\\t\\t\\tif(point[a] == V[i][k]){\\n\\n\\t\\t\\t\\t\\tind = a;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tvec.push_back(ind);\\n\\t\\t}\\n\\n\\t\\tvector<int> work;\\n\\t\\tfor(int k = 0; k < vec.size(); k++){\\n\\t\\t\\tif(!DEL[vec[k]]){\\n\\n\\t\\t\\t\\twork.push_back(vec[k]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(work.size() == 0)continue;\\n\\n\\t\\tfor(int k = 0; k < work.size()-1; k++){\\n\\n\\t\\t\\tint p = work[k];\\n\\t\\t\\tint q = work[k+1];\\n\\n\\t\\t\\t//■辺に向きをつける\\n\\t\\t\\tREV[numE] = make_pair(p,q);\\n\\t\\t\\tMAP[make_pair(p,q)] = numE++;\\n\\n\\t\\t\\tREV[numE] = make_pair(q,p);\\n\\t\\t\\tMAP[make_pair(q,p)] = numE++;\\n\\n\\t\\t\\tG[p].push_back(q);\\n\\t\\t\\tG[q].push_back(p);\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < num_point; i++){\\n\\t\\tif(G[i].size() == 0)continue;\\n\\n\\t\\tvector<pair<double,int>> work;\\n\\n\\t\\tfor(int k = 0; k < G[i].size(); k++){\\n\\n\\t\\t\\tPoint adj = point[G[i][k]]-point[i]; //■注意\\n\\t\\t\\tdouble tmp_rad = calc_rad(adj);\\n\\t\\t\\twork.push_back(make_pair(tmp_rad,k));\\n\\t\\t}\\n\\n\\t\\tsort(work.begin(),work.end());\\n\\n\\t\\tint mini_ind = work[0].second;\\n\\t\\tint maxi_ind = work.back().second;\\n\\n\\t\\tfor(int k = 0; k < G[i].size(); k++){\\n\\t\\t\\tif(k != mini_ind && k != maxi_ind)continue; //■■最も外側の隣接でないならSKIP\\n\\n\\t\\t\\tint e_ind = MAP[make_pair(i,G[i][k])];\\n\\t\\t\\tif(visited[e_ind])continue;\\n\\n\\t\\t\\tPOL.clear();\\n\\t\\t\\tSET.clear();\\n\\t\\t\\tEDGES.clear();\\n\\n\\t\\t\\tPOL.push_back(point[i]);\\n\\t\\t\\tPOL.push_back(point[G[i][k]]);\\n\\n\\t\\t\\tSET.insert(i);\\n\\t\\t\\tSET.insert(G[i][k]); //最初の2点を全探索\\n\\n\\t\\t\\tEDGES.push_back(e_ind);\\n\\n\\t\\t\\tCATCH = false;\\n\\t\\t\\tdfs(i,G[i][k]);\\n\\t\\t\\tif(CATCH){\\n\\n\\n\\t\\t\\t\\tif(contains(POL,base) == 2){\\n\\n\\t\\t\\t\\t\\tprintf(\\\"yes\\\\n\\\");\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tprintf(\\\"no\\\\n\\\");\\n}\\n\\nint main(){\\n\\n\\twhile(true){\\n\\n\\t\\tscanf(\\\"%d\\\",&N);\\n\\t\\tif(N == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 11368,\n \"score_of_the_acc\": -0.9217,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1247_8387133\",\n \"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 //オーバーフローに注意\\n#define MOD 998244353\\n//#define MOD 1000000007\\n#define EPS 0.000000001\\n\\n\\n\\n#define SIZE 30005\\n\\n\\nstruct Point{\\n\\tPoint(double arg_x,double arg_y){\\n\\t\\tx = arg_x;\\n\\t\\ty = arg_y;\\n\\t}\\n\\n\\tPoint(){\\n\\t\\tx = y = 0.0;\\n\\t}\\n\\n\\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\\n\\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\\n\\tPoint operator * (double a){ return Point(a*x,a*y); }\\n\\tPoint operator / (double a){ return Point(x/a,y/a); }\\n\\n\\tdouble abs(){ return sqrt(norm()); }\\n\\tdouble norm(){ return x*x + y*y; }\\n\\n\\tbool operator<(const Point &p) const{\\n\\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\\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\\n\\nint N;\\nLine line[SIZE];\\nPoint point[SIZE];\\nvector<Point> V[SIZE];\\nvector<int> G[SIZE],ON_SEG[SIZE],CONTAIN[SIZE],EDGES;\\nset<int> SET;\\nPolygon POL;\\nbool CATCH,DEL[SIZE],visited[SIZE];\\nmap<pair<int,int>,int> MAP;\\nint numE = 0,numDEG[SIZE];\\nmap<int,pair<int,int>> REV;\\n\\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\\n\\n//交点を求める関数\\nPoint calc_Cross_Point(double x1,double x2,double x3,double x4,double y1,double y2,double y3,double y4){\\n\\tPoint ret;\\n\\tret.x = ((x2-x1)*(y3*(x4-x3)+x3*(y3-y4))-(x4-x3)*(y1*(x2-x1)+x1*(y1-y2)))/((y2-y1)*(x4-x3)-(y4-y3)*(x2-x1));\\n\\tif(fabs(x1-x2) > EPS){\\n\\t\\tret.y = ((y2-y1)*ret.x+y1*(x2-x1)+x1*(y1-y2))/(x2-x1);\\n\\t}else{\\n\\t\\tret.y = ((y4-y3)*ret.x+y3*(x4-x3)+x3*(y3-y4))/(x4-x3);\\n\\t}\\n\\treturn ret;\\n}\\n\\n//インタフェース関数\\nPoint calc_Cross_Point(Point a,Point b,Point c,Point d){\\n\\treturn calc_Cross_Point(a.x,b.x,c.x,d.x,a.y,b.y,c.y,d.y);\\n}\\n\\nPoint calc_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\\ndouble calc_len(Vector a){\\n return sqrt(a.x*a.x+a.y*a.y);\\n}\\n\\n\\n//線分ではなく直線と点の距離\\ndouble getDistanceLP(Line l,Point p){\\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\\n}\\n\\n//点と線分の距離\\ndouble getDistanceSP(Line l,Point p){\\n\\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\\n\\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\\n\\treturn getDistanceLP(l,p);\\n}\\n\\n//線分と線分の距離\\ndouble getDistance(Line A,Line B){\\n\\tif(is_Cross(A,B))return 0.0;\\n\\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\\n\\t\\t\\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\\n}\\n\\nPoint calc_Cross_Point(Line A,Line B){\\n\\n\\tif(getDistanceSP(B,A.p[0]) < EPS){\\n\\n\\t\\treturn A.p[0];\\n\\n\\t}else if(getDistanceSP(B,A.p[1]) < EPS){\\n\\n\\t\\treturn A.p[1];\\n\\n\\t}else if(getDistanceSP(A,B.p[0]) < EPS){\\n\\n\\t\\treturn B.p[0];\\n\\n\\t}else if(getDistanceSP(A,B.p[1]) < EPS){\\n\\n\\t\\treturn B.p[1];\\n\\t}\\n\\n\\treturn calc_Cross_Point(A.p[0],A.p[1],B.p[0],B.p[1]);\\n}\\n\\n/*\\n * IN 2\\n * ON 1\\n * OUT 0\\n *\\n */\\nint contains(Polygon g,Point p){\\n\\tint n = g.size();\\n\\tbool x = false;\\n\\tfor(int i = 0; i < n; i++){\\n\\t\\tPoint a = g[i]-p,b = g[(i+1)%n]-p;\\n\\t\\tif(abs(cross(a,b)) < EPS && dot(a,b) < EPS)return 1;\\n\\t\\tif(a.y > b.y)swap(a,b);\\n\\t\\tif(a.y < EPS && EPS < b.y && cross(a,b) > EPS) x = !x;\\n\\t}\\n\\treturn (x ? 2:0);\\n}\\n\\n//2つのvectorがなすラジアンを求める関数\\ndouble calc_rad(Vector vec1,Vector vec2){\\n\\n\\tdouble tmp = dot(vec1,vec2)/(abs(vec1)*abs(vec2));\\n\\n\\tif(fabs(tmp+1.0) < EPS){\\n\\n\\t\\treturn M_PI;\\n\\t}\\n\\n\\tif(fabs(tmp-1.0) < EPS){\\n\\n\\t\\treturn 0.0;\\n\\t}\\n\\n\\treturn acos(dot(vec1,vec2)/(abs(vec1)*abs(vec2)));\\n}\\n\\n//3点がなすラジアンを求める関数(ccw(base,a,b) == CCW)\\ndouble calc_rad(Point base,Point a,Point b){\\n\\n\\tVector vec1 = b-base;\\n\\tVector vec2 = a-base;\\n\\n\\treturn calc_rad(vec1,vec2);\\n}\\n\\n\\n/*\\n * ■辺始まり辺終わりにするとWAする\\n * 点始まり点終わりにする、ただし途中で訪問した辺は再訪しない■*\\n * */\\nvoid dfs(int pre,int node){\\n\\n\\tif(CATCH)return;\\n\\n\\tPoint pre_p = point[pre];\\n\\tPoint now = point[node];\\n\\n\\tdouble maxi = -BIG_NUM;\\n\\tint ind = -1;\\n\\n\\tfor(int i = 0; i < G[node].size(); i++){\\n\\t\\tint adj = G[node][i];\\n\\t\\tif(adj == pre)continue;\\n\\n\\t\\tPoint next = point[adj];\\n\\n\\t\\tdouble tmp_rad = calc_rad(now,pre_p,next);\\n\\n\\t\\tif(maxi+EPS < tmp_rad){\\n\\n\\t\\t\\tmaxi = tmp_rad;\\n\\t\\t\\tind = i;\\n\\t\\t}\\n\\t}\\n\\n\\tif(ind == -1)return;\\n\\n\\tint next = G[node][ind];\\n\\tif(SET.count(next) > 0){\\n\\n\\t\\tCATCH = true;\\n\\t\\t//図形が完成した場合、訪問済みの辺は再訪しない\\n\\t\\tfor(int i = 0; i < EDGES.size(); i++){\\n\\n\\t\\t\\tvisited[EDGES[i]] = true;\\n\\t\\t}\\n\\n\\t\\tPolygon work;\\n\\t\\t//■■最初にnextに到達するまでの点は削除する\\n\\t\\tbool FLG = false;\\n\\t\\tfor(int i = 0; i < POL.size(); i++){\\n\\t\\t\\tif(POL[i] == point[next]){\\n\\n\\t\\t\\t\\tFLG = true;\\n\\t\\t\\t}\\n\\t\\t\\tif(!FLG)continue;\\n\\n\\t\\t\\twork.push_back(POL[i]);\\n\\t\\t}\\n\\n\\t\\tPOL.clear();\\n\\t\\tPOL = work;\\n\\n\\t\\treturn;\\n\\t}\\n\\tint next_e_ind = MAP[make_pair(node,G[node][ind])];\\n\\tif(visited[next_e_ind])return;\\n\\n\\tSET.insert(G[node][ind]);\\n\\tPOL.push_back(point[G[node][ind]]);\\n\\tEDGES.push_back(next_e_ind);\\n\\tdfs(node,G[node][ind]);\\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\\tint num_point = 0;\\n\\tnumE = 0;\\n\\n\\tMAP.clear();\\n\\tREV.clear();\\n\\n\\tfor(int i = 0; i < SIZE; i++){\\n\\n\\t\\tV[i].clear();\\n\\t\\tG[i].clear();\\n\\t\\tON_SEG[i].clear();\\n\\t\\tCONTAIN[i].clear();\\n\\t\\tvisited[i] = false;\\n\\t}\\n\\n\\tPoint base = Point(0,0);\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%lf %lf %lf %lf\\\",&line[i].p[0].x,&line[i].p[0].y,&line[i].p[1].x,&line[i].p[1].y);\\n\\t}\\n\\n\\t//交点を全列挙\\n\\tfor(int i = 0; i < N-1; i++){\\n\\t\\tfor(int k = i+1; k < N; k++){\\n\\t\\t\\tif(!is_Cross(line[i],line[k]))continue;\\n\\n\\t\\t\\tPoint cross_p = calc_Cross_Point(line[i],line[k]);\\n\\n\\t\\t\\tbool FLG = true;\\n\\t\\t\\tfor(int a = 0; a < num_point; a++){\\n\\t\\t\\t\\tif(point[a] == cross_p){\\n\\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)continue;\\n\\n\\t\\t\\t//辺が持つ点の番号を保存\\n\\t\\t\\tCONTAIN[i].push_back(num_point);\\n\\t\\t\\tCONTAIN[k].push_back(num_point);\\n\\n\\t\\t\\t//どの辺の上に乗っているか\\n\\t\\t\\tON_SEG[num_point].push_back(i);\\n\\t\\t\\tON_SEG[num_point].push_back(k);\\n\\n\\t\\t\\tpoint[num_point++] = cross_p;\\n\\t\\t\\tV[i].push_back(cross_p);\\n\\t\\t\\tV[k].push_back(cross_p);\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < num_point; i++){\\n\\n\\t\\tDEL[i] = false;\\n\\t}\\n\\n\\n\\t//■■交点数が1なら行き止まりなので点を削除\\n\\tqueue<int> que;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tnumDEG[i] = V[i].size();\\n\\n\\t\\tif(numDEG[i] == 1){\\n\\n\\t\\t\\tint ind = CONTAIN[i][0];\\n\\n\\t\\t\\tDEL[ind] = true; //点を削除\\n\\t\\t\\tque.push(ind);\\n\\t\\t\\tnumDEG[i] = 0;\\n\\t\\t}\\n\\t}\\n\\n\\twhile(!que.empty()){\\n\\n\\t\\tint ind = que.front(); //消す点番号\\n\\t\\tque.pop();\\n\\n\\t\\tfor(int k = 0; k < ON_SEG[ind].size(); k++){\\n\\n\\t\\t\\tint seg = ON_SEG[ind][k]; //消す点が含まれている辺番号\\n\\t\\t\\tif(numDEG[seg] == 0)continue;\\n\\n\\t\\t\\tnumDEG[seg]--;\\n\\t\\t\\tif(numDEG[seg] == 1){ //■次数が0になった\\n\\t\\t\\t\\tfor(int a = 0; a < CONTAIN[seg].size(); a++){ //残っている1点を探す\\n\\n\\t\\t\\t\\t\\tint tmp_ind = CONTAIN[seg][a]; //点番号\\n\\t\\t\\t\\t\\tif(DEL[tmp_ind])continue;\\n\\n\\t\\t\\t\\t\\tDEL[tmp_ind] = true;\\n\\t\\t\\t\\t\\tnumDEG[seg] = 0;\\n\\t\\t\\t\\t\\tque.push(tmp_ind);\\n\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tif(V[i].size() <= 1)continue;\\n\\n\\t\\tsort(V[i].begin(),V[i].end());\\n\\n\\t\\tvector<int> vec; //点番号を並び順に格納\\n\\n\\t\\tfor(int k = 0; k < V[i].size(); k++){\\n\\t\\t\\tint ind = -1;\\n\\t\\t\\tfor(int a = 0; a < num_point; a++){\\n\\t\\t\\t\\tif(point[a] == V[i][k]){\\n\\n\\t\\t\\t\\t\\tind = a;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tvec.push_back(ind);\\n\\t\\t}\\n\\n\\t\\tvector<int> work;\\n\\t\\tfor(int k = 0; k < vec.size(); k++){\\n\\t\\t\\tif(!DEL[vec[k]]){\\n\\n\\t\\t\\t\\twork.push_back(vec[k]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(work.size() == 0)continue;\\n\\n\\t\\tfor(int k = 0; k < work.size()-1; k++){\\n\\n\\t\\t\\tint p = work[k];\\n\\t\\t\\tint q = work[k+1];\\n\\n\\t\\t\\t//■辺に向きをつける\\n\\t\\t\\tREV[numE] = make_pair(p,q);\\n\\t\\t\\tMAP[make_pair(p,q)] = numE++;\\n\\n\\t\\t\\tREV[numE] = make_pair(q,p);\\n\\t\\t\\tMAP[make_pair(q,p)] = numE++;\\n\\n\\t\\t\\tG[p].push_back(q);\\n\\t\\t\\tG[q].push_back(p);\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < num_point; i++){\\n\\t\\tif(G[i].size() == 0)continue;\\n\\n\\t\\tvector<pair<double,int>> work;\\n\\n\\t\\tfor(int k = 0; k < G[i].size(); k++){\\n\\n\\t\\t\\tPoint adj = point[G[i][k]];\\n\\t\\t\\tdouble tmp_rad = calc_rad(adj);\\n\\t\\t\\twork.push_back(make_pair(tmp_rad,k));\\n\\t\\t}\\n\\n\\t\\tsort(work.begin(),work.end());\\n\\n\\t\\tint mini_ind = work[0].second;\\n\\t\\tint maxi_ind = work.back().second;\\n\\n\\t\\tfor(int k = 0; k < G[i].size(); k++){\\n\\t\\t\\tif(k != mini_ind && k != maxi_ind)continue; //■■最も外側の隣接でないならSKIP\\n\\n\\t\\t\\tint e_ind = MAP[make_pair(i,G[i][k])];\\n\\t\\t\\tif(visited[e_ind])continue;\\n\\n\\t\\t\\tPOL.clear();\\n\\t\\t\\tSET.clear();\\n\\t\\t\\tEDGES.clear();\\n\\n\\t\\t\\tPOL.push_back(point[i]);\\n\\t\\t\\tPOL.push_back(point[G[i][k]]);\\n\\n\\t\\t\\tSET.insert(i);\\n\\t\\t\\tSET.insert(G[i][k]); //最初の2点を全探索\\n\\n\\t\\t\\tEDGES.push_back(e_ind);\\n\\n\\t\\t\\tCATCH = false;\\n\\t\\t\\tdfs(i,G[i][k]);\\n\\t\\t\\tif(CATCH){\\n\\n\\n\\t\\t\\t\\tif(contains(POL,base) == 2){\\n\\n\\t\\t\\t\\t\\tprintf(\\\"yes\\\\n\\\");\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tprintf(\\\"no\\\\n\\\");\\n}\\n\\nint main(){\\n\\n\\twhile(true){\\n\\n\\t\\tscanf(\\\"%d\\\",&N);\\n\\t\\tif(N == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 11380,\n \"score_of_the_acc\": -0.9261,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1247_8385725\",\n \"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 //オーバーフローに注意\\n#define MOD 998244353\\n//#define MOD 1000000007\\n#define EPS 0.000000001\\n\\n\\n\\n#define SIZE 30005\\n\\n\\nstruct Point{\\n\\tPoint(double arg_x,double arg_y){\\n\\t\\tx = arg_x;\\n\\t\\ty = arg_y;\\n\\t}\\n\\n\\tPoint(){\\n\\t\\tx = y = 0.0;\\n\\t}\\n\\n\\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\\n\\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\\n\\tPoint operator * (double a){ return Point(a*x,a*y); }\\n\\tPoint operator / (double a){ return Point(x/a,y/a); }\\n\\n\\tdouble abs(){ return sqrt(norm()); }\\n\\tdouble norm(){ return x*x + y*y; }\\n\\n\\tbool operator<(const Point &p) const{\\n\\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\\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\\n\\nint N;\\nLine line[SIZE];\\nPoint point[SIZE];\\nvector<Point> V[SIZE];\\nvector<int> G[SIZE],ON_SEG[SIZE],CONTAIN[SIZE],EDGES;\\nset<int> SET;\\nPolygon POL;\\nbool CATCH,DEL[SIZE],visited[SIZE];\\nmap<pair<int,int>,int> MAP;\\nint numE = 0,numDEG[SIZE];\\nmap<int,pair<int,int>> REV;\\n\\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\\n\\n//交点を求める関数\\nPoint calc_Cross_Point(double x1,double x2,double x3,double x4,double y1,double y2,double y3,double y4){\\n\\tPoint ret;\\n\\tret.x = ((x2-x1)*(y3*(x4-x3)+x3*(y3-y4))-(x4-x3)*(y1*(x2-x1)+x1*(y1-y2)))/((y2-y1)*(x4-x3)-(y4-y3)*(x2-x1));\\n\\tif(fabs(x1-x2) > EPS){\\n\\t\\tret.y = ((y2-y1)*ret.x+y1*(x2-x1)+x1*(y1-y2))/(x2-x1);\\n\\t}else{\\n\\t\\tret.y = ((y4-y3)*ret.x+y3*(x4-x3)+x3*(y3-y4))/(x4-x3);\\n\\t}\\n\\treturn ret;\\n}\\n\\n//インタフェース関数\\nPoint calc_Cross_Point(Point a,Point b,Point c,Point d){\\n\\treturn calc_Cross_Point(a.x,b.x,c.x,d.x,a.y,b.y,c.y,d.y);\\n}\\n\\nPoint calc_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\\ndouble calc_len(Vector a){\\n return sqrt(a.x*a.x+a.y*a.y);\\n}\\n\\n\\n//線分ではなく直線と点の距離\\ndouble getDistanceLP(Line l,Point p){\\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\\n}\\n\\n//点と線分の距離\\ndouble getDistanceSP(Line l,Point p){\\n\\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\\n\\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\\n\\treturn getDistanceLP(l,p);\\n}\\n\\n//線分と線分の距離\\ndouble getDistance(Line A,Line B){\\n\\tif(is_Cross(A,B))return 0.0;\\n\\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\\n\\t\\t\\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\\n}\\n\\nPoint calc_Cross_Point(Line A,Line B){\\n\\n\\tif(getDistanceSP(B,A.p[0]) < EPS){\\n\\n\\t\\treturn A.p[0];\\n\\n\\t}else if(getDistanceSP(B,A.p[1]) < EPS){\\n\\n\\t\\treturn A.p[1];\\n\\n\\t}else if(getDistanceSP(A,B.p[0]) < EPS){\\n\\n\\t\\treturn B.p[0];\\n\\n\\t}else if(getDistanceSP(A,B.p[1]) < EPS){\\n\\n\\t\\treturn B.p[1];\\n\\t}\\n\\n\\treturn calc_Cross_Point(A.p[0],A.p[1],B.p[0],B.p[1]);\\n}\\n\\n/*\\n * IN 2\\n * ON 1\\n * OUT 0\\n *\\n */\\nint contains(Polygon g,Point p){\\n\\tint n = g.size();\\n\\tbool x = false;\\n\\tfor(int i = 0; i < n; i++){\\n\\t\\tPoint a = g[i]-p,b = g[(i+1)%n]-p;\\n\\t\\tif(abs(cross(a,b)) < EPS && dot(a,b) < EPS)return 1;\\n\\t\\tif(a.y > b.y)swap(a,b);\\n\\t\\tif(a.y < EPS && EPS < b.y && cross(a,b) > EPS) x = !x;\\n\\t}\\n\\treturn (x ? 2:0);\\n}\\n\\n//2つのvectorがなすラジアンを求める関数\\ndouble calc_rad(Vector vec1,Vector vec2){\\n\\n\\tdouble tmp = dot(vec1,vec2)/(abs(vec1)*abs(vec2));\\n\\n\\tif(fabs(tmp+1.0) < EPS){\\n\\n\\t\\treturn M_PI;\\n\\t}\\n\\n\\tif(fabs(tmp-1.0) < EPS){\\n\\n\\t\\treturn 0.0;\\n\\t}\\n\\n\\treturn acos(dot(vec1,vec2)/(abs(vec1)*abs(vec2)));\\n}\\n\\n//3点がなすラジアンを求める関数(ccw(base,a,b) == CCW)\\ndouble calc_rad(Point base,Point a,Point b){\\n\\n\\tVector vec1 = b-base;\\n\\tVector vec2 = a-base;\\n\\n\\treturn calc_rad(vec1,vec2);\\n}\\n\\n\\n/*\\n * ■辺始まり辺終わりにするとWAする\\n * 点始まり点終わりにする、ただし途中で訪問した辺は再訪しない■*\\n * */\\nvoid dfs(int pre,int node){\\n\\n\\tif(CATCH)return;\\n\\n\\tPoint pre_p = point[pre];\\n\\tPoint now = point[node];\\n\\n\\tdouble maxi = -BIG_NUM;\\n\\tint ind = -1;\\n\\n\\tfor(int i = 0; i < G[node].size(); i++){\\n\\t\\tint adj = G[node][i];\\n\\t\\tif(adj == pre)continue;\\n\\n\\t\\tPoint next = point[adj];\\n\\n\\t\\tdouble tmp_rad = calc_rad(now,pre_p,next);\\n\\n\\t\\tif(maxi+EPS < tmp_rad){\\n\\n\\t\\t\\tmaxi = tmp_rad;\\n\\t\\t\\tind = i;\\n\\t\\t}\\n\\t}\\n\\n\\tif(ind == -1)return;\\n\\n\\tint next = G[node][ind];\\n\\tif(SET.count(next) > 0){\\n\\n\\t\\tCATCH = true;\\n\\t\\t//図形が完成した場合、訪問済みの辺は再訪しない\\n\\t\\tfor(int i = 0; i < EDGES.size(); i++){\\n\\n\\t\\t\\tvisited[EDGES[i]] = true;\\n\\t\\t}\\n\\n\\t\\tPolygon work;\\n\\t\\t//■■最初にnextに到達するまでの点は削除する\\n\\t\\tbool FLG = false;\\n\\t\\tfor(int i = 0; i < POL.size(); i++){\\n\\t\\t\\tif(POL[i] == point[next]){\\n\\n\\t\\t\\t\\tFLG = true;\\n\\t\\t\\t}\\n\\t\\t\\tif(!FLG)continue;\\n\\n\\t\\t\\twork.push_back(POL[i]);\\n\\t\\t}\\n\\n\\t\\tPOL.clear();\\n\\t\\tPOL = work;\\n\\n\\t\\treturn;\\n\\t}\\n\\n\\n\\tint next_e_ind = MAP[make_pair(node,G[node][ind])];\\n\\n\\tSET.insert(G[node][ind]);\\n\\tPOL.push_back(point[G[node][ind]]);\\n\\tEDGES.push_back(next_e_ind);\\n\\tdfs(node,G[node][ind]);\\n}\\n\\nvoid func(){\\n\\n\\tint num_point = 0;\\n\\tnumE = 0;\\n\\n\\tMAP.clear();\\n\\tREV.clear();\\n\\n\\tfor(int i = 0; i < SIZE; i++){\\n\\n\\t\\tV[i].clear();\\n\\t\\tG[i].clear();\\n\\t\\tON_SEG[i].clear();\\n\\t\\tCONTAIN[i].clear();\\n\\t\\tvisited[i] = false;\\n\\t}\\n\\n\\tPoint base = Point(0,0);\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%lf %lf %lf %lf\\\",&line[i].p[0].x,&line[i].p[0].y,&line[i].p[1].x,&line[i].p[1].y);\\n\\t}\\n\\n\\t//交点を全列挙\\n\\tfor(int i = 0; i < N-1; i++){\\n\\t\\tfor(int k = i+1; k < N; k++){\\n\\t\\t\\tif(!is_Cross(line[i],line[k]))continue;\\n\\n\\t\\t\\tPoint cross_p = calc_Cross_Point(line[i],line[k]);\\n\\n\\t\\t\\tbool FLG = true;\\n\\t\\t\\tfor(int a = 0; a < num_point; a++){\\n\\t\\t\\t\\tif(point[a] == cross_p){\\n\\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)continue;\\n\\n\\t\\t\\t//辺が持つ点の番号を保存\\n\\t\\t\\tCONTAIN[i].push_back(num_point);\\n\\t\\t\\tCONTAIN[k].push_back(num_point);\\n\\n\\t\\t\\t//どの辺の上に乗っているか\\n\\t\\t\\tON_SEG[num_point].push_back(i);\\n\\t\\t\\tON_SEG[num_point].push_back(k);\\n\\n\\t\\t\\tpoint[num_point++] = cross_p;\\n\\t\\t\\tV[i].push_back(cross_p);\\n\\t\\t\\tV[k].push_back(cross_p);\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < num_point; i++){\\n\\n\\t\\tDEL[i] = false;\\n\\t}\\n\\n\\n\\t//■■交点数が1なら行き止まりなので点を削除\\n\\tqueue<int> que;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tnumDEG[i] = V[i].size();\\n\\n\\t\\tif(numDEG[i] == 1){\\n\\n\\t\\t\\tint ind = CONTAIN[i][0];\\n\\n\\t\\t\\tDEL[ind] = true; //点を削除\\n\\t\\t\\tque.push(ind);\\n\\t\\t\\tnumDEG[i] = 0;\\n\\t\\t}\\n\\t}\\n\\n\\twhile(!que.empty()){\\n\\n\\t\\tint ind = que.front(); //消す点番号\\n\\t\\tque.pop();\\n\\n\\t\\tfor(int k = 0; k < ON_SEG[ind].size(); k++){\\n\\n\\t\\t\\tint seg = ON_SEG[ind][k]; //消す点が含まれている辺番号\\n\\t\\t\\tif(numDEG[seg] == 0)continue;\\n\\n\\t\\t\\tnumDEG[seg]--;\\n\\t\\t\\tif(numDEG[seg] == 1){ //■次数が0になった\\n\\t\\t\\t\\tfor(int a = 0; a < CONTAIN[seg].size(); a++){ //残っている1点を探す\\n\\n\\t\\t\\t\\t\\tint tmp_ind = CONTAIN[seg][a]; //点番号\\n\\t\\t\\t\\t\\tif(DEL[tmp_ind])continue;\\n\\n\\t\\t\\t\\t\\tDEL[tmp_ind] = true;\\n\\t\\t\\t\\t\\tnumDEG[seg] = 0;\\n\\t\\t\\t\\t\\tque.push(tmp_ind);\\n\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tif(V[i].size() <= 1)continue;\\n\\n\\t\\tsort(V[i].begin(),V[i].end());\\n\\n\\t\\tvector<int> vec; //点番号を並び順に格納\\n\\n\\t\\tfor(int k = 0; k < V[i].size(); k++){\\n\\t\\t\\tint ind = -1;\\n\\t\\t\\tfor(int a = 0; a < num_point; a++){\\n\\t\\t\\t\\tif(point[a] == V[i][k]){\\n\\n\\t\\t\\t\\t\\tind = a;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tvec.push_back(ind);\\n\\t\\t}\\n\\n\\t\\tvector<int> work;\\n\\t\\tfor(int k = 0; k < vec.size(); k++){\\n\\t\\t\\tif(!DEL[vec[k]]){\\n\\n\\t\\t\\t\\twork.push_back(vec[k]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(work.size() == 0)continue;\\n\\n\\t\\tfor(int k = 0; k < work.size()-1; k++){\\n\\n\\t\\t\\tint p = work[k];\\n\\t\\t\\tint q = work[k+1];\\n\\n\\t\\t\\t//■辺に向きをつける\\n\\t\\t\\tREV[numE] = make_pair(p,q);\\n\\t\\t\\tMAP[make_pair(p,q)] = numE++;\\n\\n\\t\\t\\tREV[numE] = make_pair(q,p);\\n\\t\\t\\tMAP[make_pair(q,p)] = numE++;\\n\\n\\t\\t\\tG[p].push_back(q);\\n\\t\\t\\tG[q].push_back(p);\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < num_point; i++){\\n\\t\\tif(G[i].size() == 0)continue;\\n\\n\\t\\tfor(int k = 0; k < G[i].size(); k++){\\n\\n\\t\\t\\tint e_ind = MAP[make_pair(i,G[i][k])];\\n\\t\\t\\tif(visited[e_ind])continue;\\n\\n\\t\\t\\tPOL.clear();\\n\\t\\t\\tSET.clear();\\n\\t\\t\\tEDGES.clear();\\n\\n\\t\\t\\tPOL.push_back(point[i]);\\n\\t\\t\\tPOL.push_back(point[G[i][k]]);\\n\\n\\t\\t\\tSET.insert(i);\\n\\t\\t\\tSET.insert(G[i][k]); //最初の2点を全探索\\n\\n\\t\\t\\tEDGES.push_back(e_ind);\\n\\n\\t\\t\\tCATCH = false;\\n\\t\\t\\tdfs(i,G[i][k]);\\n\\t\\t\\tif(CATCH){\\n\\n\\n\\t\\t\\t\\tif(contains(POL,base) == 2){\\n\\n\\t\\t\\t\\t\\tprintf(\\\"yes\\\\n\\\");\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tprintf(\\\"no\\\\n\\\");\\n}\\n\\nint main(){\\n\\n\\twhile(true){\\n\\n\\t\\tscanf(\\\"%d\\\",&N);\\n\\t\\tif(N == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 480,\n \"memory_kb\": 11280,\n \"score_of_the_acc\": -0.956,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1247_8385719\",\n \"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 //オーバーフローに注意\\n#define MOD 998244353\\n//#define MOD 1000000007\\n#define EPS 0.000000001\\n\\n\\n\\n#define SIZE 30005\\n\\n\\nstruct Point{\\n\\tPoint(double arg_x,double arg_y){\\n\\t\\tx = arg_x;\\n\\t\\ty = arg_y;\\n\\t}\\n\\n\\tPoint(){\\n\\t\\tx = y = 0.0;\\n\\t}\\n\\n\\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\\n\\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\\n\\tPoint operator * (double a){ return Point(a*x,a*y); }\\n\\tPoint operator / (double a){ return Point(x/a,y/a); }\\n\\n\\tdouble abs(){ return sqrt(norm()); }\\n\\tdouble norm(){ return x*x + y*y; }\\n\\n\\tbool operator<(const Point &p) const{\\n\\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\\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\\n\\nint N;\\nLine line[SIZE];\\nPoint point[SIZE];\\nvector<Point> V[SIZE];\\nvector<int> G[SIZE],ON_SEG[SIZE],CONTAIN[SIZE],EDGES;\\nset<int> SET;\\nPolygon POL;\\nbool CATCH,DEL[SIZE],visited[SIZE];\\nmap<pair<int,int>,int> MAP;\\nint numE = 0,numDEG[SIZE];\\nmap<int,pair<int,int>> REV;\\n\\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\\n\\n//交点を求める関数\\nPoint calc_Cross_Point(double x1,double x2,double x3,double x4,double y1,double y2,double y3,double y4){\\n\\tPoint ret;\\n\\tret.x = ((x2-x1)*(y3*(x4-x3)+x3*(y3-y4))-(x4-x3)*(y1*(x2-x1)+x1*(y1-y2)))/((y2-y1)*(x4-x3)-(y4-y3)*(x2-x1));\\n\\tif(fabs(x1-x2) > EPS){\\n\\t\\tret.y = ((y2-y1)*ret.x+y1*(x2-x1)+x1*(y1-y2))/(x2-x1);\\n\\t}else{\\n\\t\\tret.y = ((y4-y3)*ret.x+y3*(x4-x3)+x3*(y3-y4))/(x4-x3);\\n\\t}\\n\\treturn ret;\\n}\\n\\n//インタフェース関数\\nPoint calc_Cross_Point(Point a,Point b,Point c,Point d){\\n\\treturn calc_Cross_Point(a.x,b.x,c.x,d.x,a.y,b.y,c.y,d.y);\\n}\\n\\nPoint calc_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\\ndouble calc_len(Vector a){\\n return sqrt(a.x*a.x+a.y*a.y);\\n}\\n\\n\\n//線分ではなく直線と点の距離\\ndouble getDistanceLP(Line l,Point p){\\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\\n}\\n\\n//点と線分の距離\\ndouble getDistanceSP(Line l,Point p){\\n\\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\\n\\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\\n\\treturn getDistanceLP(l,p);\\n}\\n\\n//線分と線分の距離\\ndouble getDistance(Line A,Line B){\\n\\tif(is_Cross(A,B))return 0.0;\\n\\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\\n\\t\\t\\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\\n}\\n\\nPoint calc_Cross_Point(Line A,Line B){\\n\\n\\tif(getDistanceSP(B,A.p[0]) < EPS){\\n\\n\\t\\treturn A.p[0];\\n\\n\\t}else if(getDistanceSP(B,A.p[1]) < EPS){\\n\\n\\t\\treturn A.p[1];\\n\\n\\t}else if(getDistanceSP(A,B.p[0]) < EPS){\\n\\n\\t\\treturn B.p[0];\\n\\n\\t}else if(getDistanceSP(A,B.p[1]) < EPS){\\n\\n\\t\\treturn B.p[1];\\n\\t}\\n\\n\\treturn calc_Cross_Point(A.p[0],A.p[1],B.p[0],B.p[1]);\\n}\\n\\n/*\\n * IN 2\\n * ON 1\\n * OUT 0\\n *\\n */\\nint contains(Polygon g,Point p){\\n\\tint n = g.size();\\n\\tbool x = false;\\n\\tfor(int i = 0; i < n; i++){\\n\\t\\tPoint a = g[i]-p,b = g[(i+1)%n]-p;\\n\\t\\tif(abs(cross(a,b)) < EPS && dot(a,b) < EPS)return 1;\\n\\t\\tif(a.y > b.y)swap(a,b);\\n\\t\\tif(a.y < EPS && EPS < b.y && cross(a,b) > EPS) x = !x;\\n\\t}\\n\\treturn (x ? 2:0);\\n}\\n\\n//2つのvectorがなすラジアンを求める関数\\ndouble calc_rad(Vector vec1,Vector vec2){\\n\\n\\tdouble tmp = dot(vec1,vec2)/(abs(vec1)*abs(vec2));\\n\\n\\tif(fabs(tmp+1.0) < EPS){\\n\\n\\t\\treturn M_PI;\\n\\t}\\n\\n\\tif(fabs(tmp-1.0) < EPS){\\n\\n\\t\\treturn 0.0;\\n\\t}\\n\\n\\treturn acos(dot(vec1,vec2)/(abs(vec1)*abs(vec2)));\\n}\\n\\n//3点がなすラジアンを求める関数(ccw(base,a,b) == CCW)\\ndouble calc_rad(Point base,Point a,Point b){\\n\\n\\tVector vec1 = b-base;\\n\\tVector vec2 = a-base;\\n\\n\\treturn calc_rad(vec1,vec2);\\n}\\n\\n\\n/*\\n * ■辺始まり辺終わりにするとWAする\\n * 点始まり点終わりにする、ただし途中で訪問した辺は再訪しない■*\\n * */\\nvoid dfs(int pre,int node){\\n\\n\\tif(CATCH)return;\\n\\n\\t/*if(node == start && pre != start){\\n\\n\\t\\t//図形が完成した場合、訪問済みの辺は再訪しない\\n\\t\\tfor(int i = 0; i < EDGES.size(); i++){\\n\\n\\t\\t\\tvisited[EDGES[i]] = true;\\n\\t\\t}\\n\\n\\t\\tCATCH = true;\\n\\t\\treturn;\\n\\t}*/\\n\\n\\tPoint pre_p = point[pre];\\n\\tPoint now = point[node];\\n\\n\\tdouble maxi = -BIG_NUM;\\n\\tint ind = -1;\\n\\n\\tfor(int i = 0; i < G[node].size(); i++){\\n\\t\\tint adj = G[node][i];\\n\\t\\tif(adj == pre)continue;\\n\\n\\t\\tPoint next = point[adj];\\n\\n\\t\\tdouble tmp_rad = calc_rad(now,pre_p,next);\\n\\n\\t\\tif(maxi+EPS < tmp_rad){\\n\\n\\t\\t\\tmaxi = tmp_rad;\\n\\t\\t\\tind = i;\\n\\t\\t}\\n\\t}\\n\\n\\tif(ind == -1)return;\\n\\n\\tint next = G[node][ind];\\n\\tif(SET.count(next) > 0){\\n\\n\\t\\tCATCH = true;\\n\\t\\t//図形が完成した場合、訪問済みの辺は再訪しない\\n\\t\\tfor(int i = 0; i < EDGES.size(); i++){\\n\\n\\t\\t\\tvisited[EDGES[i]] = true;\\n\\t\\t}\\n\\n\\t\\tPolygon work;\\n\\t\\t//■■最初にnextに到達するまでの点は削除する\\n\\t\\tbool FLG = false;\\n\\t\\tfor(int i = 0; i < POL.size(); i++){\\n\\t\\t\\tif(POL[i] == point[next]){\\n\\n\\t\\t\\t\\tFLG = true;\\n\\t\\t\\t}\\n\\t\\t\\tif(!FLG)continue;\\n\\n\\t\\t\\twork.push_back(POL[i]);\\n\\t\\t}\\n\\n\\t\\tPOL.clear();\\n\\t\\tPOL = work;\\n\\n\\t\\treturn;\\n\\t}\\n\\n\\n\\tint next_e_ind = MAP[make_pair(node,G[node][ind])];\\n\\n\\tSET.insert(G[node][ind]);\\n\\tPOL.push_back(point[G[node][ind]]);\\n\\tEDGES.push_back(next_e_ind);\\n\\tdfs(node,G[node][ind]);\\n}\\n\\nvoid func(){\\n\\n\\tint num_point = 0;\\n\\tnumE = 0;\\n\\n\\tMAP.clear();\\n\\tREV.clear();\\n\\n\\tfor(int i = 0; i < SIZE; i++){\\n\\n\\t\\tV[i].clear();\\n\\t\\tG[i].clear();\\n\\t\\tON_SEG[i].clear();\\n\\t\\tCONTAIN[i].clear();\\n\\t\\tvisited[i] = false;\\n\\t}\\n\\n\\tPoint base = Point(0,0);\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%lf %lf %lf %lf\\\",&line[i].p[0].x,&line[i].p[0].y,&line[i].p[1].x,&line[i].p[1].y);\\n\\t}\\n\\n\\t//交点を全列挙\\n\\tfor(int i = 0; i < N-1; i++){\\n\\t\\tfor(int k = i+1; k < N; k++){\\n\\t\\t\\tif(!is_Cross(line[i],line[k]))continue;\\n\\n\\t\\t\\tPoint cross_p = calc_Cross_Point(line[i],line[k]);\\n\\n\\t\\t\\tbool FLG = true;\\n\\t\\t\\tfor(int a = 0; a < num_point; a++){\\n\\t\\t\\t\\tif(point[a] == cross_p){\\n\\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)continue;\\n\\n\\t\\t\\t//辺が持つ点の番号を保存\\n\\t\\t\\tCONTAIN[i].push_back(num_point);\\n\\t\\t\\tCONTAIN[k].push_back(num_point);\\n\\n\\t\\t\\t//どの辺の上に乗っているか\\n\\t\\t\\tON_SEG[num_point].push_back(i);\\n\\t\\t\\tON_SEG[num_point].push_back(k);\\n\\n\\t\\t\\tpoint[num_point++] = cross_p;\\n\\t\\t\\tV[i].push_back(cross_p);\\n\\t\\t\\tV[k].push_back(cross_p);\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < num_point; i++){\\n\\n\\t\\tDEL[i] = false;\\n\\t}\\n\\n\\n\\t//■■交点数が1なら行き止まりなので点を削除\\n\\tqueue<int> que;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tnumDEG[i] = V[i].size();\\n\\n\\t\\tif(numDEG[i] == 1){\\n\\n\\t\\t\\tint ind = CONTAIN[i][0];\\n\\n\\t\\t\\tDEL[ind] = true; //点を削除\\n\\t\\t\\tque.push(ind);\\n\\t\\t\\tnumDEG[i] = 0;\\n\\t\\t}\\n\\t}\\n\\n\\twhile(!que.empty()){\\n\\n\\t\\tint ind = que.front(); //消す点番号\\n\\t\\tque.pop();\\n\\n\\t\\tfor(int k = 0; k < ON_SEG[ind].size(); k++){\\n\\n\\t\\t\\tint seg = ON_SEG[ind][k]; //消す点が含まれている辺番号\\n\\t\\t\\tif(numDEG[seg] == 0)continue;\\n\\n\\t\\t\\tnumDEG[seg]--;\\n\\t\\t\\tif(numDEG[seg] == 1){ //■次数が0になった\\n\\t\\t\\t\\tfor(int a = 0; a < CONTAIN[seg].size(); a++){ //残っている1点を探す\\n\\n\\t\\t\\t\\t\\tint tmp_ind = CONTAIN[seg][a]; //点番号\\n\\t\\t\\t\\t\\tif(DEL[tmp_ind])continue;\\n\\n\\t\\t\\t\\t\\tDEL[tmp_ind] = true;\\n\\t\\t\\t\\t\\tnumDEG[seg] = 0;\\n\\t\\t\\t\\t\\tque.push(tmp_ind);\\n\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tif(V[i].size() <= 1)continue;\\n\\n\\t\\tsort(V[i].begin(),V[i].end());\\n\\n\\t\\tvector<int> vec; //点番号を並び順に格納\\n\\n\\t\\tfor(int k = 0; k < V[i].size(); k++){\\n\\t\\t\\tint ind = -1;\\n\\t\\t\\tfor(int a = 0; a < num_point; a++){\\n\\t\\t\\t\\tif(point[a] == V[i][k]){\\n\\n\\t\\t\\t\\t\\tind = a;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tvec.push_back(ind);\\n\\t\\t}\\n\\n\\t\\tvector<int> work;\\n\\t\\tfor(int k = 0; k < vec.size(); k++){\\n\\t\\t\\tif(!DEL[vec[k]]){\\n\\n\\t\\t\\t\\twork.push_back(vec[k]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(work.size() == 0)continue;\\n\\n\\t\\tfor(int k = 0; k < work.size()-1; k++){\\n\\n\\t\\t\\tint p = work[k];\\n\\t\\t\\tint q = work[k+1];\\n\\n\\t\\t\\tREV[numE] = make_pair(p,q);\\n\\t\\t\\tMAP[make_pair(p,q)] = numE++;\\n\\n\\t\\t\\tREV[numE] = make_pair(q,p);\\n\\t\\t\\tMAP[make_pair(q,p)] = numE++;\\n\\n\\t\\t\\tG[p].push_back(q);\\n\\t\\t\\tG[q].push_back(p);\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < num_point; i++){\\n\\t\\tif(G[i].size() == 0)continue;\\n\\n\\t\\tfor(int k = 0; k < G[i].size(); k++){\\n\\n\\t\\t\\tint e_ind = MAP[make_pair(i,G[i][k])];\\n\\t\\t\\tif(visited[e_ind])continue;\\n\\n\\t\\t\\tPOL.clear();\\n\\t\\t\\tSET.clear();\\n\\t\\t\\tEDGES.clear();\\n\\n\\t\\t\\tPOL.push_back(point[i]);\\n\\t\\t\\tPOL.push_back(point[G[i][k]]);\\n\\n\\t\\t\\tSET.insert(i);\\n\\t\\t\\tSET.insert(G[i][k]); //最初の2点を全探索\\n\\n\\t\\t\\tEDGES.push_back(e_ind);\\n\\n\\t\\t\\tCATCH = false;\\n\\t\\t\\tdfs(i,G[i][k]);\\n\\t\\t\\tif(CATCH){\\n\\n\\n\\t\\t\\t\\tif(contains(POL,base) == 2){\\n\\n\\t\\t\\t\\t\\tprintf(\\\"yes\\\\n\\\");\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tprintf(\\\"no\\\\n\\\");\\n}\\n\\nint main(){\\n\\n\\twhile(true){\\n\\n\\t\\tscanf(\\\"%d\\\",&N);\\n\\t\\tif(N == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 480,\n \"memory_kb\": 11164,\n \"score_of_the_acc\": -0.9431,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1247_8385708\",\n \"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 //オーバーフローに注意\\n#define MOD 998244353\\n//#define MOD 1000000007\\n#define EPS 0.000000001\\n\\n\\n\\n#define SIZE 30005\\n\\n\\nstruct Point{\\n\\tPoint(double arg_x,double arg_y){\\n\\t\\tx = arg_x;\\n\\t\\ty = arg_y;\\n\\t}\\n\\n\\tPoint(){\\n\\t\\tx = y = 0.0;\\n\\t}\\n\\n\\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\\n\\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\\n\\tPoint operator * (double a){ return Point(a*x,a*y); }\\n\\tPoint operator / (double a){ return Point(x/a,y/a); }\\n\\n\\tdouble abs(){ return sqrt(norm()); }\\n\\tdouble norm(){ return x*x + y*y; }\\n\\n\\tbool operator<(const Point &p) const{\\n\\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\\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\\n\\nint N;\\nLine line[SIZE];\\nPoint point[SIZE];\\nvector<Point> V[SIZE];\\nvector<int> G[SIZE],ON_SEG[SIZE],CONTAIN[SIZE],EDGES;\\nset<int> SET;\\nPolygon POL;\\nbool CATCH,DEL[SIZE],visited[SIZE];\\nmap<pair<int,int>,int> MAP;\\nint numE = 0,numDEG[SIZE];\\nmap<int,pair<int,int>> REV;\\n\\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\\n\\n//交点を求める関数\\nPoint calc_Cross_Point(double x1,double x2,double x3,double x4,double y1,double y2,double y3,double y4){\\n\\tPoint ret;\\n\\tret.x = ((x2-x1)*(y3*(x4-x3)+x3*(y3-y4))-(x4-x3)*(y1*(x2-x1)+x1*(y1-y2)))/((y2-y1)*(x4-x3)-(y4-y3)*(x2-x1));\\n\\tif(fabs(x1-x2) > EPS){\\n\\t\\tret.y = ((y2-y1)*ret.x+y1*(x2-x1)+x1*(y1-y2))/(x2-x1);\\n\\t}else{\\n\\t\\tret.y = ((y4-y3)*ret.x+y3*(x4-x3)+x3*(y3-y4))/(x4-x3);\\n\\t}\\n\\treturn ret;\\n}\\n\\n//インタフェース関数\\nPoint calc_Cross_Point(Point a,Point b,Point c,Point d){\\n\\treturn calc_Cross_Point(a.x,b.x,c.x,d.x,a.y,b.y,c.y,d.y);\\n}\\n\\nPoint calc_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\\ndouble calc_len(Vector a){\\n return sqrt(a.x*a.x+a.y*a.y);\\n}\\n\\n\\n//線分ではなく直線と点の距離\\ndouble getDistanceLP(Line l,Point p){\\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\\n}\\n\\n//点と線分の距離\\ndouble getDistanceSP(Line l,Point p){\\n\\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\\n\\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\\n\\treturn getDistanceLP(l,p);\\n}\\n\\n//線分と線分の距離\\ndouble getDistance(Line A,Line B){\\n\\tif(is_Cross(A,B))return 0.0;\\n\\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\\n\\t\\t\\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\\n}\\n\\nPoint calc_Cross_Point(Line A,Line B){\\n\\n\\tif(getDistanceSP(B,A.p[0]) < EPS){\\n\\n\\t\\treturn A.p[0];\\n\\n\\t}else if(getDistanceSP(B,A.p[1]) < EPS){\\n\\n\\t\\treturn A.p[1];\\n\\n\\t}else if(getDistanceSP(A,B.p[0]) < EPS){\\n\\n\\t\\treturn B.p[0];\\n\\n\\t}else if(getDistanceSP(A,B.p[1]) < EPS){\\n\\n\\t\\treturn B.p[1];\\n\\t}\\n\\n\\treturn calc_Cross_Point(A.p[0],A.p[1],B.p[0],B.p[1]);\\n}\\n\\n/*\\n * IN 2\\n * ON 1\\n * OUT 0\\n *\\n */\\nint contains(Polygon g,Point p){\\n\\tint n = g.size();\\n\\tbool x = false;\\n\\tfor(int i = 0; i < n; i++){\\n\\t\\tPoint a = g[i]-p,b = g[(i+1)%n]-p;\\n\\t\\tif(abs(cross(a,b)) < EPS && dot(a,b) < EPS)return 1;\\n\\t\\tif(a.y > b.y)swap(a,b);\\n\\t\\tif(a.y < EPS && EPS < b.y && cross(a,b) > EPS) x = !x;\\n\\t}\\n\\treturn (x ? 2:0);\\n}\\n\\n//2つのvectorがなすラジアンを求める関数\\ndouble calc_rad(Vector vec1,Vector vec2){\\n\\n\\tdouble tmp = dot(vec1,vec2)/(abs(vec1)*abs(vec2));\\n\\n\\tif(fabs(tmp+1.0) < EPS){\\n\\n\\t\\treturn M_PI;\\n\\t}\\n\\n\\tif(fabs(tmp-1.0) < EPS){\\n\\n\\t\\treturn 0.0;\\n\\t}\\n\\n\\treturn acos(dot(vec1,vec2)/(abs(vec1)*abs(vec2)));\\n}\\n\\n//3点がなすラジアンを求める関数(ccw(base,a,b) == CCW)\\ndouble calc_rad(Point base,Point a,Point b){\\n\\n\\tVector vec1 = b-base;\\n\\tVector vec2 = a-base;\\n\\n\\treturn calc_rad(vec1,vec2);\\n}\\n\\n\\nvoid dfs(int start,int pre,int node){\\n\\n\\tif(CATCH)return;\\n\\n\\tif(node == start && pre != start){\\n\\n\\t\\t//図形が完成した場合、訪問済みの両端点は再訪しない\\n\\t\\tfor(int i = 0; i < EDGES.size(); i++){\\n\\n\\t\\t\\tvisited[EDGES[i]] = true;\\n\\t\\t}\\n\\n\\t\\tCATCH = true;\\n\\t\\treturn;\\n\\t}\\n\\n\\tPoint pre_p = point[pre];\\n\\tPoint now = point[node];\\n\\n\\tdouble maxi = -BIG_NUM;\\n\\tint ind = -1;\\n\\n\\tfor(int i = 0; i < G[node].size(); i++){\\n\\t\\tint adj = G[node][i];\\n\\t\\tif(adj == pre)continue;\\n\\n\\t\\tif(adj != start && SET.count(adj) > 0)continue;\\n\\t\\tif(adj == start && pre == start)continue;\\n\\n\\t\\tPoint next = point[adj];\\n\\n\\t\\tdouble tmp_rad = calc_rad(now,pre_p,next);\\n\\n\\t\\tif(maxi+EPS < tmp_rad){\\n\\n\\t\\t\\tmaxi = tmp_rad;\\n\\t\\t\\tind = i;\\n\\t\\t}\\n\\t}\\n\\n\\tif(ind == -1)return;\\n\\n\\tint next_e_ind = MAP[make_pair(node,G[node][ind])];\\n\\n\\tSET.insert(G[node][ind]);\\n\\tPOL.push_back(point[G[node][ind]]);\\n\\tEDGES.push_back(next_e_ind);\\n\\tdfs(start,node,G[node][ind]);\\n}\\n\\nvoid func(){\\n\\n\\tint num_point = 0;\\n\\tnumE = 0;\\n\\n\\tMAP.clear();\\n\\tREV.clear();\\n\\n\\tfor(int i = 0; i < SIZE; i++){\\n\\n\\t\\tV[i].clear();\\n\\t\\tG[i].clear();\\n\\t\\tON_SEG[i].clear();\\n\\t\\tCONTAIN[i].clear();\\n\\t\\tvisited[i] = false;\\n\\t}\\n\\n\\tPoint base = Point(0,0);\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%lf %lf %lf %lf\\\",&line[i].p[0].x,&line[i].p[0].y,&line[i].p[1].x,&line[i].p[1].y);\\n\\t}\\n\\n\\t//交点を全列挙\\n\\tfor(int i = 0; i < N-1; i++){\\n\\t\\tfor(int k = i+1; k < N; k++){\\n\\t\\t\\tif(!is_Cross(line[i],line[k]))continue;\\n\\n\\t\\t\\tPoint cross_p = calc_Cross_Point(line[i],line[k]);\\n\\n\\t\\t\\tbool FLG = true;\\n\\t\\t\\tfor(int a = 0; a < num_point; a++){\\n\\t\\t\\t\\tif(point[a] == cross_p){\\n\\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)continue;\\n\\n\\t\\t\\t//辺が持つ点の番号を保存\\n\\t\\t\\tCONTAIN[i].push_back(num_point);\\n\\t\\t\\tCONTAIN[k].push_back(num_point);\\n\\n\\t\\t\\t//どの辺の上に乗っているか\\n\\t\\t\\tON_SEG[num_point].push_back(i);\\n\\t\\t\\tON_SEG[num_point].push_back(k);\\n\\n\\t\\t\\tpoint[num_point++] = cross_p;\\n\\t\\t\\tV[i].push_back(cross_p);\\n\\t\\t\\tV[k].push_back(cross_p);\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < num_point; i++){\\n\\n\\t\\tDEL[i] = false;\\n\\t}\\n\\n\\n\\t//■■交点数が1なら行き止まりなので点を削除\\n\\tqueue<int> que;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tnumDEG[i] = V[i].size();\\n\\n\\t\\tif(numDEG[i] == 1){\\n\\n\\t\\t\\tint ind = CONTAIN[i][0];\\n\\n\\t\\t\\tDEL[ind] = true; //点を削除\\n\\t\\t\\tque.push(ind);\\n\\t\\t\\tnumDEG[i] = 0;\\n\\t\\t}\\n\\t}\\n\\n\\twhile(!que.empty()){\\n\\n\\t\\tint ind = que.front(); //消す点番号\\n\\t\\tque.pop();\\n\\n\\t\\tfor(int k = 0; k < ON_SEG[ind].size(); k++){\\n\\n\\t\\t\\tint seg = ON_SEG[ind][k]; //消す点が含まれている辺番号\\n\\t\\t\\tif(numDEG[seg] == 0)continue;\\n\\n\\t\\t\\tnumDEG[seg]--;\\n\\t\\t\\tif(numDEG[seg] == 1){ //■次数が0になった\\n\\t\\t\\t\\tfor(int a = 0; a < CONTAIN[seg].size(); a++){ //残っている1点を探す\\n\\n\\t\\t\\t\\t\\tint tmp_ind = CONTAIN[seg][a]; //点番号\\n\\t\\t\\t\\t\\tif(DEL[tmp_ind])continue;\\n\\n\\t\\t\\t\\t\\tDEL[tmp_ind] = true;\\n\\t\\t\\t\\t\\tnumDEG[seg] = 0;\\n\\t\\t\\t\\t\\tque.push(tmp_ind);\\n\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tif(V[i].size() <= 1)continue;\\n\\n\\t\\tsort(V[i].begin(),V[i].end());\\n\\n\\t\\tvector<int> vec; //点番号を並び順に格納\\n\\n\\t\\tfor(int k = 0; k < V[i].size(); k++){\\n\\t\\t\\tint ind = -1;\\n\\t\\t\\tfor(int a = 0; a < num_point; a++){\\n\\t\\t\\t\\tif(point[a] == V[i][k]){\\n\\n\\t\\t\\t\\t\\tind = a;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tvec.push_back(ind);\\n\\t\\t}\\n\\n\\t\\tvector<int> work;\\n\\t\\tfor(int k = 0; k < vec.size(); k++){\\n\\t\\t\\tif(!DEL[vec[k]]){\\n\\n\\t\\t\\t\\twork.push_back(vec[k]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(work.size() == 0)continue;\\n\\n\\t\\tfor(int k = 0; k < work.size()-1; k++){\\n\\n\\t\\t\\tint p = work[k];\\n\\t\\t\\tint q = work[k+1];\\n\\n\\t\\t\\tREV[numE] = make_pair(p,q);\\n\\t\\t\\tMAP[make_pair(p,q)] = numE++;\\n\\n\\t\\t\\tREV[numE] = make_pair(q,p);\\n\\t\\t\\tMAP[make_pair(q,p)] = numE++;\\n\\n\\t\\t\\tG[p].push_back(q);\\n\\t\\t\\tG[q].push_back(p);\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < num_point; i++){\\n\\t\\tif(G[i].size() == 0)continue;\\n\\n\\t\\tfor(int k = 0; k < G[i].size(); k++){\\n\\n\\t\\t\\tint e_ind = MAP[make_pair(i,G[i][k])];\\n\\t\\t\\tif(visited[e_ind])continue;\\n\\n\\t\\t\\tPOL.clear();\\n\\t\\t\\tSET.clear();\\n\\t\\t\\tEDGES.clear();\\n\\n\\t\\t\\tPOL.push_back(point[i]);\\n\\t\\t\\tPOL.push_back(point[G[i][k]]);\\n\\n\\t\\t\\tSET.insert(i);\\n\\t\\t\\tSET.insert(G[i][k]); //最初の2点を全探索\\n\\n\\t\\t\\tEDGES.push_back(e_ind);\\n\\n\\t\\t\\tCATCH = false;\\n\\t\\t\\tdfs(i,i,G[i][k]);\\n\\t\\t\\tif(CATCH){\\n\\n\\n\\t\\t\\t\\tif(contains(POL,base) == 2){\\n\\n\\t\\t\\t\\t\\tprintf(\\\"yes\\\\n\\\");\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tprintf(\\\"no\\\\n\\\");\\n}\\n\\nint main(){\\n\\n\\twhile(true){\\n\\n\\t\\tscanf(\\\"%d\\\",&N);\\n\\t\\tif(N == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3750,\n \"memory_kb\": 12288,\n \"score_of_the_acc\": -1.5671,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1247_8385265\",\n \"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 //オーバーフローに注意\\n#define MOD 998244353\\n//#define MOD 1000000007\\n#define EPS 0.000000001\\n\\n\\n\\n#define SIZE 10005\\n\\n\\nstruct Point{\\n\\tPoint(double arg_x,double arg_y){\\n\\t\\tx = arg_x;\\n\\t\\ty = arg_y;\\n\\t}\\n\\n\\tPoint(){\\n\\t\\tx = y = 0.0;\\n\\t}\\n\\n\\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\\n\\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\\n\\tPoint operator * (double a){ return Point(a*x,a*y); }\\n\\tPoint operator / (double a){ return Point(x/a,y/a); }\\n\\n\\tdouble abs(){ return sqrt(norm()); }\\n\\tdouble norm(){ return x*x + y*y; }\\n\\n\\tbool operator<(const Point &p) const{\\n\\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\\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\\n\\nint N;\\nLine line[SIZE];\\nPoint point[SIZE];\\nvector<Point> V[SIZE];\\nvector<int> G[SIZE],ON_SEG[SIZE],CONTAIN[SIZE];\\nset<int> SET;\\nPolygon POL;\\nbool CATCH,DEL[SIZE],visited[SIZE];\\nmap<pair<int,int>,int> MAP;\\nint numE = 0,numDEG[SIZE];\\n\\n\\ndouble norm(Vector a){\\n\\treturn a.x*a.x+a.y*a.y;\\n}\\n\\ndouble abs(Vector a){\\n\\treturn sqrt(norm(a));\\n}\\n\\ndouble cross(Vector a,Vector b){\\n return a.x*b.y-a.y*b.x;\\n}\\n\\ndouble dot(Vector a,Vector b){\\n return a.x*b.x + a.y*b.y;\\n}\\n\\nstatic const int COUNTER_CLOCKWISE = 1;\\nstatic const int CLOCKWISE = -1;\\nstatic const int ONLINE_BACK = 2;\\nstatic const int ONLINE_FRONT = -2;\\nstatic const int ON_SEGMENT = 0;\\n\\n/*\\n * p0を基準点として、p1から見てp2が\\n * 反時計回り側にあれば\\n * COUNTER_CLOCKWISE\\n * */\\nint ccw(Point p0,Point p1,Point p2){\\n\\n\\tVector a = p1 - p0;\\n\\tVector b = p2 - p0;\\n\\n\\tif(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\\n\\tif(cross(a,b) < -EPS)return CLOCKWISE;\\n\\tif(dot(a,b) < -EPS)return ONLINE_BACK;\\n\\tif(a.norm() < b.norm())return ONLINE_FRONT;\\n\\n\\treturn ON_SEGMENT;\\n}\\n\\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\\n\\n//交点を求める関数\\nPoint calc_Cross_Point(double x1,double x2,double x3,double x4,double y1,double y2,double y3,double y4){\\n\\tPoint ret;\\n\\tret.x = ((x2-x1)*(y3*(x4-x3)+x3*(y3-y4))-(x4-x3)*(y1*(x2-x1)+x1*(y1-y2)))/((y2-y1)*(x4-x3)-(y4-y3)*(x2-x1));\\n\\tif(fabs(x1-x2) > EPS){\\n\\t\\tret.y = ((y2-y1)*ret.x+y1*(x2-x1)+x1*(y1-y2))/(x2-x1);\\n\\t}else{\\n\\t\\tret.y = ((y4-y3)*ret.x+y3*(x4-x3)+x3*(y3-y4))/(x4-x3);\\n\\t}\\n\\treturn ret;\\n}\\n\\n//インタフェース関数\\nPoint calc_Cross_Point(Point a,Point b,Point c,Point d){\\n\\treturn calc_Cross_Point(a.x,b.x,c.x,d.x,a.y,b.y,c.y,d.y);\\n}\\n\\nPoint calc_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\\ndouble calc_len(Vector a){\\n return sqrt(a.x*a.x+a.y*a.y);\\n}\\n\\n\\n//線分ではなく直線と点の距離\\ndouble getDistanceLP(Line l,Point p){\\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\\n}\\n\\n//点と線分の距離\\ndouble getDistanceSP(Line l,Point p){\\n\\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\\n\\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\\n\\treturn getDistanceLP(l,p);\\n}\\n\\n//線分と線分の距離\\ndouble getDistance(Line A,Line B){\\n\\tif(is_Cross(A,B))return 0.0;\\n\\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\\n\\t\\t\\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\\n}\\n\\nPoint calc_Cross_Point(Line A,Line B){\\n\\n\\tif(getDistanceSP(B,A.p[0]) < EPS){\\n\\n\\t\\treturn A.p[0];\\n\\n\\t}else if(getDistanceSP(B,A.p[1]) < EPS){\\n\\n\\t\\treturn A.p[1];\\n\\n\\t}else if(getDistanceSP(A,B.p[0]) < EPS){\\n\\n\\t\\treturn B.p[0];\\n\\n\\t}else if(getDistanceSP(A,B.p[1]) < EPS){\\n\\n\\t\\treturn B.p[1];\\n\\t}\\n\\n\\treturn calc_Cross_Point(A.p[0],A.p[1],B.p[0],B.p[1]);\\n}\\n\\n/*\\n * IN 2\\n * ON 1\\n * OUT 0\\n *\\n */\\nint contains(Polygon g,Point p){\\n\\tint n = g.size();\\n\\tbool x = false;\\n\\tfor(int i = 0; i < n; i++){\\n\\t\\tPoint a = g[i]-p,b = g[(i+1)%n]-p;\\n\\t\\tif(abs(cross(a,b)) < EPS && dot(a,b) < EPS)return 1;\\n\\t\\tif(a.y > b.y)swap(a,b);\\n\\t\\tif(a.y < EPS && EPS < b.y && cross(a,b) > EPS) x = !x;\\n\\t}\\n\\treturn (x ? 2:0);\\n}\\n\\n//2つのvectorがなすラジアンを求める関数\\ndouble calc_rad(Vector vec1,Vector vec2){\\n\\n\\tdouble tmp = dot(vec1,vec2)/(abs(vec1)*abs(vec2));\\n\\n\\tif(fabs(tmp+1.0) < EPS){\\n\\n\\t\\treturn M_PI;\\n\\t}\\n\\n\\tif(fabs(tmp-1.0) < EPS){\\n\\n\\t\\treturn 0.0;\\n\\t}\\n\\n\\treturn acos(dot(vec1,vec2)/(abs(vec1)*abs(vec2)));\\n}\\n\\n//3点がなすラジアンを求める関数(ccw(base,a,b) == CCW)\\ndouble calc_rad(Point base,Point a,Point b){\\n\\n\\tVector vec1 = b-base;\\n\\tVector vec2 = a-base;\\n\\n\\treturn calc_rad(vec1,vec2);\\n}\\n\\n\\nvoid dfs(int start,int pre,int node){\\n\\n\\tif(CATCH)return;\\n\\n\\tif(node == start && pre != start){\\n\\n\\t\\tCATCH = true;\\n\\t\\treturn;\\n\\t}\\n\\n\\tPoint pre_p = point[pre];\\n\\tPoint now = point[node];\\n\\n\\tdouble maxi = -BIG_NUM;\\n\\tint ind = -1;\\n\\n\\tfor(int i = 0; i < G[node].size(); i++){\\n\\t\\tint adj = G[node][i];\\n\\t\\tif(adj == pre)continue;\\n\\n\\t\\tif(adj != start && SET.count(adj) > 0)continue;\\n\\t\\tif(adj == start && pre == start)continue;\\n\\n\\t\\tPoint next = point[adj];\\n\\n\\t\\tdouble tmp_rad = calc_rad(now,pre_p,next);\\n\\n\\t\\tif(maxi+EPS < tmp_rad){\\n\\n\\t\\t\\tmaxi = tmp_rad;\\n\\t\\t\\tind = i;\\n\\t\\t}\\n\\t}\\n\\n\\tif(ind == -1)return;\\n\\n\\tSET.insert(G[node][ind]);\\n\\tPOL.push_back(point[G[node][ind]]);\\n\\tdfs(start,node,G[node][ind]);\\n}\\n\\nvoid func(){\\n\\n\\tint num_point = 0;\\n\\tfor(int i = 0; i < SIZE; i++){\\n\\n\\t\\tV[i].clear();\\n\\t\\tG[i].clear();\\n\\t\\tON_SEG[i].clear();\\n\\t\\tCONTAIN[i].clear();\\n\\t}\\n\\n\\tPoint base = Point(0,0);\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%lf %lf %lf %lf\\\",&line[i].p[0].x,&line[i].p[0].y,&line[i].p[1].x,&line[i].p[1].y);\\n\\t}\\n\\n\\t//交点を全列挙\\n\\tfor(int i = 0; i < N-1; i++){\\n\\t\\tfor(int k = i+1; k < N; k++){\\n\\t\\t\\tif(!is_Cross(line[i],line[k]))continue;\\n\\n\\t\\t\\tPoint cross_p = calc_Cross_Point(line[i],line[k]);\\n\\n\\t\\t\\tbool FLG = true;\\n\\t\\t\\tfor(int a = 0; a < num_point; a++){\\n\\t\\t\\t\\tif(point[a] == cross_p){\\n\\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)continue;\\n\\n\\t\\t\\t//辺が持つ点の番号を保存\\n\\t\\t\\tCONTAIN[i].push_back(num_point);\\n\\t\\t\\tCONTAIN[k].push_back(num_point);\\n\\n\\t\\t\\t//どの辺の上に乗っているか\\n\\t\\t\\tON_SEG[num_point].push_back(i);\\n\\t\\t\\tON_SEG[num_point].push_back(k);\\n\\n\\t\\t\\tpoint[num_point++] = cross_p;\\n\\t\\t\\tV[i].push_back(cross_p);\\n\\t\\t\\tV[k].push_back(cross_p);\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < num_point; i++){\\n\\n\\t\\tDEL[i] = false;\\n\\t}\\n\\n\\n\\t//■■交点数が1なら行き止まりなので点を削除\\n\\tqueue<int> que;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tnumDEG[i] = V[i].size();\\n\\n\\t\\tif(numDEG[i] == 1){\\n\\n\\t\\t\\tint ind = CONTAIN[i][0];\\n\\n\\t\\t\\tDEL[ind] = true; //点を削除\\n\\t\\t\\tque.push(ind);\\n\\t\\t\\tnumDEG[i] = 0;\\n\\t\\t}\\n\\t}\\n\\n\\twhile(!que.empty()){\\n\\n\\t\\tint ind = que.front(); //消す点番号\\n\\t\\tque.pop();\\n\\n\\t\\tfor(int k = 0; k < ON_SEG[ind].size(); k++){\\n\\n\\t\\t\\tint seg = ON_SEG[ind][k]; //消す点が含まれている辺番号\\n\\t\\t\\tif(numDEG[seg] == 0)continue;\\n\\n\\t\\t\\tnumDEG[seg]--;\\n\\t\\t\\tif(numDEG[seg] == 1){ //■次数が0になった\\n\\t\\t\\t\\tfor(int a = 0; a < CONTAIN[seg].size(); a++){ //残っている1点を探す\\n\\n\\t\\t\\t\\t\\tint tmp_ind = CONTAIN[seg][a]; //点番号\\n\\t\\t\\t\\t\\tif(DEL[tmp_ind])continue;\\n\\n\\t\\t\\t\\t\\tDEL[tmp_ind] = true;\\n\\t\\t\\t\\t\\tnumDEG[seg] = 0;\\n\\t\\t\\t\\t\\tque.push(tmp_ind);\\n\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tif(V[i].size() <= 1)continue;\\n\\n\\t\\tsort(V[i].begin(),V[i].end());\\n\\n\\t\\tvector<int> vec; //点番号を並び順に格納\\n\\n\\t\\tfor(int k = 0; k < V[i].size(); k++){\\n\\t\\t\\tint ind = -1;\\n\\t\\t\\tfor(int a = 0; a < num_point; a++){\\n\\t\\t\\t\\tif(point[a] == V[i][k]){\\n\\n\\t\\t\\t\\t\\tind = a;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tvec.push_back(ind);\\n\\t\\t}\\n\\n\\t\\tvector<int> work;\\n\\t\\tfor(int k = 0; k < vec.size(); k++){\\n\\t\\t\\tif(!DEL[vec[k]]){\\n\\n\\t\\t\\t\\twork.push_back(vec[k]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(work.size() == 0)continue;\\n\\n\\t\\tfor(int k = 0; k < work.size()-1; k++){\\n\\n\\t\\t\\tint p = work[k];\\n\\t\\t\\tint q = work[k+1];\\n\\n\\t\\t\\tG[p].push_back(q);\\n\\t\\t\\tG[q].push_back(p);\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < num_point; i++){\\n\\t\\tif(G[i].size() == 0)continue;\\n\\n\\t\\tfor(int k = 0; k < G[i].size(); k++){\\n\\n\\t\\t\\tPOL.clear();\\n\\t\\t\\tSET.clear();\\n\\n\\t\\t\\tPOL.push_back(point[i]);\\n\\t\\t\\tPOL.push_back(point[G[i][k]]);\\n\\n\\t\\t\\tSET.insert(i);\\n\\t\\t\\tSET.insert(G[i][k]); //最初の2点を全探索\\n\\n\\t\\t\\tCATCH = false;\\n\\t\\t\\tdfs(i,i,G[i][k]);\\n\\t\\t\\tif(CATCH){\\n\\n\\n\\t\\t\\t\\tif(contains(POL,base) == 2){\\n\\n\\t\\t\\t\\t\\tprintf(\\\"yes\\\\n\\\");\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tprintf(\\\"no\\\\n\\\");\\n}\\n\\nint main(){\\n\\n\\twhile(true){\\n\\n\\t\\tscanf(\\\"%d\\\",&N);\\n\\t\\tif(N == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6590,\n \"memory_kb\": 5680,\n \"score_of_the_acc\": -1.2622,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1247_8367553\",\n \"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 //オーバーフローに注意\\n#define MOD 998244353\\n//#define MOD 1000000007\\n#define EPS 0.000000001\\n\\n\\n\\n#define SIZE 10005\\n\\n\\nstruct Point{\\n\\tPoint(double arg_x,double arg_y){\\n\\t\\tx = arg_x;\\n\\t\\ty = arg_y;\\n\\t}\\n\\n\\tPoint(){\\n\\t\\tx = y = 0.0;\\n\\t}\\n\\n\\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\\n\\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\\n\\tPoint operator * (double a){ return Point(a*x,a*y); }\\n\\tPoint operator / (double a){ return Point(x/a,y/a); }\\n\\n\\tdouble abs(){ return sqrt(norm()); }\\n\\tdouble norm(){ return x*x + y*y; }\\n\\n\\tbool operator<(const Point &p) const{\\n\\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\\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\\n\\nint N;\\nLine line[SIZE];\\nPoint point[SIZE];\\nvector<Point> V[SIZE];\\nvector<int> G[SIZE];\\nset<int> SET;\\nPolygon POL;\\nbool CATCH,DEL[SIZE];\\n\\n\\ndouble norm(Vector a){\\n\\treturn a.x*a.x+a.y*a.y;\\n}\\n\\ndouble abs(Vector a){\\n\\treturn sqrt(norm(a));\\n}\\n\\ndouble cross(Vector a,Vector b){\\n return a.x*b.y-a.y*b.x;\\n}\\n\\ndouble dot(Vector a,Vector b){\\n return a.x*b.x + a.y*b.y;\\n}\\n\\nstatic const int COUNTER_CLOCKWISE = 1;\\nstatic const int CLOCKWISE = -1;\\nstatic const int ONLINE_BACK = 2;\\nstatic const int ONLINE_FRONT = -2;\\nstatic const int ON_SEGMENT = 0;\\n\\n/*\\n * p0を基準点として、p1から見てp2が\\n * 反時計回り側にあれば\\n * COUNTER_CLOCKWISE\\n * */\\nint ccw(Point p0,Point p1,Point p2){\\n\\n\\tVector a = p1 - p0;\\n\\tVector b = p2 - p0;\\n\\n\\tif(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\\n\\tif(cross(a,b) < -EPS)return CLOCKWISE;\\n\\tif(dot(a,b) < -EPS)return ONLINE_BACK;\\n\\tif(a.norm() < b.norm())return ONLINE_FRONT;\\n\\n\\treturn ON_SEGMENT;\\n}\\n\\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\\n\\n//交点を求める関数\\nPoint calc_Cross_Point(double x1,double x2,double x3,double x4,double y1,double y2,double y3,double y4){\\n\\tPoint ret;\\n\\tret.x = ((x2-x1)*(y3*(x4-x3)+x3*(y3-y4))-(x4-x3)*(y1*(x2-x1)+x1*(y1-y2)))/((y2-y1)*(x4-x3)-(y4-y3)*(x2-x1));\\n\\tif(fabs(x1-x2) > EPS){\\n\\t\\tret.y = ((y2-y1)*ret.x+y1*(x2-x1)+x1*(y1-y2))/(x2-x1);\\n\\t}else{\\n\\t\\tret.y = ((y4-y3)*ret.x+y3*(x4-x3)+x3*(y3-y4))/(x4-x3);\\n\\t}\\n\\treturn ret;\\n}\\n\\n//インタフェース関数\\nPoint calc_Cross_Point(Point a,Point b,Point c,Point d){\\n\\treturn calc_Cross_Point(a.x,b.x,c.x,d.x,a.y,b.y,c.y,d.y);\\n}\\n\\nPoint calc_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\\ndouble calc_len(Vector a){\\n return sqrt(a.x*a.x+a.y*a.y);\\n}\\n\\n\\n//線分ではなく直線と点の距離\\ndouble getDistanceLP(Line l,Point p){\\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\\n}\\n\\n//点と線分の距離\\ndouble getDistanceSP(Line l,Point p){\\n\\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\\n\\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\\n\\treturn getDistanceLP(l,p);\\n}\\n\\n//線分と線分の距離\\ndouble getDistance(Line A,Line B){\\n\\tif(is_Cross(A,B))return 0.0;\\n\\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\\n\\t\\t\\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\\n}\\n\\nPoint calc_Cross_Point(Line A,Line B){\\n\\n\\tif(getDistanceSP(B,A.p[0]) < EPS){\\n\\n\\t\\treturn A.p[0];\\n\\n\\t}else if(getDistanceSP(B,A.p[1]) < EPS){\\n\\n\\t\\treturn A.p[1];\\n\\n\\t}else if(getDistanceSP(A,B.p[0]) < EPS){\\n\\n\\t\\treturn B.p[0];\\n\\n\\t}else if(getDistanceSP(A,B.p[1]) < EPS){\\n\\n\\t\\treturn B.p[1];\\n\\t}\\n\\n\\treturn calc_Cross_Point(A.p[0],A.p[1],B.p[0],B.p[1]);\\n}\\n\\n/*\\n * IN 2\\n * ON 1\\n * OUT 0\\n *\\n */\\nint contains(Polygon g,Point p){\\n\\tint n = g.size();\\n\\tbool x = false;\\n\\tfor(int i = 0; i < n; i++){\\n\\t\\tPoint a = g[i]-p,b = g[(i+1)%n]-p;\\n\\t\\tif(abs(cross(a,b)) < EPS && dot(a,b) < EPS)return 1;\\n\\t\\tif(a.y > b.y)swap(a,b);\\n\\t\\tif(a.y < EPS && EPS < b.y && cross(a,b) > EPS) x = !x;\\n\\t}\\n\\treturn (x ? 2:0);\\n}\\n\\n//2つのvectorがなすラジアンを求める関数\\ndouble calc_rad(Vector vec1,Vector vec2){\\n\\n\\tdouble tmp = dot(vec1,vec2)/(abs(vec1)*abs(vec2));\\n\\n\\tif(fabs(tmp+1.0) < EPS){\\n\\n\\t\\treturn M_PI;\\n\\t}\\n\\n\\tif(fabs(tmp-1.0) < EPS){\\n\\n\\t\\treturn 0.0;\\n\\t}\\n\\n\\treturn acos(dot(vec1,vec2)/(abs(vec1)*abs(vec2)));\\n}\\n\\n//3点がなすラジアンを求める関数(ccw(base,a,b) == CCW)\\ndouble calc_rad(Point base,Point a,Point b){\\n\\n\\tVector vec1 = b-base;\\n\\tVector vec2 = a-base;\\n\\n\\treturn calc_rad(vec1,vec2);\\n}\\n\\n\\nvoid dfs(int start,int pre,int node){\\n\\n\\tif(CATCH)return;\\n\\n\\tif(node == start && pre != start){\\n\\n\\t\\tCATCH = true;\\n\\t\\treturn;\\n\\t}\\n\\n\\tPoint pre_p = point[pre];\\n\\tPoint now = point[node];\\n\\n\\tdouble maxi = -BIG_NUM;\\n\\tint ind = -1;\\n\\n\\tfor(int i = 0; i < G[node].size(); i++){\\n\\t\\tint adj = G[node][i];\\n\\t\\tif(adj == pre)continue;\\n\\n\\t\\tif(adj != start && SET.count(adj) > 0)continue;\\n\\t\\tif(adj == start && pre == start)continue;\\n\\n\\t\\tPoint next = point[adj];\\n\\n\\t\\tdouble tmp_rad = calc_rad(now,pre_p,next);\\n\\n\\t\\tif(maxi+EPS < tmp_rad){\\n\\n\\t\\t\\tmaxi = tmp_rad;\\n\\t\\t\\tind = i;\\n\\t\\t}\\n\\t}\\n\\n\\tif(ind == -1)return;\\n\\n\\tSET.insert(G[node][ind]);\\n\\tPOL.push_back(point[G[node][ind]]);\\n\\tdfs(start,node,G[node][ind]);\\n}\\n\\nvoid func(){\\n\\n\\tint num_point = 0;\\n\\tfor(int i = 0; i < SIZE; i++){\\n\\n\\t\\tV[i].clear();\\n\\t\\tG[i].clear();\\n\\t}\\n\\n\\tPoint base = Point(0,0);\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%lf %lf %lf %lf\\\",&line[i].p[0].x,&line[i].p[0].y,&line[i].p[1].x,&line[i].p[1].y);\\n\\t}\\n\\n\\t//交点を全列挙\\n\\tfor(int i = 0; i < N-1; i++){\\n\\t\\tfor(int k = i+1; k < N; k++){\\n\\t\\t\\tif(!is_Cross(line[i],line[k]))continue;\\n\\n\\t\\t\\tPoint cross_p = calc_Cross_Point(line[i],line[k]);\\n\\n\\t\\t\\tbool FLG = true;\\n\\t\\t\\tfor(int a = 0; a < num_point; a++){\\n\\t\\t\\t\\tif(point[a] == cross_p){\\n\\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)continue;\\n\\n\\t\\t\\tpoint[num_point++] = cross_p;\\n\\t\\t\\tV[i].push_back(cross_p);\\n\\t\\t\\tV[k].push_back(cross_p);\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < num_point; i++){\\n\\n\\t\\tDEL[i] = false;\\n\\t}\\n\\t//■■交点数が1なら行き止まりなので点を削除\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tif(V[i].size() == 1){\\n\\n\\t\\t\\tint ind = -1;\\n\\t\\t\\tfor(int k = 0; k < num_point; k++){\\n\\t\\t\\t\\tif(point[k] == V[i][0]){\\n\\n\\t\\t\\t\\t\\tind = k;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tDEL[ind] = true;\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tif(V[i].size() <= 1)continue;\\n\\n\\t\\tsort(V[i].begin(),V[i].end());\\n\\n\\t\\tvector<int> vec;\\n\\n\\t\\tfor(int k = 0; k < V[i].size(); k++){\\n\\t\\t\\tint ind = -1;\\n\\t\\t\\tfor(int a = 0; a < num_point; a++){\\n\\t\\t\\t\\tif(point[a] == V[i][k]){\\n\\n\\t\\t\\t\\t\\tind = a;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tvec.push_back(ind);\\n\\t\\t}\\n\\n\\t\\tvector<int> work;\\n\\t\\tfor(int k = 0; k < vec.size(); k++){\\n\\t\\t\\tif(!DEL[vec[k]]){\\n\\n\\t\\t\\t\\twork.push_back(vec[k]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tvec = work;\\n\\n\\t\\tfor(int k = 0; k < vec.size()-1; k++){\\n\\n\\t\\t\\tint p = vec[k];\\n\\t\\t\\tint q = vec[k+1];\\n\\n\\t\\t\\tG[p].push_back(q);\\n\\t\\t\\tG[q].push_back(p);\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < num_point; i++){\\n\\t\\tif(G[i].size() == 0)continue;\\n\\n\\t\\tfor(int k = 0; k < G[i].size(); k++){\\n\\n\\t\\t\\tPOL.clear();\\n\\t\\t\\tSET.clear();\\n\\n\\t\\t\\tPOL.push_back(point[i]);\\n\\t\\t\\tPOL.push_back(point[G[i][k]]);\\n\\n\\t\\t\\tSET.insert(i);\\n\\t\\t\\tSET.insert(G[i][k]); //最初の2点を全探索\\n\\n\\t\\t\\tCATCH = false;\\n\\t\\t\\tdfs(i,i,G[i][k]);\\n\\t\\t\\tif(CATCH){\\n\\n\\n\\t\\t\\t\\tif(contains(POL,base) == 2){\\n\\n\\t\\t\\t\\t\\tprintf(\\\"yes\\\\n\\\");\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tprintf(\\\"no\\\\n\\\");\\n}\\n\\nint main(){\\n\\n\\twhile(true){\\n\\n\\t\\tscanf(\\\"%d\\\",&N);\\n\\t\\tif(N == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6550,\n \"memory_kb\": 5016,\n \"score_of_the_acc\": -1.1819,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1247_8367548\",\n \"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 //オーバーフローに注意\\n#define MOD 998244353\\n//#define MOD 1000000007\\n#define EPS 0.000000001\\n\\n\\n\\n#define SIZE 10005\\n\\n\\nstruct Point{\\n\\tPoint(double arg_x,double arg_y){\\n\\t\\tx = arg_x;\\n\\t\\ty = arg_y;\\n\\t}\\n\\n\\tPoint(){\\n\\t\\tx = y = 0.0;\\n\\t}\\n\\n\\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\\n\\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\\n\\tPoint operator * (double a){ return Point(a*x,a*y); }\\n\\tPoint operator / (double a){ return Point(x/a,y/a); }\\n\\n\\tdouble abs(){ return sqrt(norm()); }\\n\\tdouble norm(){ return x*x + y*y; }\\n\\n\\tbool operator<(const Point &p) const{\\n\\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\\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\\n\\nint N;\\nLine line[SIZE];\\nPoint point[SIZE];\\nvector<Point> V[SIZE];\\nvector<int> G[SIZE];\\nset<int> SET;\\nPolygon POL;\\nbool CATCH,DEL[SIZE];\\n\\n\\ndouble norm(Vector a){\\n\\treturn a.x*a.x+a.y*a.y;\\n}\\n\\ndouble abs(Vector a){\\n\\treturn sqrt(norm(a));\\n}\\n\\ndouble cross(Vector a,Vector b){\\n return a.x*b.y-a.y*b.x;\\n}\\n\\ndouble dot(Vector a,Vector b){\\n return a.x*b.x + a.y*b.y;\\n}\\n\\nstatic const int COUNTER_CLOCKWISE = 1;\\nstatic const int CLOCKWISE = -1;\\nstatic const int ONLINE_BACK = 2;\\nstatic const int ONLINE_FRONT = -2;\\nstatic const int ON_SEGMENT = 0;\\n\\n/*\\n * p0を基準点として、p1から見てp2が\\n * 反時計回り側にあれば\\n * COUNTER_CLOCKWISE\\n * */\\nint ccw(Point p0,Point p1,Point p2){\\n\\n\\tVector a = p1 - p0;\\n\\tVector b = p2 - p0;\\n\\n\\tif(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\\n\\tif(cross(a,b) < -EPS)return CLOCKWISE;\\n\\tif(dot(a,b) < -EPS)return ONLINE_BACK;\\n\\tif(a.norm() < b.norm())return ONLINE_FRONT;\\n\\n\\treturn ON_SEGMENT;\\n}\\n\\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\\n\\n//交点を求める関数\\nPoint calc_Cross_Point(double x1,double x2,double x3,double x4,double y1,double y2,double y3,double y4){\\n\\tPoint ret;\\n\\tret.x = ((x2-x1)*(y3*(x4-x3)+x3*(y3-y4))-(x4-x3)*(y1*(x2-x1)+x1*(y1-y2)))/((y2-y1)*(x4-x3)-(y4-y3)*(x2-x1));\\n\\tif(fabs(x1-x2) > EPS){\\n\\t\\tret.y = ((y2-y1)*ret.x+y1*(x2-x1)+x1*(y1-y2))/(x2-x1);\\n\\t}else{\\n\\t\\tret.y = ((y4-y3)*ret.x+y3*(x4-x3)+x3*(y3-y4))/(x4-x3);\\n\\t}\\n\\treturn ret;\\n}\\n\\n//インタフェース関数\\nPoint calc_Cross_Point(Point a,Point b,Point c,Point d){\\n\\treturn calc_Cross_Point(a.x,b.x,c.x,d.x,a.y,b.y,c.y,d.y);\\n}\\n\\nPoint calc_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\\ndouble calc_len(Vector a){\\n return sqrt(a.x*a.x+a.y*a.y);\\n}\\n\\n\\n//線分ではなく直線と点の距離\\ndouble getDistanceLP(Line l,Point p){\\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\\n}\\n\\n//点と線分の距離\\ndouble getDistanceSP(Line l,Point p){\\n\\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\\n\\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\\n\\treturn getDistanceLP(l,p);\\n}\\n\\n//線分と線分の距離\\ndouble getDistance(Line A,Line B){\\n\\tif(is_Cross(A,B))return 0.0;\\n\\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\\n\\t\\t\\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\\n}\\n\\nPoint calc_Cross_Point(Line A,Line B){\\n\\n\\tif(getDistanceSP(B,A.p[0]) < EPS){\\n\\n\\t\\treturn A.p[0];\\n\\n\\t}else if(getDistanceSP(B,A.p[1]) < EPS){\\n\\n\\t\\treturn A.p[1];\\n\\n\\t}else if(getDistanceSP(A,B.p[0]) < EPS){\\n\\n\\t\\treturn B.p[0];\\n\\n\\t}else if(getDistanceSP(A,B.p[1]) < EPS){\\n\\n\\t\\treturn B.p[1];\\n\\t}\\n\\n\\treturn calc_Cross_Point(A.p[0],A.p[1],B.p[0],B.p[1]);\\n}\\n\\n/*\\n * IN 2\\n * ON 1\\n * OUT 0\\n *\\n */\\nint contains(Polygon g,Point p){\\n\\tint n = g.size();\\n\\tbool x = false;\\n\\tfor(int i = 0; i < n; i++){\\n\\t\\tPoint a = g[i]-p,b = g[(i+1)%n]-p;\\n\\t\\tif(abs(cross(a,b)) < EPS && dot(a,b) < EPS)return 1;\\n\\t\\tif(a.y > b.y)swap(a,b);\\n\\t\\tif(a.y < EPS && EPS < b.y && cross(a,b) > EPS) x = !x;\\n\\t}\\n\\treturn (x ? 2:0);\\n}\\n\\n//2つのvectorがなすラジアンを求める関数\\ndouble calc_rad(Vector vec1,Vector vec2){\\n\\n\\tdouble tmp = dot(vec1,vec2)/(abs(vec1)*abs(vec2));\\n\\n\\tif(fabs(tmp+1.0) < EPS){\\n\\n\\t\\treturn M_PI;\\n\\t}\\n\\n\\tif(fabs(tmp-1.0) < EPS){\\n\\n\\t\\treturn 0.0;\\n\\t}\\n\\n\\treturn acos(dot(vec1,vec2)/(abs(vec1)*abs(vec2)));\\n}\\n\\n//3点がなすラジアンを求める関数(ccw(base,a,b) == CCW)\\ndouble calc_rad(Point base,Point a,Point b){\\n\\n\\tVector vec1 = b-base;\\n\\tVector vec2 = a-base;\\n\\n\\treturn calc_rad(vec1,vec2);\\n}\\n\\nbool DEBUG = false;\\n\\n\\nvoid dfs(int start,int pre,int node){\\n\\n\\tif(CATCH)return;\\n\\n\\tif(DEBUG){\\n\\n\\t\\tprintf(\\\"start:%d pre:%d node:%d ■現在の座標\\\\n\\\",start,pre,node);\\n\\t\\tpoint[node].debug();\\n\\t}\\n\\n\\tif(node == start && pre != start){\\n\\n\\t\\tCATCH = true;\\n\\t\\tif(DEBUG){\\n\\t\\t\\tprintf(\\\"■■とらえた\\\\n\\\");\\n\\t\\t\\tprintf(\\\"start: [%d] \\\",start);\\n\\t\\t\\tpoint[start].debug();\\n\\t\\t\\tprintf(\\\"pre: [%d] \\\",pre);\\n\\t\\t\\tpoint[pre].debug();\\n\\t\\t}\\n\\t\\treturn;\\n\\t}\\n\\n\\tPoint pre_p = point[pre];\\n\\tPoint now = point[node];\\n\\n\\tdouble maxi = -BIG_NUM;\\n\\tint ind = -1;\\n\\n\\tfor(int i = 0; i < G[node].size(); i++){\\n\\t\\tint adj = G[node][i];\\n\\t\\tif(adj == pre)continue;\\n\\n\\t\\tif(adj != start && SET.count(adj) > 0)continue;\\n\\t\\tif(adj == start && pre == start)continue;\\n\\n\\t\\tPoint next = point[adj];\\n\\n\\t\\t//if(ccw(now,next,pre_p) == CLOCKWISE)continue;\\n\\n\\n\\t\\tdouble tmp_rad = calc_rad(now,pre_p,next);\\n\\t\\t//printf(\\\"tmp_rad:%.3lf\\\\n\\\",tmp_rad);\\n\\t\\tif(maxi+EPS < tmp_rad){\\n\\n\\t\\t\\t//printf(\\\"tmp_rad:%.3lf\\\\n\\\",tmp_rad);\\n\\t\\t\\tmaxi = tmp_rad;\\n\\t\\t\\tind = i;\\n\\t\\t}\\n\\t}\\n\\n\\tif(ind == -1)return;\\n\\n\\tSET.insert(G[node][ind]);\\n\\tPOL.push_back(point[G[node][ind]]);\\n\\tdfs(start,node,G[node][ind]);\\n}\\n\\nvoid func(){\\n\\n\\tint num_point = 0;\\n\\tfor(int i = 0; i < SIZE; i++){\\n\\n\\t\\tV[i].clear();\\n\\t\\tG[i].clear();\\n\\t}\\n\\n\\tPoint base = Point(0,0);\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%lf %lf %lf %lf\\\",&line[i].p[0].x,&line[i].p[0].y,&line[i].p[1].x,&line[i].p[1].y);\\n\\t}\\n\\n\\t//交点を全列挙\\n\\tfor(int i = 0; i < N-1; i++){\\n\\t\\tfor(int k = i+1; k < N; k++){\\n\\t\\t\\tif(!is_Cross(line[i],line[k]))continue;\\n\\n\\t\\t\\tPoint cross_p = calc_Cross_Point(line[i],line[k]);\\n\\n\\t\\t\\tbool FLG = true;\\n\\t\\t\\tfor(int a = 0; a < num_point; a++){\\n\\t\\t\\t\\tif(point[a] == cross_p){\\n\\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)continue;\\n\\n\\t\\t\\t//cross_p.debug();\\n\\n\\t\\t\\tpoint[num_point++] = cross_p;\\n\\t\\t\\tV[i].push_back(cross_p);\\n\\t\\t\\tV[k].push_back(cross_p);\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < num_point; i++){\\n\\n\\t\\tDEL[i] = false;\\n\\t}\\n\\t//交点数が1なら行き止まりなので点を削除\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tif(V[i].size() == 1){\\n\\n\\t\\t\\tint ind = -1;\\n\\t\\t\\tfor(int k = 0; k < num_point; k++){\\n\\t\\t\\t\\tif(point[k] == V[i][0]){\\n\\n\\t\\t\\t\\t\\tind = k;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tDEL[ind] = true;\\n\\t\\t}\\n\\t}\\n\\n/*\\n\\tfor(int i = 0; i < num_point; i++){\\n\\n\\t\\tprintf(\\\"点%d \\\",i);\\n\\t\\tpoint[i].debug();\\n\\t}*/\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tif(V[i].size() <= 1)continue;\\n\\n\\t\\tsort(V[i].begin(),V[i].end());\\n\\n\\t\\t/*printf(\\\"\\\\n線分%d\\\",i);\\n\\t\\tfor(int a = 0; a < V[i].size(); a++){\\n\\n\\t\\t\\tV[i][a].debug();\\n\\t\\t}*/\\n\\n\\t\\tvector<int> vec;\\n\\n\\t\\tfor(int k = 0; k < V[i].size(); k++){\\n\\t\\t\\tint ind = -1;\\n\\t\\t\\tfor(int a = 0; a < num_point; a++){\\n\\t\\t\\t\\tif(point[a] == V[i][k]){\\n\\n\\t\\t\\t\\t\\tind = a;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tvec.push_back(ind);\\n\\t\\t}\\n\\n\\t\\tvector<int> work;\\n\\t\\tfor(int k = 0; k < vec.size(); k++){\\n\\t\\t\\tif(!DEL[vec[k]]){\\n\\n\\t\\t\\t\\twork.push_back(vec[k]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tvec = work;\\n\\n\\t\\tfor(int k = 0; k < vec.size()-1; k++){\\n\\n\\t\\t\\tint p = vec[k];\\n\\t\\t\\tint q = vec[k+1];\\n\\n\\t\\t\\tG[p].push_back(q);\\n\\t\\t\\tG[q].push_back(p);\\n\\t\\t}\\n\\t}\\n/*\\n\\tfor(int i = 0; i < num_point; i++){\\n\\t\\t//f(i != 0 && i != 1)continue;\\n\\n\\t\\tprintf(\\\"\\\\n点%dです\\\\n\\\",i);\\n\\t\\tfor(int k = 0; k < G[i].size(); k++){\\n\\n\\t\\t\\tprintf(\\\"点%dと隣接\\\\n\\\",G[i][k]);\\n\\t\\t}\\n\\t}\\n\\treturn;*/\\n\\n\\tfor(int i = 0; i < num_point; i++){\\n\\t\\tif(G[i].size() == 0)continue;\\n\\n\\t\\tfor(int k = 0; k < G[i].size(); k++){\\n\\n\\t\\t\\tPOL.clear();\\n\\t\\t\\tSET.clear();\\n\\n\\t\\t\\tPOL.push_back(point[i]);\\n\\t\\t\\tPOL.push_back(point[G[i][k]]);\\n\\n\\t\\t\\tSET.insert(i);\\n\\t\\t\\tSET.insert(G[i][k]); //最初の2点を全探索\\n\\n\\t\\t\\tif(DEBUG){\\n\\t\\t\\t\\tprintf(\\\"\\\\n◎◎◎dfs\\\\n\\\");\\n\\t\\t\\t}\\n\\n\\t\\t\\tCATCH = false;\\n\\t\\t\\tdfs(i,i,G[i][k]);\\n\\t\\t\\tif(CATCH){\\n\\n\\n\\t\\t\\t\\tif(contains(POL,base) == 2){\\n\\n\\t\\t\\t\\t\\tif(DEBUG){\\n\\t\\t\\t\\t\\t\\tfor(int a = 0; a < POL.size(); a++){\\n\\n\\t\\t\\t\\t\\t\\t\\tPOL[a].debug();\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tprintf(\\\"yes\\\\n\\\");\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tprintf(\\\"no\\\\n\\\");\\n}\\n\\nint main(){\\n\\n\\twhile(true){\\n\\n\\t\\tscanf(\\\"%d\\\",&N);\\n\\t\\tif(N == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6560,\n \"memory_kb\": 4848,\n \"score_of_the_acc\": -1.1647,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1247_4320286\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include\\\"bits/stdc++.h\\\"\\n\\nusing namespace std;\\n\\n#define REP(i,n) for(int i=0;i<(n);i++)\\n#define FOR(i,m,n) for(int i=(m);i<(n);i++)\\n\\nconst bool DEBUG = false;\\n\\nconst double EPS = 1e-8;\\ntypedef complex<double> point;\\nistream &operator>>(istream &is, point &p) {\\n\\tdouble a, b;\\n\\tis >> a >> b;\\n\\tp = point(a, b);\\n\\treturn is;\\n}\\npoint operator*(const point&p, const double &d) {\\n\\treturn point(real(p)*d, imag(p)*d);\\n}\\nnamespace std {\\n\\tbool operator < (const point& a, const point& b) {\\n\\t\\treturn real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\\n\\t}\\n}\\n\\n//直線or線分\\nstruct Line : public vector<point> {\\n\\tLine(const point &a, const point &b) {\\n\\t\\tpush_back(a); push_back(b);\\n\\t}\\n};\\ntypedef vector<Line>Lines;\\n\\n\\ndouble cross(const point& a, const point& b) {\\n\\treturn real(a)*imag(b) - imag(a)*real(b);\\n}\\ndouble dot(const point& a, const point& b) {\\n\\treturn real(a)*real(b) + imag(a)*imag(b);\\n}\\nint ccw(point a, point b, point c) {\\n\\tb = b - a; c = c - a;\\n\\tif (cross(b, c) > EPS) return +1; // counter clockwise\\n\\tif (cross(b, c) < -EPS) return -1; // clockwise\\n\\tif (dot(b, c) < -EPS) return +2; // c--a--b on line\\n\\tif (norm(b) < norm(c)) return -2; // a--b--c on line\\n\\treturn 0;\\n}\\n//交差判定\\nbool intersectLL(const Line &l1, const Line &l2) {\\n\\treturn abs(cross(l1[1] - l1[0], l2[1] - l2[0])) > EPS || //non-parallel\\n\\t\\tabs(cross(l1[1] - l1[0], l2[0] - l1[0])) < EPS; //same line\\n}\\nbool intersectLS(const Line &l, const Line &s) {\\n\\treturn cross(l[1] - l[0], s[0] - l[0])* // s[0] is left of l\\n\\t\\tcross(l[1] - l[0], s[1] - l[0]) < EPS; // s[1] is right of l\\n}\\nbool intersectLP(const Line &l, const point &p) {\\n\\treturn abs(cross(l[1] - p, l[0] - p)) < EPS;\\n}\\n//端点に乗ってたらfalse\\nbool intersectSP_without_endpoint(const Line &s, const point &p) {\\n\\tif (abs(s[0] - p) < EPS || abs(s[1] - p) < EPS)return false;\\n\\treturn abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < EPS; //triangle inequality\\n}\\n\\nbool intersectSP(const Line &s, const point &p) { //verified on 2020/04/03 https://onlinejudge.u-aizu.ac.jp/status/users/Mojumbo/submissions/1/1157/judge/4316978/C++14\\n\\treturn abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < EPS; //triangle inequality\\n}\\nbool connectSS(const Line &s, const Line &t) {\\n\\tif (intersectSP(s, t[0]) || intersectSP(s, t[1]) || intersectSP(t, s[0]) || intersectSP(t, s[1]))return true;\\n\\telse return false;\\n}\\nbool isSamePoint(const point &p1, const point &p2) {\\n\\treturn abs(p1 - p2)<EPS;\\n}\\nbool connectSS_with_endpoint(const Line &s, const Line &t) {\\n\\tREP(i, 2)REP(j, 2) {\\n\\t\\t//if(isSamePoint(s[i],t[j]))return true;\\n\\t\\tif (s[i] == t[j])return true;\\n\\t}\\n\\treturn false;\\n}\\nbool intersectSS(const Line &s, const Line &t) {\\n\\treturn ccw(s[0], s[1], t[0])*ccw(s[0], s[1], t[1]) <= 0 &&\\n\\t\\tccw(t[0], t[1], s[0])*ccw(t[0], t[1], s[1]) <= 0;\\n}\\nbool intersectSS_strict(const Line &s, const Line &t) {\\n\\t//端点が線分上に乗っている場合はfalseにする\\n\\tif (connectSS(s, t))return false;\\n\\treturn ccw(s[0], s[1], t[0])*ccw(s[0], s[1], t[1]) <= 0 &&\\n\\t\\tccw(t[0], t[1], s[0])*ccw(t[0], t[1], s[1]) <= 0;\\n}\\n\\nbool isOn(const Line &l, const point &p) {\\n\\tif (l[0] == p || l[1] == p)return false;\\n\\tpoint d = l[1] - l[0];\\n\\tpoint p0 = (p - l[0]) / d;\\n\\treturn p0.imag() == 0.0&&0.0<p0.real() && p0.real()<1.0;\\n}\\nbool intersect(const Line &l0, const Line &l1, point &p) {\\n\\tif (connectSS_with_endpoint(l0, l1) || isOn(l0, l1[0]) || isOn(l0, l1[1]) || isOn(l1, l0[0]) || isOn(l1, l0[1]))return false;\\n\\tpoint d = l0[1] - l0[0];\\n\\tpoint p0 = (l1[0] - l0[0]) / d;\\n\\tpoint p1 = (l1[1] - l0[0]) / d;\\n\\tif (p0.imag()*p1.imag() >= 0)return false;\\n\\tdouble t = p0.imag() / (p0.imag() - p1.imag());\\n\\tdouble s = p0.real()*(1 - t) + p1.real()*t;\\n\\tif (s <= 0.0 || 1.0 <= s)return false;\\n\\tp = l0[0] + d * s;\\n\\treturn true;\\n}\\n\\n//距離,交点\\n//射影 直線lにpから下した垂線との交点\\n\\npoint projection(const Line &l, const point &p) { //verified on 2020/04/03 https://onlinejudge.u-aizu.ac.jp/status/users/Mojumbo/submissions/1/1157/judge/4316978/C++14\\n\\tdouble t = dot(p - l[0], l[0] - l[1]) / norm(l[0] - l[1]);\\n\\treturn l[0] + (l[0] - l[1])*t;\\n}\\n//射影 直線lを対象軸としてpと線対称にある点\\npoint reflection(const Line &l, const point &p) {\\n\\treturn p + (projection(l, p) - p) * 2;\\n}\\ndouble distancePP(const point& a, const point& b) {\\n\\treturn sqrt(norm(a - b));\\n}\\ndouble distanceLP(const Line &l, const point &p) {\\n\\treturn abs(p - projection(l, p));\\n}\\ndouble distanceLL(const Line&l, const Line &m) {\\n\\treturn intersectLL(l, m) ? 0 : distanceLP(l, m[0]);\\n}\\ndouble distanceLS(const Line &l, const Line &s) {\\n\\tif (intersectLS(l, s))return 0;\\n\\treturn min(distanceLP(l, s[0]), distanceLP(l, s[1]));\\n}\\ndouble distanceSP(const Line &s, const point &p) {\\n\\tconst point r = projection(s, p);\\n\\tif (intersectSP(s, r))return abs(r - p);\\n\\treturn min(abs(s[0] - p), abs(s[1] - p));\\n}\\ndouble distanceSS(const Line &s, const Line &t) { //verified on 2020/04/03 https://onlinejudge.u-aizu.ac.jp/status/users/Mojumbo/submissions/1/1157/judge/4316978/C++14\\n\\tif (intersectSS(s, t))return 0;\\n\\treturn min({ distanceSP(s,t[0]),distanceSP(s,t[1]),distanceSP(t,s[0]),distanceSP(t,s[1]) });\\n}\\npoint crosspoint(const Line &l, const Line &m) {\\n\\tdouble A = cross(l[1] - l[0], m[1] - m[0]);\\n\\tdouble B = cross(l[1] - l[0], l[1] - m[0]);\\n\\tif (abs(A) < EPS&&abs(B) < EPS)return m[0];//same line\\n\\tif (abs(A) < EPS)assert(false); // Precondition not satisfied\\n\\treturn m[0] + B / A * (m[1] - m[0]);\\n}\\ndouble dist(point &p1, point &p2) {\\n\\treturn abs(p1 - p2);\\n}\\n\\n//線分同士の交点で分割して端点以外の共有点を持たないようにする\\nvoid splitSegments(Lines &ls) {\\n\\t//端点が線分上に乗っている場合の分割\\n\\tfor (int i = 0; i < (int)ls.size(); i++){\\n\\t\\tint mx = ls.size();\\n\\t\\tfor (int j = i + 1; j < (int)ls.size(); j++) {\\n\\t\\t\\tif (j >= mx)break;\\n\\t\\t\\tfor (int k = 0; k < 2; k++) {\\n\\t\\t\\t\\t//if(isOn(ls[i],ls[j][k])){\\n\\t\\t\\t\\tif (intersectSP_without_endpoint(ls[i], ls[j][k])) {\\n\\t\\t\\t\\t\\tls.push_back(Line(ls[i][0], ls[j][k]));\\n\\t\\t\\t\\t\\tls[i][0] = ls[j][k];\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t//else if(isOn(ls[j],ls[i][k])){\\n\\t\\t\\t\\telse if (intersectSP_without_endpoint(ls[j], ls[i][k])) {\\n\\t\\t\\t\\t\\tls.push_back(Line(ls[j][0], ls[i][k]));\\n\\t\\t\\t\\t\\tls[j][0] = ls[i][k];\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t//cerr << \\\"split-1\\\" << endl;\\n\\t//線分が交差している場合の分割\\n\\tfor (int i = 0; i < (int)ls.size(); i++) {\\n\\t\\tLine li = ls[i];\\n\\t\\tint mx = ls.size();\\n\\t\\tfor (int j = i + 1; j < (int)ls.size(); j++) {\\n\\t\\t\\tpoint cross_p;\\n\\t\\t\\tif (j >= mx)break;\\n\\t\\t\\t//if (intersect(ls[i], ls[j], cross_p)) {\\n\\t\\t\\tif (intersectSS_strict(ls[i], ls[j])) {\\n\\t\\t\\t\\tcross_p = crosspoint(ls[i], ls[j]);\\n\\t\\t\\t\\tls.push_back(Line(ls[i][0], cross_p));\\n\\t\\t\\t\\tls[i][0] = cross_p;\\n\\t\\t\\t\\tls.push_back(Line(ls[j][0], cross_p));\\n\\t\\t\\t\\tls[j][0] = cross_p;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\n//線分の集合(split済み)を連結成分に分解する(union-find)\\n\\nstruct Equiv {\\n\\tvector<int>links;\\n\\t//大きさ1の同値類をn個作る\\n\\tEquiv(int n) :links(n) {\\n\\t\\tfor (int i = 0; i < n; i++) {\\n\\t\\t\\tlinks[i] = i;\\n\\t\\t}\\n\\t}\\n\\t//xの属する同値類の代表元を返す\\n\\tint find(int x) {\\n\\t\\tint xx = links[x];\\n\\t\\tif (xx == x)return x;\\n\\t\\treturn links[x] = find(xx);\\n\\t}\\n\\tvoid unify(int x, int y) {\\n\\t\\tint xx = find(x), yy = find(y);\\n\\t\\tif (xx <= yy)links[yy] = xx;\\n\\t\\telse links[xx] = yy;\\n\\t}\\n};\\n\\ntypedef vector<Lines>vLines;\\nvLines connectedComponent(const Lines &ls) {\\n\\tvLines ret;\\n\\tEquiv equiv(ls.size());\\n\\tfor (int i = 0; i < (int)ls.size(); i++) {\\n\\t\\tfor (int j = 0; j < i; j++) {\\n\\t\\t\\tif (connectSS_with_endpoint(ls[i], ls[j])) {\\n\\t\\t\\t\\tequiv.unify(i, j);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t//cerr << \\\"connected-1\\\" << endl;\\n\\tfor (int i = 0; i < (int)ls.size(); i++) {\\n\\t\\tif (equiv.find(i) == i) {\\n\\t\\t\\tLines newLs;\\n\\t\\t\\tnewLs.push_back(ls[i]);\\n\\t\\t\\tfor (int j = i + 1; j < (int)ls.size(); j++) {\\n\\t\\t\\t\\tif (equiv.find(j) == i)newLs.push_back(ls[j]);\\n\\t\\t\\t}\\n\\t\\t\\tret.push_back(newLs);\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\n//左手法でのトレース\\n//偏角でソートされた隣接点のvectorを得る\\ntypedef pair<double, point>doublePoint;\\ntypedef vector<doublePoint> vDoublePoint;\\ntypedef map<point, vDoublePoint> adjPoint;\\ntypedef vector<point>points;\\n//移動前の点と隣接点のリストから移動先を決定\\npoint findNext(const vDoublePoint &vdp, const point &p) {\\n\\tfor (int i = 0; i < (int)vdp.size() - 1; i++) {\\n\\t\\tif (p == vdp[i].second) {\\n\\t\\t\\treturn vdp[i + 1].second;\\n\\t\\t}\\n\\t}\\n\\treturn vdp[0].second;\\n}\\n//左手法でトレースして通った点の列を返す\\npoints trace(const Lines &ls) {\\n\\tadjPoint aPoint;\\n\\t//隣接点(偏角付き)のリストを作成\\n\\tfor (int i = 0; i < (int)ls.size(); i++) {\\n\\t\\taPoint[ls[i][0]].push_back(doublePoint(arg(ls[i][1] - ls[i][0]), ls[i][1]));\\n\\t\\taPoint[ls[i][1]].push_back(doublePoint(arg(ls[i][0] - ls[i][1]), ls[i][0]));\\n\\t}\\n\\t//x座標最小の点の計算と隣接点リストのソート\\n\\tpoint minPoint(INT_MAX, INT_MAX);\\n\\tadjPoint::iterator it;\\n\\tfor (it = aPoint.begin(); it != aPoint.end(); ++it) {\\n\\t\\tpoint p = it->first;\\n\\t\\tminPoint = min(minPoint, p);\\n\\t\\tvDoublePoint &vdp = it->second;\\n\\t\\tsort(vdp.begin(), vdp.end());\\n\\t}\\n\\tpoints ret;\\n\\tret.push_back(minPoint);\\n\\t//最初の移動先\\n\\tpoint curP = aPoint[minPoint][0].second;\\n\\tpoint lastP = minPoint;\\n\\t//トレースの繰り返し\\n\\twhile (curP != minPoint) {\\n\\t\\tif (DEBUG)cerr << curP << endl;\\n\\t\\tret.push_back(curP);\\n\\t\\tpoint nextP = findNext(aPoint[curP], lastP);\\n\\t\\t//if(isSamePoint(curP,nextP))break;\\n\\t\\tlastP = curP;\\n\\t\\tcurP = nextP;\\n\\t}\\n\\t//開始点を最後にも追加\\n\\tret.push_back(minPoint);\\n\\treturn ret;\\n}\\n\\nbool isInside(const points &ps) {\\n\\tLine l0(point(0, 0), point(51.0, 1.0 / 20000.0));\\n\\tint count = 0;\\n\\tfor (int i = 0; i < (int)ps.size() - 1; i++) {\\n\\t\\tpoint dummy;\\n\\t\\tLine l1(ps[i], ps[i + 1]);\\n\\t\\tif (intersect(l0, l1, dummy))count++;\\n\\t}\\n\\treturn (count & 1) == 1;\\n}\\n\\n\\n//円\\nstruct Circle {\\n\\tpoint p; double r;\\n\\tCircle(const point &p_, double r_) : p(p_), r(r_) { }\\n};\\n\\n//凸包\\nvector<point> convex_hull(vector<point> ps) {\\n\\tint n = ps.size(), k = 0;\\n\\tsort(ps.begin(), ps.end());\\n\\tvector<point> ch(2 * n);\\n\\tfor (int i = 0; i < n; ch[k++] = ps[i++]) // lower-hull\\n\\t\\twhile (k >= 2 && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\\n\\tfor (int i = n - 2, t = k + 1; i >= 0; ch[k++] = ps[i--]) // upper-hull\\n\\t\\twhile (k >= t && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\\n\\tch.resize(k - 1);\\n\\treturn ch;\\n}\\n\\n//2点を通る半径Rの円の中心\\npair<point, point> get_circle_from_2points(point &p1, point &p2, double R) {\\n\\tdouble d = dist(p1, p2);\\n\\tdouble x1 = p1.real(), x2 = p2.real();\\n\\tdouble y1 = p1.imag(), y2 = p2.imag();\\n\\tif (p1.imag() == p2.imag()) {\\n\\t\\tdouble x = (x1 + x2) / 2.0;\\n\\t\\tdouble dy = sqrt(R - d * d / 4);\\n\\t\\treturn { { x,y1 + dy },{ x,y1 - dy } };\\n\\t}\\n\\telse {\\n\\t\\tdouble m = (x1 - x2) / (y2 - y1);\\n\\t\\tdouble t = sqrt(R*R - d * d / 4);\\n\\t\\tdouble dx = sqrt((t*t) / (m*m + 1));\\n\\t\\tdouble dy = sqrt(t*t - dx * dx);\\n\\t\\tdouble gx = (x1 + x2) / 2;\\n\\t\\tdouble gy = (y1 + y2) / 2;\\n\\t\\tif (m > EPS) {\\n\\t\\t\\treturn { { gx + dx,gy + dy },{ gx - dx,gy - dy } };\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\treturn { { gx + dx,gy - dy },{ gx - dx,gy + dy } };\\n\\t\\t}\\n\\t}\\n}\\n//長方形\\nstruct Square {\\n\\tdouble lx, ly, rx, ry;\\n\\tSquare(double lx_, double ly_, double rx_, double ry_) :lx(lx_), ly(ly_), rx(rx_), ry(ry_) {};\\n\\tbool include(point &p) {\\n\\t\\treturn p.real() + EPS >= lx && p.real() - EPS <= rx && p.imag() + EPS >= ly && p.imag() - EPS <= ry;\\n\\t}\\n};\\n\\nstruct Polygon : public vector<point> {\\n\\t//0->OUT, 1->ON, 2->IN\\n\\tint contains(const point &p) {\\n\\t\\tbool in = false;\\n\\t\\tint N = this->size();\\n\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\tpoint a = this->at(i) - p;\\n\\t\\t\\tpoint b = this->at((i + 1) % N) - p;\\n\\t\\t\\tif (imag(a) > imag(b)) {\\n\\t\\t\\t\\tstd::swap(a, b);\\n\\t\\t\\t}\\n\\t\\t\\tif (imag(a) <= 0 && 0 < imag(b))\\n\\t\\t\\t\\tif (cross(a, b) < 0)in = !in;\\n\\t\\t\\tif (cross(a, b) == 0 && dot(a, b) <= 0)return 1;\\n\\t\\t}\\n\\t\\treturn in ? 2 : 0;\\n\\t}\\n};\\nclock_t START, END;\\nbool trapAll() {\\n\\tint N; cin >> N;\\n\\tif (N == 0) {\\n\\t\\tEND = clock();\\n\\t\\tdouble t = (double)(END - START) / CLOCKS_PER_SEC;\\n\\t\\t//cerr << \\\"elapsed time\\\" << t << \\\"[sec]\\\" << endl;\\n\\t\\texit(0);\\n\\t}\\n\\tLines ls;\\n\\tREP(i, N) {\\n\\t\\tdouble x1, y1, x2, y2;\\n\\t\\tcin >> x1 >> y1 >> x2 >> y2;\\n\\t\\tpoint p1(x1, y1);\\n\\t\\tpoint p2(x2, y2);\\n\\t\\tls.push_back(Line(p1, p2));\\n\\t}\\n\\tsplitSegments(ls);\\n\\t// for(auto l:ls){\\n\\t// \\tcerr<<l[0]<<\\\" \\\"<<l[1]<<endl;\\n\\t// }\\n\\t//cerr << \\\"splitted\\\" << endl;\\n\\tvLines vls = connectedComponent(ls);\\n\\tfor (auto lines : vls) {\\n\\t\\t//if(isInside(trace(lines)))return true;\\n\\t\\tPolygon poly;\\n\\t\\tpoints ps = trace(lines);\\n\\t\\tfor (auto p : ps) {\\n\\t\\t\\tpoly.push_back(p);\\n\\t\\t}\\n\\t\\tif (poly.contains(point(0, 0)))return true;\\n\\t}\\n\\treturn false;\\n}\\n\\nvoid solve() {\\n\\tif (trapAll())cout << \\\"yes\\\" << endl;\\n\\telse cout << \\\"no\\\" << endl;\\n\\tif (DEBUG)cerr << \\\"+++++++++++++\\\" << endl;\\n}\\nsigned main() {\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\n\\tSTART = clock();\\n\\twhile (true)\\n\\t\\tsolve();\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3930,\n \"memory_kb\": 6452,\n \"score_of_the_acc\": -0.9429,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1247_4320285\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include\\\"bits/stdc++.h\\\"\\n\\nusing namespace std;\\n\\n#define REP(i,n) for(int i=0;i<(n);i++)\\n#define FOR(i,m,n) for(int i=(m);i<(n);i++)\\n\\nconst bool DEBUG = false;\\n\\nconst double EPS = 1e-8;\\ntypedef complex<double> point;\\nistream &operator>>(istream &is, point &p) {\\n\\tdouble a, b;\\n\\tis >> a >> b;\\n\\tp = point(a, b);\\n\\treturn is;\\n}\\npoint operator*(const point&p, const double &d) {\\n\\treturn point(real(p)*d, imag(p)*d);\\n}\\nnamespace std {\\n\\tbool operator < (const point& a, const point& b) {\\n\\t\\treturn real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\\n\\t}\\n}\\n\\n//直線or線分\\nstruct Line : public vector<point> {\\n\\tLine(const point &a, const point &b) {\\n\\t\\tpush_back(a); push_back(b);\\n\\t}\\n};\\ntypedef vector<Line>Lines;\\n\\n\\ndouble cross(const point& a, const point& b) {\\n\\treturn real(a)*imag(b) - imag(a)*real(b);\\n}\\ndouble dot(const point& a, const point& b) {\\n\\treturn real(a)*real(b) + imag(a)*imag(b);\\n}\\nint ccw(point a, point b, point c) {\\n\\tb = b - a; c = c - a;\\n\\tif (cross(b, c) > EPS) return +1; // counter clockwise\\n\\tif (cross(b, c) < -EPS) return -1; // clockwise\\n\\tif (dot(b, c) < -EPS) return +2; // c--a--b on line\\n\\tif (norm(b) < norm(c)) return -2; // a--b--c on line\\n\\treturn 0;\\n}\\n//交差判定\\nbool intersectLL(const Line &l1, const Line &l2) {\\n\\treturn abs(cross(l1[1] - l1[0], l2[1] - l2[0])) > EPS || //non-parallel\\n\\t\\tabs(cross(l1[1] - l1[0], l2[0] - l1[0])) < EPS; //same line\\n}\\nbool intersectLS(const Line &l, const Line &s) {\\n\\treturn cross(l[1] - l[0], s[0] - l[0])* // s[0] is left of l\\n\\t\\tcross(l[1] - l[0], s[1] - l[0]) < EPS; // s[1] is right of l\\n}\\nbool intersectLP(const Line &l, const point &p) {\\n\\treturn abs(cross(l[1] - p, l[0] - p)) < EPS;\\n}\\n//端点に乗ってたらfalse\\nbool intersectSP_without_endpoint(const Line &s, const point &p) {\\n\\tif (abs(s[0] - p) < EPS || abs(s[1] - p) < EPS)return false;\\n\\treturn abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < EPS; //triangle inequality\\n}\\n\\nbool intersectSP(const Line &s, const point &p) { //verified on 2020/04/03 https://onlinejudge.u-aizu.ac.jp/status/users/Mojumbo/submissions/1/1157/judge/4316978/C++14\\n\\treturn abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < EPS; //triangle inequality\\n}\\nbool connectSS(const Line &s, const Line &t) {\\n\\tif (intersectSP(s, t[0]) || intersectSP(s, t[1]) || intersectSP(t, s[0]) || intersectSP(t, s[1]))return true;\\n\\telse return false;\\n}\\nbool isSamePoint(const point &p1, const point &p2) {\\n\\treturn abs(p1 - p2)<EPS;\\n}\\nbool connectSS_with_endpoint(const Line &s, const Line &t) {\\n\\tREP(i, 2)REP(j, 2) {\\n\\t\\t//if(isSamePoint(s[i],t[j]))return true;\\n\\t\\tif (s[i] == t[j])return true;\\n\\t}\\n\\treturn false;\\n}\\nbool intersectSS(const Line &s, const Line &t) {\\n\\treturn ccw(s[0], s[1], t[0])*ccw(s[0], s[1], t[1]) <= 0 &&\\n\\t\\tccw(t[0], t[1], s[0])*ccw(t[0], t[1], s[1]) <= 0;\\n}\\nbool intersectSS_strict(const Line &s, const Line &t) {\\n\\t//端点が線分上に乗っている場合はfalseにする\\n\\tif (connectSS(s, t))return false;\\n\\treturn ccw(s[0], s[1], t[0])*ccw(s[0], s[1], t[1]) <= 0 &&\\n\\t\\tccw(t[0], t[1], s[0])*ccw(t[0], t[1], s[1]) <= 0;\\n}\\n\\nbool isOn(const Line &l, const point &p) {\\n\\tif (l[0] == p || l[1] == p)return false;\\n\\tpoint d = l[1] - l[0];\\n\\tpoint p0 = (p - l[0]) / d;\\n\\treturn p0.imag() == 0.0&&0.0<p0.real() && p0.real()<1.0;\\n}\\nbool intersect(const Line &l0, const Line &l1, point &p) {\\n\\tif (connectSS_with_endpoint(l0, l1) || isOn(l0, l1[0]) || isOn(l0, l1[1]) || isOn(l1, l0[0]) || isOn(l1, l0[1]))return false;\\n\\tpoint d = l0[1] - l0[0];\\n\\tpoint p0 = (l1[0] - l0[0]) / d;\\n\\tpoint p1 = (l1[1] - l0[0]) / d;\\n\\tif (p0.imag()*p1.imag() >= 0)return false;\\n\\tdouble t = p0.imag() / (p0.imag() - p1.imag());\\n\\tdouble s = p0.real()*(1 - t) + p1.real()*t;\\n\\tif (s <= 0.0 || 1.0 <= s)return false;\\n\\tp = l0[0] + d * s;\\n\\treturn true;\\n}\\n\\n//距離,交点\\n//射影 直線lにpから下した垂線との交点\\n\\npoint projection(const Line &l, const point &p) { //verified on 2020/04/03 https://onlinejudge.u-aizu.ac.jp/status/users/Mojumbo/submissions/1/1157/judge/4316978/C++14\\n\\tdouble t = dot(p - l[0], l[0] - l[1]) / norm(l[0] - l[1]);\\n\\treturn l[0] + (l[0] - l[1])*t;\\n}\\n//射影 直線lを対象軸としてpと線対称にある点\\npoint reflection(const Line &l, const point &p) {\\n\\treturn p + (projection(l, p) - p) * 2;\\n}\\ndouble distancePP(const point& a, const point& b) {\\n\\treturn sqrt(norm(a - b));\\n}\\ndouble distanceLP(const Line &l, const point &p) {\\n\\treturn abs(p - projection(l, p));\\n}\\ndouble distanceLL(const Line&l, const Line &m) {\\n\\treturn intersectLL(l, m) ? 0 : distanceLP(l, m[0]);\\n}\\ndouble distanceLS(const Line &l, const Line &s) {\\n\\tif (intersectLS(l, s))return 0;\\n\\treturn min(distanceLP(l, s[0]), distanceLP(l, s[1]));\\n}\\ndouble distanceSP(const Line &s, const point &p) {\\n\\tconst point r = projection(s, p);\\n\\tif (intersectSP(s, r))return abs(r - p);\\n\\treturn min(abs(s[0] - p), abs(s[1] - p));\\n}\\ndouble distanceSS(const Line &s, const Line &t) { //verified on 2020/04/03 https://onlinejudge.u-aizu.ac.jp/status/users/Mojumbo/submissions/1/1157/judge/4316978/C++14\\n\\tif (intersectSS(s, t))return 0;\\n\\treturn min({ distanceSP(s,t[0]),distanceSP(s,t[1]),distanceSP(t,s[0]),distanceSP(t,s[1]) });\\n}\\npoint crosspoint(const Line &l, const Line &m) {\\n\\tdouble A = cross(l[1] - l[0], m[1] - m[0]);\\n\\tdouble B = cross(l[1] - l[0], l[1] - m[0]);\\n\\tif (abs(A) < EPS&&abs(B) < EPS)return m[0];//same line\\n\\tif (abs(A) < EPS)assert(false); // Precondition not satisfied\\n\\treturn m[0] + B / A * (m[1] - m[0]);\\n}\\ndouble dist(point &p1, point &p2) {\\n\\treturn abs(p1 - p2);\\n}\\n\\n//線分同士の交点で分割して端点以外の共有点を持たないようにする\\nvoid splitSegments(Lines &ls) {\\n\\t//端点が線分上に乗っている場合の分割\\n\\tfor (int i = 0; i < (int)ls.size(); i++){\\n\\t\\tint mx = ls.size();\\n\\t\\tfor (int j = i + 1; j < (int)ls.size(); j++) {\\n\\t\\t\\tif (j >= mx)break;\\n\\t\\t\\tfor (int k = 0; k < 2; k++) {\\n\\t\\t\\t\\t//if(isOn(ls[i],ls[j][k])){\\n\\t\\t\\t\\tif (intersectSP_without_endpoint(ls[i], ls[j][k])) {\\n\\t\\t\\t\\t\\tls.push_back(Line(ls[i][0], ls[j][k]));\\n\\t\\t\\t\\t\\tls[i][0] = ls[j][k];\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t//else if(isOn(ls[j],ls[i][k])){\\n\\t\\t\\t\\telse if (intersectSP_without_endpoint(ls[j], ls[i][k])) {\\n\\t\\t\\t\\t\\tls.push_back(Line(ls[j][0], ls[i][k]));\\n\\t\\t\\t\\t\\tls[j][0] = ls[i][k];\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t//cerr << \\\"split-1\\\" << endl;\\n\\t//線分が交差している場合の分割\\n\\tfor (int i = 0; i < (int)ls.size(); i++) {\\n\\t\\tLine li = ls[i];\\n\\t\\tint mx = ls.size();\\n\\t\\tfor (int j = i + 1; j < (int)ls.size(); j++) {\\n\\t\\t\\tpoint cross_p;\\n\\t\\t\\tif (j >= mx)break;\\n\\t\\t\\tif (intersect(ls[i], ls[j], cross_p)) {\\n\\t\\t\\t\\t//if (intersectSS_strict(ls[i], ls[j])) {\\n\\t\\t\\t\\t//point cross_p = crosspoint(ls[i], ls[j]);\\n\\t\\t\\t\\tls.push_back(Line(ls[i][0], cross_p));\\n\\t\\t\\t\\tls[i][0] = cross_p;\\n\\t\\t\\t\\tls.push_back(Line(ls[j][0], cross_p));\\n\\t\\t\\t\\tls[j][0] = cross_p;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\n//線分の集合(split済み)を連結成分に分解する(union-find)\\n\\nstruct Equiv {\\n\\tvector<int>links;\\n\\t//大きさ1の同値類をn個作る\\n\\tEquiv(int n) :links(n) {\\n\\t\\tfor (int i = 0; i < n; i++) {\\n\\t\\t\\tlinks[i] = i;\\n\\t\\t}\\n\\t}\\n\\t//xの属する同値類の代表元を返す\\n\\tint find(int x) {\\n\\t\\tint xx = links[x];\\n\\t\\tif (xx == x)return x;\\n\\t\\treturn links[x] = find(xx);\\n\\t}\\n\\tvoid unify(int x, int y) {\\n\\t\\tint xx = find(x), yy = find(y);\\n\\t\\tif (xx <= yy)links[yy] = xx;\\n\\t\\telse links[xx] = yy;\\n\\t}\\n};\\n\\ntypedef vector<Lines>vLines;\\nvLines connectedComponent(const Lines &ls) {\\n\\tvLines ret;\\n\\tEquiv equiv(ls.size());\\n\\tfor (int i = 0; i < (int)ls.size(); i++) {\\n\\t\\tfor (int j = 0; j < i; j++) {\\n\\t\\t\\tif (connectSS_with_endpoint(ls[i], ls[j])) {\\n\\t\\t\\t\\tequiv.unify(i, j);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t//cerr << \\\"connected-1\\\" << endl;\\n\\tfor (int i = 0; i < (int)ls.size(); i++) {\\n\\t\\tif (equiv.find(i) == i) {\\n\\t\\t\\tLines newLs;\\n\\t\\t\\tnewLs.push_back(ls[i]);\\n\\t\\t\\tfor (int j = i + 1; j < (int)ls.size(); j++) {\\n\\t\\t\\t\\tif (equiv.find(j) == i)newLs.push_back(ls[j]);\\n\\t\\t\\t}\\n\\t\\t\\tret.push_back(newLs);\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\n//左手法でのトレース\\n//偏角でソートされた隣接点のvectorを得る\\ntypedef pair<double, point>doublePoint;\\ntypedef vector<doublePoint> vDoublePoint;\\ntypedef map<point, vDoublePoint> adjPoint;\\ntypedef vector<point>points;\\n//移動前の点と隣接点のリストから移動先を決定\\npoint findNext(const vDoublePoint &vdp, const point &p) {\\n\\tfor (int i = 0; i < (int)vdp.size() - 1; i++) {\\n\\t\\tif (p == vdp[i].second) {\\n\\t\\t\\treturn vdp[i + 1].second;\\n\\t\\t}\\n\\t}\\n\\treturn vdp[0].second;\\n}\\n//左手法でトレースして通った点の列を返す\\npoints trace(const Lines &ls) {\\n\\tadjPoint aPoint;\\n\\t//隣接点(偏角付き)のリストを作成\\n\\tfor (int i = 0; i < (int)ls.size(); i++) {\\n\\t\\taPoint[ls[i][0]].push_back(doublePoint(arg(ls[i][1] - ls[i][0]), ls[i][1]));\\n\\t\\taPoint[ls[i][1]].push_back(doublePoint(arg(ls[i][0] - ls[i][1]), ls[i][0]));\\n\\t}\\n\\t//x座標最小の点の計算と隣接点リストのソート\\n\\tpoint minPoint(INT_MAX, INT_MAX);\\n\\tadjPoint::iterator it;\\n\\tfor (it = aPoint.begin(); it != aPoint.end(); ++it) {\\n\\t\\tpoint p = it->first;\\n\\t\\tminPoint = min(minPoint, p);\\n\\t\\tvDoublePoint &vdp = it->second;\\n\\t\\tsort(vdp.begin(), vdp.end());\\n\\t}\\n\\tpoints ret;\\n\\tret.push_back(minPoint);\\n\\t//最初の移動先\\n\\tpoint curP = aPoint[minPoint][0].second;\\n\\tpoint lastP = minPoint;\\n\\t//トレースの繰り返し\\n\\twhile (curP != minPoint) {\\n\\t\\tif (DEBUG)cerr << curP << endl;\\n\\t\\tret.push_back(curP);\\n\\t\\tpoint nextP = findNext(aPoint[curP], lastP);\\n\\t\\t//if(isSamePoint(curP,nextP))break;\\n\\t\\tlastP = curP;\\n\\t\\tcurP = nextP;\\n\\t}\\n\\t//開始点を最後にも追加\\n\\tret.push_back(minPoint);\\n\\treturn ret;\\n}\\n\\nbool isInside(const points &ps) {\\n\\tLine l0(point(0, 0), point(51.0, 1.0 / 20000.0));\\n\\tint count = 0;\\n\\tfor (int i = 0; i < (int)ps.size() - 1; i++) {\\n\\t\\tpoint dummy;\\n\\t\\tLine l1(ps[i], ps[i + 1]);\\n\\t\\tif (intersect(l0, l1, dummy))count++;\\n\\t}\\n\\treturn (count & 1) == 1;\\n}\\n\\n\\n//円\\nstruct Circle {\\n\\tpoint p; double r;\\n\\tCircle(const point &p_, double r_) : p(p_), r(r_) { }\\n};\\n\\n//凸包\\nvector<point> convex_hull(vector<point> ps) {\\n\\tint n = ps.size(), k = 0;\\n\\tsort(ps.begin(), ps.end());\\n\\tvector<point> ch(2 * n);\\n\\tfor (int i = 0; i < n; ch[k++] = ps[i++]) // lower-hull\\n\\t\\twhile (k >= 2 && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\\n\\tfor (int i = n - 2, t = k + 1; i >= 0; ch[k++] = ps[i--]) // upper-hull\\n\\t\\twhile (k >= t && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\\n\\tch.resize(k - 1);\\n\\treturn ch;\\n}\\n\\n//2点を通る半径Rの円の中心\\npair<point, point> get_circle_from_2points(point &p1, point &p2, double R) {\\n\\tdouble d = dist(p1, p2);\\n\\tdouble x1 = p1.real(), x2 = p2.real();\\n\\tdouble y1 = p1.imag(), y2 = p2.imag();\\n\\tif (p1.imag() == p2.imag()) {\\n\\t\\tdouble x = (x1 + x2) / 2.0;\\n\\t\\tdouble dy = sqrt(R - d * d / 4);\\n\\t\\treturn { { x,y1 + dy },{ x,y1 - dy } };\\n\\t}\\n\\telse {\\n\\t\\tdouble m = (x1 - x2) / (y2 - y1);\\n\\t\\tdouble t = sqrt(R*R - d * d / 4);\\n\\t\\tdouble dx = sqrt((t*t) / (m*m + 1));\\n\\t\\tdouble dy = sqrt(t*t - dx * dx);\\n\\t\\tdouble gx = (x1 + x2) / 2;\\n\\t\\tdouble gy = (y1 + y2) / 2;\\n\\t\\tif (m > EPS) {\\n\\t\\t\\treturn { { gx + dx,gy + dy },{ gx - dx,gy - dy } };\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\treturn { { gx + dx,gy - dy },{ gx - dx,gy + dy } };\\n\\t\\t}\\n\\t}\\n}\\n//長方形\\nstruct Square {\\n\\tdouble lx, ly, rx, ry;\\n\\tSquare(double lx_, double ly_, double rx_, double ry_) :lx(lx_), ly(ly_), rx(rx_), ry(ry_) {};\\n\\tbool include(point &p) {\\n\\t\\treturn p.real() + EPS >= lx && p.real() - EPS <= rx && p.imag() + EPS >= ly && p.imag() - EPS <= ry;\\n\\t}\\n};\\n\\nstruct Polygon : public vector<point> {\\n\\t//0->OUT, 1->ON, 2->IN\\n\\tint contains(const point &p) {\\n\\t\\tbool in = false;\\n\\t\\tint N = this->size();\\n\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\tpoint a = this->at(i) - p;\\n\\t\\t\\tpoint b = this->at((i + 1) % N) - p;\\n\\t\\t\\tif (imag(a) > imag(b)) {\\n\\t\\t\\t\\tstd::swap(a, b);\\n\\t\\t\\t}\\n\\t\\t\\tif (imag(a) <= 0 && 0 < imag(b))\\n\\t\\t\\t\\tif (cross(a, b) < 0)in = !in;\\n\\t\\t\\tif (cross(a, b) == 0 && dot(a, b) <= 0)return 1;\\n\\t\\t}\\n\\t\\treturn in ? 2 : 0;\\n\\t}\\n};\\nclock_t START, END;\\nbool trapAll() {\\n\\tint N; cin >> N;\\n\\tif (N == 0) {\\n\\t\\tEND = clock();\\n\\t\\tdouble t = (double)(END - START) / CLOCKS_PER_SEC;\\n\\t\\t//cerr << \\\"elapsed time\\\" << t << \\\"[sec]\\\" << endl;\\n\\t\\texit(0);\\n\\t}\\n\\tLines ls;\\n\\tREP(i, N) {\\n\\t\\tdouble x1, y1, x2, y2;\\n\\t\\tcin >> x1 >> y1 >> x2 >> y2;\\n\\t\\tpoint p1(x1, y1);\\n\\t\\tpoint p2(x2, y2);\\n\\t\\tls.push_back(Line(p1, p2));\\n\\t}\\n\\tsplitSegments(ls);\\n\\t// for(auto l:ls){\\n\\t// \\tcerr<<l[0]<<\\\" \\\"<<l[1]<<endl;\\n\\t// }\\n\\t//cerr << \\\"splitted\\\" << endl;\\n\\tvLines vls = connectedComponent(ls);\\n\\tfor (auto lines : vls) {\\n\\t\\tif(isInside(trace(lines)))return true;\\n\\t\\t// Polygon poly;\\n\\t\\t// points ps = trace(lines);\\n\\t\\t// for (auto p : ps) {\\n\\t\\t// \\tpoly.push_back(p);\\n\\t\\t// }\\n\\t\\t// if (poly.contains(point(0, 0)))return true;\\n\\t}\\n\\treturn false;\\n}\\n\\nvoid solve() {\\n\\tif (trapAll())cout << \\\"yes\\\" << endl;\\n\\telse cout << \\\"no\\\" << endl;\\n\\tif (DEBUG)cerr << \\\"+++++++++++++\\\" << endl;\\n}\\nsigned main() {\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\n\\tSTART = clock();\\n\\twhile (true)\\n\\t\\tsolve();\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5130,\n \"memory_kb\": 6292,\n \"score_of_the_acc\": -1.1079,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1247_4320282\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include\\\"bits/stdc++.h\\\"\\n\\nusing namespace std;\\n\\n#define REP(i,n) for(int i=0;i<(n);i++)\\n#define FOR(i,m,n) for(int i=(m);i<(n);i++)\\n\\nconst bool DEBUG = false;\\n\\nconst double EPS = 1e-8;\\ntypedef complex<double> point;\\nistream &operator>>(istream &is, point &p) {\\n double a, b;\\n is >> a >> b;\\n p = point(a, b);\\n return is;\\n}\\npoint operator*(const point&p, const double &d) {\\n\\treturn point(real(p)*d, imag(p)*d);\\n}\\nnamespace std {\\n\\tbool operator < (const point& a, const point& b) {\\n\\t\\treturn real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\\n\\t}\\n}\\n\\n//直線or線分\\nstruct Line : public vector<point> {\\n\\tLine(const point &a, const point &b) {\\n\\t\\tpush_back(a); push_back(b);\\n\\t}\\n};\\ntypedef vector<Line>Lines;\\n\\n\\ndouble cross(const point& a, const point& b) {\\n return real(a)*imag(b)-imag(a)*real(b);\\n}\\ndouble dot(const point& a, const point& b) {\\n return real(a)*real(b)+imag(a)*imag(b);\\n}\\nint ccw(point a, point b, point c) {\\n\\tb =b-a; c =c - a;\\n\\tif (cross(b, c) > EPS) return +1; // counter clockwise\\n\\tif (cross(b, c) < -EPS) return -1; // clockwise\\n\\tif (dot(b, c) < -EPS) return +2; // c--a--b on line\\n\\tif (norm(b) < norm(c)) return -2; // a--b--c on line\\n\\treturn 0;\\n}\\n//交差判定\\nbool intersectLL(const Line &l1, const Line &l2) {\\n\\treturn abs(cross(l1[1] - l1[0], l2[1] - l2[0])) > EPS || //non-parallel\\n\\t\\tabs(cross(l1[1] - l1[0], l2[0] - l1[0])) < EPS; //same line\\n}\\nbool intersectLS(const Line &l, const Line &s) {\\n\\treturn cross(l[1] - l[0], s[0] - l[0])* // s[0] is left of l\\n\\t\\tcross(l[1] - l[0], s[1] - l[0]) < EPS; // s[1] is right of l\\n}\\nbool intersectLP(const Line &l, const point &p) {\\n\\treturn abs(cross(l[1] - p, l[0] - p)) < EPS;\\n}\\n//端点に乗ってたらfalse\\nbool intersectSP_without_endpoint(const Line &s, const point &p) {\\n\\tif (abs(s[0] - p) < EPS || abs(s[1] - p) < EPS)return false;\\n\\treturn abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < EPS; //triangle inequality\\n}\\n\\nbool intersectSP(const Line &s, const point &p) { //verified on 2020/04/03 https://onlinejudge.u-aizu.ac.jp/status/users/Mojumbo/submissions/1/1157/judge/4316978/C++14\\n\\treturn abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < EPS; //triangle inequality\\n}\\nbool connectSS(const Line &s, const Line &t) {\\n\\tif (intersectSP(s, t[0]) || intersectSP(s, t[1]) || intersectSP(t, s[0]) || intersectSP(t, s[1]))return true;\\n\\telse return false;\\n}\\nbool isSamePoint(const point &p1,const point &p2){\\n\\treturn abs(p1-p2)<EPS;\\n}\\nbool connectSS_with_endpoint(const Line &s,const Line &t){\\n\\tREP(i,2)REP(j,2){\\n\\t\\t//if(isSamePoint(s[i],t[j]))return true;\\n\\t\\tif(s[i]==t[j])return true;\\n\\t}\\n\\treturn false;\\n}\\nbool intersectSS(const Line &s, const Line &t) {\\n\\treturn ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1]) <= 0 &&\\n\\t\\tccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1]) <= 0;\\n}\\nbool intersectSS_strict(const Line &s, const Line &t) {\\n\\t//端点が線分上に乗っている場合はfalseにする\\n\\tif (connectSS(s, t))return false;\\n\\treturn ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1]) <= 0 &&\\n\\t\\tccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1]) <= 0;\\n}\\n\\nbool isOn(const Line &l,const point &p){\\n\\tif(l[0]==p||l[1]==p)return false;\\n\\tpoint d=l[1]-l[0];\\n\\tpoint p0=(p-l[0])/d;\\n\\treturn p0.imag()==0.0&&0.0<p0.real()&&p0.real()<1.0;\\n}\\nbool intersect(const Line &l0,const Line &l1, point &p){\\n\\tif(connectSS_with_endpoint(l0,l1)||isOn(l0,l1[0])||isOn(l0,l1[1])||isOn(l1,l0[0])||isOn(l1,l0[1]))return false;\\n\\tpoint d = l0[1]-l0[0];\\n\\tpoint p0=(l1[0]-l0[0])/d;\\n\\tpoint p1=(l1[1]-l0[0])/d;\\n\\tif(p0.imag()*p1.imag()>=0)return false;\\n\\tdouble t=p0.imag()/(p0.imag()-p1.imag());\\n\\tdouble s=p0.real()*(1-t)+p1.real()*t;\\n\\tif(s<=0.0||1.0<=s)return false;\\n\\tp=l0[0]+d*s;\\n\\treturn true;\\n}\\n\\n//距離,交点\\n//射影 直線lにpから下した垂線との交点\\n\\npoint projection(const Line &l, const point &p) { //verified on 2020/04/03 https://onlinejudge.u-aizu.ac.jp/status/users/Mojumbo/submissions/1/1157/judge/4316978/C++14\\n\\tdouble t = dot(p - l[0], l[0] - l[1]) / norm(l[0] - l[1]);\\n\\treturn l[0] + (l[0] - l[1])*t;\\n}\\n//射影 直線lを対象軸としてpと線対称にある点\\npoint reflection(const Line &l, const point &p) {\\n\\treturn p + (projection(l, p) - p) * 2;\\n}\\ndouble distancePP(const point& a, const point& b) {\\n\\treturn sqrt(norm(a - b));\\n}\\ndouble distanceLP(const Line &l, const point &p) {\\n\\treturn abs(p - projection(l, p));\\n}\\ndouble distanceLL(const Line&l, const Line &m) {\\n\\treturn intersectLL(l, m) ? 0 : distanceLP(l, m[0]);\\n}\\ndouble distanceLS(const Line &l, const Line &s) {\\n\\tif (intersectLS(l, s))return 0;\\n\\treturn min(distanceLP(l, s[0]), distanceLP(l, s[1]));\\n}\\ndouble distanceSP(const Line &s, const point &p) {\\n\\tconst point r = projection(s, p);\\n\\tif (intersectSP(s, r))return abs(r - p);\\n\\treturn min(abs(s[0] - p), abs(s[1] - p));\\n}\\ndouble distanceSS(const Line &s, const Line &t) { //verified on 2020/04/03 https://onlinejudge.u-aizu.ac.jp/status/users/Mojumbo/submissions/1/1157/judge/4316978/C++14\\n\\tif (intersectSS(s, t))return 0;\\n\\treturn min({ distanceSP(s,t[0]),distanceSP(s,t[1]),distanceSP(t,s[0]),distanceSP(t,s[1]) });\\n}\\npoint crosspoint(const Line &l, const Line &m) {\\n\\tdouble A = cross(l[1] - l[0], m[1] - m[0]);\\n\\tdouble B = cross(l[1] - l[0], l[1] - m[0]);\\n\\tif (abs(A) < EPS&&abs(B) < EPS)return m[0];//same line\\n\\tif (abs(A) < EPS)assert(false); // Precondition not satisfied\\n\\treturn m[0] + B / A * (m[1] - m[0]);\\n}\\ndouble dist(point &p1, point &p2) {\\n\\treturn abs(p1 - p2);\\n}\\n\\n//線分同士の交点で分割して端点以外の共有点を持たないようにする\\nvoid splitSegments(Lines &ls) {\\n\\t//端点が線分上に乗っている場合の分割\\n\\tfor (size_t i = 0; i < ls.size(); i++)for (size_t j = i + 1; j < ls.size(); j++) {\\n\\t\\tfor (int k = 0; k < 2; k++) {\\n\\t\\t\\t//if(isOn(ls[i],ls[j][k])){\\n\\t\\t\\tif (intersectSP_without_endpoint(ls[i], ls[j][k])) {\\n\\t\\t\\t\\tls.push_back(Line(ls[i][0], ls[j][k]));\\n\\t\\t\\t\\tls[i][0] = ls[j][k];\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\t//else if(isOn(ls[j],ls[i][k])){\\n\\t\\t\\telse if (intersectSP_without_endpoint(ls[j], ls[i][k])) {\\n\\t\\t\\t\\tls.push_back(Line(ls[j][0], ls[i][k]));\\n\\t\\t\\t\\tls[j][0] = ls[i][k];\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t//cerr << \\\"split-1\\\" << endl;\\n\\t//線分が交差している場合の分割\\n\\tfor (size_t i = 0; i < ls.size(); i++) {\\n\\t\\tLine li = ls[i];\\n\\t\\tfor (size_t j = i + 1; j < ls.size(); j++) {\\n\\t\\t\\tpoint cross_p;\\n\\t\\t\\tif(intersect(ls[i],ls[j],cross_p)){\\n\\t\\t\\t//if (intersectSS_strict(ls[i], ls[j])) {\\n\\t\\t\\t\\t//point cross_p = crosspoint(ls[i], ls[j]);\\n\\t\\t\\t\\tls.push_back(Line(ls[i][0], cross_p));\\n\\t\\t\\t\\tls[i][0] = cross_p;\\n\\t\\t\\t\\tls.push_back(Line(ls[j][0], cross_p));\\n\\t\\t\\t\\tls[j][0] = cross_p;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\n//線分の集合(split済み)を連結成分に分解する(union-find)\\n\\nstruct Equiv {\\n\\tvector<int>links;\\n\\t//大きさ1の同値類をn個作る\\n\\tEquiv(int n):links(n){\\n\\t\\tfor (int i = 0; i < n; i++) {\\n\\t\\t\\tlinks[i] = i;\\n\\t\\t}\\n\\t}\\n\\t//xの属する同値類の代表元を返す\\n\\tint find(int x) {\\n\\t\\tint xx = links[x];\\n\\t\\tif (xx == x)return x;\\n\\t\\treturn links[x] = find(xx);\\n\\t}\\n\\tvoid unify(int x, int y) {\\n\\t\\tint xx = find(x), yy = find(y);\\n\\t\\tif (xx <= yy)links[yy] = xx;\\n\\t\\telse links[xx] = yy;\\n\\t}\\n};\\n\\ntypedef vector<Lines>vLines;\\nvLines connectedComponent(const Lines &ls) {\\n\\tvLines ret;\\n\\tEquiv equiv(ls.size());\\n\\tfor (int i = 0; i < (int)ls.size(); i++) {\\n\\t\\tfor (int j = 0; j < i; j++) {\\n\\t\\t\\tif (connectSS_with_endpoint(ls[i], ls[j])) {\\n\\t\\t\\t\\tequiv.unify(i, j);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t//cerr << \\\"connected-1\\\" << endl;\\n\\tfor (int i = 0; i < (int)ls.size(); i++) {\\n\\t\\tif (equiv.find(i) == i) {\\n\\t\\t\\tLines newLs;\\n\\t\\t\\tnewLs.push_back(ls[i]);\\n\\t\\t\\tfor (int j = i + 1; j < (int)ls.size(); j++) {\\n\\t\\t\\t\\tif (equiv.find(j) == i)newLs.push_back(ls[j]);\\n\\t\\t\\t}\\n\\t\\t\\tret.push_back(newLs);\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\n//左手法でのトレース\\n//偏角でソートされた隣接点のvectorを得る\\ntypedef pair<double, point>doublePoint;\\ntypedef vector<doublePoint> vDoublePoint;\\ntypedef map<point, vDoublePoint> adjPoint;\\ntypedef vector<point>points;\\n//移動前の点と隣接点のリストから移動先を決定\\npoint findNext(const vDoublePoint &vdp, const point &p) {\\n\\tfor (int i = 0; i < (int)vdp.size() - 1; i++) {\\n\\t\\tif (p == vdp[i].second) {\\n\\t\\t\\treturn vdp[i + 1].second;\\n\\t\\t}\\n\\t}\\n\\treturn vdp[0].second;\\n}\\n//左手法でトレースして通った点の列を返す\\npoints trace(const Lines &ls) {\\n\\tadjPoint aPoint;\\n\\t//隣接点(偏角付き)のリストを作成\\n\\tfor (int i = 0; i < (int)ls.size(); i++) {\\n\\t\\taPoint[ls[i][0]].push_back(doublePoint(arg(ls[i][1] - ls[i][0]), ls[i][1]));\\n\\t\\taPoint[ls[i][1]].push_back(doublePoint(arg(ls[i][0] - ls[i][1]), ls[i][0]));\\n\\t}\\n\\t//x座標最小の点の計算と隣接点リストのソート\\n\\tpoint minPoint(INT_MAX, INT_MAX);\\n\\tadjPoint::iterator it;\\n\\tfor (it = aPoint.begin(); it != aPoint.end(); ++it) {\\n\\t\\tpoint p = it->first;\\n\\t\\tminPoint = min(minPoint, p);\\n\\t\\tvDoublePoint &vdp = it->second;\\n\\t\\tsort(vdp.begin(), vdp.end());\\n\\t}\\n\\tpoints ret;\\n\\tret.push_back(minPoint);\\n\\t//最初の移動先\\n\\tpoint curP = aPoint[minPoint][0].second;\\n\\tpoint lastP = minPoint;\\n\\t//トレースの繰り返し\\n\\twhile (curP != minPoint) {\\n\\t\\tif(DEBUG)cerr<<curP<<endl;\\n\\t\\tret.push_back(curP);\\n\\t\\tpoint nextP = findNext(aPoint[curP], lastP);\\n\\t\\t//if(isSamePoint(curP,nextP))break;\\n\\t\\tlastP = curP;\\n\\t\\tcurP = nextP;\\n\\t}\\n\\t//開始点を最後にも追加\\n\\tret.push_back(minPoint);\\n\\treturn ret;\\n}\\n\\nbool isInside(const points &ps) {\\n\\tLine l0(point(0, 0), point(51.0, 1.0 / 20000.0));\\n\\tint count = 0;\\n\\tfor (int i = 0; i < (int)ps.size() - 1; i++) {\\n\\t\\tpoint dummy;\\n\\t\\tLine l1(ps[i], ps[i + 1]);\\n\\t\\tif (intersect(l0, l1,dummy))count++;\\n\\t}\\n\\treturn (count & 1) == 1;\\n}\\n\\n\\n//円\\nstruct Circle {\\n\\tpoint p; double r;\\n\\tCircle(const point &p_, double r_) : p(p_), r(r_) { }\\n};\\n\\n//凸包\\nvector<point> convex_hull(vector<point> ps) {\\n\\tint n = ps.size(), k = 0;\\n\\tsort(ps.begin(), ps.end());\\n\\tvector<point> ch(2 * n);\\n\\tfor (int i = 0; i < n; ch[k++] = ps[i++]) // lower-hull\\n\\t\\twhile (k >= 2 && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\\n\\tfor (int i = n - 2, t = k + 1; i >= 0; ch[k++] = ps[i--]) // upper-hull\\n\\t\\twhile (k >= t && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\\n\\tch.resize(k - 1);\\n\\treturn ch;\\n}\\n\\n//2点を通る半径Rの円の中心\\npair<point, point> get_circle_from_2points(point &p1, point &p2, double R) {\\n\\tdouble d = dist(p1, p2);\\n\\tdouble x1 = p1.real(), x2 = p2.real();\\n\\tdouble y1 = p1.imag(), y2 = p2.imag();\\n\\tif (p1.imag() == p2.imag()) {\\n\\t\\tdouble x = (x1 + x2) / 2.0;\\n\\t\\tdouble dy = sqrt(R - d * d / 4);\\n\\t\\treturn { { x,y1 + dy },{ x,y1 - dy } };\\n\\t}\\n\\telse {\\n\\t\\tdouble m = (x1 - x2) / (y2 - y1);\\n\\t\\tdouble t = sqrt(R*R - d * d / 4);\\n\\t\\tdouble dx = sqrt((t*t) / (m*m + 1));\\n\\t\\tdouble dy = sqrt(t*t - dx * dx);\\n\\t\\tdouble gx = (x1 + x2) / 2;\\n\\t\\tdouble gy = (y1 + y2) / 2;\\n\\t\\tif (m > EPS) {\\n\\t\\t\\treturn { { gx + dx,gy + dy },{ gx - dx,gy - dy } };\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\treturn { { gx + dx,gy - dy },{ gx - dx,gy + dy } };\\n\\t\\t}\\n\\t}\\n}\\n//長方形\\nstruct Square {\\n\\tdouble lx, ly, rx, ry;\\n\\tSquare(double lx_, double ly_, double rx_, double ry_) :lx(lx_), ly(ly_), rx(rx_), ry(ry_) {};\\n\\tbool include(point &p) {\\n\\t\\treturn p.real() + EPS >= lx && p.real() - EPS <= rx && p.imag() + EPS >= ly && p.imag() - EPS <= ry;\\n\\t}\\n};\\n\\nstruct Polygon : public vector<point> {\\n\\t//0->OUT, 1->ON, 2->IN\\n\\tint contains(const point &p) {\\n\\t\\tbool in = false;\\n\\t\\tint N = this->size();\\n\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\tpoint a = this->at(i) - p;\\n\\t\\t\\tpoint b = this->at((i + 1) % N) - p;\\n\\t\\t\\tif (imag(a) > imag(b)) {\\n\\t\\t\\t\\tstd::swap(a, b);\\n\\t\\t\\t}\\n\\t\\t\\tif (imag(a) <= 0 && 0 < imag(b))\\n\\t\\t\\t\\tif (cross(a, b) < 0)in = !in;\\n\\t\\t\\tif (cross(a, b) == 0 && dot(a, b) <= 0)return 1;\\n\\t\\t}\\n\\t\\treturn in ? 2 : 0;\\n\\t}\\n};\\nclock_t START,END;\\nbool trapAll() {\\n\\tint N; cin >> N;\\n\\tif (N == 0){\\n\\t\\tEND=clock();\\n\\t\\tdouble t=(double)(END-START)/CLOCKS_PER_SEC;\\n\\t\\tif(DEBUG)cerr<<\\\"elapsed time\\\"<<t<<\\\"[sec]\\\"<<endl;\\n\\t\\texit(0);\\n\\t}\\n\\tLines ls;\\n\\tREP(i, N) {\\n\\t\\tdouble x1, y1, x2, y2;\\n\\t\\tcin >> x1 >> y1 >> x2 >> y2;\\n\\t\\tpoint p1(x1, y1);\\n\\t\\tpoint p2(x2, y2);\\n\\t\\tls.push_back(Line(p1, p2));\\n\\t}\\n\\tsplitSegments(ls);\\n\\t// for(auto l:ls){\\n\\t// \\tcerr<<l[0]<<\\\" \\\"<<l[1]<<endl;\\n\\t// }\\n\\t//cerr << \\\"splitted\\\" << endl;\\n\\tvLines vls = connectedComponent(ls);\\n\\tfor (auto lines : vls) {\\n\\t\\tPolygon poly;\\n\\t\\tpoints ps= trace(lines);\\n\\t\\tfor (auto p : ps) {\\n\\t\\t\\tpoly.push_back(p);\\n\\t\\t}\\n\\t\\tif (poly.contains(point(0, 0)))return true;\\n\\t}\\n\\treturn false;\\n}\\n\\nvoid solve() {\\n\\tif (trapAll())cout << \\\"yes\\\" << endl;\\n\\telse cout << \\\"no\\\" << endl;\\n\\tif(DEBUG)cerr<<\\\"+++++++++++++\\\"<<endl;\\n}\\nsigned main() {\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\n\\tSTART = clock();\\n\\twhile (true)\\n\\t\\tsolve();\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5140,\n \"memory_kb\": 6448,\n \"score_of_the_acc\": -1.1269,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1247_4320281\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include\\\"bits/stdc++.h\\\"\\n\\nusing namespace std;\\n\\n#define REP(i,n) for(int i=0;i<(n);i++)\\n#define FOR(i,m,n) for(int i=(m);i<(n);i++)\\n\\nconst bool DEBUG = false;\\n\\nconst double EPS = 1e-8;\\ntypedef complex<double> point;\\nistream &operator>>(istream &is, point &p) {\\n double a, b;\\n is >> a >> b;\\n p = point(a, b);\\n return is;\\n}\\npoint operator*(const point&p, const double &d) {\\n\\treturn point(real(p)*d, imag(p)*d);\\n}\\nnamespace std {\\n\\tbool operator < (const point& a, const point& b) {\\n\\t\\treturn real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\\n\\t}\\n}\\n\\n//直線or線分\\nstruct Line : public vector<point> {\\n\\tLine(const point &a, const point &b) {\\n\\t\\tpush_back(a); push_back(b);\\n\\t}\\n};\\ntypedef vector<Line>Lines;\\n\\n\\ndouble cross(const point& a, const point& b) {\\n return real(a)*imag(b)-imag(a)*real(b);\\n}\\ndouble dot(const point& a, const point& b) {\\n return real(a)*real(b)+imag(a)*imag(b);\\n}\\nint ccw(point a, point b, point c) {\\n\\tb =b-a; c =c - a;\\n\\tif (cross(b, c) > EPS) return +1; // counter clockwise\\n\\tif (cross(b, c) < -EPS) return -1; // clockwise\\n\\tif (dot(b, c) < -EPS) return +2; // c--a--b on line\\n\\tif (norm(b) < norm(c)) return -2; // a--b--c on line\\n\\treturn 0;\\n}\\n//交差判定\\nbool intersectLL(const Line &l1, const Line &l2) {\\n\\treturn abs(cross(l1[1] - l1[0], l2[1] - l2[0])) > EPS || //non-parallel\\n\\t\\tabs(cross(l1[1] - l1[0], l2[0] - l1[0])) < EPS; //same line\\n}\\nbool intersectLS(const Line &l, const Line &s) {\\n\\treturn cross(l[1] - l[0], s[0] - l[0])* // s[0] is left of l\\n\\t\\tcross(l[1] - l[0], s[1] - l[0]) < EPS; // s[1] is right of l\\n}\\nbool intersectLP(const Line &l, const point &p) {\\n\\treturn abs(cross(l[1] - p, l[0] - p)) < EPS;\\n}\\n//端点に乗ってたらfalse\\nbool intersectSP_without_endpoint(const Line &s, const point &p) {\\n\\tif (abs(s[0] - p) < EPS || abs(s[1] - p) < EPS)return false;\\n\\treturn abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < EPS; //triangle inequality\\n}\\n\\nbool intersectSP(const Line &s, const point &p) { //verified on 2020/04/03 https://onlinejudge.u-aizu.ac.jp/status/users/Mojumbo/submissions/1/1157/judge/4316978/C++14\\n\\treturn abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < EPS; //triangle inequality\\n}\\nbool connectSS(const Line &s, const Line &t) {\\n\\tif (intersectSP(s, t[0]) || intersectSP(s, t[1]) || intersectSP(t, s[0]) || intersectSP(t, s[1]))return true;\\n\\telse return false;\\n}\\nbool isSamePoint(const point &p1,const point &p2){\\n\\treturn abs(p1-p2)<EPS;\\n}\\nbool connectSS_with_endpoint(const Line &s,const Line &t){\\n\\tREP(i,2)REP(j,2){\\n\\t\\t//if(isSamePoint(s[i],t[j]))return true;\\n\\t\\tif(s[i]==t[j])return true;\\n\\t}\\n\\treturn false;\\n}\\nbool intersectSS(const Line &s, const Line &t) {\\n\\treturn ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1]) <= 0 &&\\n\\t\\tccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1]) <= 0;\\n}\\nbool intersectSS_strict(const Line &s, const Line &t) {\\n\\t//端点が線分上に乗っている場合はfalseにする\\n\\tif (connectSS(s, t))return false;\\n\\treturn ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1]) <= 0 &&\\n\\t\\tccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1]) <= 0;\\n}\\n\\nbool isOn(const Line &l,const point &p){\\n\\tif(l[0]==p||l[1]==p)return false;\\n\\tpoint d=l[1]-l[0];\\n\\tpoint p0=(p-l[0])/d;\\n\\treturn p0.imag()==0.0&&0.0<p0.real()&&p0.real()<1.0;\\n}\\nbool intersect(const Line &l0,const Line &l1, point &p){\\n\\tif(connectSS_with_endpoint(l0,l1)||isOn(l0,l1[0])||isOn(l0,l1[1])||isOn(l1,l0[0])||isOn(l1,l0[1]))return false;\\n\\tpoint d = l0[1]-l0[0];\\n\\tpoint p0=(l1[0]-l0[0])/d;\\n\\tpoint p1=(l1[1]-l0[0])/d;\\n\\tif(p0.imag()*p1.imag()>=0)return false;\\n\\tdouble t=p0.imag()/(p0.imag()-p1.imag());\\n\\tdouble s=p0.real()*(1-t)+p1.real()*t;\\n\\tif(s<=0.0||1.0<=s)return false;\\n\\tp=l0[0]+d*s;\\n\\treturn true;\\n}\\n\\n//距離,交点\\n//射影 直線lにpから下した垂線との交点\\n\\npoint projection(const Line &l, const point &p) { //verified on 2020/04/03 https://onlinejudge.u-aizu.ac.jp/status/users/Mojumbo/submissions/1/1157/judge/4316978/C++14\\n\\tdouble t = dot(p - l[0], l[0] - l[1]) / norm(l[0] - l[1]);\\n\\treturn l[0] + (l[0] - l[1])*t;\\n}\\n//射影 直線lを対象軸としてpと線対称にある点\\npoint reflection(const Line &l, const point &p) {\\n\\treturn p + (projection(l, p) - p) * 2;\\n}\\ndouble distancePP(const point& a, const point& b) {\\n\\treturn sqrt(norm(a - b));\\n}\\ndouble distanceLP(const Line &l, const point &p) {\\n\\treturn abs(p - projection(l, p));\\n}\\ndouble distanceLL(const Line&l, const Line &m) {\\n\\treturn intersectLL(l, m) ? 0 : distanceLP(l, m[0]);\\n}\\ndouble distanceLS(const Line &l, const Line &s) {\\n\\tif (intersectLS(l, s))return 0;\\n\\treturn min(distanceLP(l, s[0]), distanceLP(l, s[1]));\\n}\\ndouble distanceSP(const Line &s, const point &p) {\\n\\tconst point r = projection(s, p);\\n\\tif (intersectSP(s, r))return abs(r - p);\\n\\treturn min(abs(s[0] - p), abs(s[1] - p));\\n}\\ndouble distanceSS(const Line &s, const Line &t) { //verified on 2020/04/03 https://onlinejudge.u-aizu.ac.jp/status/users/Mojumbo/submissions/1/1157/judge/4316978/C++14\\n\\tif (intersectSS(s, t))return 0;\\n\\treturn min({ distanceSP(s,t[0]),distanceSP(s,t[1]),distanceSP(t,s[0]),distanceSP(t,s[1]) });\\n}\\npoint crosspoint(const Line &l, const Line &m) {\\n\\tdouble A = cross(l[1] - l[0], m[1] - m[0]);\\n\\tdouble B = cross(l[1] - l[0], l[1] - m[0]);\\n\\tif (abs(A) < EPS&&abs(B) < EPS)return m[0];//same line\\n\\tif (abs(A) < EPS)assert(false); // Precondition not satisfied\\n\\treturn m[0] + B / A * (m[1] - m[0]);\\n}\\ndouble dist(point &p1, point &p2) {\\n\\treturn abs(p1 - p2);\\n}\\n\\n//線分同士の交点で分割して端点以外の共有点を持たないようにする\\nvoid splitSegments(Lines &ls) {\\n\\t//端点が線分上に乗っている場合の分割\\n\\tfor (size_t i = 0; i < ls.size(); i++)for (size_t j = i + 1; j < ls.size(); j++) {\\n\\t\\tfor (int k = 0; k < 2; k++) {\\n\\t\\t\\tif(isOn(ls[i],ls[j][k])){\\n\\t\\t\\t//if (intersectSP_without_endpoint(ls[i], ls[j][k])) {\\n\\t\\t\\t\\tls.push_back(Line(ls[i][0], ls[j][k]));\\n\\t\\t\\t\\tls[i][0] = ls[j][k];\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\telse if(isOn(ls[j],ls[i][k])){\\n\\t\\t\\t//else if (intersectSP_without_endpoint(ls[j], ls[i][k])) {\\n\\t\\t\\t\\tls.push_back(Line(ls[j][0], ls[i][k]));\\n\\t\\t\\t\\tls[j][0] = ls[i][k];\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t//cerr << \\\"split-1\\\" << endl;\\n\\t//線分が交差している場合の分割\\n\\tfor (size_t i = 0; i < ls.size(); i++) {\\n\\t\\tLine li = ls[i];\\n\\t\\tfor (size_t j = i + 1; j < ls.size(); j++) {\\n\\t\\t\\tpoint cross_p;\\n\\t\\t\\tif(intersect(ls[i],ls[j],cross_p)){\\n\\t\\t\\t//if (intersectSS_strict(ls[i], ls[j])) {\\n\\t\\t\\t\\t//point cross_p = crosspoint(ls[i], ls[j]);\\n\\t\\t\\t\\tls.push_back(Line(ls[i][0], cross_p));\\n\\t\\t\\t\\tls[i][0] = cross_p;\\n\\t\\t\\t\\tls.push_back(Line(ls[j][0], cross_p));\\n\\t\\t\\t\\tls[j][0] = cross_p;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\n//線分の集合(split済み)を連結成分に分解する(union-find)\\n\\nstruct Equiv {\\n\\tvector<int>links;\\n\\t//大きさ1の同値類をn個作る\\n\\tEquiv(int n):links(n){\\n\\t\\tfor (int i = 0; i < n; i++) {\\n\\t\\t\\tlinks[i] = i;\\n\\t\\t}\\n\\t}\\n\\t//xの属する同値類の代表元を返す\\n\\tint find(int x) {\\n\\t\\tint xx = links[x];\\n\\t\\tif (xx == x)return x;\\n\\t\\treturn links[x] = find(xx);\\n\\t}\\n\\tvoid unify(int x, int y) {\\n\\t\\tint xx = find(x), yy = find(y);\\n\\t\\tif (xx <= yy)links[yy] = xx;\\n\\t\\telse links[xx] = yy;\\n\\t}\\n};\\n\\ntypedef vector<Lines>vLines;\\nvLines connectedComponent(const Lines &ls) {\\n\\tvLines ret;\\n\\tEquiv equiv(ls.size());\\n\\tfor (int i = 0; i < (int)ls.size(); i++) {\\n\\t\\tfor (int j = 0; j < i; j++) {\\n\\t\\t\\tif (connectSS_with_endpoint(ls[i], ls[j])) {\\n\\t\\t\\t\\tequiv.unify(i, j);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t//cerr << \\\"connected-1\\\" << endl;\\n\\tfor (int i = 0; i < (int)ls.size(); i++) {\\n\\t\\tif (equiv.find(i) == i) {\\n\\t\\t\\tLines newLs;\\n\\t\\t\\tnewLs.push_back(ls[i]);\\n\\t\\t\\tfor (int j = i + 1; j < (int)ls.size(); j++) {\\n\\t\\t\\t\\tif (equiv.find(j) == i)newLs.push_back(ls[j]);\\n\\t\\t\\t}\\n\\t\\t\\tret.push_back(newLs);\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\n//左手法でのトレース\\n//偏角でソートされた隣接点のvectorを得る\\ntypedef pair<double, point>doublePoint;\\ntypedef vector<doublePoint> vDoublePoint;\\ntypedef map<point, vDoublePoint> adjPoint;\\ntypedef vector<point>points;\\n//移動前の点と隣接点のリストから移動先を決定\\npoint findNext(const vDoublePoint &vdp, const point &p) {\\n\\tfor (int i = 0; i < (int)vdp.size() - 1; i++) {\\n\\t\\tif (p == vdp[i].second) {\\n\\t\\t\\treturn vdp[i + 1].second;\\n\\t\\t}\\n\\t}\\n\\treturn vdp[0].second;\\n}\\n//左手法でトレースして通った点の列を返す\\npoints trace(const Lines &ls) {\\n\\tadjPoint aPoint;\\n\\t//隣接点(偏角付き)のリストを作成\\n\\tfor (int i = 0; i < (int)ls.size(); i++) {\\n\\t\\taPoint[ls[i][0]].push_back(doublePoint(arg(ls[i][1] - ls[i][0]), ls[i][1]));\\n\\t\\taPoint[ls[i][1]].push_back(doublePoint(arg(ls[i][0] - ls[i][1]), ls[i][0]));\\n\\t}\\n\\t//x座標最小の点の計算と隣接点リストのソート\\n\\tpoint minPoint(INT_MAX, INT_MAX);\\n\\tadjPoint::iterator it;\\n\\tfor (it = aPoint.begin(); it != aPoint.end(); ++it) {\\n\\t\\tpoint p = it->first;\\n\\t\\tminPoint = min(minPoint, p);\\n\\t\\tvDoublePoint &vdp = it->second;\\n\\t\\tsort(vdp.begin(), vdp.end());\\n\\t}\\n\\tpoints ret;\\n\\tret.push_back(minPoint);\\n\\t//最初の移動先\\n\\tpoint curP = aPoint[minPoint][0].second;\\n\\tpoint lastP = minPoint;\\n\\t//トレースの繰り返し\\n\\twhile (curP != minPoint) {\\n\\t\\tif(DEBUG)cerr<<curP<<endl;\\n\\t\\tret.push_back(curP);\\n\\t\\tpoint nextP = findNext(aPoint[curP], lastP);\\n\\t\\t//if(isSamePoint(curP,nextP))break;\\n\\t\\tlastP = curP;\\n\\t\\tcurP = nextP;\\n\\t}\\n\\t//開始点を最後にも追加\\n\\tret.push_back(minPoint);\\n\\treturn ret;\\n}\\n\\nbool isInside(const points &ps) {\\n\\tLine l0(point(0, 0), point(51.0, 1.0 / 20000.0));\\n\\tint count = 0;\\n\\tfor (int i = 0; i < (int)ps.size() - 1; i++) {\\n\\t\\tpoint dummy;\\n\\t\\tLine l1(ps[i], ps[i + 1]);\\n\\t\\tif (intersect(l0, l1,dummy))count++;\\n\\t}\\n\\treturn (count & 1) == 1;\\n}\\n\\n\\n//円\\nstruct Circle {\\n\\tpoint p; double r;\\n\\tCircle(const point &p_, double r_) : p(p_), r(r_) { }\\n};\\n\\n//凸包\\nvector<point> convex_hull(vector<point> ps) {\\n\\tint n = ps.size(), k = 0;\\n\\tsort(ps.begin(), ps.end());\\n\\tvector<point> ch(2 * n);\\n\\tfor (int i = 0; i < n; ch[k++] = ps[i++]) // lower-hull\\n\\t\\twhile (k >= 2 && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\\n\\tfor (int i = n - 2, t = k + 1; i >= 0; ch[k++] = ps[i--]) // upper-hull\\n\\t\\twhile (k >= t && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\\n\\tch.resize(k - 1);\\n\\treturn ch;\\n}\\n\\n//2点を通る半径Rの円の中心\\npair<point, point> get_circle_from_2points(point &p1, point &p2, double R) {\\n\\tdouble d = dist(p1, p2);\\n\\tdouble x1 = p1.real(), x2 = p2.real();\\n\\tdouble y1 = p1.imag(), y2 = p2.imag();\\n\\tif (p1.imag() == p2.imag()) {\\n\\t\\tdouble x = (x1 + x2) / 2.0;\\n\\t\\tdouble dy = sqrt(R - d * d / 4);\\n\\t\\treturn { { x,y1 + dy },{ x,y1 - dy } };\\n\\t}\\n\\telse {\\n\\t\\tdouble m = (x1 - x2) / (y2 - y1);\\n\\t\\tdouble t = sqrt(R*R - d * d / 4);\\n\\t\\tdouble dx = sqrt((t*t) / (m*m + 1));\\n\\t\\tdouble dy = sqrt(t*t - dx * dx);\\n\\t\\tdouble gx = (x1 + x2) / 2;\\n\\t\\tdouble gy = (y1 + y2) / 2;\\n\\t\\tif (m > EPS) {\\n\\t\\t\\treturn { { gx + dx,gy + dy },{ gx - dx,gy - dy } };\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\treturn { { gx + dx,gy - dy },{ gx - dx,gy + dy } };\\n\\t\\t}\\n\\t}\\n}\\n//長方形\\nstruct Square {\\n\\tdouble lx, ly, rx, ry;\\n\\tSquare(double lx_, double ly_, double rx_, double ry_) :lx(lx_), ly(ly_), rx(rx_), ry(ry_) {};\\n\\tbool include(point &p) {\\n\\t\\treturn p.real() + EPS >= lx && p.real() - EPS <= rx && p.imag() + EPS >= ly && p.imag() - EPS <= ry;\\n\\t}\\n};\\n\\nstruct Polygon : public vector<point> {\\n\\t//0->OUT, 1->ON, 2->IN\\n\\tint contains(const point &p) {\\n\\t\\tbool in = false;\\n\\t\\tint N = this->size();\\n\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\tpoint a = this->at(i) - p;\\n\\t\\t\\tpoint b = this->at((i + 1) % N) - p;\\n\\t\\t\\tif (imag(a) > imag(b)) {\\n\\t\\t\\t\\tstd::swap(a, b);\\n\\t\\t\\t}\\n\\t\\t\\tif (imag(a) <= 0 && 0 < imag(b))\\n\\t\\t\\t\\tif (cross(a, b) < 0)in = !in;\\n\\t\\t\\tif (cross(a, b) == 0 && dot(a, b) <= 0)return 1;\\n\\t\\t}\\n\\t\\treturn in ? 2 : 0;\\n\\t}\\n};\\nclock_t START,END;\\nbool trapAll() {\\n\\tint N; cin >> N;\\n\\tif (N == 0){\\n\\t\\tEND=clock();\\n\\t\\tdouble t=(double)(END-START)/CLOCKS_PER_SEC;\\n\\t\\t//cerr<<\\\"elapsed time\\\"<<t<<\\\"[sec]\\\"<<endl;\\n\\t\\texit(0);\\n\\t}\\n\\tLines ls;\\n\\tREP(i, N) {\\n\\t\\tdouble x1, y1, x2, y2;\\n\\t\\tcin >> x1 >> y1 >> x2 >> y2;\\n\\t\\tpoint p1(x1, y1);\\n\\t\\tpoint p2(x2, y2);\\n\\t\\tls.push_back(Line(p1, p2));\\n\\t}\\n\\tsplitSegments(ls);\\n\\t// for(auto l:ls){\\n\\t// \\tcerr<<l[0]<<\\\" \\\"<<l[1]<<endl;\\n\\t// }\\n\\t//cerr << \\\"splitted\\\" << endl;\\n\\tvLines vls = connectedComponent(ls);\\n\\tfor (auto lines : vls) {\\n\\t\\tPolygon poly;\\n\\t\\tpoints ps= trace(lines);\\n\\t\\tfor (auto p : ps) {\\n\\t\\t\\tpoly.push_back(p);\\n\\t\\t}\\n\\t\\tif (poly.contains(point(0, 0)))return true;\\n\\t}\\n\\treturn false;\\n}\\n\\nvoid solve() {\\n\\tif (trapAll())cout << \\\"yes\\\" << endl;\\n\\telse cout << \\\"no\\\" << endl;\\n\\tif(DEBUG)cerr<<\\\"+++++++++++++\\\"<<endl;\\n}\\nsigned main() {\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\n\\tSTART = clock();\\n\\twhile (true)\\n\\t\\tsolve();\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5150,\n \"memory_kb\": 6436,\n \"score_of_the_acc\": -1.1271,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1247_4320251\",\n \"code_snippet\": \"#include\\\"bits/stdc++.h\\\"\\n\\nusing namespace std;\\n\\n#define REP(i,n) for(int i=0;i<(n);i++)\\n#define FOR(i,m,n) for(int i=(m);i<(n);i++)\\n\\nconst double EPS = 1e-8;\\ntypedef complex<double> point;\\npoint operator*(const point&p, const double &d) {\\n\\treturn point(real(p)*d, imag(p)*d);\\n}\\nnamespace std {\\n\\tbool operator < (const point& a, const point& b) {\\n\\t\\treturn real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\\n\\t}\\n\\n\\t//istream &operator>>(istream &stream, point &p) {\\n\\t//\\tstream >> p.real >> p.imag;\\n\\t//\\treturn stream;\\n\\t//}\\n}\\n//bool intersectLL(const Line &l1, const Line &l2);\\n//bool intersectLS(const Line &l, const Line &s);\\n//bool intersectLP(const Line &l, const point &p);\\n//bool intersectSS(const Line &s, const Line &t);\\n//bool intersectSP(const Line &s, const point &p);\\n\\n//直線or線分\\nstruct Line : public vector<point> {\\n\\tLine(const point &a, const point &b) {\\n\\t\\tpush_back(a); push_back(b);\\n\\t}\\n};\\ntypedef vector<Line>Lines;\\n\\n\\n//外積\\ndouble cross(const point& a, const point& b) {\\n\\treturn imag(conj(a)*b);\\n}\\n//内積\\ndouble dot(const point& a, const point& b) {\\n\\treturn real(conj(a)*b);\\n}\\nint ccw(point a, point b, point c) {\\n\\tb -= a; c -= a;\\n\\tif (cross(b, c) > 0) return +1; // counter clockwise\\n\\tif (cross(b, c) < 0) return -1; // clockwise\\n\\tif (dot(b, c) < 0) return +2; // c--a--b on line\\n\\tif (norm(b) < norm(c)) return -2; // a--b--c on line\\n\\treturn 0;\\n}\\n//交差判定\\nbool intersectLL(const Line &l1, const Line &l2) {\\n\\treturn abs(cross(l1[1] - l1[0], l2[1] - l2[0])) > EPS || //non-parallel\\n\\t\\tabs(cross(l1[1] - l1[0], l2[0] - l1[0])) < EPS; //same line\\n}\\nbool intersectLS(const Line &l, const Line &s) {\\n\\treturn cross(l[1] - l[0], s[0] - l[0])* // s[0] is left of l\\n\\t\\tcross(l[1] - l[0], s[1] - l[0]) < EPS; // s[1] is right of l\\n}\\nbool intersectLP(const Line &l, const point &p) {\\n\\treturn abs(cross(l[1] - p, l[0] - p)) < EPS;\\n}\\n//端点に乗ってたらfalse\\nbool intersectSP_without_endpoint(const Line &s, const point &p) {\\n\\tif (abs(s[0] - p) < EPS || abs(s[1] - p) < EPS)return false;\\n\\treturn abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < EPS; //triangle inequality\\n}\\n\\nbool intersectSP(const Line &s, const point &p) { //verified on 2020/04/03 https://onlinejudge.u-aizu.ac.jp/status/users/Mojumbo/submissions/1/1157/judge/4316978/C++14\\n\\treturn abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < EPS; //triangle inequality\\n}\\nbool connectSS(const Line &s, const Line &t) {\\n\\tif (intersectSP(s, t[0]) || intersectSP(s, t[1]) || intersectSP(t, s[0]) || intersectSP(t, s[1]))return true;\\n\\telse return false;\\n}\\nbool isSamePoint(const point &p1,const point &p2){\\n\\treturn abs(p1-p2)<EPS;\\n}\\nbool connectSS_with_endpoint(const Line &s,const Line &t){\\n\\tREP(i,2)REP(j,2){\\n\\t\\t//if(isSamePoint(s[i],t[j]))return true;\\n\\t\\tif(s[i]==t[j])return true;\\n\\t}\\n\\treturn false;\\n}\\nbool intersectSS(const Line &s, const Line &t) {\\n\\t//端点が線分上に乗っている場合はfalseにする\\n\\tif (connectSS(s, t))return false;\\n\\treturn ccw(s[0], s[1], t[0])*ccw(s[0], s[1], t[1]) <= 0 &&\\n\\t\\tccw(t[0], t[1], s[0])*ccw(t[0], t[1], s[1]) <= 0;\\n}\\n\\nbool isOn(const Line &l,const point &p){\\n\\tif(l[0]==p||l[1]==p)return false;\\n\\tpoint d=l[1]-l[0];\\n\\tpoint p0=(p-l[0])/d;\\n\\treturn p0.imag()==0.0&&0.0<p0.real()&&p0.real()<1.0;\\n}\\nbool intersect(const Line &l0,const Line &l1, point &p){\\n\\tif(connectSS_with_endpoint(l0,l1)||isOn(l0,l1[0])||isOn(l0,l1[1])||isOn(l1,l0[0])||isOn(l1,l0[1]))return false;\\n\\tpoint d = l0[1]-l0[0];\\n\\tpoint p0=(l1[0]-l0[0])/d;\\n\\tpoint p1=(l1[1]-l0[0])/d;\\n\\tif(p0.imag()*p1.imag()>=0)return false;\\n\\tdouble t=p0.imag()/(p0.imag()-p1.imag());\\n\\tdouble s=p0.real()*(1-t)+p1.real()*t;\\n\\tif(s<=0.0||1.0<=s)return false;\\n\\tp=l0[0]+d*s;\\n\\treturn true;\\n}\\n\\n//距離,交点\\n//射影 直線lにpから下した垂線との交点\\n\\npoint projection(const Line &l, const point &p) { //verified on 2020/04/03 https://onlinejudge.u-aizu.ac.jp/status/users/Mojumbo/submissions/1/1157/judge/4316978/C++14\\n\\tdouble t = dot(p - l[0], l[0] - l[1]) / norm(l[0] - l[1]);\\n\\treturn l[0] + (l[0] - l[1])*t;\\n}\\n//射影 直線lを対象軸としてpと線対称にある点\\npoint reflection(const Line &l, const point &p) {\\n\\treturn p + (projection(l, p) - p) * 2;\\n}\\ndouble distancePP(const point& a, const point& b) {\\n\\treturn sqrt(norm(a - b));\\n}\\ndouble distanceLP(const Line &l, const point &p) {\\n\\treturn abs(p - projection(l, p));\\n}\\ndouble distanceLL(const Line&l, const Line &m) {\\n\\treturn intersectLL(l, m) ? 0 : distanceLP(l, m[0]);\\n}\\ndouble distanceLS(const Line &l, const Line &s) {\\n\\tif (intersectLS(l, s))return 0;\\n\\treturn min(distanceLP(l, s[0]), distanceLP(l, s[1]));\\n}\\ndouble distanceSP(const Line &s, const point &p) {\\n\\tconst point r = projection(s, p);\\n\\tif (intersectSP(s, r))return abs(r - p);\\n\\treturn min(abs(s[0] - p), abs(s[1] - p));\\n}\\ndouble distanceSS(const Line &s, const Line &t) { //verified on 2020/04/03 https://onlinejudge.u-aizu.ac.jp/status/users/Mojumbo/submissions/1/1157/judge/4316978/C++14\\n\\tif (intersectSS(s, t))return 0;\\n\\treturn min({ distanceSP(s,t[0]),distanceSP(s,t[1]),distanceSP(t,s[0]),distanceSP(t,s[1]) });\\n}\\npoint crosspoint(const Line &l, const Line &m) {\\n\\tdouble A = cross(l[1] - l[0], m[1] - m[0]);\\n\\tdouble B = cross(l[1] - l[0], l[1] - m[0]);\\n\\tif (abs(A) < EPS&&abs(B) < EPS)return m[0];//same line\\n\\tif (abs(A) < EPS)assert(false); // Precondition not satisfied\\n\\treturn m[0] + B / A * (m[1] - m[0]);\\n}\\ndouble dist(point &p1, point &p2) {\\n\\treturn abs(p1 - p2);\\n}\\n\\n//線分同士の交点で分割して端点以外の共有点を持たないようにする\\nvoid splitSegments(Lines &ls) {\\n\\t//端点が線分上に乗っている場合の分割\\n\\tfor (size_t i = 0; i < ls.size(); i++)for (size_t j = i + 1; j < ls.size(); j++) {\\n\\t\\tfor (int k = 0; k < 2; k++) {\\n\\t\\t\\tif(isOn(ls[i],ls[j][k])){\\n\\t\\t\\t//if (intersectSP_without_endpoint(ls[i], ls[j][k])) {\\n\\t\\t\\t\\tls.push_back(Line(ls[i][0], ls[j][k]));\\n\\t\\t\\t\\tls[i][0] = ls[j][k];\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\telse if(isOn(ls[j],ls[i][k])){\\n\\t\\t\\t//else if (intersectSP_without_endpoint(ls[j], ls[i][k])) {\\n\\t\\t\\t\\tls.push_back(Line(ls[j][0], ls[i][k]));\\n\\t\\t\\t\\tls[j][0] = ls[i][k];\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t//cerr << \\\"split-1\\\" << endl;\\n\\t//線分が交差している場合の分割\\n\\tfor (size_t i = 0; i < ls.size(); i++) {\\n\\t\\tLine li = ls[i];\\n\\t\\tfor (size_t j = i + 1; j < ls.size(); j++) {\\n\\t\\t\\tpoint cross_p;\\n\\t\\t\\tif(intersect(ls[i],ls[j],cross_p)){\\n\\t\\t\\t//if (intersectSS(ls[i], ls[j])) {\\n\\t\\t\\t\\t//point cross_p = crosspoint(ls[i], ls[j]);\\n\\t\\t\\t\\tls.push_back(Line(ls[i][0], cross_p));\\n\\t\\t\\t\\tls[i][0] = cross_p;\\n\\t\\t\\t\\tls.push_back(Line(ls[j][0], cross_p));\\n\\t\\t\\t\\tls[j][0] = cross_p;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\n//線分の集合(split済み)を連結成分に分解する(union-find)\\nstruct Equiv {\\n\\tvector<int>links;\\n\\t//大きさ1の同値類をn個作る\\n\\tEquiv(int n) :links(n) {\\n\\t\\tfor (int i = 0; i < n; i++) {\\n\\t\\t\\tlinks[i] = i;\\n\\t\\t}\\n\\t}\\n\\t//xの属する同値類の代表元を返す\\n\\tint find(int x) {\\n\\t\\tint xx = links[x];\\n\\t\\tif (xx == x)return x;\\n\\t\\treturn links[x] = find(xx);\\n\\t}\\n\\tvoid unify(int x, int y) {\\n\\t\\tint xx = find(x), yy = find(y);\\n\\t\\tif (xx <= yy)links[yy] = xx;\\n\\t\\telse links[xx] = yy;\\n\\t}\\n};\\n\\ntypedef vector<Lines>vLines;\\nvLines connectedComponent(const Lines &ls) {\\n\\tvLines ret;\\n\\tEquiv equiv(ls.size());\\n\\tfor (int i = 0; i < (int)ls.size(); i++) {\\n\\t\\tfor (int j = 0; j < i; j++) {\\n\\t\\t\\tif (connectSS_with_endpoint(ls[i], ls[j])) {\\n\\t\\t\\t\\tequiv.unify(i, j);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t//cerr << \\\"connected-1\\\" << endl;\\n\\tfor (int i = 0; i < (int)ls.size(); i++) {\\n\\t\\tif (equiv.find(i) == i) {\\n\\t\\t\\tLines newLs;\\n\\t\\t\\tnewLs.push_back(ls[i]);\\n\\t\\t\\tfor (int j = i + 1; j < (int)ls.size(); j++) {\\n\\t\\t\\t\\tif (equiv.find(j) == i)newLs.push_back(ls[j]);\\n\\t\\t\\t}\\n\\t\\t\\tret.push_back(newLs);\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\n//左手法でのトレース\\n//偏角でソートされた隣接点のvectorを得る\\ntypedef pair<double, point>doublePoint;\\ntypedef vector<doublePoint> vDoublePoint;\\ntypedef map<point, vDoublePoint> adjPoint;\\ntypedef vector<point>points;\\n//移動前の点と隣接点のリストから移動先を決定\\npoint findNext(const vDoublePoint &vdp, const point &p) {\\n\\tfor (int i = 0; i < (int)vdp.size() - 1; i++) {\\n\\t\\tif (p == vdp[i].second) {\\n\\t\\t\\treturn vdp[i + 1].second;\\n\\t\\t}\\n\\t}\\n\\treturn vdp[0].second;\\n}\\n//左手法でトレースして通った点の列を返す\\npoints trace(const Lines &ls) {\\n\\tadjPoint aPoint;\\n\\t//隣接点(偏角付き)のリストを作成\\n\\tfor (int i = 0; i < (int)ls.size(); i++) {\\n\\t\\taPoint[ls[i][0]].push_back(doublePoint(arg(ls[i][1] - ls[i][0]), ls[i][1]));\\n\\t\\taPoint[ls[i][1]].push_back(doublePoint(arg(ls[i][0] - ls[i][1]), ls[i][0]));\\n\\t}\\n\\t//x座標最小の点の計算と隣接点リストのソート\\n\\tpoint minPoint(INT_MAX, INT_MAX);\\n\\tadjPoint::iterator it;\\n\\tfor (it = aPoint.begin(); it != aPoint.end(); ++it) {\\n\\t\\tpoint p = it->first;\\n\\t\\tminPoint = min(minPoint, p);\\n\\t\\tvDoublePoint &vdp = it->second;\\n\\t\\tsort(vdp.begin(), vdp.end());\\n\\t}\\n\\tpoints ret;\\n\\tret.push_back(minPoint);\\n\\t//最初の移動先\\n\\tpoint curP = aPoint[minPoint][0].second;\\n\\tpoint lastP = minPoint;\\n\\t//トレースの繰り返し\\n\\tint cnt =0;\\n\\twhile (curP != minPoint) {\\n\\t\\t//cerr<<curP<<endl;\\n\\t\\tcnt++;\\n\\t\\tassert(cnt<1000000);\\n\\t\\tret.push_back(curP);\\n\\t\\tpoint nextP = findNext(aPoint[curP], lastP);\\n\\t\\t//if(isSamePoint(curP,nextP))break;\\n\\t\\tlastP = curP;\\n\\t\\tcurP = nextP;\\n\\t}\\n\\t//開始点を最後にも追加\\n\\tret.push_back(minPoint);\\n\\treturn ret;\\n}\\n\\nbool isInside(const points &ps) {\\n\\tLine l0(point(0, 0), point(51.0, 1.0 / 20000.0));\\n\\tint count = 0;\\n\\tfor (int i = 0; i < (int)ps.size() - 1; i++) {\\n\\t\\tpoint dummy;\\n\\t\\tLine l1(ps[i], ps[i + 1]);\\n\\t\\tif (intersect(l0, l1,dummy))count++;\\n\\t}\\n\\treturn (count & 1) == 1;\\n}\\n\\n\\n//円\\nstruct Circle {\\n\\tpoint p; double r;\\n\\tCircle(const point &p_, double r_) : p(p_), r(r_) { }\\n};\\n\\n//凸包\\nvector<point> convex_hull(vector<point> ps) {\\n\\tint n = ps.size(), k = 0;\\n\\tsort(ps.begin(), ps.end());\\n\\tvector<point> ch(2 * n);\\n\\tfor (int i = 0; i < n; ch[k++] = ps[i++]) // lower-hull\\n\\t\\twhile (k >= 2 && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\\n\\tfor (int i = n - 2, t = k + 1; i >= 0; ch[k++] = ps[i--]) // upper-hull\\n\\t\\twhile (k >= t && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\\n\\tch.resize(k - 1);\\n\\treturn ch;\\n}\\n\\n//2点を通る半径Rの円の中心\\npair<point, point> get_circle_from_2points(point &p1, point &p2, double R) {\\n\\tdouble d = dist(p1, p2);\\n\\tdouble x1 = p1.real(), x2 = p2.real();\\n\\tdouble y1 = p1.imag(), y2 = p2.imag();\\n\\tif (p1.imag() == p2.imag()) {\\n\\t\\tdouble x = (x1 + x2) / 2.0;\\n\\t\\tdouble dy = sqrt(R - d * d / 4);\\n\\t\\treturn { { x,y1 + dy },{ x,y1 - dy } };\\n\\t}\\n\\telse {\\n\\t\\tdouble m = (x1 - x2) / (y2 - y1);\\n\\t\\tdouble t = sqrt(R*R - d * d / 4);\\n\\t\\tdouble dx = sqrt((t*t) / (m*m + 1));\\n\\t\\tdouble dy = sqrt(t*t - dx * dx);\\n\\t\\tdouble gx = (x1 + x2) / 2;\\n\\t\\tdouble gy = (y1 + y2) / 2;\\n\\t\\tif (m > EPS) {\\n\\t\\t\\treturn { { gx + dx,gy + dy },{ gx - dx,gy - dy } };\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\treturn { { gx + dx,gy - dy },{ gx - dx,gy + dy } };\\n\\t\\t}\\n\\t}\\n}\\n//長方形\\nstruct Square {\\n\\tdouble lx, ly, rx, ry;\\n\\tSquare(double lx_, double ly_, double rx_, double ry_) :lx(lx_), ly(ly_), rx(rx_), ry(ry_) {};\\n\\tbool include(point &p) {\\n\\t\\treturn p.real() + EPS >= lx && p.real() - EPS <= rx && p.imag() + EPS >= ly && p.imag() - EPS <= ry;\\n\\t}\\n};\\n\\nstruct Polygon : public vector<point> {\\n\\t//0->OUT, 1->ON, 2->IN\\n\\tint contains(const point &p) {\\n\\t\\tbool in = false;\\n\\t\\tint N = this->size();\\n\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\tpoint a = this->at(i) - p;\\n\\t\\t\\tpoint b = this->at((i + 1) % N) - p;\\n\\t\\t\\tif (imag(a) > imag(b)) {\\n\\t\\t\\t\\tstd::swap(a, b);\\n\\t\\t\\t}\\n\\t\\t\\tif (imag(a) <= 0 && 0 < imag(b))\\n\\t\\t\\t\\tif (cross(a, b) < 0)in = !in;\\n\\t\\t\\tif (cross(a, b) == 0 && dot(a, b) <= 0)return 1;\\n\\t\\t}\\n\\t\\treturn in ? 2 : 0;\\n\\t}\\n};\\n\\nbool trapAll() {\\n\\tint N; cin >> N;\\n\\tif (N == 0)exit(0);\\n\\tLines ls;\\n\\tREP(i, N) {\\n\\t\\tdouble x1, y1, x2, y2;\\n\\t\\tcin >> x1 >> y1 >> x2 >> y2;\\n\\t\\tpoint p1(x1, y1);\\n\\t\\tpoint p2(x2, y2);\\n\\t\\tls.push_back(Line(p1, p2));\\n\\t}\\n\\tsplitSegments(ls);\\n\\t// for(auto l:ls){\\n\\t// \\tcerr<<l[0]<<\\\" \\\"<<l[1]<<endl;\\n\\t// }\\n\\t//cerr << \\\"splitted\\\" << endl;\\n\\tvLines vls = connectedComponent(ls);\\n\\tfor (auto lines : vls) {\\n\\t\\tPolygon poly;\\n\\t\\tpoints ps= trace(lines);\\n\\t\\tfor (auto p : ps) {\\n\\t\\t\\tpoly.push_back(p);\\n\\t\\t}\\n\\t\\tif (poly.contains(point(0, 0)))return true;\\n\\t}\\n\\treturn false;\\n}\\nvoid solve() {\\n\\tif (trapAll())cout << \\\"yes\\\" << endl;\\n\\telse cout << \\\"no\\\" << endl;\\n\\t//cerr<<\\\"+++++++++++++\\\"<<endl;\\n}\\nsigned main() {\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\n\\twhile (true)\\n\\t\\tsolve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5390,\n \"memory_kb\": 6372,\n \"score_of_the_acc\": -1.1565,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1247_3352563\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cstring>\\n#include <algorithm>\\n#include <cmath>\\n#include <queue>\\n#include <vector>\\n#include <utility>\\n#include <set>\\n//#define LOCAL\\n#define maxv 205\\n#define maxn 105\\n#define EPS 1e-10\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int,int> P;\\nstruct Point{\\n\\tdouble x,y;\\n\\tPoint(double x = 0.0,double y = 0.0): x(x),y(y) {}\\n\\tPoint operator + (Point p){\\n\\t\\treturn Point(x + p.x,y + p.y);\\n\\t}\\n\\tPoint operator - (Point p){\\n\\t\\treturn Point(x - p.x,y - p.y);\\n\\t}\\n\\tPoint operator * (double lambda){\\n\\t\\treturn Point(x * lambda,y * lambda);\\n\\t}\\n\\tPoint operator / (double lambda){\\n\\t\\treturn Point(x / lambda,y / lambda);\\n\\t}\\n\\tdouble norm(){\\n\\t\\treturn x * x + y * y;\\n\\t}\\n\\tdouble abs_(){\\n\\t\\treturn sqrt(norm());\\n\\t}\\n\\tdouble pol(){\\n\\t\\treturn atan2(y,x);\\n\\t}\\n\\tbool operator == (const Point &p)const\\n\\t{\\n\\t\\treturn abs(x - p.x) < EPS && abs(y - p.y) < EPS;\\n\\t}\\n\\tbool operator < (const Point &p)const\\n\\t{\\n\\t\\tif(abs(x - p.x) < EPS) return y < p.y;\\n\\t\\telse return x < p.x;\\n\\t}\\n};\\ntypedef Point Vector;\\nstruct Segment{\\n\\tPoint p1,p2;\\n\\tSegment(Point p1 = Point(),Point p2 = Point()): p1(p1),p2(p2) {}\\n};\\nPoint front(Segment s){\\n\\tVector a = s.p2 - s.p1;\\n\\ta = a / a.abs_() * 5e-4;\\n\\treturn s.p2 + a;\\n}\\nPoint back(Segment s){\\n\\tVector a = s.p2 - s.p1;\\n\\ta = a / a.abs_() * 5e-4;\\n\\treturn s.p1 - a;\\n}\\ntypedef Segment Line;\\ntypedef vector<Point> Polygon;\\ndouble dot(Vector a,Vector b){ return a.x * b.x + a.y * b.y; }\\ndouble det(Vector a,Vector b){ return a.x * b.y - a.y * b.x; }\\nvector <int> adj[maxv];\\nPoint p[maxv]; int pk;\\nSegment s[maxn]; int n;\\nint ccw(Point p,Segment l){\\n\\tif(det(l.p2 - l.p1,p - l.p1) > EPS) return 1;\\n\\tif(det(l.p2 - l.p1,p - l.p1) < -EPS) return -1;\\n\\tif(dot(l.p2 - l.p1,p - l.p1) < -EPS) return 2;\\n\\tif((l.p2 - l.p1).norm() < (p - l.p1).norm()) return -2;\\n\\treturn 0;\\n}\\nbool cross(Segment s1,Segment s2){\\n\\treturn ccw(s1.p1,s2) * ccw(s1.p2,s2) <= 0 && ccw(s2.p1,s1) * ccw(s2.p2,s1) <= 0;\\n}\\nbool check(Point p1,Point p2){\\n\\tfor(int i=1;i<=n;i++){\\n\\t\\tif(cross(Segment(p1,p2),s[i])) return false;\\n\\t}\\n\\treturn true;\\n}\\nbool vis[maxv];\\nvoid dfs(int u){\\n\\tvis[u] = true;\\n\\tfor(int i=0;i<(int)adj[u].size();i++){\\n\\t\\tint v = adj[u][i];\\n\\t\\tif(!vis[v]) dfs(v);\\n\\t}\\n}\\nint main(){\\n\\t#ifdef LOCAL\\n\\tfreopen(\\\"sample.in\\\",\\\"r\\\",stdin);\\n\\tfreopen(\\\"sample.out\\\",\\\"w\\\",stdout);\\n\\t#endif\\n\\twhile(~scanf(\\\"%d\\\",&n) && n){\\n\\t\\tfor(int i=1;i<=n;i++) scanf(\\\"%lf%lf%lf%lf\\\",&s[i].p1.x,&s[i].p1.y,&s[i].p2.x,&s[i].p2.y);\\n\\t\\tpk = 0;\\n\\t\\tp[++pk] = Point(0,0);\\n\\t\\tp[++pk] = Point(100,100);\\n\\t\\tfor(int i=1;i<=n;i++){\\n\\t\\t\\tp[++pk] = front(s[i]);\\n\\t\\t\\tp[++pk] = back(s[i]);\\n\\t\\t}\\n\\t\\tfor(int i=1;i<=pk;i++) adj[i].clear();\\n\\t\\tfor(int i=1;i<=pk;i++){\\n\\t\\t\\tfor(int j=i+1;j<=pk;j++){\\n\\t\\t\\t\\tif(check(p[i],p[j])){\\n\\t\\t\\t\\t\\tadj[i].push_back(j);\\n\\t\\t\\t\\t\\tadj[j].push_back(i);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tmemset(vis,0,sizeof(vis));\\n\\t\\tdfs(1);\\n\\t\\tif(vis[2]) puts(\\\"no\\\");\\n\\t\\telse puts(\\\"yes\\\");\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3388,\n \"score_of_the_acc\": -0.0078,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1247_3213715\",\n \"code_snippet\": \"#include <iostream>\\n#include <complex>\\n#include <vector>\\n#include <utility>\\n#include <algorithm>\\nusing namespace std;\\nusing P = complex<double>;\\nusing L = pair<P,P>;\\n#define X real()\\n#define Y imag()\\nconst double EPS = 1e-6, INF = 1e12;\\n\\ndouble dot(P &a, P &b){ return a.X*b.X + a.Y*b.Y;}\\ndouble cross(P &a, P &b){ return a.X*b.Y - a.Y*b.X;}\\n\\nint ccw(P a, P b, P c){\\n b -= a, c -= a;\\n if(cross(b,c) > EPS) return 1;\\n if(cross(b,c) < -EPS) return -1;\\n if(dot(b,c) < EPS) return 2;\\n if(norm(b) - EPS < norm(c)) return -2;\\n return 0;\\n}\\n\\nbool is_cross(L a, L b){\\n P af = a.first, as = a.second, bf = b.first, bs = b.second;\\n return (ccw(af,as,bs)*ccw(af,as,bf) <= 0) and (ccw(bf,bs,af)*ccw(bf,bs,as) <= 0);\\n}\\n\\nint main(){\\n int n;\\n while(cin >> n, n){\\n vector<L> Lines;\\n for(int i = 0; i < n; ++i){\\n double x, y, z, w;\\n cin >> x >> y >> z >> w;\\n x *= 200;\\n y *= 200;\\n z *= 200;\\n w *= 200;\\n Lines.emplace_back(P(x,y),P(z,w));\\n }\\n for(int i = 0; i < n; ++i){\\n P d = Lines[i].second - Lines[i].first;\\n d /= abs(d);\\n Lines[i].second += d;\\n Lines[i].first -= d;\\n }\\n vector< vector<int> > Adj(2*n+2, vector<int>(2*n+2,true));\\n int M = 2*n + 2;\\n vector<P> Points(M);\\n for(int i = 0; i < n; ++i){\\n Points[2*i] = Lines[i].first;\\n Points[2*i+1] = Lines[i].second;\\n }\\n Points[2*n] = P(0,0);\\n Points[2*n+1] = P(200000,200000);\\n for(int i = 0; i < M; ++i){\\n for(int j = 0; j < i; ++j){\\n if(i == j) continue;\\n if(i < 2*n and i%2 == 0 and (j-i) == 1) continue;\\n for(int k = 0; k < n; ++k){\\n if(is_cross(L(Points[i],Points[j]),Lines[k])){\\n Adj[i][j] = false;\\n Adj[j][i] = false;\\n break;\\n }\\n }\\n }\\n }\\n for(int k = 0; k < M; ++k){\\n for(int i = 0; i < M; ++i)\\n for(int j = 0; j < M; ++j)\\n Adj[i][j] |= Adj[i][k]&Adj[k][j];\\n }\\n if(Adj[M-1][M-2]) cout << \\\"no\\\" << endl;\\n else cout << \\\"yes\\\" << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3332,\n \"score_of_the_acc\": -0.0046,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1247_3213671\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <complex>\\n#include <vector>\\n#include <algorithm>\\n#include <cmath>\\n#include <array>\\n#include <map>\\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};\\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\\nbool intersectSS(const L& a, const L& b){\\n return ( ccw(a[0],a[1],b[0]) *ccw(a[0],a[1],b[1]) <= 0 ) &&\\n ( ccw(b[0],b[1],a[0]) *ccw(b[0],b[1],a[1]) <= 0 );\\n}\\nbool intersectSP(const L& s, const P &p){\\n return abs(cross(s[0]-p, s[1]-p))<EPS && dot(s[0]-p, s[1]-p)<EPS;\\n}\\n\\nbool isParallel(const P &a, const P &b){\\n return abs(cross(a,b)) < EPS;\\n}\\nbool isParallel(const L &a, const L &b){\\n return isParallel(a[1]-a[0], b[1]-b[0]);\\n}\\n\\nP crosspointLL(const L &l, const L &m) {\\n double A = cross(l[1]-l[0], m[1]-m[0]);\\n double B = cross(l[1]-l[0], l[1]-m[0]);\\n return m[0] + B/A *(m[1]-m[0]);\\n}\\n\\ndouble getarea(const VP &poly){\\n double ret = 0;\\n for (int i=0; i<(int)poly.size(); i++){ \\n ret += cross(poly[i], poly[(i+1)%poly.size()]);\\n }\\n return ret*0.5;\\n}\\n\\nint in_poly(const P &p, const VP &poly){\\n int n = poly.size();\\n int ret = -1;\\n for(int i=0; i<n; i++){\\n P a = poly[i]-p;\\n P b = poly[(i+1)%n]-p;\\n if(a.Y > b.Y) swap(a,b);\\n if(intersectSP(L(a,b), P(0,0))) return 0;\\n if(a.Y<=0 && b.Y>0 && cross(a,b)<0) ret = -ret;\\n }\\n return ret;\\n}\\n\\nint leftmostpoint(int &pidx, int &cidx, vector<int> &vec, VP &plist){\\n P ptoc = plist[cidx] -plist[pidx];\\n int nextidx = -1;\\n double maxangle = -INF;\\n for(int i=0; i<(int)vec.size(); i++){\\n P cton = plist[vec[i]] -plist[cidx];\\n double angle;\\n if(abs(cross(ptoc, cton)) < EPS && dot(ptoc, cton) <EPS){\\n angle = -PI;\\n }else{\\n angle = arg(cton/ ptoc);\\n }\\n if(angle > maxangle){\\n maxangle = angle;\\n nextidx = i;\\n }\\n }\\n pidx = cidx;\\n cidx = vec[nextidx];\\n return nextidx;\\n}\\n\\nvector<vector<int> > makeDualGraph(vector<vector<int> > &adj, VP &plist, vector<VP> &vlist){\\n map<pair<int,int>, int> edgelist;\\n vector<vector<int> > poly;\\n vector<vector<bool> > used(adj.size());\\n for(int i=0; i<(int)adj.size(); i++){\\n used[i] = vector<bool>(adj[i].size(), false);\\n }\\n vlist = vector<VP>();\\n \\n int numarea=0;\\n for(int i=0; i<(int)adj.size(); i++){\\n for(int j=0; j<(int)adj[i].size(); j++){\\n if(used[i][j]) continue;\\n used[i][j] = true;\\n vlist.push_back(VP());\\n vector<int> border;\\n border.push_back(i);\\n vlist[numarea].push_back(plist[i]);\\n int prev = i;\\n int curr = adj[i][j];\\n while(curr!=i){\\n border.push_back(curr);\\n vlist[numarea].push_back(plist[curr]);\\n int idx = leftmostpoint(prev, curr, adj[curr], plist);\\n used[prev][idx] = true;\\n }\\n poly.push_back(border);\\n numarea++;\\n }\\n }\\n \\n vector<vector<int> > dual(numarea);\\n for(int i=0; i<numarea; i++){\\n for(int j=0; j<(int)poly[i].size(); j++){\\n int a = poly[i][j];\\n int b = poly[i][(j+1)%(int)poly[i].size()];\\n pair<int,int> key = make_pair(min(a,b), max(a,b));\\n if(edgelist.count(key) == 0){\\n edgelist[key] = i;\\n }else{\\n dual[i].push_back(edgelist[key]);\\n dual[edgelist[key]].push_back(i);\\n }\\n }\\n }\\n \\n for(int i=0; i<(int)dual.size(); i++){\\n sort(dual[i].begin(), dual[i].end());\\n dual[i].erase(unique(dual[i].begin(), dual[i].end()), dual[i].end());\\n }\\n return dual;\\n}\\n\\npair<vector<vector<int> >, VP> arrangement(const vector<L> &l){\\n vector<VP> cp(l.size());\\n VP plist;\\n for(int i=0; i<(int)l.size(); i++){\\n for(int j=i+1; j<(int)l.size(); j++){\\n if(!isParallel(l[i], l[j]) && intersectSS(l[i], l[j])){\\n P cpij = crosspointLL(l[i], l[j]);\\n cp[i].push_back(cpij);\\n cp[j].push_back(cpij);\\n plist.push_back(cpij);\\n }\\n }\\n cp[i].push_back(l[i][0]);\\n cp[i].push_back(l[i][1]);\\n plist.push_back(l[i][0]);\\n plist.push_back(l[i][1]);\\n sort(cp[i].begin(), cp[i].end());\\n cp[i].erase(unique(cp[i].begin(), cp[i].end()), cp[i].end());\\n }\\n sort(plist.begin(), plist.end());\\n plist.erase(unique(plist.begin(), plist.end()), plist.end());\\n\\n int n = plist.size();\\n map<P, int> conv;\\n for(int i=0; i<n; i++){\\n conv[plist[i]] = i;\\n }\\n vector<vector<int> > adj(n);\\n for(int i=0; i<(int)cp.size(); i++){\\n for(int j=0; j<(int)cp[i].size()-1; j++){\\n int jidx = conv[cp[i][j]];\\n int jp1idx = conv[cp[i][j+1]];\\n adj[jidx].push_back(jp1idx);\\n adj[jp1idx].push_back(jidx);\\n }\\n }\\n for(int i=0; i<n; i++){\\n sort(adj[i].begin(), adj[i].end());\\n adj[i].erase(unique(adj[i].begin(), adj[i].end()), adj[i].end());\\n }\\n return make_pair(adj, plist);\\n}\\n\\nint main(){\\n while(1){\\n int n;\\n cin >> n;\\n if(n == 0) break;\\n\\n vector<L> l(n);\\n for(int i=0; i<n; i++){\\n double xs,ys,xt,yt;\\n cin >> xs >> ys >> xt >> yt;\\n l[i] = L(P(xs, ys), P(xt, yt));\\n }\\n\\n auto ret = arrangement(l);\\n auto &adj = ret.first;\\n VP &plist = ret.second;\\n vector<VP> vlist;\\n makeDualGraph(adj, plist, vlist);\\n bool ok = false;\\n for(const VP &poly: vlist){\\n if(getarea(poly) < EPS) continue;\\n if(in_poly(P(0, 0), poly) == 1){\\n ok = true;\\n break;\\n }\\n }\\n if(ok){\\n cout << \\\"yes\\\" << endl;\\n }else{\\n cout << \\\"no\\\" << endl;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 5872,\n \"score_of_the_acc\": -0.2836,\n \"final_rank\": 3\n }\n]","isConversational":false}}},{"rowIdx":699,"cells":{"group_id":{"kind":"string","value":"aoj_1243_cpp"},"problem_description":{"kind":"string","value":"Problem D:\nWeather Forecast\nYou are the God of Wind.\nBy moving a big cloud around, you can decide the weather: it invariably rains under the cloud,\nand the sun shines everywhere else.\nBut you are a benign God: your goal is to give enough rain to every field in the countryside,\nand sun to markets and festivals. Small humans, in their poor vocabulary, only describe this as\n“weather forecast”.\nYou are in charge of a small country, called Paccimc. This country is constituted of 4 × 4 square\nareas, denoted by their numbers.\nYour cloud is of size 2 × 2, and may not cross the borders of the country.\nYou are given the schedule of markets and festivals in each area for a period of time.\nOn the first day of the period, it is raining in the central areas (6-7-10-11), independently of the\nschedule.\nOn each of the following days, you may move your cloud by 1 or 2 squares in one of the four\ncardinal directions (North, West, South, and East), or leave it in the same position. Diagonal\nmoves are not allowed. All moves occur at the beginning of the day.\nYou should not leave an area without rain for a full week (that is, you are allowed at most 6\nconsecutive days without rain). You don’t have to care about rain on days outside the period\nyou were given: i.e. you can assume it rains on the whole country the day before the period,\nand the day after it finishes.\nInput\nThe input is a sequence of data sets, followed by a terminating line containing only a zero.\nA data set gives the number\nN\nof days (no more than 365) in the period on a single line, followed by\nN\nlines giving the schedule for markets and festivals. The\ni\n-th line gives the schedule for\nthe i-th day. It is composed of 16 numbers, either 0 or 1, 0 standing for a normal day, and 1 a\nmarket or festival day. The numbers are separated by one or more spaces.\nOutput\nThe answer is a 0 or 1 on a single line for each data set, 1 if you can satisfy everybody, 0 if there\nis no way to do it.\nSample Input\n1\n0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0\n7\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n1 0 0 0 0 0 1 0 0 0 0 1 1 0 0 1\n0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 1\n0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0\n0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0\n1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1\n0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0\n7\n0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0\n0 0 1 0 0 0 0 1 0 0 0 0 0 1 0 0\n0 0 0 1 0 0 0 0 0 0 1 0 1 0 0 0\n0 1 0 0 0 0 0 1 0 0 0 0 1 0 0 0\n0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 1 1 0 1 0 0 0 0 1\n0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0\n15\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0\n0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 1 1 0 1 0 0 0 0\n0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0\n0 0 1 1 0 0 0 0 0 1 0 0 0 0 0 0\n1 1 0 0 0 0 0 0 0 0 1 0 0 1 0 0\n0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0\n0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0\n1 0 0 1 1 0 0 0 0 1 0 1 0 0 0 0\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0\n0 0 0 0 0 1 0 1 0 1 0 0 0 0 0 0\n0\nOutput for the Sample Input\n0\n1\n0\n1"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1243_10865810","code_snippet":"#include<cstdio>\n#include<iostream>\n#include<cstring>\n#include<cmath>\n#include<cstdlib>\n#include<vector>\n#include<stack>\n#include<algorithm>\n#include<queue>\n#include<string>\n#define OK 1\n#define INF 2147483647\n#define LINF 9223372036854775807LL\n#define DINF 100000000\n#define LL long long\nusing namespace std;\ntypedef struct\n{\n\tint cnt[4][4];\n}HNode;\nvector<HNode>H[366][4][4];\nint n,map[365][4][4];\nint biao[4][4][4][2];\nconst int di[] = { 0, 0, 0, -1, -2, 0, 0, 1, 2 };\nconst int dj[] = { 0, -1, -2, 0, 0, 1, 2, 0, 0 };\nbool dfs(int cur, int ci, int cj, int cnt[4][4]);\nbool judge(int cur, int ci, int cj, int cnt[4][4]);\n\nint main()\n{\n\tint i,j,k,cnt[4][4];\n\twhile (scanf(\"%d\", &n) > 0)\n\t{\n\t\tif (n == 0) break;\n\t\tfor (k = 0; k < n; k++)\n\t\t{\n\t\t\tfor (i = 0; i < 4; i++)\n\t\t\t{\n\t\t\t\tfor (j = 0; j < 4; j++) H[k][i][j].clear();\n\t\t\t}\n\t\t}\n\t\tfor (k = 0; k < n; k++)\n\t\t{\n\t\t\tfor (i = 0; i < 4; i++)\n\t\t\t{\n\t\t\t\tfor (j = 0; j < 4; j++) scanf(\"%d\", &map[k][i][j]);\n\t\t\t}\n\t\t}\n\t\tfor (i = 0; i < 4; i++)\n\t\t{\n\t\t\tfor (j = 0; j < 4; j++) cnt[i][j] = 1;\n\t\t}\n\t\tcnt[1][1] = cnt[1][2] = cnt[2][1] = cnt[2][2] = 0;\n\t\tjudge(0, 1, 1, cnt);\n\t\tif (dfs(0, 1, 1, cnt) == true) printf(\"1\\n\");\n\t\telse printf(\"0\\n\");\n\t}\n\treturn 0;\n}\n\nbool judge(int cur, int ci, int cj, int cnt[4][4])\n{\n\tint k,j,i, len;\n\tbool flag = false;\n\tHNode e;\n\tfor (k = 0, len = H[cur][ci][cj].size(); k < len; k++)\n\t{\n\t\te = H[cur][ci][cj][k];\n\t\tflag = true;\n\t\tfor (i = 0; i < 4; i++)\n\t\t{\n\t\t\tfor (j = 0; j < 4; j++)\n\t\t\t{\n\t\t\t\tif (e.cnt[i][j] != cnt[i][j]) flag = false;\n\t\t\t}\n\t\t}\n\t\tif (flag == true) break;\n\t}\n\tif (flag == false)\n\t{\n\t\tfor (i = 0; i < 4; i++)\n\t\t{\n\t\t\tfor (j = 0; j < 4; j++) e.cnt[i][j] = cnt[i][j];\n\t\t}\n\t\tH[cur][ci][cj].push_back(e);\n\t\treturn false;\n\t}\n\telse return true;\n}\n\nbool dfs(int cur,int ci,int cj,int cnt[4][4])\n{\n\tint k,next_ci,next_cj,i,j,nextCnt[4][4];\n\tif (map[cur][ci][cj] == 1 || map[cur][ci][cj + 1] == 1 || map[cur][ci + 1][cj] == 1 || map[cur][ci + 1][cj + 1] == 1) return false;\n\tif (cur == n - 1) return true;\n\tfor (k = 0; k < 9; k++)\n\t{\n\t\tnext_ci = ci + di[k];\n\t\tnext_cj = cj + dj[k];\n\t\tif (next_ci < 0 || next_ci + 1 >= 4 || next_cj < 0 || next_cj + 1 >= 4) continue;\n\t\tmemcpy(nextCnt, cnt, sizeof(nextCnt));\n\t\tfor (i = 0; i < 4; i++)\n\t\t{\n\t\t\tfor (j = 0; j < 4; j++) nextCnt[i][j]++;\n\t\t}\n\t\tnextCnt[next_ci][next_cj] = nextCnt[next_ci][next_cj + 1] = 0;\n\t\tnextCnt[next_ci + 1][next_cj] = nextCnt[next_ci + 1][next_cj + 1] = 0;\n\t\tbool flag = true;\n\t\tfor (i = 0; i < 4; i++) //判断下雨天数\n\t\t{\n\t\t\tfor (j = 0; j < 4; j++)\n\t\t\t{\n\t\t\t\tif (nextCnt[i][j] == 7) flag = false;\n\t\t\t}\n\t\t} \n\t\tif (flag == false) continue;\n\t\tif (judge(cur + 1, next_ci, next_cj, nextCnt) == true) continue;\n\t\tif (dfs(cur + 1, next_ci, next_cj, nextCnt) == true) return true;\n \t}\n\treturn false;\n}","accuracy":1,"time_ms":120,"memory_kb":17136,"score_of_the_acc":-0.2433,"final_rank":6},{"submission_id":"aoj_1243_9669450","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/**\n * @brief template\n */\n\nint N;\nvector<int> A(N);\nvector<vector<int>> G(9);\nmap<int,bool> mp;\n\nint encode(int K, int X, int Y, int D0, int D2, int D6, int D8) {\n return K*1000000+X*100000+Y*10000+D0*1000+D2*100+D6*10+D8;\n}\n\nbool DFS(int K, int X, int Y, int D0, int D2, int D6, int D8) {\n if (K == N) return true;\n if (D0 >= 7 || D2 >= 7 || D6 >= 7 || D8 >= 7) return false;\n if ((A[K] & (1<<(X*3+Y))) == 0) return false;\n int E = encode(K,X,Y,D0,D2,D6,D8);\n if (mp.count(E)) return mp[E];\n for (int Next : G[X*3+Y]) {\n int NX = Next / 3, NY = Next % 3;\n int N0 = D0+1, N2 = D2+1, N6 = D6+1, N8 = D8+1;\n if (Next == 0) N0 = 0;\n if (Next == 2) N2 = 0;\n if (Next == 6) N6 = 0;\n if (Next == 8) N8 = 0;\n if (DFS(K+1,NX,NY,N0,N2,N6,N8)) return mp[E] = true;\n }\n return mp[E] = false;\n}\n\nint main() {\n rep(i,0,3) {\n rep(j,0,3) {\n G[i*3+j].push_back(i*3+j);\n rep(k,0,3) {\n if (i != k) G[i*3+j].push_back(k*3+j);\n if (j != k) G[i*3+j].push_back(i*3+k);\n }\n }\n }\nwhile(1) {\n mp.clear();\n cin >> N;\n if (N == 0) return 0;\n A.resize(N);\n rep(i,0,N) {\n vector<vector<int>> X(4,vector<int>(4));\n rep(j,0,4) rep(k,0,4) cin >> X[j][k];\n int B = 0;\n rep(j,0,3) {\n rep(k,0,3) {\n if (X[j][k] == 0 && X[j+1][k] == 0 && X[j][k+1] == 0 && X[j+1][k+1] == 0) B |= (1<<(j*3+k));\n }\n }\n A[i] = B;\n }\n cout << (DFS(0,1,1,1,1,1,1) ? 1 : 0) << endl;\n}\n}","accuracy":1,"time_ms":20,"memory_kb":5160,"score_of_the_acc":-0.012,"final_rank":2},{"submission_id":"aoj_1243_9029711","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\nint solve(int n) {\n using D = array<array<int, 4>, 4>;\n vector dp(3, vector(3, set<D>()));\n\n {\n bitset<16> a; {\n vector<int> a_ = in(16);\n for(int i : rep(16)) if(a_[i]) a[i] = 1;\n }\n bitset<16> b;\n b[5] = b[6] = b[9] = b[10] = 1;\n if((a & b) == 0) {\n D s = {\n 1, 1, 1, 1,\n 1, 0, 0, 1,\n 1, 0, 0, 1,\n 1, 1, 1, 1\n };\n dp[1][1].insert(s);\n }\n }\n\n for(int _ : rep(n - 1)) {\n bitset<16> a; {\n vector<int> a_ = in(16);\n for(int i : rep(16)) if(a_[i]) a[i] = 1;\n }\n vector nt(3, vector(3, set<D>()));\n for(int ci : rep(3)) for(int cj : rep(3)) {\n for(auto [di, dj] : vector<pair<int,int>>{{-2, 0}, {0, -2}, {-1, 0}, {0, -1}, {0, 0}, {+1, 0}, {0, +1}, {+2, 0}, {0, +2}}) {\n int ni = ci + di, nj = cj + dj;\n if(not(0 <= ni and ni + 1 < 4 and 0 <= nj and nj + 1 < 4)) continue;\n bitset<16> b;\n for(int i : rep(2)) for(int j : rep(2)) b[(ni + i) * 4 + (nj + j)] = 1;\n if(not((a & b) == 0)) continue;\n for(auto s : dp[ci][cj]) {\n for(int i : rep(4)) for(int j : rep(4)) s[i][j] += 1;\n for(int i : rep(2)) for(int j : rep(2)) s[ni + i][nj + j] = 0;\n bool ok = [&] {\n for(int i : rep(4)) for(int j : rep(4)) \n if(s[i][j] >= 7) return false;\n return true;\n }();\n if(ok) nt[ni][nj].insert(s);\n }\n }\n }\n dp = move(nt);\n }\n for(int ci : rep(3)) for(int cj : rep(3)) if(not dp[ci][cj].empty()) return true;\n return false;\n}\n\nint main() {\n while(true) {\n int n = in();\n if(n == 0) return 0;\n print(solve(n));\n }\n}","accuracy":1,"time_ms":100,"memory_kb":3668,"score_of_the_acc":-0.1081,"final_rank":5},{"submission_id":"aoj_1243_6718256","code_snippet":"/**\n * author: otera\n**/\n#include<bits/stdc++.h>\nusing namespace std;\n\n// #define int long long\n\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing int128_t = __int128_t;\n#define repa(i, n) for(int i = 0; i < n; ++ i)\n#define repb(i, a, b) for(int i = a; i < b; ++ i)\n#define repc(i, a, b, c) for(int i = a; i < b; i += c)\n#define overload4(a, b, c, d, e, ...) e\n#define overload3(a, b, c, d, ...) d\n#define rep(...) overload4(__VA_ARGS__, repc, repb, repa)(__VA_ARGS__)\n#define rep1a(i, n) for(int i = 0; i <= n; ++ i)\n#define rep1b(i, a, b) for(int i = a; i <= b; ++ i)\n#define rep1c(i, a, b, c) for(int i = a; i <= b; i += c)\n#define rep1(...) overload4(__VA_ARGS__, rep1c, rep1b, rep1a)(__VA_ARGS__)\n#define rev_repa(i, n) for(int i=n-1;i>=0;i--)\n#define rev_repb(i, a, b) assert(a > b);for(int i=a;i>b;i--)\n#define rev_rep(...) overload3(__VA_ARGS__, rev_repb, rev_repa)(__VA_ARGS__)\n#define rev_rep1a(i, n) for(int i=n;i>=1;i--)\n#define rev_rep1b(i, a, b) assert(a >= b);for(int i=a;i>=b;i--)\n#define rev_rep1(...) overload3(__VA_ARGS__, rev_rep1b, rev_rep1a)(__VA_ARGS__)\ntypedef pair<int, int> P;\ntypedef pair<ll, ll> LP;\n#define pb push_back\n#define pf push_front\n#define ppb pop_back\n#define ppf pop_front\n#define eb emplace_back\n#define fr first\n#define sc second\n#define all(c) c.begin(),c.end()\n#define rall(c) c.rbegin(), c.rend()\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 Sort(a) sort(all(a))\n#define Rev(a) reverse(all(a))\n#define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))\n#define si(c) (int)(c).size()\ninline ll popcnt(ull a){ return __builtin_popcountll(a); }\n#define kth_bit(x, k) ((x>>k)&1)\n#define unless(A) if(!(A))\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\nll intpow(ll a, ll b, ll m) {ll ans = 1; while(b){ if(b & 1) (ans *= a) %= m; (a *= a) %= m; b /= 2; } return ans; }\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#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\n#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)\n#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)\n#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)\n#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)\n#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)\n#define vec(type,name,...) vector<type>name(__VA_ARGS__)\n#define VEC(type,name,size) vector<type>name(size);in(name)\n#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))\n#define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name)\n#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\ntemplate <class T> using vc = vector<T>;\ntemplate <class T> using vvc = vector<vc<T>>;\ntemplate <class T> using vvvc = vector<vvc<T>>;\ntemplate <class T> using vvvvc = vector<vvvc<T>>;\ntemplate <class T> using pq = priority_queue<T>;\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\ntemplate <class T, class U> using umap = unordered_map<T, U>;\ntemplate<class T> void scan(T& a){ cin >> a; }\ntemplate<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); }\nvoid in(){}\ntemplate <class Head, class... Tail> void in(Head& head, Tail&... tail){ scan(head); in(tail...); }\nvoid print(){ cout << ' '; }\ntemplate<class T> void print(const T& a){ cout << a; }\ntemplate<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout << ' '; print(*i); } }\nint out(){ cout << '\\n'; return 0; }\ntemplate<class T> int out(const T& t){ print(t); cout << '\\n'; return 0; }\ntemplate<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); cout << ' '; out(tail...); return 0; }\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#define dump(...) { print(#__VA_ARGS__); print(\":\"); out(__VA_ARGS__); }\n#else\n#define debug(...)\n#define dump(...)\n#endif\n\nstruct io_setup {\n io_setup(int precision = 20) {\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout << fixed << setprecision(precision);\n }\n} io_setup_ {};\n\nconst int dx[4] = {0, 1, 0, -1};\nconst int dy[4] = {1, 0, -1, 0};\n\nconst int M = 4;\nconst int D = 7;\n\nvoid solve() {\n int n;\n while(cin >> n) {\n if(n == 0) break;\n VV(int, a, n, M * M);\n vector cnt(M, array<int, M>{0, 0, 0, 0});\n bool ans = 0;\n map<tuple<int, P, vector<array<int, M>>>, bool> memo;\n auto dfs = [&](auto &&dfs, int day, int x, int y) -> void {\n if(ans) return;\n if(day == n) {\n ans = 1;\n return;\n }\n if(memo.count(make_tuple(day, P{x, y}, cnt))) return;\n memo[make_tuple(day, P{x, y}, cnt)] = 1;\n bool ok = 1;\n auto ncnt = cnt;\n rep(i, M) {\n rep(j, M) {\n if(0 <= (i - x) && (i - x) <= 1 && 0 <= (j - y) && (j - y) <= 1) {\n // rain\n if(a[day][i * M + j]) {\n ok = 0;\n break;\n }\n ncnt[i][j] = 0;\n } else {\n // not rain\n ++ ncnt[i][j];\n if(ncnt[i][j] >= 7) {\n ok = 0;\n break;\n }\n }\n }\n }\n if(!ok) {\n return;\n }\n swap(cnt, ncnt);\n rep(k, 4) {\n for(int _ = 1; _ <= 2; ++ _) {\n int nx = x + _ * dx[k], ny = y + _ * dy[k];\n if(0 <= nx && nx < 3 && 0 <= ny && ny < 3) {\n dfs(dfs, day + 1, nx, ny);\n }\n }\n }\n dfs(dfs, day + 1, x, y);\n swap(cnt, ncnt);\n };\n dfs(dfs, 0, 1, 1);\n out(ans);\n }\n}\n\nsigned main() {\n int testcase = 1;\n // in(testcase);\n while(testcase--) solve();\n return 0;\n}","accuracy":1,"time_ms":720,"memory_kb":92020,"score_of_the_acc":-1.6553,"final_rank":20},{"submission_id":"aoj_1243_6654938","code_snippet":"#include <stdio.h>\n#include <vector>\n#include <set>\nusing namespace std;\n\nint a[384][16], vis[16];\nset<vector<int>> st[384];\nvector<int> mv[16] = { {0, 1, 2, 4, 8}, {0, 1, 2, 5, 9}, {0, 1, 2, 6, 10}, {},\n {0, 4, 5, 6, 8}, {1, 4, 5, 6, 9}, {2, 4, 5, 6, 10}, {},\n {0, 4, 8, 9, 10}, {1, 5, 8, 9, 10}, {2, 6, 8, 9, 10}, {}, {}, {}, {}, {} };\n\nint main(void) {\n int n, ok;\n vector<int> v;\n while (1) {\n scanf(\"%d\", &n);\n if (n == 0) break;\n for (int i = 1; i <= n; i++) {\n for (int j = 0; j < 16; j++) {\n scanf(\"%d\", &a[i][j]);\n }\n }\n if (a[1][5] || a[1][6] || a[1][9] || a[1][10]) {\n printf(\"0\\n\");\n continue;\n }\n \n st[1].insert({ 5, -1, -1, -1, -1, -1, -1 });\n for (int i = 1; i < n; i++) {\n for (auto& j : st[i]) {\n v = j;\n for (int k = 6; k > 0; k--) v[k] = v[k - 1];\n for (int k : mv[v[1]]) {\n v[0] = k;\n if (i < 6) ok = 1;\n else {\n ok = 1;\n for (int l = 0; l < 7; l++) {\n vis[v[l]] = 1;\n vis[v[l] + 1] = 1;\n vis[v[l] + 4] = 1;\n vis[v[l] + 5] = 1;\n }\n for (int l = 0; l < 16; l++) {\n if (!vis[l]) ok = 0;\n vis[l] = 0;\n }\n }\n if (a[i + 1][v[0]] || a[i + 1][v[0] + 1] || a[i + 1][v[0] + 4] || a[i + 1][v[0] + 5]) {\n ok = 0;\n }\n if (ok) st[i + 1].insert(v);\n }\n }\n }\n\n if (st[n].size()) printf(\"1\\n\");\n else printf(\"0\\n\");\n\n for (int i = 0; i <= n; i++) st[i].clear();\n }\n return 0;\n}","accuracy":1,"time_ms":280,"memory_kb":37844,"score_of_the_acc":-0.6257,"final_rank":16},{"submission_id":"aoj_1243_6255081","code_snippet":"#include <iostream>\n#include <queue>\n#include <vector>\n#include <cstring>\n\nusing namespace std;\n\nint counter[365][9][7][7][7][7];\n\nint rain[9][16] {\n {1,1,0,0,1,1,0,0,0,0,0,0,0,0,0,0},\n {0,1,1,0,0,1,1,0,0,0,0,0,0,0,0,0},\n {0,0,1,1,0,0,1,1,0,0,0,0,0,0,0,0},\n {0,0,0,0,1,1,0,0,1,1,0,0,0,0,0,0},\n {0,0,0,0,0,1,1,0,0,1,1,0,0,0,0,0},\n {0,0,0,0,0,0,1,1,0,0,1,1,0,0,0,0},\n {0,0,0,0,0,0,0,0,1,1,0,0,1,1,0,0},\n {0,0,0,0,0,0,0,0,0,1,1,0,0,1,1,0},\n {0,0,0,0,0,0,0,0,0,0,1,1,0,0,1,1},\n};\n\nint adj[9][9] {\n {1,1,1,1,0,0,1,0,0},\n {1,1,1,0,1,0,0,1,0},\n {1,1,1,0,0,1,0,0,1},\n {1,0,0,1,1,1,1,0,0},\n {0,1,0,1,1,1,0,1,0},\n {0,0,1,1,1,1,0,0,1},\n {1,0,0,1,0,0,1,1,1},\n {0,1,0,0,1,0,1,1,1},\n {0,0,1,0,0,1,1,1,1},\n};\n\nstruct X\n{\n X(int d, int p, int ul, int ll, int ur, int lr) : day{d}, pos{p}, upleft{ul}, loleft{ll}, upright{ur}, loright{lr} {}\n int day;\n int pos;\n int upleft;\n int loleft;\n int upright;\n int loright;\n};\n\nbool check_pos(int p, vector<vector<int> > &event, int day) {\n for (int i=0; i<16; ++i)\n if (rain[p][i] == 1 && event[day][i] == 1) return false;\n return true;\n}\n\nbool check_day(int a, int b, int c, int d) {\n return !(a == 7 || b == 7 || c == 7 || d == 7);\n}\n\nint solve(int day, vector<vector<int> > &event) {\n int check = 0; // クリアできるか\n queue<X> Q;\n X init(0,4,1,1,1,1);\n if (!check_pos(4, event, 0)) return 0;\n Q.push(init);\n while (!Q.empty()) {\n X pick = Q.front();\n Q.pop();\n for(int i=0; i<9; ++i) {\n if (adj[pick.pos][i] == 1) {\n X c(pick.day+1,i,pick.upleft+1,pick.loleft+1,pick.upright+1,pick.loright+1);\n if (i == 0) c.upleft = 0; else if (i == 2) c.upright = 0; else if (i == 6) c.loleft = 0; else if (i == 8) c.loright = 0;\n if (check_pos(i, event, c.day) && check_day(c.upleft, c.loleft, c.upright, c.loright)) {\n if (c.day == day-1) {\n check = 1;\n goto label;\n } else {\n if (counter[c.day][c.pos][c.upleft][c.loleft][c.upright][c.loright] == 0) {\n Q.push(c);\n counter[c.day][c.pos][c.upleft][c.loleft][c.upright][c.loright] += 1;\n }\n }\n }\n }\n }\n }\n label: ;\n return check;\n}\n\nint main() {\n int total;\n while (cin >> total && total > 0) {\n vector<vector<int> > event(total, vector<int>(16));\n for (int i=0; i<total; ++i) {\n for (int j=0; j<16; ++j) {\n cin >> event[i][j];\n }\n }\n memset(counter, 0, sizeof(counter));\n int ans = solve(total, event);\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":40,"memory_kb":33992,"score_of_the_acc":-0.2705,"final_rank":7},{"submission_id":"aoj_1243_6238937","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define ALL(x) x.begin(), x.end()\n\nbool dp[370][3][3][7][7][7][7][16];\nbool a[370][4][4];\nbool ok[3][3];\n\nconst int dx[9] = {2, 1, -1, -2, 0, 0, 0, 0, 0};\nconst int dy[9] = {0, 0, 0, 0, 0, 2, 1, -1, -2};\n\nvoid solve(int N) {\n rep(i, N) rep(x, 3) rep(y, 3) rep(a1, 7) rep(a2, 7) rep(a3, 7) rep(a4, 7) rep(k, 16) dp[i][x][y][a1][a2][a3][a4][k] = false;\n rep(i, N) rep(x, 4) rep(y, 4) cin >> a[i][x][y];\n if (a[0][1][1] == true || a[0][1][2] == true || a[0][2][1] == true || a[0][2][2] == true) {\n cout << 0 << '\\n';\n return;\n }\n dp[0][1][1][1][1][1][1][0] = true;\n for (int i = 1; i < N; i++) {\n rep(cx, 3) rep(cy, 3) {\n if (a[i][cx][cy] == true || a[i][cx][cy + 1] == true || a[i][cx + 1][cy] == true || a[i][cx + 1][cy + 1] == true)\n ok[cx][cy] = false;\n else\n ok[cx][cy] = true;\n }\n rep(cx, 3) rep(cy, 3) rep(a1, 7) rep(a2, 7) rep(a3, 7) rep(a4, 7) rep(b, 16) {\n if (dp[i - 1][cx][cy][a1][a2][a3][a4][b] == false) continue;\n // 遷移\n rep(k, 9) {\n int nx = cx + dx[k], ny = cy + dy[k];\n if (!(0 <= nx && nx < 3 && 0 <= ny && ny < 3)) continue;\n if (ok[nx][ny] == false) continue;\n int na1 = a1 + 1, na2 = a2 + 1, na3 = a3 + 1, na4 = a4 + 1, nb = b;\n if (nx == 0 && ny == 0) na1 = 0, nb |= 1;\n if (nx == 0 && ny == 2) na2 = 0, nb |= 2;\n if (nx == 2 && ny == 0) na3 = 0, nb |= 4;\n if (nx == 2 && ny == 2) na4 = 0, nb |= 8;\n if (na1 > 6) continue;\n if (na2 > 6) continue;\n if (na3 > 6) continue;\n if (na4 > 6) continue;\n dp[i][nx][ny][na1][na2][na3][na4][nb] = true;\n }\n }\n }\n rep(cx, 3) rep(cy, 3) rep(a1, 7) rep(a2, 7) rep(a3, 7) rep(a4, 7) {\n if (dp[N - 1][cx][cy][a1][a2][a3][a4][15] == true) {\n cout << 1 << '\\n';\n return;\n }\n }\n cout << 0 << '\\n';\n return;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n int N;\n while (cin >> N, N) solve(N);\n return 0;\n}","accuracy":1,"time_ms":490,"memory_kb":128228,"score_of_the_acc":-1.6351,"final_rank":19},{"submission_id":"aoj_1243_6128201","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <queue>\n#include <tuple>\n#include <cstring>\nusing namespace std;\n\nconst int MAX_N = 370;\nconst int AREA_NUM = 16;\nconst int dx[] = {0, 1, 0, -1, 0, 2, 0, -2, 0};\nconst int dy[] = {0, 0, -1, 0, 1, 0, -2, 0, 2};\nconst int ax[] = {0, 1, 0, 1};\nconst int ay[] = {0, 0, 1, 1};\nint cache[MAX_N][3][3][7][7][7][7];\n\nint need_sun[MAX_N][AREA_NUM];\n\nstruct State\n{\n int x;\n int y;\n int t;\n int A;\n int B;\n int C;\n int D;\n};\n\nbool check_border(int x, int y)\n{\n return ((0 <= x) && (x < 4) && (0 <= y) && (y < 4));\n}\n\nbool check_pos_and_specialday(int left_x, int top_y, int t)\n{\n int right_x = left_x + 1;\n int bottom_y = top_y + 1;\n if (check_border(left_x, top_y) &&\n check_border(right_x, bottom_y))\n return (need_sun[t][left_x + top_y * 4] == 0) &&\n (need_sun[t][left_x + bottom_y * 4] == 0) &&\n (need_sun[t][right_x + top_y * 4] == 0) &&\n (need_sun[t][right_x + bottom_y * 4] == 0);\n else\n return false;\n}\n\nbool check_dry(State state)\n{\n return state.A < 7 && state.B < 7 && state.C < 7 && state.D < 7;\n}\n\nState update_state(State state, int nx, int ny)\n{\n State new_state = {nx, ny, state.t + 1,\n state.A + 1, state.B + 1,\n state.C + 1, state.D + 1};\n int idx = 0;\n for (int i = 0; i < 4; i++)\n {\n idx = nx + ax[i] + (ny + ay[i]) * 4;\n if (idx == 0)\n new_state.A = 0;\n else if (idx == 3)\n new_state.B = 0;\n else if (idx == 12)\n new_state.C = 0;\n else if (idx == 15)\n new_state.D = 0;\n }\n return new_state;\n}\n\nint solve(int N, int sx, int sy)\n{\n int nx, ny, t;\n\n //左上のx座標・左上のy座標・何日目か・マス1の雨が降っていない期間\n queue<State> que;\n State init_state = {sx, sy, 0, 1, 1, 1, 1};\n\n bool last_day = false;\n que.push(init_state);\n while (!que.empty())\n {\n State state = que.front();\n que.pop();\n\n if (cache[state.t][state.x][state.y][state.A][state.B][state.C][state.D]++)\n continue;\n for (int i = 0; i < 9; i++)\n {\n nx = state.x + dx[i];\n ny = state.y + dy[i];\n t = state.t;\n if (t == N - 1)\n {\n last_day = true;\n break;\n }\n State new_state = update_state(state, nx, ny);\n if (check_dry(new_state) && check_pos_and_specialday(nx, ny, t + 1))\n que.push(new_state);\n }\n }\n\n if (last_day)\n return 1;\n else\n return 0;\n}\n\nint main()\n{\n int N;\n while (cin >> N)\n {\n if (N == 0)\n break;\n\n for (int i = 0; i < N; i++)\n for (int j = 0; j < AREA_NUM; j++)\n cin >> need_sun[i][j];\n\n memset(cache, 0, sizeof(cache));\n int ans = solve(N, 1, 1);\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":50,"memory_kb":34656,"score_of_the_acc":-0.2893,"final_rank":13},{"submission_id":"aoj_1243_6127328","code_snippet":"#include <algorithm>\n#include <iostream>\n#include <tuple>\n#include <set>\n#include <vector>\n#include <queue>\nusing namespace std;\n\nint n;\nint cover[3][3];\nint schedule[365];\nint dx[3][3][5];\nint dy[3][3][5];\n// {四隅の連続して雨の降っていない日数、雲のx座標、雲のy座標、日付}\nusing State = tuple<int, int, int, int, int, int, int>;\nset<State> used;\n\nint solve() {\n used.clear();\n for(int i = 0; i < n; i++) {\n schedule[i] = 0;\n for(int j = 0; j < 16; j++) {\n int x; cin >> x;\n schedule[i] += x << j;\n }\n }\n // bit演算で重なりを判定\n if(cover[1][1] & schedule[0]) return 0;\n queue<State> q;\n q.push({1, 1, 1, 1, 1, 1, 0});\n while(!q.empty()) {\n auto now = q.front();\n q.pop();\n int c0 = get<0>(now), c1 = get<1>(now), c2 = get<2>(now), c3 = get<3>(now),\n x = get<4>(now), y = get<5>(now), d = get<6>(now);\n if(d == n-1) return 1;\n c0++; c1++; c2++; c3++;\n for(int i = 0; i < 5; i++) {\n int nx = x + dx[x][y][i], ny = y + dy[x][y][i];\n // markets and festivals と重なっていないか\n if((cover[nx][ny]&schedule[d+1]) == 0) {\n State nxt = make_tuple(c0, c1, c2, c3, nx, ny, d+1);\n // 雨を降らしたときの日数のリセット\n if(nx == 0 && ny == 0) {\n get<0>(nxt) = 0;\n } else if(nx == 0 && ny == 2) {\n get<1>(nxt) = 0;\n } else if(nx == 2 && ny == 0) {\n get<2>(nxt) = 0;\n } else if(nx == 2 && ny == 2) {\n get<3>(nxt) = 0;\n }\n // 雨を連続で降らせていない場所がないか\n if(!used.count(nxt) &&\n get<0>(nxt) != 7 && get<1>(nxt) != 7 &&\n get<2>(nxt) != 7 && get<3>(nxt) != 7) {\n q.push(nxt);\n used.insert(nxt);\n }\n }\n }\n }\n return 0;\n}\n\nint main() {\n // 雲の遷移、雲がカバーしている位置の前計算\n // bit演算によって位置を管理することで高速化している\n // 以下のように番号を振り、雲がいるときは cover について番号のbitを立てる\n // 0 1 2 3\n // 4 5 6 7\n // 8 9 10 11\n // 12 13 14 15\n for(int i = 0; i < 3; i++) {\n for(int j = 0; j < 3; j++) {\n for(int ii = 0; ii < 2; ii++) {\n for(int jj = 0; jj < 2; jj++) {\n cover[i][j] += 1 << ((i + ii) * 4 + (j + jj));\n }\n }\n for(int k = 1; k < 3; k++) {\n dx[i][j][k ] = (i + k) % 3 - i;\n dy[i][j][k+2] = (j + k) % 3 - j;\n }\n }\n }\n vector<int> ans;\n while(1) {\n cin >> n;\n if(n == 0) break;\n ans.push_back(solve());\n }\n for(auto &i : ans) cout << i << endl;\n}","accuracy":1,"time_ms":70,"memory_kb":7796,"score_of_the_acc":-0.1007,"final_rank":4},{"submission_id":"aoj_1243_6107405","code_snippet":"#include <algorithm>\n#include <iostream>\n#include <tuple>\n#include <set>\n#include <vector>\n#include <queue>\nusing namespace std;\n\nint n;\nint cover[3][3];\nint schedule[365];\nint dx[3][3][5];\nint dy[3][3][5];\nusing State = tuple<int, int, int, int, int, int, int>;\nset<State> used;\n\nint solve() {\n used.clear();\n for(int i = 0; i < n; i++) {\n schedule[i] = 0;\n for(int j = 0; j < 16; j++) {\n int x; cin >> x;\n schedule[i] += x << j;\n }\n }\n if(cover[1][1] & schedule[0]) return 0;\n queue<State> q;\n q.push({1, 1, 1, 1, 1, 1, 0});\n while(!q.empty()) {\n auto now = q.front();\n q.pop();\n int c0 = get<0>(now), c1 = get<1>(now), c2 = get<2>(now), c3 = get<3>(now),\n x = get<4>(now), y = get<5>(now), d = get<6>(now);\n if(d == n-1) return 1;\n c0++; c1++; c2++; c3++;\n for(int i = 0; i < 5; i++) {\n int nx = x + dx[x][y][i], ny = y + dy[x][y][i];\n if((cover[nx][ny]&schedule[d+1]) == 0) {\n // cerr << x << \" \" << y << \" \" << nx << \" \" << ny << endl;\n State nxt = make_tuple(c0, c1, c2, c3, nx, ny, d+1);\n if(nx == 0 && ny == 0) {\n get<0>(nxt) = 0;\n } else if(nx == 0 && ny == 2) {\n get<1>(nxt) = 0;\n } else if(nx == 2 && ny == 0) {\n get<2>(nxt) = 0;\n } else if(nx == 2 && ny == 2) {\n get<3>(nxt) = 0;\n }\n if(!used.count(nxt) &&\n get<0>(nxt) != 7 && get<1>(nxt) != 7 &&\n get<2>(nxt) != 7 && get<3>(nxt) != 7) {\n q.push(nxt);\n used.insert(nxt);\n }\n }\n }\n }\n return 0;\n}\n\nint main() {\n for(int i = 0; i < 3; i++) {\n for(int j = 0; j < 3; j++) {\n for(int ii = 0; ii < 2; ii++) {\n for(int jj = 0; jj < 2; jj++) {\n cover[i][j] += 1 << ((i + ii) * 4 + (j + jj));\n }\n }\n for(int k = 1; k < 3; k++) {\n dx[i][j][k ] = (i + k) % 3 - i;\n dy[i][j][k+2] = (j + k) % 3 - j;\n }\n }\n }\n vector<int> ans;\n while(1) {\n cin >> n;\n if(n == 0) break;\n ans.push_back(solve());\n }\n for(auto &i : ans) cout << i << endl;\n}","accuracy":1,"time_ms":70,"memory_kb":7748,"score_of_the_acc":-0.1003,"final_rank":3},{"submission_id":"aoj_1243_6106653","code_snippet":"/*\nhttps://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1243\n\n現在の雲の左上の座標・何日目か・1,4,13,16番のセルが何日間連続で雨が降っていないかという情報を\nクラスStateで保存する。方針としては幅優先探索を可能な限り行っていき、最終日まで条件を満たしながら\n雲を動かしてけるかを確かめる。この時同じ状態を何度も探索することを防ぐために、cacheを用いている。\n\ncacheを使うことを中々思いつかず、計算時間の問題を解決するのに時間がかかった。結局1時間程\nかかってしまった。\n */\n\n#include <iostream>\n#include <algorithm>\n#include <queue>\n#include <tuple>\n#include <cstring>\nusing namespace std;\n\nconst int MAX_N = 370;\nconst int AREA_NUM = 16;\nconst int dx[] = {0, 1, 0, -1, 0, 2, 0, -2, 0};\nconst int dy[] = {0, 0, -1, 0, 1, 0, -2, 0, 2};\nconst int ax[] = {0, 1, 0, 1};\nconst int ay[] = {0, 0, 1, 1};\nint cache[MAX_N][3][3][7][7][7][7];\n\nint need_sun[MAX_N][AREA_NUM];\n\nstruct State\n{\n int x;\n int y;\n int t;\n int A;\n int B;\n int C;\n int D;\n};\n\nbool check_border(int x, int y)\n{\n return ((0 <= x) && (x < 4) && (0 <= y) && (y < 4));\n}\n\nbool check_pos_and_specialday(int left_x, int top_y, int t)\n{\n int right_x = left_x + 1;\n int bottom_y = top_y + 1;\n if (check_border(left_x, top_y) &&\n check_border(right_x, bottom_y))\n return (need_sun[t][left_x + top_y * 4] == 0) &&\n (need_sun[t][left_x + bottom_y * 4] == 0) &&\n (need_sun[t][right_x + top_y * 4] == 0) &&\n (need_sun[t][right_x + bottom_y * 4] == 0);\n else\n return false;\n}\n\nbool check_dry(State state)\n{\n return state.A < 7 && state.B < 7 && state.C < 7 && state.D < 7;\n}\n\nState update_state(State state, int nx, int ny)\n{\n State new_state = {nx, ny, state.t + 1,\n state.A + 1, state.B + 1,\n state.C + 1, state.D + 1};\n int idx = 0;\n for (int i = 0; i < 4; i++)\n {\n idx = nx + ax[i] + (ny + ay[i]) * 4;\n if (idx == 0)\n new_state.A = 0;\n else if (idx == 3)\n new_state.B = 0;\n else if (idx == 12)\n new_state.C = 0;\n else if (idx == 15)\n new_state.D = 0;\n }\n return new_state;\n}\n\nint solve(int N, int sx, int sy)\n{\n int nx, ny, t;\n\n //左上のx座標・左上のy座標・何日目か・マス1の雨が降っていない期間\n queue<State> que;\n State init_state = {sx, sy, 0, 1, 1, 1, 1};\n\n bool last_day = false;\n que.push(init_state);\n while (!que.empty())\n {\n State state = que.front();\n que.pop();\n\n if (cache[state.t][state.x][state.y][state.A][state.B][state.C][state.D]++)\n continue;\n for (int i = 0; i < 9; i++)\n {\n nx = state.x + dx[i];\n ny = state.y + dy[i];\n t = state.t;\n if (t == N - 1)\n {\n last_day = true;\n break;\n }\n State new_state = update_state(state, nx, ny);\n if (check_dry(new_state) && check_pos_and_specialday(nx, ny, t + 1))\n que.push(new_state);\n }\n }\n\n if (last_day)\n return 1;\n else\n return 0;\n}\n\nint main()\n{\n int N;\n while (cin >> N)\n {\n if (N == 0)\n break;\n\n for (int i = 0; i < N; i++)\n for (int j = 0; j < AREA_NUM; j++)\n cin >> need_sun[i][j];\n\n memset(cache, 0, sizeof(cache));\n int ans = solve(N, 1, 1);\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":40,"memory_kb":34644,"score_of_the_acc":-0.2757,"final_rank":9},{"submission_id":"aoj_1243_6106604","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <queue>\n#include <tuple>\n#include <cstring>\nusing namespace std;\n\nconst int MAX_N = 370;\nconst int AREA_NUM = 16;\nconst int dx[] = {0, 1, 0, -1, 0, 2, 0, -2, 0};\nconst int dy[] = {0, 0, -1, 0, 1, 0, -2, 0, 2};\nconst int ax[] = {0, 1, 0, 1};\nconst int ay[] = {0, 0, 1, 1};\nint cache[MAX_N][3][3][7][7][7][7];\n\nint need_sun[MAX_N][AREA_NUM];\n\nstruct Info\n{\n int x;\n int y;\n int t;\n int A;\n int B;\n int C;\n int D;\n};\n\nbool check_border(int x, int y)\n{\n return ((0 <= x) && (x < 4) && (0 <= y) && (y < 4));\n}\n\nbool check_pos_and_specialday(int left_x, int top_y, int t)\n{\n int right_x = left_x + 1;\n int bottom_y = top_y + 1;\n if (check_border(left_x, top_y) &&\n check_border(right_x, bottom_y))\n return (need_sun[t][left_x + top_y * 4] == 0) &&\n (need_sun[t][left_x + bottom_y * 4] == 0) &&\n (need_sun[t][right_x + top_y * 4] == 0) &&\n (need_sun[t][right_x + bottom_y * 4] == 0);\n else\n return false;\n}\n\nbool check_dry(Info info)\n{\n return info.A < 7 && info.B < 7 && info.C < 7 && info.D < 7;\n}\n\nInfo update_info(Info info, int nx, int ny)\n{\n Info new_info = {nx, ny, info.t + 1,\n info.A + 1, info.B + 1,\n info.C + 1, info.D + 1};\n int idx = 0;\n for (int i = 0; i < 4; i++)\n {\n idx = nx + ax[i] + (ny + ay[i]) * 4;\n if (idx == 0)\n new_info.A = 0;\n else if (idx == 3)\n new_info.B = 0;\n else if (idx == 12)\n new_info.C = 0;\n else if (idx == 15)\n new_info.D = 0;\n }\n return new_info;\n}\n\nint solve(int N, int sx, int sy)\n{\n int nx, ny, t;\n\n //左上のx座標・左上のy座標・何日目か・マス1の雨が降っていない期間\n queue<Info> que;\n Info init_state = {sx, sy, 0, 1, 1, 1, 1};\n\n bool last_day = false;\n que.push(init_state);\n while (!que.empty())\n {\n Info info = que.front();\n que.pop();\n\n if (cache[info.t][info.x][info.y][info.A][info.B][info.C][info.D]++)\n continue;\n for (int i = 0; i < 9; i++)\n {\n nx = info.x + dx[i];\n ny = info.y + dy[i];\n t = info.t;\n if (t == N - 1)\n {\n last_day = true;\n break;\n }\n Info new_info = update_info(info, nx, ny);\n if (check_dry(new_info) && check_pos_and_specialday(nx, ny, t + 1))\n que.push(new_info);\n }\n }\n\n if (last_day)\n return 1;\n else\n return 0;\n}\n\nint main()\n{\n int N;\n while (cin >> N)\n {\n if (N == 0)\n break;\n\n for (int i = 0; i < N; i++)\n for (int j = 0; j < AREA_NUM; j++)\n cin >> need_sun[i][j];\n\n memset(cache, 0, sizeof(cache));\n int ans = solve(N, 1, 1);\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":50,"memory_kb":34656,"score_of_the_acc":-0.2893,"final_rank":13},{"submission_id":"aoj_1243_6106603","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <queue>\n#include <tuple>\n#include <cstring>\nusing namespace std;\n\nconst int MAX_N = 370;\nconst int AREA_NUM = 16;\nconst int dx[] = {0, 1, 0, -1, 0, 2, 0, -2, 0};\nconst int dy[] = {0, 0, -1, 0, 1, 0, -2, 0, 2};\nconst int ax[] = {0, 1, 0, 1};\nconst int ay[] = {0, 0, 1, 1};\nint cache[MAX_N][3][3][7][7][7][7];\n\nint need_sun[MAX_N][AREA_NUM];\n\nstruct Info\n{\n int x;\n int y;\n int t;\n int A;\n int B;\n int C;\n int D;\n};\n\nbool check_border(int x, int y)\n{\n return ((0 <= x) && (x < 4) && (0 <= y) && (y < 4));\n}\n\nbool check_pos_and_specialday(int left_x, int top_y, int t)\n{\n int right_x = left_x + 1;\n int bottom_y = top_y + 1;\n if (check_border(left_x, top_y) &&\n check_border(right_x, bottom_y))\n return (need_sun[t][left_x + top_y * 4] == 0) &&\n (need_sun[t][left_x + bottom_y * 4] == 0) &&\n (need_sun[t][right_x + top_y * 4] == 0) &&\n (need_sun[t][right_x + bottom_y * 4] == 0);\n else\n return false;\n}\n\nbool check_dry(Info info)\n{\n return info.A < 7 && info.B < 7 && info.C < 7 && info.D < 7;\n}\n\nInfo update_info(Info info, int nx, int ny)\n{\n Info new_info = {nx, ny, info.t + 1,\n info.A + 1, info.B + 1,\n info.C + 1, info.D + 1};\n int idx = 0;\n for (int i = 0; i < 4; i++)\n {\n idx = nx + ax[i] + (ny + ay[i]) * 4;\n if (idx == 0)\n new_info.A = 0;\n else if (idx == 3)\n new_info.B = 0;\n else if (idx == 12)\n new_info.C = 0;\n else if (idx == 15)\n new_info.D = 0;\n }\n return new_info;\n}\n\nint solve(int N, int sx, int sy)\n{\n int nx, ny, t;\n\n //左上のx座標・左上のy座標・何日目か・マス1の雨が降っていない期間\n queue<Info> que;\n Info init_state = {sx, sy, 0, 1, 1, 1, 1};\n\n bool last_day = false;\n que.push(init_state);\n while (!que.empty())\n {\n Info info = que.front();\n que.pop();\n\n if (cache[info.t][info.x][info.y][info.A][info.B][info.C][info.D]++)\n continue;\n for (int i = 0; i < 9; i++)\n {\n nx = info.x + dx[i];\n ny = info.y + dy[i];\n t = info.t;\n if (t == N - 1)\n {\n last_day = true;\n break;\n }\n Info new_info = update_info(info, nx, ny);\n if (check_dry(new_info) && check_pos_and_specialday(nx, ny, t + 1))\n que.push(new_info);\n }\n }\n\n if (last_day)\n return 1;\n else\n return 0;\n}\n\nint main()\n{\n int N;\n while (cin >> N)\n {\n if (N == 0)\n break;\n\n for (int i = 0; i < N; i++)\n for (int j = 0; j < AREA_NUM; j++)\n cin >> need_sun[i][j];\n\n int ans = 0;\n memset(cache, 0, sizeof(cache));\n // if (check_pos_and_specialday(1, 1, 0))\n ans = solve(N, 1, 1);\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":40,"memory_kb":34628,"score_of_the_acc":-0.2756,"final_rank":8},{"submission_id":"aoj_1243_6106602","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <queue>\n#include <tuple>\n#include <cstring>\nusing namespace std;\n\nconst int MAX_N = 370;\nconst int AREA_NUM = 16;\nconst int dx[] = {0, 1, 0, -1, 0, 2, 0, -2, 0};\nconst int dy[] = {0, 0, -1, 0, 1, 0, -2, 0, 2};\nconst int ax[] = {0, 1, 0, 1};\nconst int ay[] = {0, 0, 1, 1};\nint cache[MAX_N][3][3][7][7][7][7];\n\nint need_sun[MAX_N][AREA_NUM];\n\nstruct Info\n{\n int x;\n int y;\n int t;\n int A;\n int B;\n int C;\n int D;\n};\n\nbool check_border(int x, int y)\n{\n return ((0 <= x) && (x < 4) && (0 <= y) && (y < 4));\n}\n\nbool check_pos_and_specialday(int left_x, int top_y, int t)\n{\n int right_x = left_x + 1;\n int bottom_y = top_y + 1;\n if (check_border(left_x, top_y) &&\n check_border(right_x, bottom_y))\n return (need_sun[t][left_x + top_y * 4] == 0) &&\n (need_sun[t][left_x + bottom_y * 4] == 0) &&\n (need_sun[t][right_x + top_y * 4] == 0) &&\n (need_sun[t][right_x + bottom_y * 4] == 0);\n else\n return false;\n}\n\nbool check_dry(Info info)\n{\n return info.A < 7 && info.B < 7 && info.C < 7 && info.D < 7;\n}\n\nInfo update_info(Info info, int nx, int ny)\n{\n Info new_info = {nx, ny, info.t + 1,\n info.A + 1, info.B + 1,\n info.C + 1, info.D + 1};\n int idx = 0;\n for (int i = 0; i < 4; i++)\n {\n idx = nx + ax[i] + (ny + ay[i]) * 4;\n if (idx == 0)\n new_info.A = 0;\n else if (idx == 3)\n new_info.B = 0;\n else if (idx == 12)\n new_info.C = 0;\n else if (idx == 15)\n new_info.D = 0;\n }\n return new_info;\n}\n\nint solve(int N, int sx, int sy)\n{\n int nx, ny, t;\n\n //左上のx座標・左上のy座標・何日目か・マス1の雨が降っていない期間\n queue<Info> que;\n Info init_state = {sx, sy, 0, 1, 1, 1, 1};\n\n bool last_day = false;\n que.push(init_state);\n while (!que.empty())\n {\n Info info = que.front();\n que.pop();\n\n if (cache[info.t][info.x][info.y][info.A][info.B][info.C][info.D]++)\n continue;\n for (int i = 0; i < 9; i++)\n {\n nx = info.x + dx[i];\n ny = info.y + dy[i];\n t = info.t;\n if (t == N - 1)\n {\n last_day = true;\n break;\n }\n Info new_info = update_info(info, nx, ny);\n if (check_dry(new_info) && check_pos_and_specialday(nx, ny, t + 1))\n que.push(new_info);\n }\n }\n\n if (last_day)\n return 1;\n else\n return 0;\n}\n\nint main()\n{\n int N;\n while (cin >> N)\n {\n if (N == 0)\n break;\n\n for (int i = 0; i < N; i++)\n for (int j = 0; j < AREA_NUM; j++)\n cin >> need_sun[i][j];\n\n int ans = 0;\n memset(cache, 0, sizeof(cache));\n if (check_pos_and_specialday(1, 1, 0))\n ans = solve(N, 1, 1);\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":50,"memory_kb":34488,"score_of_the_acc":-0.288,"final_rank":11},{"submission_id":"aoj_1243_6106591","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <queue>\n#include <tuple>\n#include <cstring>\nusing namespace std;\n\nconst int MAX_N = 370;\nconst int AREA_NUM = 16;\nconst int dx[] = {0, 1, 0, -1, 0, 2, 0, -2, 0};\nconst int dy[] = {0, 0, -1, 0, 1, 0, -2, 0, 2};\nconst int ax[] = {0, 1, 0, 1};\nconst int ay[] = {0, 0, 1, 1};\nint cache[MAX_N][3][3][7][7][7][7];\n\nint need_sun[MAX_N][AREA_NUM];\n\nstruct Info\n{\n int x;\n int y;\n int t;\n int A;\n int B;\n int C;\n int D;\n};\n\nbool check_border(int x, int y)\n{\n return ((0 <= x) && (x < 4) && (0 <= y) && (y < 4));\n}\n\nbool valid(int left_x, int top_y, int t)\n{\n int right_x = left_x + 1;\n int bottom_y = top_y + 1;\n if (check_border(left_x, top_y) &&\n check_border(right_x, bottom_y))\n return (need_sun[t][left_x + top_y * 4] == 0) &&\n (need_sun[t][left_x + bottom_y * 4] == 0) &&\n (need_sun[t][right_x + top_y * 4] == 0) &&\n (need_sun[t][right_x + bottom_y * 4] == 0);\n else\n return false;\n}\n\nInfo update_info(Info info, int nx, int ny)\n{\n Info new_info = {nx, ny, info.t + 1,\n info.A + 1, info.B + 1,\n info.C + 1, info.D + 1};\n int idx = 0;\n for (int i = 0; i < 4; i++)\n {\n idx = nx + ax[i] + (ny + ay[i]) * 4;\n if (idx == 0)\n new_info.A = 0;\n else if (idx == 3)\n new_info.B = 0;\n else if (idx == 12)\n new_info.C = 0;\n else if (idx == 15)\n new_info.D = 0;\n }\n return new_info;\n}\n\nbool dry_check(Info info)\n{\n return info.A < 7 && info.B < 7 && info.C < 7 && info.D < 7;\n}\n\nint solve(int N, int sx, int sy)\n{\n int nx, ny, t;\n\n //左上のx座標・左上のy座標・何日目か・マス1の雨が降っていない期間\n queue<Info> que;\n Info init_state = {sx, sy, 0, 1, 1, 1, 1};\n\n bool last_day = false;\n que.push(init_state);\n while (!que.empty())\n {\n Info info = que.front();\n que.pop();\n\n if (cache[info.t][info.x][info.y][info.A][info.B][info.C][info.D]++)\n continue;\n for (int i = 0; i < 9; i++)\n {\n nx = info.x + dx[i];\n ny = info.y + dy[i];\n t = info.t;\n if (t == N - 1)\n {\n last_day = true;\n break;\n }\n Info new_info = update_info(info, nx, ny);\n if (dry_check(new_info) && valid(nx, ny, t + 1))\n que.push(new_info);\n }\n }\n\n if (last_day)\n return 1;\n else\n return 0;\n}\n\nint main()\n{\n int N;\n while (cin >> N)\n {\n if (N == 0)\n break;\n\n for (int i = 0; i < N; i++)\n for (int j = 0; j < AREA_NUM; j++)\n cin >> need_sun[i][j];\n\n int ans = 0;\n memset(cache, 0, sizeof(cache));\n if (valid(1, 1, 0))\n ans = solve(N, 1, 1);\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":50,"memory_kb":34624,"score_of_the_acc":-0.2891,"final_rank":12},{"submission_id":"aoj_1243_6106589","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <queue>\n#include <tuple>\n#include <cstring>\nusing namespace std;\n\nconst int MAX_N = 370;\nconst int AREA_NUM = 16;\nconst int dx[] = {0, 1, 0, -1, 0, 2, 0, -2, 0};\nconst int dy[] = {0, 0, -1, 0, 1, 0, -2, 0, 2};\nconst int ax[] = {0, 1, 0, 1};\nconst int ay[] = {0, 0, 1, 1};\nint cache[MAX_N][3][3][7][7][7][7];\n\nint need_sun[MAX_N][AREA_NUM];\n\nstruct Info\n{\n int x;\n int y;\n int t;\n int A;\n int B;\n int C;\n int D;\n};\n\nbool check_border(int x, int y)\n{\n return ((0 <= x) && (x < 4) && (0 <= y) && (y < 4));\n}\n\nbool valid(int left_x, int top_y, int t)\n{\n int right_x = left_x + 1;\n int bottom_y = top_y + 1;\n if (check_border(left_x, top_y) &&\n check_border(right_x, bottom_y))\n return (need_sun[t][left_x + top_y * 4] == 0) &&\n (need_sun[t][left_x + bottom_y * 4] == 0) &&\n (need_sun[t][right_x + top_y * 4] == 0) &&\n (need_sun[t][right_x + bottom_y * 4] == 0);\n else\n return false;\n}\n\nInfo update_info(Info info, int nx, int ny)\n{\n Info new_info = {nx, ny, info.t + 1,\n info.A + 1, info.B + 1,\n info.C + 1, info.D + 1};\n int idx = 0;\n for (int i = 0; i < 4; i++)\n {\n idx = nx + ax[i] + (ny + ay[i]) * 4;\n if (idx == 0)\n new_info.A = 0;\n else if (idx == 3)\n new_info.B = 0;\n else if (idx == 12)\n new_info.C = 0;\n else if (idx == 15)\n new_info.D = 0;\n }\n return new_info;\n}\n\nbool dry_check(Info info)\n{\n return info.A < 7 && info.B < 7 && info.C < 7 && info.D < 7;\n}\n\nint solve(int N, int sx, int sy)\n{\n int nx, ny, t;\n\n //左上のx座標・左上のy座標・何日目か・マス1の雨が降っていない期間\n queue<Info> que;\n Info init_state = {sx, sy, 0, 1, 1, 1, 1};\n int visit[4][4];\n for (int i = 0; i < 16; i++)\n visit[i % 4][i / 4] = 0;\n\n bool last_day = false;\n que.push(init_state);\n while (!que.empty())\n {\n Info info = que.front();\n que.pop();\n\n if (cache[info.t][info.x][info.y][info.A][info.B][info.C][info.D]++)\n continue;\n\n visit[info.x][info.y] = 1;\n visit[info.x + 1][info.y] = 1;\n visit[info.x][info.y + 1] = 1;\n visit[info.x + 1][info.y + 1] = 1;\n for (int i = 0; i < 9; i++)\n {\n nx = info.x + dx[i];\n ny = info.y + dy[i];\n t = info.t;\n if (t == N - 1)\n {\n last_day = true;\n break;\n }\n Info new_info = update_info(info, nx, ny);\n if (dry_check(new_info) && valid(nx, ny, t + 1))\n que.push(new_info);\n }\n }\n\n int visited_areas = 0;\n for (int i = 0; i < 4; i++)\n for (int j = 0; j < 4; j++)\n visited_areas += visit[i][j];\n\n if (last_day && (visited_areas == 16))\n return 1;\n else\n return 0;\n}\n\nint main()\n{\n int N;\n while (cin >> N)\n {\n if (N == 0)\n break;\n\n for (int i = 0; i < N; i++)\n for (int j = 0; j < AREA_NUM; j++)\n cin >> need_sun[i][j];\n\n int ans = 0;\n memset(cache, 0, sizeof(cache));\n if (valid(1, 1, 0))\n ans = solve(N, 1, 1);\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":50,"memory_kb":34416,"score_of_the_acc":-0.2874,"final_rank":10},{"submission_id":"aoj_1243_6011133","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define all(A) A.begin(),A.end()\nusing vll = vector<ll>;\n#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)\n\nvector<vll> Q={{1,2,5,6},{2,3,6,7},{3,4,7,8},{5,6,9,10},{6,7,10,11},{7,8,11,12},{9,10,13,14},{10,11,14,15},{11,12,15,16}};\nvector<vll> T={{0,1,2,3,6},{0,1,2,4,7},{0,1,2,5,8},{3,4,5,0,6},{3,4,5,1,7},{3,4,5,2,8},{6,7,8,0,3},{6,7,8,1,4},{6,7,8,2,5}};\nint main() {\n\twhile(1){\n\t\tll N;\n\t\tcin>>N;\n\t\tif(N==0)return 0;\n\t\tbool CD=false;\n\t\tvector<vector<vector<vector<vector<vector<bool>>>>>> DP(N+1,vector<vector<vector<vector<vector<bool>>>>>\n\t\t(7,vector<vector<vector<vector<bool>>>>(7,vector<vector<vector<bool>>>(7,vector<vector<bool>>(7,vector<bool>(9,false))))));\n\t\tDP[0][1][1][1][1][4]=true;\n\t\tvll A(16);\n\t\trep(i,16)cin>>A[i];\n\t\tif(A[5]==1||A[6]==1||A[9]==1||A[10]==1)CD=true;\n\n\t\trep(da,N-1){\n\t\t\tvll A(16);\n\t\t\trep(i,16)cin>>A[i];\n\t\t\trep(p,9){\n\t\t\t\trep(j,5){\n\t\t\t\t\tll t=T[p][j];\n\t\t\t\t\tbool C=true;\n\t\t\t\t\trep(i,4){\n\t\t\t\t\t\tif(A[Q[t][i]-1]==1)C=false;\n\t\t\t\t\t}\n\t\t\t\t\tif(C){//ここに動かせる.\n\t\t\t\t\t\tif(t==0){\n\t\t\t\t\t\t\trep(a,7)rep(b,6)rep(c,6)rep(d,6){\n\t\t\t\t\t\t\tif(DP[da][a][b][c][d][p]){\n\t\t\t\t\t\t\t\tDP[da+1][0][b+1][c+1][d+1][t]=true;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if(t==2){\n\t\t\t\t\t\t\trep(a,6)rep(b,7)rep(c,6)rep(d,6){\n\t\t\t\t\t\t\tif(DP[da][a][b][c][d][p]){\n\t\t\t\t\t\t\t\tDP[da+1][a+1][0][c+1][d+1][t]=true;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if(t==6){\n\t\t\t\t\t\t\trep(a,6)rep(b,6)rep(c,7)rep(d,6){\n\t\t\t\t\t\t\tif(DP[da][a][b][c][d][p]){\n\t\t\t\t\t\t\t\tDP[da+1][a+1][b+1][0][d+1][t]=true;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if(t==8){\n\t\t\t\t\t\t\trep(a,6)rep(b,6)rep(c,6)rep(d,7){\n\t\t\t\t\t\t\tif(DP[da][a][b][c][d][p]){\n\t\t\t\t\t\t\t\tDP[da+1][a+1][b+1][c+1][0][t]=true;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse{\n\t\t\t\t\t\t\trep(a,6)rep(b,6)rep(c,6)rep(d,6){\n\t\t\t\t\t\t\tif(DP[da][a][b][c][d][p]){\n\t\t\t\t\t\t\t\tDP[da+1][a+1][b+1][c+1][d+1][t]=true;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\n\n\n\n\n\t\t\t\t\t\t\n\n\n\n\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\n\n\n\t\tif(CD)cout<<0<<endl;\n\t\telse{\n\t\t\tbool C=false;\n\t\t\trep(a,7)rep(b,7)rep(c,7)rep(d,7)rep(p,9){\n\t\t\t\tif(DP[N-1][a][b][c][d][p])C=true;\n\t\t\t}\n\t\t\tcout<<C<<endl;\n\n\t\t}\n\t}\n\t\n}","accuracy":1,"time_ms":290,"memory_kb":69944,"score_of_the_acc":-0.8969,"final_rank":17},{"submission_id":"aoj_1243_6011099","code_snippet":"#include<iostream>\n#include<vector>\nusing namespace std;\nint N;\nbool dp[2][9][9][9][9][9][9];\nint ok[365];\nvoid clr(int id)\n{\n\tfor(int i=0;i<9;i++)for(int j=0;j<9;j++)for(int k=0;k<9;k++)for(int l=0;l<9;l++)for(int m=0;m<9;m++)for(int n=0;n<9;n++)dp[id][i][j][k][l][m][n]=false;\n}\nint G[9];\nbool check[9][9][9][9][9][9][9];\nint main()\n{\n\tfor(int x=0;x<3;x++)for(int y=0;y<3;y++)\n\t{\n\t\tfor(int tx=0;tx<3;tx++)for(int ty=0;ty<3;ty++)\n\t\t{\n\t\t\tif(x==tx||y==ty)G[x*3+y]|=1<<tx*3+ty;\n\t\t}\n\t}\n\tfor(int a=0;a<9;a++)for(int b=0;b<9;b++)for(int c=0;c<9;c++)for(int d=0;d<9;d++)for(int e=0;e<9;e++)for(int f=0;f<9;f++)for(int g=0;g<9;g++)\n\t{\n\t\tbool ok=true;\n\t\tfor(int k:{0,2,6,8})\n\t\t{\n\t\t\tif(a-k&&b-k&&c-k&&d-k&&e-k&&f-k&&g-k)ok=false;\n\t\t}\n\t\tcheck[a][b][c][d][e][f][g]=ok;\n\t}\n\twhile(cin>>N,N)\n\t{\n\t\tfor(int i=0;i<N;i++)\n\t\t{\n\t\t\tint c[4][4];\n\t\t\tfor(int j=0;j<4;j++)for(int k=0;k<4;k++)cin>>c[j][k];\n\t\t\tok[i]=0;\n\t\t\tfor(int x=0;x<3;x++)for(int y=0;y<3;y++)\n\t\t\t{\n\t\t\t\tif(!(c[x][y]||c[x][y+1]||c[x+1][y]||c[x+1][y+1]))ok[i]|=1<<x*3+y;\n\t\t\t}\n\t\t}\n\t\tif(!(ok[0]>>4&1))\n\t\t{\n\t\t\tcout<<0<<endl;\n\t\t\tcontinue;\n\t\t}\n\t\tint now=0;\n\t\tclr(now);\n\t\tdp[now][0][0][0][0][0][4]=true;\n\t\tfor(int i=1;i<N;i++)\n\t\t{\n\t\t\tint nxt=1-now;\n\t\t\tclr(nxt);\n\t\t\tfor(int a=0;a<9;a++)for(int b=0;b<9;b++)for(int c=0;c<9;c++)for(int d=0;d<9;d++)for(int e=0;e<9;e++)for(int f=0;f<9;f++)if(dp[now][a][b][c][d][e][f])\n\t\t\t{\n\t\t\t\tint to=G[f]&ok[i];\n\t\t\t\tfor(int g=0;g<9;g++)if(to>>g&1)\n\t\t\t\t{\n\t\t\t\t\tif(i>=6&&!check[a][b][c][d][e][f][g])continue;\n\t\t\t\t\tdp[nxt][b][c][d][e][f][g]=true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tnow=nxt;\n\t\t}\n\t\tbool ok=false;\n\t\tfor(int a=0;a<9;a++)for(int b=0;b<9;b++)for(int c=0;c<9;c++)for(int d=0;d<9;d++)for(int e=0;e<9;e++)for(int f=0;f<9;f++)if(dp[now][a][b][c][d][e][f])ok=true;\n\t\tcout<<(ok?1:0)<<endl;\n\t}\n}","accuracy":1,"time_ms":760,"memory_kb":9152,"score_of_the_acc":-1.044,"final_rank":18},{"submission_id":"aoj_1243_6011075","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\nint N;\nvector<int> cnt;\nvector<vector<int>> sched;\nset<pair<int, vector<int>>> st;\n\nint di[4] = {0, 1, 0, -1};\nint dj[4] = {1, 0, -1, 0};\n\nbool dfs(int day, int p) {\n if (day == N) return true;\n if (st.count({day, cnt})) {\n return false;\n }\n rep(i,0,16) if (cnt[i] >= 7) return false;\n rep(i,0,16) if (sched[day][i] && cnt[i] == 0) return false;\n auto tmp = cnt;\n int i = p/4, j=p%4;\n rep(k,1,3) {\n rep(d,0,4) {\n int ni = i + k*di[d], nj = j + k*dj[d];\n if (0 <= ni && ni < 3 && 0 <= nj && nj < 3) {\n rep(x,0,16) cnt[x]++;\n cnt[4*ni+nj] = cnt[4*ni+nj+1] = cnt[4*(ni+1)+nj] = cnt[4*(ni+1)+nj+1] = 0;\n if (dfs(day+1, 4*ni+nj)) return true;\n cnt = tmp;\n }\n }\n }\n rep(x,0,16) cnt[x]++;\n cnt[4*i+j] = cnt[4*i+j+1] = cnt[4*(i+1)+j] = cnt[4*(i+1)+j+1] = 0;\n if (dfs(day+1, 4*i+j)) return true;\n cnt = tmp;\n st.insert({day, cnt});\n return false;\n}\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(15);\n\n while (1) {\n cin >> N;\n if (N==0) break;\n st.clear();\n sched.resize(N, vector<int>(16));\n rep(i,0,N) rep(j,0,16) cin >> sched[i][j];\n cnt.assign(16,1);\n cnt[5] = cnt[6] = cnt[9] = cnt[10] = 0;\n cout << dfs(0, 5) << endl;\n }\n}","accuracy":1,"time_ms":150,"memory_kb":19552,"score_of_the_acc":-0.3032,"final_rank":15},{"submission_id":"aoj_1243_5972489","code_snippet":"#pragma region Macros\n#include <bits/stdc++.h>\nusing namespace std;\ntemplate <class T> inline bool chmax(T &a, T b) {\n if(a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <class T> inline bool chmin(T &a, T b) {\n if(a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\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\n\nstruct Setup {\n Setup() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n }\n} __Setup;\n\nusing ll = long long;\n#define OVERLOAD3(_1, _2, _3, name, ...) name\n#define ALL(v) (v).begin(), (v).end()\n#define RALL(v) (v).rbegin(), (v).rend()\n#define REP1(i, n) for(int i = 0; i < (n); i++)\n#define REP2(i, a, b) for(int i = (a); i < int(b); i++)\n#define REP(...) OVERLOAD3(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\nconst int INF = 1 << 30;\nconst ll LLINF = 1LL << 60;\nconstexpr int MOD = 1000000007;\nconstexpr int MOD2 = 998244353;\nconst int dx[4] = {1, 0, -1, 0};\nconst int dy[4] = {0, 1, 0, -1};\n\nvoid Case(int i) { cout << \"Case #\" << i << \": \"; }\nint popcount(int x) { return __builtin_popcount(x); }\nll popcount(ll x) { return __builtin_popcountll(x); }\n#pragma endregion Macros\n\nusing arr = array<int, 16>;\n\nbool solve() {\n int N;\n cin >> N;\n if(N == 0) return false;\n vector<arr> schedules(N);\n REP(i, N) REP(j, 16) cin >> schedules[i][j];\n\n vector<map<arr, int>> memo(16);\n arr now;\n bool ans = false;\n REP(i, 16) now[i] = 1;\n now[5] = now[6] = now[9] = now[10] = 0;\n auto dfs = [&](auto&& self, int cx, int cy, int d) -> void {\n if(ans) return;\n if(d >= N) {\n // debug(cx, cy, d);\n // REP(i, 16) cerr << now[i] << ' ';\n // cerr << endl;\n ans = true;\n return;\n }\n REP(x, 4) REP(y, 4) {\n if(now[x*4 + y] >= 7) return;\n if(now[x*4 + y] == 0 and schedules[d][x*4 + y]) return;\n }\n if(memo[cx*4 + cy].count(now) and memo[cx*4 + cy][now] >= d) return;\n // debug(cx, cy, d);\n // REP(i, 16) cerr << now[i] << ' ';\n // cerr << endl;\n memo[cx*4 + cy][now] = d;\n REP(dir, 4) REP(w, 3) {\n int nx = cx + dx[dir] * w;\n int ny = cy + dy[dir] * w;\n if(nx < 0 or nx >= 3 or ny < 0 or ny >= 3) continue;\n auto tmp = now;\n REP(x, 4) REP(y, 4) {\n if(nx <= x and x <= nx+1 and ny <= y and y <= ny+1) now[x*4 + y] = 0;\n else now[x*4 + y] += 1;\n }\n self(self, nx, ny, d+1);\n now = tmp;\n }\n };\n dfs(dfs, 1, 1, 0);\n cout << ans << '\\n';\n return true;\n}\n\nint main() {\n while(solve());\n}","accuracy":1,"time_ms":20,"memory_kb":3928,"score_of_the_acc":-0.0021,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_1243_10865810\",\n \"code_snippet\": \"#include<cstdio>\\n#include<iostream>\\n#include<cstring>\\n#include<cmath>\\n#include<cstdlib>\\n#include<vector>\\n#include<stack>\\n#include<algorithm>\\n#include<queue>\\n#include<string>\\n#define OK 1\\n#define INF 2147483647\\n#define LINF 9223372036854775807LL\\n#define DINF 100000000\\n#define LL long long\\nusing namespace std;\\ntypedef struct\\n{\\n\\tint cnt[4][4];\\n}HNode;\\nvector<HNode>H[366][4][4];\\nint n,map[365][4][4];\\nint biao[4][4][4][2];\\nconst int di[] = { 0, 0, 0, -1, -2, 0, 0, 1, 2 };\\nconst int dj[] = { 0, -1, -2, 0, 0, 1, 2, 0, 0 };\\nbool dfs(int cur, int ci, int cj, int cnt[4][4]);\\nbool judge(int cur, int ci, int cj, int cnt[4][4]);\\n\\nint main()\\n{\\n\\tint i,j,k,cnt[4][4];\\n\\twhile (scanf(\\\"%d\\\", &n) > 0)\\n\\t{\\n\\t\\tif (n == 0) break;\\n\\t\\tfor (k = 0; k < n; k++)\\n\\t\\t{\\n\\t\\t\\tfor (i = 0; i < 4; i++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tfor (j = 0; j < 4; j++) H[k][i][j].clear();\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor (k = 0; k < n; k++)\\n\\t\\t{\\n\\t\\t\\tfor (i = 0; i < 4; i++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tfor (j = 0; j < 4; j++) scanf(\\\"%d\\\", &map[k][i][j]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor (i = 0; i < 4; i++)\\n\\t\\t{\\n\\t\\t\\tfor (j = 0; j < 4; j++) cnt[i][j] = 1;\\n\\t\\t}\\n\\t\\tcnt[1][1] = cnt[1][2] = cnt[2][1] = cnt[2][2] = 0;\\n\\t\\tjudge(0, 1, 1, cnt);\\n\\t\\tif (dfs(0, 1, 1, cnt) == true) printf(\\\"1\\\\n\\\");\\n\\t\\telse printf(\\\"0\\\\n\\\");\\n\\t}\\n\\treturn 0;\\n}\\n\\nbool judge(int cur, int ci, int cj, int cnt[4][4])\\n{\\n\\tint k,j,i, len;\\n\\tbool flag = false;\\n\\tHNode e;\\n\\tfor (k = 0, len = H[cur][ci][cj].size(); k < len; k++)\\n\\t{\\n\\t\\te = H[cur][ci][cj][k];\\n\\t\\tflag = true;\\n\\t\\tfor (i = 0; i < 4; i++)\\n\\t\\t{\\n\\t\\t\\tfor (j = 0; j < 4; j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif (e.cnt[i][j] != cnt[i][j]) flag = false;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (flag == true) break;\\n\\t}\\n\\tif (flag == false)\\n\\t{\\n\\t\\tfor (i = 0; i < 4; i++)\\n\\t\\t{\\n\\t\\t\\tfor (j = 0; j < 4; j++) e.cnt[i][j] = cnt[i][j];\\n\\t\\t}\\n\\t\\tH[cur][ci][cj].push_back(e);\\n\\t\\treturn false;\\n\\t}\\n\\telse return true;\\n}\\n\\nbool dfs(int cur,int ci,int cj,int cnt[4][4])\\n{\\n\\tint k,next_ci,next_cj,i,j,nextCnt[4][4];\\n\\tif (map[cur][ci][cj] == 1 || map[cur][ci][cj + 1] == 1 || map[cur][ci + 1][cj] == 1 || map[cur][ci + 1][cj + 1] == 1) return false;\\n\\tif (cur == n - 1) return true;\\n\\tfor (k = 0; k < 9; k++)\\n\\t{\\n\\t\\tnext_ci = ci + di[k];\\n\\t\\tnext_cj = cj + dj[k];\\n\\t\\tif (next_ci < 0 || next_ci + 1 >= 4 || next_cj < 0 || next_cj + 1 >= 4) continue;\\n\\t\\tmemcpy(nextCnt, cnt, sizeof(nextCnt));\\n\\t\\tfor (i = 0; i < 4; i++)\\n\\t\\t{\\n\\t\\t\\tfor (j = 0; j < 4; j++) nextCnt[i][j]++;\\n\\t\\t}\\n\\t\\tnextCnt[next_ci][next_cj] = nextCnt[next_ci][next_cj + 1] = 0;\\n\\t\\tnextCnt[next_ci + 1][next_cj] = nextCnt[next_ci + 1][next_cj + 1] = 0;\\n\\t\\tbool flag = true;\\n\\t\\tfor (i = 0; i < 4; i++) //判断下雨天数\\n\\t\\t{\\n\\t\\t\\tfor (j = 0; j < 4; j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif (nextCnt[i][j] == 7) flag = false;\\n\\t\\t\\t}\\n\\t\\t} \\n\\t\\tif (flag == false) continue;\\n\\t\\tif (judge(cur + 1, next_ci, next_cj, nextCnt) == true) continue;\\n\\t\\tif (dfs(cur + 1, next_ci, next_cj, nextCnt) == true) return true;\\n \\t}\\n\\treturn false;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 17136,\n \"score_of_the_acc\": -0.2433,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1243_9669450\",\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/**\\n * @brief template\\n */\\n\\nint N;\\nvector<int> A(N);\\nvector<vector<int>> G(9);\\nmap<int,bool> mp;\\n\\nint encode(int K, int X, int Y, int D0, int D2, int D6, int D8) {\\n return K*1000000+X*100000+Y*10000+D0*1000+D2*100+D6*10+D8;\\n}\\n\\nbool DFS(int K, int X, int Y, int D0, int D2, int D6, int D8) {\\n if (K == N) return true;\\n if (D0 >= 7 || D2 >= 7 || D6 >= 7 || D8 >= 7) return false;\\n if ((A[K] & (1<<(X*3+Y))) == 0) return false;\\n int E = encode(K,X,Y,D0,D2,D6,D8);\\n if (mp.count(E)) return mp[E];\\n for (int Next : G[X*3+Y]) {\\n int NX = Next / 3, NY = Next % 3;\\n int N0 = D0+1, N2 = D2+1, N6 = D6+1, N8 = D8+1;\\n if (Next == 0) N0 = 0;\\n if (Next == 2) N2 = 0;\\n if (Next == 6) N6 = 0;\\n if (Next == 8) N8 = 0;\\n if (DFS(K+1,NX,NY,N0,N2,N6,N8)) return mp[E] = true;\\n }\\n return mp[E] = false;\\n}\\n\\nint main() {\\n rep(i,0,3) {\\n rep(j,0,3) {\\n G[i*3+j].push_back(i*3+j);\\n rep(k,0,3) {\\n if (i != k) G[i*3+j].push_back(k*3+j);\\n if (j != k) G[i*3+j].push_back(i*3+k);\\n }\\n }\\n }\\nwhile(1) {\\n mp.clear();\\n cin >> N;\\n if (N == 0) return 0;\\n A.resize(N);\\n rep(i,0,N) {\\n vector<vector<int>> X(4,vector<int>(4));\\n rep(j,0,4) rep(k,0,4) cin >> X[j][k];\\n int B = 0;\\n rep(j,0,3) {\\n rep(k,0,3) {\\n if (X[j][k] == 0 && X[j+1][k] == 0 && X[j][k+1] == 0 && X[j+1][k+1] == 0) B |= (1<<(j*3+k));\\n }\\n }\\n A[i] = B;\\n }\\n cout << (DFS(0,1,1,1,1,1,1) ? 1 : 0) << endl;\\n}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 5160,\n \"score_of_the_acc\": -0.012,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1243_9029711\",\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\\nint solve(int n) {\\n using D = array<array<int, 4>, 4>;\\n vector dp(3, vector(3, set<D>()));\\n\\n {\\n bitset<16> a; {\\n vector<int> a_ = in(16);\\n for(int i : rep(16)) if(a_[i]) a[i] = 1;\\n }\\n bitset<16> b;\\n b[5] = b[6] = b[9] = b[10] = 1;\\n if((a & b) == 0) {\\n D s = {\\n 1, 1, 1, 1,\\n 1, 0, 0, 1,\\n 1, 0, 0, 1,\\n 1, 1, 1, 1\\n };\\n dp[1][1].insert(s);\\n }\\n }\\n\\n for(int _ : rep(n - 1)) {\\n bitset<16> a; {\\n vector<int> a_ = in(16);\\n for(int i : rep(16)) if(a_[i]) a[i] = 1;\\n }\\n vector nt(3, vector(3, set<D>()));\\n for(int ci : rep(3)) for(int cj : rep(3)) {\\n for(auto [di, dj] : vector<pair<int,int>>{{-2, 0}, {0, -2}, {-1, 0}, {0, -1}, {0, 0}, {+1, 0}, {0, +1}, {+2, 0}, {0, +2}}) {\\n int ni = ci + di, nj = cj + dj;\\n if(not(0 <= ni and ni + 1 < 4 and 0 <= nj and nj + 1 < 4)) continue;\\n bitset<16> b;\\n for(int i : rep(2)) for(int j : rep(2)) b[(ni + i) * 4 + (nj + j)] = 1;\\n if(not((a & b) == 0)) continue;\\n for(auto s : dp[ci][cj]) {\\n for(int i : rep(4)) for(int j : rep(4)) s[i][j] += 1;\\n for(int i : rep(2)) for(int j : rep(2)) s[ni + i][nj + j] = 0;\\n bool ok = [&] {\\n for(int i : rep(4)) for(int j : rep(4)) \\n if(s[i][j] >= 7) return false;\\n return true;\\n }();\\n if(ok) nt[ni][nj].insert(s);\\n }\\n }\\n }\\n dp = move(nt);\\n }\\n for(int ci : rep(3)) for(int cj : rep(3)) if(not dp[ci][cj].empty()) return true;\\n return false;\\n}\\n\\nint main() {\\n while(true) {\\n int n = in();\\n if(n == 0) return 0;\\n print(solve(n));\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 3668,\n \"score_of_the_acc\": -0.1081,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1243_6718256\",\n \"code_snippet\": \"/**\\n * author: otera\\n**/\\n#include<bits/stdc++.h>\\nusing namespace std;\\n\\n// #define int long long\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\nusing int128_t = __int128_t;\\n#define repa(i, n) for(int i = 0; i < n; ++ i)\\n#define repb(i, a, b) for(int i = a; i < b; ++ i)\\n#define repc(i, a, b, c) for(int i = a; i < b; i += c)\\n#define overload4(a, b, c, d, e, ...) e\\n#define overload3(a, b, c, d, ...) d\\n#define rep(...) overload4(__VA_ARGS__, repc, repb, repa)(__VA_ARGS__)\\n#define rep1a(i, n) for(int i = 0; i <= n; ++ i)\\n#define rep1b(i, a, b) for(int i = a; i <= b; ++ i)\\n#define rep1c(i, a, b, c) for(int i = a; i <= b; i += c)\\n#define rep1(...) overload4(__VA_ARGS__, rep1c, rep1b, rep1a)(__VA_ARGS__)\\n#define rev_repa(i, n) for(int i=n-1;i>=0;i--)\\n#define rev_repb(i, a, b) assert(a > b);for(int i=a;i>b;i--)\\n#define rev_rep(...) overload3(__VA_ARGS__, rev_repb, rev_repa)(__VA_ARGS__)\\n#define rev_rep1a(i, n) for(int i=n;i>=1;i--)\\n#define rev_rep1b(i, a, b) assert(a >= b);for(int i=a;i>=b;i--)\\n#define rev_rep1(...) overload3(__VA_ARGS__, rev_rep1b, rev_rep1a)(__VA_ARGS__)\\ntypedef pair<int, int> P;\\ntypedef pair<ll, ll> LP;\\n#define pb push_back\\n#define pf push_front\\n#define ppb pop_back\\n#define ppf pop_front\\n#define eb emplace_back\\n#define fr first\\n#define sc second\\n#define all(c) c.begin(),c.end()\\n#define rall(c) c.rbegin(), c.rend()\\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 Sort(a) sort(all(a))\\n#define Rev(a) reverse(all(a))\\n#define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))\\n#define si(c) (int)(c).size()\\ninline ll popcnt(ull a){ return __builtin_popcountll(a); }\\n#define kth_bit(x, k) ((x>>k)&1)\\n#define unless(A) if(!(A))\\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\\nll intpow(ll a, ll b, ll m) {ll ans = 1; while(b){ if(b & 1) (ans *= a) %= m; (a *= a) %= m; b /= 2; } return ans; }\\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#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)\\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\\n#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)\\n#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)\\n#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)\\n#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)\\n#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)\\n#define vec(type,name,...) vector<type>name(__VA_ARGS__)\\n#define VEC(type,name,size) vector<type>name(size);in(name)\\n#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))\\n#define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name)\\n#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\\ntemplate <class T> using vc = vector<T>;\\ntemplate <class T> using vvc = vector<vc<T>>;\\ntemplate <class T> using vvvc = vector<vvc<T>>;\\ntemplate <class T> using vvvvc = vector<vvvc<T>>;\\ntemplate <class T> using pq = priority_queue<T>;\\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\\ntemplate <class T, class U> using umap = unordered_map<T, U>;\\ntemplate<class T> void scan(T& a){ cin >> a; }\\ntemplate<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); }\\nvoid in(){}\\ntemplate <class Head, class... Tail> void in(Head& head, Tail&... tail){ scan(head); in(tail...); }\\nvoid print(){ cout << ' '; }\\ntemplate<class T> void print(const T& a){ cout << a; }\\ntemplate<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout << ' '; print(*i); } }\\nint out(){ cout << '\\\\n'; return 0; }\\ntemplate<class T> int out(const T& t){ print(t); cout << '\\\\n'; return 0; }\\ntemplate<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); cout << ' '; out(tail...); return 0; }\\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#define dump(...) { print(#__VA_ARGS__); print(\\\":\\\"); out(__VA_ARGS__); }\\n#else\\n#define debug(...)\\n#define dump(...)\\n#endif\\n\\nstruct io_setup {\\n io_setup(int precision = 20) {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n cout << fixed << setprecision(precision);\\n }\\n} io_setup_ {};\\n\\nconst int dx[4] = {0, 1, 0, -1};\\nconst int dy[4] = {1, 0, -1, 0};\\n\\nconst int M = 4;\\nconst int D = 7;\\n\\nvoid solve() {\\n int n;\\n while(cin >> n) {\\n if(n == 0) break;\\n VV(int, a, n, M * M);\\n vector cnt(M, array<int, M>{0, 0, 0, 0});\\n bool ans = 0;\\n map<tuple<int, P, vector<array<int, M>>>, bool> memo;\\n auto dfs = [&](auto &&dfs, int day, int x, int y) -> void {\\n if(ans) return;\\n if(day == n) {\\n ans = 1;\\n return;\\n }\\n if(memo.count(make_tuple(day, P{x, y}, cnt))) return;\\n memo[make_tuple(day, P{x, y}, cnt)] = 1;\\n bool ok = 1;\\n auto ncnt = cnt;\\n rep(i, M) {\\n rep(j, M) {\\n if(0 <= (i - x) && (i - x) <= 1 && 0 <= (j - y) && (j - y) <= 1) {\\n // rain\\n if(a[day][i * M + j]) {\\n ok = 0;\\n break;\\n }\\n ncnt[i][j] = 0;\\n } else {\\n // not rain\\n ++ ncnt[i][j];\\n if(ncnt[i][j] >= 7) {\\n ok = 0;\\n break;\\n }\\n }\\n }\\n }\\n if(!ok) {\\n return;\\n }\\n swap(cnt, ncnt);\\n rep(k, 4) {\\n for(int _ = 1; _ <= 2; ++ _) {\\n int nx = x + _ * dx[k], ny = y + _ * dy[k];\\n if(0 <= nx && nx < 3 && 0 <= ny && ny < 3) {\\n dfs(dfs, day + 1, nx, ny);\\n }\\n }\\n }\\n dfs(dfs, day + 1, x, y);\\n swap(cnt, ncnt);\\n };\\n dfs(dfs, 0, 1, 1);\\n out(ans);\\n }\\n}\\n\\nsigned main() {\\n int testcase = 1;\\n // in(testcase);\\n while(testcase--) solve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 720,\n \"memory_kb\": 92020,\n \"score_of_the_acc\": -1.6553,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1243_6654938\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <vector>\\n#include <set>\\nusing namespace std;\\n\\nint a[384][16], vis[16];\\nset<vector<int>> st[384];\\nvector<int> mv[16] = { {0, 1, 2, 4, 8}, {0, 1, 2, 5, 9}, {0, 1, 2, 6, 10}, {},\\n {0, 4, 5, 6, 8}, {1, 4, 5, 6, 9}, {2, 4, 5, 6, 10}, {},\\n {0, 4, 8, 9, 10}, {1, 5, 8, 9, 10}, {2, 6, 8, 9, 10}, {}, {}, {}, {}, {} };\\n\\nint main(void) {\\n int n, ok;\\n vector<int> v;\\n while (1) {\\n scanf(\\\"%d\\\", &n);\\n if (n == 0) break;\\n for (int i = 1; i <= n; i++) {\\n for (int j = 0; j < 16; j++) {\\n scanf(\\\"%d\\\", &a[i][j]);\\n }\\n }\\n if (a[1][5] || a[1][6] || a[1][9] || a[1][10]) {\\n printf(\\\"0\\\\n\\\");\\n continue;\\n }\\n \\n st[1].insert({ 5, -1, -1, -1, -1, -1, -1 });\\n for (int i = 1; i < n; i++) {\\n for (auto& j : st[i]) {\\n v = j;\\n for (int k = 6; k > 0; k--) v[k] = v[k - 1];\\n for (int k : mv[v[1]]) {\\n v[0] = k;\\n if (i < 6) ok = 1;\\n else {\\n ok = 1;\\n for (int l = 0; l < 7; l++) {\\n vis[v[l]] = 1;\\n vis[v[l] + 1] = 1;\\n vis[v[l] + 4] = 1;\\n vis[v[l] + 5] = 1;\\n }\\n for (int l = 0; l < 16; l++) {\\n if (!vis[l]) ok = 0;\\n vis[l] = 0;\\n }\\n }\\n if (a[i + 1][v[0]] || a[i + 1][v[0] + 1] || a[i + 1][v[0] + 4] || a[i + 1][v[0] + 5]) {\\n ok = 0;\\n }\\n if (ok) st[i + 1].insert(v);\\n }\\n }\\n }\\n\\n if (st[n].size()) printf(\\\"1\\\\n\\\");\\n else printf(\\\"0\\\\n\\\");\\n\\n for (int i = 0; i <= n; i++) st[i].clear();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 280,\n \"memory_kb\": 37844,\n \"score_of_the_acc\": -0.6257,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1243_6255081\",\n \"code_snippet\": \"#include <iostream>\\n#include <queue>\\n#include <vector>\\n#include <cstring>\\n\\nusing namespace std;\\n\\nint counter[365][9][7][7][7][7];\\n\\nint rain[9][16] {\\n {1,1,0,0,1,1,0,0,0,0,0,0,0,0,0,0},\\n {0,1,1,0,0,1,1,0,0,0,0,0,0,0,0,0},\\n {0,0,1,1,0,0,1,1,0,0,0,0,0,0,0,0},\\n {0,0,0,0,1,1,0,0,1,1,0,0,0,0,0,0},\\n {0,0,0,0,0,1,1,0,0,1,1,0,0,0,0,0},\\n {0,0,0,0,0,0,1,1,0,0,1,1,0,0,0,0},\\n {0,0,0,0,0,0,0,0,1,1,0,0,1,1,0,0},\\n {0,0,0,0,0,0,0,0,0,1,1,0,0,1,1,0},\\n {0,0,0,0,0,0,0,0,0,0,1,1,0,0,1,1},\\n};\\n\\nint adj[9][9] {\\n {1,1,1,1,0,0,1,0,0},\\n {1,1,1,0,1,0,0,1,0},\\n {1,1,1,0,0,1,0,0,1},\\n {1,0,0,1,1,1,1,0,0},\\n {0,1,0,1,1,1,0,1,0},\\n {0,0,1,1,1,1,0,0,1},\\n {1,0,0,1,0,0,1,1,1},\\n {0,1,0,0,1,0,1,1,1},\\n {0,0,1,0,0,1,1,1,1},\\n};\\n\\nstruct X\\n{\\n X(int d, int p, int ul, int ll, int ur, int lr) : day{d}, pos{p}, upleft{ul}, loleft{ll}, upright{ur}, loright{lr} {}\\n int day;\\n int pos;\\n int upleft;\\n int loleft;\\n int upright;\\n int loright;\\n};\\n\\nbool check_pos(int p, vector<vector<int> > &event, int day) {\\n for (int i=0; i<16; ++i)\\n if (rain[p][i] == 1 && event[day][i] == 1) return false;\\n return true;\\n}\\n\\nbool check_day(int a, int b, int c, int d) {\\n return !(a == 7 || b == 7 || c == 7 || d == 7);\\n}\\n\\nint solve(int day, vector<vector<int> > &event) {\\n int check = 0; // クリアできるか\\n queue<X> Q;\\n X init(0,4,1,1,1,1);\\n if (!check_pos(4, event, 0)) return 0;\\n Q.push(init);\\n while (!Q.empty()) {\\n X pick = Q.front();\\n Q.pop();\\n for(int i=0; i<9; ++i) {\\n if (adj[pick.pos][i] == 1) {\\n X c(pick.day+1,i,pick.upleft+1,pick.loleft+1,pick.upright+1,pick.loright+1);\\n if (i == 0) c.upleft = 0; else if (i == 2) c.upright = 0; else if (i == 6) c.loleft = 0; else if (i == 8) c.loright = 0;\\n if (check_pos(i, event, c.day) && check_day(c.upleft, c.loleft, c.upright, c.loright)) {\\n if (c.day == day-1) {\\n check = 1;\\n goto label;\\n } else {\\n if (counter[c.day][c.pos][c.upleft][c.loleft][c.upright][c.loright] == 0) {\\n Q.push(c);\\n counter[c.day][c.pos][c.upleft][c.loleft][c.upright][c.loright] += 1;\\n }\\n }\\n }\\n }\\n }\\n }\\n label: ;\\n return check;\\n}\\n\\nint main() {\\n int total;\\n while (cin >> total && total > 0) {\\n vector<vector<int> > event(total, vector<int>(16));\\n for (int i=0; i<total; ++i) {\\n for (int j=0; j<16; ++j) {\\n cin >> event[i][j];\\n }\\n }\\n memset(counter, 0, sizeof(counter));\\n int ans = solve(total, event);\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 33992,\n \"score_of_the_acc\": -0.2705,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1243_6238937\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long;\\n#define rep(i, n) for (int i = 0; i < (n); i++)\\n#define ALL(x) x.begin(), x.end()\\n\\nbool dp[370][3][3][7][7][7][7][16];\\nbool a[370][4][4];\\nbool ok[3][3];\\n\\nconst int dx[9] = {2, 1, -1, -2, 0, 0, 0, 0, 0};\\nconst int dy[9] = {0, 0, 0, 0, 0, 2, 1, -1, -2};\\n\\nvoid solve(int N) {\\n rep(i, N) rep(x, 3) rep(y, 3) rep(a1, 7) rep(a2, 7) rep(a3, 7) rep(a4, 7) rep(k, 16) dp[i][x][y][a1][a2][a3][a4][k] = false;\\n rep(i, N) rep(x, 4) rep(y, 4) cin >> a[i][x][y];\\n if (a[0][1][1] == true || a[0][1][2] == true || a[0][2][1] == true || a[0][2][2] == true) {\\n cout << 0 << '\\\\n';\\n return;\\n }\\n dp[0][1][1][1][1][1][1][0] = true;\\n for (int i = 1; i < N; i++) {\\n rep(cx, 3) rep(cy, 3) {\\n if (a[i][cx][cy] == true || a[i][cx][cy + 1] == true || a[i][cx + 1][cy] == true || a[i][cx + 1][cy + 1] == true)\\n ok[cx][cy] = false;\\n else\\n ok[cx][cy] = true;\\n }\\n rep(cx, 3) rep(cy, 3) rep(a1, 7) rep(a2, 7) rep(a3, 7) rep(a4, 7) rep(b, 16) {\\n if (dp[i - 1][cx][cy][a1][a2][a3][a4][b] == false) continue;\\n // 遷移\\n rep(k, 9) {\\n int nx = cx + dx[k], ny = cy + dy[k];\\n if (!(0 <= nx && nx < 3 && 0 <= ny && ny < 3)) continue;\\n if (ok[nx][ny] == false) continue;\\n int na1 = a1 + 1, na2 = a2 + 1, na3 = a3 + 1, na4 = a4 + 1, nb = b;\\n if (nx == 0 && ny == 0) na1 = 0, nb |= 1;\\n if (nx == 0 && ny == 2) na2 = 0, nb |= 2;\\n if (nx == 2 && ny == 0) na3 = 0, nb |= 4;\\n if (nx == 2 && ny == 2) na4 = 0, nb |= 8;\\n if (na1 > 6) continue;\\n if (na2 > 6) continue;\\n if (na3 > 6) continue;\\n if (na4 > 6) continue;\\n dp[i][nx][ny][na1][na2][na3][na4][nb] = true;\\n }\\n }\\n }\\n rep(cx, 3) rep(cy, 3) rep(a1, 7) rep(a2, 7) rep(a3, 7) rep(a4, 7) {\\n if (dp[N - 1][cx][cy][a1][a2][a3][a4][15] == true) {\\n cout << 1 << '\\\\n';\\n return;\\n }\\n }\\n cout << 0 << '\\\\n';\\n return;\\n}\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n int N;\\n while (cin >> N, N) solve(N);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 490,\n \"memory_kb\": 128228,\n \"score_of_the_acc\": -1.6351,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1243_6128201\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <queue>\\n#include <tuple>\\n#include <cstring>\\nusing namespace std;\\n\\nconst int MAX_N = 370;\\nconst int AREA_NUM = 16;\\nconst int dx[] = {0, 1, 0, -1, 0, 2, 0, -2, 0};\\nconst int dy[] = {0, 0, -1, 0, 1, 0, -2, 0, 2};\\nconst int ax[] = {0, 1, 0, 1};\\nconst int ay[] = {0, 0, 1, 1};\\nint cache[MAX_N][3][3][7][7][7][7];\\n\\nint need_sun[MAX_N][AREA_NUM];\\n\\nstruct State\\n{\\n int x;\\n int y;\\n int t;\\n int A;\\n int B;\\n int C;\\n int D;\\n};\\n\\nbool check_border(int x, int y)\\n{\\n return ((0 <= x) && (x < 4) && (0 <= y) && (y < 4));\\n}\\n\\nbool check_pos_and_specialday(int left_x, int top_y, int t)\\n{\\n int right_x = left_x + 1;\\n int bottom_y = top_y + 1;\\n if (check_border(left_x, top_y) &&\\n check_border(right_x, bottom_y))\\n return (need_sun[t][left_x + top_y * 4] == 0) &&\\n (need_sun[t][left_x + bottom_y * 4] == 0) &&\\n (need_sun[t][right_x + top_y * 4] == 0) &&\\n (need_sun[t][right_x + bottom_y * 4] == 0);\\n else\\n return false;\\n}\\n\\nbool check_dry(State state)\\n{\\n return state.A < 7 && state.B < 7 && state.C < 7 && state.D < 7;\\n}\\n\\nState update_state(State state, int nx, int ny)\\n{\\n State new_state = {nx, ny, state.t + 1,\\n state.A + 1, state.B + 1,\\n state.C + 1, state.D + 1};\\n int idx = 0;\\n for (int i = 0; i < 4; i++)\\n {\\n idx = nx + ax[i] + (ny + ay[i]) * 4;\\n if (idx == 0)\\n new_state.A = 0;\\n else if (idx == 3)\\n new_state.B = 0;\\n else if (idx == 12)\\n new_state.C = 0;\\n else if (idx == 15)\\n new_state.D = 0;\\n }\\n return new_state;\\n}\\n\\nint solve(int N, int sx, int sy)\\n{\\n int nx, ny, t;\\n\\n //左上のx座標・左上のy座標・何日目か・マス1の雨が降っていない期間\\n queue<State> que;\\n State init_state = {sx, sy, 0, 1, 1, 1, 1};\\n\\n bool last_day = false;\\n que.push(init_state);\\n while (!que.empty())\\n {\\n State state = que.front();\\n que.pop();\\n\\n if (cache[state.t][state.x][state.y][state.A][state.B][state.C][state.D]++)\\n continue;\\n for (int i = 0; i < 9; i++)\\n {\\n nx = state.x + dx[i];\\n ny = state.y + dy[i];\\n t = state.t;\\n if (t == N - 1)\\n {\\n last_day = true;\\n break;\\n }\\n State new_state = update_state(state, nx, ny);\\n if (check_dry(new_state) && check_pos_and_specialday(nx, ny, t + 1))\\n que.push(new_state);\\n }\\n }\\n\\n if (last_day)\\n return 1;\\n else\\n return 0;\\n}\\n\\nint main()\\n{\\n int N;\\n while (cin >> N)\\n {\\n if (N == 0)\\n break;\\n\\n for (int i = 0; i < N; i++)\\n for (int j = 0; j < AREA_NUM; j++)\\n cin >> need_sun[i][j];\\n\\n memset(cache, 0, sizeof(cache));\\n int ans = solve(N, 1, 1);\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 34656,\n \"score_of_the_acc\": -0.2893,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1243_6127328\",\n \"code_snippet\": \"#include <algorithm>\\n#include <iostream>\\n#include <tuple>\\n#include <set>\\n#include <vector>\\n#include <queue>\\nusing namespace std;\\n\\nint n;\\nint cover[3][3];\\nint schedule[365];\\nint dx[3][3][5];\\nint dy[3][3][5];\\n// {四隅の連続して雨の降っていない日数、雲のx座標、雲のy座標、日付}\\nusing State = tuple<int, int, int, int, int, int, int>;\\nset<State> used;\\n\\nint solve() {\\n used.clear();\\n for(int i = 0; i < n; i++) {\\n schedule[i] = 0;\\n for(int j = 0; j < 16; j++) {\\n int x; cin >> x;\\n schedule[i] += x << j;\\n }\\n }\\n // bit演算で重なりを判定\\n if(cover[1][1] & schedule[0]) return 0;\\n queue<State> q;\\n q.push({1, 1, 1, 1, 1, 1, 0});\\n while(!q.empty()) {\\n auto now = q.front();\\n q.pop();\\n int c0 = get<0>(now), c1 = get<1>(now), c2 = get<2>(now), c3 = get<3>(now),\\n x = get<4>(now), y = get<5>(now), d = get<6>(now);\\n if(d == n-1) return 1;\\n c0++; c1++; c2++; c3++;\\n for(int i = 0; i < 5; i++) {\\n int nx = x + dx[x][y][i], ny = y + dy[x][y][i];\\n // markets and festivals と重なっていないか\\n if((cover[nx][ny]&schedule[d+1]) == 0) {\\n State nxt = make_tuple(c0, c1, c2, c3, nx, ny, d+1);\\n // 雨を降らしたときの日数のリセット\\n if(nx == 0 && ny == 0) {\\n get<0>(nxt) = 0;\\n } else if(nx == 0 && ny == 2) {\\n get<1>(nxt) = 0;\\n } else if(nx == 2 && ny == 0) {\\n get<2>(nxt) = 0;\\n } else if(nx == 2 && ny == 2) {\\n get<3>(nxt) = 0;\\n }\\n // 雨を連続で降らせていない場所がないか\\n if(!used.count(nxt) &&\\n get<0>(nxt) != 7 && get<1>(nxt) != 7 &&\\n get<2>(nxt) != 7 && get<3>(nxt) != 7) {\\n q.push(nxt);\\n used.insert(nxt);\\n }\\n }\\n }\\n }\\n return 0;\\n}\\n\\nint main() {\\n // 雲の遷移、雲がカバーしている位置の前計算\\n // bit演算によって位置を管理することで高速化している\\n // 以下のように番号を振り、雲がいるときは cover について番号のbitを立てる\\n // 0 1 2 3\\n // 4 5 6 7\\n // 8 9 10 11\\n // 12 13 14 15\\n for(int i = 0; i < 3; i++) {\\n for(int j = 0; j < 3; j++) {\\n for(int ii = 0; ii < 2; ii++) {\\n for(int jj = 0; jj < 2; jj++) {\\n cover[i][j] += 1 << ((i + ii) * 4 + (j + jj));\\n }\\n }\\n for(int k = 1; k < 3; k++) {\\n dx[i][j][k ] = (i + k) % 3 - i;\\n dy[i][j][k+2] = (j + k) % 3 - j;\\n }\\n }\\n }\\n vector<int> ans;\\n while(1) {\\n cin >> n;\\n if(n == 0) break;\\n ans.push_back(solve());\\n }\\n for(auto &i : ans) cout << i << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 7796,\n \"score_of_the_acc\": -0.1007,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1243_6107405\",\n \"code_snippet\": \"#include <algorithm>\\n#include <iostream>\\n#include <tuple>\\n#include <set>\\n#include <vector>\\n#include <queue>\\nusing namespace std;\\n\\nint n;\\nint cover[3][3];\\nint schedule[365];\\nint dx[3][3][5];\\nint dy[3][3][5];\\nusing State = tuple<int, int, int, int, int, int, int>;\\nset<State> used;\\n\\nint solve() {\\n used.clear();\\n for(int i = 0; i < n; i++) {\\n schedule[i] = 0;\\n for(int j = 0; j < 16; j++) {\\n int x; cin >> x;\\n schedule[i] += x << j;\\n }\\n }\\n if(cover[1][1] & schedule[0]) return 0;\\n queue<State> q;\\n q.push({1, 1, 1, 1, 1, 1, 0});\\n while(!q.empty()) {\\n auto now = q.front();\\n q.pop();\\n int c0 = get<0>(now), c1 = get<1>(now), c2 = get<2>(now), c3 = get<3>(now),\\n x = get<4>(now), y = get<5>(now), d = get<6>(now);\\n if(d == n-1) return 1;\\n c0++; c1++; c2++; c3++;\\n for(int i = 0; i < 5; i++) {\\n int nx = x + dx[x][y][i], ny = y + dy[x][y][i];\\n if((cover[nx][ny]&schedule[d+1]) == 0) {\\n // cerr << x << \\\" \\\" << y << \\\" \\\" << nx << \\\" \\\" << ny << endl;\\n State nxt = make_tuple(c0, c1, c2, c3, nx, ny, d+1);\\n if(nx == 0 && ny == 0) {\\n get<0>(nxt) = 0;\\n } else if(nx == 0 && ny == 2) {\\n get<1>(nxt) = 0;\\n } else if(nx == 2 && ny == 0) {\\n get<2>(nxt) = 0;\\n } else if(nx == 2 && ny == 2) {\\n get<3>(nxt) = 0;\\n }\\n if(!used.count(nxt) &&\\n get<0>(nxt) != 7 && get<1>(nxt) != 7 &&\\n get<2>(nxt) != 7 && get<3>(nxt) != 7) {\\n q.push(nxt);\\n used.insert(nxt);\\n }\\n }\\n }\\n }\\n return 0;\\n}\\n\\nint main() {\\n for(int i = 0; i < 3; i++) {\\n for(int j = 0; j < 3; j++) {\\n for(int ii = 0; ii < 2; ii++) {\\n for(int jj = 0; jj < 2; jj++) {\\n cover[i][j] += 1 << ((i + ii) * 4 + (j + jj));\\n }\\n }\\n for(int k = 1; k < 3; k++) {\\n dx[i][j][k ] = (i + k) % 3 - i;\\n dy[i][j][k+2] = (j + k) % 3 - j;\\n }\\n }\\n }\\n vector<int> ans;\\n while(1) {\\n cin >> n;\\n if(n == 0) break;\\n ans.push_back(solve());\\n }\\n for(auto &i : ans) cout << i << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 7748,\n \"score_of_the_acc\": -0.1003,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1243_6106653\",\n \"code_snippet\": \"/*\\nhttps://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1243\\n\\n現在の雲の左上の座標・何日目か・1,4,13,16番のセルが何日間連続で雨が降っていないかという情報を\\nクラスStateで保存する。方針としては幅優先探索を可能な限り行っていき、最終日まで条件を満たしながら\\n雲を動かしてけるかを確かめる。この時同じ状態を何度も探索することを防ぐために、cacheを用いている。\\n\\ncacheを使うことを中々思いつかず、計算時間の問題を解決するのに時間がかかった。結局1時間程\\nかかってしまった。\\n */\\n\\n#include <iostream>\\n#include <algorithm>\\n#include <queue>\\n#include <tuple>\\n#include <cstring>\\nusing namespace std;\\n\\nconst int MAX_N = 370;\\nconst int AREA_NUM = 16;\\nconst int dx[] = {0, 1, 0, -1, 0, 2, 0, -2, 0};\\nconst int dy[] = {0, 0, -1, 0, 1, 0, -2, 0, 2};\\nconst int ax[] = {0, 1, 0, 1};\\nconst int ay[] = {0, 0, 1, 1};\\nint cache[MAX_N][3][3][7][7][7][7];\\n\\nint need_sun[MAX_N][AREA_NUM];\\n\\nstruct State\\n{\\n int x;\\n int y;\\n int t;\\n int A;\\n int B;\\n int C;\\n int D;\\n};\\n\\nbool check_border(int x, int y)\\n{\\n return ((0 <= x) && (x < 4) && (0 <= y) && (y < 4));\\n}\\n\\nbool check_pos_and_specialday(int left_x, int top_y, int t)\\n{\\n int right_x = left_x + 1;\\n int bottom_y = top_y + 1;\\n if (check_border(left_x, top_y) &&\\n check_border(right_x, bottom_y))\\n return (need_sun[t][left_x + top_y * 4] == 0) &&\\n (need_sun[t][left_x + bottom_y * 4] == 0) &&\\n (need_sun[t][right_x + top_y * 4] == 0) &&\\n (need_sun[t][right_x + bottom_y * 4] == 0);\\n else\\n return false;\\n}\\n\\nbool check_dry(State state)\\n{\\n return state.A < 7 && state.B < 7 && state.C < 7 && state.D < 7;\\n}\\n\\nState update_state(State state, int nx, int ny)\\n{\\n State new_state = {nx, ny, state.t + 1,\\n state.A + 1, state.B + 1,\\n state.C + 1, state.D + 1};\\n int idx = 0;\\n for (int i = 0; i < 4; i++)\\n {\\n idx = nx + ax[i] + (ny + ay[i]) * 4;\\n if (idx == 0)\\n new_state.A = 0;\\n else if (idx == 3)\\n new_state.B = 0;\\n else if (idx == 12)\\n new_state.C = 0;\\n else if (idx == 15)\\n new_state.D = 0;\\n }\\n return new_state;\\n}\\n\\nint solve(int N, int sx, int sy)\\n{\\n int nx, ny, t;\\n\\n //左上のx座標・左上のy座標・何日目か・マス1の雨が降っていない期間\\n queue<State> que;\\n State init_state = {sx, sy, 0, 1, 1, 1, 1};\\n\\n bool last_day = false;\\n que.push(init_state);\\n while (!que.empty())\\n {\\n State state = que.front();\\n que.pop();\\n\\n if (cache[state.t][state.x][state.y][state.A][state.B][state.C][state.D]++)\\n continue;\\n for (int i = 0; i < 9; i++)\\n {\\n nx = state.x + dx[i];\\n ny = state.y + dy[i];\\n t = state.t;\\n if (t == N - 1)\\n {\\n last_day = true;\\n break;\\n }\\n State new_state = update_state(state, nx, ny);\\n if (check_dry(new_state) && check_pos_and_specialday(nx, ny, t + 1))\\n que.push(new_state);\\n }\\n }\\n\\n if (last_day)\\n return 1;\\n else\\n return 0;\\n}\\n\\nint main()\\n{\\n int N;\\n while (cin >> N)\\n {\\n if (N == 0)\\n break;\\n\\n for (int i = 0; i < N; i++)\\n for (int j = 0; j < AREA_NUM; j++)\\n cin >> need_sun[i][j];\\n\\n memset(cache, 0, sizeof(cache));\\n int ans = solve(N, 1, 1);\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 34644,\n \"score_of_the_acc\": -0.2757,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1243_6106604\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <queue>\\n#include <tuple>\\n#include <cstring>\\nusing namespace std;\\n\\nconst int MAX_N = 370;\\nconst int AREA_NUM = 16;\\nconst int dx[] = {0, 1, 0, -1, 0, 2, 0, -2, 0};\\nconst int dy[] = {0, 0, -1, 0, 1, 0, -2, 0, 2};\\nconst int ax[] = {0, 1, 0, 1};\\nconst int ay[] = {0, 0, 1, 1};\\nint cache[MAX_N][3][3][7][7][7][7];\\n\\nint need_sun[MAX_N][AREA_NUM];\\n\\nstruct Info\\n{\\n int x;\\n int y;\\n int t;\\n int A;\\n int B;\\n int C;\\n int D;\\n};\\n\\nbool check_border(int x, int y)\\n{\\n return ((0 <= x) && (x < 4) && (0 <= y) && (y < 4));\\n}\\n\\nbool check_pos_and_specialday(int left_x, int top_y, int t)\\n{\\n int right_x = left_x + 1;\\n int bottom_y = top_y + 1;\\n if (check_border(left_x, top_y) &&\\n check_border(right_x, bottom_y))\\n return (need_sun[t][left_x + top_y * 4] == 0) &&\\n (need_sun[t][left_x + bottom_y * 4] == 0) &&\\n (need_sun[t][right_x + top_y * 4] == 0) &&\\n (need_sun[t][right_x + bottom_y * 4] == 0);\\n else\\n return false;\\n}\\n\\nbool check_dry(Info info)\\n{\\n return info.A < 7 && info.B < 7 && info.C < 7 && info.D < 7;\\n}\\n\\nInfo update_info(Info info, int nx, int ny)\\n{\\n Info new_info = {nx, ny, info.t + 1,\\n info.A + 1, info.B + 1,\\n info.C + 1, info.D + 1};\\n int idx = 0;\\n for (int i = 0; i < 4; i++)\\n {\\n idx = nx + ax[i] + (ny + ay[i]) * 4;\\n if (idx == 0)\\n new_info.A = 0;\\n else if (idx == 3)\\n new_info.B = 0;\\n else if (idx == 12)\\n new_info.C = 0;\\n else if (idx == 15)\\n new_info.D = 0;\\n }\\n return new_info;\\n}\\n\\nint solve(int N, int sx, int sy)\\n{\\n int nx, ny, t;\\n\\n //左上のx座標・左上のy座標・何日目か・マス1の雨が降っていない期間\\n queue<Info> que;\\n Info init_state = {sx, sy, 0, 1, 1, 1, 1};\\n\\n bool last_day = false;\\n que.push(init_state);\\n while (!que.empty())\\n {\\n Info info = que.front();\\n que.pop();\\n\\n if (cache[info.t][info.x][info.y][info.A][info.B][info.C][info.D]++)\\n continue;\\n for (int i = 0; i < 9; i++)\\n {\\n nx = info.x + dx[i];\\n ny = info.y + dy[i];\\n t = info.t;\\n if (t == N - 1)\\n {\\n last_day = true;\\n break;\\n }\\n Info new_info = update_info(info, nx, ny);\\n if (check_dry(new_info) && check_pos_and_specialday(nx, ny, t + 1))\\n que.push(new_info);\\n }\\n }\\n\\n if (last_day)\\n return 1;\\n else\\n return 0;\\n}\\n\\nint main()\\n{\\n int N;\\n while (cin >> N)\\n {\\n if (N == 0)\\n break;\\n\\n for (int i = 0; i < N; i++)\\n for (int j = 0; j < AREA_NUM; j++)\\n cin >> need_sun[i][j];\\n\\n memset(cache, 0, sizeof(cache));\\n int ans = solve(N, 1, 1);\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 34656,\n \"score_of_the_acc\": -0.2893,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1243_6106603\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <queue>\\n#include <tuple>\\n#include <cstring>\\nusing namespace std;\\n\\nconst int MAX_N = 370;\\nconst int AREA_NUM = 16;\\nconst int dx[] = {0, 1, 0, -1, 0, 2, 0, -2, 0};\\nconst int dy[] = {0, 0, -1, 0, 1, 0, -2, 0, 2};\\nconst int ax[] = {0, 1, 0, 1};\\nconst int ay[] = {0, 0, 1, 1};\\nint cache[MAX_N][3][3][7][7][7][7];\\n\\nint need_sun[MAX_N][AREA_NUM];\\n\\nstruct Info\\n{\\n int x;\\n int y;\\n int t;\\n int A;\\n int B;\\n int C;\\n int D;\\n};\\n\\nbool check_border(int x, int y)\\n{\\n return ((0 <= x) && (x < 4) && (0 <= y) && (y < 4));\\n}\\n\\nbool check_pos_and_specialday(int left_x, int top_y, int t)\\n{\\n int right_x = left_x + 1;\\n int bottom_y = top_y + 1;\\n if (check_border(left_x, top_y) &&\\n check_border(right_x, bottom_y))\\n return (need_sun[t][left_x + top_y * 4] == 0) &&\\n (need_sun[t][left_x + bottom_y * 4] == 0) &&\\n (need_sun[t][right_x + top_y * 4] == 0) &&\\n (need_sun[t][right_x + bottom_y * 4] == 0);\\n else\\n return false;\\n}\\n\\nbool check_dry(Info info)\\n{\\n return info.A < 7 && info.B < 7 && info.C < 7 && info.D < 7;\\n}\\n\\nInfo update_info(Info info, int nx, int ny)\\n{\\n Info new_info = {nx, ny, info.t + 1,\\n info.A + 1, info.B + 1,\\n info.C + 1, info.D + 1};\\n int idx = 0;\\n for (int i = 0; i < 4; i++)\\n {\\n idx = nx + ax[i] + (ny + ay[i]) * 4;\\n if (idx == 0)\\n new_info.A = 0;\\n else if (idx == 3)\\n new_info.B = 0;\\n else if (idx == 12)\\n new_info.C = 0;\\n else if (idx == 15)\\n new_info.D = 0;\\n }\\n return new_info;\\n}\\n\\nint solve(int N, int sx, int sy)\\n{\\n int nx, ny, t;\\n\\n //左上のx座標・左上のy座標・何日目か・マス1の雨が降っていない期間\\n queue<Info> que;\\n Info init_state = {sx, sy, 0, 1, 1, 1, 1};\\n\\n bool last_day = false;\\n que.push(init_state);\\n while (!que.empty())\\n {\\n Info info = que.front();\\n que.pop();\\n\\n if (cache[info.t][info.x][info.y][info.A][info.B][info.C][info.D]++)\\n continue;\\n for (int i = 0; i < 9; i++)\\n {\\n nx = info.x + dx[i];\\n ny = info.y + dy[i];\\n t = info.t;\\n if (t == N - 1)\\n {\\n last_day = true;\\n break;\\n }\\n Info new_info = update_info(info, nx, ny);\\n if (check_dry(new_info) && check_pos_and_specialday(nx, ny, t + 1))\\n que.push(new_info);\\n }\\n }\\n\\n if (last_day)\\n return 1;\\n else\\n return 0;\\n}\\n\\nint main()\\n{\\n int N;\\n while (cin >> N)\\n {\\n if (N == 0)\\n break;\\n\\n for (int i = 0; i < N; i++)\\n for (int j = 0; j < AREA_NUM; j++)\\n cin >> need_sun[i][j];\\n\\n int ans = 0;\\n memset(cache, 0, sizeof(cache));\\n // if (check_pos_and_specialday(1, 1, 0))\\n ans = solve(N, 1, 1);\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 34628,\n \"score_of_the_acc\": -0.2756,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1243_6106602\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <queue>\\n#include <tuple>\\n#include <cstring>\\nusing namespace std;\\n\\nconst int MAX_N = 370;\\nconst int AREA_NUM = 16;\\nconst int dx[] = {0, 1, 0, -1, 0, 2, 0, -2, 0};\\nconst int dy[] = {0, 0, -1, 0, 1, 0, -2, 0, 2};\\nconst int ax[] = {0, 1, 0, 1};\\nconst int ay[] = {0, 0, 1, 1};\\nint cache[MAX_N][3][3][7][7][7][7];\\n\\nint need_sun[MAX_N][AREA_NUM];\\n\\nstruct Info\\n{\\n int x;\\n int y;\\n int t;\\n int A;\\n int B;\\n int C;\\n int D;\\n};\\n\\nbool check_border(int x, int y)\\n{\\n return ((0 <= x) && (x < 4) && (0 <= y) && (y < 4));\\n}\\n\\nbool check_pos_and_specialday(int left_x, int top_y, int t)\\n{\\n int right_x = left_x + 1;\\n int bottom_y = top_y + 1;\\n if (check_border(left_x, top_y) &&\\n check_border(right_x, bottom_y))\\n return (need_sun[t][left_x + top_y * 4] == 0) &&\\n (need_sun[t][left_x + bottom_y * 4] == 0) &&\\n (need_sun[t][right_x + top_y * 4] == 0) &&\\n (need_sun[t][right_x + bottom_y * 4] == 0);\\n else\\n return false;\\n}\\n\\nbool check_dry(Info info)\\n{\\n return info.A < 7 && info.B < 7 && info.C < 7 && info.D < 7;\\n}\\n\\nInfo update_info(Info info, int nx, int ny)\\n{\\n Info new_info = {nx, ny, info.t + 1,\\n info.A + 1, info.B + 1,\\n info.C + 1, info.D + 1};\\n int idx = 0;\\n for (int i = 0; i < 4; i++)\\n {\\n idx = nx + ax[i] + (ny + ay[i]) * 4;\\n if (idx == 0)\\n new_info.A = 0;\\n else if (idx == 3)\\n new_info.B = 0;\\n else if (idx == 12)\\n new_info.C = 0;\\n else if (idx == 15)\\n new_info.D = 0;\\n }\\n return new_info;\\n}\\n\\nint solve(int N, int sx, int sy)\\n{\\n int nx, ny, t;\\n\\n //左上のx座標・左上のy座標・何日目か・マス1の雨が降っていない期間\\n queue<Info> que;\\n Info init_state = {sx, sy, 0, 1, 1, 1, 1};\\n\\n bool last_day = false;\\n que.push(init_state);\\n while (!que.empty())\\n {\\n Info info = que.front();\\n que.pop();\\n\\n if (cache[info.t][info.x][info.y][info.A][info.B][info.C][info.D]++)\\n continue;\\n for (int i = 0; i < 9; i++)\\n {\\n nx = info.x + dx[i];\\n ny = info.y + dy[i];\\n t = info.t;\\n if (t == N - 1)\\n {\\n last_day = true;\\n break;\\n }\\n Info new_info = update_info(info, nx, ny);\\n if (check_dry(new_info) && check_pos_and_specialday(nx, ny, t + 1))\\n que.push(new_info);\\n }\\n }\\n\\n if (last_day)\\n return 1;\\n else\\n return 0;\\n}\\n\\nint main()\\n{\\n int N;\\n while (cin >> N)\\n {\\n if (N == 0)\\n break;\\n\\n for (int i = 0; i < N; i++)\\n for (int j = 0; j < AREA_NUM; j++)\\n cin >> need_sun[i][j];\\n\\n int ans = 0;\\n memset(cache, 0, sizeof(cache));\\n if (check_pos_and_specialday(1, 1, 0))\\n ans = solve(N, 1, 1);\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 34488,\n \"score_of_the_acc\": -0.288,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1243_6106591\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <queue>\\n#include <tuple>\\n#include <cstring>\\nusing namespace std;\\n\\nconst int MAX_N = 370;\\nconst int AREA_NUM = 16;\\nconst int dx[] = {0, 1, 0, -1, 0, 2, 0, -2, 0};\\nconst int dy[] = {0, 0, -1, 0, 1, 0, -2, 0, 2};\\nconst int ax[] = {0, 1, 0, 1};\\nconst int ay[] = {0, 0, 1, 1};\\nint cache[MAX_N][3][3][7][7][7][7];\\n\\nint need_sun[MAX_N][AREA_NUM];\\n\\nstruct Info\\n{\\n int x;\\n int y;\\n int t;\\n int A;\\n int B;\\n int C;\\n int D;\\n};\\n\\nbool check_border(int x, int y)\\n{\\n return ((0 <= x) && (x < 4) && (0 <= y) && (y < 4));\\n}\\n\\nbool valid(int left_x, int top_y, int t)\\n{\\n int right_x = left_x + 1;\\n int bottom_y = top_y + 1;\\n if (check_border(left_x, top_y) &&\\n check_border(right_x, bottom_y))\\n return (need_sun[t][left_x + top_y * 4] == 0) &&\\n (need_sun[t][left_x + bottom_y * 4] == 0) &&\\n (need_sun[t][right_x + top_y * 4] == 0) &&\\n (need_sun[t][right_x + bottom_y * 4] == 0);\\n else\\n return false;\\n}\\n\\nInfo update_info(Info info, int nx, int ny)\\n{\\n Info new_info = {nx, ny, info.t + 1,\\n info.A + 1, info.B + 1,\\n info.C + 1, info.D + 1};\\n int idx = 0;\\n for (int i = 0; i < 4; i++)\\n {\\n idx = nx + ax[i] + (ny + ay[i]) * 4;\\n if (idx == 0)\\n new_info.A = 0;\\n else if (idx == 3)\\n new_info.B = 0;\\n else if (idx == 12)\\n new_info.C = 0;\\n else if (idx == 15)\\n new_info.D = 0;\\n }\\n return new_info;\\n}\\n\\nbool dry_check(Info info)\\n{\\n return info.A < 7 && info.B < 7 && info.C < 7 && info.D < 7;\\n}\\n\\nint solve(int N, int sx, int sy)\\n{\\n int nx, ny, t;\\n\\n //左上のx座標・左上のy座標・何日目か・マス1の雨が降っていない期間\\n queue<Info> que;\\n Info init_state = {sx, sy, 0, 1, 1, 1, 1};\\n\\n bool last_day = false;\\n que.push(init_state);\\n while (!que.empty())\\n {\\n Info info = que.front();\\n que.pop();\\n\\n if (cache[info.t][info.x][info.y][info.A][info.B][info.C][info.D]++)\\n continue;\\n for (int i = 0; i < 9; i++)\\n {\\n nx = info.x + dx[i];\\n ny = info.y + dy[i];\\n t = info.t;\\n if (t == N - 1)\\n {\\n last_day = true;\\n break;\\n }\\n Info new_info = update_info(info, nx, ny);\\n if (dry_check(new_info) && valid(nx, ny, t + 1))\\n que.push(new_info);\\n }\\n }\\n\\n if (last_day)\\n return 1;\\n else\\n return 0;\\n}\\n\\nint main()\\n{\\n int N;\\n while (cin >> N)\\n {\\n if (N == 0)\\n break;\\n\\n for (int i = 0; i < N; i++)\\n for (int j = 0; j < AREA_NUM; j++)\\n cin >> need_sun[i][j];\\n\\n int ans = 0;\\n memset(cache, 0, sizeof(cache));\\n if (valid(1, 1, 0))\\n ans = solve(N, 1, 1);\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 34624,\n \"score_of_the_acc\": -0.2891,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1243_6106589\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <queue>\\n#include <tuple>\\n#include <cstring>\\nusing namespace std;\\n\\nconst int MAX_N = 370;\\nconst int AREA_NUM = 16;\\nconst int dx[] = {0, 1, 0, -1, 0, 2, 0, -2, 0};\\nconst int dy[] = {0, 0, -1, 0, 1, 0, -2, 0, 2};\\nconst int ax[] = {0, 1, 0, 1};\\nconst int ay[] = {0, 0, 1, 1};\\nint cache[MAX_N][3][3][7][7][7][7];\\n\\nint need_sun[MAX_N][AREA_NUM];\\n\\nstruct Info\\n{\\n int x;\\n int y;\\n int t;\\n int A;\\n int B;\\n int C;\\n int D;\\n};\\n\\nbool check_border(int x, int y)\\n{\\n return ((0 <= x) && (x < 4) && (0 <= y) && (y < 4));\\n}\\n\\nbool valid(int left_x, int top_y, int t)\\n{\\n int right_x = left_x + 1;\\n int bottom_y = top_y + 1;\\n if (check_border(left_x, top_y) &&\\n check_border(right_x, bottom_y))\\n return (need_sun[t][left_x + top_y * 4] == 0) &&\\n (need_sun[t][left_x + bottom_y * 4] == 0) &&\\n (need_sun[t][right_x + top_y * 4] == 0) &&\\n (need_sun[t][right_x + bottom_y * 4] == 0);\\n else\\n return false;\\n}\\n\\nInfo update_info(Info info, int nx, int ny)\\n{\\n Info new_info = {nx, ny, info.t + 1,\\n info.A + 1, info.B + 1,\\n info.C + 1, info.D + 1};\\n int idx = 0;\\n for (int i = 0; i < 4; i++)\\n {\\n idx = nx + ax[i] + (ny + ay[i]) * 4;\\n if (idx == 0)\\n new_info.A = 0;\\n else if (idx == 3)\\n new_info.B = 0;\\n else if (idx == 12)\\n new_info.C = 0;\\n else if (idx == 15)\\n new_info.D = 0;\\n }\\n return new_info;\\n}\\n\\nbool dry_check(Info info)\\n{\\n return info.A < 7 && info.B < 7 && info.C < 7 && info.D < 7;\\n}\\n\\nint solve(int N, int sx, int sy)\\n{\\n int nx, ny, t;\\n\\n //左上のx座標・左上のy座標・何日目か・マス1の雨が降っていない期間\\n queue<Info> que;\\n Info init_state = {sx, sy, 0, 1, 1, 1, 1};\\n int visit[4][4];\\n for (int i = 0; i < 16; i++)\\n visit[i % 4][i / 4] = 0;\\n\\n bool last_day = false;\\n que.push(init_state);\\n while (!que.empty())\\n {\\n Info info = que.front();\\n que.pop();\\n\\n if (cache[info.t][info.x][info.y][info.A][info.B][info.C][info.D]++)\\n continue;\\n\\n visit[info.x][info.y] = 1;\\n visit[info.x + 1][info.y] = 1;\\n visit[info.x][info.y + 1] = 1;\\n visit[info.x + 1][info.y + 1] = 1;\\n for (int i = 0; i < 9; i++)\\n {\\n nx = info.x + dx[i];\\n ny = info.y + dy[i];\\n t = info.t;\\n if (t == N - 1)\\n {\\n last_day = true;\\n break;\\n }\\n Info new_info = update_info(info, nx, ny);\\n if (dry_check(new_info) && valid(nx, ny, t + 1))\\n que.push(new_info);\\n }\\n }\\n\\n int visited_areas = 0;\\n for (int i = 0; i < 4; i++)\\n for (int j = 0; j < 4; j++)\\n visited_areas += visit[i][j];\\n\\n if (last_day && (visited_areas == 16))\\n return 1;\\n else\\n return 0;\\n}\\n\\nint main()\\n{\\n int N;\\n while (cin >> N)\\n {\\n if (N == 0)\\n break;\\n\\n for (int i = 0; i < N; i++)\\n for (int j = 0; j < AREA_NUM; j++)\\n cin >> need_sun[i][j];\\n\\n int ans = 0;\\n memset(cache, 0, sizeof(cache));\\n if (valid(1, 1, 0))\\n ans = solve(N, 1, 1);\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 34416,\n \"score_of_the_acc\": -0.2874,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1243_6011133\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define all(A) A.begin(),A.end()\\nusing vll = vector<ll>;\\n#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)\\n\\nvector<vll> Q={{1,2,5,6},{2,3,6,7},{3,4,7,8},{5,6,9,10},{6,7,10,11},{7,8,11,12},{9,10,13,14},{10,11,14,15},{11,12,15,16}};\\nvector<vll> T={{0,1,2,3,6},{0,1,2,4,7},{0,1,2,5,8},{3,4,5,0,6},{3,4,5,1,7},{3,4,5,2,8},{6,7,8,0,3},{6,7,8,1,4},{6,7,8,2,5}};\\nint main() {\\n\\twhile(1){\\n\\t\\tll N;\\n\\t\\tcin>>N;\\n\\t\\tif(N==0)return 0;\\n\\t\\tbool CD=false;\\n\\t\\tvector<vector<vector<vector<vector<vector<bool>>>>>> DP(N+1,vector<vector<vector<vector<vector<bool>>>>>\\n\\t\\t(7,vector<vector<vector<vector<bool>>>>(7,vector<vector<vector<bool>>>(7,vector<vector<bool>>(7,vector<bool>(9,false))))));\\n\\t\\tDP[0][1][1][1][1][4]=true;\\n\\t\\tvll A(16);\\n\\t\\trep(i,16)cin>>A[i];\\n\\t\\tif(A[5]==1||A[6]==1||A[9]==1||A[10]==1)CD=true;\\n\\n\\t\\trep(da,N-1){\\n\\t\\t\\tvll A(16);\\n\\t\\t\\trep(i,16)cin>>A[i];\\n\\t\\t\\trep(p,9){\\n\\t\\t\\t\\trep(j,5){\\n\\t\\t\\t\\t\\tll t=T[p][j];\\n\\t\\t\\t\\t\\tbool C=true;\\n\\t\\t\\t\\t\\trep(i,4){\\n\\t\\t\\t\\t\\t\\tif(A[Q[t][i]-1]==1)C=false;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif(C){//ここに動かせる.\\n\\t\\t\\t\\t\\t\\tif(t==0){\\n\\t\\t\\t\\t\\t\\t\\trep(a,7)rep(b,6)rep(c,6)rep(d,6){\\n\\t\\t\\t\\t\\t\\t\\tif(DP[da][a][b][c][d][p]){\\n\\t\\t\\t\\t\\t\\t\\t\\tDP[da+1][0][b+1][c+1][d+1][t]=true;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse if(t==2){\\n\\t\\t\\t\\t\\t\\t\\trep(a,6)rep(b,7)rep(c,6)rep(d,6){\\n\\t\\t\\t\\t\\t\\t\\tif(DP[da][a][b][c][d][p]){\\n\\t\\t\\t\\t\\t\\t\\t\\tDP[da+1][a+1][0][c+1][d+1][t]=true;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse if(t==6){\\n\\t\\t\\t\\t\\t\\t\\trep(a,6)rep(b,6)rep(c,7)rep(d,6){\\n\\t\\t\\t\\t\\t\\t\\tif(DP[da][a][b][c][d][p]){\\n\\t\\t\\t\\t\\t\\t\\t\\tDP[da+1][a+1][b+1][0][d+1][t]=true;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse if(t==8){\\n\\t\\t\\t\\t\\t\\t\\trep(a,6)rep(b,6)rep(c,6)rep(d,7){\\n\\t\\t\\t\\t\\t\\t\\tif(DP[da][a][b][c][d][p]){\\n\\t\\t\\t\\t\\t\\t\\t\\tDP[da+1][a+1][b+1][c+1][0][t]=true;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\t\\t\\trep(a,6)rep(b,6)rep(c,6)rep(d,6){\\n\\t\\t\\t\\t\\t\\t\\tif(DP[da][a][b][c][d][p]){\\n\\t\\t\\t\\t\\t\\t\\t\\tDP[da+1][a+1][b+1][c+1][d+1][t]=true;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\n\\n\\n\\n\\t\\t\\t\\t\\t\\t\\n\\n\\n\\n\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\n\\n\\n\\t\\tif(CD)cout<<0<<endl;\\n\\t\\telse{\\n\\t\\t\\tbool C=false;\\n\\t\\t\\trep(a,7)rep(b,7)rep(c,7)rep(d,7)rep(p,9){\\n\\t\\t\\t\\tif(DP[N-1][a][b][c][d][p])C=true;\\n\\t\\t\\t}\\n\\t\\t\\tcout<<C<<endl;\\n\\n\\t\\t}\\n\\t}\\n\\t\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 290,\n \"memory_kb\": 69944,\n \"score_of_the_acc\": -0.8969,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1243_6011099\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\nusing namespace std;\\nint N;\\nbool dp[2][9][9][9][9][9][9];\\nint ok[365];\\nvoid clr(int id)\\n{\\n\\tfor(int i=0;i<9;i++)for(int j=0;j<9;j++)for(int k=0;k<9;k++)for(int l=0;l<9;l++)for(int m=0;m<9;m++)for(int n=0;n<9;n++)dp[id][i][j][k][l][m][n]=false;\\n}\\nint G[9];\\nbool check[9][9][9][9][9][9][9];\\nint main()\\n{\\n\\tfor(int x=0;x<3;x++)for(int y=0;y<3;y++)\\n\\t{\\n\\t\\tfor(int tx=0;tx<3;tx++)for(int ty=0;ty<3;ty++)\\n\\t\\t{\\n\\t\\t\\tif(x==tx||y==ty)G[x*3+y]|=1<<tx*3+ty;\\n\\t\\t}\\n\\t}\\n\\tfor(int a=0;a<9;a++)for(int b=0;b<9;b++)for(int c=0;c<9;c++)for(int d=0;d<9;d++)for(int e=0;e<9;e++)for(int f=0;f<9;f++)for(int g=0;g<9;g++)\\n\\t{\\n\\t\\tbool ok=true;\\n\\t\\tfor(int k:{0,2,6,8})\\n\\t\\t{\\n\\t\\t\\tif(a-k&&b-k&&c-k&&d-k&&e-k&&f-k&&g-k)ok=false;\\n\\t\\t}\\n\\t\\tcheck[a][b][c][d][e][f][g]=ok;\\n\\t}\\n\\twhile(cin>>N,N)\\n\\t{\\n\\t\\tfor(int i=0;i<N;i++)\\n\\t\\t{\\n\\t\\t\\tint c[4][4];\\n\\t\\t\\tfor(int j=0;j<4;j++)for(int k=0;k<4;k++)cin>>c[j][k];\\n\\t\\t\\tok[i]=0;\\n\\t\\t\\tfor(int x=0;x<3;x++)for(int y=0;y<3;y++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif(!(c[x][y]||c[x][y+1]||c[x+1][y]||c[x+1][y+1]))ok[i]|=1<<x*3+y;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(!(ok[0]>>4&1))\\n\\t\\t{\\n\\t\\t\\tcout<<0<<endl;\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tint now=0;\\n\\t\\tclr(now);\\n\\t\\tdp[now][0][0][0][0][0][4]=true;\\n\\t\\tfor(int i=1;i<N;i++)\\n\\t\\t{\\n\\t\\t\\tint nxt=1-now;\\n\\t\\t\\tclr(nxt);\\n\\t\\t\\tfor(int a=0;a<9;a++)for(int b=0;b<9;b++)for(int c=0;c<9;c++)for(int d=0;d<9;d++)for(int e=0;e<9;e++)for(int f=0;f<9;f++)if(dp[now][a][b][c][d][e][f])\\n\\t\\t\\t{\\n\\t\\t\\t\\tint to=G[f]&ok[i];\\n\\t\\t\\t\\tfor(int g=0;g<9;g++)if(to>>g&1)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif(i>=6&&!check[a][b][c][d][e][f][g])continue;\\n\\t\\t\\t\\t\\tdp[nxt][b][c][d][e][f][g]=true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tnow=nxt;\\n\\t\\t}\\n\\t\\tbool ok=false;\\n\\t\\tfor(int a=0;a<9;a++)for(int b=0;b<9;b++)for(int c=0;c<9;c++)for(int d=0;d<9;d++)for(int e=0;e<9;e++)for(int f=0;f<9;f++)if(dp[now][a][b][c][d][e][f])ok=true;\\n\\t\\tcout<<(ok?1:0)<<endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 760,\n \"memory_kb\": 9152,\n \"score_of_the_acc\": -1.044,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1243_6011075\",\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\\nint N;\\nvector<int> cnt;\\nvector<vector<int>> sched;\\nset<pair<int, vector<int>>> st;\\n\\nint di[4] = {0, 1, 0, -1};\\nint dj[4] = {1, 0, -1, 0};\\n\\nbool dfs(int day, int p) {\\n if (day == N) return true;\\n if (st.count({day, cnt})) {\\n return false;\\n }\\n rep(i,0,16) if (cnt[i] >= 7) return false;\\n rep(i,0,16) if (sched[day][i] && cnt[i] == 0) return false;\\n auto tmp = cnt;\\n int i = p/4, j=p%4;\\n rep(k,1,3) {\\n rep(d,0,4) {\\n int ni = i + k*di[d], nj = j + k*dj[d];\\n if (0 <= ni && ni < 3 && 0 <= nj && nj < 3) {\\n rep(x,0,16) cnt[x]++;\\n cnt[4*ni+nj] = cnt[4*ni+nj+1] = cnt[4*(ni+1)+nj] = cnt[4*(ni+1)+nj+1] = 0;\\n if (dfs(day+1, 4*ni+nj)) return true;\\n cnt = tmp;\\n }\\n }\\n }\\n rep(x,0,16) cnt[x]++;\\n cnt[4*i+j] = cnt[4*i+j+1] = cnt[4*(i+1)+j] = cnt[4*(i+1)+j+1] = 0;\\n if (dfs(day+1, 4*i+j)) return true;\\n cnt = tmp;\\n st.insert({day, cnt});\\n return false;\\n}\\n\\nint main() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n\\n while (1) {\\n cin >> N;\\n if (N==0) break;\\n st.clear();\\n sched.resize(N, vector<int>(16));\\n rep(i,0,N) rep(j,0,16) cin >> sched[i][j];\\n cnt.assign(16,1);\\n cnt[5] = cnt[6] = cnt[9] = cnt[10] = 0;\\n cout << dfs(0, 5) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 19552,\n \"score_of_the_acc\": -0.3032,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1243_5972489\",\n \"code_snippet\": \"#pragma region Macros\\n#include <bits/stdc++.h>\\nusing namespace std;\\ntemplate <class T> inline bool chmax(T &a, T b) {\\n if(a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <class T> inline bool chmin(T &a, T b) {\\n if(a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\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\\n\\nstruct Setup {\\n Setup() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(15);\\n }\\n} __Setup;\\n\\nusing ll = long long;\\n#define OVERLOAD3(_1, _2, _3, name, ...) name\\n#define ALL(v) (v).begin(), (v).end()\\n#define RALL(v) (v).rbegin(), (v).rend()\\n#define REP1(i, n) for(int i = 0; i < (n); i++)\\n#define REP2(i, a, b) for(int i = (a); i < int(b); i++)\\n#define REP(...) OVERLOAD3(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)\\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\\nconst int INF = 1 << 30;\\nconst ll LLINF = 1LL << 60;\\nconstexpr int MOD = 1000000007;\\nconstexpr int MOD2 = 998244353;\\nconst int dx[4] = {1, 0, -1, 0};\\nconst int dy[4] = {0, 1, 0, -1};\\n\\nvoid Case(int i) { cout << \\\"Case #\\\" << i << \\\": \\\"; }\\nint popcount(int x) { return __builtin_popcount(x); }\\nll popcount(ll x) { return __builtin_popcountll(x); }\\n#pragma endregion Macros\\n\\nusing arr = array<int, 16>;\\n\\nbool solve() {\\n int N;\\n cin >> N;\\n if(N == 0) return false;\\n vector<arr> schedules(N);\\n REP(i, N) REP(j, 16) cin >> schedules[i][j];\\n\\n vector<map<arr, int>> memo(16);\\n arr now;\\n bool ans = false;\\n REP(i, 16) now[i] = 1;\\n now[5] = now[6] = now[9] = now[10] = 0;\\n auto dfs = [&](auto&& self, int cx, int cy, int d) -> void {\\n if(ans) return;\\n if(d >= N) {\\n // debug(cx, cy, d);\\n // REP(i, 16) cerr << now[i] << ' ';\\n // cerr << endl;\\n ans = true;\\n return;\\n }\\n REP(x, 4) REP(y, 4) {\\n if(now[x*4 + y] >= 7) return;\\n if(now[x*4 + y] == 0 and schedules[d][x*4 + y]) return;\\n }\\n if(memo[cx*4 + cy].count(now) and memo[cx*4 + cy][now] >= d) return;\\n // debug(cx, cy, d);\\n // REP(i, 16) cerr << now[i] << ' ';\\n // cerr << endl;\\n memo[cx*4 + cy][now] = d;\\n REP(dir, 4) REP(w, 3) {\\n int nx = cx + dx[dir] * w;\\n int ny = cy + dy[dir] * w;\\n if(nx < 0 or nx >= 3 or ny < 0 or ny >= 3) continue;\\n auto tmp = now;\\n REP(x, 4) REP(y, 4) {\\n if(nx <= x and x <= nx+1 and ny <= y and y <= ny+1) now[x*4 + y] = 0;\\n else now[x*4 + y] += 1;\\n }\\n self(self, nx, ny, d+1);\\n now = tmp;\\n }\\n };\\n dfs(dfs, 1, 1, 0);\\n cout << ans << '\\\\n';\\n return true;\\n}\\n\\nint main() {\\n while(solve());\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3928,\n \"score_of_the_acc\": -0.0021,\n \"final_rank\": 1\n }\n]","isConversational":false}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":6,"numItemsPerPage":100,"numTotalItems":2103,"offset":600,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc3OTQ4NzE0NSwic3ViIjoiL2RhdGFzZXRzL09OTFlTTElNRS9BT0otQ29kZVJhbmstQmVuY2htYXJrIiwiZXhwIjoxNzc5NDkwNzQ1LCJpc3MiOiJodHRwczovL2h1Z2dpbmdmYWNlLmNvIn0.MSs-t2PN5yZiIcnZOnwzg4Ak9WMuHQYfpUzrP3LnvaCeRgh8-hC-6vEh-YQbVIIjYUE9cqANZajWXVm_HkbDAg","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_1111_cpp | Cyber Guardian
In the good old days, the Internet was free from fears and
terrorism. People did not have to worry about any cyber criminals or mad
computer scientists. Today, however, you are facing atrocious crackers
wherever you are, unless being disconnected. You have to protect
yourselves against their attacks.
Co... | [
{
"submission_id": "aoj_1111_10849586",
"code_snippet": "#include<stdio.h>\n#include<string.h>\n#include<iostream>\n#include<algorithm>\n#include<queue>\n#include<vector>\n#include<cmath>\nconst int Max = 1111;\ntypedef long long LL;\nusing namespace std;\n\nint n,m,cnt;\nchar rule[3][Max][111];\nchar str [... |
aoj_1127_cpp | Building a Space Station
You are a member of the space station engineering team,
and are assigned a task in the construction process of the station.
You are expected to write a computer program to complete the task.
The space station is made up with a number of units, called
cells.
All cells are sphere-shaped, but thei... | [
{
"submission_id": "aoj_1127_11065898",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\n\nstatic int bigint = 1e9;\nstatic ll biglong = 1e18;\nstatic ld eps = 1e-9;\n#define rep(i,s,n) for(int i=s;i<(int)(n);i++)\n#define sz(x) (int)(x).size()... |
aoj_1133_cpp | Problem E:
Water Tank
Mr. Denjiro is a science teacher.
Today he has just received a specially ordered water tank that
will certainly be useful for his innovative experiments on water
flow.
Figure 1: The water tank
The size of the tank is 100cm (Width) * 50cm (Height) * 30cm (Depth)
(see Figure 1).
For the experimen... | [
{
"submission_id": "aoj_1133_9144865",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#if __has_include(<atcoder/all>)\n#include <atcoder/all>\nusing namespace atcoder;\ntemplate<int mod>istream &operator>>(istream &is,static_modint<mod> &a){long long b;is>>b;a=b;return is;}\nistream &oper... |
aoj_1130_cpp | Problem B:
Red and Black
There is a rectangular room, covered with square tiles. Each tile is
colored either red or black. A man is standing on a black tile.
From a tile, he can move to one of four adjacent tiles. But he can't
move on red tiles, he can move only on black tiles.
Write a program to count the number of b... | [
{
"submission_id": "aoj_1130_8840090",
"code_snippet": "//会う時と+1のとき\n\n//いくつもとけるように\n//countの初期値直した テストケース2つokおそらくいける タリーズでwifi繋がらずまだ\n//69のaojテストケースでanswer45なのに1\n//隣接リストを用意→＠からbfs -1でなかった点を数え上げる\n#include <iostream>\n#include <queue>\nusing namespace std;\n\nint bfs(int src, int n, int G[410][410]){ //src... |
aoj_1136_cpp | Problem B:
Polygonal Line Search
Multiple polygonal lines are given on the
xy
-plane.
Given a list of polygonal lines and a template,
you must find out polygonal lines
which have the same shape as the template.
A polygonal line consists of several line segments parallel to
x
-axis or
y
-axis. It is defined by a list o... | [
{
"submission_id": "aoj_1136_2163060",
"code_snippet": "#include <iostream>\n#include <string>\n#include <queue>\n#include <stack>\n#include <algorithm>\n#include <list>\n#include <vector>\n#include <complex>\n#include <utility>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#... |
aoj_1134_cpp | Problem F:
Name the Crossing
The city of Kyoto is well-known for its Chinese plan: streets are
either North-South or East-West. Some streets are numbered, but most
of them have real names.
Crossings are named after the two streets crossing there,
e.g. Kawaramachi-Sanjo is the crossing of Kawaramachi street and Sanjo
st... | [
{
"submission_id": "aoj_1134_9634624",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef long double ld;\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 RFOR(i,l,r) for(ll i=r-1;i>=l;i--)\n#define RREP(i,n) R... |
aoj_1128_cpp | Square Carpets
Mr. Frugal bought a new house.
He feels deeply in love with his new house
because it has a comfortable living room
in which he can put himself completely at ease.
He thinks his new house is a really good buy.
But, to his disappointment,
the floor of its living room has some scratches on it.
The floor ha... | [
{
"submission_id": "aoj_1128_6005812",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n//#define int long long\ntypedef long long ll;\nusing namespace std;\n#define inf 0x3f3f3f3f\n#define se second\n#define fi first\nconst int mx = 1E4;\nint n,m;\nint a[14][14];\nint dp[14][14];\nint vis[1... |
aoj_1132_cpp | Problem D:
Circle and Points
You are given
N
points in the
xy
-plane. You have a
circle of radius one and move it on the
xy
-plane, so as to
enclose as many of the points as possible. Find how many points can be
simultaneously enclosed at the maximum. A point is considered
enclosed
by a circle when it is inside or on t... | [
{
"submission_id": "aoj_1132_10853887",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nconst int N = 300;\ntypedef complex <double> point;\npoint a[N];\ndouble kc[N][N];\ndouble x[N],y[N];\nint n;\nint quetgoc(int i,double r,int n){\n vector<pair<double,bool> > goc;\n for(int j=0;j<n;... |
aoj_1135_cpp | Problem A:
Ohgas' Fortune
The Ohgas are a prestigious family based on Hachioji. The head of the family,
Mr. Nemochi Ohga, a famous wealthy man, wishes to increase his fortune
by depositing his money to an operation company. You are asked to help
Mr. Ohga maximize his profit by operating the given money during a specif... | [
{
"submission_id": "aoj_1135_1862389",
"code_snippet": "#include <iostream>\nusing namespace std;\nint main(){\n int a, moneyF, yearL, vary, i1, i2, i3, s, moneyB1, moneyB2, risi1, risi2, moneyto, max;\n double per;\n i1 = 0;\n cin >> a;\n while(1){\n i1++;\n if(i1>a){break;}\n ... |
aoj_1140_cpp | Problem F:
Cleaning Robot
Here, we want to solve path planning for a mobile robot cleaning a
rectangular room floor with furniture.
Consider the room floor paved with square tiles whose size fits
the cleaning robot (1 × 1).
There are 'clean tiles' and 'dirty tiles', and the robot can change
a 'dirty tile' to a 'clean ... | [
{
"submission_id": "aoj_1140_10851274",
"code_snippet": "// clang-format off\n//#pragma GCC optimize(\"Ofast\")\n//#pragma GCC target(\"avx\")\n#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\n#define stoi stoll\n#define Endl endl\n#define itn int\n#define fi first\n#define se second\n... |
aoj_1142_cpp | Problem B:
Organize Your Train part II
RJ Freight, a Japanese railroad company for freight operations
has recently constructed exchange lines at Hazawa, Yokohama.
The layout of the lines is shown in Figure B-1.
Figure B-1: Layout of the exchange lines
A freight train consists of 2 to 72 freight cars. There are 26
type... | [
{
"submission_id": "aoj_1142_10999336",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <string>\n#include <set>\nusing namespace std;\n\nint main() {\n int N;\n cin >> N;\n for (int i=0; i<N; ++i) {\n string word;\n set<string> S;\n cin >> word;\n f... |
aoj_1131_cpp | Problem C:
Unit Fraction Partition
A fraction whose numerator is 1
and whose denominator is a positive integer
is called a unit fraction.
A representation of a positive rational number
p
/
q
as the sum of finitely many unit fractions is called a
partition
of
p
/
q
into unit fractions.
For example,
1/2 + 1/6
is a partit... | [
{
"submission_id": "aoj_1131_10848172",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint n, a;\n\nint gcd(int a, int b) {\n\tif (a%b == 0) {\n\t\treturn b;\n\t} else {\n\t\treturn gcd(b, a % b);\n\t}\n}\n\nint dfs(int p, int q, int m, int prod, int c) {\n\t// if (... |
aoj_1139_cpp | Problem E:
Earth Observation with a Mobile Robot Team
A new type of mobile robot has been developed for environmental earth
observation.
It moves around on the ground, acquiring and recording various sorts of
observational data using high precision sensors.
Robots of this type have short range wireless communication de... | [
{
"submission_id": "aoj_1139_9672115",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vi;\ntypedef vector<vi> vvi;\ntypedef long double ld;\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)... |
aoj_1141_cpp | Problem A:
Dirichlet's Theorem on Arithmetic Progressions
Good evening, contestants.
If
a
and
d
are relatively prime positive integers,
the arithmetic sequence beginning with
a
and increasing by
d
, i.e.,
a
,
a
+
d
,
a
+ 2
d
,
a
+ 3
d
,
a
+ 4
d
,
...,
contains infinitely many prime numbers.
This fact is known as Dirich... | [
{
"submission_id": "aoj_1141_10849693",
"code_snippet": "#include<stdio.h>\n#include<math.h>\n\nint isprime(int m){\n if(m<2)\n return 0;\n for(int i=2;i<=(int)sqrt(m);i++){\n if(0==m%i)\n return 0;\n }\n return 1;\n}\n\nint main(){\n int a,b,c;\n while(scanf(\"%d%... |
aoj_1138_cpp | Problem D:
Traveling by Stagecoach
Once upon a time, there was a traveler.
He plans to travel using stagecoaches (horse wagons).
His starting point and destination are fixed,
but he cannot determine his route.
Your job in this problem is to write a program
which determines the route for him.
There are several cities in... | [
{
"submission_id": "aoj_1138_10865848",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\nusing namespace std;\n\nconst int INF = 0x3f3f3f3f;\nconst int MAX_N = 8;\nconst int MAX_M = 30;\n\nint N, M, P, A, B;\n\nint t[MAX... |
aoj_1143_cpp | Problem C:
Hexerpents of Hexwamp
Hexwamp is a strange swamp, paved with regular hexagonal dimples.
Hexerpents crawling in this area are serpents adapted to the
environment, consisting of a chain of regular hexagonal sections. Each
section fits in one dimple.
Hexerpents crawl moving some of their sections from the dimp... | [
{
"submission_id": "aoj_1143_10476119",
"code_snippet": "// AOJ #1143 Hexerpents of Hexwamp\n// 2025.5.12\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing pii = pair<int,int>;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() {\n\tint n = 0; int c = gc();\n\tif (c ==... |
aoj_1149_cpp | Problem C:
Cut the Cake
Today is the birthday of Mr. Bon Vivant, who is known as one of the greatest
pâtissiers
in the world.
Those who are invited to his birthday party are
gourmets
from around the world.
They are eager to see and eat his extremely creative cakes.
Now a large box-shaped cake is being carried into the ... | [
{
"submission_id": "aoj_1149_9370376",
"code_snippet": "#include <bits/stdc++.h>\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define all(x) (x).begin(),(x).end()\n#define eb emplace_back\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing vl = vector<long long>;\nusing vv... |
aoj_1151_cpp | Problem E:
Twirl Around
Let's think about a bar rotating clockwise as if it were a
twirling baton moving on a planar surface surrounded by a
polygonal wall (see Figure 1).
Figure 1. A bar rotating in a polygon
Initially, an end of the bar (called "end A") is at (0,0), and
the other end (called "end B") is at (0,
L
) w... | [
{
"submission_id": "aoj_1151_1380113",
"code_snippet": "#include<cstdio>\n#include<cmath>\n#include<utility>\n#include<vector>\n#include<complex>\n#include<iostream>\n#include<algorithm>\n \nusing namespace std;\n \ntypedef long double Real;\ntypedef complex<Real> Point;\ntypedef complex<Real> Vector;\nty... |
aoj_1145_cpp | Problem E:
The Genome Database of All Space Life
In 2300, the Life Science Division of Federal Republic of Space starts
a very ambitious project to complete the genome sequencing of all
living creatures in the entire universe and develop the genomic
database of all space life.
Thanks to scientific research over many ye... | [
{
"submission_id": "aoj_1145_10852720",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define REP(i, n) for (int i = 0; i < (n); i++)\n#define int long long\n#define FOR(i, m, n) for (int i = (m); i < (n); i++)\n#define all(x) x.begin(), x.end()\nusing pii = pair<int, int>;\nconstexpr... |
aoj_1144_cpp | Problem D:
Curling 2.0
On Planet MM-21, after their Olympic games this year, curling is getting popular.
But the rules are somewhat different from ours.
The game is played on an ice game board on which a square mesh is marked.
They use only a single stone.
The purpose of the game is to lead the stone from the start
to ... | [
{
"submission_id": "aoj_1144_10883658",
"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 <cstdio... |
aoj_1155_cpp | Problem C:
How can I satisfy thee? Let me count the ways...
Three-valued logic is a logic system that has, in addition to "true" and
"false", "unknown" as a valid value.
In the following, logical values "false", "unknown" and "true" are
represented by 0, 1 and 2 respectively.
Let "-" be a unary operator (i.e. a sy... | [
{
"submission_id": "aoj_1155_4920981",
"code_snippet": "#include <iostream>\n#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint a,b,c,ch[80],ans,A,B,C,D;\nstring s;\nint no(int n){\n if(n==0)return 2;\n if(n==1)return 1;\n return 0;\n}\nint h(int x,int y){\n if(x*y==0)retu... |
aoj_1152_cpp | Problem F:
Dr. Podboq or: How We Became Asymmetric
After long studying how embryos of organisms become asymmetric during
their development, Dr. Podboq, a famous biologist, has reached his new
hypothesis. Dr. Podboq is now preparing a poster for the coming
academic conference, which shows a tree representing the develo... | [
{
"submission_id": "aoj_1152_9685131",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef long double ld;\ntypedef pair<ll,ll> pi;\ntypedef vector<ll> vi;\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()\ntempl... |
aoj_1154_cpp | Problem B:
Monday-Saturday Prime Factors
Chief Judge's log, stardate 48642.5.
We have decided to make a problem from elementary number theory.
The problem looks like finding all prime factors of a positive integer,
but it is not.
A positive integer whose remainder divided by 7 is either 1 or 6 is called
a 7
N
+{1,6} nu... | [
{
"submission_id": "aoj_1154_10946380",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint next(int i) {\n return i%7 == 1 ? i+5 : i+2;\n}\n\nbool isprime(int x) {\n for(int i=6; i<x; i=next(i)) {\n if(x%i == 0) return false;\n }\n return true;\n}\n\nint main() {\n int n;\n wh... |
aoj_1150_cpp | Problem D:
Cliff Climbing
At 17:00, special agent Jack starts to escape from the enemy camp.
There is a cliff in between the camp and the nearest safety zone.
Jack has to climb the almost vertical cliff
by stepping his feet on the blocks that cover the cliff.
The cliff has slippery blocks where Jack has to
spend time ... | [
{
"submission_id": "aoj_1150_10853812",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <queue>\n#include <cstdio>\nusing namespace std;\n#define reps(i,j,k) for(int i = j ; i < k ; ++i)\n#define rep(i,j) reps(i,0,j)\n\n\nconst int ldx[] = {1,1,2,1,2,3,1,2,1};\nconst int ldy[] = {2,1,1,... |
aoj_1148_cpp | Problem B:
Analyzing Login/Logout Records
You have a computer literacy course in your university. In the computer
system, the login/logout records of all PCs in a day are stored in a
file. Although students may use two or more PCs at a time, no one can
log in to a PC which has been logged in by someone who has not
log... | [
{
"submission_id": "aoj_1148_10848565",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n\nint main(){\n\tint N,M;\n\tint r;\n\twhile( cin >> N >> M && N ){\n\t\tcin >> r;\n\t\tvector<int> imos[M];\n\t\tfor(int i = 0 ; i < M ; i++) imos[i].resize(60*24+1);\n\t\tfor(int i = 0 ; i < r ; i++)... |
aoj_1160_cpp | Problem B:
How Many Islands?
You are given a marine area map that is a mesh of squares, each
representing either a land or sea area.
Figure B-1 is an example of a map.
Figure B-1: A marine area map
You can walk from a square land area to another if they are horizontally,
vertically, or diagonally adjacent to each other... | [
{
"submission_id": "aoj_1160_11039024",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n\nvector<int> dh = {1, 0, -1, 0, 1, 1, -1, -1};\nvector<int> dw = {0, 1, 0, -1, 1, -1, 1, -1};\n\nbool isInside(int h, int w, vec... |
aoj_1146_cpp | Problem F
Secrets in Shadows
Long long ago, there were several identical columns (or cylinders) built vertically in a big open space near Yokohama (Fig. F-1). In the daytime, the shadows of the columns were moving on the ground as the sun moves in the sky. Each column was very tall so that its shadow was very long. The... | [
{
"submission_id": "aoj_1146_10214589",
"code_snippet": "#define _CRT_SECURE_NO_WARNINGS \n#include <iostream>\n#include <algorithm>\n#include <cmath>\n#include <cstring>\n#include <cassert>\n#include <vector>\ntypedef long long ll;\ntypedef long double ld;\n//typedef double ld;\ntypedef std::vector<int> Vi... |
aoj_1156_cpp | Problem D:
Twirling Robot
Let's play a game using a robot on a rectangular board
covered with a square mesh (Figure D-1).
The robot is initially set at the start square in the northwest corner
facing the east direction.
The goal of this game is to lead the robot
to the goal square in the southeast corner.
Figure D-1: ... | [
{
"submission_id": "aoj_1156_10848675",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing VS = vector<string>; using LL = long long;\nusing VI = vector<int>; using VVI = vector<VI>;\nusing PII = pair<int, int>; using PLL = pair<LL, LL>;\nusing VL = vector<LL>; using ... |
aoj_1157_cpp | Problem E:
Roll-A-Big-Ball
ACM University holds its sports day in every July. The "Roll-A-Big-Ball"
is the highlight of the day. In the game, players roll a ball
on a straight course drawn on the ground. There are
rectangular parallelepiped blocks on the ground as obstacles, which are fixed on the ground.
During th... | [
{
"submission_id": "aoj_1157_10849696",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ndouble EPS = 1e-9;\ntypedef complex<double> P;\n\nstruct L : public vector<P> {\n L(const P &a, const P &b) {\n push_back(a); push_back(b);\n }\n};\ndouble cross(const P& a, const P& b) {\n retur... |
aoj_1159_cpp | Problem A:
Next Mayor
One of the oddest traditions of the town of Gameston may be that even
the town mayor of the next term is chosen according to the result of a game.
When the expiration of the term of the mayor approaches, at least
three candidates, including the mayor of the time, play a game of
pebbles, and the wi... | [
{
"submission_id": "aoj_1159_10851347",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\tint n,p;\n\twhile( cin >> n >> p and n ){\n\t\tint c[50] = {};\n\t\tint owan = p;\n\t\tfor(int i = 0 ; ; i = (i+1) % n ){\n\t\t\tif( owan ){\n\t\t\t\t--owan;\n\t\t\t\tc[i]++;\n\t\t\t}els... |
aoj_1161_cpp | Problem C:
Verbal Arithmetic
Let's think about
verbal arithmetic.
The material of this puzzle is a summation
of non-negative integers represented in a decimal format,
for example, as follows.
905 + 125 = 1030
In verbal arithmetic, every digit appearing in the equation is masked with an alphabetic character. A problem... | [
{
"submission_id": "aoj_1161_10851225",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n\nlong long weight[128];\n\nint to[128];\nint cnt = 0;\nvector<char> appear;\nvector<string> s;\n\nint taboo[128];\n\n\nbool bad(string &s,int to[128]){\n\tif( s.size() == 1 ) return 0;\n\tif( to[s[0]]... |
aoj_1162_cpp | Problem D:
Discrete Speed
Consider car trips in a country where there is no friction.
Cars in this country do not have engines.
Once a car started to move at a speed, it keeps moving at the same speed.
There are acceleration devices on some points on the road,
where a car can increase or decrease its speed by 1.
It can... | [
{
"submission_id": "aoj_1162_10849611",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nstruct Node{\n\tint pos;\n\tint speed;\n\tdouble cost;\n\tint prev;\n};\nbool operator < (const Node &a,const Node &b){\n\treturn a.cost > b.cost;\n}\n\n\n\nint main(){\n\tint n,m;\n\twhile(cin >> n >>... |
aoj_1163_cpp | Problem E:
Cards
There are many blue cards and red cards on the table.
For each card, an integer number greater than 1 is printed on its face.
The same number may be printed on several cards.
A blue card and a red card can be paired when both of the numbers
printed on them have a common divisor greater than 1.
There ma... | [
{
"submission_id": "aoj_1163_10915351",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\n\nint dfs(vector<vector<tuple<int,int,int>>>& G,vector<bool>& checked,int cv,int cf,int goal){\n if(cv==goal) return cf;\n checked[cv]=true;\n\n int ca=0;\n for(auto& nv:... |
aoj_1165_cpp | Problem A:
Pablo Squarson's Headache
Pablo Squarson is a well-known cubism artist. This year's theme for Pablo Squarson is "Squares". Today we are visiting his studio to see how his masterpieces are given birth.
At the center of his studio, there is a huuuuuge table and beside it are many, many squares of the same si... | [
{
"submission_id": "aoj_1165_9262894",
"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);... |
aoj_1166_cpp | Problem B:
Amazing Mazes
You are requested to solve maze problems. Without passing through
these mazes, you might not be able to pass through the domestic
contest!
A maze here is a rectangular area of a number of squares, lined up
both lengthwise and widthwise, The area is surrounded by walls except
for its entry and... | [
{
"submission_id": "aoj_1166_10936796",
"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 oke cout << \"Yes\" << '\\n';\n#define dame cout << \"No\" << '\\n';\n#define all(a) a.begin(), a.end()\n#define rall(... |
aoj_1167_cpp | Problem C:
Pollock's conjecture
The
n
th triangular number is
defined as
the sum of the first
n
positive integers.
The
n
th tetrahedral number is
defined as
the sum of the first
n
triangular numbers.
It is easy to show that
the
n
th tetrahedral number is equal to
n
(
n
+1)(
n
+2) ⁄ 6.
For example,
the 5th tetrahedral n... | [
{
"submission_id": "aoj_1167_11043743",
"code_snippet": "#include <bits/stdc++.h>\n#pragma GCC target(\"avx2\")\n#ifndef LOCAL\n#pragma GCC optimize(\"O3\")\n#endif\n#pragma GCC optimize(\"unroll-loops\")\n\n#ifdef ONLINE_JUDGE\n#include <boost/multiprecision/cpp_int.hpp>\n#include <atcoder/all>\n#endif\n#i... |
aoj_1164_cpp | Problem F:
Tighten Up!
We have a flat panel with two holes. Pins are nailed on its
surface. From the back of the panel, a string comes out through one
of the holes to the surface. The string is then laid on the surface
in a form of a polygonal chain, and goes out to the panel's back through
the other hole. Initiall... | [
{
"submission_id": "aoj_1164_8550653",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nstruct Point {\n double x, y;\n Point operator+(const Point p) const { return {x + p.x, y + p.y}; }\n double operator*(const Point p) const { return x * p.x + y * p.y; }\n Point operator-(const Poin... |
aoj_1158_cpp | Problem F:
ICPC: Intelligent Congruent Partition of Chocolate
The twins named Tatsuya and Kazuya love chocolate.
They have found a bar of their favorite chocolate in a very strange shape.
The chocolate bar looks to have been eaten partially by Mam.
They, of course, claim to eat it and then
will cut it into two pieces ... | [
{
"submission_id": "aoj_1158_10335906",
"code_snippet": "// AOJ #1158 ICPC: Intelligent Congruent Partition of Chocolate\n// 2025.3.30\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ull = unsigned long long;\n\nconstexpr int dY[4] = {0, 1, 0, -1};\nconstexpr int dX[4] = {1, 0, -1, 0};\n\nstruct St... |
aoj_1172_cpp | Chebyshev's Theorem
If
n
is a positive integer,
there exists at least one prime number greater than
n
and less than or equal to 2
n
.
This fact is known as Chebyshev's theorem or the Bertrand-Chebyshev theorem,
which had been conjectured by Joseph Louis François Bertrand (1822–1900)
and was proven by Pafnuty Lvovich Ch... | [
{
"submission_id": "aoj_1172_10609798",
"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,... |
aoj_1168_cpp | Problem D:
Off Balance
You are working for an administration office of the International
Center for Picassonian Cubism (ICPC), which plans to build a new art
gallery for young artists. The center is organizing an architectural
design competition to find the best design for the new building.
Submitted designs will look... | [
{
"submission_id": "aoj_1168_5490233",
"code_snippet": "#include <stdio.h>\n#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for (int i = 0; i < (n); ++i)\n#define Inf 1000000000\n\nstruct dsu {\n\tpublic:\n\tdsu() : _n(0) {}\n\texplicit dsu(int n) : _n(n), parent_or_size(n, -1) {}\n\n\tint ... |
aoj_1171_cpp | Problem G:
Laser Beam Reflections
A laser beam generator, a target object and some mirrors are
placed on a plane.
The mirrors stand upright on the plane,
and both sides of the mirrors are flat and can reflect beams.
To point the beam at the target,
you may set the beam to several directions because of different reflec... | [
{
"submission_id": "aoj_1171_10851220",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <complex>\n#include <vector>\n#include <cmath>\n#define sz(x) int((x).size())\n#define mkp make_pair\n#define frs first\n#define scn second\n#define phb push_back\n#define ppb pop_back\nusing namespa... |
aoj_1169_cpp | Problem E:
The Most Powerful Spell
Long long ago, there lived a wizard who invented a lot of "magical patterns."
In a room where one of his magical patterns is drawn on the floor,
anyone can use magic by casting magic spells!
The set of spells usable in the room depends on the drawn magical pattern.
Your task is to com... | [
{
"submission_id": "aoj_1169_10853923",
"code_snippet": "/*\n* Copyright (C) 2015 All rights reserved.\n* \n* filename: 9019.cpp\n* author: doublehh\n* e-mail: sserdoublehh@foxmail.com\n* create time: 2015-06-08\n* last modified: 2015-06-08 16:08:16\n*/\n#include<bits/stdc++.h>\nusing namespac... |
aoj_1173_cpp | The Balance of the World
The world should be finely balanced. Positive vs. negative,
light vs. shadow, and left vs. right brackets.
Your mission is to write a program that judges whether a string is balanced
with respect to brackets so that we can observe the balance of the
world.
A string that will be given to the pr... | [
{
"submission_id": "aoj_1173_9723425",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n\twhile(true)\n\t{\n\t\tstring s;\n\t\tgetline(cin,s);\n\t\tif(s==\".\")\n\t\t\tbreak;\n\t\tvector <int> v;\n\t\tbool ans=true;\n\t\tfor(int i=0; i<s.size(); i++)\n\t\t{\n\t\t\tif(s[i]=='... |
aoj_1170_cpp | Problem F:
Old Memories
In 4272 A.D., Master of Programming Literature, Dr. Isaac Cornell Panther-Carol,
who has miraculously survived through the three World Computer Virus Wars and reached 90 years old this year,
won a Nobel Prize for Literature.
Media reported every detail of his life.
However, there was one thing t... | [
{
"submission_id": "aoj_1170_8289540",
"code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint D, N;\nlong long val1[49], pow1[49];\nlong long val2[49], pow2[49];\nstring S;\nstring T[39];\nstring U = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ.\";\nstr... |
aoj_1177_cpp | Watchdog Corporation
In Northern Kyushu, you are running a company
which rents watchdogs in response to the customers' order.
The distinguishing point of your service is that you also
install fences to enhance the performance of watchdogs.
The dog is put on a leash, which is tied up to a peg.
You are installing fences ... | [
{
"submission_id": "aoj_1177_1150744",
"code_snippet": "#include <cstdio>\n#include <cmath>\n#include <cstring>\n#include <cstdlib>\n#include <climits>\n#include <ctime>\n#include <queue>\n#include <stack>\n#include <algorithm>\n#include <list>\n#include <vector>\n#include <set>\n#include <map>\n#include <i... |
aoj_1174_cpp | Identically Colored Panels Connection
Dr. Fukuoka has invented fancy panels.
Each panel has a square shape of a unit size and
has one of the six colors, namely, yellow, pink, red, purple, green and blue.
The panel has two remarkable properties.
One property is that, when two or more panels with the same color
are p... | [
{
"submission_id": "aoj_1174_10853966",
"code_snippet": "#include <algorithm>\n#include <cstdio>\n#include <cstring>\n\nusing std::max;\n\nint N, M, target, a[8][8], f, t, ans, x[64], y[64];\n\nint w[10];\n\nvoid copy(int b[8][8], int a[8][8]) {\n\tfor(int i = 0; i < N; ++i) {\n\t\tfor(int j = 0; j < M; ++j... |
aoj_1175_cpp | And Then, How Many Are There?
To Mr. Solitarius, who is a famous solo play game creator, a new idea
occurs like every day.
His new game requires discs of various colors and sizes.
To start with, all the discs are randomly scattered around the
center of a table.
During the play, you can remove a pair of discs of the sam... | [
{
"submission_id": "aoj_1175_10946386",
"code_snippet": "#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<map>\n#include<set>\n#include<string>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\n#define MP(i,j) make_pair(i,j)\ntypedef long long int64;\ntypedef long double real;\... |
aoj_1176_cpp | Planning Rolling Blackouts
Faced with seriously tight power supply-demand balance, the
electric power company for which you are working implemented
rolling
blackouts
in this spring. It divided the servicing area into several
groups of towns, and divided a day into several blackout periods. At
each blackout period... | [
{
"submission_id": "aoj_1176_10866686",
"code_snippet": "#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <iostream>\n#include <algorithm>\nconst int oo=1073741819;\nusing namespace std;\nint n,m,s,w_time;\nint sum[50][50],t[50][50][50][50],a[50][50];\nstruct sta{\n int tot,max;\n}f[50... |
aoj_1178_cpp | A Broken Door
There is a rectangular maze consisting of a number of square rooms
arranged in grid. The maze is surrounded by
walls except for its entry and exit. The entry to the maze is at the
leftmost part of the upper side of the rectangular area, that is, the
upper side of the uppermost leftmost room of the maze i... | [
{
"submission_id": "aoj_1178_10946388",
"code_snippet": "#include<cstring>\n#include<cstdio>\n#include<algorithm>\nusing namespace std;\nint n, m, bak, cl, qx[909], qy[909], dis[33][33], pas[77][77], x, y, dx[4], dy[4], mn[33][33], ans[77][77][2];\nint main()\n{\n\tdx[0] = -1; dy[0] = 0;\n\tdx[1] = 0; dy[1]... |
aoj_1179_cpp | Millennium
A wise king declared a new calendar. "Tomorrow shall be the first day of the calendar, that is, the day 1 of the month 1 of the year 1. Each year consists of 10 months, from month 1 through month 10, and starts from a
big month
. A common year shall start with a big month, followed by
small months
and big ... | [
{
"submission_id": "aoj_1179_10683989",
"code_snippet": "#line 1 \"speedrun.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) {vect... |
aoj_1180_cpp | Recurring Decimals
A decimal representation of an integer can be transformed to another integer by rearranging the order of digits.
Let us make a sequence using this fact.
A non-negative integer
a
0
and the number of digits
L
are given first.
Applying the following rules, we obtain
a
i
+1
from
a
i
.
Express the integer... | [
{
"submission_id": "aoj_1180_10853944",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <vector>\n#include <map>\n#include <queue>\n#include <set>\nusing namespace std;\n#define SZ(v) ((int)(v).size())\n#define... |
aoj_1187_cpp | ICPC Ranking
Your mission in this problem is to write a program
which, given the submission log of an ICPC (International Collegiate Programming Contest),
determines team rankings.
The log is a sequence of records of program submission
in the order of submission.
A record has four fields: elapsed time, team number,
pro... | [
{
"submission_id": "aoj_1187_3560625",
"code_snippet": "#define _CRT_SECURE_NO_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>\... |
aoj_1181_cpp | Biased Dice
Professor Random, known for his research on randomized algorithms, is now conducting an experiment on biased dice. His experiment consists of dropping a number of dice onto a plane, one after another from a fixed position above the plane. The dice fall onto the plane or dice already there, without rotatin... | [
{
"submission_id": "aoj_1181_10609938",
"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 \"\\... |
aoj_1185_cpp | Patisserie ACM
Amber Claes Maes, a patissier, opened her own shop last month.
She decided to submit her work to the International Chocolate
Patissier Competition to promote her shop, and she
was pursuing a recipe of sweet chocolate bars.
After thousands of trials, she finally reached the recipe.
However, the recipe re... | [
{
"submission_id": "aoj_1185_10882539",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nstruct Bimatch{\n vector<vector<int>> g;\n vector<int> d, mc, used, vv;\n Bimatch(int n, int m): g(n), mc(m, -1), used(n){\n }\n void add(int u, int v){\n g[u].push_back(v);\n }\n void bfs(){\n... |
aoj_1183_cpp | Chain-Confined Path
There is a chain consisting of multiple circles on a plane.
The first (last) circle of the chain only intersects with the next (previous) circle,
and each intermediate circle intersects only with the two neighboring circles.
Your task is to find the shortest path that satisfies the following conditi... | [
{
"submission_id": "aoj_1183_10853933",
"code_snippet": "/*\n * Author: xioumu\n * Created Time: 2012/7/20 10:46:25\n * File Name: e.cpp\n * solve: e.cpp\n */\n#include<cstdio>\n#include<cstring>\n#include<cstdlib>\n#include<cmath>\n#include<algorithm>\n#include<string>\n#include<map>\n#include<set>\nusin... |
aoj_1184_cpp | Generic Poker
You have a deck of
N
×
M
cards. Each card in the deck has a rank. The range of ranks is 1 through
M
, and the deck includes
N
cards of each rank.
We denote a card with rank
m
by
m
here.
You can draw a hand of
L
cards at random from the deck.
If the hand matches the given pattern,
some bonus will be reward... | [
{
"submission_id": "aoj_1184_8998859",
"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_1182_cpp | Railway Connection
Tokyo has a very complex railway system.
For example, there exists a partial map of lines and stations
as shown in Figure D-1.
Figure D-1: A sample railway network
Suppose you are going to station D from station A.
Obviously, the path with the shortest distance is A→B→D.
However, the path with the sh... | [
{
"submission_id": "aoj_1182_10852690",
"code_snippet": "/*\n * Author:heroming\n * File:heroming.cpp\n * Time:2012-7-19 9:33:45\n */\n#include <iostream>\n#include <cstdio>\n#include <string>\n#include <cstring>\n#include <cmath>\n#include <algorithm>\n#include <vector>\n#include <queue>\nusing namespace s... |
aoj_1186_cpp | Integral Rectangles
Let us consider rectangles whose height,
h
, and
width,
w
, are both integers. We call such rectangles
integral rectangles
. In this problem, we consider only wide
integral rectangles, i.e., those with
w
>
h
.
We define the following ordering of wide integral rectangles. Given
two wide integral rect... | [
{
"submission_id": "aoj_1186_9327994",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<vector>\nusing namespace std;\nbool solve()\n{\n int H,W;\n cin>>H>>W;\n if(H==0&&W==0)return 0;\n vector<pair<int,int>>bigger;\n auto comp=[](pair<int,int>p,pair<int,int>q)\n {\n ... |
aoj_1188_cpp | Hierarchical Democracy
The presidential election in Republic of Democratia is carried out through multiple stages as follows.
There are exactly two presidential candidates.
At the first stage, eligible voters go to the polls of his/her electoral district.
The winner of the district is the candidate who takes a majority... | [
{
"submission_id": "aoj_1188_10851154",
"code_snippet": "#include <iostream>\n#include <sstream>\n#include <algorithm>\n#include <string>\n#include <vector>\n#include <numeric>\n#define sz(x) int((x).size())\n#define all(x) (x).begin(), (x).end()\n#define phb push_back\nusing namespace std;\n\nint Z;\nstrin... |
aoj_1189_cpp | Prime Caves
An international expedition discovered abandoned Buddhist cave temples
in a giant cliff standing on the middle of a desert. There were many
small caves dug into halfway down the vertical cliff, which were
aligned on square grids. The archaeologists in the expedition were
excited by Buddha's statues in tho... | [
{
"submission_id": "aoj_1189_10852870",
"code_snippet": "#include \"bits/stdc++.h\"\n\n#define REP(i,n) for(ll i=0;i<n;++i)\n#define RREP(i,n) for(ll i=n-1;i>=0;--i)\n#define FOR(i,m,n) for(ll i=m;i<n;++i)\n#define RFOR(i,m,n) for(ll i=n-1;i>=m;--i)\n#define ALL(v) (v).begin(),(v).end()\n#define PB(a) push_... |
aoj_1190_cpp | Anchored Balloon
A balloon placed on the ground is connected to one or more anchors on the ground with ropes.
Each rope is long enough to connect the balloon and the anchor.
No two ropes cross each other.
Figure E-1 shows such a situation.
Figure E-1: A balloon and ropes on the ground
Now the balloon takes off, and you... | [
{
"submission_id": "aoj_1190_10433181",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\n\ntypedef complex<double> Point;\nconst double EPS = 1e-8;\n\nstruct Circle {\n Point p;\n double r;\n};\n\n// 円の交点を求めるメソッド\npair<Point, Point> cc_cross(const Circle& c1, c... |
aoj_1193_cpp | Chain Disappearance Puzzle
We are playing a puzzle.
An upright board with
H
rows by 5 columns of cells, as shown in
the figure below, is used in this puzzle.
A stone engraved with a digit, one of 1 through 9, is placed in each of
the cells.
When three or more stones in horizontally adjacent cells are engraved
with t... | [
{
"submission_id": "aoj_1193_9527420",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nll MOD = 1'000'000'007;\nll inf = (1LL << 62);\n\n// clang-format off\nauto getll(){ll n; cin >> n; return n;}\nauto getstr(){string s; cin >> s; return s;}\nauto getdb(){double n; ... |
aoj_1191_cpp | Rotate and Rewrite
Two sequences of integers
A:
A
1
A
2
...
A
n
and
B:
B
1
B
2
...
B
m
and
a set of
rewriting rules
of the form
"
x
1
x
2
...
x
k
→
y
"
are given.
The following transformations on each of the sequences are allowed
an arbitrary number of times in an arbitrary order independently.
Rotate
:
Moving the fi... | [
{
"submission_id": "aoj_1191_10335939",
"code_snippet": "// AOJ #1191 Rotate and Rewrite\n// 2025.3.30\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define NMAX 50\nconst int BAS = 1000;\nint A[NMAX+5], B[NMAX+5];\nbool dpA[NMAX+5][NMAX+5][600];\nbool dpB[NMAX+5][NMAX+5][600];\nint sudpA[NMAX+5][NMA... |
aoj_1194_cpp | Vampire
Mr. C is a vampire. If he is exposed to the sunlight directly, he turns
into ash.
Nevertheless, last night, he attended to the meeting of Immortal and
Corpse Programmers
Circle, and he has to go home in the near dawn.
Fortunately, there are many tall buildings around Mr. C's home, and
while the sunlight is b... | [
{
"submission_id": "aoj_1194_10850501",
"code_snippet": "#include <cstdio>\n#include <cmath>\n#include <algorithm>\n#include <vector>\n\nusing namespace std;\n\nconst double EPS = 1e-9;\nbool EQ(double a, double b) { return abs(a - b) < EPS; }\n\ndouble getHeight(double r, double x) {\n\treturn sqrt(r * r -... |
aoj_1195_cpp | Encryption System
A programmer developed a new encryption system.
However, his system has an issue that
two or more distinct strings are `encrypted' to the same string.
We have a string encrypted by his system.
To decode the original string, we want to enumerate all the candidates of the string before the encryption.
... | [
{
"submission_id": "aoj_1195_10848117",
"code_snippet": "#include <stdio.h>\n#include <memory.h>\n#include <string.h>\n#define MAX 30\n\nchar ch[MAX], p[MAX];\nint len, b[MAX], ac[30], cnt;\nchar ch2[1050000][22];\n\nvoid dfs(int now, int sw){\n\tint i;\n\tb[now]=sw;\n\tif (now==len){\n\t\tfor (i=1;i<=len;i... |
aoj_1192_cpp | Tax Rate Changed
VAT (value-added tax) is a tax imposed at a certain rate proportional to the sale price.
Our store uses the following rules to calculate the after-tax prices.
When the VAT rate is
x
%,
for an item with the before-tax price of
p
yen,
its after-tax price of the item is
p
(100+
x
) / 100 yen, fractions ... | [
{
"submission_id": "aoj_1192_10851356",
"code_snippet": "#include <cstdio>\n#include <algorithm>\n\nusing namespace std;\n\nint main(void) {\n\tint x, y, s;\n\twhile(scanf(\"%d %d %d\", &x, &y, &s), !(x == 0 and y == 0 and s == 0)) {\n\t\tint ans = 0;\n\n\t\tfor(int i = 1; i < s; i++) {\n\t\t\tint j = s - i... |
aoj_1196_cpp | Bridge Removal
ICPC islands once had been a popular tourist destination.
For nature preservation, however, the government decided to prohibit entrance to the islands,
and to remove all the man-made structures there.
The hardest part of the project is to remove all the bridges connecting the islands.
There are
n
islands... | [
{
"submission_id": "aoj_1196_10853372",
"code_snippet": "#include <stdio.h>\n#include <vector>\n#define MAX 810\n\nint n, p[MAX], d[MAX], check[MAX];\nint val, answer=2147483647;\nstruct data{\n\tint go, dis;\n};\nstd::vector<data> vec[MAX];\nint dy[MAX][2];\n\nvoid reset(void){\n\tint i;\n\tanswer=21474836... |
aoj_1197_cpp | A Die Maker
The work of die makers starts early in the morning.
You are a die maker.
You receive orders from customers, and make various kinds of dice every day.
Today, you received an order of a cubic die with six numbers
t
1
,
t
2
, ...,
t
6
on whichever faces.
For making the ordered die, you use a tool of flat-board... | [
{
"submission_id": "aoj_1197_9857905",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v)... |
aoj_1198_cpp | Don't Cross the Circles!
There are one or more circles on a plane.
Any two circles have different center positions and/or different radiuses.
A circle may intersect with another circle,
but no three or more circles have areas nor points shared by all of them.
A circle may completely contain another circle or two circle... | [
{
"submission_id": "aoj_1198_9340740",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing Real = long double;\nusing Point = complex<Real>;\nconst Real EPS = 1e-9, PI = acos(-1);\n\ninline bool eq(Real a, Real b) {\n return fabs(b - a) < EPS;\n}\n\nPoint operator*(const Point &p, cons... |
aoj_1200_cpp | Problem A:
Goldbach's Conjecture
Goldbach's Conjecture:
For any even number
n
greater than or equal to 4, there exists at least one pair of prime numbers
p
1
and
p
2
such that
n
=
p
1
+
p
2
.
This conjecture has not been proved nor refused yet. No one is sure whether this conjecture actually holds. However, one can fin... | [
{
"submission_id": "aoj_1200_11059833",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,a,b) for(int i=(a);i<(b);i++)\n\nvector<int> ans_table(const int LIM=(1<<16)){\n vector<int>res(LIM);\n vector<int> isP(LIM,1);\n vector<int>primes;\n isP[... |
aoj_1202_cpp | Problem C:
Mobile Phone Coverage
A mobile phone company ACMICPC (Advanced Cellular, Mobile, and Internet-Connected Phone Corporation) is planning to set up a collection of antennas for mobile phones in a city called Maxnorm. The company ACMICPC has several collections for locations of antennas as their candidate plans,... | [
{
"submission_id": "aoj_1202_3709040",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\n// #define int ll\nusing PII = pair<ll, ll>;\n\n#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define ALL(x) x.begin(), x.end()\n\ntempl... |
aoj_1201_cpp | Problem B:
Lattice Practices
Once upon a time, there was a king who loved beautiful costumes very much. The king had a special cocoon bed to make excellent cloth of silk. The cocoon bed had 16 small square rooms, forming a 4 × 4 lattice, for 16 silkworms. The cocoon bed can be depicted as follows:
The cocoon bed can be... | [
{
"submission_id": "aoj_1201_9634679",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\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())\n#define UB(A,x) (upper_bound... |
aoj_1214_cpp | Problem G:
Walking Ant
Ants are quite diligent. They sometimes build their nests beneath flagstones.
Here, an ant is walking in a rectangular area tiled with square flagstones, seeking the only hole leading to her nest.
The ant takes exactly one second to move from one flagstone to another. That is, if the ant is on th... | [
{
"submission_id": "aoj_1214_5976490",
"code_snippet": "#include<iostream>\n#include<cstring>\n#include<cstdio>\n#include<sstream>\n#include<algorithm>\n#include<cstdlib>\n#include<queue>\n#include<set>\n#include<map>\n#include<cmath>\n#include<ctime>\n#include<stack>\n#include<functional>\n#define INF 2100... |
aoj_1203_cpp | Problem D:
Napoleon's Grumble
Legend has it that, after being defeated in Waterloo, Napoleon Bonaparte, in retrospect of his days of glory, talked to himself "Able was I ere I saw Elba." Although, it is quite doubtful that he should have said this in English, this phrase is widely known as a typical
palindrome
.
A pali... | [
{
"submission_id": "aoj_1203_1892938",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<string>\n#include<algorithm>\t\n#include<map>\n#include<set>\n#include<utility>\n#include<cmath>\n#include<cstring>\n#include<queue>\n#include<cstdio>\n#include<sstream>\n#include<iomanip>\n#define loop(i,... |
aoj_1208_cpp | Problem A:
Rational Irrationals
Rational numbers are numbers represented by ratios of two integers. For a prime number
p
, one of the elementary theorems in the number theory is that there is no rational number equal to √
p
. Such numbers are called irrational numbers. It is also known that there are rational numbers a... | [
{
"submission_id": "aoj_1208_8658705",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define overload4(_1, _2, _3, _4, name, ...) name\n#define rep1(n) for(int i = 0; i < (int)(n); ++i)\n#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)\n#define rep3(i, a, b) for(int i = (a); i < (... |
aoj_1204_cpp | Problem E:
Pipeline Scheduling
An
arithmetic pipeline
is designed to process more than one task simultaneously in an overlapping manner. It includes function units and data paths among them. Tasks are processed by
pipelining
: at each clock, one or more units are dedicated to a task and the output produced for the task... | [
{
"submission_id": "aoj_1204_2581073",
"code_snippet": "#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\ntypedef long long int ll;\ntypedef unsigned lo... |
aoj_1218_cpp | Problem C:
Push!!
Mr. Schwarz was a famous powerful pro wrestler. He starts a part time job as a warehouseman.
His task is to move a cargo to a goal by repeatedly pushing the cargo in the warehouse, of course,
without breaking the walls and the pillars of the warehouse.
There may be some pillars in the warehouse. Excep... | [
{
"submission_id": "aoj_1218_3807528",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\n\nconstexpr long double EPS = 1e-15;\nconst long double PI = acos(-1);\nconstexpr int inf = 2e9;\nconstexpr ll INF = 2e18;\nconstexpr ll MOD = 1e9+7... |
aoj_1216_cpp | Problem A:
Lost in Space
William Robinson was completely puzzled in the music room; he could not find his triangle in
his bag. He was sure that he had prepared it the night before. He remembered its clank when
he had stepped on the school bus early that morning. No, not in his dream. His triangle was
quite unique: no t... | [
{
"submission_id": "aoj_1216_3807101",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <string>\n#include <numeric>\n\n#define REP(i, a, b) for (int i = int(a); i < int(b); i++)\nusing namespace std;\ntypedef long long int ll;\n\n// clang-format off\n#ifdef _DEBUG_\n#... |
aoj_1209_cpp | Problem B:
Square Coins
People in Silverland use square coins. Not only they have square shapes but also their values are square numbers. Coins with values of all square numbers up to 289 (= 17
2
), i.e., 1-credit coins, 4-credit coins, 9-credit coins, ..., and 289-credit coins, are available in Silverland.
There are f... | [
{
"submission_id": "aoj_1209_2539223",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint count( int S[], int m, int n )\n{\n if (n == 0)\n return 1;\n if (n < 0)\n return 0;\n if (m <=0 && n >= 1)\n return 0;\n return count( S, m - 1, n ) + count( S, m, n... |
aoj_1215_cpp | Problem H:
Co-occurrence Search
A huge amount of information is being heaped on WWW. Albeit it is not well-organized, users can browse WWW as an unbounded source of up-to-date information, instead of consulting established but a little out-of-date encyclopedia. However, you can further exploit WWW by learning more abou... | [
{
"submission_id": "aoj_1215_2683439",
"code_snippet": "#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\n#include <time.h>\ntypedef long long int ll;\n... |
aoj_1217_cpp | Problem B:
Family Tree
A professor of anthropology was interested in people living in isolated islands and their history.
He collected their family trees to conduct some anthropological experiment. For the experiment,
he needed to process the family trees with a computer. For that purpose he translated them
into text f... | [
{
"submission_id": "aoj_1217_2170790",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint dep[100010];\nint par[100010][19];\nvector<int> g[100010];\nvoid dfs(int v,int u,int d){\n dep[v]=d;\n for(int i=0; i<g[v].size(); i++){\n int w=g[v][i];if(w==u) continue;\n par[w][0]=v;dfs(w,... |
aoj_1221_cpp | Problem F:
Numoeba
A scientist discovered a strange variation of amoeba. The scientist named it
numoeba
. A numoeba, though it looks like an amoeba, is actually a community of cells, which always forms a tree.
The scientist called the cell
leader
that is at the root position of the tree. For example, in Fig. 1, the lea... | [
{
"submission_id": "aoj_1221_1092280",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<tuple>\n#include<algorithm>\nusing namespace std;\n\nconst int MOD = 12345678;\nconst int NIL = -1;\n\nclass Numoeba {\npublic:\n Numoeba(const int n) :max_cell_(1), root_(0) {create_cell(n);}\n tupl... |
aoj_1227_cpp | Problem D:
77377
At the risk of its future, International Cellular Phones Corporation (ICPC) invests its resources in developing new mobile phones, which are planned to be equipped with Web browser, mailer, instant messenger, and many other advanced communication tools. Unless members of ICPC can complete this stiff jo... | [
{
"submission_id": "aoj_1227_746368",
"code_snippet": "// start: 10:34\n// stop: 10:43\n// start: 10:50\n// stop: 11:22\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <climits>\n#include <cctype>\n#include <algorithm>\n#include <numeric>\n#include <iostream>\n#include <string>\n#include ... |
aoj_1219_cpp | Problem D:
Pump up Batteries
Bill is a boss of security guards. He has pride in that his men put on wearable computers on their
duty. At the same time, it is his headache that capacities of commercially available batteries are
far too small to support those computers all day long. His men come back to the office to cha... | [
{
"submission_id": "aoj_1219_7227174",
"code_snippet": "#include <iostream>\n#include <queue>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nstruct E{\n\tint ot;\n\tint nt;\n\tint t;\n\tint no;\n\tint s;\n\tbool operator<(const E& e)const{\n\t\tif(t!=e.t)return t>e.t;\n\t\treturn no>e.no;... |
aoj_1225_cpp | Problem B:
e-Market
The city of Hakodate recently established a commodity exchange market. To participate in the market, each dealer transmits through the Internet an order consisting of his or her name, the type of the order (buy or sell), the name of the commodity, and the quoted price.
In this market a deal can be m... | [
{
"submission_id": "aoj_1225_1083098",
"code_snippet": "#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n\n#include <iostream>\n#include <cstdio>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include... |
aoj_1222_cpp | Problem G:
Telescope
Dr. Extreme experimentally made an extremely precise telescope to investigate extremely curi- ous phenomena at an extremely distant place. In order to make the telescope so precise as to investigate phenomena at such an extremely distant place, even quite a small distortion is not allowed. However,... | [
{
"submission_id": "aoj_1222_3709885",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\n// #define int ll\nusing PII = pair<ll, ll>;\n\n#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define ALL(x) x.begin(), x.end()\n\ntempl... |
aoj_1226_cpp | Problem C:
Fishnet
A fisherman named Etadokah awoke in a very small island. He could see calm, beautiful and blue sea around the island. The previous night he had encountered a terrible storm and had reached this uninhabited island. Some wrecks of his ship were spread around him. He found a square wood-frame and a long... | [
{
"submission_id": "aoj_1226_3043409",
"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-10;\nconst double INF = 1e12;\n#define EQ(n,m) (abs((n)-(m)) < EPS)\n#... |
aoj_1224_cpp | Problem A:
Starship Hakodate-maru
The surveyor starship Hakodate-maru is famous for her two fuel containers with unbounded capacities. They hold the same type of atomic fuel balls.
There, however, is an inconvenience. The shapes of the fuel containers
#
1 and
#
2 are always cubic and regular tetrahedral respectively. B... | [
{
"submission_id": "aoj_1224_4858248",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n int n;\n while(cin >>n,n){\n int ans = 0;\n for(int i=0;i*i*i<151200; i++){\n int sum = 0;\n for(int j=0; sum <= n ;j++){\n ans = ma... |
aoj_1229_cpp | Problem F:
Young, Poor and Busy
Ken and Keiko are young, poor and busy. Short explanation: they are students, and ridden with part-time jobs. To make things worse, Ken lives in Hakodate and Keiko in Tokyo. They want to meet, but since they have neither time nor money, they have to go back to their respective jobs immed... | [
{
"submission_id": "aoj_1229_2940627",
"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 NUM 100\n#define BASE 480\n#define MAX 600\n\nenum T... |
aoj_1228_cpp | Problem E:
Beehives
Taro and Hanako, students majoring in biology, have been engaged long in observations of beehives. Their interest is in finding any egg patterns laid by queen bees of a specific wild species. A queen bee is said to lay a batch ofeggs in a short time. Taro and Hanako have never seen queen bees laying... | [
{
"submission_id": "aoj_1228_2649936",
"code_snippet": "#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\n#include <time.h>\ntypedef long long int ll;\n... |
aoj_1232_cpp | Problem A:
Calling Extraterrestrial Intelligence Again
A message from humans to extraterrestrial intelligence was sent through the Arecibo radio telescope in Puerto Rico on the afternoon of Saturday November l6, l974. The message consisted of l679 bits and was meant to be translated to a rectangular picture with 23 × 7... | [
{
"submission_id": "aoj_1232_10896784",
"code_snippet": "#include<bits/stdc++.h>\n// #include<atcoder/all>\n// #include<boost/multiprecision/cpp_int.hpp>\n\nusing namespace std;\n// using namespace atcoder;\n// using bint = boost::multiprecision::cpp_int;\nusing ll = long long;\nusing ull = unsigned long lo... |
aoj_1230_cpp | Problem G:
Nim
Let's play a traditional game Nim. You and I are seated across a table and we have a hundred stones on the table (we know the number of stones exactly). We play in turn and at each turn, you or I can remove one to four stones from the heap. You play first and the one who removed the last stone loses.
In ... | [
{
"submission_id": "aoj_1230_9710661",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint n;\nmap <pair <int, int>, int> mp;\n\nbool get_res(vector <int> &v, int id, int s) {\n if(s == 0) return 1;\n if(mp[{id, s}]) return mp[{id, s}];\n\n bool res = 0;\n for(int i = 1; i <= ... |
aoj_1237_cpp | Problem F:
Shredding Company
You have just been put in charge of developing a new shredder for the Shredding Company. Although a ``normal'' shredder would just shred sheets of paper into little pieces so that the contents would become unreadable, this new shredder needs to have the following unusual basic characteristi... | [
{
"submission_id": "aoj_1237_3989783",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n//repetition\n#define FOR(i,a,b) for(ll i=(a);i<(b);++i)\n#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)\n\n//container util\n#define all(x) (x).begin(),(x).end()\n\n//typedef\ntypedef long long ll;\... |
aoj_1239_cpp | Problem H:
Viva Confetti
Do you know
confetti
? They are small discs of colored paper, and people throw them around during parties or festivals. Since people throw lots of confetti, they may end up stacked one on another, so there may be hidden ones underneath.
A handful of various sized confetti have been dropped on a... | [
{
"submission_id": "aoj_1239_4761256",
"code_snippet": "#include<iostream>\n#include<cfloat>\n#include<cassert>\n#include<cmath>\n#include<cstdio>\n#include<vector>\n#include<set>\n#include<algorithm>\n\nusing namespace std;\n\n#define EPS (1e-15)\n#define equals(a, b) (fabs((a) - (b)) < EPS )\n#define dle(... |
aoj_1234_cpp | Problem C:
GIGA Universe Cup
Following FIFA World Cup, a larger competition called ``GIGA Universe Cup'' is taking place somewhere in our universe. Both FIFA World Cup and GIGA Universe Cup are two rounds competitions that consist of the first round, also known as ``group league,'' and the second called ``final tournam... | [
{
"submission_id": "aoj_1234_4943973",
"code_snippet": "#include <stdio.h>\n#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for (int i = 0; i < (n); ++i)\n#define Inf 1000000000\n\nvector<double> p(9);\n\nvector<vector<string>> get(vector<pair<pair<string,string>,pair<int,int>>> S){\n\n\tma... |
aoj_1233_cpp | Problem B:
Equals are Equals
Mr. Simpson got up with a slight feeling of tiredness. It was the start of another day of hard work. A bunch of papers were waiting for his inspection on his desk in his office. The papers contained his students' answers to questions in his Math class, but the answers looked as if they were... | [
{
"submission_id": "aoj_1233_8484392",
"code_snippet": "#include <bits/stdc++.h>\n\nconstexpr int W = 26;\nusing Var = std::array<int, W>;\nstd::ostream& operator<<(std::ostream& os, const Var& var) {\n os << '(';\n for (int i = 0; i < W; i++) {\n if (var[i] == 0) continue;\n os << '(' <... |
aoj_1238_cpp | Problem G:
True Liars
After having drifted about in a small boat for a couple of days, Akira Crusoe Maeda was finally cast ashore on a foggy island. Though he was exhausted and despaired, he was still fortunate to remember a legend of the foggy island, which he had heard from patriarchs in his childhood. This must be t... | [
{
"submission_id": "aoj_1238_5010193",
"code_snippet": "#include<iostream>\n#include<cstdio>\n#include<cstring>\nusing namespace std;\n\nconst int N = 2010;\nint fa[N], siz[N], a[N], f[N][N], pre[N][N], ans[N], b[N], c[N]; \nbool vis[N], in[N];\nint findfa(int x) {\n\treturn fa[x] == x ? x : fa[x] = findfa(... |
aoj_1241_cpp | Problem B:
Lagrange's Four-Square Theorem
The fact that any positive integer has a representation as the sum of at most four positive
squares (i.e. squares of positive integers) is known as Lagrange’s Four-Square Theorem. The
first published proof of the theorem was given by Joseph-Louis Lagrange in 1770. Your mission
... | [
{
"submission_id": "aoj_1241_10895268",
"code_snippet": "#include<bits/stdc++.h>\n// #include<atcoder/all>\n// #include<boost/multiprecision/cpp_int.hpp>\n\nusing namespace std;\n// using namespace atcoder;\n// using bint = boost::multiprecision::cpp_int;\nusing ll = long long;\nusing ull = unsigned long lo... |
aoj_1247_cpp | Problem H:
Monster Trap
Once upon a time when people still believed in magic, there was a great wizard Aranyaka
Gondlir. After twenty years of hard training in a deep forest, he had finally mastered ultimate
magic, and decided to leave the forest for his home.
Arriving at his home village, Aranyaka was very surprised a... | [
{
"submission_id": "aoj_1247_8388160",
"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_1243_cpp | Problem D:
Weather Forecast
You are the God of Wind.
By moving a big cloud around, you can decide the weather: it invariably rains under the cloud,
and the sun shines everywhere else.
But you are a benign God: your goal is to give enough rain to every field in the countryside,
and sun to markets and festivals. Small hu... | [
{
"submission_id": "aoj_1243_10865810",
"code_snippet": "#include<cstdio>\n#include<iostream>\n#include<cstring>\n#include<cmath>\n#include<cstdlib>\n#include<vector>\n#include<stack>\n#include<algorithm>\n#include<queue>\n#include<string>\n#define OK 1\n#define INF 2147483647\n#define LINF 9223372036854775... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.